Energy balanced data propagation in wireless sensor networks

Efthymiou, Charilaos; Nikoletseas, Sotiris; Rolim, José D. P.

doi:10.1109/ipdps.2004.1303266

Cited by 64 publications

(59 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…An attentive multipath routing method has been proposed to get energy-balanced space in Reference [12,13,15]. In Reference [16], the balance of energy consumption can be achieved by switching between two transmission paradigms: direct transmission paradigm and multi-hop transmission paradigm. The first transmission paradigm can reduce the energy consumption of sensor nodes near the sink node, because the relay energy consumption can be low in this paradigm.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A kind of novel VPF‐based energy‐balanced routing strategy for wireless mesh network

Zhang

Wang

Song

et al. 2014

Int J Communication

View full text Add to dashboard Cite

Wireless mesh network (WMN) can sense information and realize end-network transmission. It consists of numerous wireless sensors, the energy and communication ability of which are limited. A kind of novel VPF-based energy-balanced routing strategy for WMN has been presented in this paper. Most of the existing energy-efficient routing strategy always forwards packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of residual energy among sensor nodes, and eventually results in a network partition. We design the energy-balanced routing strategy by setting up a mixed virtual potential field in terms of depth and energy by using the physical potential concept. The strategy can force packets to move toward the sink through the dense energy area and protect the nodes, which has relatively low residual energy. By comparing to the other energyefficient routing strategy in our designed scenarios, the experimental results show that energy balance and throughput can be improved.

show abstract

Section: Related Workmentioning

confidence: 99%

“…But it did not cause much concern due to its huge administrative costs. In traditional networks, each node in a random deployment may be the destination node of some data packets [15][16][17].…”

Section: Introductionmentioning

confidence: 99%

A kind of novel VPF‐based energy‐balanced routing strategy for wireless mesh network

Zhang

Wang

Song

et al. 2014

Int J Communication

View full text Add to dashboard Cite

show abstract

“…There are no detailed theoretical analysis results and routing algorithm. Efthymiou et al proposed an energy balanced algorithm [17] based on the probability and hybrid transmission. They covered the network area by a cycle sector, and the sector is divided into some sector slices.…”

Section: Energy Balance Algorithmsmentioning

confidence: 99%

“…Based on the network model [1,12,14,17], this paper considers a UASN where sensor nodes are uniformly distributed in a circular area with radius L. In Figure 1 we virtually cover the network area by a circular area. The circular area is divided into n slices.…”

Section: Network Modelmentioning

confidence: 99%

PAS: probability and sub‐optimal distance‐based lifetime prolonging strategy for underwater acoustic sensor networks

Dou

Zhang

Cao³

2008

Wireless Communications

View full text Add to dashboard Cite

Lifetime prolonging is one of the most significant issues in the research on underwater acoustic sensor networks (UASNs). Unbalanced energy consumption influences greatly the network lifetime. First this study discusses a probability-based energy balance (PEB) scheme. The sensor nodes report the data to the sink by single-hop direct transmission (DT) or by multi-hop transmission (MT) under the probabilities. A centralized probabilities finding algorithm (PFA) can find a set of transmission probabilities to better balance the energy consumption. Then, a suboptimal distance (SOD)-based data transmission scheme is proposed which is a distributed scheme and operates on each sensor node. It optimizes the slice width and selects the relays near the optimum transmission range. Simulations show that the two schemes can save more energy and prolong the network lifetime efficiently.

show abstract

“…We also define a new performance metric called proximity cover time that, along with other metrics such as visit overlap statistics and proximity variation, we use to evaluate the performance properties and features of the various walks.EFFICIENT COLLECTION OF SENSOR DATA VIA A NEW ACCELERATED RANDOM WALK 1797 data-centric routing in WSNs is provided in [5] where an energy-aware distributed heuristic builds a special rooted broadcast tree with many leaves that facilitates the routing. An energy balancing protocol is presented in [6] where the presented algorithm decides in each step of the transmission whether to propagate data one hop towards the sink or to send data directly to the sink.Sink mobility can be used as a simple and energy-efficient alternative for data collection. The sink is lifting the burden of inter-node coordination by traversing the network itself.…”

mentioning

confidence: 99%

Efficient collection of sensor data via a new accelerated random walk

Angelopoulos

Nikoletseas

Patroumpa

et al. 2013

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Motivated by the problem of efficiently collecting data from wireless sensor networks via a mobile sink, we present an accelerated random walk on Random Geometric Graphs. Random walks in wireless sensor networks can serve as fully local, lightweight strategies for sink motion that significantly reduce energy dissipation but introduce higher latency in the data collection process. In most cases random walks are studied on graphs like Gn,p and Grid. Instead, we here choose the Random Geometric Graphs model (RGG), which abstracts more accurately spatial proximity in a wireless sensor network. We first evaluate an adaptive walk (the Random Walk with Inertia) on the RGG model; its performance proved to be poor and led us to define and experimentally evaluate a novel random walk which we call γ-stretched random walk. Its basic idea is to favour visiting distant neighbours of the current node towards reducing node overlap and accelerate the cover time. We also define a new performance metric called Proximity Cover Time which, along with other metrics such as visit overlap statistics and proximity variation, we use to evaluate the performance properties and features of the various walks.

show abstract

Energy balanced data propagation in wireless sensor networks

Cited by 64 publications

References 9 publications

A kind of novel VPF‐based energy‐balanced routing strategy for wireless mesh network

A kind of novel VPF‐based energy‐balanced routing strategy for wireless mesh network

PAS: probability and sub‐optimal distance‐based lifetime prolonging strategy for underwater acoustic sensor networks

Efficient collection of sensor data via a new accelerated random walk

Contact Info

Product

Resources

About