
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

A Topology Control Strategy with Efficient Path for Predictable DelayTolerant Networks
Dawei YAN Cong LIU Peng YOU Shaowei YONG Dongfang GUAN Yu XING
Publication
IEICE TRANSACTIONS on Communications
Vol.E102B
No.12
pp.21832198 Publication Date: 2019/12/01 Publicized: 2019/06/25 Online ISSN: 17451345
DOI: 10.1587/transcom.2018EBP3308 Type of Manuscript: PAPER Category: Fundamental Theories for Communications Keyword: delay or disruption tolerant networks, topology control, spacetime graph, edge betweenness centrality, efficient path,
Full Text: PDF(3MB)>>
Summary:
In wireless networks, efficient topology improves the performance of network protocols. The previous research mainly focuses on how to construct a costefficient network structure from a static and connected topology. Due to lack of continuous connectivity in the underlying topology, most traditional topology control methods are not applicable to the delay or disruption tolerant networks (DTNs). In this paper, we consider the topology control problem in a predictable DTN where the dynamic topology is known a priori or can be predicted over time. First, this dynamic topology is modeled by a directed spacetime graph that includes spatial and temporal information. Second, the topology control problem of the predictable DTN is formulated as building a sparse structure. For any pair devices, there is an efficient path connecting them to improve the efficiency of the generated structure. Then, a topology control strategy is proposed for this optimization problem by using a kth shortest paths algorithm. Finally, simulations are conducted on random networks and a realworld DTN tracing date. The results demonstrate that the proposed method can significantly improve the efficiency of the generated structure and reduce the total cost.

