Optimal transport on wireless networks

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.

5 pages, 4 figures

References in corpus (22)

• Emergence of scaling in random networks
• The structure and function of complex networks
• Community detection in complex networks using Extremal Optimization
• Generation of uncorrelated random scale-free networks
• Efficient routing on complex networks
• Optimal network topologies for local search with congestion
• Random Geometric Graphs
• Optimization with Extremal Dynamics
• Improved routing strategies for Internet traffic delivery
• Dynamics of jamming transitions in complex networks
• Optimal routing on complex networks
• Scale-free Networks on Lattices
• Communication Bottlenecks in Scale-Free Networks
• Continuum percolation of wireless ad hoc communication networks
• Transport optimization on complex networks
• Connectivity Distribution of Spatial Networks
• Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency
• Congestion-gradient driven transport on complex networks
• Scaling in Small-World Resistor Networks
• Impact of network structure on the capacity of wireless multihop ad hoc communication
• Optimized network structure and routing metric in wireless multihop ad hoc communication
• Distributive routing & congestion control in wireless multihop ad hoc communication networks

Cited by in corpus (5)

• Improved community structure detection using a modified fine tuning strategy
• Naming Games in Two-Dimensional and Small-World-Connected Random Geometric Networks
• Collectively optimal routing for congested traffic limited by link capacity
• Optimization of transport protocols with path-length constraints in complex networks
• Spatial games and global optimization for mobile association problems