Skip to main content
Log in

An effective connected dominating set based mobility management algorithm in MANETs

  • Published:
Journal of Zhejiang University-SCIENCE A Aims and scope Submit manuscript

Abstract

This paper proposes a connected dominating set (CDS) based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks (MANETs), which ensures the connectivity and efficiency of the CDS. Compared with Wu’s algorithm, the proposed algorithm can make full use of present network conditions and involves fewer nodes. Also it has better performance with regard to the approximation factor, message complexity, and time complexity.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Alzoubi, K.M., Wan, P.J., Frieder, O., 2002. New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks. Proc. 35th Annual Hawaii Int. Conf. on System Sciences, Hilton Waikoloa Village, Island of Hawaii. IEEE Computer Society, Washington, DC, USA, p.3849–3855. [doi:10.1109/HICSS.2002.994519]

    Chapter  Google Scholar 

  • Burns, J., 1980. A Formal Model for Message Passing Systems. Technical Report TR-91. Computer Science Department, Indiana University, Bloomington, USA.

    Google Scholar 

  • Das, B., Sivakumar, R., Bharghavan, V., 1997. Routing in Ad Hoc Networks Using a Virtual Backbone. Proc. Int. Conf. on Computer Communications and Networks, Las Vegas, NV, USA. IEEE Computer Society Press, Los Alamtos, CA, USA, p.1–20. [doi:10.1109/ICC.1997.605303]

    Google Scholar 

  • Davies, V., 2000. Evaluating Mobility Models within an Ad Hoc Network. MS Thesis, Colorado School of Mines, Illinois, USA.

    Google Scholar 

  • Haas, Z., 1997. A New Routing Protocol for Reconfigurable Wireless Networks. Proc. IEEE Int. Conf. on Universal Personal Communications, San Diego, CA, USA. IEEE, New York, NY, USA, p.562–566. [doi:10.1109/ICUPC. 1997.627227]

    Google Scholar 

  • Johnson, D.B., Maltz, D.A., 1996. Dynamic Source Routing in Ad Hoc Wireless Networks. In: Imelinsky, T., Korth, H. (Eds.), Mobile Computing. Kluwer Academic Publishers, Dordrecht, the Netherlands, p.153–181. [doi:10.1007/978-0-585-29603-6_5]

    Chapter  Google Scholar 

  • Kim, W.I., Kwon, D.H., Suh, Y.J., 2001. A Reliable Route Selection Algorithm Using Global Positioning Systems in Mobile Ad Hoc Networks. Proc. IEEE Int. Conf. on Communications, Helsinki, Finland. IEEE Piscataway, NJ, p.3191–3195. [doi:10.1109/ICC.2001.937260]

    Google Scholar 

  • Lee, J.K., Hou, J.C., 2006. Modeling Steady-state and Transient Behaviors of User Mobility: Formulation, Analysis, and Application. Proc. 7th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing, Florence, Italy. ACM, New York, NY, USA, p.85–96. [doi:10.1145/1132905.1132915]

    Google Scholar 

  • Resta, G., Santi, P., 2008. WiQoSM: an integrated QoS-aware mobility and user behavior model for wireless data networks. IEEE Trans. on Mob. Comput., 7(2):187–198. [doi:10.1109/TMC.2007.70728]

    Article  Google Scholar 

  • Royer, E.M., Melliar-Smith, P.M., Moser, L.E., 2001. An Analysis of the Optimum Node Density for Ad Hoc Mobile Networks. Proc. IEEE Int. Conf. on Communications, Helsinki, Finland. IEEE Piscataway, NJ, p.857–861. [doi:10.1109/ICC.2001.937360]

    Google Scholar 

  • San, J., Puerto, R., 2007. Contention-aware Analysis of Routing Schemes for Mobile Opportunistic Networks. Proc. 1st Int. Mobile System Workshop on Mobile Opportunistic Networking, p.1–8. [doi:10.1145/1247694.1247696]

  • Santi, P., 2005. Topology control in wireless ad hoc and sensor networks. ACM Comput. Surv., 37(2):164–194. [doi:10.1145/1089733.1089736]

    Article  Google Scholar 

  • Spyropoulos, T., Psounis, K., Raghavendra, C.S., 2006. Performance Analysis of Mobility-assisted Routing. Proc. 7th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing, Florence, Italy. ACM, New York, NY, USA, p.49–60. [doi:10.1145/1132905.1132912]

    Google Scholar 

  • Su, W., Lee, S.J., Gerla, M., 2001. Mobility prediction and routing in ad hoc wireless networks. Int. J. Network Manag., 11(1):3–30. [doi:10.1002/nem.386]

    Article  MATH  Google Scholar 

  • Tolety, V., 1999. Load Reduction in Ad Hoc Networks Using Mobile Servers. MS Thesis, Colorado School of Mines, Illinois, USA.

    Google Scholar 

  • Wu, J., Li, H.L., 1999. On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. Proc. 3rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, p.7–14. [doi:10.1145/313239.313261]

  • Wu, J., Lou, W., Dai, F., 2006. Extended multipoint relays to determine connected dominating sets in MANETs. IEEE Trans. on Comput., 55(3):334–347. [doi:10.1109/TC.2006.40]

    Article  Google Scholar 

  • Yu, J.Y., Chong, P.H.J., 2005. A survey of clustering schemes for mobile ad hoc networks. IEEE Commun. Surv. Tutor., 7(1):32–38. [doi:10.1109/COMST.2005.1423333]

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shan-ping Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Xy., Yang, Xh., Sun, Jl. et al. An effective connected dominating set based mobility management algorithm in MANETs. J. Zhejiang Univ. Sci. A 9, 1318–1325 (2008). https://doi.org/10.1631/jzus.A0820189

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.A0820189

Key words

Document code

CLC number

Navigation