Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Wireless information networks
Optimal transmission ranges for mobile communication in linear multihop packet radio networks
Wireless Networks - Special issue on performance evaluation methods for wireless networks
Dynamic channel allocation for linear macrocellular topology
Proceedings of the 1999 ACM symposium on Applied computing
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Power consumption in packet radio networks
Theoretical Computer Science
The Power Range Assignment Problem in Radio Networks on the Plane
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
| Hi-index | 0.00 |
The unbounded version of the 1D range assignment problem for radio-stations is studied. Here a set of n radio stations are placed arbitrarily on a line. The objective is to assign ranges to these radio-stations such that the total power consumption is minimum. A simple incremental algorithm is proposed which produces optimum solution in O(n3) time and O(n2) space. This improves the running time of the best known existing algorithm by a factor of n.