Energy-aware distributed algorithm for virtual backbone in wireless sensor networks

Raei, Hassan; Sarram, Mehdi Agha; Salimi, B.; Adibniya, F.

doi:10.1109/innovations.2008.4781762

Cited by 6 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The non-CDS nodes can turn off their communication module to save energy when they have no data to be transmitted out [4]. Many researches focus on finding the minimum connected dominating set (MCDS) to construct the network virtual backbone.…”

Section: Figure 1 Unit Disk Graphs (Udg) [5]mentioning

confidence: 99%

“…Raei et al, [4] proposed an energy-aware distributed algorithm for MCDS problem in UDG with constant approximation ratio and time complexity of O(n) and message complexity of O(n). This algorithm consists of two phases; in the first phase, a maximal independent set (MIS) of the network graph is computed.…”

Section: Related Workmentioning

confidence: 99%

“…The electronics energy, E elec , is the energy dissipated per bit to run the transmitter or the receiver circuit, and depends on factors such as the digital coding and modulation, whereas the amplifier energy, ε fs d 2 or ε amp d 4 , depends on the acceptable bit-error rate. In this model, both the free space (d 2 power loss) and the multipath fading (d 4 power loss) channel models were used, depending on the distance between the transmitter and receiver.…”

Section: Energy Modelmentioning

confidence: 99%

“…In our proposed algorithm, selection of backbone nodes is done based on the proposed algorithm in [4]. In this algorithm [4], all nodes in WSN are distributed in a two dimensional plane.…”

Section: Proposed Algorithmmentioning

confidence: 99%

“…Connected dominating set (CDS) plays an important role in the construction of virtual backbone in wireless sensor networks [3,4].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Energy Efficient Backbone Formation Using Particle Swarm Optimization Algorithm in Wireless Sensor Networks

Poostfroushan¹,

Sarram²,

Sheikhpour³

2014

IJGDC

View full text Add to dashboard Cite

show abstract

Section: Figure 1 Unit Disk Graphs (Udg) [5]mentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Energy Modelmentioning

confidence: 99%

“…In our proposed algorithm, selection of backbone nodes is done based on the proposed algorithm in [4]. In this algorithm [4], all nodes in WSN are distributed in a two dimensional plane.…”

Section: Proposed Algorithmmentioning

confidence: 99%

“…Connected dominating set (CDS) plays an important role in the construction of virtual backbone in wireless sensor networks [3,4].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Energy Efficient Backbone Formation Using Particle Swarm Optimization Algorithm in Wireless Sensor Networks

Poostfroushan¹,

Sarram²,

Sheikhpour³

2014

IJGDC

View full text Add to dashboard Cite

show abstract

A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks

Markarian

Heide

Schubert

2013

Algorithms for Sensor Systems

View full text Add to dashboard Cite

Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks

et al. 2018

View full text Add to dashboard Cite

We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using the well-established disk graphs. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it.Distributed algorithms for this problem are of practical significance due to the dynamic nature of ad-hoc networks. We present a first distributed approximation algorithm, with a constant approximation factor and O(Diam) running time, where Diam is the diameter of the graph. Moreover we present a simple heuristic algorithm and conduct an extensive simulation study showing that our heuristic outperforms previously known approaches for the problem.

show abstract

Energy-aware distributed algorithm for virtual backbone in wireless sensor networks

Cited by 6 publications

References 7 publications

Energy Efficient Backbone Formation Using Particle Swarm Optimization Algorithm in Wireless Sensor Networks

Energy Efficient Backbone Formation Using Particle Swarm Optimization Algorithm in Wireless Sensor Networks

A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks

Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks

Contact Info

Product

Resources

About