2014 IEEE Network Operations and Management Symposium (NOMS) 2014
DOI: 10.1109/noms.2014.6838390
|View full text |Cite
|
Sign up to set email alerts
|

ONSIDE: Socially-aware and Interest-based dissemination in opportunistic networks

Abstract: Data dissemination in opportunistic networks poses a series of challenges, since there is no central entity aware of all the nodes' subscriptions. Each individual node is only aware of its own interests and those of a node that it is contact with, if any. Thus, dissemination is generally performed using epidemic algorithms that flood the network, but they have the disadvantage that the network overhead and congestion are very high. In this paper, we propose ONSIDE, an algorithm that leverages a node's online s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
34
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 41 publications
(34 citation statements)
references
References 12 publications
0
34
0
Order By: Relevance
“…Reference [9] proposes an algorithm based on the social characteristics of nodes, such as online social connections, interests, and contact history. The hit ratio and transmission delay of the entire network are not affected.…”
Section: Related Workmentioning
confidence: 99%
“…Reference [9] proposes an algorithm based on the social characteristics of nodes, such as online social connections, interests, and contact history. The hit ratio and transmission delay of the entire network are not affected.…”
Section: Related Workmentioning
confidence: 99%
“…the local interest and a summary of the held content -according to the implemented algorithm (5). This information is obtained from the BCM, which has access to the user interests (6). The state information is used to update the local knowledge maintained by n (7) to compute its own utility and the utility of the other node for each message held in the buffer using the utility engine included in the BCM (8).…”
Section: Problem Definition and System Assumptionsmentioning
confidence: 99%
“…Received messages are stored in the buffer for further dissemination. Moreover, the BCM module uses its interest engine to match the content interest against the local interest (6): messages that are of local interest are notified to the user via the delivery.Ind service primitive and inserted in the local content repository (10). The algorithms solving the BehaviorCast problem implement the BCM.…”
Section: Problem Definition and System Assumptionsmentioning
confidence: 99%
See 1 more Smart Citation
“…When the number of sending sensors is small, QoS parameters are conformed. This is the reason to simulate very often the network in extreme environment [8][9][10].…”
Section: State Of the Artmentioning
confidence: 99%