Papers
Topics
Authors
Recent
Search
2000 character limit reached

Scale-Free Opportunistic Networks: is it Possible?

Published 11 Jul 2011 in cs.DC and cs.NI | (1107.1937v2)

Abstract: 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.

Citations (6)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.