Research Article
On the performance of time-space opportunistic routing in multihop Mobile Ad Hoc Networks
@INPROCEEDINGS{10.4108/ICST.WIOPT2008.3206, author={Francois Baccelli and Barłomiej Blaszczyszyn and Paul M\'{y}hlethaler}, title={On the performance of time-space opportunistic routing in multihop Mobile Ad Hoc Networks}, proceedings={6th International ICST Symposium on Modeling and Optimization}, publisher={IEEE}, proceedings_a={WIOPT}, year={2008}, month={8}, keywords={Network design stochastic process simulation point process stochastic geometry optimization transport capacity signal to interference ratio interference collision multiple access protocol MAC layer geographic routing cross layer optimization}, doi={10.4108/ICST.WIOPT2008.3206} }- Francois Baccelli
Barłomiej Blaszczyszyn
Paul Mühlethaler
Year: 2008
On the performance of time-space opportunistic routing in multihop Mobile Ad Hoc Networks
WIOPT
IEEE
DOI: 10.4108/ICST.WIOPT2008.3206
Abstract
In classical routing strategies for multihop mobile wireless networks packets are routed on a pre-defined route usually obtained by a shortest path routing protocol. In opportunistic routing schemes, for each packet and each hop, the next relay is found by dynamically selecting the node that captures the packet transmission and which is the nearest to the destination. Such a scheme allows each packet to take advantage of the local pattern of transmissions and fadings at any slot and at any hop. The aim of this paper is to quantify and optimize the potential performance gains of such opportunistic routing strategies compared with classical routing schemes. The analysis is conducted under the following lower layer assumptions: the Medium Access (MAC) layer is a spatial version of Aloha which has been shown to scale well for large multihop networks; the capture of a packet by some receiver is determined by the Signal over Interference and Noise Ratio (SINR) experienced by the receiver. The paper contains a detailed simulation study which shows that such time-space opportunistic schemes very significantly outperform classical routing schemes. It also contains a mathematical study where we show how to optimally tune the MAC parameters so as to minimize the average number of time slots required to carry a typical packet from origin to destination on long paths. We show that this optimization is independent of the network density.
