Affiliations: Department of Electrical and Computer Engineering,
University of New Orleans, 2000 Lakeshore Dr., New Orleans, LA 70148,
USA | Department of Computer Science, City University of
Hong Kong, Hong Kong | Department of Computing, Hong Kong Polytechnic
University, Hung Hom, Kowloon, Hongkong | Department of Computer Science & Engineering,
Wright State University, 3640 Colonel Glenn Highway, Dayton, OH 45435,
USA | Department of Computer Science, University of Texas at
Dallas, Richardson, TX, 75083-0688, USA
Abstract: Lifetime is very important to wireless sensor networks since most
sensors are equipped with non-rechargeable batteries. Therefore, energy and
delay are critical issues for the research of sensor networks that have limited
lifetime. Due to the uncertainties in execution time of some tasks, this paper
models each varied execution time as a probabilistic random variable with the
consideration of applications' performance requirements to solve the MAP (Mode
Assignment with Probability) problem. Using probabilistic design, we propose an
optimal algorithm to minimize the total energy consumption while satisfying the
timing constraint with a guaranteed confidence probability. The experimental
results show that our approach achieves significant energy saving than previous
work. For example, our algorithm achieves an average improvement of 32.6% on
total energy consumption.