Advertisement

Efficient Coverage Protocol for Homogeneous Wireless Sensor Networks

  • Ramachandra PolireddiEmail author
  • Chinara Suchismita
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 28)

Abstract

In this paper, a localization technique is used to reduce the number of active sensors at an instant of time in a region for wireless sensor networks(WSNs). The active nodes in a region is calculated baed on the K-hop Independent Dominating Set(K-IDS). The proposed algorithm is evaluated using Castalia Simulator.The simulation results are analysed using network parameters namely,energy consumption,number of active nodes in a cluster and packet delivery ratio. The simulation results indicates that the proposed algorithm outperforms LEACH and MOCA protocls.

Keywords

Wireless Sensor Network Cluster Head Transmission Range Residual Energy Active Node 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Al-Karaki, J., Kamal, A.: Routing techniques in wireless sensor networks: a survey. IEEE Wireless Communications 11(6), 1–23 (2004)CrossRefGoogle Scholar
  2. 2.
    Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38(4), 1–29 (2002)CrossRefGoogle Scholar
  3. 3.
    Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R., Anderson, J.: Wireless sensor networks for habitat monitoring. In: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, pp. 1–10 (2002)Google Scholar
  4. 4.
    Salatas, V.: Object tracking using wireless sensor networks. PhD thesis, Monterey, California. Naval Postgraduate School (2005)Google Scholar
  5. 5.
    Wu, J., Yang, S.: Energy-efficient node scheduling models in sensor networks with adjustable ranges. International Journal of Foundations of Computer Science 16(1), 1–14 (2005)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: 33rd Annual Hawaii International Conference on System Sciences, pp. 1–10 (2000)Google Scholar
  7. 7.
    Li, C., Ye, M., Chen, G., Wu, J.: An energy-efficient unequal clustering mechanism for wireless sensor networks. In: 2005 IEEE International Conference on Mobile Ad hoc and Sensor Systems Conference, pp. 1–5 (2005)Google Scholar
  8. 8.
    Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications 1(4), 1–11 (2002)CrossRefGoogle Scholar
  9. 9.
    Youssef, A., Younis, M., Youssef, M., Agrawala, A.: Wsn16-5: Distributed formation of overlapping multi-hop clusters in wireless sensor networks. In: Global Telecommunications Conference (GLOBECOM 2006), pp. 1–6. IEEE (2006)Google Scholar
  10. 10.
    Chang, R.S., Kuo, C.J.: An energy efficient routing mechanism for wireless sensor networks. In: 20th International Conference on Advanced Information Networking and Applications, vol. 2, pp. 1–5. IEEE (2006)Google Scholar
  11. 11.
    Mao, G., Fidan, B., Anderson, B.: Wireless sensor network localization techniques. Computer Networks 51(10), 1–24 (2007)Google Scholar
  12. 12.
    Efrat, A., Har-Peled, S., Mitchell, J.: Approximation algorithms for two optimal location problems in sensor networks. In: 2005 2nd International Conference on Broadband Networks, pp. 1–9. IEEE (2005)Google Scholar
  13. 13.
    Shin, I., Shen, Y., Thai, M.: On approximation of dominating tree in wireless sensor networks. Optimization Letters 4(3), 393–403 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Akkaya, K., Senel, F., McLaughlan, B.: Clustering of wireless sensor and actor networks based on sensor distribution and connectivity. Journal of Parallel and Distributed Computing 69(6), 573–587 (2009)CrossRefGoogle Scholar
  15. 15.
    Gary, M., Johnson, D.: Computers and intractability: A guide to the theory of np-completeness (1979)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.National Institute of TechnologyRourkelaIndia

Personalised recommendations