2009/01/15 by Radha Krishna Ganti, Ganti, Radha Krishna, Martin Haenggi +1
Computer Science · Mathematics · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Wireless Networks and Protocols #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0901.2160
arxiv created 2009/01/15 · openalex publication_date 2009/01/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may connect to multiple relays in the first hop. In the presence of interference and without tight coordination of the relays, it is not clear which relays should transmit the packet. We propose four decentralized methods of relay selection, some based on location information and others based on the received signal strength (RSS). We provide a complete analytical characterization of these methods using tools from stochastic geometry. We use simulation results to compare these methods in terms of end-to-end success probability.