Advertisement

Energy-Efficient Location-Independent k-connected Scheme in Wireless Sensor Networks*

  • Xiaofeng Liu
  • Liusheng Huang
  • Wenbo Shi
  • Hongli Xu
Part of the IFIP – The International Federation for Information Processing book series (IFIPAICT, volume 264)

Abstract

The reliability of communication can be enhanced by increasing the network connectivity. Topology control and node sleep scheduling are used to reduce the energy consumption. This paper considers the problem of maintaining k-connectivity of WSN at minimum energy level while keeping only a subset of sensor nodes active to save energy. In our proposed scheme, each node is assumed to have multiple power levels and neighbor proximity not exact location information is adopted. Firstly the network partition is attained by power based clustering, and next nodes are divided into equivalent classes according to the role of data forwarding to different adjacent clusters. Then Node Scheduling and Power Adjustment (NSPA) algorithm selects a subset of nodes with different power levels to construct the local minimum energy graph while maintaining network connectivity. If the number of intra-cluster nodes which have adjacent clusters exceeds a certain threshold, k-NSPA is employed. Finally, a k-connected topology can be obtained. The simulation shows that our scheme can obtain the redundant nodes while maintaining network k-connected and it is more energy efficient compared with previous work.

Keywords

k-connectivity power clustering equivalence 

References

  1. 1.
    T. He, S. Krishnamurthy, J.A. Stankovic, T.F. Abdelzaher, L. Luo, R. Stoleru, T. Yan, L. Gu, J. Hui, and B. Krogh. Energy-Efficient Surveillance System Using Wireless Sensor Networks. In: ACM MobiSys, June 2004, pages 270–283.Google Scholar
  2. 2.
    R. Szewczyk, A. Mainwaring, J. Polastre, J. Anderson, and D. Culler. An analysis of a large scale habitat monitoring application. In: Proc. 2nd ACM Conference on Embedded Networked Sensor Systems (SenSys ’04), Nov. 2004, pages 214–226.Google Scholar
  3. 3.
    Kirousis LM, Kranakis E, Krizanc D, Pelc A. Power consumption in packet radio networks. Theoretical Computer Science, 2000, 243(1-2):289-305.CrossRefGoogle Scholar
  4. 4.
    Clementi A, Penna P, Silvestri R. On the power assignment problem in radio networks. ACM/Kluwer Mobile Networks and Applications (MONET), 2004,9(2):125-140.CrossRefGoogle Scholar
  5. 5.
    Narayanaswamy S, Kawadia V, Sreenivas RS, Kumar PR. Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol. In: Proc. of the European Wireless Conf. Florence, 2002. 156-162.Google Scholar
  6. 6.
    Kawadia V, Kumar PR. Power control and clustering in ad-hoc networks. In: Mitchell K, ed. Proc. of the IEEE Conf. on Computer Communications (INFOCOM). New York: IEEE Press, 2003. 459-469.Google Scholar
  7. 7.
    Li L, Halpern JY, Bahl P, Wang YM, Wattenhofer R. A cone-based distributed topology control algorithm for wireless multi-hop networks. IEEE/ACM Trans. on Networking, 2005,13(1):147-159.CrossRefGoogle Scholar
  8. 8.
    Bahramgiri M, Hajiaghayi MT, Mirrokni VS. Fault-Tolerant and 3-dimensional distributed topology control algorithms in wireless multihop networks. In: Proc. of the IEEE Int’l Conf. on Computer Communications and Networks (ICCCN). 2002. 392-397.Google Scholar
  9. 9.
    Wattenhofer R, Zollinger A. XTC: A practical topology control algorithm for ad-hoc networks. In: Panda DK, Duato J, Stunkel C, eds. Proc. of the Int’l Parallel and Distributed Processing Symp. (IPDPS). New Mexico: IEEE Press, 2004. 216-223.Google Scholar
  10. 10.
    Kumar S, Lai TH, Balogh J. On k-coverage in a mostly sleeping sensor network. In: Haas ZJ, ed. Proc. of the ACM Int’l Conf. on Mobile Computing and Networking (MobiCom). New York: ACM Press, 2004. 144-158.Google Scholar
  11. 11.
    Berman P, Calinescu G, Shah C, Zelikovsky A. Efficient energy management in sensor networks. In: Xiao Y, Pan Y, eds. Proc. of the Ad Hoc and Sensor Networks, Series on Wireless Networks and Mobile Computing. New York: Nova Science Publishers, 2005.Google Scholar
  12. 12.
    Wu K, Gao Y, Li F, Xiao Y. Lightweight deployment-aware scheduling for wireless sensor networks. ACM/Kluwer Mobile Networks and Applications (MONET), 2005,10(6):837-852.CrossRefGoogle Scholar
  13. 13.
    Younis O, fahmy S. HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Trans. on Mobile Computing, 2004,3(4):660-669.Google Scholar
  14. 14.
    H. Zhang and J. C. Hou. Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc & Sensor Wireless Networks, 1:89–124, Jan. 2005.Google Scholar
  15. 15.
    X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. D. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” In: Proc. First ACM Conference on Embedded Networked Sensor Systems (SenSys’03), Nov 2003. New York.Google Scholar
  16. 16.
    Choudhury RR, Kravets R. Location-Independent coverage in wireless sensor networks. 2004. http://www.crhc.uiuc.edu/∼croy/pubsGoogle Scholar
  17. 17.
    Ossama Younis. Marwan Krunz and Srinivasan Ramasubramanian. Coverage Without Location Information. IEEE International Conference on Network Protocols, ICNP 2007.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Xiaofeng Liu
    • 1
  • Liusheng Huang
    • 1
  • Wenbo Shi
    • 1
  • Hongli Xu
    • 1
  1. 1.Department of Computer Science and TechnologyUniversity of Science and Technology of ChinaChina

Personalised recommendations