Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks

Published: 01 May 2012 Publication History

Abstract

We address the problem of maximizing the lifetime of a wireless sensor network with energy-constrained sensors and a mobile sink. The sink travels among discrete locations to gather information from all the sensors. Data can be relayed among sensors and then to the sink location, as long as the sensors and the sink are within a certain threshold distance of each other. However, sending information along a data link consumes energy at both the sender and the receiver nodes. A vital problem that arises is to prescribe sink stop durations and data flow patterns that maximally prolong the life of the network, defined as the amount of time until any node exhausts its energy. We describe linear programming and column generation approaches for this problem, and also for a version in which data can be delayed in its transmission to the sink. Our column generation approach exploits special structures of the linear programming formulations so that all subproblems are shortest path problems with non-negative costs. Computational results demonstrate the efficiency of the proposed algorithms.

References

[1]
Wang, Z., Basagni, S., Melachrinoudis, E. and Petrioli, C., Exploiting sink mobility for maximizing sensor networks lifetime. In: Proceedings of the 38th annual Hawaii international conference on system sciences, vol. 9. IEEE Computer Society, Waikoloa, HI. pp. 287
[2]
Gatzianas, M. and Georgiadis, L., A distributed algorithm for maximum lifetime routing in sensor networks with mobile sink. IEEE Transactions on Wireless Communications. v7 i3. 984-994.
[3]
Luo J, Hubaux JP. Joint mobility and routing for lifetime elongation in wireless sensor networks. In: IEEE INFOCOM '05, 2005. p. 1735-46.
[4]
Shah RC, Roy S, Jain S, Brunette W. Data MULEs: Modeling a three-tier architecture for sparse sensor networks. In: The First IEEE International Workshop on Sensor Network Protocols and Applications, SNPA 2003. Anchorage, AK; 2003. p. 30-41.
[5]
Basagni, S., Carosi, A., Melachrinoudis, E., Petrioli, C. and Wang, Z.M., A new MILP formulation and distributed protocols for wireless sensor networks lifetime maximization. In: IEEE international conference on communications, pp. 3517-3524.
[6]
Wang, W., Srinivasan, V. and Chua, K.C., Using mobile relays to prolong the lifetime of wireless sensor networks. In: MobiCom '05, pp. 270-283.
[7]
Papadimitriou, I. and Georgiadis, L., Maximum lifetime routing to mobile sink in wireless sensor networks. In: IEEE SoftCom '05,
[8]
Gandham, S.R., Dawande, M., Prakash, R. and Venkatesan, S., Energy efficient schemes for wireless sensor networks with multiple mobile base stations. In: IEEE GLOBECOM '03, pp. 377-381.
[9]
Shi, Y. and Hou, Y.T., Theoretical results on base station movement problem for sensor network. In: IEEE INFOCOM '08, pp. 1-5.
[10]
Chang J, Tassiulas L. Routing for maximum system lifetime in wireless ad hoc networks. In: 37th Annual allertion conference communication, control, and computing, vol. 37, Monticello, IL; 1999. p. 1191-200.
[11]
Chang, J. and Tassiulas, L., Maximum lifetime routing in wireless sensor networks. IEEE/ACM Transactions on Networking. v12. 609-619.
[12]
Li, J. and Mohapatra, P., An analytical model for the energy hole problem in many-to-one sensor networks. In: Proceedings of vehicular technology conference, pp. 2721-2725.
[13]
Li, J. and Mohapatra, P., Analytical modeling and mitigation techniques for the energy hole problem in sensor networks. Pervasive and Mobile Computing. v3 i8. 233-254.
[14]
Wu, X., Chen, G. and Das, S.K., Avoiding energy holes in wireless sensor networks with nonuniform node distribution. IEEE Transactions on Parallel and Distributed Systems. v19 i5. 710-720.
[15]
Popa, L., Rostamizadeh, A., Karp, R.M. and Papadimitriou, C., Balancing traffic load in wireless networks with curveball routing. In: MobiHoc '07, pp. 170-179.
[16]
Madan, R. and Lall, S., Distributed algorithms for maximum lifetime routing in wireless sensor networks. In: IEEE GLOBECOM '04, pp. 748-753.
[17]
Sankar, A. and Liu, Z., Maximum lifetime routing in wireless ad-hoc networks. In: IEEE INFOCOM '04, vol. 2. pp. 1089-1097.
[18]
Yun, Y. and Xia, Y., Maximizing the lifetime of wireless sensor networks with mobile sink in delay-tolerant applications. IEEE Transactions on Mobile Computing. v9 i9. 1308-1318.
[19]
Chandy, K.M. and Misra, J., Distributed computation on graphs: shortest path algorithms. Communications of the ACM. v25 i11. 833-837.
[20]
Yang, S., Cheng, H. and Wang, F., Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews. v40 i1. 52-63.
[21]
Wang, G. and Wang, G., An energy-aware geographic routing algorithm for mobile ad hoc network. In: WiCom '09, pp. 1-4.
[22]
Heinzelman WR, Chadrakasan A, Balakrishnan H. Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Hawaii international conference on system sciences. Wailea Maui, HI; 2000. p. 1-10.
[23]
Rappaport, T.S., Wireless communications: principles and practice. 1996. Prentice Hall.
[24]
Bazaraa, M.S., Jarvis, J.J. and Sherali, H.D., Linear programming and network flows. 2005. 3rd ed. John Wiley and Sons, Inc.
[25]
Heinzelman WB. Application specific protocol architectures for wireless networks. PhD thesis. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology: Boston, MA; 2000.

Cited By

View all
  • (2024)Lifetime maximization of wireless sensor networks while ensuring intruder detectionSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-024-09692-128:5(4197-4215)Online publication date: 1-Mar-2024
  • (2018)Mobile data gathering using PSO and minimum covering spanning tree clustered WSNInternational Journal of Mobile Network Design and Innovation10.5555/3272206.32722118:2(101-110)Online publication date: 1-Jan-2018
  • (2018)Mobile data gathering using PSO and minimum covering spanning tree clustered WSNInternational Journal of Mobile Network Design and Innovation10.5555/3272193.32721988:2(101-110)Online publication date: 1-Jan-2018
  • Show More Cited By
  1. Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Computers and Operations Research
      Computers and Operations Research  Volume 39, Issue 5
      May, 2012
      321 pages

      Publisher

      Elsevier Science Ltd.

      United Kingdom

      Publication History

      Published: 01 May 2012

      Author Tags

      1. Column generation
      2. Lifetime maximization
      3. Linear programming
      4. Mobile sink
      5. Wireless sensor network

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 10 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Lifetime maximization of wireless sensor networks while ensuring intruder detectionSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-024-09692-128:5(4197-4215)Online publication date: 1-Mar-2024
      • (2018)Mobile data gathering using PSO and minimum covering spanning tree clustered WSNInternational Journal of Mobile Network Design and Innovation10.5555/3272206.32722118:2(101-110)Online publication date: 1-Jan-2018
      • (2018)Mobile data gathering using PSO and minimum covering spanning tree clustered WSNInternational Journal of Mobile Network Design and Innovation10.5555/3272193.32721988:2(101-110)Online publication date: 1-Jan-2018
      • (2018)Mobile data gathering using PSO and minimum covering spanning tree clustered WSNInternational Journal of Mobile Network Design and Innovation10.5555/3272186.32721918:2(101-110)Online publication date: 1-Jan-2018
      • (2016)Wireless sensor network design by lifetime maximisationInternational Journal of Sensor Networks10.1504/IJSNET.2016.07536320:3(131-146)Online publication date: 1-Mar-2016
      • (2016)Switching algorithm with prediction strategy for maximizing lifetime in wireless sensor networkInternational Journal of Distributed Sensor Networks10.1155/2015/5920932015(230-230)Online publication date: 1-Jan-2016
      • (2016)A survey of optimization algorithms for wireless sensor network lifetime maximizationComputers and Industrial Engineering10.1016/j.cie.2016.08.028101:C(145-166)Online publication date: 1-Nov-2016
      • (2015)Lifetime optimization algorithm with mobile sink nodes for wireless sensor networks based on location informationInternational Journal of Distributed Sensor Networks10.1155/2015/8576732015(16-16)Online publication date: 1-Jan-2015
      • (2015)Maximizing lifetime in wireless sensor networks with multiple sensor familiesComputers and Operations Research10.1016/j.cor.2015.02.01360:C(121-137)Online publication date: 1-Aug-2015
      • (2015)Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networksComputers and Operations Research10.1016/j.cor.2015.02.00159:C(132-143)Online publication date: 1-Jul-2015
      • Show More Cited By

      View Options

      View options

      Get Access

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media