Energy efficient data management for wireless sensor networks with data sink failure

Lee, Hyun‐Young; Klappenecker, Andreas; Lee, Kyoungsook; Lin, Li

doi:10.1109/mahss.2005.1542801

Cited by 6 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We define the network lifetime as the time when the residual energy of the earliest sensor node becomes zero, which is counted by round. We compare the performance of DERVP algorithm with an energy level based routing (ELBR) [26], a shortest path based routing (SPBR) [27], and an energy-balanced routing protocol (EBRP) [28] on the network lifetime, energy balance, and energy efficiency. In our simulations, sensors are randomly and uniformly deployed over the square monitoring area.…”

Section: Resultsmentioning

confidence: 99%

A Distributed Energy Optimized Routing Using Virtual Potential Field in Wireless Sensor Networks

Jiang

Sun

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Energy is an extremely critical resource for battery-powered wireless sensor networks. Since data transmission typically consumes more energy than any other activities on a sensor node, it is of great importance to design energy optimized routing algorithm to achieve both energy efficiency and energy balance together, in order to prolong the network lifetime. In this paper, with the help of the concept of potential field in physics, we design a distributed energy optimized routing by constructing a hybrid potential field. The goal of this basic approach is to force packets to move toward the sink at the same time to achieve energy balance among neighbors. We adopt the social welfare function from social sciences to predict equality of residual energy of neighbors after selecting different next nodes, which is used to compute the potential value in energy balance potential field. Simulation results show that the algorithm effectively extends the network lifetime, has good performance on energy balance of sensors, and decreases the average hop of data transmission with the increase of the number of sinks, compared with similar algorithms.

show abstract

Section: Resultsmentioning

confidence: 99%

A Distributed Energy Optimized Routing Using Virtual Potential Field in Wireless Sensor Networks

Jiang

Sun

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…In (Che, Al-Khateeb, & Anwar, 2010) the authors enhance the AODV routing protocol to apply a backup route for each node along the routing path, then in case of failure, the backup route is used to forward data immediately, when the detecting node requests a new backup. Hyunyoung Lee et al (Hyunyoung, Klappenecker, Kyungsook & Lan, 2005) have proposed a novel approach based on the graph theory (De Berg, Van Kreveld, Overmars, & Schwarzkopf, 1997;Bollobas, 1986), this method implement a hierarchical variable length addressing scheme in which a special nodes "relay" initiate the address allocation process by sending a message that contain their own addresses ( rel node a a ), the receiving nodes put the received address as a prefix of their own ( rel a ), hen forward the message and so on, in this way each address represent a route, and thus no routing protocol is needed, in case of failure of node N, the nodes which have the address of N as prefix request another address from their neighbors. Author in (Belghachi & Feham, 2009) has modified the routing process of AODV by introducing the number of neighbors and the delay of each as a metric to select the route that can be easily repaired.…”

Section: Related Workmentioning

confidence: 99%

Energy Efficient Fault Tolerant Routing Mechanism for Wireless Sensor Network

Roumane¹,

Kechar²,

Kouninef³

2012

CIS

View full text Add to dashboard Cite

Wireless sensor networks are self-organizing systems with resource-constraints that are often deployed in inhospitable and inaccessible environments in order to gather data about some phenomenon in the outside world. For most sensor network applications, point-to-point reliability is not the main objective (Paradis & Qi, 2007); Instead, reliable delivery of the interesting event to the server has to be guaranteed (may be with a certain probability). The communication in such networks is unpredictable and failure-prone, even more so than in regular wireless ad hoc networks. Hence, it is vital to provide fault tolerant techniques for distributed applications in sensor network. Several approaches have been proposed in many recent studies to address the fault tolerance issue in application, transport and/or routing layers. In this paper, we propose a slight modification of the conventional routing (destination, next hop) by introducing the second hop information in the route construction phase in order to use it in case of node/link failure (skip only the failed link). Furthermore, the implementation of this proposed routing technique stabilizes the throughput, reduces the average jitter, provides low control overhead and decreases the energy consumption of the network. As a result, the reliability, availability, energy-efficiency and maintainability of the network are achieved

show abstract

Internet of Things perception reliability

Xing

2024

Reliability and Resilience in the Internet of Things

View full text Add to dashboard Cite

Energy efficient data management for wireless sensor networks with data sink failure

Cited by 6 publications

References 20 publications

A Distributed Energy Optimized Routing Using Virtual Potential Field in Wireless Sensor Networks

A Distributed Energy Optimized Routing Using Virtual Potential Field in Wireless Sensor Networks

Energy Efficient Fault Tolerant Routing Mechanism for Wireless Sensor Network

Internet of Things perception reliability

Contact Info

Product

Resources

About