The Mobile Base Station Strategy for Wireless Networks With Successive Interference Cancellation
Successive interference cancellation (SIC) and mobile base stations (MBSs) have been separately exploited to effectively collect data in wireless networks. This paper aims to jointly optimize SIC and MBSs movement to minimize MBS's data collection time for given data. First, we design a DPS alg...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8747411/ |
id |
doaj-91f3ad03548d44429ab32840cf4b227d |
---|---|
record_format |
Article |
spelling |
doaj-91f3ad03548d44429ab32840cf4b227d2021-03-29T23:34:51ZengIEEEIEEE Access2169-35362019-01-017885708857810.1109/ACCESS.2019.29254238747411The Mobile Base Station Strategy for Wireless Networks With Successive Interference CancellationLei Shi0https://orcid.org/0000-0003-4042-592XYun Hu1Juan Xu2https://orcid.org/0000-0002-6626-1700Yi Shi3Xu Ding4School of Computer and Information, Hefei University of Technology, Hefei, ChinaSchool of Computer and Information, Hefei University of Technology, Hefei, ChinaSchool of Computer and Information, Hefei University of Technology, Hefei, ChinaDepartment of Electronics and Communication Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USASchool of Computer and Information, Hefei University of Technology, Hefei, ChinaSuccessive interference cancellation (SIC) and mobile base stations (MBSs) have been separately exploited to effectively collect data in wireless networks. This paper aims to jointly optimize SIC and MBSs movement to minimize MBS's data collection time for given data. First, we design a DPS algorithm for finding some dominating points (good locations for an MBS) in a two-dimensional area. Based on these dominating points, we build a suitable trajectory for MBS's traveling. Then, we divide the whole traveling path into many path parts and then allocate one or several time slots for each path part. In each time slot, we design a farthest-node-allocation (FNA) algorithm for scheduling node transmissions and determining the MBS's moving speed. The simulation results show that the proposed algorithm can significantly reduce the MBS's data collection time than the scheme without using the SIC.https://ieeexplore.ieee.org/document/8747411/Interference managementmobile base stationsuccessive interference cancellationwireless network |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Lei Shi Yun Hu Juan Xu Yi Shi Xu Ding |
spellingShingle |
Lei Shi Yun Hu Juan Xu Yi Shi Xu Ding The Mobile Base Station Strategy for Wireless Networks With Successive Interference Cancellation IEEE Access Interference management mobile base station successive interference cancellation wireless network |
author_facet |
Lei Shi Yun Hu Juan Xu Yi Shi Xu Ding |
author_sort |
Lei Shi |
title |
The Mobile Base Station Strategy for Wireless Networks With Successive Interference Cancellation |
title_short |
The Mobile Base Station Strategy for Wireless Networks With Successive Interference Cancellation |
title_full |
The Mobile Base Station Strategy for Wireless Networks With Successive Interference Cancellation |
title_fullStr |
The Mobile Base Station Strategy for Wireless Networks With Successive Interference Cancellation |
title_full_unstemmed |
The Mobile Base Station Strategy for Wireless Networks With Successive Interference Cancellation |
title_sort |
mobile base station strategy for wireless networks with successive interference cancellation |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2019-01-01 |
description |
Successive interference cancellation (SIC) and mobile base stations (MBSs) have been separately exploited to effectively collect data in wireless networks. This paper aims to jointly optimize SIC and MBSs movement to minimize MBS's data collection time for given data. First, we design a DPS algorithm for finding some dominating points (good locations for an MBS) in a two-dimensional area. Based on these dominating points, we build a suitable trajectory for MBS's traveling. Then, we divide the whole traveling path into many path parts and then allocate one or several time slots for each path part. In each time slot, we design a farthest-node-allocation (FNA) algorithm for scheduling node transmissions and determining the MBS's moving speed. The simulation results show that the proposed algorithm can significantly reduce the MBS's data collection time than the scheme without using the SIC. |
topic |
Interference management mobile base station successive interference cancellation wireless network |
url |
https://ieeexplore.ieee.org/document/8747411/ |
work_keys_str_mv |
AT leishi themobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation AT yunhu themobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation AT juanxu themobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation AT yishi themobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation AT xuding themobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation AT leishi mobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation AT yunhu mobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation AT juanxu mobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation AT yishi mobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation AT xuding mobilebasestationstrategyforwirelessnetworkswithsuccessiveinterferencecancellation |
_version_ |
1724189218311241728 |