Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
A comparison of single- and multi-hop beaconing in VANETs
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
| Hi-index | 0.00 |
In wireless networks, it is well understood what throughput can be achieved by nodes who can hear each other (i.e. nodes within a single cell)[1, 3]. The effects of nodes beyond the sensing range (known as hidden nodes) on a sender are complicated and difficult to analyze. Consequently, how to analytically model multi-hop adhoc networks, specially networks based on the popular IEEE802.11 standards remains largely open. In a recent paper [2], the throughput of a particular wireless network topology (linear network with a given number of hidden nodes) has been derived analytically. In this paper, we unify previous results on single-cell models, and results characterizing different types of hidden node interference and the analysis of [2], to derive a general solution for throughput given a linear network of arbitrary density and transmission distance between source and destination nodes. An important insight from our model is that there is a certain transmission distance, which is less than the maximum transmission distance, that optimizes throughput in such networks. This result is verified using ns-2 simulation with both single as well as multiple flows.