Distributed Construction of Connected Dominating Sets Optimized by Minimum-Weight Spanning Tree in Wireless Ad-Hoc Sensor Networks

Ren, Sijun; Yi, Ping; Hong, David; Wu, Yue; Zhu, Ting

doi:10.1109/cse.2014.183

Cited by 18 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both the CDS size and the routing path length outperformed other algorithms. Ren et al [29] applied effective degree to find a prior CDS and then optimized the CDS by using Minimum-weight Spanning Tree (MST). Three-hop messages were needed to learn the path to the dominators.…”

Section: Related Workmentioning

confidence: 99%

Wireless Sensor Network MCDS Construction Algorithms With Energy Consideration for Extreme Environments Healthcare

et al. 2019

View full text Add to dashboard Cite

With the enhancement of people's health awareness, more and more users are willing to wear portable micro-health monitoring equipment and communicate with remote medicine center for real-time diagnosis. Although, under normal circumstances, users' health status can be detected at any time, in extreme circumstances, such as earthquakes, how to make the medical center monitor user data for a long time for rescue will be of great significance. In this paper, we will study the networking of portable wearable devices based on wireless sensor networks. We mainly use minimal connected dominating sets (MCDSs) to organize nodes in extreme environments effectively, form virtual backbone networks, send data to the rescue or medical personnel, and maximize network lifetime. Specifically, we propose an adverse dominator selection procedure (ADSP), where the dominators are selected by their children-independent nodes. The ADSP has two versions, which are Independent node degree-based Adverse Dominator Selection Procedure (IADSP) and residual Energy-based Adverse Dominator Selection Procedure (EADSP). Based on IADSP and EADSP, two approximation MCDS construction algorithms named Independent node degree based MCDS (IMCDS) and Energy-efficient Independent neighbor-based MCDS (EIMCDS) are proposed, respectively. Both of them have the message complexity as O(N ). The performance ratio of IMCDS has an upper bound as O( √ N ). The simulation results show that IMCDS and EIMCDS perform well in terms of CDS size, and the routing algorithm based on EIMCDS has better energy efficiency performance than that of IMCDS and classical routing protocol. INDEX TERMSAdverse dominator selection procedure, extreme environment, healthcare, minimal connected dominating set, wireless sensor networks. I. MOTIVATION

show abstract

Section: Related Workmentioning

confidence: 99%

Wireless Sensor Network MCDS Construction Algorithms With Energy Consideration for Extreme Environments Healthcare

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Sijun Ren et al, 2014 constructed a backbone using Connected Dominating Set (CDS) strategy [7]. This strategy helps building an energy efficient backbone that divides the load of the network and increases the lifetime of the network.…”

Section: Motivationmentioning

confidence: 99%

Modular Approach based Backbone Construction Using STP with CDS

Nagpal¹,

Garg²

2015

IJEM

View full text Add to dashboard Cite

In a dense environment, wireless sensor network (WSN) requires more energy to work in an effective and efficient manner. Hence, energy conservation is the main objective. In the paper, we have proposed a methodology to construct a backbone using modular antennas in combination with spanning tree protocol (STP), graph sampling, and Connecting Dominating Set (CDS) strategy. The backbone construction is based upon the modular antenna based WSNs, where the dominating sets can avoid the intermediate connection in order to reduce the hop count and energy consumption. The dominating sets have been connected using the modular transmission range of the wireless sensor networks to construct the backbone. The dominating set selection procedure to construct the WSN backbone is based upon the degree of connections of the nodes, which enables the locally centralized behavior of the connected dominating sets. The proposed methodology has been proved effective resulting in the construction of an energy efficient backbone.

show abstract

“…This heuristic can be used in cases responding quickly to frequent network changes when networks operated regionally on a large area in the real world are connected. So, we can expect an efficient CDS (connected dominating set) composition of an Ad-hoc wireless network consisting of only mobile hosts without constructing a fixed wired network [9][10][11][12].…”

Section: Introductionmentioning

confidence: 99%

Optimal Terminal Interconnection Reconstruction along with Terminal Transition in Randomly Divided Planes

Youn

Hwang

2022

JICCE

View full text Add to dashboard Cite

This paper proposes an efficient method of reconstructing interconnections when the terminals of each plane change in real-time situations where randomly divided planes are interconnected. To connect all terminals when the terminals of each plane are changed, we usually reconstruct the interconnections between all terminals. This ensures a minimum connection length, but it takes considerable time to reconstruct the interconnection for the entire terminal. This paper proposes a solution to obtain an optimal tree close to the minimum spanning tree (MST) in a short time. The construction of interconnections has been used in various design-related areas, from networks to architecture. One of these areas is an ad hoc network that only consists of mobile hosts and communicates with each other without a fixed wired network. Each host of an ad hoc network may appear or disappear frequently. Therefore, the heuristic proposed in this paper may expect various cost savings through faster interconnection reconstruction using the given information in situations where the connection target is changing.

show abstract

Distributed Construction of Connected Dominating Sets Optimized by Minimum-Weight Spanning Tree in Wireless Ad-Hoc Sensor Networks

Cited by 18 publications

References 17 publications

Wireless Sensor Network MCDS Construction Algorithms With Energy Consideration for Extreme Environments Healthcare

Wireless Sensor Network MCDS Construction Algorithms With Energy Consideration for Extreme Environments Healthcare

Modular Approach based Backbone Construction Using STP with CDS

Optimal Terminal Interconnection Reconstruction along with Terminal Transition in Randomly Divided Planes

Contact Info

Product

Resources

About