Community-Aware Opportunistic Routing in Mobile Social Networks

Xiao, Mingjun; Wu, Jie; Huang, Liusheng

doi:10.1109/tc.2013.55

Cited by 177 publications

(93 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Aiming to further control network overhead ratio, we propose to set MR threshold to a small value. SG ← the target social group of dest (4) For node in neigh list (5) EG ← the ego group of node (6) If node = dest OR node ∈ SG OR dest ∈ EG (7) replicatemessage to node (8) Else if ∈ SG (9) If (node, dest) > SG ( , dest) AND MR ( , node) < MR (10) replicate message to node (11) End if (12) Else (13) If (node, dest) > ( , dest) AND MR ( , node) < MR (14) replicate message to node (15) End if (16) End if (17) End for (18) End for Algorithm 2: DGA routing algorithm on node .…”

Section: Message Redundancy Control Modelmentioning

confidence: 99%

Dynamic Groups Based Adaptive DTN Routing Algorithms in Social Networks

You

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Due to the nonexistence of end-to-end path between the sender and the receiver in delay tolerant networks and mobile social networks, consequently successful message transmission faces great challenges. In this paper, an adaptive routing algorithm taking full use of gregariousness characteristics of moving nodes is proposed. We first abstract all social relationships and uniformly represent them using friendship. Then by dynamically dividing nodes into different social groups, we finish flooding message among the target social group where destination node resides. In addition, we propose a social group based flooding model and a message redundancy control model to select fewer but better relay nodes and further reduce message redundancy. Extensive simulations have been conducted based on the synthetic traces generated by working day movement model and the results show that the proposed routing algorithm can get a higher message delivery ratio and a lower overhead ratio compared to Bubble Rap, Epidemic, and ProPHET, thus proving a better routing performance.

show abstract

Section: Message Redundancy Control Modelmentioning

confidence: 99%

Dynamic Groups Based Adaptive DTN Routing Algorithms in Social Networks

You

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Consequently a universal scheme, named E-Scheme, is proposed to improve routing on the delivery probability metric. In [23], the authors propose a distributed optimal community-aware opportunistic routing (CAOR) algorithm that computes the minimum expected delivery delays of nodes through a reverse Dijkstra algorithm and achieves the optimal opportunistic routing performance. By proposing a home-aware community model, whereby turning an MON into a network that only includes community homes, the computational cost and maintenance cost of contact information are greatly reduced.…”

Section: Related Workmentioning

confidence: 99%

A General and Specific Utility-Based Adaptive Routing for Delay Tolerant Networks

You

Wei

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The nonexistence of an end-to-end path poses great challenges in directly adapting the traditional routing algorithms for ad hoc or mobile ad hoc networks (MANETs) to delay tolerant networks (DTNs). In this paper, an adaptive routing protocol that makes use of both self-aware and destination-aware utility metrics to evaluate the potential throughput between every pair of nodes is proposed. We theoretically analyze the nodes' spraying process and discover the relationship between the initial number of copies and the latency of the message distribution process, by which we can further control the expected latency under a certain level. Compared with Epidemic, Spray And Wait Spray, And Focus and Encounter-based routing, our proposed algorithm is the only one that achieves comparable performance under both Helsinki City Scenario and Cambridge-iMote Scenario.

show abstract

“…Such networks require protocols that consider connectivity, time delays, reliability and quality of service. Delay tolerant network (DTN) paradigm serves as a means for such networks and regions with mismatched time delays 4,5 . The possibility of resource scarcity in DTNs make them vulnerable to various cyber-attacks, including interference attacks, typically referred to as jamming 6,7 .…”

Section: Introductionmentioning

confidence: 99%

A Game Theoretic Approach to Modelling Jamming Attacks in Delay Tolerant Networks

2017

View full text Add to dashboard Cite

The delay-tolerant-network (DTN) model is becoming a viable communication alternative to the traditional infrastructure model for military, terrestrial and atypical networks, which are characterised by transmission delay and intermittent network connections. The possibility of limited connectivity and resource scarcity in DTNs make them vulnerable to various cyber-attacks, including interference attacks such as jamming. We study the defence against jamming attacks in a delay tolerant network with two adversarial players -the jammer, and the transmitterreceiver pair in a game theoretic environment. The transmitters seek to choose an optimal time to schedule the transmission securely to maximise the probability of successful delivery before the session expires, while signal interferences from the jammer attempts to minimise this probability. We design strategies for the transmitters that offset transmission period based inference of network traffic by the jammer. We deduce a solution for this game, using a probability distribution function over finite number of strategies for both the players to compute their expected payoff. Using a simulation test-bed, we create several scenarios in which the players are considered to have perfect/imperfect information and compute the expected payoff and resulting equilibrium values. The cases of perfect /imperfect information of the players are further studied using entropy based measures. These results are used to strategically evaluate the optimal time for the players, and assess the efficiency of the strategies used by the transmitters against jammer attacks.

show abstract

Community-Aware Opportunistic Routing in Mobile Social Networks

Cited by 177 publications

References 23 publications

Dynamic Groups Based Adaptive DTN Routing Algorithms in Social Networks

Dynamic Groups Based Adaptive DTN Routing Algorithms in Social Networks

A General and Specific Utility-Based Adaptive Routing for Delay Tolerant Networks

A Game Theoretic Approach to Modelling Jamming Attacks in Delay Tolerant Networks

Contact Info

Product

Resources

About