Contact ability based topology control for predictable delay-tolerant networks

Abstract

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.