A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks

Rai, Mritunjay; Verma, Shekhar; Tapaswi, Shashikala

doi:10.4304/jnw.4.6.511-519

Cited by 44 publications

(33 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The strategies based on topology control can be divided into the three types: Multi-node transmit [19], Connected dominating set [20], Clustering algorithm [21]. Among them, clustering algorithm is widely used.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Tree-Based Self-Organizing Protocol for Internet of Things

et al. 2016

View full text Add to dashboard Cite

There are a lot of researches on self-organizing network at present. However, due to the characteristics of topological change of the Internet of Things, node resource constraints and random distribution and so on. Most of the existing self-organizing network are not applicable. This paper is aimed at the characteristics of the Internet of Things, and draws lessons from small world model, energy multi-path routing and hybrid routing algorithm. On the basis of GEAR protocol, a model of high efficient self-organizing network for large scale aware node is proposed: A multi-path hybrid routing model based on small world model, referred as SMH (Small World Multi-Path Hybrid Routing) model. In this paper, the model is implemented and an improved protocol based on GEAR is obtained, which is SMH-GEAR protocol. And SMH-GEAR protocol and GEAR protocol are compared and analyzed with simulation by using NS-2 network simulation platform. The result of the experiment shows SMH-GEAR protocol is better than GEAR protocol in terms of overall performance.

show abstract

Section: Related Workmentioning

confidence: 99%

An Efficient Tree-Based Self-Organizing Protocol for Internet of Things

et al. 2016

View full text Add to dashboard Cite

show abstract

“…Zifen Yang [15] is also smaller than our method because DAS-CDS constructed a connected dominating set through multi-leader initiated degree-based method. Figure 3 depicts the total energy consumed with different maximum speeds with increasing number of nodes.…”

Section: A Routing Algorithm Via Constructing the Wmcd Set In Manmentioning

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

“…Applications of connected dominating set problems have been reported in network design (see, e.g., [22]) and in computational biology (refer to [19]). In these applications, the undirected graph scenario is considered, although for instance protein-protein interaction networks (as considered in [19]) seem to be directed graphs from the very nature.…”

mentioning

confidence: 99%

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem

Binkele-Raible

Fernau

2012

Journal of Discrete Algorithms

View full text Add to dashboard Cite

NP-hard problems on directed graphs Outbranching with a maximum number of leaves Given a directed graph G = (V , A), the Directed Maximum Leaf Spanning Tree problem asks to compute a directed spanning tree with as many leaves as possible. By designing a branching algorithm analyzed with Measure&Conquer, we show that the problem can be solved in time O * (1.9044 n ) using polynomial space. Allowing exponential space, this run time upper bound can be lowered to O * (1.8139 n ). We also provide an example showing a lower-bound for the running time of our algorithm.

show abstract

A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks

Cited by 44 publications

References 24 publications

An Efficient Tree-Based Self-Organizing Protocol for Internet of Things

An Efficient Tree-Based Self-Organizing Protocol for Internet of Things

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

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem

Contact Info

Product

Resources

About