Routing through holes in wireless sensor networks

MSWiM'12 - Proceedings of the 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

Volumn , Issue , 2012, Pages 395-402

  Mostefaoui, Ahmed ^a   Melkemi, Mahmoud ^b   Boukerche, Azzedine ^c  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

^b UNIVERSITÉ DE HAUTE ALSACE   (France)

^c UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Geographic greedy routing; Hole traversal; Local minimum problem; Localized algorithms; Wireless sensor networks

Indexed keywords

CONTROL OVERHEAD; EFFICIENT ROUTING; GREEDY ROUTING; HOLE TRAVERSAL; LARGE SCALE SENSOR NETWORK; LOCAL MINIMUM PROBLEM; LOCAL MINIMUMS; LOCALIZED ALGORITHM; MEMORYLESS; NODE-BASED; PACKET DELIVERY; ROUTING PATH; ROUTING TABLE; THROUGH HOLE;

CIRCUIT SIMULATION; SOFTWARE ENGINEERING; WIRELESS SENSOR NETWORKS;

SENSOR NODES;

EID: 84869404263     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2387238.2387304     Document Type: Conference Paper

References (16)

1. K. Akkaya and M. Younis. A survey of routing protocols for wireless sensor networks. Elsevier Ad Hoc Network Journal, 3(3):325-349, 2005.
2. I. Akyildiz, Y. S. W. Su, and E. Cayirci. A survey of wireless sensor networks. IEEE Communications magazine, 40(8), 2002.
3. J. Bahi, A. Makhoul, and A. Mostefaoui. Localization and coverage for high density sensor networks. Computer Communications, 31(4):770-781, 2008.
4. Q. Fang, J. Gao,, and L. Guibas. Locating and bypassing routing holes in sensor networks. In Proc. IEEE INFOCOM 04, pages 2458-2468, 2004.
5. K. Gabriel and R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18(3):259-278, 1969.
6. W. Jia, T. Wang, G. Wang, and M. Guo. Hole avoiding in advance routing in wireless sensor networks. In Wireless Communications and Networking Conference, pages 3519-3523, 2007.
7. H. Karl and A. Willig. Protocols and Architectures for Wireless Sensor Networks. Wiley, 2005.
8. B. Karp and H. Kung. Gpsr: Greedy perimeter stateless routing for wireless networks. In ACM MobiCom, pages 243-254, 2000.
9. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Canadian Conf. Computational Geometry (CCCG Š99), pages 51-54, 1999.
10. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric ad-hoc routing: Of theory and practice. In ACM Symp. Principles of Distributed Computing (PODC Š03), pages 63-72, 2003.
11. F. Kuhn, R. Wattenhofer, and A. Zollinger. Worst-case optimal and average-case efficient geometric ad-hoc routing. In ACM MobiCom, pages 267-278, 2003.
12. J. Li, J. Jannotti, D. DeCouto, D. Karger, and R. Morris. A scalable location service for geographic ad-hoc routing. In 6th Annu. ACM/IEEE International Conference on Mobile Computeing and Networking, pages 120-130, 2000.
13. W.-J. Liu and K.-T. Feng. Greedy routing with anti-void traversal for wireless sensor networks. IEEE Transactions on Mobile Computing, 8(7):910-922, 2009.
14. NS3. http://www.nsnam.org.
15. G. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12(4):261-268, 1980.
16. Y. Yu, D. Estrin, and R. Govindan. Geographical and energy-aware routing: A recursive data dissemination protocol for wireless sensor networks. Technical report, UCLA Computer Science Department Technical Report, UCLA-CSD TR-01-0023, 2001.