CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks

Lai, Shouwen; Zhang, Bo; Ravindran, Binoy; Cho, Hyeonjoong

doi:10.1007/978-3-540-92221-6_20

Cited by 22 publications

(21 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Discovery in always-awake networks mainly focuses on network models with directional antennas [17], [6], [18], while solutions for discovery in duty-cycled networks are highly diverse, especially in mobile environments which impose time constraints on how fast discovery should be finished. Notable ones includes: stochastic-based protocols [13], [2], quorum-based protocols [16], [20], [12], [11], Disco [3], U-Connect [8], multichannel discovery [9] and collision-aware discovery [10]. In birthday protocol [13], nodes listen, transmit or sleep in a probabilistic round-robin fashion, which statistically trades off between discovery energy with discovery latency.…”

Section: Related Workmentioning

confidence: 99%

“…Due to the stochastic nature of its operation, there is no guarantee on the worst-case discovery latency. Quorum-based protocols [16], [20], [12], [11] address this limitation by ensuring existence of overlapped wake-up durations between pair-wise nodes within a bounded time. For instances, in [16], Tseng construct a m×m grid matrix within contiguous slots.…”

Section: Related Workmentioning

confidence: 99%

“…Previous works mainly focus on how to ensure a pair of nodes can wake up simultaneously through a certain type of scheduling algorithms. Notable discovery designs include: stochastic-based protocols [2], [13], quorum-based protocols [11], [12], [16], [20], Disco [3] and U-Connect [8]. These designs successfully ensure that a pair of nodes finish discovery within a bounded delay.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Group-based discovery in low-duty-cycle mobile sensor networks

Chen

Gü

Guo

et al. 2012

2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)

View full text Add to dashboard Cite

Abstract-Wireless Sensor Networks have been used in many mobile applications such as wildlife tracking and participatory urban sensing. Because of the combination of high mobility and low-duty-cycle operations, it is a challenging issue to reduce discovery delay among mobile nodes, so that mobile nodes can establish connection quickly once they are within each other's vicinity. Existing discovery designs are essentially pair-wise based, in which discovery is passively achieved when two nodes are pre-scheduled to wake-up at the same time. In contrast, for the first time, this work reduces discovery delay significantly by proactively referring wake-up schedules among a group of nodes. Because proactive references incur additional overhead, we introduce a novel selective reference mechanism based on spatiotemporal properties of neighborhood and the mobility of the nodes. Our quantitative analysis indicates that the discovery delay of our group-based mechanism is significantly smaller than that of the pair-wise one. Our testbed experiments using 40 sensor nodes confirm our theoretical analysis, showing one order of magnitude reduction in discovery delay compared with traditional pair-wise methods with only 0.5%∼8.8% increase in energy consumption.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Group-based discovery in low-duty-cycle mobile sensor networks

Chen

Gü

Guo

et al. 2012

2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)

View full text Add to dashboard Cite

show abstract

“…Based on their methods, discovery and rendezvous problem in asymmetric duty-cycle setting reduces to an NP-complete minimum vertex cover problem requiring a centralized solution [10]. More recently, Lai et al present CQS-pair [11] and GQS-pair [12], which support heterogeneous quorum-based systems where devices can have different cycle lengths and hence different duty-cycle settings. However, only two kinds of duty cycles are supported.…”

Section: A Explicitly Quorum System Based Schemesmentioning

confidence: 99%

“…In the past, several neighbor discovery and rendezvous protocols for sensor networks [9] [10] [11] [12] [13] [14] [15] have been proposed. However, they all use a pairwise discovery mechanism via direct one-hop communication.…”

Section: Introductionmentioning

confidence: 99%

EQS: Neighbor Discovery and Rendezvous Maintenance with Extended Quorum System for Mobile Sensing Applications

Zhang

He²,

Ye³

et al. 2012

2012 IEEE 32nd International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Abstract-In many mobile sensing applications devices need to discover new neighbors and maintain the rendezvous with known neighbors continuously. Due to the limited energy supply, these devices have to cycle their radios to conserve energy, making neighbor discovery and rendezvous maintenance even more challenging. To date, the main mechanism for device discover and rendezvous maintenance in existing solutions is pairwise, direct one-hop communication. We argue that such pairwise direct communication is sufficient but not necessary: there exist unnecessary active slots that can be eliminated, without affecting discovery and rendezvous. In this work, we propose a novel concept of extended quorum system, which leverages indirect discovery to further conserve energy. Specifically, we use quorum graph to capture all possible information flow paths where knowledge about known-neighbors can propagate among devices. By eliminating redundant paths, we can reduce the number of active slots significantly. Since a quorum graph can characterize arbitrary active schedules of mobile devices, our work can be broadly used to improve many existing quorumbased discovery and rendezvous solutions. The simulation and testbed experimental results show that our solution can reduce as much as 55% energy consumption with a maximal 5% increase in latency for existing solutions.

show abstract

On Multihop Broadcast over Adaptively Duty-Cycled Wireless Sensor Networks

Lai

Ravindran

2010

Distributed Computing in Sensor Systems

View full text Add to dashboard Cite

CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks

Cited by 22 publications

References 10 publications

Group-based discovery in low-duty-cycle mobile sensor networks

Group-based discovery in low-duty-cycle mobile sensor networks

EQS: Neighbor Discovery and Rendezvous Maintenance with Extended Quorum System for Mobile Sensing Applications

On Multihop Broadcast over Adaptively Duty-Cycled Wireless Sensor Networks

Contact Info

Product

Resources

About