Sciweavers

Share
26 search results - page 1 / 6
» Secure Routing Based on Social Similarity in Opportunistic N...
Sort
View
TWC
2016
78views more  TWC 2016»
3 years 4 months ago
Secure Routing Based on Social Similarity in Opportunistic Networks
—The lack of pre-existing infrastructure or dynamic topology makes it impossible to establish end-to-end connections in Opportunistic Networks (OppNets). Instead, a storeand-forw...
Lin Yao, Yanmao Man, Zhong Huang, Jing Deng, Xin W...
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
7 years 8 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
INFOCOM
2010
IEEE
8 years 6 months ago
PeopleRank: Social Opportunistic Forwarding
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
Abderrahmen Mtibaa, Martin May, Christophe Diot, M...
SOCIALCOM
2010
8 years 6 months ago
Measuring Similarity between Sets of Overlapping Clusters
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...
CORR
2016
Springer
59views Education» more  CORR 2016»
3 years 4 months ago
A Routing Mechanism Based on Social Networks and Betweenness Centrality in Delay-Tolerant Networks
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocol...
Huijuan Zhang, Kai Liu
books