Constructing a CDS-Based Network Backbone for Data Collection in Wireless Sensor Networks
43
TL;DR: This paper investigates the problem of constructing an energy-balanced CDS to effectively preserve the energy of nodes in order to extend the network lifetime in data collection and proposed DGA-EBCDS, and each node in the network can effectively transmit its data through the virtual backbone.
read more
Abstract: Data collection is one of the most important operations in wireless sensor networks Currently, many researches focus on using a connected dominating set to construct a virtual backbone for data collection in WSNs Most researchers concentrate on how to construct a minimum connected dominating set because a small virtual backbone incurs less maintenance Unfortunately, computing a minimum size CDS is NP-hard, and the minimum connected dominating sets may result in unbalanced energy consumption among nodes In this paper, we investigate the problem of constructing an energy-balanced CDS to effectively preserve the energy of nodes in order to extend the network lifetime in data collection An energy-balanced connected dominating set scheme named DGA-EBCDS is proposed, and each node in the network can effectively transmit its data to the sink through the virtual backbone When constructing the virtual backbone in DGA-EBCDS, we prioritize selecting those nodes with higher energy and larger degree This method makes the energy consumption among nodes more balanced Furthermore, the routing decision in DGA-EBCDS considers both the path length and the remaining energy of nodes in the path; it further prolongs the lifetime of nodes in the backbone Our conclusions are verified by extensive simulation results
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
Stefan Funke,Alexander Kesselmann,Ulrich Meyer,Michael Segal +3 more
- 01 Jan 2005
TL;DR: This paper presents a very simple distributed algorithm for computing a small CDS, improving upon the previous best known approximation factor of 8 and implying improved approximation factors for many existing algorithm.
159
Performance Analysis of Energy Efficient Virtual Back Bone Path Based Cluster Routing Protocol for WSN
TL;DR: A CCE Virtual Backbone cluster-based routing protocol to overcome the assumption that sensor nodes can directly communicate with the sink node by selecting cluster heads using generated Virtual back bone path with multi-hop routing protocol.
24
Enhanced PEGASIS using ant colony optimization for data gathering in WSN
Saurav Ghosh,Sanjoy Mondal,Utpal Biswas +2 more
- 01 Feb 2016
TL;DR: An enhanced version of PEGASIS (E-PEGASis) which overcomes the drawbacks and is energy efficient is presented and the simulation results indicate that E-PegASIS extends the WSN lifetime in comparison to P EGASIS, Binary PEGasIS and LBEERA along with considerable reduction in data latency.
20
A dominating set based modified LEACH using Ant Colony Optimization for data gathering in WSN
Saurav Ghosh,Sanjoy Mondal,Utpal Biswas +2 more
- 01 Feb 2016
TL;DR: Simulation results indicate that LEACH-DS-ACO outperforms the rest in terms of network lifetime and is also load balanced and the results are shown to be statistically significant.
19
Highly-Efficient Bulk Data Transfer for Structured Dissemination in Wireless Embedded Network Systems
TL;DR: This work identifies the limitations of the existing structured dissemination protocols in wireless embedded network systems (WENS) and proposes an out-of-order, XOR enabled transmission mechanism for structured dissemination, and incorporates it into ULTRA, a full-slot reliable bulk data transfer mechanisms for structured bulk data dissemination.
15
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
An application-specific protocol architecture for wireless microsensor networks
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Distributed construction of connected dominating set in wireless ad hoc networks
TL;DR: This paper presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the Ω(nlog n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, thus message-optimal.
909
Distributed construction of connected dominating set in wireless ad hoc networks
Peng-Jun Wan,Khaled M. Alzoubi,Ophir Frieder +2 more
- 07 Nov 2002
TL;DR: This work presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the /spl Omega/(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, which is thus message-optimal.