Dynamic Connectivity in ALOHA Ad Hoc Networks

We consider an ad hoc network which uses multihop routing and slotted ALOHA for its MAC contention. We show that the minimum time required for a packet to reach the destination from the origin scales linearly with the distance. We define this delay as the minimum time required for a causal path to form between the source and destination. We derive the distributional properties of the connection time using ideas from first passage percolation and epidemic processes. We show that the delay scales linearly with the distance and also provide asymptotic results (with respect to time) for the positions of the nodes which are able to receive information from a transmitter located at the origin. We also provide simulation results to support the theoretical results.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Radha Krishna Ganti, Martin Haenggi
• Keywords: Ad Hoc Network, CORR 2008, Education, MAC Contention, Minimum Time