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 |
This paper is cited in the following contexts:
First 50 documents
Small Worlds, Locality, and Flooding on Landscapes - Homan, Istrate (2003) (Correct)
....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
Real-Time Communication and Coordination in Embedded .. - Stankovic, Lu, Sha, .. (2003) (11 citations) (Correct)
....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.
IGF: A State-Free Robust Communication Protocol for.. - Blum, He, Son, Stankovic (2003) (8 citations) (Correct)
....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.
A Dissertation Proposal on Hermes: A Scalable Sensor Network.. - He (Correct)
....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.
Locating Nodes with EASE: Last Encounter Routing in Ad.. - Grossglauser, Vetterli (2003) (4 citations) (Correct)
....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.
IGF: A State-Free Robust Communication Protocol for.. - Blum, He, Son, Stankovic (2003) (8 citations) (Correct)
....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.
J-Sim: A Simulation and Emulation Environment for.. - Sobeih, Chen.. (2005) Self-citation (Kung) (Correct)
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.
Virtual Ring Routing: Network Routing Inspired by DHTs - Matthew Caesar Miguel (Correct)
No context found.
B. Karp and H. Kung. Greedy perimeter stateless routing for wireless networks. In Mobicom, August 2000.
Unknown - Besides Using Geographic (2004) (Correct)
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.
EZCab: A Cab Booking Application Using Short-Range.. - Zhou, Nadeem.. (Correct)
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.
Mobile Services: Context-Aware Service Migration in Ad.. - Riva, Nadeem, Borcea.. (Correct)
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.
Programming Computers Embedded in the Physical World - Iftode, Borcea, Kochut.. (Correct)
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.
Distributed State Representation for Tracking Problems in - Sensor Networks Juan (2004) (Correct)
No context found.
B. Karp and H. T. Kung, "Greedy perimeter stateless routing for wireless networks," in Proc. of MobiCom, (Boston, MA), Aug. 2000.
Cooperative Computing in Sensor Networks - Iftode, Borcea, Kang (Correct)
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.
Spatial Programming using Smart Messages: Design.. - Borcea.. (2004) (1 citation) (Correct)
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.
PERVASIVEcomputing Published by the IEEE CS and IEEE.. - Programming For.. (2003) (Correct)
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.
Self-Routing in Pervasive Computing Environments.. - Borcea.. (2003) (3 citations) (Correct)
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.
A Location Service Mechanism for Position-Based.. - Sasson, Cavin, Schiper (2003) (Correct)
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.
Locating Nodes with EASE: Last Encounter Routing in Ad.. - Grossglauser, Vetterli (2003) (4 citations) (Correct)
No context found.
B. Karp and H. T. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In ACM MOBICOM 2000.
The Effect of Mobility-induced Location Errors on.. - Son, Helmy.. (2004) (Correct)
No context found.
B. Karp and H. T. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks," Mobicom, 2000, pp.243-254.
The Effect of Mobility-induced Location Errors on.. - Son, Helmy.. (2004) (Correct)
No context found.
B. Karp and H. T. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks," Mobicom, 2000, pp.243-254.
Impact of Location Inconsistencies on Geographic Routing in.. - Yongjin Kim Univ (2003) (Correct)
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)
CAPTURE: location-free Contact-Assisted Power-efficienT qUery.. - Helmy (Correct)
No context found.
B. Karp, H. Tung, "Greedy Perimeter Stateless Routing for Wireless Networks", ACM MobiCom 2000.
Simulation Validation Using Direct Execution of.. - Liu, Yuan, Nicol, .. (2004) (1 citation) (Correct)
No context found.
B. Karp and H. T. Kung. Greedy perimeter stateless routing for wireless networks. MobiCom'00, pages 243--254, August 2000.
State-Centric Programming for Sensor-Actuator Network Systems - Liu, al. (2003) (1 citation) (Correct)
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.
First 50 documents
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