A Reliable Routing Algorithm for Delay Sensitive Data in Body Area Networks

Authors

  • Javad Mohammadzadeh Department of Computer Engineering, Karaj Branch, Islamic Azad University, Karaj, Iran.
  • Mahdi Motalebi Department of Computer Engineering, bouyinzahra Branch, Islamic Azad University, Karaj, Iran.
Abstract:

Wireless body Area networks (WBANs) include a number of sensor nodes placed inside or on the human body to improve patient health and quality of life. Ensuring the transfer and receipt of data in sensitive data is a very important issue. Routing algorithms should support a variety of service quality such as reliability and delay in sending and receiving data. Loss of information or excessive data delay can lead to loss of human life. A proper routing algorithm in WBAN networks provides an efficient route with minimum delay and higher reliability for sensitive data. In this context, a routing algorithm, as it is proposed, categorizes patient data into sensitive and non-sensitive. Sensitive packets are transmitted to the destination through the shortest route to have less delay and non-sensitive packets are transmitted from other routes. Simulation shows that the proposed algorithm performs better, in terms of the throughput than the DMQoS and RL-QRP this superiority; as a result, decreases the latency of the end.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A QoS-aware Routing Protocol for Reliability Sensitive Data in Hospital Body Area Networks

1. Introduction Body Area Networks (BAN) is an emerging field with applications to monitoring vital signs in addition to other contextual information. The challenges and characteristics of BAN are different from those of conventional Wireless Sensor Network (WSN) due to the specific challenges imposed by its architecture, density, data rate, latency, and mobility requirements. These challenges ...

full text

Energy Efficient and Reliable Data Transfer Routing in Wireless Body Area Sensor Networks

Wireless body area network, WBAN, is a network designed by low-power devices that are located on, in or around the human body and are used to monitor physiological signals and motion for medical, personal entertainment and other applications and purposes In Wireless Body Area Network, Sensor nodes are typically powered with battery, which have insufficient life time. Even though renewable energ...

full text

A Secure Routing Algorithm for Underwater Wireless Sensor Networks

Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...

full text

A new distributed routing algorithm for supporting delay-sensitive applications

We propose a new distributed delay-constrained unicast routing algorithm which can always nd a delay-constrained path with small message complexity if such a path exists. At each network node, limited information about the network state is needed and only a small amount of computation is required. Simulation results show that the proposed algorithm has much better cost performance than the leas...

full text

A Fast Multicast Routing Algorithm for Delay-Sensitive Applications

EEcient algorithm for model further extended to allow \dynamic membership" (to appear at INFOCOM'98). EEcient algorithm for low-degree multicast tree problem. 19 Conclusions Proposed algorithm produces near-optimal multicast trees for small and sparse networks. Quality of solution is maintained even when size and density of networks grow. Computation time is polynomially bounded and expected to...

full text

An Efficient Delay Sensitive Multicast Routing Algorithm

As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and tens of heuristics have been developed to solve this NP-complete problem. Among all the previously proposed algorithms, the bounded shortest path algorithm (BSMA) [15] have proved to be capable of producing a multicast t...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 4  issue 4

pages  229- 236

publication date 2018-11-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023