An optimal new-node placement to enhance the coverage of wireless sensor networks

Wireless Networks

Volumn 16, Issue 4, 2010, Pages 1033-1043

  Hou, Yung Tsung ^a   Chen, Chia Mei ^a   Jeng, Bingchiang ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Best case coverage; Sensor deployment; Sensor network; Worst case coverage

Indexed keywords

BEST-CASE COVERAGE; COVERAGE PROBLEM; NODE PLACEMENT; PLACEMENT ALGORITHM; POLYNOMIAL-TIME; SENSOR DEPLOYMENT; WORST-CASE COVERAGE;

COMPUTATIONAL GEOMETRY; MILITARY APPLICATIONS; POLYNOMIAL APPROXIMATION; QUALITY OF SERVICE; SENSOR NETWORKS;

WIRELESS SENSOR NETWORKS;

EID: 77954088323     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-009-0186-x     Document Type: Article

References (17)

1. Cardei, M., & Wu, J. (2004, July). Coverage in wireless sensor networks, Handbook of sensor networks: Compact Wireless and Wired Sensing Systems. CRC Press LLC.
2. S Meguerdichian F Koushanfar M Potkonjak M Srivastava 2005 Worst and best-case coverage in sensor networks IEEE Transactions on Mobile Computing 4 1 84 92 10.1109/TMC.2005.15 10.1109/TMC.2005.15 (Pubitemid 40168799)
3. X-Y Li P-J Wan O Frieder 2003 Coverage in wireless ad-hoc sensor networks IEEE Transactions on Computers 52 6 753 763 10.1109/TC.2003.1204831 10.1109/TC.2003.1204831
4. Slijepcevic, S., & Potkonjak, M. (2001). Power efficient organization of wireless sensor networks. In Proceedings of IEEE International Conference on Communications (vol. 2, pp. 472-476). (Pubitemid 32797460)
5. Tian, D., & Georganas, N. D. (2002). A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proceedings of the first ACM International Workshop on Wireless Sensor Networks and Applications (pp. 32-41).
6. CF Huang YC Tseng 2005 The coverage problem in a wireless sensor network Mobile Networks and Applications 10 4 519 528 10.1007/s11036-005-1564-y 2137676 (Pubitemid 40859663)
7. M Cardei D-Z Du 2005 Improving wireless sensor network lifetime through power aware organization Wireless Networks 11 3 333 340 10.1007/s11276-005-6615- 6 10.1007/s11276-005-6615-6 (Pubitemid 41217860)
8. Kar, K., & Banerjee, S. (2003). Node placement for connected coverage in sensor networks. In Proceedings of WiOpt 2003: Modeling and optimization in mobile, ad hoc and wireless networks.
9. H Huang AW Richa 2005 Dynamic coverage in ad-hoc sensor networks Mobile Networks and Applications 10 1 9 17 10.1023/B:MONE.0000048542.38105.99 (Pubitemid 40537002)
10. Meguerdichian, S., Koushanfar, F., Qu, G., & Potkonjak, M. (2001). Exposure in wireless ad-hoc sensor networks. In Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (pp. 139-150). (Pubitemid 33006711)
11. Savvides, A., Han, C. C., & Srivastava, M. B. (2001). Dynamic fine-grained localization in ad hoc networks of sensors. In Proceedings of the 7th Annual Internat. Conference on Mobile Computing and Networking (pp. 166-179).
12. Preparata, F. P., & Shamos, M. I. (1985). Computational geometry: An introduction. New York: Springer-Verlag New York.
13. Fortune, S. (1997). Voronoi diagrams and Delaunay triangulations, Handbook of discrete and computational geometry. Boca Raton: CRC Press LLC.
14. O'Rourke, J. (1998). Computational geometry in C. Cambridge: Cambridge University Press.
15. JW Jaromczyk GT Toussaint 1992 Relative neighborhood graphs and their relatives Proceedings of the IEEE 80 9 1502 1517 10.1109/5.163414 10.1109/5.163414 (Pubitemid 23568838)
16. KR Gabriel RR Sokal 1969 A new statistical approach to geographic variation analysis Systematic Zoology 18 3 259 278 10.2307/2412323 10.2307/2412323
17. Cormen, T. J., Leiserson, C. E., & Rivst, R. L. (1990). Introduction to algorithms. Cambridge, MA: MIT Press.