Browse > Article

An Active Node Selection Scheme based on Local Density in Wireless Sensor Networks  

Kim, Jeong-Sahm (Yeungnam College of Science & Technology, Division of Computer Technology)
Ryu, Jeong-Pil (Center for Technology fusion in Construction, Yonsei University)
Han, Ki-Jun (Kyoungbuk National University, Dept. of Computer Engineering)
Publication Information
Abstract
In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.
Keywords
wireless sensor network; network lifetime; local density; network coverage; network connectivity;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Tian, N.D Georganas, 'A coverage-preserving node scheduling scheme for large wireless sensor networks,' Proc. ACM Wireless Sensor Network and Application Workshop, pp. 32-41, Sept. 2002
2 E. M. Royer, P. M. Melliar-Smith, L. E. Moser, 'An analysis of the optimum node density for ad hoc mobile networks,' Proc. ICC, vol. 3, pp. 857-861, Jun. 2001
3 Y. C. Tseng, S. Y. Ni, Y. S. Chen, and J. P. Sheu, 'The broadcast storm problem in a mobile ad hoc network,' Wireless Networks, vol. 8, pp. 153-167, May. 2002   DOI   ScienceOn
4 A. Bharathidasan and V. A. S. Ponduru, 'Sensor Networks: An Overview,' UC Davis Technical Report. 2003
5 N. Ahmed S. S. Kanhere and S. Jha, 'The Holes Problem in Wireless Sensor Networks: A Survey,' ACM SIGMOBILE, vol. 9, pp. 4-18, Apr. 2005
6 F. Xue and P. R. Kumar, 'The number of neighbors needed for connectivity of wireless networks,' Wireless Networks, vol. 10, pp.169-181, Mar. 2004   DOI   ScienceOn
7 S. Song, L. Dennis, Geckel and T. Don, 'An Improved Lower Bound to the Number of Neighbors Required for the Asymptotic Connectivity of Ad Hoc Networks,' J. IEEE Trans. I. T, 2005
8 I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, 'Wireless Sensor Networks: A Survey,' Computer Networks, vol. 38, pp. 393-422, Mar. 2002   DOI   ScienceOn
9 B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, 'Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,' Proc. ACM/IEEE
10 A. Qayyum, L. Viennot, and A. Laouiti, 'Multipoint relaying for flooding broadcast messages in mobile wireless networks,' Proc. HICSS, vol. 9, pp. 298, Jan. 2002
11 H. Zhang and J. C. Hou, 'Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,' Technical Report UIUC, UIUCDCS-R-2003-2351, 2003
12 C. Chong and S. P. Kumar, 'Sensor Networks: Evolution, Opportunities, and Challenges,' Proc. The IEEE, vol. 91, pp. 1247-1256, Aug. 2003
13 Y. Zou and K. Chakrabarty, 'A Distributed Coverage-and Connectivity-Centric Technique for Selecting Active Nodes in Wireless Sensor Networks,' J. IEEE Trans. Computers, vol. 54, pp. 978-991, Aug. 2005   DOI   ScienceOn
14 A. Cerpa and D. Estrin, 'ASCENT: Adaptive self-configuring sensor networks topologies,' Proc. INFOCOM, vol. 3, pp. 23-27, Jun. 2002