Greedy Routing on Complex Networks

Xin Ling Shi; Li Jun Zhang; Da Kuo Wang

doi:10.4028/www.scientific.net/AMR.403-408.2453

Paper Titles

Characteristic and Influential Factors of Pollution Zone in the Lower Reach of Minjiang Tidal River
p.2437

A Lossless Data Compression Algorithm for Wireless Sensor Networks Based on Linear Regression Model
p.2441

Urban Traffic Corridors Determination Based on Characteristics of OD Data-Nanning City as an Example
p.2445

Directionally Weakened Diffusion for Optical Flow
p.2449

Greedy Routing on Complex Networks
p.2453

A Security Situation Sense Model Based on Artificial Immune System in the Internet of Things
p.2457

The Application of K-Means in Personal Credit Analysis
p.2461

Physical Fractional Step Method for Solution of 2D Discontinuous Problems
p.2465

Research and Design of Smart Phone-Based Logistics Information Management System
p.2469

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 403-408Greedy Routing on Complex Networks

Greedy Routing on Complex Networks

Abstract:

This paper proposes a new routing strategy on complex networks. Based on the idea of greedy algorithm, our routing strategy chooses the node that has the highest probability to reach destination with the studies of max degree search strategy. In the meantime, the dynamic information like queue length will affect influence our strategy in order to increase the capacity of network. The result of simulation shows our strategy has a better performance compare to other local routing strategy. This strategy can be used on different kinds of complex networks.