TY - GEN
T1 - COMSP
T2 - 15th IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2013
AU - Sun, Zhenxi
AU - Bai, Yuebin
AU - Wang, Rui
AU - Wang, Weitao
PY - 2014
Y1 - 2014
N2 - The routing algorithms of DTN (Delay- and Disruption-Tolerant Networks) have not been efficient enough until now, which is one of the hot spots for DTN research. In this paper, aiming at fully using the knowledge inside the DTN environments both locally and globally, we propose a forecast method based on time-varying graph using time series analysis theory. By processing the history contact data with ARMA(Auto Regression Moving Average) model of time series analysis theory, we can predict the start time and the duration of future contact between specified nodes, without needing to know the movement model of the nodes. Then we devise an algorithm based on correlated contact and message scheduling policy (COMSP) with the utility of messages and contacts taken into consideration. From the simulation result, the algorithm performs higher efficiency under the different transmit speed situations than most of the ones for comparing in both the cost and performance(e.g. delivery ratio, latency, hops, buffer time, overhead and so on).
AB - The routing algorithms of DTN (Delay- and Disruption-Tolerant Networks) have not been efficient enough until now, which is one of the hot spots for DTN research. In this paper, aiming at fully using the knowledge inside the DTN environments both locally and globally, we propose a forecast method based on time-varying graph using time series analysis theory. By processing the history contact data with ARMA(Auto Regression Moving Average) model of time series analysis theory, we can predict the start time and the duration of future contact between specified nodes, without needing to know the movement model of the nodes. Then we devise an algorithm based on correlated contact and message scheduling policy (COMSP) with the utility of messages and contacts taken into consideration. From the simulation result, the algorithm performs higher efficiency under the different transmit speed situations than most of the ones for comparing in both the cost and performance(e.g. delivery ratio, latency, hops, buffer time, overhead and so on).
KW - Contact Schedule
KW - DTN Routing
KW - Message Schedule
KW - Time Series Analysis
KW - Time-varying Graph Routing
UR - https://www.scopus.com/pages/publications/84903996812
U2 - 10.1109/HPCC.and.EUC.2013.90
DO - 10.1109/HPCC.and.EUC.2013.90
M3 - 会议稿件
AN - SCOPUS:84903996812
SN - 9780769550886
T3 - Proceedings - 2013 IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 2013 IEEE International Conference on Embedded and Ubiquitous Computing, EUC 2013
SP - 595
EP - 602
BT - Proceedings - 2013 IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 2013 IEEE International Conference on Embedded and Ubiquitous Computing, EUC 2013
PB - IEEE Computer Society
Y2 - 13 November 2013 through 15 November 2013
ER -