iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/s11276-014-0800-4
Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios | Wireless Networks Skip to main content

Advertisement

Springer Nature Link
Log in

Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Disasters create emergency situations and the services provided must be coordinated quickly via a communication network. Mobile adhoc networks (MANETs) are suited for ubiquitous communication during emergency rescue operations, since they do not rely on infrastructure. The route discovery process of on-demand routing protocols consumes too much bandwidth due to high routing overhead. Frequent route changes also results in frequent route computation process. Energy efficiency, quick response time, and scalability are equally important for routing in emergency MANETs. In this paper, we propose an energy efficient reactive protocol named Weighted-CDSR for routing in such situations. This protocol selects a subset of network nodes named Maximum Weighted Minimum Connected Dominating Set (MWMCDS) based on weight, which consists of link stability, mobility and energy. The MWMCDS provides the overall network control and data forwarding support. In this protocol, for every two nodes u and v in the network there exists a path between u and v such that all intermediate nodes belong to MWMCDS. Incorporating route stability into routing reduces the frequency of route failures and sustains network operations over an extended period of time. With fewer nodes providing overall network control and data forwarding support, the proposed protocol creates less interference and consumes less energy. The simulation results show that the proposed protocol is superior to other protocols in terms of packet delivery ratio, control message overhead, transmission delay and energy consumption.

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

Similar content being viewed by others

References

  1. Jang, H., Lien, Y., & Tsai, T. (2009). Rescue information system for earthquake disasters based on MANET emergency communication platform. In IWCMC 09.

  2. Guha, S., & Khuller, S. (1999). Approximation algorithms for connected dominating sets. Algorithmica, 20(4), 374–387.

  3. Wu, J., & Li, H. (1999). On calculating connected dominating set for efficient routing in ad hoc wireless networks. In DIALM’99 proceedings of 3rd internation workshop on discrete algorithms and methods for mobile computing and communications, pp. 7–14.

  4. Stojmenovic, I. (2004). Comments and corrections to “dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks”. IEEE Transactions on Parallel and Distributed Systems, 15(11), 1054–1055.

  5. Stojmenovic, I., Seddigh, M., & Zunic, J. (2002). Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 13, 14–25.

    Article  Google Scholar 

  6. Basagni, S., Mastrogiovanni, M., Panconesi, A., & Petrioli, C. (2006). Localized protocols for ad hoc clustering and backbone formation: A performance comparison. IEEE Transactions on Parallel and Distributed Systems, 17(4), 292–306.

    Article  Google Scholar 

  7. Wu, J., Gao, M., & Stojmenovic, I. (2001). On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. In International conference on parallel processing, IPPN’01, pp. 346–354.

  8. Wu, J., Dai, F., Gao, M., & Stojmenovic, I. (2002). On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. IEEE/KICS Journal of Communications and Networks, 4, 59–70.

    Article  Google Scholar 

  9. Yu, R., Wang, X., & Das, K. (2009). EEDTC: Energy efficient dominating tree construction in multi-hop wireless networks. Pervasive and Mobile Computing, 5, 318–333.

    Article  Google Scholar 

  10. Rai, M., Verna, S., & Tapaswi, S. (2009). A power aware minimum connected dominating set for wireless sensor networks. Journal of Networks, 6(6), 511–519.

    Google Scholar 

  11. Kim, B., Yang, J., Zhou, D., & Sun, M. (2005). Energy aware conneced dominating set construction in mobile ad hoc networks. In Auburn University Technical Report CSSE05-07.

  12. Ramalakshmi, R., & Radhakrishnan, S. (2012). Energy efficient stable connected dominating set construction in mobile ad hoc networks. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 84, 63–72.

    Article  Google Scholar 

  13. Shukla, K. K., & Sah, S. (2013). Construction and maintenance of virtual backbone in wireless networks. Wireless Networks. doi:10.1007/s11276-012-0512-6.

  14. Qureshi, H. K., Rizvi, S., Saleem, M., Khayam, S. A., Rakocevic, V., & Rajarajan, M. (2012). Evaluation and improvement of CDS-based topology control for wireless sensor networks. Wireless Networks,. doi:10.1007/s11276-012-0449-9.

    Google Scholar 

  15. El-Hajj, W., Trabelsi, Z., & Kountanis, D. (2007). Fast distributed dominating set based routing in large scale MANETs. Computer Communications, 30, 2880–2891.

    Article  Google Scholar 

  16. Wang, F., Min, M., Li, Y., & Du, D. (2005). On the construction of stable virtual backbones in Mobile ad hoc networks. In Proceedings for the IEEE international performance computing and communicaions conference.

  17. Sheu, P. R., Tsai, H. Y., Lee, Y. P., & Cheng, J. Y. (2009). On calculating stable connected dominating sets based on link stability for mobile ad hoc networks. Tamkang Journal of Science and Engieering, 12(4), 417–428.

    Google Scholar 

  18. Leu, S., & Chang, R. (2012). A weight-value algorithm for finding connected dominating set in a MANET. Journal of Network and Computer Applications, 35, 1615–1619.

    Article  Google Scholar 

  19. Basagni, S. (1999). Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks. In Proceedings IEEE 50th vehiclular technology conference.

  20. An, B., & Papavassiliou, S. (2001). A mobility based clustering approach to suuport mobility management and multicast routing in mobile ad hoc wireless networks. International Journal of Network Management, 11, 387–395.

    Article  Google Scholar 

  21. Wang, N., Huang, Y., & Chen, J. (2007). A stable weight-based on-demand routing protocol for mobile ad hoc networks. Information Sciences, 177, 5522–5537.

    Article  Google Scholar 

  22. Sakai, K., Sun, M. T., & Ku, W. S. (2008). Maintaining CDS in mobile ad hoc networks. Lectuere Notes in Computer Scicence, 5258, 141–153.

    Article  Google Scholar 

  23. Bao, L., & Garcia-Luna-Aceves, J. J. (2010). Stable energy aware topology management in ad hoc networks. Pervasive and Mobile Computing, 8(3), 313–327.

    Google Scholar 

  24. Al-Karaki, J. N., & Kamal, A. E. (2008). Efficient virtual backbone routing in mobile ad hoc networks. Computer Networks, 52(2), 327–350.

    Article  MATH  Google Scholar 

  25. Yen, Y., Chang, H., Chang, R., & Chao, H. (2010). Routing with adaptive path and limited flooding for mobile ad hoc networks. Computers and Electrical Engineering, 36, 280–290.

    Article  MATH  Google Scholar 

  26. Moulahi, T., Nasri, S., & Guyennet, H. (2012). Broadcasting based on dominated connecting sets with MPR in a realistic environment for WSNs & ad hoc. Journal of Network and Computer Applications, 35, 1720–1727.

    Article  Google Scholar 

  27. Yu, J., Wang, N., Wang, G., & Yu, D. (2013). Connected dominating sets in wireless ad hoc and sensor networks—a comprehensive survey. Computer Communications, 36, 121–134.

    Article  Google Scholar 

  28. Johnson, D., Hu, Y., & Maltz, D. (2007). The dynamic source routing protocol for Mobile ad hoc networks for IPv4. In Internet draft www.ietf.org/rfc/rfc4728.txt.

  29. Perkins, C., Belding-Royer, E., & Das, S. (2003). Ad hoc on-demand distance vector routing. In Internet draft www.ietf.org/rfc/rfc3561.txt.

  30. Chakeres, I., & Perkins, C. (2010). Dynamic MANET on-demand (DYMO) routing. http://tools.ietf.org/html/draft-ietf-manet-dymo-21.

  31. Das, S., Perkins, C., Royer, E., & Marina, M. (2003). Performance comparison of two on-demand routing protocols for ad hoc networks.

  32. Ramrekha, T. A., Talooki, V. N., Rodriguez, J., & Politis, C. (2012). Energy efficient and scalable routing protocol for extreme emergency ad hoc communications. Mobile Network and Applications, 17, 312–324.

    Article  Google Scholar 

  33. Macone, D., Oddi, G., & Pietrabissa, A. (2012). MQ-routing: Mobility-, GPS- and energy-aware routing protocol in MANETs for disaster relief scenarios. Ad Hoc Networks. doi:10.1016/j.adhoc.2012.09.008.

  34. Sarma, N., & Nandi, S. (2010). Route stability based QoS routing in mobile ad hoc networks. Wireless Personal Communications, 54, 203–224.

    Article  Google Scholar 

  35. Spohn, M. A., & Garcia-Luna-Aceves, J. J. (2006). Improving route discovery in on-demand routing protocols using tow-hop connected dominating sets. Pervasive and Mobile Computing, 4, 509–531.

    Google Scholar 

  36. Wu, C, Kumekawa, K., & Kato, T. (2009). A MANET protocol considering link stability and bandwidth efficiency. In Proceedings of ICUMT2009, 12th-14th October 2009, St. Petersburg, Russia.

  37. Sivakumar, R., Das, B., & Bharghavan, V. (2001). An improved spine-based infrastructure for routing in ad hoc networks. IEEE Transaction on Parallel and Distributed Systems, 13, 14–25.

    Google Scholar 

  38. Sinha, P., Sivakumar, R., & Bharghavan, V. (2001). Enhancing ad hoc routing with dynamic virtual infrastructures. In Proceedings of he 20th IEEE INFOCOM conference, vol. 3, pp. 1763–1772.

  39. Sivakumar, R., Sinha, P., & Bharghavan, V. (1999). Cedar: A core extraction distributed ad hoc routing algorithm. IEEE Journal on Selected Areas in Communications, 17, 1454–1465.

    Article  Google Scholar 

  40. Fall, K., & Varadhan, K. (2011). The ns manual, www.isi.edu/nsnam/ns/doc/ns_doc.pdf.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Kalasalingam University, Srivilliputhur, India

    R. Ramalakshmi & S. Radhakrishnan

Authors
  1. R. Ramalakshmi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Radhakrishnan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Ramalakshmi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ramalakshmi, R., Radhakrishnan, S. Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios. Wireless Netw 21, 499–512 (2015). https://doi.org/10.1007/s11276-014-0800-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-014-0800-4

Keywords

Search

Navigation