Energy-aware scheduling with probabilistic deadline constraints in wireless networks

Authors:
G. Sudha Anil Kumar;G. Manimaran;Z. Wang
Affiliations:
Real-Time Computing and Networking Laboratory, Dept. of Electrical and Computer Engineering, Iowa State University, 1635 ASB, Ames, IA 50011, United States;Real-Time Computing and Networking Laboratory, Dept. of Electrical and Computer Engineering, Iowa State University, 1635 ASB, Ames, IA 50011, United States;Real-Time Computing and Networking Laboratory, Dept. of Electrical and Computer Engineering, Iowa State University, 1635 ASB, Ames, IA 50011, United States
Venue:
Ad Hoc Networks
Year:
2009

Citing 5
Cited 1

Introduction to Algorithms

Introduction to Algorithms
Energy-Efficient Real-Time Scheduling in IEEE 802.11 Wireless LANs

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Exploring the Energy-Latency Trade-Off for Broadcasts in Energy-Saving Sensor Networks

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
A Flow Control Framework for Improving Throughput and Energy Efficiency in CSMA/CA based Wireless Multihop Networks

WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Cross-layer scheduling with prescribed QoS guarantees in adaptive wireless networks

IEEE Journal on Selected Areas in Communications

LIS: Localization based on an intelligent distributed fuzzy system applied to a WSN

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a shared-medium wireless network, an effective technique that allows for a tradeoff of message transmission time for energy savings is to transmit messages over multiple smaller hops as opposed to using the long direct source-destination hop. In this context, we address the problem of scheduling messages with probabilistic deadline constraints. Unlike most other works in this area, we consider the practical aspects of the erroneous channel condition and the receiver energy consumption while solving the scheduling problem. Our solution is three fold - first we prove that the problem is NP-hard. We then present an Integer Linear Program (ILP) formulation for the scheduling problem. Finally, we present efficient heuristic scheduling algorithms which minimize the energy consumption while providing the required guarantees. Our simulation studies show that the proposed heuristic algorithms achieve energy savings comparable to that obtained using the linear programming methodology under practical channel conditions.