Abstract
In this paper, we present a traffic flow model, a local routing strategy based on an estimated waiting time to improve transportation efficiency on Barabasi and Albert (BA) network model. Instead of global shortest path routing strategies, our method is cooperated between static and dynamic local information: degree of node and number of packets in node's queue, as an estimated waiting time, respectively. Due to, nodes with higher degree are more susceptible to traffic congestion than lower degree, the proposed strategy focuses on a neighbor node selection according to estimated waiting time of packets in each node's queue. As a consequence of simulation results, they indicate that the network capability is enhanced; the developed strategy can be applied usefully for realistic communication networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
