Optimal Hopping in Ad Hoc Wireless Networks

INFOCOM(2006)

引用 39|浏览22
暂无评分
摘要
Gupta and Kumar showed that throughput in a static random wireless network increases with the amount of hopping. In a subsequent paper (2004), it was shown that although throughput benefits from a large number of hops, this comes at the expense of higher delay. Separately, several studies have shown that in ad hoc networks, transmission energy decreases as hopping increases. However, when transceiver circuit energy is also taken into account, hopping as much as possible no longer maximizes energy efficiency and the optimal amount of hopping depends on the topology and size of the network. This paper attempts to unify these earlier results by estab- lishing the optimal hopping for energy efficiency along with throughput and delay. A random network model with n nodes in area A(n) is considered. The effect of interference is captured by the Physical model and the signal is assumed to decay with distance r as r�δ ,δ> 1. Both transmission and transceiver circuit energy are taken into account. Optimal trade-offs between throughput, delay and energy-per-bit scaling for this random network model are established. These results show that the amount of hopping still determines the optimal trade-off and yield the amount of hopping that should be used to achieve any point of the optimal trade-off. In a constant area network, where A(n )=1 , Θ(1) hops result in the best energy and delay scaling
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要