Reliable Energy Aware Routing In Wireless Sensor Networks

Hassanein, H.; Luo, Jing

doi:10.1109/dssns.2006.10

Cited by 100 publications

(48 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…These criteria are: (1) the minimum energy path like [18], (2) the path avoiding nodes with low residual energy like REAR [19], and (3) the path of minimum energy while avoiding nodes with low residual energy, like EOLSR (see Section 3).…”

Section: Energy Criteria Taken Into Account For Route Selectionmentioning

confidence: 99%

Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

2010

View full text Add to dashboard Cite

Sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. Energy efficient strategies are required in such networks to maximize network lifetime. In this paper, we focus on a solution integrating energy efficient routing and node activity scheduling. The energy efficient routing we propose, called EOLSR, selects the route and minimizes the energy consumed by an end-to-end transmission, while avoiding nodes with low residual energy. Simulation results show that EOLSR outperforms the solution selecting the route of minimum energy as well as the solution based on node residual energy. Cross-layering allows EOLSR to use information from the application layer or the MAC layer to reduce its overhead and increase network lifetime. Node activity scheduling is based on the following observation: the sleep state is the least power consuming state. So, to schedule node active and sleeping periods, we propose SERENA that colors all network nodes using a small number of colors, such that two nodes with the same color can transmit without interfering. The node color is mapped into a time slot during which the node can transmit. Consequently, each node is awake during its slot and the slots of its one-hop neighbors, and sleeps in the remaining time. We evaluate SERENA benefits obtained in terms of bandwidth, delay and energy. We also show how cross-layering with the application layer can improve the end-to-end delays for data gathering applications.

show abstract

Section: Energy Criteria Taken Into Account For Route Selectionmentioning

confidence: 99%

Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

2010

View full text Add to dashboard Cite

show abstract

“…• the protocols selecting the path visiting the nodes with the highest residual energy, such as (Hassanein, 2006). Each flow is ensured to have enough energy on the selected path: depleted nodes are avoided.…”

Section: Fig 2 Multipath Routingmentioning

confidence: 99%

Energy Issues and Energy Aware Routing in Wireless Ad Hoc Networks

Fotino¹,

Rango²

2011

Mobile Ad-Hoc Networks: Protocol Design

View full text Add to dashboard Cite

“…In [8] the performance of a greedy algorithm to build trees in networks of differing densities is evaluated. Our work does not examine the spanning-tree generation or request phases, as supported for example in Directed Diffusion [9], SNMS/Drip [10], and REAR [11].…”

Section: Related Workmentioning

confidence: 99%