Topic

Name M.Tech 2nd Year Software Engg Reg. No: xx

Department of Computer Science and Engineering Motilal Nehru National Institute of Technology, Allahabad.

Contents
1 Introduction 2 Motivational Example 3 Issues Focused 4 Approach used to Tackel the Issue 4.1 4.2 4.3 4.4 The Geocast Framework . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Flat Geocast . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . The CD-P Heuristic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Proposed Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1 1 1 1 2 4 6 7

5 Conclusion

Introduction

Mobile adhoc network is a infrastructure less network. It is established for temporary use. Each node is free to move in any direction. Whenever node gets data that is unrelated to its own use, it forwards data. So node acts as a router in manet. Geocast refers to the delivery of information to a group of nodes identied by their geographical locations. Geocast is a specialized form of multicast.

Motivational Example

In Mobile adhoc network, there is lack of infrastructure. Adhoc network is mostly established for temporary use. Concept of geocasting in manet is used in many situations. In emergency communication for disaster response, this concept is used. For example, one can establish connections with mobile devices in a burning building. Concept of geocasting is also used in trac services [6]. There are many situations when same information need to send more than one geocast regions [8]. During an urgent order by a commanding ocer on the battleeld, Same information need to send more than one geocast regions.

Issues Focused

There are many geocast protocols available. All have problem of either reliability or scalability. Some protocol uses simple ooding [5] which is not scalable and some protocol uses simple broadcast which is not reliable. All geocast protocol mostly focused on sending information to single geocast region only but there are many situations arises when we have to send same information to multiple geocast regions. If we use same geocast protocol that is used for single geocast region then source node has to initiate multiple transmissions for same information. Due to redundant packet transmission, performance starts degrading.

4
4.1

Approach used to Tackel the Issue

The Geocast Framework

A geocast header of packet contains some information that is useful for propagating packet. This header includes an application type, geocastID(gID(p)), location of sender and the 1

center of the targeted region, CGR(p). GeocastID is a unique identier assigned by sender.

Figure 1: Geocast framework

c Robert J. Hall, An improved Geocast for Mobile Ad Hoc Networks, IEEE Transcations on Mobile Computing, VOL. 10, NO. 2, FEBRUARY 2011, pp. 254-266

When node receives packet from medium, it checks if it has heard it previously having same geocast id. If not, it creates a new record for the ID and enqueues packet for retransmission. Any packet that is received from local application software is allocated a new geocast id. When packet reaches at the head of the queue, a heuristics check is performed. If passed, the packet is transmitted otherwise discarded. Following structure is used for heuristics check: Pass(p) InFwdZone?(p) (h1 (p) h2 (p) . . . ) Node must be in forwarding zone [3] physically and one of heuristics must be passed.

4.2

Flat Geocast

Flat Geocast [4] uses two heuristics: MinTrans(M) and Threshold(T). hM counts the number of transmissions heard for each geocast id. hM (p) is true if and only if this count is less than M. 2

hT is based on the location of each transmission heard. hT (p) is true if and only if closest among all transmitters of packets are at least a distance T away.

Figure 2: Geocast transmission sequence

c Robert J. Hall, An improved Geocast for Mobile Ad Hoc Networks, IEEE Transcations on Mobile Computing, VOL. 10, NO. 2, FEBRUARY 2011, pp. 254-266.

In Fig. 2, transmission sequence for M=2 and T=40% of radio range is shown. Here the geocast originator is node B. First transmission reaches to nodes A and C. Node A is out of forwarding zone. So it does not retransmit but due to M heuristics, node C retransmits packets which reaches to nodes D and A. D and E retransmits it but F does not because Es transmission is to close for hT and F already heard 2 transmissions. Flat geocast is more reliable than simple broadcast and more scalable than simple ooding but it exposed weakness in case of urban scenario.

Figure 3: A geocast dicult for at geocast to handle

c Robert J. Hall, An improved Geocast for Mobile Ad Hoc Networks, IEEE Transcations on Mobile Computing, VOL. 10, NO. 2, FEBRUARY 2011, pp. 254-266.

As shown in Fig. 3, node 1 wants to send information to dark circled geocast region. Transmission range of node is assumed to be 3 blocks. Transmission originator is node 1 which is heard by everyone on street A. Node 2 retransmit it due to M heuristic. Node 3 is beyond the T heuristic distance hence node 3 retransmit the message. All the transmission heard by the nodes on street A. Nodes on street B cant hear any transmission. Hence geocast fails to reach geocast region.

4.3

The CD-P Heuristic

To solve above problem, we use CD-P heuristics which is more reliable and more scalable. 1. The Center Distance(CD) Heuristic Each time a node hears a transmission of a Geocast packet p for geocast ID i, it calculates the distance from the transmitter of P to the center of the geocast region CGR(p). If this distance is minimum of all the distances for all the transmissions heard with geocast id i, then it is recorded as CDist(i). This approach adds new heuristic, hCD . hCD (p) is true if and only if nodes own distance to CGR(p) is less than CDist(i). Pass(p) InFwdZone?(p) [hT (p) hM (p) hCD (p)]

Figure 4: Geocast transmission sequence using CD heuristic

c Robert J. Hall, An improved Geocast for Mobile Ad Hoc Networks, IEEE Transcations on Mobile Computing, VOL. 10, NO. 2, FEBRUARY 2011, pp. 254-266.

We execute same urban scenario as before but with nodes executing the CD heuristic as well. First three transmissions are same as before. Node 4 retransmits the message because it is closer to CGR(p) than the previous three transmitters. This transmission is heard by the nodes on street 2 and hence message reaches to geocast region. This approach still has scalability problem. 4

As shown in Fig. 5, all nodes originate distinct geocast to geocast region. Here the order of medium access is DBCA. In this example, the M and T heuristics are not operating. All node places its geocast in its queue; packet a in As queue, b in Bs queue, etc. According to the medium access order, D transmits its packet rst which is placed in queue at each other node. Now B transmits packet b. Now C and A transmit its packet. Now D gets chance again to transmit. It is closer to CGR(b) than B itself. Hence D transmits packet b. Now for node b, it is farther from CGR(d) than D itself. Hence it cancels packet d and same way packet c also but it is closer to CGR(a) than A. Hence B transmits packet a. Hence continue in this way, total 9 transmissions are produced. Here node D has to transmit all the transmissions. Hence long queue wait at D. To remove this problem, Priority Queuing is added.

Figure 5: CD transmission order

c Robert J. Hall, An improved Geocast for Mobile Ad Hoc Networks, IEEE Transcations on Mobile Computing, VOL. 10, NO. 2, FEBRUARY 2011, pp. 254-266.

2. Adding Priority Queuing To solve scalability problem, each node prioritizes its transmit queue. For each packet in a nodes transmit queue, Priority Prio is assigned as follows. For any non-geocast packet, Prio=0. For geocast packet, Prio(p) = max(0, CDist(gID(p))-d(p)), where d(p) = distance from the node to CGR(p). Here, those packets are transmitted sooner that can most quickly move towards the center of their geocast region. As shown in Fig. 6, rst D transmits its packet d. B transmits b and cancels its copy of d, since d was already transmitted by D which is closer to CGR(d). Now C transmits its 5

copy of b not c and d because b is of higher priority compare to d and c. A transmits packet a and canceling copies of b and d. Hence continue in this way, total 9 transmissions are produced. If number of nodes is 5 then CD produces 14 transmissions and CD-P produces 10 transmissions.Hence as the number of nodes increases,CD-P improves dramatically over CD.

Figure 6: CD-P transmission order

c Robert J. Hall, An improved Geocast for Mobile Ad Hoc Networks, IEEE Transcations on Mobile Computing, VOL. 10, NO. 2, FEBRUARY 2011, pp. 254-266.

CD-P heuristics basically used to send information to single geocast region. To send same information to multiple geocast regions, fermat point concept is used. Fermat Point: A, B, C are three given points. Fermat Point P is a point inside a plane such that P A + P B + P C becomes minimum.

4.4

Proposed Schemes

1. Simple Region Chaining Scheme: As shown in Fig. 7a, regions are visited sequentially. Source sends geocast packets toward the central point of rst region. When any node in the rst region receives packet it start local ooding and forwards packet to next region. In this scheme, latency will increase as number of regions increase. 2. Basic Fermat Point Based Scheme: As shown in Fig. 7b, rst virtual triangle is created based on geographical location of two 6

Figure 7: Proposed Schemes

c Sung-Hee Lee and Young-Bae Ko, Ecient Geocasting With Multi-Target Regions in Mobile Multi-Hop Wireless Networks, Wireless Networks Journal, VOL. 16, Issue 5, JULY 2010, pp. 1253-1262.

geocast regions and source node. After that source node computes Fermat point and sends packets toward the location of Fermat point. Fermat Point forwards packet to each geocast region separately. 3. Multiple Fermat Point Scheme: As shown in Fig. 7c, this scheme divides the geocast regions into smaller group with each group contains maximum two geocast regions. Now nd fermat point for each group and sender sends packets toward the location of each fermat point. Fermat point forwards the packets to each geocast regions. 4. Fermat Point Chaining Scheme: As shown in Fig. 7d, rst select two geocast regions randomly. Now decide fermat point for two geocast regions and source node. Now for third geocast region, construct triangle between source node, rst fermat point and third geocast region. In this scheme, source only transmit packets once regardless of the number of geocast regions.

Conclusion

CD-P is a novel heuristic. There is a scalability problem in CD heuristic. CD-P heuristic performs better than CD heuristic. CD-P heuristic is scalable as well as reliable. For multiple geocast regions, fermat point concept is used. Here optimal shred path is created to reach multiple geocast regions. This scheme is reliable as well as ecient in terms of network overhead and latency.

References
[1] Robert J. Hall, An improved Geocast for Mobile Ad Hoc Networks, IEEE Transcations on Mobile Computing, vol. 10, no. 2, February 2011, pp. 254-266, http://ieeexplore. ieee.org/stamp/stamp.jsp?tp=&arnumber=5439000. [2] Sung-Hee Lee and Young-Bae Ko, Ecient Geocasting With Multi-Target Regions in Mobile Multi-Hop Wireless Networks, Wireless Networks Journal, vol. 16, Issue 5, July 2010, pp. 1253-1262, http://dl.acm.org/citation.cfm?id=1830986.1830991&coll= DL&dl=ACM&CFID=38547576&CFTOKEN=72191600. [3] Y.-B. Ko and N. Vaidya, Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms, Proc. Second IEEE Workshop Mobile Computer Systems and Applications, pp. 101-110, February 1999, http://ieeexplore.ieee.org/stamp/stamp.jsp? tp=&arnumber=749282. [4] R.J. Hall and J. Auzins, A Tiered Geocast Protocol for Long Range Mobile Ad Hoc Networking, Proc. IEEE Military Comm. Conf. (MILCOM 06), pp. 1-8, October 2006, http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4086722. [5] C. Maihofer, A Survey of Geocast Routing Protocols, IEEE Comm. Surveys and Tutorials, vol. 6, no. 2, pp. 32-42, 2004, http://ieeexplore.ieee.org/stamp/stamp.jsp? tp=&arnumber=5342238. [6] R. Morris, J. Jannotti, F. Kaashoek, J. Li, and D. Decouto, Carnet: A Scalable Ad Hoc Wireless Network System, Proc. Ninth Workshop ACM SIGOPS European Workshop, pp. 61-65, 2000, http://dl.acm.org/citation.cfm?id=566726.566741&coll=DL&dl= ACM&CFID=47906636&CFTOKEN=46121329. [7] J. C. Navas, T. Imielinski, Geocast - geographic addressing and routing, ACM/IEEE Int. Conf. on Mobile Computing and Networking (MobiCom97), September 1997, [8] Y.-B. Ko and N. Vaidya, Flooding-based geocasting protocols for mobile ad hoc networks, Mobile Networks and Applications Journal, vol. 7, Issue 6, pp. 471-480, December 2002, http://dl.acm.org/citation.cfm?id=603297.603302&coll=DL&dl=ACM&CFID= 38547576&CFTOKEN=72191600.