Acta Metallurgica Sinica(English letters) ›› 2011, Vol. 18 ›› Issue (4): 111-117.doi: 10.1016/S1005-8885(10)60092-1

• Networks • 上一篇    下一篇

Query routing mismatch alleviation architecture for P2P file lookup in MANETs

梅敬青,纪红,李屹   

  1. 北京邮电大学
  • 收稿日期:2011-01-01 修回日期:2011-06-07 出版日期:2011-08-31 发布日期:2011-08-24
  • 通讯作者: 梅敬青 E-mail:mei.jingqing@gmail.com
  • 基金资助:

    This work was 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).

Query routing mismatch alleviation architecture for P2P file lookup in MANETs

  • Received:2011-01-01 Revised:2011-06-07 Online:2011-08-31 Published:2011-08-24
  • Contact: Jingqing Mei E-mail:mei.jingqing@gmail.com
  • Supported by:

    This work was 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.

关键词:

query routing mismatch, P2P overlay, Chord, MANETs

Abstract:

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.

Key words:

query routing mismatch, P2P overlay, Chord, MANETs