Loading…

Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks

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 favors trajecto...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2019-11, Vol.65 (11), p.6875-6897
Main Authors: Konig, Wolfgang, Tobias, Andras
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c244t-e033f59d44a45be5211dea3cd15f45550b223c3616041695e8f5658a51770eef3
container_end_page 6897
container_issue 11
container_start_page 6875
container_title IEEE transactions on information theory
container_volume 65
creator Konig, Wolfgang
Tobias, Andras
description 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 favors trajectories with low interference, measured in terms of signal-to-interference ratio. This model was introduced in our earlier paper, 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 this paper, we derive its qualitative properties. We analytically identify the emerging typical scenarios in three extreme regimes. We analyze the typical number of hops and the typical length of a hop and the deviation of the trajectory from the straight line, regime 1 in the limit of a large communication area and large distances and regime 2 in the limit of a strong interference weight. In both the regimes, the typical trajectory approaches a straight line quickly, in regime 1 with equal hop lengths. Interestingly, in regime 2, the typical length of a hop diverges logarithmically in the distance of the transmitter to the base station. We further analyze (regime 3) local and global repulsive effects of a densely populated subarea on the trajectories.
doi_str_mv 10.1109/TIT.2019.2924187
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2307298375</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8743400</ieee_id><sourcerecordid>2307298375</sourcerecordid><originalsourceid>FETCH-LOGICAL-c244t-e033f59d44a45be5211dea3cd15f45550b223c3616041695e8f5658a51770eef3</originalsourceid><addsrcrecordid>eNo9kEtLw0AUhQdRsFb3gpsB16nzuklmKVXbSqsidT3kcdNOjZk4kyD990ZaXF0OfOdc-Ai55mzCOdN368V6IhjXE6GF4mlyQkYcIIl0DOqUjBjjaaSVSs_JRQi7ISrgYkSe313foW029M27Fn1nMVDb0IzObJ4HmzV05UqsaeU8ndvNtt7TB2wC0lVfd3brWvqC3Y_zn-GSnFVZHfDqeMfk4-lxPZ1Hy9fZYnq_jAqhVBchk7ICXSqVKcgRBOclZrIoOVQKAFguhCxkzGOmeKwB0wpiSDPgScIQKzkmt4fd1rvvHkNndq73zfDSCMkSoVOZwECxA1V4F4LHyrTefmV-bzgzf8bMYMz8GTNHY0Pl5lCxiPiPp4mSijH5C7TyZZs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2307298375</pqid></control><display><type>article</type><title>Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Konig, Wolfgang ; Tobias, Andras</creator><creatorcontrib>Konig, Wolfgang ; Tobias, Andras</creatorcontrib><description>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 favors trajectories with low interference, measured in terms of signal-to-interference ratio. This model was introduced in our earlier paper, 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 this paper, we derive its qualitative properties. We analytically identify the emerging typical scenarios in three extreme regimes. We analyze the typical number of hops and the typical length of a hop and the deviation of the trajectory from the straight line, regime 1 in the limit of a large communication area and large distances and regime 2 in the limit of a strong interference weight. In both the regimes, the typical trajectory approaches a straight line quickly, in regime 1 with equal hop lengths. Interestingly, in regime 2, the typical length of a hop diverges logarithmically in the distance of the transmitter to the base station. We further analyze (regime 3) local and global repulsive effects of a densely populated subarea on the trajectories.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2019.2924187</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Ad hoc networks ; Area measurement ; Base stations ; Entropy ; expected number of hops ; Gibbs distribution ; high-density limit ; Interference ; message routeing ; Multihop ad-hoc network ; point processes ; Probabilistic models ; Probability theory ; Qualitative analysis ; Radio equipment ; Relays ; Routeing ; selfish routeing ; signal-to-interference ratio ; Spread spectrum communication ; Trajectory ; Trajectory measurement ; variational analysis</subject><ispartof>IEEE transactions on information theory, 2019-11, Vol.65 (11), p.6875-6897</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c244t-e033f59d44a45be5211dea3cd15f45550b223c3616041695e8f5658a51770eef3</cites><orcidid>0000-0002-7673-4364</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8743400$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Konig, Wolfgang</creatorcontrib><creatorcontrib>Tobias, Andras</creatorcontrib><title>Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>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 favors trajectories with low interference, measured in terms of signal-to-interference ratio. This model was introduced in our earlier paper, 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 this paper, we derive its qualitative properties. We analytically identify the emerging typical scenarios in three extreme regimes. We analyze the typical number of hops and the typical length of a hop and the deviation of the trajectory from the straight line, regime 1 in the limit of a large communication area and large distances and regime 2 in the limit of a strong interference weight. In both the regimes, the typical trajectory approaches a straight line quickly, in regime 1 with equal hop lengths. Interestingly, in regime 2, the typical length of a hop diverges logarithmically in the distance of the transmitter to the base station. We further analyze (regime 3) local and global repulsive effects of a densely populated subarea on the trajectories.</description><subject>Ad hoc networks</subject><subject>Area measurement</subject><subject>Base stations</subject><subject>Entropy</subject><subject>expected number of hops</subject><subject>Gibbs distribution</subject><subject>high-density limit</subject><subject>Interference</subject><subject>message routeing</subject><subject>Multihop ad-hoc network</subject><subject>point processes</subject><subject>Probabilistic models</subject><subject>Probability theory</subject><subject>Qualitative analysis</subject><subject>Radio equipment</subject><subject>Relays</subject><subject>Routeing</subject><subject>selfish routeing</subject><subject>signal-to-interference ratio</subject><subject>Spread spectrum communication</subject><subject>Trajectory</subject><subject>Trajectory measurement</subject><subject>variational analysis</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNo9kEtLw0AUhQdRsFb3gpsB16nzuklmKVXbSqsidT3kcdNOjZk4kyD990ZaXF0OfOdc-Ai55mzCOdN368V6IhjXE6GF4mlyQkYcIIl0DOqUjBjjaaSVSs_JRQi7ISrgYkSe313foW029M27Fn1nMVDb0IzObJ4HmzV05UqsaeU8ndvNtt7TB2wC0lVfd3brWvqC3Y_zn-GSnFVZHfDqeMfk4-lxPZ1Hy9fZYnq_jAqhVBchk7ICXSqVKcgRBOclZrIoOVQKAFguhCxkzGOmeKwB0wpiSDPgScIQKzkmt4fd1rvvHkNndq73zfDSCMkSoVOZwECxA1V4F4LHyrTefmV-bzgzf8bMYMz8GTNHY0Pl5lCxiPiPp4mSijH5C7TyZZs</recordid><startdate>20191101</startdate><enddate>20191101</enddate><creator>Konig, Wolfgang</creator><creator>Tobias, Andras</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-7673-4364</orcidid></search><sort><creationdate>20191101</creationdate><title>Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks</title><author>Konig, Wolfgang ; Tobias, Andras</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c244t-e033f59d44a45be5211dea3cd15f45550b223c3616041695e8f5658a51770eef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Ad hoc networks</topic><topic>Area measurement</topic><topic>Base stations</topic><topic>Entropy</topic><topic>expected number of hops</topic><topic>Gibbs distribution</topic><topic>high-density limit</topic><topic>Interference</topic><topic>message routeing</topic><topic>Multihop ad-hoc network</topic><topic>point processes</topic><topic>Probabilistic models</topic><topic>Probability theory</topic><topic>Qualitative analysis</topic><topic>Radio equipment</topic><topic>Relays</topic><topic>Routeing</topic><topic>selfish routeing</topic><topic>signal-to-interference ratio</topic><topic>Spread spectrum communication</topic><topic>Trajectory</topic><topic>Trajectory measurement</topic><topic>variational analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Konig, Wolfgang</creatorcontrib><creatorcontrib>Tobias, Andras</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Konig, Wolfgang</au><au>Tobias, Andras</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2019-11-01</date><risdate>2019</risdate><volume>65</volume><issue>11</issue><spage>6875</spage><epage>6897</epage><pages>6875-6897</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><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 favors trajectories with low interference, measured in terms of signal-to-interference ratio. This model was introduced in our earlier paper, 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 this paper, we derive its qualitative properties. We analytically identify the emerging typical scenarios in three extreme regimes. We analyze the typical number of hops and the typical length of a hop and the deviation of the trajectory from the straight line, regime 1 in the limit of a large communication area and large distances and regime 2 in the limit of a strong interference weight. In both the regimes, the typical trajectory approaches a straight line quickly, in regime 1 with equal hop lengths. Interestingly, in regime 2, the typical length of a hop diverges logarithmically in the distance of the transmitter to the base station. We further analyze (regime 3) local and global repulsive effects of a densely populated subarea on the trajectories.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2019.2924187</doi><tpages>23</tpages><orcidid>https://orcid.org/0000-0002-7673-4364</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 2019-11, Vol.65 (11), p.6875-6897
issn 0018-9448
1557-9654
language eng
recordid cdi_proquest_journals_2307298375
source IEEE Electronic Library (IEL) Journals
subjects Ad hoc networks
Area measurement
Base stations
Entropy
expected number of hops
Gibbs distribution
high-density limit
Interference
message routeing
Multihop ad-hoc network
point processes
Probabilistic models
Probability theory
Qualitative analysis
Radio equipment
Relays
Routeing
selfish routeing
signal-to-interference ratio
Spread spectrum communication
Trajectory
Trajectory measurement
variational analysis
title Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T04%3A19%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Routeing%20Properties%20in%20a%20Gibbsian%20Model%20for%20Highly%20Dense%20Multihop%20Networks&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Konig,%20Wolfgang&rft.date=2019-11-01&rft.volume=65&rft.issue=11&rft.spage=6875&rft.epage=6897&rft.pages=6875-6897&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2019.2924187&rft_dat=%3Cproquest_cross%3E2307298375%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c244t-e033f59d44a45be5211dea3cd15f45550b223c3616041695e8f5658a51770eef3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2307298375&rft_id=info:pmid/&rft_ieee_id=8743400&rfr_iscdi=true