Title :
Minimum energy broadcasting in wireless networks (extended abstract)
Author :
Yamada, Toshinori
Author_Institution :
Grad. Sch. of Sci. & Eng., Saitama Univ., Saitama
Abstract :
This paper considers a special case of MECBS(minimum energy consumption broadcast subgraph) problem, which is motivated by minimum energy broadcasting in wireless networks in a city area like as in Manhattan in NY. First, this problem is proved to be NP-hard, and then MST, an algorithm based on minimum spanning tree, is 4-approximation algorithm for this problem.
Keywords :
approximation theory; broadcasting; radio networks; trees (mathematics); approximation algorithm; minimum energy broadcasting; minimum spanning tree; wireless network; Approximation algorithms; Attenuation; Broadcasting; Energy consumption; Euclidean distance; Informatics; Mathematics; Power engineering and energy; Transmitters; Wireless networks;
Conference_Titel :
Circuits and Systems, 2008. ISCAS 2008. IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
978-1-4244-1683-7
Electronic_ISBN :
978-1-4244-1684-4
DOI :
10.1109/ISCAS.2008.4541389
