Algorithm for optimizing energy use and path resilience in sensor networks

Bush, L.A.; Carothers, C.D.; Szymanski, Boleslaw K.

doi:10.1109/ewsn.2005.1462031

Cited by 11 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Energy efficient algorithms [1]- [3] aims at increase the lifetime of the network as a whole without measuring residual energy in the battery. They will for example distribute the routed packages to several neighbours to minimise the energy consumption of the nodes on the shortest path.…”

Section: Related Workmentioning

confidence: 99%

DEHAR: A distributed energy harvesting aware routing algorithm for ad-hoc multi-hop wireless sensor networks

Jakobsen

Madsen

Hansen

2010

2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

One of the key design goals in Wireless Sensor Networks is long lasting or even continuous operation. Continuous operation is made possible through energy harvesting. Keeping the network operational imposes a demand to prevent network segmentation and power loss in nodes. It is therefore important that the best energy-wise route is found for each data transfer from a source node to the sink node. We present a new adaptive and distributed routing algorithm for finding energy optimised routes in a wireless sensor network with energy harvesting. The algorithm finds an energy efficient route from each source node to a single sink node, taking into account the current energy status of the network. By simulation, the algorithm is shown to be able to adapt to changes in harvested and stored energy. Simulations show that continuous operation is possible.

show abstract

Section: Related Workmentioning

confidence: 99%

DEHAR: A distributed energy harvesting aware routing algorithm for ad-hoc multi-hop wireless sensor networks

Jakobsen

Madsen

Hansen

2010

2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

show abstract

“…RAP [7] allows provides delay differentiation by determining packet priority based on its delivery deadline and destination. Source initiated DD increases reliability by sending a packet via multiple paths [8]. The cost-field based routing protocols proposed in [9] and [10] maintain multiple routes between source and destination nodes.…”

Section: Introductionmentioning

confidence: 99%

Cost-Aware Dynamic Routing Protocol for Wireless Sensor Networks - Design and Prototype Experiments

Suhonen

Kuorilehto

Hännikäinen

et al. 2006

2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

This paper presents an energy-efficient multi-hop routing protocol for wireless sensor networks. The protocol uses cost metrics to create gradients from a source to a destination node. The cost metrics consist of energy, node load, delay, and link reliability information that provide a trade-off between performance and energy usage. A node can query routes from its neighbors, which allows efficient recovery from route losses. The protocol is the first cost-field based WSN routing protocol suitable for low processing and memory capacity nodes that is tested in a practical real-world environment. The protocol performance is evaluated on full scale prototype implementation consisting of 38 ultra-low power nodes in indoor environment. Compared to traditional flooding, the protocol requires only 25% of the bandwidth, while having smaller end-to-end delays.

show abstract

“…Redundant source-sink paths are constructed in braided multi-path routing algorithms [8], [9], which are multipath versions of Directed Diffusion. In these works, N routes are reinforced after the flooding stage and maintained with either 'keep alive' packets [8] or by alternatively sending the data in a round robin manner on each path to reduce the route maintenance load [9]. Such solutions, where routes have to be directly defined also introduce additional delay in the set up stage of the network.…”

mentioning

confidence: 99%

Interference and Congestion Aware Gradient Broadcasting Routing for Wireless Sensor Networks

Jaffrès-Runser,

Comaniciu,

Gorce

2009

Preprint

View full text Add to dashboard Cite

This paper addresses the problem of reliable transmission of data through a sensor network. We focus on networks rapidly deployed in harsh environments. For these networks, important design requirements are fast data transmission and rapid network setup, as well as minimized energy consumption for increased network lifetime. We propose a novel broadcasting solution that accounts for the interference impact and the congestion level of the channel, in order to improve robustness, energy consumption and delay performance, compared to a benchmark routing protocol, the GRAB algorithm. Three solutions are proposed: P-GRAB, a probabilistic routing algorithm for interference mitigation, U-GRAB, a utility-based algorithm that adjusts to real-time congestion and UP-GRAB, a combination of P-GRAB and U-GRAB. It is shown that P-GRAB provides the best performance for geometry-aware networks while the U-GRAB approach is the best option for unreliable and unstable networks.

show abstract

Algorithm for optimizing energy use and path resilience in sensor networks

Abstract: Abstract

Cited by 11 publications

References 6 publications

DEHAR: A distributed energy harvesting aware routing algorithm for ad-hoc multi-hop wireless sensor networks

DEHAR: A distributed energy harvesting aware routing algorithm for ad-hoc multi-hop wireless sensor networks

Cost-Aware Dynamic Routing Protocol for Wireless Sensor Networks - Design and Prototype Experiments

Interference and Congestion Aware Gradient Broadcasting Routing for Wireless Sensor Networks

Contact Info

Product

Resources

About