Relay node placement in large scale wireless sensor networks

Computer Communications

Volumn 29, Issue 4, 2006, Pages 490-501

  Tang, Jian ^a   Hao, Bin ^a   Sen, Arunabha ^a  

^a Arizona State University   (United States)

Author keywords

Fault tolerance; Relay node placement; Wireless sensor network

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION DISSEMINATION; POLYNOMIAL APPROXIMATION; WIRELESS TELECOMMUNICATION SYSTEMS;

DATA PACKETS; OPTIMAL ALGORITHMS; RELAY NODE PLACEMENT; WIRELESS SENSOR NETWORKS;

SENSORS;

EID: 32644439091     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2004.12.032     Document Type: Article

References (19)

1. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci Wireless sensor networks: a survey Computer Networks Journal 38 2002 393 422
2. J.A. Bondy, and U.S.R. Murthy Graph Theory with Applications 1976 North Holland New York
3. X. Cheng, D.Z. Du, L. Wang, B. Xu, Relay sensor placement in wireless sensor networks, ACM Wireless networks submitted for publication. Also available at http://citeseer.nj.nec.com/cheng01relay.html
4. R.J. Fowler, M.S. Paterson, and S.L. Tanimoto Optimal packing and covering in the plane are NP-complete Information Processing Letter 12 1981 133 137
5. Y. Gao, K. Wu, F. Li, Analysis on the redundancy of wireless sensor networks, Proceedings of ACM WSNA'2003.
6. H. Gupta, S.R. Das, Q. Gu, Connected sensor cover: self-organization of sensor networks for efficient query execution, Proceedings of ACM MOBIHOC'2003, pp. 189-200.
7. G. Gupta, M. Younis, Fault-tolerant clustering of wireless sensor networks, Proceedings of IEEE WCNC'2003, pp. 1579-1584.
8. G. Gupta, M. Younis, Load-balanced clustering of wireless sensor networks, Proceedings of IEEE ICC'2003, pp. 1848-1852.
9. W. Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy efficient communication protocols for wireless microsensor networks, Proceedings of HICSS'2000, pp. 3005-3014.
10. D.S. Hochbaum, and W. Maass Approximation schemes for covering and packing problems in image processing and VLSI Journal of ACM 32 1985 130 136
11. C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, Proceedings of ACM MOBICOM'2000, pp. 56-67.
12. S. Lindsey, C. Raghavendra, and K.M. Sivalingam Data gathering algorithm in sensor networks using energy metrics IEEE Transactions on Parallel and Distributed System 13 2002 924 935
13. G. Lin, and G. Xue Steiner tree problem with minimum number of steiner points and bounded edge-length Information Processing Letters 69 1999 53 57
14. K.J. Nurmela, P.R.J. Ostergard, Covering a square with up to 30 equal circles, Research Report A62, Helsinki University of Technology, 2000. Also available at http://www.tcs.hut.fi/Publications/info/bibdb.HUT-TCS-A62.shtml
15. J. Pan, Y.T. Hou, L. Cai, Y. Shi, S.X. Shen, Topology control for wireless sensor networks, Proceedings of ACM MOBICOM'2003, pp. 286-299.
16. C. Schurgers, V. Tsiatsis, S. Ganeriwal, M. Srivastava, Topology management for sensor networks: exploiting latency and density, Proceedings of ACM MOBIHOC'2002, pp. 135-145.
17. A. Srinivas, E. Modiano, Minimum energy disjoint path routing in wireless ad-hoc network, Proceedings of ACM MOBICOM'2003, pp. 122-133.
18. J.W. Suurballe Disjoint paths in a network Networks 4 1974 125 145
19. D. Tian, N.D. Georganas, A coverage-preserving node scheduling scheme for large wireless sensor networks, Proceedings of ACM WSNA'2002, pp. 32-41.