Performance analysis of dLife routing in a delay tolerant networks

Kumiawan, Zulkhan Hafiidh; Yovita, Leanna Vidya; Wibowo, Tody Ariefianto

doi:10.1109/iccerec.2016.7814979

Cited by 4 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Now we calculate the criticality I M (v i ) of each node after contraction according to formula (11). If the criticality I M (v i ) of node V i is bigger than the control parameter ε, it shows that the network structure is more compact after structure contraction.…”

Section: Community Structure Contraction Strategymentioning

confidence: 99%

“…Good routing performance can be achieved at a low cost. dLife, proposed by reference [11], is a routing protocol of DTN(Delay tolerant network), which uses two utility functions of time varying connection duration and node importance to implement forwarding decisions. Experiments show that buffer size and message size can affect the performance of dLife routing.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks

Yan

Chen

et al. 2018

Algorithms

View full text Add to dashboard Cite

Abstract:With the popularization of mobile communication equipment, human activities have an increasing impact on the structure of networks, and so the social characteristics of opportunistic networks become increasingly obvious. Opportunistic networks are increasingly used in social situations. However, existing routing algorithms are not suitable for opportunistic social networks, because traditional opportunistic network routing does not consider participation in human activities, which usually causes a high ratio of transmission delay and routing overhead. Therefore, this research proposes an effective data transmission algorithm based on social relationships (ESR), which considers the community characteristics of opportunistic mobile social networks. This work uses the idea of the faction to divide the nodes in the network into communities, reduces the number of inefficient nodes in the community, and performs another contraction of the structure. Simulation results show that the ESR algorithm, through community transmission, is not only faster and safer, but also has lower transmission delay and routing overhead compared with the spray and wait algorithm, SCR algorithm and the EMIST algorithm.

show abstract

Section: Community Structure Contraction Strategymentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks

Yan

Chen

et al. 2018

Algorithms

View full text Add to dashboard Cite

show abstract

“…Zulkhan et al [32] evaluate the performance of dLife protocols in DTN concerning the impact of buffer and message size. dLife is a well-known protocol in DTN, which mainly comprises Time-Evolving Contact Duration (TECD) and TECD importance (TECDi).…”

Section: Related Workmentioning

confidence: 99%

A Sustainable Data Dissemination Approach by Utilizing the Internet of Moving Things

Memon,

Ali,

Kim

2024

IEEE Access

View full text Add to dashboard Cite

The Internet of Things (IoT) has shown remarkable competence in uniting devices and internet connectivity to make modern life's applications a reality. These networked devices, empowered with computing and communications, usually exhibit an exponential increment in network traffic to enhance the end-user quality of experience (QoE). The exponential increase in network traffic makes the traditional communication system congested. To reduce the burden of network traffic, the data could be offloaded to device-to-device(D2D) based infrastructure. This offloading scheme results in an innovative, eco-friendly, and sustainable data dissemination approach known as social networking and is mostly done in opportunistic ways. In this paper, we propose a scheme to explore the performance of the existing routing protocols with the movements and spatial closeness relations among 'things', termed as Internet of Moving Things (IoMT). The spatial closeness known as traces will help to make optimal data offloading decisions while considering the mobility traces of humans in the social network. The proposed mechanism is designed to optimally utilize moving physical objects to be involved as a third party in the data communication process between the sources and the destinations rather than using the traditional infrastructure while considering the quality of service (QoS). The simulation results have corroborated the proposed scheme and showed the remarkable performance of routing algorithms while incorporating mobility traces.

show abstract

“…These solutions are mainly based on a set of properties and behaviors relevant for MONs. Some of the most significant characteristics used in social routing are the community concept [29], reflected in works such as [30,31], the spacial centrality [32], with popular contributions such as EpSoc [33], SimBet [21], and Bubble Rap [16,34], interestbased communication [35] and contact graphs of nodes [36], and even abstract notions such as friendship or affinity [22,37,38]. Among these different approaches, those based on degree centrality have achieved great recognition in the literature.…”

Section: Related Workmentioning

confidence: 99%

Improving Delivery Probability in Mobile Opportunistic Networks with Social-Based Routing

Jesús-Azabal

García-Alonso²,

Soares³

et al. 2022

Electronics

View full text Add to dashboard Cite

There are contexts where TCP/IP is not suitable for performing data transmission due to long delays, timeouts, network partitioning, and interruptions. In these scenarios, mobile opportunistic networks (MONs) are a valid option, providing asynchronous transmissions in dynamic topologies. These architectures exploit physical encounters and persistent storage to communicate nodes that lack a continuous end-to-end path. In recent years, many routing algorithms have been based on social interactions. Smartphones and wearables are in vogue, applying social information to optimize paths between nodes. This work proposes Refine Social Broadcast (RSB), a social routing algorithm. RSB uses social behavior and node interests to refine the message broadcast in the network, improving the delivery probability while reducing redundant data duplication. The proposal combines the identification of the most influential nodes to carry the information toward the destination with interest-based routing. To evaluate the performance, RSB is applied to a simulated case of use based on a realistic loneliness detection methodology in elderly adults. The obtained delivery probability, latency, overhead, and hops are compared with the most popular social-based routers, namely, EpSoc, SimBet, and BubbleRap. RSB manifests a successful delivery probability, exceeding the second-best result (SimBet) by 17% and reducing the highest overhead (EpSoc) by 97%.

show abstract

Performance analysis of dLife routing in a delay tolerant networks

Cited by 4 publications

References 6 publications

An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks

An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks

A Sustainable Data Dissemination Approach by Utilizing the Internet of Moving Things

Improving Delivery Probability in Mobile Opportunistic Networks with Social-Based Routing

Contact Info

Product

Resources

About