Extending Lifetime of Biomedical Wireless Sensor Networks using Energy-Aware Routing and Relay Nodes

Author(s):  
Carlos Abreu ◽  
P. M. Mendes

Biomedical wireless sensor networks are a key technology to enable the development of new healthcare services and/or applications, reducing costs and improving the citizen's quality of life. However, since they deal with health data, such networks should implement mechanisms to enforce high levels of quality of service. In most cases, the sensor nodes that form such networks are small and battery powered, and these extra quality of service mechanisms mean significant lifetime reduction due to the extra energy consumption. The network lifetime is thus a relevant feature to ensure the necessary quality of service requirements. In order to maximise the network lifetime, and its ability to offer the required quality of service, new strategies are needed to increase the energy efficiency, and balance in the network. The focus of this work goes to the effective use of the available energy in each node, combined with information about the reliability of the wireless links, as a metric to form reliable and energy-aware routes throughout the network. This paper present and discusses two different deployment strategies using energy-aware routing and relay nodes, assessed for different logical topologies. The authors' conclusion is that the use of energy-aware routing combined with strategic placed relay nodes my increase the network lifetime as high as 45%.

2018 ◽  
pp. 714-726
Author(s):  
Carlos Abreu ◽  
Paulo M. Mendes

Biomedical wireless sensor networks are a key technology to enable the development of new healthcare services and/or applications, reducing costs and improving the citizen's quality of life. However, since they deal with health data, such networks should implement mechanisms to enforce high levels of quality of service. In most cases, the sensor nodes that form such networks are small and battery powered, and these extra quality of service mechanisms mean significant lifetime reduction due to the extra energy consumption. The network lifetime is thus a relevant feature to ensure the necessary quality of service requirements. In order to maximise the network lifetime, and its ability to offer the required quality of service, new strategies are needed to increase the energy efficiency, and balance in the network. The focus of this work goes to the effective use of the available energy in each node, combined with information about the reliability of the wireless links, as a metric to form reliable and energy-aware routes throughout the network. This paper present and discusses two different deployment strategies using energy-aware routing and relay nodes, assessed for different logical topologies. The authors' conclusion is that the use of energy-aware routing combined with strategic placed relay nodes my increase the network lifetime as high as 45%.


2013 ◽  
Vol 4 (3) ◽  
pp. 776-787
Author(s):  
Nitin Nitin

This paper presents, Application of Gur Game Based Algorithm on Wireless Sensor Networks (WSNs) deployed to monitor Homogenous and Heterogeneous Grid in order to achieve Quality of Service (QoS) = 0.40 and 0.50. Further, the objectives of all these algorithms are to maximize the coverage of the sensor area while conserving energy consumed by sensor nodes. This is achieved via carefully activating/deactivating the sensors while maximizing the coverage area.


The fundamental issue is framing the sensor nodes and steering the information from sender node to receiver node in wireless sensor networks (WSN). To resolve this major difficulty, clustering algorithm is one of the accessible methods employed in wireless sensor networks. Still, clustering concept also faces some hurdles while transmitting the data from source to destination node. The sensor node is used to sense the data and the source node helps to convey the information and the intended recipient receives the sensed information. The clustering proposal will choose the cluster head depending on the residual energy and the sensor utility to its cluster members. The cluster heads will have equal cluster number of nodes. The complexity is generated in computing the shortest path and this can be optimized by Dijkstra’s algorithm. The optimization is executed by Dijkstra’s shortest path algorithm that eliminates the delay in packet delivery, energy consumption, lifetime of the packet and hop count while handling the difficulties. The shortest path calculation will improve the quality of service (QoS). QoS is the crucial problem due to loss of energy and resource computation as well as the privacy in wireless sensor networks. The security can be improvised in this projected work. The preventive metrics are discussed to upgrade the QoS facility by civilizing the privacy parameter called as Safe and Efficient Query Processing (SAFEQ) and integrating the extended watchdog algorithm in wireless sensor networks.


2013 ◽  
Vol 706-708 ◽  
pp. 635-638
Author(s):  
Yong Lv

Wireless Sensor Networks consisting of nodes with limited power are deployed to collect and distribute useful information from the field to the other sensor nodes. Energy consumption is a key issue in the sensor’s communications since many use battery power, which is limited. In this paper, we describe a novel energy efficient routing approach which combines swarm intelligence, especially the ant colony based meta-heuristic, with a novel variation of reinforcement learning for sensor networks (ARNet). The main goal of our study was to maintain network lifetime at a maximum, while discovering the shortest paths from the source nodes to the sink node using an improved swarm intelligence. ARNet balances the energy consumption of nodes in the network and extends the network lifetime. Simulation results show that compared with the traditional EEABR algorithm can obviously improve adaptability and reduce the average energy consumption effectively.


2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Hind Alwan ◽  
Anjali Agarwal

With the growing demand for quality-of-service (QoS) aware routing protocol in wireless networks, QoS-based routing has emerged as an interesting research topic. Quality of service guarantee in wireless sensor networks (WSNs) is difficult and more challenging due to the fact that the available resources of sensors and the various applications running over these networks have different constraints in their nature and requirements. In this paper, we present a heuristic neighbor selection mechanism in WSNs that uses the geographic routing mechanism combined with the QoS requirements to provide multiobjective QoS routing (MQoSR) for different application requirements. The problem of providing QoS routing is formulated as link, and path-based metrics. The link-based metrics are partitioned in terms of reliability, delay, distance to sink, and energy, and the path-based metrics are presented in terms of end-to-end delay, reliability of data transmission, and network lifetime. The simulation results demonstrate that MQoSR protocol is able to achieve the delay requirements, and due to optimum path selection process, the achieved data delivery ratio is always above the required one. MQoSR protocol outperforms the existing model in the literature remarkably in terms of reliable data transmission, time data delivery, and routing overhead and underlines the importance of energy-efficient solution to enhance network lifetime.


Author(s):  
Ghassan Samara ◽  
Mohammad Aljaidi

<span lang="EN-US">Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.</span>


Author(s):  
Omar Adil Mahdi ◽  
Yusor Rafid Bahar Al-Mayouf ◽  
Ahmed Basil Ghazi ◽  
Mazin Abed Mohammed ◽  
Ainuddin Wahid Abdul Wahab ◽  
...  

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In view of this goal, a link cost function is introduced to assess the quality of the links by considering the new multi-criteria node weight metric, in which energy and load balancing are considered. The node weight is considered in constructing and updating the routing tree to achieve dynamic behavior for event-driven WSNs. The proposed EBR-DA was evaluated and validated by simulation, and the results were compared with those of InFRA and DRINA by using performance metrics for dense static networks.</p>


Author(s):  
Ghassan Samara ◽  
Mohammad Aljaidi

<span lang="EN-US">Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.</span>


Sensors ◽  
2019 ◽  
Vol 19 (18) ◽  
pp. 4036 ◽  
Author(s):  
Muhammad K. Shahzad ◽  
S. M. Riazul Islam ◽  
Kyung-Sup Kwak ◽  
Lewis Nkenyereye

Static sink-based wireless sensor networks (WSNs) suffer from an energy-hole problem. This incurs as the rate of energy consumption on sensor nodes around sinks and on critical paths is considerably faster. State-of-the-art en-routing filtering schemes save energy by countering false report injection attacks. In addition to their unique limitations, these schemes generally do not examine energy awareness in underlying routing. Mostly, these security methods are based on a fixed filtering capacity, unable to respond to changes in attack intensity. Therefore, these limitations cause network partition(s), exhibiting adverse effects on network lifetime. Extending network lifetime while preserving energy and security thus becomes an interesting challenge. In this article, we address the aforesaid shortcomings with the proposed adaptive en-route filtering (AEF) scheme. In energy-aware routing, the fitness function, which is used to select forwarding nodes, considers residual energy and other factors as opposed to distance only. In pre-deterministic key distribution, keys are distributed based on the consideration of having paths with a different number of verification nodes. This, consequently, permits us to have multiple paths with different security levels that can be exploited to counter different attack intensities. Taken together, the integration of the special fitness function with the new key distribution approach enables the AEF to adapt the underlying dynamic network conditions. The simulation experiments under different settings show significant improvements in network lifetime.


Sign in / Sign up

Export Citation Format

Share Document