Energy density based mobile sink trajectory in wireless sensor networks

Technical Paper
  • 36 Downloads

Abstract

Sink mobility is one of the efficient solutions to sink hole or energy hole problem which is usually caused by multi-hop communication using a static sink. However, the design of an efficient path for the mobile sink is an important issue. In this paper, we propose a novel algorithms to determine rendezvous point (RP) based dynamic path for mobile sink called delay aware energy density based trajectory (DAEDT). The DAEDT designs an energy efficient delay bound path for the mobile sink. In order to balance energy consumption among the sensor nodes, the proposed algorithm selects RPs based on the energy density of the sensor nodes. The DAEDT is also presented with a detour criteria following some threshold. The algorithm is extensively simulated and the results of DAEDT are compared with some existing schemes to show its effectiveness over various performance metrics. The simulation results are further validated through hypothesis testing using ANOVA.

Notes

Acknowledgements

The first version of the paper (Nitesh and Jana 2015) appeared in the proceedings of 4th International Conference on ‘Computing, Communication and Sensor Network’ CCSN-2015, held at Kolkata during December 24–25, 2015. The authors of this paper are thankful to the anonymous reviewers for their valuable comments and suggestions which help this extension of the paper.

References

  1. Almi’Ani K, Viglas A, Libman L (2010) Energy-efficient data gathering with tour length-constrained mobile elements in wireless sensor networks. In: 2010 IEEE 35th conference on local computer networks (LCN), pp 582–589Google Scholar
  2. Anastasi G, Conti M, Di Francesco M, Passarella A (2009) Energy conservation in wireless sensor networks: a survey. Ad Hoc Netw 7(3):537–568CrossRefGoogle Scholar
  3. Basagni S, Carosi A, Melachrinoudis E, Petrioli C, Wang ZM (2008) Controlled sink mobility for prolonging wireless sensor networks lifetime. Wirel Netw 14(6):831–858CrossRefGoogle Scholar
  4. Bianchi G, Fratta L, Oliveri M (1996) Performance evaluation and enhancement of the CSMA/CA MAC protocol for 802.11 wireless LANs. In: Seventh IEEE international symposium on personal, indoor and mobile radio communications. PIMRC’96, vol 2, pp 392–396Google Scholar
  5. Di Francesco M, Das SK, Anastasi G (2011) Data collection in wireless sensor networks with mobile elements: a survey. ACM Trans Sens Netw (TOSN) 8(1):7Google Scholar
  6. Garcia-Sanchez A-J, Garcia-Sanchez F, Losilla F, Kulakowski P, Garcia-Haro J, Rodrguez A, Lpez-Bao J-V, Palomares F (2010) Wireless sensor network deployment for monitoring wildlife passages. Sensors 10(8):7236–7262CrossRefGoogle Scholar
  7. Ghaffari A (2015) Congestion control mechanisms in wireless sensor networks: a survey. J Netw Comput Appl 52:101–115CrossRefGoogle Scholar
  8. Ghafoor S, Rehmani MH, Cho S, Park S-H (2014) An efficient trajectory design for mobile sink in a wireless sensor network. Comput Electr Eng 40(7):2089–2100CrossRefGoogle Scholar
  9. Gu Y, Bozda D, Brewer RW, Ekici E (2006) Data harvesting with mobile elements in wireless sensor networks. Comput Netw 50(17):3449–3465CrossRefMATHGoogle Scholar
  10. Gu Y, Ji Y, Li J, Ren F, Zhao B (2013) MS: efficient mobile sink scheduling in wireless sensor networks. Ad Hoc Netw 11(5):1556–1570CrossRefGoogle Scholar
  11. Han S-W, Jeong I-S, Kang S-H (2013) Low latency and energy efficient routing tree for wireless sensor networks with multiple mobile sinks. J Netw Comput Appl 36(1):156–166CrossRefGoogle Scholar
  12. Heinzelman WB (2000) Application-specific protocol architectures for wireless networks. PhD diss., Massachusetts Institute of TechnologyGoogle Scholar
  13. Johnson DS, McGeoch LA (2007) Experimental analysis of heuristics for the STSP. In: The traveling salesman problem and its variations. Springer, pp 369–443Google Scholar
  14. Kaswan A, Nitesh K, Jana PK (2016a) A routing load balanced trajectory design for mobile sink in wireless sensor networks. In: IEEE 2016 international conference on advances in computing, communications and informatics (ICACCI), pp 1669–1673Google Scholar
  15. Kaswan A, Nitesh K, Jana PK (2016b) Energy efficient path selection for mobile sink and data gathering in wireless sensor networks. AEU-Int J Electron Commun 73:110–118CrossRefGoogle Scholar
  16. Komal P, Nitesh K, Jana PK (2016) Indegree-based path design for mobile sink in wireless sensor networks. In: IEEE RAIT, 2016 3rd international conference on recent advances in information technology, pp 78–82Google Scholar
  17. Lai WK, Fan CS, Lin LY (2012) Arranging cluster sizes and transmission ranges for wireless sensor networks. Inf Sci 183(1):117–131CrossRefGoogle Scholar
  18. Mishra M, Nitesh K, Jana PK (2016) A delay-bound efficient path design algorithm for mobile sink in wireless sensor networks. In: IEEE RAIT, 2016 3rd international conference on recent advances in information technology, pp 72–77Google Scholar
  19. Muller KE, Fetterman BA (2002) Regression and ANOVA: an integrated approach using SAS software. SAS InstituteGoogle Scholar
  20. Nitesh K, Jana PK (2015) Energy density based dynamic path selection for mobile sink in wireless sensor networks. In: Proceedings of international conference CCSN 2015, (IEEE Xplore), held in Kolkata, India, December 24–25Google Scholar
  21. Nitesh K, Azharuddin Md, Jana PK (2017) Minimum spanning tree–based delay-aware mobile sink traversal in wireless sensor networks. Int J Commun Syst. doi: 10.1002/dac.3270 Google Scholar
  22. Salarian H, Chin K-W, Naghdy F (2014) An energy-efficient mobile-sink path selection strategy for wireless sensor networks. IEEE Trans Veh Technol 63(5):2407–2419CrossRefGoogle Scholar
  23. Samarah S, Al-Hajri M, Boukerche A (2011) A predictive energy-efficient technique to support object-tracking sensor networks. IEEE Trans Veh Technol 60(2):656–663CrossRefGoogle Scholar
  24. Shah RC, Roy S, Jain S, Brunette W (2003) Data mules: modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Netw 1(2):215–233CrossRefGoogle Scholar
  25. Shi Yi, Hou YT (2008) Theoretical results on base station movement problem for sensor network. In: IEEE the 27th conference on computer communications, INFOCOMGoogle Scholar
  26. Somasundara AA, Ramamoorthy A, Srivastava MB (2007) Mobile element scheduling with dynamic deadlines. IEEE Trans Mob Comput 6(4):395–410CrossRefGoogle Scholar
  27. Xing G, Wang T, Xie Z, Jia W (2008) Rendezvous planning in wireless sensor networks with mobile elements. IEEE Trans Mob Comput 7(12):1430–1443CrossRefGoogle Scholar
  28. Zema NR, Mitton N, Ruggeri G (2014) Using location services to autonomously drive flying mobile sinks in wireless sensor networks. In: Ad hoc networks. Springer International Publishing, pp 180–191Google Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.NIIT UniversityNeemranaIndia
  2. 2.Department of Computer Science and EngineeringIndian Institute of Technology (ISM)DhanbadIndia

Personalised recommendations