Authors:
Amir Bannoura
;
Leonhard Reindl
and
Christian Schindelhauer
Affiliation:
University of Freiburg, Germany
Keyword(s):
Wake-up Receivers, Duty-cycling Backbone, Convergecast, Online-competitive Algorithms.
Related
Ontology
Subjects/Areas/Topics:
Network Performance
;
Obstacles
;
Power Management
;
Routing Techniques
;
Sensor Networks
;
Wireless Information Networks
;
Wireless Network Protocols
Abstract:
New transceiver and receiver hardware technology allow the usage of special wake-up signals, which are able to awake neighbored sensor nodes from the sleep. However, such messages need more energy ew than those standard message transmissions em, when nodes are awake. Furthermore, the distance range rw is also smaller than the distance range rm of standard messages. Therefore, it does not completely replace duty-cycling for the convergecast problem in wireless sensor networks. We present a theoretical and practical discussion of energyefficient algorithms for the convergecast problem. First, we present a model based on the current technology and show that without constraints on the delivery times wake-up signals are obsolete, when arbitrary long
sleeping times are allowed. The wake-up graph Gw and the message graph Gm are modeled by planar rwand rm-disk-graphs. Then, we give a competitive analysis for the general case, where we discuss an online D-convergecast algorithms bounded by co
mpetitive energy ratios. Finally, we present simulation results for these algorithmic ideas in the plane by considering the energy efficiency and the latency of data delivery.
(More)
