ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Minimum Range Assignment Problem on Linear Radio Networks
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Theoretical Computer Science - Game theory meets theoretical computer science
Range assignment for energy efficient broadcasting in linear radio networks
Theoretical Computer Science
Bounds on hop distance in greedy routing approach in wireless ad hoc networks
International Journal of Wireless and Mobile Computing
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks
Proceedings of the 2010 ACM Symposium on Applied Computing
Weighted broadcast in linear radio networks
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Improved algorithm for minimum cost range assignment problem for linear radio networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Efficient algorithm for energy efficient broadcasting in linear radio networks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Hi-index | 0.00 |
The analysis of multihop radio transmission for randomly distributed terminals in the plane has drawn a lot of attention in the literature. Several routing strategies have been investigated concerning throughput and normalized expected progress. Because of mathematically intractable problems all analyses use simulation studies as part of the derivation. In this paper we present a one-dimensional model to investigate the performance of multihop networks. This model seems to be more adequate for applications in road traffic information systems. Three routing strategies 'most forward with fixed transmission range', 'positively most forward with fixed transmission range', and 'positively most forward with variable transmission range' are analyzed on the basis of a complete mathematical description. We also consider directional antennas. The results are presented in closed formulae which are evaluated numerically and depicted in corresponding diagrams. It turns out that adjusted transmission ranges enlarge network performance. Furthermore, some interesting differences to the usual two-dimensional random model occur.