Abstract
As dynamic networks have received more and more attention, traffic congestion on dynamic networks has become a significant issue. In this paper, we introduce a model in which nodes with finite storage capacity move randomly in a closed square area. A routing strategy based on the closest Euclidean distance between any two nodes is proposed to transmit packets in the dynamic network. Large packet generation rates will results in traffic congestion and abundant packet loss. Large node capacity is also disadvantage to traffic. Moreover, we also find that for each moving speed, there will be an optimal packet generation rate to maximize network traffic. In our dynamic network model, the Braess’ paradox is observed.
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 callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: 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.
