scholarly journals Contact ability based topology control for predictable delay-tolerant networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Hongsheng Chen ◽  
Chunhui Wu
Keyword(s):  
Topology Control ◽  
Vehicular Networks ◽  
Minimum Spanning Tree ◽  
Control Method ◽  
A Priori ◽  
Data Access ◽  
Delay Tolerant Networks ◽  
Network Partitioning ◽  
Contact Graph ◽  
Delay Tolerant

AbstractIn predictable delay tolerant networks (PDTNs), the network topology is known a priori or can be predicted over time, such as space planet networks and vehicular networks based on public buses or trains. Due to the intermittent connectivity, network partitioning, and long delays in PDTNs, most of the researchers mainly focuses on routing and data access research. However, topology control can improve energy effectiveness and increase the communication capacity, thus how to maintain the dynamic topology of PDTNs becomes crucial. In this paper, a contact ability based topology control method for PDTNs is proposed. First, the contact ability is calculated using our contact ability calculation model, and then the PDTNs is modeled as an undirected weighted contact graph which includes spatial and contact ability information. The topology control problem is defined as constructing a minimum spanning tree (MST) that the contact ability of the MST is maximized. We propose two algorithms based on undirected weighted contact graph to solve the defined problem, and compare them with the latest method in terms of energy cost and contact ability. Extensive simulation experiments demonstrate that the proposed algorithms can guarantee data transmission effectively, and reduce the network energy consumption significantly.

scholarly journals Contact Ability Based Topology Control for Predictable Delay-tolerant Networks

2021 ◽  
Author(s):  
Hongsheng Chen ◽  
Chunhui Wu
Keyword(s):  
Topology Control ◽  
Vehicular Networks ◽  
Minimum Spanning Tree ◽  
Control Method ◽  
A Priori ◽  
Data Access ◽  
Delay Tolerant Networks ◽  
Network Partitioning ◽  
Contact Graph ◽  
Delay Tolerant

Abstract In predictable delay tolerant networks (PDTNs), the network topology is known a priori or can be predicted over time such as space planet networks and vehicular networks based on public buses or trains. Due to the intermittent connectivity, network partitioning, and long delays in PDTNs, most of the researchers mainly focuses on routing and data access research. However, topology control can improve energy effectiveness and increase the communication capacity, thus how to maintain the dynamic topology of PDTNs becomes crucial. In this paper, a contact ability based topology control method for PDTNs is proposed. First, the contact ability is calculated using our contact ability calculation model, and then the PDTNs is modeled as an undirected weighted contact graph which includes spatial and contact ability information. The topology control problem is defined as constructing a Minimum Spanning Tree(MST) that the contact ability of the MST is maximized. We propose two algorithms based on undirected weighted contact graph to solve the defined problem, and compare them with the latest method in terms of energy cost and contact ability. Extensive simulation experiments demonstrate that the proposed algorithms can guarantee data transmission effectively, and reduce the network energy consumption significantly.

A Topology Control Strategy with Efficient Path for Predictable Delay-Tolerant Networks

2019 ◽  
Vol E102.B (12) ◽  
pp. 2183-2198
Author(s):  
Dawei YAN ◽  
Cong LIU ◽  
Peng YOU ◽  
Shaowei YONG ◽  
Dongfang GUAN ◽  
...  
Keyword(s):  
Control Strategy ◽  
Topology Control ◽  
Delay Tolerant Networks ◽  
Delay Tolerant

scholarly journals A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lei You ◽  
Jianbo Li ◽  
Changjiang Wei ◽  
Chenqu Dai ◽  
Jixing Xu ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Network Partitioning ◽  
Heuristic Function ◽  
Hop Count ◽  
Dynamic Topology ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Delay Tolerant

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

Delay Tolerant Networks

2019 ◽  
pp. 448-480 ◽  
Author(s):  
Vandana Kushwaha ◽  
Ratneshwer Gupta
Keyword(s):  
Vehicular Networks ◽  
Low Cost ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Delay Tolerant Network ◽  
Data Packets ◽  
Security Issues ◽  
Terrestrial Environments ◽  
Routing Congestion ◽  
Delay Tolerant

Opportunistic networks are one of the emerging evolutions of the network system. In opportunistic networks, nodes are able to communicate with each other even if the route between source to destination does not already exist. Opportunistic networks have to be delay tolerant in nature (i.e., able to tolerate larger delays). Delay tolerant network (DTNs) uses the concept of “store-carry-forward” of data packets. DTNs are able to transfer data or establish communication in remote area or crisis environment where there is no network established. DTNs have many applications like to provide low-cost internet provision in remote areas, in vehicular networks, noise monitoring, extreme terrestrial environments, etc. It is therefore very promising to identify aspects for integration and inculcation of opportunistic network methodologies and technologies into delay tolerant networking. In this chapter, the authors emphasize delay tolerant networks by considering its architectural, routing, congestion, and security issues.

Topology Control based on Set Cover for Delay-Tolerant Networks

2016 ◽  
Author(s):  
Xuyan Bao ◽  
◽  
Xiaojin Zhou ◽  
Xiaojuan Wang ◽  
Yong Zhang ◽  
...  
Keyword(s):  
Topology Control ◽  
Delay Tolerant Networks ◽  
Set Cover ◽  
Delay Tolerant

scholarly journals Learning Automata Based Caching for Efficient Data Access in Delay Tolerant Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-19 ◽  
Author(s):  
Zhenjie Ma ◽  
Haoran Wang ◽  
Ke Shi ◽  
Xinda Wang
Keyword(s):  
Network Topology ◽  
Learning Automata ◽  
Network Connectivity ◽  
Data Access ◽  
Delay Tolerant Networks ◽  
Global Network ◽  
Node Mobility ◽  
Data Caching ◽  
Efficient Data ◽  
Delay Tolerant

Effective data access is one of the major challenges in Delay Tolerant Networks (DTNs) that are characterized by intermittent network connectivity and unpredictable node mobility. Currently, different data caching schemes have been proposed to improve the performance of data access in DTNs. However, most existing data caching schemes perform poorly due to the lack of global network state information and the changing network topology in DTNs. In this paper, we propose a novel data caching scheme based on cooperative caching in DTNs, aiming at improving the successful rate of data access and reducing the data access delay. In the proposed scheme, learning automata are utilized to select a set of caching nodes as Caching Node Set (CNS) in DTNs. Unlike the existing caching schemes failing to address the challenging characteristics of DTNs, our scheme is designed to automatically self-adjust to the changing network topology through the well-designed voting and updating processes. The proposed scheme improves the overall performance of data access in DTNs compared with the former caching schemes. The simulations verify the feasibility of our scheme and the improvements in performance.

Sign in / Sign up

Export Citation Format

Share Document