dorsal/arxiv
View SchemaOptimal transport on wireless networks
| Authors | Yong Yu, Bogdan Danila, John A. Marsh, Kevin E. Bassler |
|---|---|
| Categories | |
| ArXiv ID | physics/0703261 |
| URL | https://arxiv.org/abs/physics/0703261 |
| DOI | 10.1209/0295-5075/79/48004 |
Abstract
We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on wireless networks. Our algorithm iteratively balances network traffic by minimizing the maximum node betweenness on the network. The variant we consider specifically accounts for the broadcast restrictions imposed by wireless communication by using a different betweenness measure. We compare the performance of our algorithm to two other known algorithms and find that our algorithm achieves the highest transport capacity both for minimum node degree geometric networks, which are directed geometric networks that model wireless communication networks, and for configuration model networks that are uncorrelated scale-free networks.
{
"annotation_id": "72c5962e-53b5-48f1-b990-d61805d5d235",
"date_created": "2026-03-02T18:01:17.567000Z",
"date_modified": "2026-03-02T18:01:17.567000Z",
"file_hash": "268f5d904c39600c0f7069d08fcb9ee755e192221f8e4a754ecd12d3fb911155",
"private": false,
"record": {
"abstract": "We present a study of the application of a variant of a recently introduced\nheuristic algorithm for the optimization of transport routes on complex\nnetworks to the problem of finding the optimal routes of communication between\nnodes on wireless networks. Our algorithm iteratively balances network traffic\nby minimizing the maximum node betweenness on the network. The variant we\nconsider specifically accounts for the broadcast restrictions imposed by\nwireless communication by using a different betweenness measure. We compare the\nperformance of our algorithm to two other known algorithms and find that our\nalgorithm achieves the highest transport capacity both for minimum node degree\ngeometric networks, which are directed geometric networks that model wireless\ncommunication networks, and for configuration model networks that are\nuncorrelated scale-free networks.",
"arxiv_id": "physics/0703261",
"authors": [
"Yong Yu",
"Bogdan Danila",
"John A. Marsh",
"Kevin E. Bassler"
],
"categories": [
"physics.soc-ph",
"physics.comp-ph"
],
"doi": "10.1209/0295-5075/79/48004",
"title": "Optimal transport on wireless networks",
"url": "https://arxiv.org/abs/physics/0703261"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e96929a4-c665-45fb-a105-c4c2ba314a05",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}