On the optimum number of hops in linear wireless networks
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 165-169
- https://doi.org/10.1109/itw.2004.1405293
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- On routing in random Rayleigh fading networksIEEE Transactions on Wireless Communications, 2005
- Twelve reasons not to route over many short hopsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A Network Information Theory for Wireless Communication: Scaling Laws and Optimal OperationIEEE Transactions on Information Theory, 2004
- Elements of Information TheoryPublished by Wiley ,2001
- Bandwidth-efficient turbo trellis-coded modulation using punctured component codesIEEE Journal on Selected Areas in Communications, 1998
- Probability of Error for Optimal Codes in a Gaussian ChannelBell System Technical Journal, 1959