scholarly journals CHR: A Distributed Hash Table for Wireless Ad Hoc Networks

2005 ◽  
Author(s):  
F. Araujo ◽  
L. Rodrigues ◽  
J. Kaiser ◽  
Changling Liu ◽  
C. Mitidieri
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Hash Table ◽  
Distributed Hash Table ◽  
Hoc Networks

A Review of Trust Management for Mobile Ad Hoc Networks

2017 ◽  
pp. 142-154 ◽  
Author(s):  
Sarbjeet Singh
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Trust Management ◽  
Ad Hoc ◽  
Hash Table ◽  
Weighted Average ◽  
Distributed Hash Table ◽  
Trust Propagation ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Establishing trust in Mobile Ad hoc Networks (MANETs) is a challenging task. Trust management consists of various activities like prediction of trust, computation of trust, propagation of trust, aggregation of trust etc. Trust prediction can be done based on past behavior of node, internal parameters of the node, or it can be induction-based or neural-network based. Trust computation can be centralized or distributed. Trust propagation can be social networks based, small world phenomenon based, web of trust based, distributed hash table based. Trust aggregation can be weighted average based, probability based, sequential, conditional-sequential, parallel or subjective logic based. This work presents the review of various activities pertaining to trust management to enable researchers, academicians and practitioners to identify and address trust related issues in a better way.

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

2011 ◽  
pp. 1-25
Author(s):  
Raphaël Kummer ◽  
Peter Kropf ◽  
Pascal Felber
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Hash Table ◽  
Distributed Hash Table ◽  
Relay Nodes ◽  
Physical Proximity ◽  
Multicast Trees ◽  
Mobile Ad Hoc ◽  
Hoc Networks

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.

Cooperation-Aware Topology Control for Wireless Ad Hoc Networks with Opportunistic Interference Cancellation

2012 ◽  
Vol E95.B (9) ◽  
pp. 3047-3051 ◽  
Author(s):  
Xin AO ◽  
F. Richard YU ◽  
Shengming JIANG ◽  
Quansheng GUAN ◽  
Gang WEI
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Interference Cancellation ◽  
Topology Control ◽  
Ad Hoc ◽  
Hoc Networks

A New Technique for File Sharing Mechanism Ad hoc Networks

2018 ◽  
Vol 8 (3) ◽  
pp. 1
Author(s):  
N. Lavanya ◽  
M. Balakrishna
Keyword(s):  
Ad Hoc Networks ◽  
Network Coding ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
File Sharing ◽  
New Technique ◽  
Peer To Peer Systems ◽  
A New Technique ◽  
Hoc Networks ◽  
Outgoing Channel

Network coding is a data transmission technique which allows intermediate nodes in a network to re-code data in transit. In contrast to traditional network communication where a node repeats incoming data to its outgoing channel without modifying the payload, a node implementing network coding not only repeats but also alters data. Network coding has been demonstrated to increase network throughput compared to the traditional forwarding transmission. It has potentially broad applications in many areas, including traditional computer networks, wireless ad-hoc networks, and peer to peer systems. This paper process a new technique for file sharing in P2P.

Time-Based Broadcasting for Power-Aware Routing in Wireless Ad Hoc Networks

2009 ◽  
Vol 19 (12) ◽  
pp. 3218-3227
Author(s):  
Kai WEN ◽  
Wei GUO ◽  
Guang-Jie HUANG
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Hoc Networks
Sign in / Sign up

Export Citation Format

Share Document