摘要：When dynamic network exhibits extremely complex behavior and keeps on changing all the time, the energy efficiency is the most important key-point of routing algorithm. Many empirical measurements are inadequate to represent dynamic networks. However, the quotient space theory is an in-depth treatment of hierarchical problem solving, and powerful abilities of representation with different granularities. In this paper, we present a novel approach based on quotient space theory to reduce the computation complexity of routing algorithm in the dynamic network. Firstly, we analyze the structure of dynamic network and use community-based multi-granular representation to represent the network. Then we develop a routing algorithm based on multi-granular spaces. Finally, we compare the proposed algorithm with several alternative methods and the results show that our algorithm clearly outperforms the comparison methods in the road network
关键词：Quotient Space Theory;Granular Computing;Multi-Granularity;Network Structure Analysis;Network Routing
