Skip to main navigation Skip to search Skip to main content

An unscented Kalman filter based available bandwidth estimation algorithm for space bundle links

  • Harbin Institute of Technology Shenzhen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents an Unscented Kalman filter (UKF) based algorithm for estimating available bandwidth in a space Disruption-Tolerant Network (DTN) link. In the proposed algorithm, an UKF model is proposed for accurately tracking available bandwidth of bundle delivery over a space link. In particular, the proposed UKF will iteratively filter a serial of noised measurements on successive time intervals, which are obtained from a sequence of probe bundle pairs sent with a prior rate. Experimental results show that proposed algorithm can effectively estimate and track the available bandwidth over a time-varying space bundle link.

Original languageEnglish
Title of host publication2017 9th International Conference on Wireless Communications and Signal Processing, WCSP 2017 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-6
Number of pages6
ISBN (Electronic)9781538620625
DOIs
StatePublished - 7 Dec 2017
Externally publishedYes
Event9th International Conference on Wireless Communications and Signal Processing, WCSP 2017 - Nanjing, China
Duration: 11 Oct 201713 Oct 2017

Publication series

Name2017 9th International Conference on Wireless Communications and Signal Processing, WCSP 2017 - Proceedings
Volume2017-January

Conference

Conference9th International Conference on Wireless Communications and Signal Processing, WCSP 2017
Country/TerritoryChina
CityNanjing
Period11/10/1713/10/17

Keywords

  • Unscented Kalman Filter
  • bandwidth estimation
  • bundles
  • space disruption-tolerant networks

Fingerprint

Dive into the research topics of 'An unscented Kalman filter based available bandwidth estimation algorithm for space bundle links'. Together they form a unique fingerprint.

Cite this