Multiuser Detection
Energy-efficient routing for connection-oriented traffic in wireless ad-hoc networks
Mobile Networks and Applications
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Wireless Communications
A counterexample in congestion control of wireless networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Low degree connectivity in ad-hoc networks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Design challenges for energy-constrained ad hoc wireless networks
IEEE Wireless Communications
| Hi-index | 0.00 |
The present paper deals with communication in random geometric topologies; in particular, we model modern wireless ad hoc networks by random geometric topologies. The paper has two goals: the first is to implement the network power control mechanism extended by several wireless engineering features and to use the model to assess communicational properties of two typical random geometric topologies known from the literature in real-life conditions. The second goal is to suggest a modification of the “LowDegree” algorithm (one of the two studied topologies), which preserves excellent power requirements of the model, but matches the performance of the standard “UnitDisk” algorithm in terms of higher total network throughput.