In this work, we are interested in characterizing the performance of decentralized multiple-access and retransmission schemes for multi-hop wireless networks. We assume that nodes are randomly distributed on the plane according to a homogeneous spatial Poisson process. We investigate two transmission strategies: one that maximizes the distance of a successful transmission for each hop towards the final destination; and the other that forwards packets to the closest node in range in the direction of the final destination where transmission is successful. This is useful in the context of multi-hop wireless networks as it is important to assess the tradeoff between spatial density of communication and the range of each transmission. The results of this work also show that coding and retransmissions provide means of reliable communication coupled with a completely decentralized multiple-access strategy.
展开▼
