Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2011-07-11
Computer Science
Distributed, Parallel, and Cluster Computing
A revised version of the paper will appear in Proc. of the 8th International Workshop on Mobile Peer-to-Peer Computing - IEEE
Scientific paper
The coupling of scale-free networks with mobile unstructured networks is certainly unusual. In mobile networks, connections active at a given instant are constrained by the geographical distribution of mobile nodes, and by the limited signal strength of the wireless technology employed to build the ad-hoc overlay. This is in contrast with the presence of hubs, typical of scale-free nets. However, opportunistic (mobile) networks possess the distinctive feature to be delay tolerant; mobile nodes implement a store, carry and forward strategy that permits to disseminate data based on a multi-hop route, which is built in time, when nodes encounter other ones while moving. In this paper, we consider opportunistic networks as evolving graphs where links represent contacts among nodes arising during a (non-instantaneous) time interval. We discuss a strategy to control the way nodes manage contacts and build "opportunistic overlays". Based on such an approach, interesting overlays can be obtained, shaped following given desired topologies, such as scale-free ones.
Ferretti Stefano
Ghini Vittorio
No associations
LandOfFree
Scale-Free Opportunistic Networks: is it Possible? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Scale-Free Opportunistic Networks: is it Possible?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scale-Free Opportunistic Networks: is it Possible? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-137329