RINGS: Lookup service for peer-to-peer systems in mobile ad hoc networks

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A Peer-to-Peer (P2P) system consists of a set of nodes in which every node shares its own resources and services among other nodes in the system. These peer-to-peer systems are basically overlay networks, work on top of fixed network infrastructure. With the increasing popularity of mobile ad-hoc networks, it becomes necessary to think of P2P systems that can efficiently work in mobile environments. Putting current P2P applications into mobile environments, results in multiple layer flooding because these applications will maintain different peer routes than that of by network layer. Also, routes at the application layer may not be necessarily optimal at the network layer. Here, we address this problem and propose a novel, controlled-flooding based protocol named RINGS which works at network layer and helps P2P systems to work in mobile environment efficiently. RINGS reduces query lookup cost by evenly distributing data indices throughout the network, thus reducing network layer routing overhead. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Patel, K., Iyer, S., & Paul, K. (2004). RINGS: Lookup service for peer-to-peer systems in mobile ad hoc networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3326, 471–476. https://doi.org/10.1007/978-3-540-30536-1_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free