Coverage preserving redundancy elimination in sensor networks

2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, IEEE SECON 2004

Volumn , Issue , 2004, Pages 377-386

  Cǎrbunar, Bogdan ^a   Grama, Ananth ^a   Vitek, Jan ^a   Cǎrbunar, Octavian ^b  

^a Purdue University   (United States)

^b HORIA HULUBEI NATIONAL INSTITUTE OF PHYSICS AND NUCLEAR ENGINEERING   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; RADIO TRANSMISSION; REDUNDANCY; SENSORS;

COMMUNICATION BANDWIDTH; COVERAGE-BOUNDARY; NETWORK COVERAGE; SENSOR NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 20344381291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sahcn.2004.1381939     Document Type: Conference Paper

References (19)

1. Di Tian and Nicolas D. Georganas. A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, pages 32-41. ACM Press, 2002.
2. Honghai Zhang and Jennifer Hou. Maintaining coverage and connectivity in large sensor networks. In International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad hoc Wireless and Peer-to-Peer Networks, Feb 2004.
3. Fan Ye, Gary Zhong, Songwu Lu, and Lixia Zhang. Peas:a robust energy conserving protocol for long-lived sensor networks. In 23rd International Conference on Distributed Computing Systems (IEEE ICDCS), 2003.
4. B. Carbunar. A. Grama, and J. Vitek. Coverage problems in sensor networks. Technical report, Purdue University, 2004. http://www.cs.purdue.edu/ homes/carbunar/coverage.pdf.
5. M Luby. A simple parallel algorithm for the maximal independent set problem. In Proceedings of the seventeenth annual ACM symposium on Theory of computing, pages 1-10. ACM Press, 1985.
6. Olivier Devillers, Stefan Meiser, and Monique Teillaud. Fully dynamic delaunay triangulation in logarithmic expected time per operation. Comput. Geom. Theory Appl., 2(2):55-80, 1992.
7. Young-Bae Ko and Nitin H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. In Proceedings of MobiCom, pages 66-75, 1998.
8. Stefano Basagni, Imrich Chlamtac, Violet R. Syrotiuk, and Barry A. Woodward. A distance routing effect algorithm for mobility (DREAM). In Proceedings of MobiCom, 1998.
9. Brad Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Proceedings of MobiCom, pages 243-254, 2000.
10. S. Muthukrishnan and G. Pandurangan. The bin-covering technique for thresholding random geometric graph properties. Technical Report 2003-39, DIMACS, November 2003.
11. Sasa Slijepcevic and Miodrag Potkonjak. Power efficient organization of wireless sensor networks. In IEEE ICC, 2001.
12. S. Meguerdichian, F. Koushanfar. G. Qu, and M. Potkonjak. Exposure in wireless ad hoc sensor networks. In Proceedings of MobiCom, July 2001.
13. Z.J. Haas. On the relaying capability of the reconfigurable wireless networks. In IEEE 47th Vehicular Technology Conference, volume 2, pages 1148-1152, May 1997.
14. Q. Fang, J. Gao, and L. J. Guibas. Locating and bypassing routing holes in sensor networks. In IEEE INFOCOM, March 2004.
15. G. Even, Z. Lotker, D. Ron, and S. Smorodinsky. Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. In 43rd Annual IEEE FOCS, pages 691-700, 2002.
16. Howie Choset. Coverage for robotics - a survey of recent results. Annals of Mathematics and Artificial Intelligence, 31:113-126, 2001.
17. M. Cardei and J. Wu. Coverage in Wireless Sensor Networks. Handbook of Sensor Networks. CRC Press, 2004.
18. I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. Technical Report TR-99-11, University of Ottawa, December 1999.
19. Limin Hu. Topology control for multihop packet radio networks. IEEE Transactions on Communications, 41(10):1474-1481, October 1993.