Abstract
The Mobile Ad-hoc NETwork (MANET) is a dynamic network topology, which is mainly achieved by mobile nodes through peer-to-peer communication or packet forwarding. However, an efficient routing algorithm between nodes is necessary to be proposed due to lack of physical backbone. As a result, a popular method which is called Connected Dominating Set (CDS) is proposed to be a virtual backbone of a MANET. The main concept of CDS is to reduce the search space for the route to the mobile node in the set. Subsequently, the CDS can be invoked to as the virtual backbone of MANET to reduce the cost of routing information and enhance the scalability of the network. However, the most algorithms cannot find the minimum CDS in a MANET. Therefore, the concept of nominate is used to our proposed algorithm to construct the minimum CDS in this paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wu, K., Harms, J.: Multipath routing for mobile ad hoc networks. J. Commun. Netw. 4(1), 48–58 (2002)
Jang, H.C., Hung, C.C.: Direction based routing strategy to reduce broadcast storm in MANET. In: 2010 International Computer Symposium (ICS2010), Tainan, pp. 445–450 (2010)
Wang, F., Thai, M.T., Du, D.Z.: On the construction of 2-connected virtual backbone in wireless networks. IEEE Trans. Wireless Commun. 8(3), 1230–1237 (2009)
Almahorg, K., Basir, O.: Performance evaluation of MANETs virtual backbone formation algorithms. In: 2009 IEEE Symposium on Computers and Communications, Sousse, pp. 787–792 (2009)
Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. J. Commun. Netw. 4(1), 59–70 (2002)
Meghanathan, N., Velummylum, N.: On the utilization of ID-based connected dominating sets for mobile ad hoc networks. Int. J. Adv. Res. Comput. Sci. 1(3), 36–43 (2010)
Meghanathan, N.: A MANET multicast routing protocol for stable trees based on the inverse of Link Expiration Times. In: 2012 IEEE Consumer Communications and Networking Conference (CCNC), Las Vegas, NV, pp. 947–951 (2012)
Meghanathan, N., Terrell, M.: An algorithm to determine stable connected dominating sets for mobile ad hoc networks using strong neighborhoods. Int. J. Comb. Optim. Probl. Inform. 3(2), 79–92 (2012)
Meghanathan, N.: An algorithm to determine minimum velocity-based stable connected dominating sets for ad hoc networks. In: International Conference on Contemporary Computing (IC3), pp. 206–217, August 2010
Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst. 15(10), 908–920 (2004)
Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless networks. In: 19th IEEE International Parallel and Distributed Processing Symposium, p. 81a (2005)
Dai, F., Wu, J.: Distributed dominant pruning in ad hoc networks. In: IEEE International Conference on Communications, ICC 2003, pp. 353–357 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Chiang, ML., Chen, ZY., Hsieh, HC., Chang, TP. (2019). Nominate Connected Dominating Set Algorithm in Mobile Ad Hoc Network. In: Pan, JS., Ito, A., Tsai, PW., Jain, L. (eds) Recent Advances in Intelligent Information Hiding and Multimedia Signal Processing. IIH-MSP 2018. Smart Innovation, Systems and Technologies, vol 109. Springer, Cham. https://doi.org/10.1007/978-3-030-03745-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-03745-1_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03744-4
Online ISBN: 978-3-030-03745-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)