User cooperative mobility for QoS improvement in ad-hoc networks

Luo, Tianran; Murase, Tutomu

doi:10.1109/ccnc.2017.7983119

Cited by 13 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Miyata et al [18] introduced an algorithm for selecting the optimal AP based on user mobility to maximize throughput. T. Luo et al [19] experimentally verified the system throughput gain for a single mobile user at the optimal location and validated the range of throughput variation under the capture effect. In addition, K. Okumura et al [20] proposed direct and indirect methods of analyzing the throughput performance of multiple networks in the presence of link bottlenecks.…”

Section: B User Cooperative Mobility Approachmentioning

confidence: 97%

Effective Collaboration to Maximize Throughput Based on Multiuser Cooperative Mobility in Social-Physical Ad Hoc Networks

Xie

Murase

2021

IEEE Open J. Commun. Soc.

Self Cite

View full text Add to dashboard Cite

Social networks are playing an increasingly important role in information dissemination in wireless ad hoc networks with the wide adoption of the mobile Internet. In particular, in social application scenarios such as Facebook and Twitter, the questions of how to fully consider the social relationships between users to ensure the quality of service (QoS) urgently needs to be explored. This paper investigates an optimal social relay selection scheme with high intimacy requirements to maximize the system throughput for social-physical ad hoc networks with device-to-device (D2D) communication. Different from previous studies, we jointly consider feasible relays and multiuser cooperative mobility with satisfactory link reliability for throughput maximization. On the one hand, we formulate a nonlinear and nonconvex problem, which is typically NP-hard, for throughput optimization. Specifically, this optimization problem is divided into two subproblems: i) selecting the optimal relays and ii) determining the best mobility strategy in terms of throughput. On the other hand, we first convert the relay selection subproblem into an optimal stopping phase problem, and then propose a definition of a graph representing the degrees of interference between physical links, transforming the original optimization problem into a convex problem that is solvable using the Lagrange multiplier method. Based on the above, we propose the Relay selection and Link Interference Degree Graph (RS-LIDG) algorithm to solve the two subproblems. Numerical simulations verify that the proposed RS-LIDG method improves the throughput gain by 26.29%, 123.43%, and 236.47% compared to the intuitive method (IM), the social-trust-based random mobility selection method (STS-RM), and the physical-based random mobility selection method (PHS-RM), respectively.

show abstract

Section: B User Cooperative Mobility Approachmentioning

confidence: 97%

Effective Collaboration to Maximize Throughput Based on Multiuser Cooperative Mobility in Social-Physical Ad Hoc Networks

Xie

Murase

2021

IEEE Open J. Commun. Soc.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Ryo Hamamoto et al [10] introduced an AP selection method based on movable APs and users. In addition, references [7], [8] and Tianran Luo et al evaluated the system throughput characteristics of a single movable user and considered the capture effect or dynamic back-off time. Nonetheless, the scheme of multiple user mobility by the cooperative method has not been explored due to sophisticated transmission strategies and optimization criteria.…”

Section: B User Cooperative Mobility Approachmentioning

confidence: 99%

“…The current research themes focus on exploring algorithms for providing strategies for cooperating and realizing optimal throughput. However, only the single-user mobility strategy and investigation of throughput improvement have been studied [7]- [10], whereas previous research did not consider multiple user mobility, interference interactions among different users, and sufficient practical algorithms. Moreover, most researchers have concentrated on WLAN and limiting transmission distance [11], [12], but they have not proposed multiple new movable user mobility strategies until now.…”

Section: Introductionmentioning

confidence: 99%

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

Xie

Murase

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

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%. INDEX TERMS Mobile ad hoc networks, system throughput, multiple user cooperative mobility, interaction position game, cooperative behaviors, simulated annealing.

show abstract