Opportunistic Routing Algorithm Based on Dynamic Address in MANET
Dawei Wang, Zhigang Chen, Ming Zhao, LI Yang-hui · Jisuanji gongcheng · 2010
【Abstract】In opportunistic routing, the calculation of distribution matrix is too large, especially as the network size increases, the performance of opportunistic routing is seriously affected. This paper proposes an opportunistic routing algorithm based on the dynamic address for the problem, which makes the calculation of distribution matrix from the entire network down to one-hop neighbor nodes. Experimental results show that according to the dynamic address reflecting the relative physical location of network nodes, the calculation of distribution matrix can be greatly simplified. In the large-scale network, average-hops are decreased by 5%~10% and throughput is increased by 7%~26% by the routing algorithm.