DocumentCode :
3543706
Title :
A Data Dissemination Algorithm for Opportunistic Networks
Author :
Ciobanu, Radu-Ioan ; Dobre, Ciprian ; Cristea, Valentin
Author_Institution :
Comput. Sci. Dept., Univ. Politeh. of Bucharest, Bucharest, Romania
fYear :
2011
fDate :
26-29 Sept. 2011
Firstpage :
299
Lastpage :
305
Abstract :
Opportunistic networks are an evolution of MANETs, where highly mobile nodes that have no physical route connecting them might need to communicate. In this case routes are built dynamically, as nodes act according to a store-carry-and-forward paradigm. A natural continuation of forwarding in opportunistic networks is data dissemination, which is usually performed using the publish/subscribe model. In this paper, we propose a socially-based data dissemination technique for opportunistic networks called Social Dissemination. The solution assumes that nodes are grouped into communities, where nodes in the same community meet often, while at the same time certain nodes may have relationships with nodes from other communities. When two nodes meet, they exchange information about the data they store, and select data objects from the other node according to a utility function. We define such a utility function and experimentally compare its results with previously proposed state-of-the-art dissemination techniques.
Keywords :
mobile ad hoc networks; telecommunication network routing; MANET; data dissemination algorithm; data object; information exchange; mobile node; opportunistic network; routes; social dissemination; socially-based data dissemination technique; store-carry-and-forward paradigm; utility function; Ad hoc networks; Communities; Computational modeling; Delay; Heuristic algorithms; Peer to peer computing; delay-tolerant; dissemination; networks; opportunistic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-1-4673-0207-4
Type :
conf
DOI :
10.1109/SYNASC.2011.56
Filename :
6169595
Link To Document :
بازگشت