Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks

DOI10.1109/TIT.2019.2924187zbMATH Open1433.94028arXiv1801.04985WikidataQ127680446 ScholiaQ127680446MaRDI QIDQ5211482FDOQ5211482

Authors:

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We investigate a probabilistic model for routeing in a multihop ad-hoc communication network, where each user sends a message to the base station. Messages travel in hops via other users, used as relays. Their trajectories are chosen at random according to a Gibbs distribution, which favours trajectories with low interference, measured in terms of signal-to-interference ratio. This model was introduced in our earlier paper [KT18], where we expressed, in the limit of a high density of users, the typical distribution of the family of trajectories in terms of a law of large numbers. In the present work, we derive its qualitative properties. We analytically identify the emerging typical scenarios in three extreme regimes. We analyse the typical number of hops and the typical length of a hop, and the deviation of the trajectory from the straight line, (1) in the limit of a large communication area and large distances, and (2) in the limit of a strong interference weight. In both regimes, the typical trajectory approaches a straight line quickly, in regime (1) with equal hop lengths. Interestingly, in regime (1), the typical length of a hop diverges logarithmically in the distance of the transmitter to the base station. We further analyse (3) local and global repulsive effects of a densely populated subarea on the trajectories.

Full work available at URL: https://arxiv.org/abs/1801.04985

zbMATH Keywords

Gibbs distributionsignal-to-interference ratiomessages travel in hopsmultihop ad hoc communication networkprobabilistic model for routingtrajectories are chosen at randomtrajectories with low interferenceuser sends a message to the base station

Mathematics Subject Classification ID

Convergence of probability measures (60B10) Large deviations (60F10) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (1)

• A mean field limit for a lattice caricature of dynamic routing in circuit switched networks

This page was built for publication: Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211482)