B. Karp and H. Kung. Greedy perimeter stateless routing for wireless networks. In Mobicom, August 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of decentralized routing that are of interest to other, related areas of study. For instance, decentralized routing is of interest to the ad hoc networking community, where routing algorithms have been proposed that are remarkably similar to the decentralized algorithms that Kleinberg studies [15]. In these schemes, each node in the network knows its location, the approximate locations of its neighbors (i.e. those nodes it has direct, radio contact with) and estimates for the locations of the remaining nodes in the network. It greedily sends any message it receives to the the neighbor ....

B. Karp and H. Kung. Greedy perimeter stateless routing for wireless networks. In Proceedings of the sixth annual ACM/IEEE international conference on mobile computing and networking, 2000. 13

....necessarily important. Any sensors in that region that receive the query may initiate local coordination to aggregate the re quested data. A leader may be elected to send the query result back to the base station. New data centric and location based protocols (e.g. directed diffusion [67] GPSR [76], and RAP [88] were developed to improve scalability and efficiency in sensor networks. ffl Large scale: The large scale of sensor networks requires communication protocols to be highly scalable, maintain minimum global state inside the network, and incur as little control overhead as possible. ....

....power aware metrics for routing. LAR [77] on the other hand, uses location information (obtained through GPS) to generate request zones in which there is a high probability of finding the destination node. c) Geographic routing: as the name suggests, geographic routing protocols such as GPSR [76] utilize location in routing decisions. Specifically, GPSR forwards a packet to a neighbor node if 1) it has the shortest geographic distance to the packet s destination among all immediate neighbors; and 2) it is closer to the estimation than the forwarding node. When such nodes do not exist, ....

[Article contains additional citation context not shown here]

B. Karp, H. T. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks," In in Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking, August 2000.

....every source and destination prior to transmitting a packet. Geographic Forwarding [12] uses greedy forwarding to forward packets to the neighboring node that is closest to the final destination. GF began the trend in pure location based routing and has since seen extensions for handling voids [13], supporting real time traffic [16] and coping with congestion [8] An important contribution of GF based solutions was the removed requirement that a protocol maintain a global view of the network (i.e. end to end routing tables) GF therefore reduces communication overhead by eliminating its ....

B. Karp and H. T. Kung. "Greedy Perimeter Stateless Routing for Wireless Networks," In Proceedings of the Sixth Annual A CM/IEEE International Conference on Mobile Computing and Networking (MOBICOM '00), Massachusetts, August 2000.

....capability of nodes to perform routing. MFR [94] by Takagi et al. forwards a packet to the node that makes the most progress toward the destination. Finn [29] proposes a greedy geographic forwarding protocol with limited flooding to circumvent the voids inside the network. Alternatively, GPSR [59] by Karp and Kung uses perimeter forwarding to get around voids. Moreover, Geographic distance routing (GEDIR) 92] guarantees loop free delivery in a collision free network. And Basagni, 11] et al. propose a distance routing algorithm for mobility (DREAM) in which each node periodically ....

B. Karp and H.T. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks", In Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.

....their computing and transmission overhead, and the degree of permissible mobility [11] Position based (or geographic) routing exploits the fact that nodes usually live in the plane. This enables nodes to make local routing decisions based solely on the destinations geographic coordinates [8], 2] 3] 7] see [10] for an excellent review of position based routing) For this purpose, a mobile ad hoc network is regarded as a set of nodes in the plane, with an associated mobility process. Connectivity is achieved through wireless links, and is thus essentially local (see [5] for an ....

....simulation results in fairly large networks (1000 nodes) they confirm the good performance and scalability of EASE and GREASE. Finally, Section VII provides some further insights and discussions. II. RELATED WORK Several position based routing algorithms have been proposed in the literature [8], 2] 3] 7] The principal goal of these algorithms is to ensure that a short route can be found if one exists between a source and a destination whose locations are known. This is not trivial, because forwarding greedily in the direction of a destination is not guaranteed to work, as there is ....

B. Karp and H. T. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In ACM MOBICOM 2000.

....every source and destination prior to transmitting a packet. Geographic Forwarding [12] uses greedy forwarding to forward packets to the neighboring node that is closest to the final destination. GF began the trend in pure location based routing and has since seen extensions for handling voids [13], supporting real time traffic [16] and coping with congestion [8] An important contribution of GF based solutions was the removed requirement that a protocol maintain a global view of the network (i.e. end to end routing tables) GF therefore reduces communication overhead by eliminating its ....

B. Karp and H. T. Kung. "Greedy Perimeter Stateless Routing for Wireless Networks," In Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM `00), Massachusetts, August 2000.

....destinations are identified by geographic location, we assume the routing layer is aware of physical geography. A router can determine the physical location of the destination relative to itself and forward the packet in the general direction of the destination. Geographic forwarding (GF) [16] has been proposed in earlier wireless literature and evaluated in traditional MANET environments. More precisely, GF makes a greedy decision to forward a packet to a neighbor if 1) it has the shortest geographic distance to the packet s destination among all immediate neighbors; and 2) it is ....

....More precisely, GF makes a greedy decision to forward a packet to a neighbor if 1) it has the shortest geographic distance to the packet s destination among all immediate neighbors; and 2) it is closer to the destination than the forwarding node. When such nodes do not exist, the GPSR protocol [16] can be used to route packets around the perimeter of the void region. The only state on each node maintained by GF and GPSR is a table of the locations of immediate neighbors. Because GF uses immediate neighborhood information to make localized routing decisions, it is highly scalable with regard ....

[Article contains additional citation context not shown here]

Karp, B. and Kung, H.T., "Greedy Perimeter Stateless Routing for Wireless Networks," in Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.

.... Depending on whether the routes are maintained at all times or if they are created afresh when Figure 15: Average number of transmissions required for sink to receive data from a given number of sources in random sources model needed, these are categorized into proactive [24] reactive [18] [20], 25] 26] or hybrid [12] protocols. Some work has also been directed to incorporating GPS like geographical information with the routing technique [1] 21] These approaches are all address centric, in that they are focused on end to end routing between pairs of addressable nodes. There has ....

Karp, B. and Kung, H.T., Greedy Perimeter Stateless Routing for Wireless Networks, in Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.

....while an underlying system takes care of mapping it onto a target node in the network. The mappings between spatial references and nodes in the physical world are similar to the mappings from virtual memory to physical memory in a conventional computer system. Although both geographical routing [14, 17, 18] and content based naming and routing [4, 9, 13] have been extensively studied, a simple and intuitive programming model that allows the user to express the computation in terms of these abstractions is still missing. In our model, programmers write simple sequential programs and access ....

.... the programmer has the control over execution in SP, while TAG depends entirely on the compiler (i.e. essentially SP o#ers an imperative language and TAG o#ers a declarative language) Spatial Programming shares the idea of using spatial information with various forms of geographical routing [17, 14, 18], but it di#ers from them in its main goal, transparent computing over networks distributed within the physical space. Content based naming has been recently presented for both Internet [4, 23, 9] and sensor networks [13] The spatial references used in SP are similar abstractions to these ....

B. Karp and H. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 243--254, August 2000.

....model targets application that run a spatial distributed heterogeneous network of embedded systems. The programming model assumes that each node knows its physical location, and makes this information available to an application through a predefined API (node service) Geographical routing ([5, 16, 19, 17, 14]) capabilities are assumed to be supported in the target NES. This is important for program injection, result reporting, and virtual network refinements through spatial constraints. The physical location of a node within the network may determine whether the node is of interest to a particular ....

....define and implement a programming model that provides a simple way to program the physical spaces, and to decouple the access to spatially distributed network resources from the network. Spatial Programming shares the idea of using spatial information with various forms of geographical routing [5, 16, 19, 17, 14], but it di#ers from them in its main goal, transparent computing over networks distributed within the physical space. Content based naming has been recently presented for both 8 Internet [2, 4, 10] and sensor networks [15] Recent work on large networks of embedded systems has focused on ....

Karp B. and Kung H.T. Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.

....overhead of performing a spatial wavelet decomposition (b) balance the communication, computation and storage load among nodes in the network. wavRoute uses a recursive grid decomposition of a physical space into tiles (such as the one proposed in [17] in conjunction with geographic routing ( [15, 16]) as shown in Algorithm 1. At each level of the decomposition, coefficients from each tile are compressed using 2D wavelet transform at a selected clusterhead, which locally stores the coefficients and details from the decomposition, and forwards the resulting coefficients to the clusterhead at ....

....tile based on its own geographic co ordinates, the clusterhead location can be inde3 pendently computed by each node. Modified GPSR: We use a modified GPSR approach proposed in [15] to route packets to clusterheads. A brief review of the approach is described below, details can be obtained from [16] and [15] GPSR is a strongly geographic routing protocol that takes a location rather than an address to deliver packets. 15] propose a modified GPSR protocol that ensures that packets are delivered to the node closest to the destination location. When no node is located at the given location, ....

Karp, B. and Kung, H.T., Greedy Perimeter Stateless Routing for Wireless Networks, MobiCom 2000.

....destinations are identified by geographic location, we assume the routing layer is aware of physical geography. A router can determine the physical location of the destination relative to itself and forward the packet in the general direction of the destination. Geographic forwarding (GF) [16] has been proposed in earlier wireless literature and evaluated in the MANET environments. More precisely, GF makes a greedy decision to forward a packet to a neighbor if 1) it has the shortest geographic distance to the packet s destination among all immediate neighbors; and 2) it is closer to ....

....GF makes a greedy decision to forward a packet to a neighbor if 1) it has the shortest geographic distance to the packet s destination among all immediate neighbors; and 2) it is closer to the destination than the forwarding node. When such nodes do not exist in a region, the GPSR protocol [16] can be used to route packets around the perimeter of the depleted region. The only state on each node maintained by GF and GPSR is a table of the locations of immediate neighbors. Because GF uses immediate neighborhood 5 information to make localized routing decisions, it is highly scalable with ....

[Article contains additional citation context not shown here]

Karp, B. and Kung, H.T., "Greedy Perimeter Stateless Routing for Wireless Networks," in Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.

....forwarded only towards the destination with positive progress. Other researchers proposed not to forward packets which have reached a local maximum at all [HL86] The face 2 algorithm [BMSU99] and the perimeter routing strategy of the Greedy Perimeter Stateless Routing Protocol (GPSR) Kar00] [KK00] are two very similar recovery approaches based on planar graph traversal. Both are performed on a per packet basis and do not require the nodes to store any additional information. A packet enters the recovery mode when it arrives at a local maximum. It returns to greedy mode when it reaches a ....

....Based on the planar sub graph, a simple planar graph traversal is used to nd a path towards the destination. The general concept is to forward the packet on faces of D B C A Fig. 7. Non planar graph the planar sub graph, which are progressively closer to the destination. Figure 8 from [KK00] shows how this traversal is carried out when a packet is forwarded from S towards D in recovery mode. On each face, the packet is forwarded along the interior of the face by using the right hand rule: forward the packet on the next edge counterclockwise from the edge on which it arrived. ....

B. Karp and H. T. Kung. Greedy perimeter stateless routing for wireless networks. In Proc. of the 6th Annual ACM/IEEE Int. Conf. on Mobile Computing and Networking (MobiCom

.... [5] The great majority of wireless routing protocols developed in recent years have been for mobile ad hoc communication networks [27] Depending on whether the routes are maintained at all times or if they are created afresh when needed, these are categorized into proactive [24] reactive [18] [20], 25] 26] or hybrid [12] protocols. Some work has also been directed to incorporating GPSlike geographical information with the routing technique [1] 21] These approaches are all address centric, in that they are focused on end to end routing between pairs of addressable nodes. There has ....

Karp, B. and Kung, H.T., Greedy Perimeter Stateless Routing for Wireless Networks, in Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom

No context found.

B. Karp and H. Kung. Greedy perimeter stateless routing for wireless networks. In Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.

No context found.

B. Karp and H. Kung. Greedy perimeter stateless routing for wireless networks. In Mobicom, August 2000.

No context found.

B. Karp and H. T. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks," Proc. 6th ACM/IEEE Int'l. Conf. Mobile Comp. and Net. (MobiCom 2000.

No context found.

B. Karp and H. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.

No context found.

B. Karp and H. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.

No context found.

B. Karp and H. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 243--254, August 2000.

No context found.

B. Karp and H. T. Kung, "Greedy perimeter stateless routing for wireless networks," in Proc. of MobiCom, (Boston, MA), Aug. 2000.

No context found.

Karp, B., and Kung, H. Greedy Perimeter Stateless Routing for Wireless Networks. In Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computingand Networking (MobiCom 2000.

No context found.

B. Karp and H. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.

No context found.

B. Karp and H.T. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks, " Proc. 6th Ann. Int'l Conf. Mobile Computing and Networking (MobiCom 00), IEEE Press, 2000.

No context found.

B. Karp and H. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 243--254, August 2000.

No context found.

Brad Karp and H. T. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000), pages 243--254, Boston, MA, August 2000.

No context found.

B. Karp and H. T. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In ACM MOBICOM 2000.

No context found.

B. Karp and H. T. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks," Mobicom, 2000, pp.243-254.

No context found.

B. Karp and H. T. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks," Mobicom, 2000, pp.243-254.

No context found.

B.Karp and H.T.Kung., Greedy perimeter stateless routing for wireless networks, In Proc. of the 6th Annual ACM/IEEE Int. Conf. On Mobile Computing and Networking (MobiCom 2000)

No context found.

B. Karp, H. Tung, "Greedy Perimeter Stateless Routing for Wireless Networks", ACM MobiCom 2000.

No context found.

B. Karp and H. T. Kung. Greedy perimeter stateless routing for wireless networks. MobiCom'00, pages 243--254, August 2000.

No context found.

B. Karp and H.T. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks, " Proc. 6th Ann. Int'l Conf. Mobile Computing and Networking (MobiCom 00), IEEE Press, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC