Encounter-based routing in delay tolerant networks

Zhang, Junbao; Luo, Guangchun; Qin, Ke; Sun, Haifeng

doi:10.1109/iccps.2011.6089802

Cited by 4 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It determines sparseness and denseness for given time interval. If the network is dense routing engine uses an encounter based forwarding technique [9], else, it invokes multi period based Spray and Wait [10]. Thus, AR toggles between forwarding and replication technique based on network condition per time window.…”

Section: Adaptive Routingmentioning

confidence: 99%

Efficient Routing Using Temporal Distance in Intermittently Connected Mobile Ad-hoc Networks

Shah

Kosta²,

Patel³

2013

View full text Add to dashboard Cite

The analysis of real social, biological and technological networks has attracted a lot of attention as technological advances have given us a wealth of empirical data. For, analysis and investigation time varying graphs are used to understand the relationship, contact duration, repeated occurrence of contact. It is under exploring in intermittently connected networks. Now, by extending the same concept in intermittent networks, the efficiency of the routing protocol can be improved. This paper discusses about the temporal characterizing algorithm. Such characterization can help in accurately understanding dynamic behaviors and taking appropriate routing decisions. Therefore, the present research provokes exploring different possibilities of utilizing the same time varying network analyses and designing an Adaptive Routing protocol using temporal distance metric. The adaptive routing protocol is implemented using ONE simulator and is compared with the Epidemic and PropHET for delivery ratio, overhead and the number of dropped messages. The result reveals that Adaptive routing performs better than Epidemic and PropHET for real and synthetic datasets.

show abstract

Section: Adaptive Routingmentioning

confidence: 99%

Efficient Routing Using Temporal Distance in Intermittently Connected Mobile Ad-hoc Networks

Shah

Kosta²,

Patel³

2013

View full text Add to dashboard Cite

show abstract

“…A considerable number of social-aware or social-based routing protocols for DTNs, hereinafter called social routing protocols, that use centrality 3 metrics have been proposed. If the most common centrality metrics are considered, these protocols can be grouped as follows: degree centrality [16][17][18][19], closeness centrality [20,21] and betweenness centrality [18,[22][23][24][25][26][27][28][29][30][31][32][33][34][35]. Among these metrics, betweenness centrality has shown its relevance to problems such as identifying important nodes that control flows of information between separate parts of a network, and identifying casual nodes to influence other entities behavior (e.g., genes in genomics or customers in marketing studies) [36].…”

Section: Introductionmentioning

confidence: 99%

Betweenness centrality in Delay Tolerant Networks: A survey

et al. 2015

View full text Add to dashboard Cite

“…Binary spray and wait [4] initially starts with some number of copies and any node that has more than one copy of message and encounters another node with no copies, then it hands over to another node half copies and keeps half copies itself, when it is left with only one copy, then it switches to direct transmission. Encounter based routing (EBR) [5] route decisions on the base of encounter rate of nodes, inclination to message transferred with nodes that have higher encounter rates. Encounter Value (EV) represents the node's past rate of encounters as an exponentially weighted moving average.…”

Section: Introductionmentioning

confidence: 99%

“…SimBet is social based routing protocol, which use the concept of ego networks where nodes are not required to exchange information about the entire network topology, but only locally available information is considered [6]. Encounter Based Routing (EBR) [5] protocol sends a number of copies of messages during a contact opportunity is proportional to the ratio of the Encounter Values of the nodes. By utilizing a concept of EBR, we have proposed SimBet multi-copy routing scheme that sends a number of copies of messages based on proportion of SimBetUtility values of the nodes.…”

Section: Introductionmentioning

confidence: 99%

Enhancement of Social based Routing Protocol in Delay Tolerant Networks

Patel¹,

Gondaliya²

2015

IJCA

View full text Add to dashboard Cite

Delay Tolerant Network has lack of continuous network connectivity, so probability of end to end path between source and destination for any given time is low. Routing in DTN is challenging because it consists a network partitioning, long delay and unstable topology. DTN use store-carry-forward approach for routing, in that packet stored until it encountered relay node to forward. In recent years, social based approaches have drawn much interests in routing design which exploits a social behavior of the node to make better routing decision. Social Network Analysis mainly focuses on studying the relationship among social entities, patterns and implication of their relationship. By using social properties, we can improve routing performance. SimBet is social based routing protocol, which use two social properties named Similarity and Betweenness Centrality for routing packets. We have proposed SimBet multi-copy routing scheme that transferred a number of copies of a message during contact opportunity is proportional to the ratio of SimBetUtility values of nodes. We have selected ONE Simulator for examining the results of different DTN routing protocols. We present a simulation using real trace data like Cambridge and pmtr. From the results of simulation, we conclude that our applied SimBet multi-copy performs better than SimBet and epidemic in terms of delivery ratio, it has lower latency and overhead ratio than SimBet and epidemic for larger buffer size and TTL, where still its hop count is higher than SimBet.

show abstract

Encounter-based routing in delay tolerant networks

Cited by 4 publications

References 27 publications

Efficient Routing Using Temporal Distance in Intermittently Connected Mobile Ad-hoc Networks

Efficient Routing Using Temporal Distance in Intermittently Connected Mobile Ad-hoc Networks

Betweenness centrality in Delay Tolerant Networks: A survey

Enhancement of Social based Routing Protocol in Delay Tolerant Networks

Contact Info

Product

Resources

About