Relevant bibliographies by topics / Delay and disruption tolerant networks / Journal articles
To see the other types of publications on this topic, follow the link: Delay and disruption tolerant networks.

Journal articles on the topic 'Delay and disruption tolerant networks'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Delay and disruption tolerant networks.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

McMahon, Alex, and Stephen Farrell. "Delay- and Disruption-Tolerant Networking." IEEE Internet Computing 13, no. 6 (November 2009): 82–87. http://dx.doi.org/10.1109/mic.2009.127.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

SU, Jin-Shu, Qiao-Lin HU, Bao-Kang ZHAO, and Wei PENG. "Routing Techniques on Delay/Disruption Tolerant Networks." Journal of Software 21, no. 1 (February 23, 2010): 119–32. http://dx.doi.org/10.3724/sp.j.1001.2010.03689.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yu, Haizheng, Jianfeng Ma, and Hong Bian. "Reasonable routing in delay/disruption tolerant networks." Frontiers of Computer Science in China 5, no. 3 (April 25, 2011): 327–34. http://dx.doi.org/10.1007/s11704-011-0139-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Zhensheng, and Qian Zhang. "Delay/disruption tolerant mobilead hoc networks: latest developments." Wireless Communications and Mobile Computing 7, no. 10 (2007): 1219–32. http://dx.doi.org/10.1002/wcm.518.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Hezhe, Guangsheng Feng, Huiqiang Wang, Hongwu Lv, and Renjie Zhou. "RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight." International Journal of Distributed Sensor Networks 14, no. 3 (March 2018): 155014771875787. http://dx.doi.org/10.1177/1550147718757874.

Full text
Abstract:
Delay/disruption tolerant network is a novel network architecture, which is mainly used to provide interoperability for many challenging networks such as wireless sensor network, ad hoc networks, and satellite networks. Delay/disruption tolerant network has extremely limited network resources, and there is typically no complete path between the source and destination. To increase the message delivery reliability, several multiple copy routing algorithms have been used. However, only a few can be applied efficiently when there is a resource constraint. In this article, a delay/disruption tolerant network routing and buffer management algorithm based on weight (RABP) is proposed. This algorithm estimates the message delay and hop count to the destination node in order to construct a weight function of the delay and hop count. A node with the least weight value will be selected as the relay node, and the algorithm implements buffer management based on the weight of the message carried by the node, for efficiently utilizing the limited network resources. Simulation results show that the RABP algorithm outperforms the Epidemic, Prophet, and Spray and wait routing algorithms in terms of the message delivery ratio, average delay, network overhead, and average hop count.
APA, Harvard, Vancouver, ISO, and other styles
6

Goncalves Teixeira, Mafalda, Julio Ramirez Molina, and Vasco N. G. J. Soares. "Review on Free-Space Optical Communications for Delay and Disruption Tolerant Networks." Electronics 10, no. 13 (July 5, 2021): 1607. http://dx.doi.org/10.3390/electronics10131607.

Full text
Abstract:
The increase of data-rates that are provided by free-space optical (FSO) communications is essential in our data-driven society. When used in satellite and interplanetary networks, these optical links can ensure fast connections, yet they are susceptible to atmospheric disruptions and long orbital delays. The Delay and Disruption Tolerant Networking (DTN) architecture ensures a reliable connection between two end nodes, without the need for a direct connection. This can be an asset when used with FSO links, providing protocols that can handle the intermittent nature of the connection. This paper provides a review on the theoretical and state-of-the-art studies on FSO and DTN. The aim of this review is to provide motivation for the research of an optical wireless satellite network, with focus on the use of the Licklider Transmission Protocol. The assessment presented establishes the viability of these networks, providing many examples to rely on, and summarizing the most recent stage of the development of the technologies addressed.
APA, Harvard, Vancouver, ISO, and other styles
7

de Oliveira, Etienne C. R., Edelberto Franco Silva, Diego Passos, Juliano Naves, Débora Christina Muchaluat-Saade, Igor M. Moraes, and Célio Albuquerque. "Context-Aware Routing in Delay and Disruption Tolerant Networks." International Journal of Wireless Information Networks 23, no. 3 (July 9, 2016): 231–45. http://dx.doi.org/10.1007/s10776-016-0315-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Farrell, S., V. Cahill, D. Geraghty, I. Humphreys, and P. McDonald. "When TCP Breaks: Delay- and Disruption- Tolerant Networking." IEEE Internet Computing 10, no. 4 (July 2006): 72–78. http://dx.doi.org/10.1109/mic.2006.91.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

WATABE, Kohei, and Hiroyuki OHSAKI. "Contact Duration-Aware Epidemic Broadcasting in Delay/Disruption-Tolerant Networks." IEICE Transactions on Communications E98.B, no. 12 (2015): 2389–99. http://dx.doi.org/10.1587/transcom.e98.b.2389.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Silva, Aloizio P., Katia Obraczka, Scott Burleigh, José M. S. Nogueira, and Celso M. Hirata. "A congestion control framework for delay- and disruption tolerant networks." Ad Hoc Networks 91 (August 2019): 101880. http://dx.doi.org/10.1016/j.adhoc.2019.101880.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Karlsson, Gunnar, Kevin Almeroth, Kevin Fall, Martin May, Roy Yates, and Chin-Tau Lea. "Guest editorial - Delay and disruption tolerant wireless communication." IEEE Journal on Selected Areas in Communications 26, no. 5 (June 2008): 745–47. http://dx.doi.org/10.1109/jsac.2008.080601.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Jiao, Ya-zhou, Zhi-gang Jin, and Yan-tai Shu. "A Distributed Secure Data Dissemination Mechanism for Delay/Disruption Tolerant Networks." Journal of Electronics & Information Technology 33, no. 7 (August 3, 2011): 1575–81. http://dx.doi.org/10.3724/sp.j.1146.2010.01364.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Wang, Tong, Yue Cao, Yongzhe Zhou, and Pengcheng Li. "A Survey on Geographic Routing Protocols in Delay/Disruption Tolerant Networks." International Journal of Distributed Sensor Networks 12, no. 2 (January 2016): 3174670. http://dx.doi.org/10.1155/2016/3174670.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Cao, Yue, and Zhili Sun. "Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges." IEEE Communications Surveys & Tutorials 15, no. 2 (2013): 654–77. http://dx.doi.org/10.1109/surv.2012.042512.00053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Shahbazi, Saeed, Shanika Karunasekera, and Aaron Harwood. "Improving performance in delay/disruption tolerant networks through passive relay points." Wireless Networks 18, no. 1 (September 30, 2011): 9–31. http://dx.doi.org/10.1007/s11276-011-0384-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Silva, Aloizio P., Scott Burleigh, Celso M. Hirata, and Katia Obraczka. "A survey on congestion control for delay and disruption tolerant networks." Ad Hoc Networks 25 (February 2015): 480–94. http://dx.doi.org/10.1016/j.adhoc.2014.07.032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Yang, Zhihua, Qinyu Zhang, Ruhai Wang, Hongbing Li, and Athanasios V. Vasilakos. "On storage dynamics of space delay/disruption tolerant network node." Wireless Networks 20, no. 8 (June 18, 2014): 2529–41. http://dx.doi.org/10.1007/s11276-014-0756-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Silva, Ederson, and Paulo Guardieiro. "An efficient genetic algorithm for anycast routing in delay/disruption tolerant networks." IEEE Communications Letters 14, no. 4 (April 2010): 315–17. http://dx.doi.org/10.1109/lcomm.2010.04.092066.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Cao, Y., Z. Sun, and M. Riaz. "Reach-and-Spread: A historical geographic routing for delay/disruption tolerant networks." IET Networks 1, no. 3 (2012): 163. http://dx.doi.org/10.1049/iet-net.2012.0030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Cao, Yue, Zhili Sun, Ning Wang, Haitham Cruickshank, and Naveed Ahmad. "A Reliable and Efficient Geographic Routing Scheme for Delay/Disruption Tolerant Networks." IEEE Wireless Communications Letters 2, no. 6 (December 2013): 603–6. http://dx.doi.org/10.1109/wcl.2013.081413.130511.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Wang, Xu, Rongxi He, Bin Lin, and Ying Wang. "Probabilistic Routing Based on Two-Hop Information in Delay/Disruption Tolerant Networks." Journal of Electrical and Computer Engineering 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/918065.

Full text
Abstract:
We investigate an opportunistic routing protocol in delay/disruption tolerant networks (DTNs) where the end-to-end path between source and destination nodes may not exist for most of the time. Probabilistic routing protocol using history of encounters and transitivity (PRoPHET) is an efficient history-based routing protocol specifically proposed for DTNs, which only utilizes the delivery predictability of one-hop neighbors to make a decision for message forwarding. In order to further improve the message delivery rate and to reduce the average overhead of PRoPHET, in this paper we propose an improved probabilistic routing algorithm (IPRA), where the history information of contacts for the immediate encounter and two-hop neighbors has been jointly used to make an informed decision for message forwarding. Based on the Opportunistic Networking Environment (ONE) simulator, the performance of IPRA has been evaluated via extensive simulations. The results show that IPRA can significantly improve the average delivery rate while achieving a better or comparable performance with respect to average overhead, average delay, and total energy consumption compared with the existing algorithms.
APA, Harvard, Vancouver, ISO, and other styles
22

Bhutta, Muhammad Nasir Mumtaz, Haitham S. Cruickshank, and Zhili Sun. "An Efficient, Scalable Key Transport Scheme (ESKTS) for Delay/Disruption Tolerant Networks." Wireless Networks 20, no. 6 (February 8, 2014): 1597–609. http://dx.doi.org/10.1007/s11276-014-0693-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Yan, Hongcheng, Qingjun Zhang, and Yong Sun. "Local information-based congestion control scheme for space delay/disruption tolerant networks." Wireless Networks 21, no. 6 (February 1, 2015): 2087–99. http://dx.doi.org/10.1007/s11276-015-0911-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Cahill, Vinny, Stephen Farrell, and Jörg Ott. "Special issue of computer communications on delay and disruption tolerant networking." Computer Communications 32, no. 16 (October 2009): 1685–86. http://dx.doi.org/10.1016/j.comcom.2009.07.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Wang, Songyang, and Ruyi Ma. "NAME: A Naming Mechanism for Delay/Disruption-Tolerant Network." International journal of Computer Networks & Communications 5, no. 6 (November 30, 2013): 231–41. http://dx.doi.org/10.5121/ijcnc.2013.5615.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Wu, Yahui, Su Deng, and Hongbin Huang. "Control of Message Transmission in Delay/Disruption Tolerant Network." IEEE Transactions on Computational Social Systems 5, no. 1 (March 2018): 132–43. http://dx.doi.org/10.1109/tcss.2017.2776322.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Lopes Ribeiro, Fabricio Jorge, Aloysio de Castro Pinto Pedroza, and Luis Henrique Maciel Kosmalski Costa. "Deepwater Monitoring System in Underwater Delay/Disruption Tolerant Network." IEEE Latin America Transactions 10, no. 1 (January 2012): 1324–31. http://dx.doi.org/10.1109/tla.2012.6142480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Velásquez-Villada, Carlos, and Yezid Donoso. "Delay/Disruption Tolerant Networking-Based Routing for Rural Internet Connectivity (DRINC)." International Journal of Computers Communications & Control 12, no. 1 (December 2, 2016): 131. http://dx.doi.org/10.15837/ijccc.2017.1.2788.

Full text
Abstract:
Rural networking connectivity is a very dynamic and attractive research field. Nowadays big IT companies and many governments are working to help connect all these rural, disconnected people to Internet. This paper introduces a new routing algorithm that can bring non-real-time Internet connectivity to rural users. This solution is based on previously tested ideas, especially on Delay/Disruption Tolerant Networking technologies, since they can be used to transmit messages to and from difficult to access sites. It introduces the rural connectivity problem and its context. Then, it shows the proposed solution with its mathematical model used to describe the problem, its proposed heuristic, and its results. The advantage of our solution is that it is a low-cost technology that uses locally available infrastructure to reach even the most remote towns. The mathematical model describes the problem of transmitting messages from a rural, usually disconnected user, to an Internet connected node, through a non-reliable network using estimated delivery probabilities varying through time. The forwarding algorithm uses local knowledge gathered from interactions with other nodes, and it learns which nodes are more likely to connect in the future, and which nodes are more likely to deliver the messages to the destination. Our algorithm achieves an equal or better performance in delivery rate and delay than other well-known routing protocols for the rural scenarios tested. This paper adds more simulation results for the proposed rural scenarios, and it also extends the explanation of the mathematical model and the heuristic algorithm from the conference paper "Delay/Disruption Tolerant Networks Based Message Forwarding Algorithm for Rural Internet Connectivity Applications" [1] (doi: 10.1109/ICCCC. 2016.7496732).
APA, Harvard, Vancouver, ISO, and other styles
29

Bhutta, Muhammad Nasir Mumtaz, Haitham Cruickshank, and Zhili Sun. "Public-key infrastructure validation and revocation mechanism suitable for delay/disruption tolerant networks." IET Information Security 11, no. 1 (January 1, 2017): 16–22. http://dx.doi.org/10.1049/iet-ifs.2015.0438.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Liu, Qian, Chao Chen, Fuhong Lin, Haitao Xu, and Kraser Michael. "LMOP Based Hybrid Routing Strat e g y for Delay/Disruption Tolerant Networks." Journal of Engineering Science and Technology Review 7, no. 3 (August 2014): 164–70. http://dx.doi.org/10.25103/jestr.073.26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Cao, Yue, Zhili Sun, Haitham Cruickshank, and Fang Yao. "Approach-and-Roam (AaR): A Geographic Routing Scheme for Delay/Disruption Tolerant Networks." IEEE Transactions on Vehicular Technology 63, no. 1 (January 2014): 266–81. http://dx.doi.org/10.1109/tvt.2013.2272547.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Cao, Yue, Ning Wang, Zhili Sun, and Haitham Cruickshank. "A Reliable and Efficient Encounter-Based Routing Framework for Delay/Disruption Tolerant Networks." IEEE Sensors Journal 15, no. 7 (July 2015): 4004–18. http://dx.doi.org/10.1109/jsen.2015.2410297.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Kamal, Pratibha, and Nanhay Singh. "A new approach buffer-efficient disruption tolerant protocol in vehicular delay-tolerant network." Journal of Information and Optimization Sciences 41, no. 6 (August 17, 2020): 1395–405. http://dx.doi.org/10.1080/02522667.2020.1809094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Cho, Hsin-Hung, Han-Chieh Chao, Chi-Yuan Chen, and Timothy K. Shih. "Survey on underwater delay/disruption tolerant wireless sensor network routing." IET Wireless Sensor Systems 4, no. 3 (September 1, 2014): 112–21. http://dx.doi.org/10.1049/iet-wss.2013.0118.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Rajan, Gideon, and Gihwan Cho. "Applying a Security Architecture with Key Management Framework to the Delay/Disruption Tolerant Networks." International Journal of Security and Its Applications 9, no. 4 (April 30, 2015): 327–36. http://dx.doi.org/10.14257/ijsia.2015.9.4.30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Passos, D., H. Bueno, E. Oliveira, and C. Albuquerque. "Packet Scheduling and Discard Policies for Diffusion Control in Delay and Disruption Tolerant Networks." Journal of Communication and Information Systems 23, no. 1 (April 30, 2008): 12–21. http://dx.doi.org/10.14209/jcis.2008.2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Tao, Yong, Zheng-hu Gong, Ya-ping Lin, and Si-wang Zhou. "Congestion aware routing algorithm for delay-disruption tolerance networks." Journal of Central South University of Technology 18, no. 1 (February 2011): 133–39. http://dx.doi.org/10.1007/s11771-011-0670-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Yasmeen, Farzana, Uyen Trang Nguyen, Nurul Huda, Shigeki Yamada, and Cristian Borcea. "A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks." Network Protocols and Algorithms 7, no. 3 (November 30, 2015): 52. http://dx.doi.org/10.5296/npa.v7i3.8201.

Full text
Abstract:
Delay-tolerant networks (DTNs) can tolerate disruption on end-to-end paths by taking advantage of temporal links emerging between nodes as nodes move in the network. Intermediate nodes store messages before forwarding opportunities become available. A series of encounters (i.e., coming within mutual transmission range) among different nodes will eventually deliver the message to the desired destination. The message delivery performance in a DTN (such as delivery ratio and end-to-end delay) highly depends on the time elapsed between encounters and the time two nodes remain in each others communication range once a contact is established. As messages are forwarded opportunistically among nodes, it is important to have sufficient contact opportunities in the network for faster, more reliable delivery of messages. We propose a simple yet efficient method for improving the performance of a DTN by increasing the contact duration of encountered nodes (i.e., mobile devices). Our proposed sticky transfer framework and protocol enable nodes in DTNs to collect neighbors’ information, evaluate their movement patterns and amounts of data to transfer in order to make decisions of whether to “stick” with a neighbor to complete the necessary data transfers. The sticky transfer framework can be combined with any DTN routing protocol to improve its performance. We evaluate ourframework through simulations and measure several network performance metrics. Simulation results show that the proposed framework can improve the message delivery ratio, end-to-end delay, overhead ratio, buffer occupancy, number of disrupted message transmissions and so on. It can be well adopted for challenged scenarios where larger messages sizes need to be delivered with application deadline constraints. Furthermore, performance of the DTN improved (upto 43%) at higher node densities and (up to 49%) under increased mobility conditions.
APA, Harvard, Vancouver, ISO, and other styles
39

FU, Kai, Jing-bo XIA, and Ming-hui LI. "Node energy-aware probabilistic routing algorithm for delay/disruption tolerant network." Journal of Computer Applications 32, no. 12 (May 30, 2013): 3512–16. http://dx.doi.org/10.3724/sp.j.1087.2012.03512.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Lent, Ricardo. "A Cognitive Anycast Routing Method for Delay-Tolerant Networks." Network 1, no. 2 (July 30, 2021): 116–31. http://dx.doi.org/10.3390/network1020008.

Full text
Abstract:
A cognitive networking approach to the anycast routing problem for delay-tolerant networking (DTN) is proposed. The method is suitable for the space–ground and other domains where communications are recurrently challenged by diverse link impairments, including long propagation delays, communication asymmetry, and lengthy disruptions. The proposed method delivers data bundles achieving low delays by avoiding, whenever possible, link congestion and long wait times for contacts to become active, and without the need of duplicating data bundles. Network gateways use a spiking neural network (SNN) to decide the optimal outbound link for each bundle. The SNN is regularly updated to reflect the expected cost of the routing decisions, which helps to fine-tune future decisions. The method is decentralized and selects both the anycast group member to be used as the sink and the path to reach that node. A series of experiments were carried out on a network testbed to evaluate the method. The results demonstrate its performance advantage over unicast routing, as anycast routing is not yet supported by the current DTN standard (Contact Graph Routing). The proposed approach yields improved performance for space applications that require as-fast-as-possible data returns.
APA, Harvard, Vancouver, ISO, and other styles
41

Huang, Jinhui, Wenxiang Liu, Yingxue Su, and Feixue Wang. "Load balancing strategy and its lookup-table enhancement in deterministic space delay/disruption tolerant networks." Advances in Space Research 61, no. 3 (February 2018): 811–22. http://dx.doi.org/10.1016/j.asr.2017.10.045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Yu, Geng, and Fu Jie Huang. "Directed Flooding Routing Algorithm Based on Location in DTN." Advanced Materials Research 846-847 (November 2013): 1664–67. http://dx.doi.org/10.4028/www.scientific.net/amr.846-847.1664.

Full text
Abstract:
. In allusion to the high delay, restricted nodes resources and lack of persistent end to end connections in Delay /Disruption Tolerant Networks ( DTN) ,this paper proposes a novel directed flooding routing algorithm based on location information. The algorithm combines DTN with the known nodes locations in communication channel to improve the DTN networks topology knowledge to reduce the noneffective duplicate,then conducts single duplicate routing depending on location. The algorithm can increase the directivity and purposiveness of message transmission, decrease the consumption of networks resources, and thereby reduce propagation delay and improve the delivery ratio. The simulation shows that the proposed algorithm is feasible and effective, and it is superior to the typical DTN routing algorithms such as Epidemic Routing.
APA, Harvard, Vancouver, ISO, and other styles
43

Schoeneich, Radosław O., and Rafał Surgiewicz. "SocialRouting: The social-based routing algorithm for Delay Tolerant Networks." International Journal of Electronics and Telecommunications 62, no. 2 (June 1, 2016): 167–72. http://dx.doi.org/10.1515/eletel-2016-0023.

Full text
Abstract:
Abstract Delay and Disruptive Tolerant Networks (DTN) are relatively a new networking concept that could provide a robust communication in wide range of implementations from the space to battlefield or other military usage. However in such dynamic networks, which could be considered as a set of intermittently connected nodes, message forwarding strategy is a key issue. Existing routing solutions concentrate mainly on two major routing families flooding and knowledge based algorithms. This paper presents SocialRouting - the social-based routing algorithm designed for DTN. The use of the social properties of wireless mobile nodes is the novel way of message routing that is based on message ferrying between separated parts of the network. Proposed idea has been extensively tested using simulation tools. The simulations were made based on especially designed for measurements in DTN scenarios and compared with popular solutions.
APA, Harvard, Vancouver, ISO, and other styles
44

Khanna, Gaurav, Sanjay K. Chaturvedi, and Sieteng Soh. "Two-terminal Reliability Analysis for Time-evolving and Predictable Delay-tolerant Networks." Recent Advances in Electrical & Electronic Engineering (Formerly Recent Patents on Electrical & Electronic Engineering) 13, no. 2 (April 27, 2020): 236–50. http://dx.doi.org/10.2174/2213111607666190215121814.

Full text
Abstract:
Background: Several techniques are available to evaluate the two-terminal reliability (2TR) of static networks; however, the advent of dynamic networks in recent past, e.g., Delay Tolerant Networks (DTNs), has made this task extremely challenging due to their peculiar characteristics with an associated disruptive operational environment. Recently, a Cartesian product-based method has been proposed to enumerate time-stamped-minimal path sets (TS-MPS)-a precursor to compute the 2TR of such networks. However, it cannot be used to generate time-stamped-minimal cut sets (TS-MCS). TS-MCS cannot only be used as an alternative to generate 2TR but also to compute other unexplored reliability metrics in DTNs, e.g., the weakest link. Objective: To propose a novel approach to enumerate both TS-MPS and TS-MCS of a dynamic network, thereby computing the 2TR of such networks. Methods: The proposed technique converts the time aggregated graph model of a dynamic network into a Line Graph (LG) while maintaining the time-varying graph’s node reachability information. This LG is used thereafter to generate TS-MCS as well as TS-MPS to compute 2TR of the network. Results: The DTN examples are presented to show the efficacy and salient features of our algorithm to obtain 2TR of such networks. Conclusion: The terminologies and techniques used for studying/analyzing network reliability of static networks can be extended to dynamic networks as well, e.g., the notion of minimal path sets to TS-MPS or minimal cut sets to TS-MCS, to assess their network reliability-a potential area of furthering network reliability research.
APA, Harvard, Vancouver, ISO, and other styles
45

Wu, Jiagao, Fan Yuan, Yahang Guo, Hongyu Zhou, and Linfeng Liu. "A Fuzzy-Logic-Based Double Q -Learning Routing in Delay-Tolerant Networks." Wireless Communications and Mobile Computing 2021 (January 26, 2021): 1–17. http://dx.doi.org/10.1155/2021/8890772.

Full text
Abstract:
Delay-tolerant networks (DTNs) are wireless mobile networks, which suffer from frequent disruption, high latency, and lack of a complete path from source to destination. The intermittent connectivity in DTNs makes it difficult to efficiently deliver messages. Research results have shown that the routing protocol based on reinforcement learning can achieve a reasonable balance between routing performance and cost. However, due to the complexity, dynamics, and uncertainty of the characteristics of nodes in DTNs, providing a reliable multihop routing in DTNs is still a particular challenge. In this paper, we propose a Fuzzy-logic-based Double Q -Learning Routing (FDQLR) protocol that can learn the optimal route by combining fuzzy logic with the Double Q -Learning algorithm. In this protocol, a fuzzy dynamic reward mechanism is proposed, and it uses fuzzy logic to comprehensively evaluate the characteristics of nodes including node activity, contact interval, and movement speed. Furthermore, a hot zone drop mechanism and a drop mechanism are proposed, which can improve the efficiency of message forwarding and buffer management of the node. The simulation results show that the fuzzy logic can improve the performance of the FDQLR protocol in terms of delivery ratio, delivery delay, and overhead. In particular, compared with other related routing protocols of DTNs, the FDQLR protocol can achieve the highest delivery ratio and the lowest overhead.
APA, Harvard, Vancouver, ISO, and other styles
46

Muppalla, Kalyani, Mukhridinkhon Ibragimov, Jung-Il Namgung, and Soo-Hyun Park. "Key Factors for Future Underwater Delay and Disruption-Tolerant Network Routing Protocols." Sensor Letters 13, no. 4 (April 1, 2015): 281–87. http://dx.doi.org/10.1166/sl.2015.3431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

de Jesus dos Santos, Alyson, Luís Henrique M. K. Costa, Marcus de Lima Braga, Pedro Braconnot Velloso, and Yacine Ghamri-Doudane. "Characterization of a delay and disruption tolerant network in the Amazon basin." Vehicular Communications 5 (July 2016): 35–43. http://dx.doi.org/10.1016/j.vehcom.2016.09.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Schoeneich, Radosław O., and Patryk Sutkowski. "Performance of IP address auto-configuration protocols in Delay and Disruptive Tolerant Networks." International Journal of Electronics and Telecommunications 62, no. 2 (June 1, 2016): 173–78. http://dx.doi.org/10.1515/eletel-2016-0024.

Full text
Abstract:
Abstract At this moment there is a lack of research respecting Mobile Ad-hoc Networks (MANET) address assignment methods used in Delay Tolerant Networks (DTN). The goal of this paper is to review the SDAD, WDAD and Buddy methods of IP address assignment known from MANET in difficult environment of Delay and Disruptive Tolerant Networks. Our research allows us for estimating the effectiveness of the chosen solution and, therefore, to choose the most suitable one for specified conditions. As a part of the work we have created a tool which allows to compare these methods in terms of capability of solving address conflicts and network load. Our simulator was created from scratch in Java programming language in such a manner, that implementation of new features and improvements in the future will be as convenient as possible.
APA, Harvard, Vancouver, ISO, and other styles
49

Cao, Yue, Zhili Sun, Ning Wang, Fang Yao, and Haitham Cruickshank. "Converge-and-Diverge: A Geographic Routing for Delay/Disruption-Tolerant Networks Using a Delegation Replication Approach." IEEE Transactions on Vehicular Technology 62, no. 5 (June 2013): 2339–43. http://dx.doi.org/10.1109/tvt.2013.2238958.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Wang, Ruhai, Alaa Sabbagh, Scott C. Burleigh, Kanglian Zhao, and Yi Qian. "Proactive Retransmission in Delay-/Disruption-Tolerant Networking for Reliable Deep-Space Vehicle Communications." IEEE Transactions on Vehicular Technology 67, no. 10 (October 2018): 9983–94. http://dx.doi.org/10.1109/tvt.2018.2864292.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Delay and disruption tolerant networks' for other source types:
Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography