Multi-regional query scheduling in wireless sensor networks with minimum latency

2012 ◽  
Vol 14 (9) ◽  
pp. 849-864 ◽  
Author(s):  
Mingyuan Yan ◽  
Jing Selena He ◽  
Shouling Ji ◽  
Yingshu Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Minimum Latency ◽  
Query Scheduling

CONFLICT-AWARE DATA AGGREGATION SCHEDULING IN WIRELESS SENSOR NETWORKS WITH ADJUSTABLE TRANSMISSION RANGE

2012 ◽  
Vol 04 (03) ◽  
pp. 1250013 ◽  
Author(s):  
YI HONG ◽  
HONGWEI DU ◽  
DEYING LI ◽  
WENPING CHEN
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Base Station ◽  
Sensor Nodes ◽  
Performance Ratio ◽  
Wireless Sensor ◽  
Transmission Range ◽  
Minimum Latency ◽  
Data Aggregation Scheduling

The minimum latency data aggregation schedule is one of the fundamental problems in wireless sensor networks. Most existing works assumed that the transmission ranges of sensor nodes cannot be adjusted. However, sensors with adjustable transmission ranges have advantages in energy saving, reducing transmission interference and latency. In this paper, we study the minimum latency conflict-aware data aggregation scheduling problem with adjustable transmission radii: given locations of sensors along with a base station, all sensors could adjust their transmission radii and each sensor's interference radius is α times of its transmission radius, we try to find a data aggregation schedule in which the data from all sensors can be transmitted to the base station without conflicts, such that the latency is minimized. We first partition the set of all nodes into two parts: the major set and the minor set. Then, we design different scheduling strategies for the two sets, respectively. Finally, we propose an approximation algorithm for the problem and prove the performance ratio of the algorithm is bounded by a nearly constant. Our experimental results evaluate the efficiency of the proposed algorithm.

scholarly journals LNDIR: A lightweight non-increasing delivery-latency interval-based routing for duty-cycled sensor networks

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771876760 ◽  
Author(s):  
Muhammad K Shahzad ◽  
Dang Tu Nguyen ◽  
Vyacheslav Zalyubovskiy ◽  
Hyunseung Choo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Performance Improvements ◽  
Novel Approach ◽  
Minimum Latency ◽  
Latency Interval

Wireless sensor networks are composed of low-energy, small-size, and low-range unattended sensor nodes. Recently, it has been observed that by periodically turning on and off the sensing and communication capabilities of sensor nodes, we can significantly reduce the active time and thus prolong network lifetime. However, this duty cycling may result in high network latency, routing overhead, and neighbor discovery delays due to asynchronous sleep and wake-up scheduling. These limitations call for a countermeasure for duty-cycled wireless sensor networks which should minimize routing information, routing traffic load, and energy consumption. In this article, we propose a lightweight non-increasing delivery-latency interval routing referred as LNDIR. This scheme can discover minimum latency routes at each non-increasing delivery-latency interval instead of each time slot. Simulation experiments demonstrated the validity of this novel approach in minimizing routing information stored at each sensor. Furthermore, this novel routing can also guarantee the minimum delivery latency from each source to the sink. Performance improvements of up to 12-fold and 11-fold are observed in terms of routing traffic load reduction and energy efficiency, respectively, as compared to existing schemes.

Sign in / Sign up

Export Citation Format

Share Document