Query routing mismatch alleviation architecture for P2P file lookup in MANETs  

作　　者：MEI Jing-qing JI Hong LI Yi 

机构地区：[1]Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2011年第4期111-117,共7页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Funds of China for Young Scholar (61001115);the National Natural Science Foundation of China (60832009);the Beijing Natural Science Foundation of China (4102044)

摘　　要：A cross-layer optimized query routing mismatch alleviation （QRMA） architecture is proposed to mitigate the problem of query routing mismatch （QRM） phenomenon between the structured peer to peer （P2P） overlay and the routing layer in mobile Ad-hoc networks （MANETs）, which is an important issue that results in the inefficiency of lookup process in the system. Explicated with the representative Chord protocol, the proposal exploits the information of topologic neighbors in the routing layer of MANETs to find if there is any optimized alternative next hop in P2P overlay during conventional lookup progress. Once an alternative next hop is detected, it will take the shortcut to accelerate the query procedure and therefore alleviate the QRM problem in scalable MANETs without any assistance of affiliation equipments such as GPS device. The probability of finding out such an alternative node is formulated and the factors that could increase the chance are discussed. The simulation results show that the proposed architecture can effectively alleviate the QRM problem and significantly improve the system performance compared with the conventional mechanism.A cross-layer optimized query routing mismatch alleviation （QRMA） architecture is proposed to mitigate the problem of query routing mismatch （QRM） phenomenon between the structured peer to peer （P2P） overlay and the routing layer in mobile Ad-hoc networks （MANETs）, which is an important issue that results in the inefficiency of lookup process in the system. Explicated with the representative Chord protocol, the proposal exploits the information of topologic neighbors in the routing layer of MANETs to find if there is any optimized alternative next hop in P2P overlay during conventional lookup progress. Once an alternative next hop is detected, it will take the shortcut to accelerate the query procedure and therefore alleviate the QRM problem in scalable MANETs without any assistance of affiliation equipments such as GPS device. The probability of finding out such an alternative node is formulated and the factors that could increase the chance are discussed. The simulation results show that the proposed architecture can effectively alleviate the QRM problem and significantly improve the system performance compared with the conventional mechanism.

关 键 词：query routing mismatch P2P overlay CHORD MANETS 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论] TN929.5[自动化与计算机技术—计算机科学与技术]