Effective usage of random routing on networks of mobile agents

by   Ganhua Wu, et al.

Most existing routing strategies to improve transport efficiency have little attention what order should the packets be delivered, just simply used first-in-first-out queue discipline. However, it is far from optimal. In this paper we apply priority queuing discipline to random routing strategy on networks of mobile agents, in which the packets have high priority to transfer directly to their destination despite their order in the queue if their destination are within a communication radius. Numerical experiments show that it not only remarkably improves network throughput and the packet arriving rate, but also reduces average travelling time and the rate of waiting time to travelling time. Our work may be helpful in routing strategy designing on networks of mobile agents.



page 1

page 2

page 3

page 4


Efficient priority queueing routing strategy on mobile networks

Mobile networks are intriguing in recent years due to their practical im...

Reliable and Real-Time End-to-End Delivery Protocol in Wireless Sensor Networks

Many routing protocols have been proposed to handle reliability and real...

Construction of Subexponential-Size Optical Priority Queues with Switches and Fiber Delay Lines

All-optical switching has been considered as a natural choice to keep pa...

Secured Approach Towards Reactive Routing Protocols Using Triple Factor in Mobile Adhoc Networks

Routing protocols are used to transmit the packets from the source to th...

Virtues of Patience in Strategic Queuing Systems

We consider the problem of selfish agents in discrete-time queuing syste...

Management of mobile resources in Physical Internet logistic models

This paper deals with the concept of a 'Physical Internet', the idea of ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.