论文部分内容阅读
Due to the increasing importance of communication networks such as the Internet and networks of mobile phone users in modern society,the traffic of information flows in these networks have attracted more and more attention.In communication networks,information packets are forwarded from sources to destinations by specific routing protocol.To enhance the transportation capacity of communication networks,researchers have designed various routing algorithms,including the shortest path,the integration of static and dynamic information,the local routing,the efficient routing,the pheromone routing protocol,the greedy algorithm,and so on.Previous studies about traffic dynamics usually focus on static networks,where nodes are motionless and links among nodes keep fixed.In our recent paper [1],we studied the transportation dynamics on networks of mobile agents.We assume that agents move on a plane and the searching area of an agent is a circle centered at itself.In that paper,information packets were delivered according to random routing algorithm,that is,a packet at an agent is forwarded to another randomly chosen agent in its’ searching area.The random routing can be applied in the case where moving agents cannot obtain the information about other agents’ positions.However,if an agent can know other agents’ positions,the random routing is not an effective algorithm for a packet to quickly reach the destination.Utilizing the information of agents’ positions,we now propose a greedy routing for networks of mobile agents.In the greedy routing,every time step a packet at an agent is delivered to another agent whose distance from the destination is shortest among all the agents in the searched neighbor region.We have found that the greedy routing markedly enhances the transportation capacity of networks compared with random routing.Based on the greedy routing,We find that the transportation capacity of the network increases as the communication radius increases.The transportation capacity of networks reaches the highest at the moderate moving speed.We also find that the average delivering time increases as the moving speed increases but decreases as the communication radius increases.