Performance modeling of routing in delay-tolerant networks with node heterogeneity

Manam, V. K. Chaithanya; Mahendran, V.; Murthy, C. Siva Ram

doi:10.1109/comsnets.2012.6151324

Cited by 10 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors considered a network of heterogeneous devices, where different types of malware can only attack the systems they are targeted for. Manam et al [18] presents the performance modelling of two routing protocols (two-hop and epidemic) by considering the nodes to have heterogeneous transmission ranges. The delivery latency of the messages was found to decrease with the increasing transmission ranges of the nodes.…”

Section: Related Workmentioning

confidence: 99%

“…A walk through of the existing works reveal that there is a lack of 'comprehensive approach' to address the heterogeneity, and its impacts, on PSNs, or DTNs, in general. Besides, while works in [15,16,18] focus on the reduction of communication opportunities in the network, heterogeneity of certain aspects (e.g. incompatible network devicesin absence of any bridging [12], and routing protocols) turn available communication opportunities useless.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Effects of heterogeneity on the performance of pocket switched networks

Saha

Misra

2014

IET Networks

View full text Add to dashboard Cite

Pocket switched networks (PSNs), which are formed by mobile devices carried by their users, present an interesting communication paradigm especially in the absence of access to global network connectivity. This work explores the effect of nodes' heterogeneity on the performance of PSNs that use opportunistic communication mechanisms. The focus is on the diversities reflected by the hardware (specifically, buffer size and network interfaces) and software (specifically, routing protocol) of the nodes. Further, the effects of the asymmetric (unidirectional) connections among the devices have also been studied. Although there could be other forms of diversities, for example, different medium access control (MAC) layer protocols, the ones considered here are among the fundamental, and have the potential to render available communication opportunities useless. The work uses time-varying graphs to represent a PSN with heterogeneous routing protocols and capture its effect. To address the interactions among diverse routing protocols, the use of special nodes, protocol translation units (PTUs), is proposed. Each PTU runs a hybrid routing protocol, which encapsulates the functionality of two or more routing protocols. The results of performance evaluations reflect that deploying PTUs promotes the delivery ratio of the messages by about 15-50%, compared to the levels obtained in, otherwise, homogeneous PSNs.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Effects of heterogeneity on the performance of pocket switched networks

Saha

Misra

2014

IET Networks

View full text Add to dashboard Cite

show abstract

“…This approach contacts the node that is receiving the message during flooding. Several advanced proposals have replaced topological information with higher-level information while attempting to limit flooding cost [10][11][12][13][14].…”

Section: Introductionmentioning

confidence: 99%

Effective path prediction and data transmission in opportunistic social networks

Zou

Long

2021

IET Communications

View full text Add to dashboard Cite

With the development of social media, social networks have become an important platform for people to share and communicate. In social network communication, when people carry mobile devices for data transmission, they need to find a definite transmission destination to ensure the normal conduct of information exchange activities. This is manifested in the process of data transmission by nodes, which requires analysis and judgment of surrounding areas, and finds suitable nodes for effective data classification and transmission. However, the node cache space in social networks is limited, and the process of waiting for the target node will cause end-to-end transmission delay. In order to improve such a transmission environment, this paper proposes a node trajectory prediction method named EDPPM algorithm. The EDPPM algorithm guarantees that nodes with high probability are given priority to obtain data information, which realized an effective data transmission mechanism. Through experiments and comparison of opportunistic transmission algorithms in social networks, such as Epidemic algorithm, Spray and Wait algorithm, and PRoPHET algorithm, the proposed scheme outperforms ProPhet by 47% in terms of cache utilization of nodes, 55% in terms of data transmission delay, and 32% in terms of network efficiency; compared with Epidemic by 53% in terms of cache utilization of nodes, 62% in terms of data transmission delay, and 47% in terms of network efficiency; same thing with regard to the Spray and wait by 27% in terms of cache utilization of nodes, 31% in terms of data transmission delay, and 17% in terms of network efficiency.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

“…Such works showed that unrestricted buffers and epidemic routing will provide the best delivery ratio [10], even though the number of message copies increases exponentially, as predicted by the SIR (Susceptible-Infected-Recovered) model [13]. The buffer occupancy is usually not considered a problem, or one of less importance, to the point that most of the related work assumes infinite buffers [3]- [9], [14]- [17]. Heterogeneous ICTs, either for pairs [9], [15], [16] or groups [5], [14], [17] of nodes, are also rarely considered.…”

Section: Introductionmentioning

confidence: 99%

“…The buffer occupancy is usually not considered a problem, or one of less importance, to the point that most of the related work assumes infinite buffers [3]- [9], [14]- [17]. Heterogeneous ICTs, either for pairs [9], [15], [16] or groups [5], [14], [17] of nodes, are also rarely considered. A more detailed literature overview can be found in Table I. We focus our work on a specific type of sensor network where mobile nodes perform a measurement and then transmit their data by message forwarding among their peers.…”

Section: Introductionmentioning

confidence: 99%

A Markov chain model for drop ratio on one-packet buffers DTNs

Ramiro

Dang

Baudic

et al. 2015

2015 IEEE 16th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)

View full text Add to dashboard Cite

Most of the efforts to characterize DTN routing are focused on the trade-off between delivery ratio and delay. Buffer occupancy is usually not considered a problem and most of the related work assumes infinite buffers. In the present work, we focus on the drop ratio for message forwarding considering finite buffers. We model message drops with a continuous time Markov chain (CTMC). To the best of our knowledge, there is no previous work with such approach. We focus on the worst case with 1-packet buffers for message forwarding in homogeneous inter-contact times (ICT) and 2-class heterogeneous ICT. Our main contribution is to link the encounter rate(s) with the drop ratio. We show that the modeled drop ratio fits simulation results obtained with synthetic traces for both cases.

show abstract

Performance modeling of routing in delay-tolerant networks with node heterogeneity

Cited by 10 publications

References 16 publications

Effects of heterogeneity on the performance of pocket switched networks

Effects of heterogeneity on the performance of pocket switched networks

Effective path prediction and data transmission in opportunistic social networks

A Markov chain model for drop ratio on one-packet buffers DTNs

Contact Info

Product

Resources

About