scholarly journals All-IP wireless sensor networks for real-time patient monitoring

2014 ◽  
Vol 52 ◽  
pp. 406-417 ◽  
Author(s):  
Xiaonan Wang ◽  
Deguang Le ◽  
Hongbin Cheng ◽  
Conghua Xie
2011 ◽  
Vol E94-B (2) ◽  
pp. 569-572
Author(s):  
Soochang PARK ◽  
Euisin LEE ◽  
Juhyun JUNG ◽  
Sang-Ha KIM

Author(s):  
Vo Que Son ◽  
Do Tan A

Sensing, distributed computation and wireless communication are the essential building components of a Cyber-Physical System (CPS). Having many advantages such as mobility, low power, multi-hop routing, low latency, self-administration, utonomous data acquisition, and fault tolerance, Wireless Sensor Networks (WSNs) have gone beyond the scope of monitoring the environment and can be a way to support CPS. This paper presents the design, deployment, and empirical study of an eHealth system, which can remotely monitor vital signs from patients such as body temperature, blood pressure, SPO2, and heart rate. The primary contribution of this paper is the measurements of the proposed eHealth device that assesses the feasibility of WSNs for patient monitoring in hospitals in two aspects of communication and clinical sensing. Moreover, both simulation and experiment are used to investigate the performance of the design in many aspects such as networking reliability, sensing reliability, or end-to-end delay. The results show that the network achieved high reliability - nearly 97% while the sensing reliability of the vital signs can be obtained at approximately 98%. This indicates the feasibility and promise of using WSNs for continuous patient monitoring and clinical worsening detection in general hospital units.


Author(s):  
Neetika Jain ◽  
Sangeeta Mittal

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.


2013 ◽  
Vol 347-350 ◽  
pp. 975-979
Author(s):  
Rong Zhao ◽  
Cai Hong Li ◽  
Yun Jian Tan ◽  
Jun Shi ◽  
Fu Qiang Mu ◽  
...  

This paper presents a Debris Flow Disaster Faster-than-early Forecast System (DFS) with wireless sensor networks. Debris flows carrying saturated solid materials in water flowing downslope often cause severe damage to the lives and properties in their path. Faster-than-early or faster-than-real-time forecasts are imperative to save lives and reduce damage. This paper presents a novel multi-sensor networks for monitoring debris flows. The main idea is to let these sensors drift with the debris flow, to collect flow information as they move along, and to transmit the collected data to base stations in real time. The Raw data are sent to the cloud processing center from the base station. And the processed data and the video of the debris flow are display on the remote PC. The design of the system address many challenging issues, including cost, deployment efforts, and fast reaction.


Sign in / Sign up

Export Citation Format

Share Document