On the optimum number of hops in linear wireless networks
On the optimum number of hops in linear wireless networks
复制标题
DOI:
10.1109/itw.2004.1405293
复制
发表时间:
2004-10
期刊:
影响因子:
--
通讯作者:
M. Sikora;J. N. Laneman;M. Haenggi;D. Costello;T. Fuja
中科院分区:
文献类型:
--
作者:
M. Sikora;J. N. Laneman;M. Haenggi;D. Costello;T. Fuja
We consider a wireless communication system with a single source node, a single destination node, and multiple relay nodes placed equidistantly between them. We limit our analysis to the case of coded TDMA multihop transmission, i.e., the nodes do not cooperate and do not try to access the channel simultaneously. Given a global constraint on bandwidth, we determine the number of hops that achieves a desired end-to-end rate with the least total transmission power. Furthermore, we examine how the optimum number of hops changes when an end-to-end delay constraint is introduced using the sphere-packing bound and computer simulations. The analysis demonstrates that the optimum number of hops depends on the end-to-end rate and the path-loss exponent. Specifically, we show the existence of an asymptotic per-link spectral efficiency, which is the preferred spectral efficiency in TDMA multihop transmission.