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...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.展开更多
基金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.
