Efficient priority queueing routing strategy on mobile networks

Abstract

Mobile networks are intriguing in recent years due to their practical implications. Previous routing strategies for improving transport efficiency have little attention what order should the packets be forwarded, just simply used first-in-first-out queue discipline. Here we apply priority queueing discipline to shortest distance routing strategy on mobile networks. Numerical experiments show it not only remarkably improves network throughput and the packet arriving rate, but also reduces average end-to-end delay and the rate of queueing delay. Our work may be helpful in routing strategy designing on mobile networks.

References in corpus (12)

• The diameter of the world wide web
• Efficient routing on complex networks
• Communication in networks with hierarchical branching
• Epidemic spreading in complex networks with degree correlations
• Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
• Optimal routing on complex networks
• Integrating static and dynamic information for routing traffic
• Transport on Complex Networks: Flow, Jamming and Optimization
• Information Super-Diffusion on Structured Networks
• Efficient routing strategies in scale-free networks with limited bandwidth
• Transportation dynamics on networks of mobile agents
• Jamming transition in traffic flow under the priority queuing protocol