An adaptive ad-hoc self-organizing scheduling method for quasi-periodic sensor traffic

Visweswara, S.C.; Goel, Anuj; Dutta, Rudra

doi:10.1109/sahcn.2004.1381935

Cited by 4 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We adopt a widely used synchronization scheme, and study the sleep/wake scheduling problem under this scheme 3 . The scheme was first proposed in RBS [8], and was later adopted by several protocols and system implementations [11]- [15].…”

Section: A Synchronization Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Optimal Sleep/Wake Scheduling for Time-Synchronized Sensor Networks with QoS Guarantees

Fahmy

Shroff

2006

200614th IEEE International Workshop on Quality of Service

View full text Add to dashboard Cite

Abstract-We study sleep/wake scheduling for low-duty cycle sensor networks. Our work explicitly considers the effect of synchronization error. We focus on a widely used synchronization scheme and show that its synchronization error is non-negligible, and using a conservative guard time is energy wasteful. We formulate an optimization problem that aims to set the capture probability threshold for messages from each individual node such that the expected energy consumption is minimized, and the collective Quality of Service (QoS) over the nodes is guaranteed. The problem is non-convex. Nonetheless, we are able to obtain a solution with energy consumption that is provably at most 37% larger than the optimal solution. Simulations demonstrate the efficacy of our solution.

show abstract

Section: A Synchronization Algorithmmentioning

confidence: 99%

“…This application class includes many practical sensor network applications such as habitat monitoring [1], [2], civil structure monitoring [3], and factory maintenance [4].…”

Section: Introductionmentioning

confidence: 99%

Optimal Sleep/Wake Scheduling for Time-Synchronized Sensor Networks with QoS Guarantees

Fahmy

Shroff

2006

200614th IEEE International Workshop on Quality of Service

View full text Add to dashboard Cite

show abstract

“…In order to reduce energy consumption, yet still guarantee high message delivery performance, we formulate the following optimal sleep/wake scheduling problem which attempts to minimize Let p be a message from n i to arrive during epoch j, i.e., scheduled arrival time τ p ∈ (jT e , jT e + T e ). Letτ p be the actual arrival time at which p arrives at the CH, as defined in Equation (2). To capture p, the CH wakes up at w p , and waits for the message until s p .…”

Section: A Problem Definitionmentioning

confidence: 99%

“…a small amount of data and reports to a single (or a few) base station(s). This application class includes many typical sensor network applications such as habitat monitoring [1] and civil structure monitoring [2].…”

Section: Introductionmentioning

confidence: 99%

Optimal QoS-aware Sleep/Wake Scheduling for Time-Synchronized Sensor Networks

Fahmy

Shroff

2006

2006 40th Annual Conference on Information Sciences and Systems

View full text Add to dashboard Cite

We study the sleep/wake scheduling problem in the context of clustered sensor networks. Unlike most prior work on sleep/wake scheduling that assumed perfect time synchronization in the network, we argue that the synchronization error is non-negligible and demonstrate its effect with a widely used synchronization scheme. We conclude that the design of any sleep/wake scheduling algorithm must take into account the impact of the synchronization error.Our work includes two parts. In the first part, we show that there is an inherent tradeoff between energy consumption and message delivery performance (defined as the message capture probability in this work). We formulate an optimization problem to minimize the expected energy consumption, with the constraint that the message capture probability should be no less than a threshold. In the first part, we assume the threshold is already given. We find the problem to be non-convex, thus cannot be directly solved by conventional convex optimization techniques. However, by investigating the unique structure of the problem, we transform the non-convex problem into a convex equivalent, and solve it using an efficient search method.In the second part, we remove the assumption that the capture probability threshold is already given, and study how to decide it to meet the Quality of Services (QoS) requirement of the application. We observe that in many sensor network applications, a group of sensors collaborate to perform common task(s). Therefore, the QoS is usually not decided by the performance of any individual node, but by the collective performance of all the related nodes. To achieve the collective performance with minimum energy consumption, intuitively we should provide differentiated services for the nodes and favor more important ones. We thus formulate an optimization problem, which aims to set the capture probability threshold for messages from each individual node such that the expected energy consumption is minimized, while the collective performance is guaranteed. The problem turns out to be non-convex and hard to solve exactly. Therefore, we use approximation techniques to obtain a suboptimal solution that approximates the optimum. Simulations show that our approximate solution significantly outperforms a scheme without differentiated treatment of the nodes.

show abstract

“…Typically, a solution for a specific problem is engineered within existing constraints; consider, for example, the research on TCP variants for high bandwidth-delay product networks [16], [18], earlier work on TCP over wireless networks [2], and efforts towards cross-layer optimization [24], [27], [28]. In other cases, addressing broader needs, such as IP address shortage or security, has led to more general solutions, which, however, may violate some of the original principles of the Internet or introduce new elements in its architecture; for instance, network address translation is not consistent with the end-toend principle, whereas IPSec was introduced as layer 2.5.…”

Section: Introductionmentioning

confidence: 99%

The SILO Architecture for Services Integration, controL, and Optimization for the Future Internet

Dutta

Rouskas

Baldin

et al. 2007

2007 IEEE International Conference on Communications

Self Cite

107

View full text Add to dashboard Cite

Abstract-We propose a new internetworking architecture that represents a departure from current philosophy and practice, as a contribution to the ongoing debate regarding the future Internet. Building upon our experience with the design and prototyping of the Just-in-Time protocol suite, we outline a framework consisting of (1) building blocks of fine-grain functionality, (2) explicit support for combining elemental blocks to accomplish highly configurable complex communication tasks, and (3) control elements to facilitate (what is currently referred to as) cross-layer interactions. In this position paper, we take a holistic view of network design, allowing applications to work synergistically with the network architecture and physical layers to select the most appropriate functional blocks and tune their behavior so as to meet the application's needs within resource availability constraints. The proposed architecture is flexible and extensible so as to foster innovation and accommodate change, it supports a unified Internet, it allows for the integration of security and management features at any point in (what is now referred to as) the networking stack, and it is positioned to take advantage of hardware-based performance-enhancing techniques.

show abstract

An adaptive ad-hoc self-organizing scheduling method for quasi-periodic sensor traffic

Cited by 4 publications

References 24 publications

Optimal Sleep/Wake Scheduling for Time-Synchronized Sensor Networks with QoS Guarantees

Optimal Sleep/Wake Scheduling for Time-Synchronized Sensor Networks with QoS Guarantees

Optimal QoS-aware Sleep/Wake Scheduling for Time-Synchronized Sensor Networks

The SILO Architecture for Services Integration, controL, and Optimization for the Future Internet

Contact Info

Product

Resources

About