Constructing Distributed Connected Dominating Sets in Wireless Ad Hoc and Sensor Networks

Zheng, Chan; Sun, Shaojun; Huang, Tian-Yun

doi:10.3724/sp.j.1001.2011.00586

Cited by 9 publications

(10 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many works [4][5][6][7] try to construct minimum CDS with two kinds of methods. The reduction-based methods [4,5] construct a CDS from one node with maximum degree. Initially, a node is colored and its neighbors are colored with other color.…”

Section: Related Work On Finding Mcdsmentioning

confidence: 99%

Improved Route Discovery Based on Constructing Connected Dominating Set in MANET

Yang

Han

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

A mobile ad hoc network (MANET) is widely applied in various urgent scenarios, benefiting from its feature that the hosts can communicate with each other without any physical infrastructure. An efficient routing function plays a critical role in MANET, and routing based on CDS is a promising approach. In this paper, a novel approach is proposed to obtain a stable routing path and prolong lifetime of MANET, by integrating three factors such as energy, mobility, and degree for the status of node minimum connected dominating set (SoN-MCDS). Extensive simulations show that the proposed protocol is superior to other classical ones in terms of lifetime and low energy consumption.

show abstract

Section: Related Work On Finding Mcdsmentioning

confidence: 99%

Improved Route Discovery Based on Constructing Connected Dominating Set in MANET

Yang

Han

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…In Reference [11], a CDS based distributed algorithm was proposed based on node IDs to reduce the size of CDS. A reduction-based methods were presented in References [12,13] to find a CDS from one node with maximum vertex degree and some rules were also introduced to reduce the size of CDS. To construct a CDS for routing protocol, an algorithm with rules based on energy level and degree of nodes was proposed in Reference [14].…”

Section: Introductionmentioning

confidence: 99%

An Efficient Connected Dominating Set Clustering Based Routing Protocol with Dynamic Channel Selection in Cognitive Mobile Ad Hoc Networks

Tran

Nguyen

2019

Electronics

View full text Add to dashboard Cite

In mobile ad-hoc networks (MANETs), nodes are mobility naturally which renders a great challenge in topology controls. Connected dominating set (CDS) has been considered as an efficient solution to solve such a problem by constructing a virtual backbone network to achieve the scalability and efficiency of wireless networks. In this paper, we propose an efficient connected dominating set clustering based routing protocol with dynamic channel selection (CRD) in multi-channel cognitive radio MANETs to obtain high packet delivery ratio (PDR), low control overheads, low delay and low energy consumption when node is moving in high speed. Moreover, CRD protocol can apply for Vehicular Ad Hoc Network, IoT and 5G. The proposed CRD protocol includes clustering and routing phases under multi-channel cognitive radio approach. In the clustering phase, we propose CDS selection, CDS size reduction and CDS based clustering algorithms to formulate clusters and provide a set of intermediate nodes which is latter used as a route searching space for the routing phase. In the routing phase, a sending channel based focus region selection (CFS) algorithm is adopted dynamically to establish an efficient route from a set of intermediate nodes that avoids the affected region of a primary user. The CRD routing protocol is then implemented in environmental conditions close to reality (OMNET++ platform) to demonstrate its superiority over the conventional AODV protocol in terms of PDR, control overhead, delay and energy consumption.

show abstract

“…Each node acts as a routing node responseding to the changes of network topology [4]. A popular routing protocol for MANET utilizes a broadcasting scheme to discover a rout, in which the nodes will repeat sending orreceiving broadcast signal [5]; however, the flooding of signal causes congestion and consumes more battery power which is impossible to get recharged in time.…”

Section: Introductionmentioning

confidence: 99%

A Routing Algorithm via Constructing the Weighted Minimum Connected Dominating Set in Mobile Adhoc Network

Yang¹,

Li²,

Fu³

et al. 2017

Proceedings of the 7th International Conference on Computer Engineering and Networks — PoS(CENet2017)

View full text Add to dashboard Cite

A mobile ad-hoc network (MANET) is made up of a group of mobile wireless nodes, which can be flexibly and quickly applied to many applications. The devices in MANET are often suffering from the issue of battery power since they cannot be charged in time. Then, as benefitting from the fact that the fewer nodes provide data forwarding support and the less energy will be consumed, many methods utilize the connecting dominate set (CDS) to prolong the network lifetime. However, constructing a smallest size of CDS is a NP-complete problem. In this paper, we propose a new greedy approach constructing a weighted CDS (Cgreedy-wMCDS) by integrating three factors such as energy, mobility and degree of nodes. The proposed method provides the whole network control and data forwarding support. This new method incorporats route stability into the routing algorithm to reduce the route path failures. The simulation results show that the approach of Cgreedy-wMCDS is superior to other methods in terms of prolonging the lifetime of MANET. The time complexity of our algorithm is ( O D), where D is the network diameter.

show abstract

Constructing Distributed Connected Dominating Sets in Wireless Ad Hoc and Sensor Networks

Cited by 9 publications

References 1 publication

Improved Route Discovery Based on Constructing Connected Dominating Set in MANET

Improved Route Discovery Based on Constructing Connected Dominating Set in MANET

An Efficient Connected Dominating Set Clustering Based Routing Protocol with Dynamic Channel Selection in Cognitive Mobile Ad Hoc Networks

A Routing Algorithm via Constructing the Weighted Minimum Connected Dominating Set in Mobile Adhoc Network

Contact Info

Product

Resources

About