6,421 research outputs found
Efficient Mobile Data Collection with Mobile Collect
WISENET (NES)PromosCONE
Distance Aware Relaying Energy-efficient: DARE to Monitor Patients in Multi-hop Body Area Sensor Networks
In recent years, interests in the applications of Wireless Body Area Sensor
Network (WBASN) is noticeably developed. WBASN is playing a significant role to
get the real time and precise data with reduced level of energy consumption. It
comprises of tiny, lightweight and energy restricted sensors, placed in/on the
human body, to monitor any ambiguity in body organs and measure various
biomedical parameters. In this study, a protocol named Distance Aware Relaying
Energy-efficient (DARE) to monitor patients in multi-hop Body Area Sensor
Networks (BASNs) is proposed. The protocol operates by investigating the ward
of a hospital comprising of eight patients, under different topologies by
positioning the sink at different locations or making it static or mobile.
Seven sensors are attached to each patient, measuring different parameters of
Electrocardiogram (ECG), pulse rate, heart rate, temperature level, glucose
level, toxins level and motion. To reduce the energy consumption, these sensors
communicate with the sink via an on-body relay, affixed on the chest of each
patient. The body relay possesses higher energy resources as compared to the
body sensors as, they perform aggregation and relaying of data to the sink
node. A comparison is also conducted conducted with another protocol of BAN
named, Mobility-supporting Adaptive Threshold-based Thermal-aware
Energy-efficient Multi-hop ProTocol (M-ATTEMPT). The simulation results show
that, the proposed protocol achieves increased network lifetime and efficiently
reduces the energy consumption, in relative to M-ATTEMPT protocol.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
Accelerated collection of sensor data by mobility-enabled topology ranks
We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Motivated by relevant applications, we focus on dynamic sensory mobility and heterogeneous sensor placement. Our approach basically suggests to exploit the sensor motion to adaptively propagate information based on local conditions (such as high placement concentrations), so that the sink gradually “learns” the network and accordingly optimizes its motion. Compared to relevant solutions in the state of the art (such as the blind random walk, biased walks, and even optimized deterministic sink mobility), our method significantly reduces latency (the improvement ranges from 40% for uniform placements, to 800% for heterogeneous ones), while also improving the success rate and keeping the energy dissipation at very satisfactory level
Joint Routing and STDMA-based Scheduling to Minimize Delays in Grid Wireless Sensor Networks
In this report, we study the issue of delay optimization and energy
efficiency in grid wireless sensor networks (WSNs). We focus on STDMA (Spatial
Reuse TDMA)) scheduling, where a predefined cycle is repeated, and where each
node has fixed transmission opportunities during specific slots (defined by
colors). We assume a STDMA algorithm that takes advantage of the regularity of
grid topology to also provide a spatially periodic coloring ("tiling" of the
same color pattern). In this setting, the key challenges are: 1) minimizing the
average routing delay by ordering the slots in the cycle 2) being energy
efficient. Our work follows two directions: first, the baseline performance is
evaluated when nothing specific is done and the colors are randomly ordered in
the STDMA cycle. Then, we propose a solution, ORCHID that deliberately
constructs an efficient STDMA schedule. It proceeds in two steps. In the first
step, ORCHID starts form a colored grid and builds a hierarchical routing based
on these colors. In the second step, ORCHID builds a color ordering, by
considering jointly both routing and scheduling so as to ensure that any node
will reach a sink in a single STDMA cycle. We study the performance of these
solutions by means of simulations and modeling. Results show the excellent
performance of ORCHID in terms of delays and energy compared to a shortest path
routing that uses the delay as a heuristic. We also present the adaptation of
ORCHID to general networks under the SINR interference model
- …