Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks
作者： Mohammad R. Ataei , Amir H. Banihashemi , Thomas Kunz
关键词:
摘要: In this paper, we investigate the transmission range assignment for N wireless nodes located on a line (a linear network) broadcasting data from one specific node to all in network with minimum energy. Our goal is find solution that has low complexity and yet performs close optimal. We propose an algorithm finding optimal (which results energy consumption) O(N2) . An approximation O(N) also proposed. It shown that, networks uniformly distributed nodes, linear-time approximate obtained by algorithm, average, practically identical assignment. Both suboptimal algorithms require full knowledge of topology are thus centralized. negligible complexity, i.e., O(1), which only requires adjacent neighbors at each node. simulations demonstrate solution, almost as good nodes.
harvard.edu
arxiv.org
sci-hub.se 参考文章(14)
Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy, Improved algorithm for minimum cost range assignment problem for linear radio networks IWDC'04 Proceedings of the 6th international conference on Distributed Computing. pp. 412- 423 ,(2004) , 10.1007/978-3-540-30536-1_46
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, New Results for Energy-Efficient Broadcasting in Wireless Networks Algorithms and Computation. pp. 332- 343 ,(2002) , 10.1007/3-540-36136-7_30
Guang Han, Armand M. Makowski, On the critical communication range under node placement with vanishing densities international symposium on information theory. pp. 831- 835 ,(2007) , 10.1109/ISIT.2007.4557327
Andrea E.F. Clementi, Paolo Penna, Riccardo Silvestri, On the power assignment problem in radio networks Mobile Networks and Applications. ,vol. 9, pp. 125- 140 ,(2004) , 10.1023/B:MONE.0000013624.32948.87
Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Power consumption in packet radio networks Theoretical Computer Science. ,vol. 243, pp. 289- 305 ,(2000) , 10.1016/S0304-3975(98)00223-0
H. Hartenstein, K.P. Laberteaux, A tutorial survey on vehicular ad hoc networks IEEE Communications Magazine. ,vol. 46, pp. 164- 171 ,(2008) , 10.1109/MCOM.2008.4539481
C. Ambuhl, A.E.F. Clementi, M. Di Ianni, G. Rossi, A. Monti, R. Silvestri, The range assignment problem in non-homogeneous static ad-hoc networks international parallel and distributed processing symposium. pp. 224- 231 ,(2004) , 10.1109/IPDPS.2004.1303265
Guang Han, Armand M. Makowski, One-Dimensional Geometric Random Graphs With Nonvanishing Densities—Part I: A Strong Zero-One Law for Connectivity IEEE Transactions on Information Theory. ,vol. 55, pp. 5832- 5839 ,(2009) , 10.1109/TIT.2009.2032799
P. Santi, D.M. Blough, The critical transmitting range for connectivity in sparse wireless ad hoc networks IEEE Transactions on Mobile Computing. ,vol. 2, pp. 25- 39 ,(2003) , 10.1109/TMC.2003.1195149
Andrea E. F. Clementi, Pilu Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca, On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs symposium on theoretical aspects of computer science. pp. 121- 131 ,(2001) , 10.1007/3-540-44693-1_11