scholarly journals Fault-Tolerant Energy-Efficient Priority-Based Routing Scheme for the Multisink Healthcare Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Ather Saeed ◽  
Andrew Stranieri ◽  
Richard Dazeley

Wireless sensor networks (WSNs) are widely used in battle fields, logistic applications, healthcare, habitat monitoring, environmental monitoring, home security, and variety of other areas. The existing routing algorithms focus on the delivery of data packets to the sink using the shortest path; however, calculating the shortest path is not a cost-effective solution while disseminating datasets of interest to the nearest sink node. The approach presented in this paper extends the existing PBR (priority-based routing) protocol by providing a new fault-tolerant multipath priority-based routing (FT-MPPBR) scheme, which not only balances the energy consumption while selecting multiple paths but also balances the workload of the node closest to the sink. The nodes closer to the sink dissipate more energy and can become the source of a communication bottleneck. Simulation results for the proposed routing scheme are encouraging and clearly show that the FT-MPPBR has outperformed the existing PBR schemes in terms of prolonging the network lifetime and reliability. In healthcare sensor networks, timely dissemination of datasets is critical for the well-being of a patient. This research further extends the PBR architecture for supporting computational intensive analysis by transferring datasets of interest to the sensor grid node for improved communication and better throughput.

2014 ◽  
Vol 687-691 ◽  
pp. 2120-2123
Author(s):  
Jun Wei Li ◽  
Shi Ning Li ◽  
Yu Zhang

Reprogramming in lossy wireless sensor networks is a dynamic process. Dijkstra’s shortest path algorithm is used in previous work to represent the multi-hop propagation of data packets, however, it is not accurate enough to use a static model to capture the behaviors of stochastic multi-hop propagation. In this paper, we propose a stochastic multi-hop model in the analytical approach by randomly setting weight values for links between nodes. From simulations, the results of the analytical approach match that of simulations when incorporated with the stochastic multi-hop model.


Author(s):  
Marwan Ihsan Shukur

The internet of things (IoT) protocols and regulations are being developed forvarious applications includes: habitat monitoring, machinery control, general health-care, smart-homes and more. A great part of I0T comprised of sensors nodes in connected networks (i.e. sensor networks.). A sensor network is a group of nodes with sensory module and computational elements connected through network interfaces. The most interesting type of sensor networks are wireless sensor networks. The nodes here are connected through wirless interfaces. The shared medium between these nodes, creates different challenges. Congestion in such network is ineavitable. Different models andmethods were proposed to alleviate congestion in wireless sensor networks.This paper presents a semi-cluster directive congestion method that allivatenetwork congestion forpriority-baseddata transmission. The method simprove the network performance by implementing temporary cluster forlow level priority data packets while providing a clear link between highpriority data source node and the network base station. Simulation resultsshow that. The proposed method outperformes ad hocOn-demand distance vector (AODV) reactive procotol approach and priority-based congestion control dynamic clustering (PCCDC) a cluster-based methodin network energy consumption and control packets overhead during network operation.The proposed method also shows comparative improvments in end-to-enddelays versus PCCDC.


2008 ◽  
Vol 13 (1) ◽  
pp. 81-85 ◽  
Author(s):  
Wen-qing Cheng ◽  
Zhi-qiang Xiong ◽  
Wei Liu ◽  
Zong-kai Yang ◽  
Yong-jian Xu

Sign in / Sign up

Export Citation Format

Share Document