Affiliations: [a] Graduate School of Science and Engineering, Hosei University, 3-7-2, Kajino-Cho, Koganei-Shi, Tokyo 184-8584, Japan | [b] Department of Advanced Sciences, Hosei University, 3-7-2, Kajino-Cho, Koganei-Shi, Tokyo 184-8584, Japan
Abstract: In order to realize the cooperation of a group of multiple nodes, messages have to be reliably and efficiently delivered to all of them, according to a traditional broadcasting paradigm, by also reducing the electric energy consumed by each involved node. In this paper, we propose three types of energy-efficient broadcast algorithms, namely EEB (energy-efficient broadcast), EEB2 (modified EEB), and AEEB (augmented EEB) whose objective is reducing the total electric energy consumed by nodes. In the EEB algorithm, a wireless link to a farthest child node is truncated until there is no other child node which can forward messages to it in a more energy-efficient way. In the EEB2 algorithm, a link to a farthest child node is truncated if there is another child node which can forward the message to it. In the EEB and EEB2 algorithms, a child node is selected for each parent node. On the other hand, one parent node is selected among possible parent nodes of each child node, which is nearest to the child node in the AEEB algorithm. We evaluate the EEB, EEB2, and AEEB algorithms and show that the total electric energy consumed by nodes can be reduced in the AEEB algorithm.
