Journal ArticleDOI
Multidimensional Routing Protocol in Human-Associated Delay-Tolerant Networks
Reads0
Chats0
TLDR
A multidimensional routing protocol (M-Dimension) for the human-associated delay-tolerant networks which uses local information derived from multiple dimensions to identify a mobile node more accurately and significantly increases the average success ratio with a competitive end-to-end delay when compared with other multicast DTNs routing protocols.Abstract:
Human-associated delay-tolerant networks (HDTNs) are new networks where mobile devices are associated with humans and can be viewed from multiple dimensions including geographic and social aspects. The combination of these different dimensions enables us to comprehend delay-tolerant networks and consequently use this multidimensional information to improve overall network efficiency. Alongside the geographic dimension of the network, which is concerned with geographic topology of routing, social dimensions such as social characters can be used to guide the routing message to improve not only the routing efficiency for individual nodes, but also efficiency for the entire network. We propose a multidimensional routing protocol (M-Dimension) for the human-associated delay-tolerant networks which uses local information derived from multiple dimensions to identify a mobile node more accurately. The importance of each dimension has been measured by the weight function and it is used to calculate the best route. The greedy routing strategy is applied to select an intermediary node to forward message. We compare M-Dimension to the existing benchmark routing protocols via MIT reality Data Set and INFOCOM 2006 Data Set, which are real human-associated mobile network trace files. The results of our simulations show that M-Dimension significantly increases the average success ratio with a competitive end-to-end delay when compared with other multicast DTNs routing protocols.read more
Citations
More filters
Journal ArticleDOI
Social-aware data dissemination in opportunistic mobile social networks
TL;DR: This paper first evaluates these three characteristics of users and design a routing protocol called Geo-Social-Interest (GSI) protocol to select optimal relay nodes, which demonstrates that GSI overperforms the other protocols with highest data delivery ratio and low communication overhead.
Journal ArticleDOI
Folk-IS: opportunistic data services in least developed countries
Nicolas Anciaux,Luc Bouganim,Thierry Delot,Sergio Ilarri,Leila Kloul,Nathalie Mitton,Philippe Pucheral +6 more
TL;DR: This paper proposes a participatory approach, where each individual implements a small subset of a complete information system thanks to highly secure, portable and low-cost personal devices as well as opportunistic networking, without the need of any form of infrastructure.
Proceedings ArticleDOI
Interest-based prediction routing protocol in socially-aware opportunistic networks
TL;DR: This paper presents Interest-based Prediction routing protocol (InP) and establishes experiments based on real trace data set from SIGCOMM2009 and shows that the efficiency of InP outperforms Epidemic and PROPHET in higher delivery ratio, lower overhead and shorter average latency.
Journal ArticleDOI
Routing Protocols and Movement Models in Opportunistic Networks
TL;DR: In this paper various routing protocols and movement models with their advantages and disadvantages are presented, and how nodes may behave when routing and movement model is changed is presented.
Journal ArticleDOI
A multi-dimensional routing based approach for efficient communication inside partitioned social networks
TL;DR: An extended Multi-Dimensional Routing (eMDR) algorithm using Greedy routing, which considers multiple attributes for routing, improves the communication efficiency inside partitioned SNs.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
Birds of a Feather: Homophily in Social Networks
TL;DR: The homophily principle as mentioned in this paper states that similarity breeds connection, and that people's personal networks are homogeneous with regard to many sociodemographic, behavioral, and intrapersonal characteristics.
Proceedings ArticleDOI
GPSR: greedy perimeter stateless routing for wireless networks
Brad Karp,Hsiang-Tsung Kung +1 more
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Journal ArticleDOI
Finding community structure in very large networks.
TL;DR: A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.
Journal ArticleDOI
Uncovering the overlapping community structure of complex networks in nature and society
TL;DR: After defining a set of new characteristic quantities for the statistics of communities, this work applies an efficient technique for exploring overlapping communities on a large scale and finds that overlaps are significant, and the distributions introduced reveal universal features of networks.