Local geometric algorithm for hole boundary detection in sensor networks

Security and Communication Networks

Volumn 4, Issue 9, 2011, Pages 1003-1012

  Shirsat, Amit ^a   Bhargava, Bharat ^a  

^a US Office: 2GA 4358 ^*  (United States)

Author keywords

Geometric algorithm; Hole detection; Security; Sensor networks

Indexed keywords

GRAPH THEORY;

CHORDLESS CYCLES; GEOGRAPHIC INFORMATION; GEOMETRIC ALGORITHM; GRAPH-THEORETIC; HOLE DETECTION; SECURITY; SECURITY IMPLICATIONS; SIMULATION TESTS;

SENSOR NETWORKS;

EID: 80052168860     PISSN: 19390114     EISSN: 19390122     Source Type: Journal    
DOI: 10.1002/sec.271     Document Type: Article

References (18)

1. Reason JM, Rabaey JM. A study of energy consumption and reliability in a multi-hop sensor network. SIGMOBILE Mobile Computing and Communications Review 2004; 8(1): 84-97. DOI: http://doi.acm.org/10.1145/980159.980170.
2. Yener B, Magdon-Ismail M, Sivrikaya F. Joint problem of power optimal connectivity and coverage in wireless sensor networks. Wireless Networks 2007; 13(4): 537-550. DOI: http://dx.doi.org/10.1007/s11276-006-5875-0.
3. Bose P, Morin P, Stojmenovic I, Urrutia J. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks November 2001; 7(6): 609-616.
4. Karp B, Kung HT. GPSR: Greedy perimeter stateless routing for wireless networks. ACM/IEEE Symposium International Conference on Mobile Computing and Networking (Mobicom), 2000; 243-254.
5. Kranakis E, Singh H, Urrutia J. Compass routing on geometric networks. Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, 1999; 51-54.
6. Albano M, Chessa S, Nidito F, Pelagatti S. Geographic hash tables with QoS in non uniform sensor networks. ACM MobiHoc 2006 Poster Proceedings, Firenze, Italy, 2006.
7. Das S, Pucha H, Hu YC. Performance comparison of scalable location services for geographic ad hoc routing. Proceedings of IEEE INFOCOM, 2005; 120-130.
8. Li J, Jannotti J, Couto DD, Karger D, Morris R. A scalable location service for geographic ad hoc routing. Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom) August 2000; 120-130.
9. Diestel R. Graph Theory, Third edn. Springer-Verlag Heidelberg: Newyork, 2005.
10. Nikolopoulos S, Palios L. Hole and antihole detection in graphs. Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. New Orleans: Louisiana, 2004; 850-859.
11. Spinrad J. Finding large holes. Information Processing Letters 1991; 39(4): 227-229.
12. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to Algorithms. Second edn., MIT Press: Cambridge, MA, 2001.
13. Fang Q, Gao J, Guibas L. Locating and bypassing routing holes in sensor networks. The 23rd Annual Joint Conference of the IEEE Computers and Communications Society (Infocom), vol. 4, Hong Kong, PRC: 2004; 2458-2468.
14. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O. Computational Geometry: Algorithms and Applications. Springer-Verlag New York, Inc.: Secaucus, NJ, USA, 1997.
15. Funke S. Topological hole detection in wireless sensor networks and its applications. DIALM-POMC '05: Proceedings of the 2005 joint workshop on Foundations of mobile computing. ACM: New York, NY, USA, 2005; 44-53. DOI: http://doi.acm.org/10.1145/1080810.1080819.
16. Ghrist R, Muhammad A. Coverage and hole-detection in sensor networks via homology. Fourth International Symposium on Information Processing in Sensor Networks (ISPN). Los Angeles: California, USA, 2005; 254-260.
17. The JUNG project website 2006.
18. Karlof C, Wagner D. Secure routing in wireless sensor networks: Attacks and countermeasures. In First IEEE International Workshop on Sensor Network Protocols and Applications, 2002; 113-127.