Skip to main content
Springer Nature Link
Log in

Upper bounds for the min–max and min–sum cost online problems in wireless ad hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

A sequence of online messages for connections is given, each message is important and thide failure of delivering a message is a critical event. The maximum lifetime problem maximizes the total number of messages that can be successfully sent over the network. Given a \(h\ge 1\), this paper presents two new problems on ad hoc networks (called the min–max and min–sum cost online problems), which adjust the initial energies of nodes such that the network can send the first \(h\) messages. We consider the min–sum and min–max norms for minimizing the cost of adjusting the initial energies. This paper presents an algorithm for these problems and computes upper bounds for the total cost of the min–sum and min–max norms. Mohanoor et al. (Ad hoc Networks 7: 918–931, 2009) presented three algorithms (called SWRP, SFWP and SWCRP algorithms) to online energy aware routing, which, in practice, are better than other algorithms on lifetime in the cases: the effect of session length, transmission radius and node density. This paper modifies these algorithms (the modifies algorithms are called TSWRP, TSFWP and TSWCRP) so that they compute the total cost of the min–sum and min–max norms. Then, we show, in practice, the total cost of the min–sum and min–max norms computed by our algorithm are smaller than the values computed by the TSWRP, TSFWP and TSWCRP algorithms in the cases: the transmission radius and node density. Also, in practice, the lifetime of our algorithm is more than the lifetime of the SWRP, SFWP and SWCRP algorithms in the cases: the effect of session length and node density.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Bian, F., Goel, A., Raghavendra, C. S., & Li, X. (2002). Energy-efficient broadcasting in wireless ad hoc networks lower bounds and algorithms. Journal of interconnection networks, 3, 149–166.

    Article  Google Scholar 

  2. Busch, C., Kannan, R., & Vasilakos, A. V. (2012). Approximating ongestion + ilation in networks via quality of routing games. IEEE Transactions on Computers, 61(9), 1270–1283.

    Article  MathSciNet  Google Scholar 

  3. Cagalj, M., Hubaux, J.-P., & Enz, C. (2002). Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution. In Proceedings of the ACM Mobicom (Vol. 2, pp. 172–182).

  4. Cartigny, J., Simplot, D., & Stojmenovic, I. (2003). Localized minimum-energy broadcasting in ad-hoc networks. In Proc. IEEE INFOCOM 2003 (pp. 2210–2217).

  5. Chang, J.H., & Tassiulas, L. (2000). Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks. In IFIPTC6/ European Commission International Conference. Lecture Notes in Computer Science, 1815 (pp. 702–713).

  6. Chang, J.H., & Tassiulas, L. (2000). Energy conserving routing in wireless ad-hoc networks. In Proceeding INFOCOM (pp. 22–31).

  7. Cheng, H., Xiongb, N., Vasilakosc, A. V., Yangd, L. T., Chena, G., & Zhuanga, X. (2012). Nodes organization for channel assignment with topology preservation in multi-radio wireless mesh networks. Ad hoc Networks, 10(5), 760–773.

    Article  Google Scholar 

  8. Chilamkurti, N., Zeadally, S., Vasilakos, A., & Sharma, V. (2009). Cross-layer support for energy efficient routing in wireless sensor networks. Journal of Sensors, Hindawi Publishing Corporation. doi:10.1155/2009/134165.

  9. Cianfrani, A., Eramo, V., Listanti, M., & Polverini, M. (2012). An OSPF-integrated routing strategy for qos-aware energy saving in IP backbone networks. IEEE Transactions on Network and Service Management, 9(3), 254–267.

    Article  Google Scholar 

  10. Das, A. K., Marks, R. J., El-Sharkawi, M., Arabshahi, P., & Gray, A. (2002). The minimum power broadcast problem in wireless networks: An antcolony system approach. In IEEE CAS Workshop on Wireless Communications and Networking (pp. 5–6). CA: Pasadena.

  11. Kang, I., & Poovendran, R. (2003). Maximizing static network lifetime of wireless broadcast ad hoc Networks. In Proceedings of ICC’03.

  12. Li, Q., Aslam, J., & Rus, D. (2001). Online power-aware routing in wireless ad-hoc networks. In IEEE/ACM Int. Conf. Mobile Computing and Networking (MobiCom 2001). Rome, Italy.

  13. Li, M., Li, Z., & Vasilakos, A. V. (2013). A survey on topology control in wireless sensor networks: Taxonomy, comparative study, and open issues. Proceedings of the IEEE, 101(12), 2538–2557.

    Article  Google Scholar 

  14. Li, P., Guo, S., Yu, S., & Vasilakos, A.V. (2012). An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In Proceedings of the 31rd Annual International Conferences on Computer Communications (INFOCOM'12) (pp. 100–108).

  15. Liang, W.(2002). Constructing minimum-energy broadcast trees in wireless ad hoc networks. In Proceedings of ACM Mobihoc (pp. 112–122).

  16. Madan, R., & Lall, S. (2006). Distributed algorithms for maximum lifetime routing in wireless sensor networks. IEEE Transactions Wireless Communications, 5, 2185–2193.

    Article  Google Scholar 

  17. Mohanoor, A. B., Radhakrishnan, S., & Sarangan, V. (2009). Online energy aware routing in wireless networks. Ad hoc Networks, 7, 918–931.

    Article  Google Scholar 

  18. Park, J., & Sahni, S. (2006). An online heuristic for maximum lifetime routing in wireless sensor networks. IEEE Transactions on Computers, 55, 1048–1056.

    Article  Google Scholar 

  19. Quan, W., Xu, C., Vasilakos, A.V., Guan, J., Zhang, H., & Grieco, L.A. (2014). Tree-bitmap and bloom-filter for a scalable and efficient name lookup in content-centric networking. In Proceedings of IFIP Networking.

  20. Spyropoulos, T., Rais, R. N. B., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349–2370.

    Article  Google Scholar 

  21. Toh, C. K., Cobb, H., & Scott, D. A. (2001). Performance evaluation of battery-life-aware routing schemes for wireless ad hoc networks. In Proceedings of ICC.

  22. Vasilakos, A. V., Saltouros, M. P., Atlassis, A. F., & Pedrycz, W. (2003). Optimizing qos routing in hierarchical ATM networks using computational intelligence techniques. IEEE Transactions on Systems, Man, and Cybernetics, 33(3), 297–312.

    Article  Google Scholar 

  23. Vasilakos, A. V., Zhang, Y., & Spyropoulos, T. (2012). Delay tolerant networks: Protocols and applications. Florida: CRC Press.

    Google Scholar 

  24. Wan, P.-J., Calinescu, G., Li, X.-Y., & Frieder, O. (2002). Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks, 8, 607–617.

    Article  MATH  Google Scholar 

  25. Wang, X., Vasilakos, A. V., Chen, M., Liu, Y., & Kwon, T. T. (2012). A survey of green mobile networks: Opportunities and challenges. MONET, 17(1), 4–20.

    Google Scholar 

  26. Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2000). On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proceedings of IEEE Infocom (pp. 585–594).

  27. Xiang, L., Luo, J., & Vasilakos, A. V. (2011). Compressed data aggregation for energy efficient wireless sensor networks. In Proceedings of 8th IEEE SECON (pp. 46–54).

  28. Yao, Y., Cao, Q., Vasilakos, A. V. (2013). An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for wireless sensor networks. In Proceedings of IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) (pp. 182–190).

  29. Yen, Y. S., Chao, H. C., Chang, R. S., & Vasilakos, A. V. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53, 2238–2250.

    Article  Google Scholar 

  30. Youssef, M., Ibrahim, M., Abdelatif, M., Che, L., & Vasilakos, A. V. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys and Tutorials, 16(1), 92–109.

    Article  Google Scholar 

  31. Zeng, Y., Xiang, K., Li, D., & Vasilakos, A. V. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.

    Article  Google Scholar 

  32. Zhou, L., Chao, H. C., & Vasilakos, A. V. (2011). Joint forensics-scheduling strategy for delay-sensitive multimedia applications over heterogeneous networks. IEEE Journal on Selected Areas in Communications, 29(7), 1358–1367.

    Article  Google Scholar 

  33. Zussman, G., & Segall, A. (2003). Energy efficient routing in ad hoc disaster recovery networks. Ad hoc Networks, 1, 405–421.

    Article  Google Scholar 

Download references

Acknowledgments

We would like to thank the Referee No. 2 for his/her valuable comments and suggestions, which have helped improve the quality and presentation of the paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan, Iran

    Mehdi Ghiyasvand & Iman Keshtkar

Authors
  1. Mehdi Ghiyasvand
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Iman Keshtkar
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Mehdi Ghiyasvand.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghiyasvand, M., Keshtkar, I. Upper bounds for the min–max and min–sum cost online problems in wireless ad hoc networks. Wireless Netw 21, 757–768 (2015). https://doi.org/10.1007/s11276-014-0811-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-014-0811-1

Keywords