| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] |
¡@
Yi-Chung Chen and Jang-Ping Sheu
Department of Computer Science and Information Engineering
National Central University
Chungli, 320 Taiwan
Peer-to-peer networks and mobile ad hoc networks (MANETs) share the same
characteristics of self-organization, decentralization, and dynamic topology. Therefore, it
is natural to apply peer-to-peer techniques to MANETs. A lookup protocol, one of the
most important issues in a peer-to-peer computing, is an essential component for resource
searching. In this paper, we propose interest-based bandwidth-efficient lookup
protocols, simple lookup protocol and advanced lookup protocol, for mobile environments.
A peer willing to search files broadcasts a query message with keywords relevant
to its interests to its neighbors in the transmission range, and only those neighbors also
interested in the query forward. Simulation results show that our protocols have higher
success rate and raise the scalability and bandwidth efficiency comparing to the previous
work. Besides, our protocols can avoid selfish behaviors, since the behavior of forwarding
queries benefits not only the source node but also the forwarding node.
Received October 7, 2004; revised April 12, 2005; accepted June 22, 2005.
Communicated by Chin-Teng Lin.
* This work was supported in part by the National Science Council of Taiwan, R.O.C., under grant No. NSC
93-2213-E-008-001.