Notice of Violation of IEEE Publication Principles: An adaptive routing protocol for ad hoc peer-to-peer networks

Notice of Violation of IEEE Publication Principles

"An Adaptive Routing Protocol for Ad Hoc Peer-to-peer Networks,"
by L. Gatani, G. Lo Re, S. Gaglio.,
in the Proceedings of the Sixth International Symposium on World of Wireless Mobile and Multimedia Networks, 2005. WoWMoM 2005. pp. 44-50, 13-16 June 2005

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.

This paper contains substantial duplication of original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

6S: "Distributing Crawling and Searching Across Web Peers"
By Filippo Menczer, Ruj Akavipat and Le-Shin Wu
available at the following URL: http://www.informatics.indiana.edu/research/publications/6S.pdf
Ad hoc networks represent a key factor in the evolution of wireless communications. These networks typically consist of equal nodes that communicate without central control, interacting in a peer-to-peer way. In such a network, efficient and scalable data retrieval constitutes a challenging problem. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of structured approaches, because they impose few constraints on topology and data placement, and support highly versatile search mechanisms. However their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In order to address this major limitation, we evaluate the adoption of a local adaptive routing protocol, suitable for a self-organizing ad hoc environment. The routing algorithm uses a simple reinforcement learning scheme (driven by query interactions among peers), in order to adapt the topology to peer interests dynamically. In our simulation, this approach is able to group peer nodes dynamically in clusters containing peers with shared interests and organized into a small world network.