Welcome to the InfoSci Platform
P2P Information Lookup, Collection, and Distribution in Mobile Ad-Hoc Networks

P2P Information Lookup, Collection, and Distribution in Mobile Ad-Hoc Networks

Raphaël Kummer, Peter Kropf, Pascal Felber
Copyright: © 2009 |Pages: 25
ISBN13: 9781605667157|ISBN10: 1605667153|EISBN13: 9781605667164
DOI: 10.4018/978-1-60566-715-7.ch001
Cite Chapter Cite Chapter

MLA

Kummer, Raphaël, et al. "P2P Information Lookup, Collection, and Distribution in Mobile Ad-Hoc Networks." Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications, edited by Boon-Chong Seet, IGI Global, 2009, pp. 1-25. https://doi.org/10.4018/978-1-60566-715-7.ch001

APA

Kummer, R., Kropf, P., & Felber, P. (2009). P2P Information Lookup, Collection, and Distribution in Mobile Ad-Hoc Networks. In B. Seet (Ed.), Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications (pp. 1-25). IGI Global. https://doi.org/10.4018/978-1-60566-715-7.ch001

Chicago

Kummer, Raphaël, Peter Kropf, and Pascal Felber. "P2P Information Lookup, Collection, and Distribution in Mobile Ad-Hoc Networks." In Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications, edited by Boon-Chong Seet, 1-25. Hershey, PA: IGI Global, 2009. https://doi.org/10.4018/978-1-60566-715-7.ch001

Export Reference

Mendeley
Favorite

Abstract

The most important characteristics of mobile ad-hoc networks (MANETs) such as broadcast and multihop communication, limited resources (particularly energy) and physical proximity are often ignored in solutions being proposed for information lookup and distribution. Thus, many lookup approaches rely on unstructured algorithms using flooding techniques, while content distribution mechanisms frequently generate inefficient multicast trees without considering the presence of nodes that are involved only as relays and are not interested in the distributed content. In this chapter, the authors present a multicast algorithm designed to build efficient multicast trees in MANETs that strive to limit the number of relay nodes and transmissions required. This distribution infrastructure relies on a lightweight distributed hash table (DHT) specifically adapted to MANETs, and exploits the physical proximity of nodes and broadcast communication. The algorithmic efficiency and scalability are evaluated by means of simulations for various network sizes and configurations.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.