An EKF based overlapping coalition formation game for cooperative wireless network navigation
Abstract The problem of efficient link selections for cooperative navigation is investigated in dynamic wireless networks, using an extended Kalman filter based overlapping coalition formation (OCF) game approach. Due to the densely deployment of nodes without proper link selections, the conventiona...
Guardado en:
Autores principales: | , , , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Wiley
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/40a1a5f025a0435d9709ea8c22b79834 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
id |
oai:doaj.org-article:40a1a5f025a0435d9709ea8c22b79834 |
---|---|
record_format |
dspace |
spelling |
oai:doaj.org-article:40a1a5f025a0435d9709ea8c22b798342021-11-09T04:19:38ZAn EKF based overlapping coalition formation game for cooperative wireless network navigation1751-86361751-862810.1049/cmu2.12279https://doaj.org/article/40a1a5f025a0435d9709ea8c22b798342021-12-01T00:00:00Zhttps://doi.org/10.1049/cmu2.12279https://doaj.org/toc/1751-8628https://doaj.org/toc/1751-8636Abstract The problem of efficient link selections for cooperative navigation is investigated in dynamic wireless networks, using an extended Kalman filter based overlapping coalition formation (OCF) game approach. Due to the densely deployment of nodes without proper link selections, the conventional cooperative navigation approaches usually yield high time‐frequency resources as the existing resource management methods only work properly in static localisation systems. A new link selection mechanism which is reliable with limited resources in dynamic positioning scenarios is proposed. The varying topological structure and states of every node will be taken into consideration while each node abandons a considerable number of unnecessary links. Firstly, the state of every mobile node will be estimated in real‐time. Then a selection criterion is applied to determine whether nodes are well navigated. If the criterion is satisfied, an OCF game will be employed to construct the effective link selection. Otherwise, a re‐link mechanism will be used to obtain precise state information of each node. Numerical results show that the cooperative navigation algorithm can significantly improve the positioning accuracy and the proposed OCF game approach can build a cooperative network with limited number of links at the cost of appropriate performance degradation.Mingxing KeShiwei TianKaixiang TongHaiyan ZhangWileyarticleTelecommunicationTK5101-6720ENIET Communications, Vol 15, Iss 19, Pp 2407-2424 (2021) |
institution |
DOAJ |
collection |
DOAJ |
language |
EN |
topic |
Telecommunication TK5101-6720 |
spellingShingle |
Telecommunication TK5101-6720 Mingxing Ke Shiwei Tian Kaixiang Tong Haiyan Zhang An EKF based overlapping coalition formation game for cooperative wireless network navigation |
description |
Abstract The problem of efficient link selections for cooperative navigation is investigated in dynamic wireless networks, using an extended Kalman filter based overlapping coalition formation (OCF) game approach. Due to the densely deployment of nodes without proper link selections, the conventional cooperative navigation approaches usually yield high time‐frequency resources as the existing resource management methods only work properly in static localisation systems. A new link selection mechanism which is reliable with limited resources in dynamic positioning scenarios is proposed. The varying topological structure and states of every node will be taken into consideration while each node abandons a considerable number of unnecessary links. Firstly, the state of every mobile node will be estimated in real‐time. Then a selection criterion is applied to determine whether nodes are well navigated. If the criterion is satisfied, an OCF game will be employed to construct the effective link selection. Otherwise, a re‐link mechanism will be used to obtain precise state information of each node. Numerical results show that the cooperative navigation algorithm can significantly improve the positioning accuracy and the proposed OCF game approach can build a cooperative network with limited number of links at the cost of appropriate performance degradation. |
format |
article |
author |
Mingxing Ke Shiwei Tian Kaixiang Tong Haiyan Zhang |
author_facet |
Mingxing Ke Shiwei Tian Kaixiang Tong Haiyan Zhang |
author_sort |
Mingxing Ke |
title |
An EKF based overlapping coalition formation game for cooperative wireless network navigation |
title_short |
An EKF based overlapping coalition formation game for cooperative wireless network navigation |
title_full |
An EKF based overlapping coalition formation game for cooperative wireless network navigation |
title_fullStr |
An EKF based overlapping coalition formation game for cooperative wireless network navigation |
title_full_unstemmed |
An EKF based overlapping coalition formation game for cooperative wireless network navigation |
title_sort |
ekf based overlapping coalition formation game for cooperative wireless network navigation |
publisher |
Wiley |
publishDate |
2021 |
url |
https://doaj.org/article/40a1a5f025a0435d9709ea8c22b79834 |
work_keys_str_mv |
AT mingxingke anekfbasedoverlappingcoalitionformationgameforcooperativewirelessnetworknavigation AT shiweitian anekfbasedoverlappingcoalitionformationgameforcooperativewirelessnetworknavigation AT kaixiangtong anekfbasedoverlappingcoalitionformationgameforcooperativewirelessnetworknavigation AT haiyanzhang anekfbasedoverlappingcoalitionformationgameforcooperativewirelessnetworknavigation AT mingxingke ekfbasedoverlappingcoalitionformationgameforcooperativewirelessnetworknavigation AT shiweitian ekfbasedoverlappingcoalitionformationgameforcooperativewirelessnetworknavigation AT kaixiangtong ekfbasedoverlappingcoalitionformationgameforcooperativewirelessnetworknavigation AT haiyanzhang ekfbasedoverlappingcoalitionformationgameforcooperativewirelessnetworknavigation |
_version_ |
1718441289253388288 |