An Efficient Overlay for Unstructured P2P File Sharing over MANET using Underlying Cluster-based Routing

Shah, Nadir

doi:10.3837/tiis.2010.10.006

Cited by 10 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, OANTGPS can be modified for an ad-hoc network with mobile hosts, so as to be utilised for applications based on peer-to-peer communications [21].…”

Section: Discussionmentioning

confidence: 99%

New approach for routing in mobile ad‐hoc networks based on ant colony optimisation with global positioning system

Karia¹,

Godbole²

2013

IET Networks

View full text Add to dashboard Cite

The field of mobile ad-hoc networks (MANETs) has gained an important part of the interest of researchers and become very popular in past few years. MANETs can be used to set up a temporary mean of communication by having nodes behave as hosts and routers, with packets hopping between nodes to reach the destination node. This makes MANET suitable for rapid deployment, but because of the dynamic changes in network configurations, quickly finding the optimum route is difficult. In this study, the authors propose a biology-inspired ant routing protocol based on ant colony optimisation called as optimised antnet global positioning system, which is based on GPS and mobile software agents modelled on ants for routing in ad-hoc networks. The authors compare the performance of the authors protocol with Antnet, ad-hoc on-demand distance vector, Dynamic Source Routing (DSR) and Ad-hoc On Demand Multipath Distance Vector (AOMDV) protocols with respect to end-to-end delay, average throughput, packet delivery ratio and route cost.

show abstract

“…Finally, OANTGPS can be modified for an ad-hoc network with mobile hosts, so as to be utilised for applications based on peer-to-peer communications [21].…”

Section: Discussionmentioning

confidence: 99%

New approach for routing in mobile ad‐hoc networks based on ant colony optimisation with global positioning system

Karia¹,

Godbole²

2013

IET Networks

View full text Add to dashboard Cite

show abstract

“…During file transfer, the leader of the cluster periodically transmits data packets to the entire cluster. Shah et al [28] propose a method to construct an unstructured P2P overlay over MANET using the underlying cluster-based routing protocol. In their resource discovery process, the query request is published to all immediate neighbors who firstly check their local repositories, and respond accordingly.…”

Section: Advertisement Based Search Schemesmentioning

confidence: 99%

A Survey of Search Algorithms for Peer-to-Peer File Sharing Applications in Mobile Computing Infrastructure

Arunachalam¹,

Ravi²

2021

Preprint

View full text Add to dashboard Cite

Peer-to-Peer (P2P) Networking have a lot of practical applicability’s over the years. File storage and resource sharing are few key areas among the others where such peered network architecture is widely successful. The common building block for P2P networking is to store or locate an identifiable resource, for which there are basically 3 approaches namely (1) local storage/broadcast search (2) global storage/local search (3) distributed storage/distributed search. With the development of mobile hardware and wireless technology, it further became feasible to use mobile devices in these P2P networks. This computing architecture is widely used in Mobile Ad-hoc Network (MANET) for building content sharing applications. Search algorithm and file transfer schemes are the basic components of such content sharing systems. In this article, we provide a brief overview of the resource discovery approaches for peer-to-peer file sharing applications over MANET. We analyze and classify the search techniques into 4 broad schemes, mainly the flooding-based schemes, Distributed Hash Table (DHT) based schemes, advertisement-based schemes, and social network-based schemes. The pros and cons of each technique is summarized. Further, a one-to-one comparison is done across the classes for quick interpretation. We also outline the various issues, and complications that should be taken into consideration while designing any resource discovery algorithm. Further, we briefly discuss the security threats, and present state-of-the-art countermeasures for it. Also, we highlight some important guidelines that need to be focused while designing efficient file sharing applications and services in Mobile Edge Computing (MEC) enabled networks. Comprehensive and in-depth assessments of the related approaches are presented providing clear insights for the future research directions.

show abstract

“…Aslo in future performance of AntNet-LA can be analyzed using other mobility models like Group and Random Direction. Our approach can be utilized for applications based on peer-to-peer communications [22].…”

Section: Advantages Of Antnet-la Over Other Location Aware Protocolsmentioning

confidence: 99%

Performance Analysis of AntNet-LA Protocol for Ad-hoc Networks based on Disaster Area Mobility Model

Godbole¹

2013

REV-JEC

View full text Add to dashboard Cite

Availability of cheap positioning instruments like GPS receivers makes it possible for routing algorithms to use the position of nodes in an ad hoc mobile network. Regular position based routing algorithms fail to find a route from a source to a destination in some cases when the network contains nodes with irregular transmission ranges or they find a route that is much longer than the shortest path. On the other hand routing algorithms based on Ant Colony Optimization (ACO) find routing paths that are close to the shortest paths even if the nodes in the network have different transmission ranges. The drawback of these algorithms is the large number of messages that needs to be sent or the long delay before the routes are established. In this paper, we propose a novel protocol AntNet-LA which combines the idea of ACO with information about position of all nodes. In this technique the distance between the nodes is considered to transmit the packets, hence overcomes the drawbacks of AntNet algorithm which considers only cumulative probability for packet transmission. We compare performance of AntNet-LA with AntNet, Ad-hoc On Demand Distance Vector (AODV), Ad-hoc On Demand Multipath Distance Vector (AOMDV), Dynamic Source Routing (DSR) and Destination-Sequenced Distance-Vector Routing (DSDV) protocols. We also compare performance of AntNet-LA with distance-aware protocols such as Location Aided Routing (LAR), Geographical AODV GeoAODV and Position Based ANT colony optimization (PBANT).

show abstract

An Efficient Overlay for Unstructured P2P File Sharing over MANET using Underlying Cluster-based Routing

Cited by 10 publications

References 24 publications

New approach for routing in mobile ad‐hoc networks based on ant colony optimisation with global positioning system

New approach for routing in mobile ad‐hoc networks based on ant colony optimisation with global positioning system

A Survey of Search Algorithms for Peer-to-Peer File Sharing Applications in Mobile Computing Infrastructure

Performance Analysis of AntNet-LA Protocol for Ad-hoc Networks based on Disaster Area Mobility Model

Contact Info

Product

Resources

About