An Efficient Relay Sensors Placing Algorithm for Connectivity in Wireless Sensor Networks

  • Jyh-Huei Chang
  • Rong-Hong Jan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4096)


Randomly deployed sensor networks often make initial communication gaps inside the deployed area even in an extremely high-density network. How to add relay sensors such that the underlying graph is connected and the number of relay sensors added is minimized is an important problem in wireless sensor networks. This paper presents an Efficient Relay Sensors Placing Algorithm (ERSPA) for solving such a problem. Compared with minimum spanning tree algorithm and greedy algorithm, ERSPA achieves a better performance in terms of number of relay sensors added. Simulation results show that the average number of relay sensors added by minimal spanning tree algorithm is approximately up to two times than ERSPA algorithm.


Sensor Network Wireless Sensor Network Greedy Algorithm Relay Node Transmission Range 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wan, R.-J., Yi, C.-W.: Asymptotic Critical Transmission Radius and Critical Neighbor Number for K-connectivity in Wireless Ad Hoc Networks. In: Proceedings of the 5th ACM international symposium on mobile ad hoc networking and computing, pp. 1–8 (2004)Google Scholar
  2. 2.
    Santi, P.: The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks. IEEE Transaction on Mobile Computing, 310–317 (2005)Google Scholar
  3. 3.
    Koskinen, H.: A Simulation-based Method for Predicting Connectivity in Wireless Multihop Networks. Telecommunication Systems, 321–338 (2004)Google Scholar
  4. 4.
    Zhang, H., Hou, J.C.: Maintain Sensing Coverage and Connectivity in Largen Sensor Networks. Ad Hoc and Sensor Networks, 89–124 (2005)Google Scholar
  5. 5.
    Tian, D., Georganas, N.D.: Connectivity Maintence and Coverage Preservation in Wireless Sensor Networks. Ad Hoc Networks, 744–761 (2005)Google Scholar
  6. 6.
    Gupta, H., Das, S.R., Gu, Q.: Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution. In: Proceedings of MobiHoc 2003 (2003)Google Scholar
  7. 7.
    Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated Coverage and Connectivity Confuration in Wireless Sensor Networks. In: ACM SENSYS 2003 (2003)Google Scholar
  8. 8.
    Cheng, X., Du, D.-Z., Wang, L., Xu, B.: Relay Sensor Placement in Wireless Sensor Networks. IEEE Transaction on Computers (2001)Google Scholar
  9. 9.
    Koskinen, H., Karvo, J., Apilo, O.: On Improving Connectivity of Static Ad-Hoc Networks by Adding Nodes. In: Proceedings of the 6th ACM International Symposium on Low Power Electronics and Design (ISLPED 2003), pp. 251–254 (2003)Google Scholar
  10. 10.
    Mandoiu, I., Zelikovsky, A.: A Note on the MST Heuristic for Bounded Edge-length Steiner Trees with Minimum Number of Steiner Points. Information Processing Letters (2000)Google Scholar
  11. 11.
    Chen, D., Du, D.-Z., Xu, X., Lin, G.-H., Wan, L., Xue, G.: Approximations for Steiner Trees with Minimum Number of Steiner Points. Journal of Global Optimization (2000)Google Scholar
  12. 12.
    Hou, Y.T., Shi, Y., Sherali, H.D., Midkiff, S.F.: On Energy Provisioning and Relay Node Placement for Wireless Sensor Networks. IEEE Transactions on Wireless Communications, 2579–2590 (2005)Google Scholar
  13. 13.
    Koskinen, H., Karvo, J., Apilo, O.: On Improving Connectivity of Static Ad-Hoc Networks by Adding Nodes. Med-Hoc-Net (2005)Google Scholar
  14. 14.
    Ganesan, D., Christescu, R., Lozano, B.B.: Power-Efficient Sensor Placement and Transmission Structure for Data Gathering under Distortion Constrain. ACM Transaction on Sensor Networks (2005)Google Scholar
  15. 15.
    Mulmuley, K.: Computational Geometry. Prentice-Hall, Englewood Cliffs (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jyh-Huei Chang
    • 1
  • Rong-Hong Jan
    • 1
  1. 1.Department of Computer and Information ScienceNational Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations