Logo image
Back
Longest edge routing on the spatial Aloha graph
Conference proceeding   Open access

Longest edge routing on the spatial Aloha graph

Steven Weber, Nihar Jindal, Radha Krishna Ganti, Martin Haenggi and IEEE
GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE
01 Jan 2008
DOI: https://doi.org/10.1109/GLOCOM.2008.ECP.51
url
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.5254View
SubmittedOpen Access (License Unspecified),  Open

Abstract

Engineering Engineering, Electrical & Electronic Science & Technology Technology Telecommunications
The multihop spatial reuse Aloha (MSR-Aloha) protocol was recently introduced by Baccelli et al., where each transmitter selects the receiver among its feasible next hops that maximizes the forward progress of the head of line packet towards its final destination. They identify the optimal medium access probability (MAP) that maximizes the spatial density of progress, defined as the product of the spatial intensity of attempted transmissions times the average per-hop progress of each packet towards its destination. We propose a variant called longest edge routing where each transmitter selects its longest feasible edge, and then identifies a packet in its backlog whose next hop is the associated receiver. The main contribution of this work (and of Baccelli et al.) is the use of stochastic geometry to identify the optimal MAP and the corresponding optimal spatial density of progress.

Metrics

10 Record Views
3 citations in Web of Science
16 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
Web of Science research areas
Engineering, Electrical & Electronic
Telecommunications
Logo image