Multiple User Cooperative Mobility in Mobile Ad Hoc Networks: An Interaction Position Game

Mobile ad hoc networks (MANETs) have been widely used by individuals for residential or commercial usage in small-scale areas depending on fifth-generation (5G) and device-to-device (D2D) advancements. MANET demands extremely high system throughput, low latency, and best quality of service (QoS) mai...

Full description

Bibliographic Details
Main Authors: Jiquan Xie, Tutomu Murase
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9136693/
id doaj-bc18edef9f5844a982191cb72a253be0
record_format Article
spelling doaj-bc18edef9f5844a982191cb72a253be02021-03-30T02:20:01ZengIEEEIEEE Access2169-35362020-01-01812629712631410.1109/ACCESS.2020.30079319136693Multiple User Cooperative Mobility in Mobile Ad Hoc Networks: An Interaction Position GameJiquan Xie0https://orcid.org/0000-0002-1905-2535Tutomu Murase1https://orcid.org/0000-0003-1042-6972Graduate School of Informatics, Nagoya University, Nagoya, JapanInformation Technology Center, Nagoya University, Nagoya, JapanMobile ad hoc networks (MANETs) have been widely used by individuals for residential or commercial usage in small-scale areas depending on fifth-generation (5G) and device-to-device (D2D) advancements. MANET demands extremely high system throughput, low latency, and best quality of service (QoS) maintenance. The current user mobility approaches only analyze the single movable user and use intuitive methods but cannot fundamentally solve multiple user cooperative mobility in practical applications. In this paper, we first jointly consider multiple user mobility and different geographical places and distances among all users. Then, we propose an interaction position game (IPG) to achieve high throughput and decrease computational cost. In this game, cooperative behaviors among movable users are proposed instead of assumed selfishness, as in traditional game models. In addition, we also present the simulated annealing (SA) algorithm to solve this NP-hard problem as a performance comparison. Finally, we evaluate the performance of this proposed game in various position cases. The results show that this game method improves the maximum throughput ratio evidently by 57.35% and 27.27% compared with the conventional intuitive method and SA algorithm, respectively. Compared with the exhaustive algorithm, this game reduces the computation cost by 82.79%.https://ieeexplore.ieee.org/document/9136693/Mobile ad hoc networkssystem throughputmultiple user cooperative mobilityinteraction position gamecooperative behaviorssimulated annealing
collection DOAJ
language English
format Article
sources DOAJ
author Jiquan Xie
Tutomu Murase
spellingShingle Jiquan Xie
Tutomu Murase
Multiple User Cooperative Mobility in Mobile Ad Hoc Networks: An Interaction Position Game
IEEE Access
Mobile ad hoc networks
system throughput
multiple user cooperative mobility
interaction position game
cooperative behaviors
simulated annealing
author_facet Jiquan Xie
Tutomu Murase
author_sort Jiquan Xie
title Multiple User Cooperative Mobility in Mobile Ad Hoc Networks: An Interaction Position Game
title_short Multiple User Cooperative Mobility in Mobile Ad Hoc Networks: An Interaction Position Game
title_full Multiple User Cooperative Mobility in Mobile Ad Hoc Networks: An Interaction Position Game
title_fullStr Multiple User Cooperative Mobility in Mobile Ad Hoc Networks: An Interaction Position Game
title_full_unstemmed Multiple User Cooperative Mobility in Mobile Ad Hoc Networks: An Interaction Position Game
title_sort multiple user cooperative mobility in mobile ad hoc networks: an interaction position game
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2020-01-01
description Mobile ad hoc networks (MANETs) have been widely used by individuals for residential or commercial usage in small-scale areas depending on fifth-generation (5G) and device-to-device (D2D) advancements. MANET demands extremely high system throughput, low latency, and best quality of service (QoS) maintenance. The current user mobility approaches only analyze the single movable user and use intuitive methods but cannot fundamentally solve multiple user cooperative mobility in practical applications. In this paper, we first jointly consider multiple user mobility and different geographical places and distances among all users. Then, we propose an interaction position game (IPG) to achieve high throughput and decrease computational cost. In this game, cooperative behaviors among movable users are proposed instead of assumed selfishness, as in traditional game models. In addition, we also present the simulated annealing (SA) algorithm to solve this NP-hard problem as a performance comparison. Finally, we evaluate the performance of this proposed game in various position cases. The results show that this game method improves the maximum throughput ratio evidently by 57.35% and 27.27% compared with the conventional intuitive method and SA algorithm, respectively. Compared with the exhaustive algorithm, this game reduces the computation cost by 82.79%.
topic Mobile ad hoc networks
system throughput
multiple user cooperative mobility
interaction position game
cooperative behaviors
simulated annealing
url https://ieeexplore.ieee.org/document/9136693/
work_keys_str_mv AT jiquanxie multipleusercooperativemobilityinmobileadhocnetworksaninteractionpositiongame
AT tutomumurase multipleusercooperativemobilityinmobileadhocnetworksaninteractionpositiongame
_version_ 1724185451707760640