Greedy anti-void routing protocol for wireless sensor networks

IEEE Communications Letters

Volumn 11, Issue 7, 2007, Pages 562-564

  Liu, Wen Jiunn ^a   Feng, Kai Ten ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Greedy routing; Localized algorithm; Unit disk graph; Void problem; Wireless sensor network

Indexed keywords

PACKET NETWORKS; ROUTING ALGORITHMS; WIRELESS SENSOR NETWORKS;

GREEDY ANTI-VOID ROUTING PROTOCOL; UNIT DISK GRAPH;

ROUTING PROTOCOLS;

EID: 34547780602     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2007.070311     Document Type: Article

References (7)

1. D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, "Next century challenges: Scalable coordination in sensor networks," in Proc. ACM/IEEE MobiCom'99, pp. 263-270.
2. G. G. Finn, "Routing and addressing problems in large metropolitan-scale internetwork," Tech. Rep. ISVRR-87-180, Info. Sci. Inst. ISI, Mar. 1987.
3. B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. ACM/IEEE MobiCom'00, pp. 243-254, Aug. 2000.
4. H. Frey and I. Stojmenović, "On delivery guarantees of face and combined greedy face routing in ad hoc and sensor networks," in Proc. ACM/IEEE MobiCom'06, pp. 390-401, Sept. 2006.
5. Y. J. Kim, R. Govindan, B. Karp, and S. Shenker, "On the pitfalls of geographic face routing," in Proc. ACM DIALM-POMC'05, pp. 34-43, Sept. 2005.
6. Q. Fang, J. Gao, and L. Guibas, "Locating and bypassing routing holes in sensor networks," in Proc. IEEE INFOCOM'04, pp. 2458-2468, Mar. 2004.
7. V. C. Giruka and M. Singhal, "Hello protocols for ad-hoc networks: overhead and accuracy tradeoffs," in Proc. IEEE WoWMoM'05, pp. 354-361, June 2005.