scispace - formally typeset
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

Opportunistic data services in least developed countries: benefits, challenges and feasibility issues

TL;DR: This paper proposes a participatory approach, called Folk-IS, 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 for any form of infrastructure.
Book ChapterDOI

First-Priority Relation Graph-Based Malicious Users Detection in Mobile Social Networks

TL;DR: One hamiltonian cycle decomposition of FPRG-based adaptive detection algorithm based on in MSNs under the PMC detection model (the system-level detection model) is proposed.
Journal ArticleDOI

Multi-layer-based opportunistic data collection in mobile crowdsourcing networks

TL;DR: This paper designs two types of multi-layer-based opportunistic data collection methods by using different dimensions of data, and shows that using these techniques, delivery ratio can be increased while reducing the load and energy consumption of the mobile network.
Journal ArticleDOI

Resource aware routing in heterogeneous opportunistic networks

TL;DR: This paper presents a Multiattribute Routing Scheme (MARS) based on “Simple Multiattribute Rating Technique” (SMART) that collects samples of vital information about a node's different characteristics and devise a method based on learning rules of neural networks which dynamically determines relative importance of each dimension to maximize next-hop utility of a node.
Proceedings ArticleDOI

Geographic and Energy aware Epidemic Strategy for Mobile Opportunistic DTN

TL;DR: This paper presents a novel data dissemination strategy called Geographic Energy-aware Epidemic Routing (GEER) in DTN network that tries to consider the residual node energy and degree centrality to dynamically select the number of nodes where forwarding data and it tries to preserve buffer space reducing the TTL of data sent on nodes with higher degreecentrality.
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

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.
Related Papers (5)