A distributed power management policy for wireless ad hoc networks

Chiasserini, Carla Fabiana; Rao, Ravishankar

doi:10.1109/wcnc.2000.904803

Cited by 49 publications

(22 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Most wireless sensor devices usually support two power modes: active and power-saving (sleep) to save their battery power [19,20]. While sensors can communicate with each other in an active mode, they turn their radio off in a power-saving mode.…”

Section: Asymmetric Neighbor Discovery Problemmentioning

confidence: 99%

Asymmetric Block Design-Based Neighbor Discovery Protocol in Sensor Networks

Choi

2016

Sustainability

View full text Add to dashboard Cite

Abstract:Neighbor discovery is one of the emerging research areas in a wireless sensor network. After sensors are distributed, neighbor discovery is the first process to set up a communication channel with neighboring sensors. This paper proposes a new block design-based asymmetric neighbor discovery protocol for sensor networks. We borrow the concept of combinatorial block designs for our block combination scheme for neighbor discovery. First, we introduce an asymmetric neighbor discovery problem and define a target research question. Second, we propose a new asymmetric block design-based neighbor discovery protocol and explain how it works. Third, we analyze the worst-case neighbor discovery latency numerically between our protocol and some well-known protocols in the literature, and compare and evaluate the performance between the proposed protocol and others. Our protocol reveals that the worst-case latency is much lower than that of Disco and U-Connect. Finally, we conclude that the minimum number of slots per a neighbor schedule shows the lowest discovery time in terms of discovery latency and energy consumption.

show abstract

Section: Asymmetric Neighbor Discovery Problemmentioning

confidence: 99%

Asymmetric Block Design-Based Neighbor Discovery Protocol in Sensor Networks

Choi

2016

Sustainability

View full text Add to dashboard Cite

show abstract

“…It has been an effective approach for conserving power of sensor nodes with duty cycling [6,12,13,[18][19][20][21][22]. Many methods have been proposed in the literature.…”

Section: Related Workmentioning

confidence: 99%

Statistically Bounding Detection Latency in Low-Duty-Cycled Sensor Networks

Zhu

2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Detecting abnormal events represents an important family of applications for wireless sensor networks. To achieve high performance of event detection, a sensor network should stay active most of the time, which is energy inefficient for battery driven sensor networks. This paper studies the fundamental problem of bounding detection delays when the sensor network is low duty cycled. We propose a novel approach for statistically bounding detection latency for event detection in sensor networks. The key issue is the wakeup scheduling of sensor nodes and minimization of wakeup activity. We propose a lightweight distributed algorithm for coordinating the wakeup scheduling of the sensor nodes. A distinctive feature of this algorithm is that it ensures that the detection delay of any event occurring anywhere in the sensing field is statistically bounded. In addition, the algorithm exposes a convenient interface for users to define the requirement on detection latency, thereby tuning the intrinsic tradeoff between energy efficiency and event detection performance. Extensive simulations have been conducted and results demonstrate that this algorithm can successfully meet delay bound and significantly reduce energy consumption.

show abstract

“…The most important method to conserve energy is to power off a sensor node and hence to reduce the effective duty cycle [4]. Asynchronous wakeup [5] is advantageous since no time synchronization is required.…”

Section: Related Workmentioning

confidence: 99%

Probabilistic Approach to Provisioning Guaranteed QoS for Distributed Event Detection

Zhu

2008

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-It has been of significant importance to provision network-wide guaranteed QoS for a wide range of event detection applications in wireless sensor networks (WSNs). This paper investigates solutions to this QoS provision problem. For event detection applications, there are two key performance metrics, i.e., detection probability and detection latency. This paper focuses on dual-objective QoS provision, taking both metrics into account. This is very challenging due to the stringent resource constraint of sensor nodes and unpredictable randomness of physical events. We propose a novel probabilistic approach to provisioning due-objective QoS. Following a unified framework, we design a distributed algorithm that determines the active probability of every sensor node. The probability is minimized while being sufficient for QoS provision. Our approach is flexible and supports different requirements that may be posed by different applications. Theoretical analysis and comprehensive simulation experiments have been conducted, which jointly demonstrate that our approach is able to deliver guaranteed QoS for distributed event detection while prolonging the system lifetime significantly compared with other alternative schemes.

show abstract

A distributed power management policy for wireless ad hoc networks

Cited by 49 publications

References 11 publications

Asymmetric Block Design-Based Neighbor Discovery Protocol in Sensor Networks

Asymmetric Block Design-Based Neighbor Discovery Protocol in Sensor Networks

Statistically Bounding Detection Latency in Low-Duty-Cycled Sensor Networks

Probabilistic Approach to Provisioning Guaranteed QoS for Distributed Event Detection

Contact Info

Product

Resources

About