Show simple item record

dc.contributor.authorShi, Leien
dc.contributor.authorHu, Yunen
dc.contributor.authorXu, Juanen
dc.contributor.authorShi, Yien
dc.contributor.authorDing, Xuen
dc.description.abstractSuccessive 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.en
dc.description.sponsorshipNational Natural Science Foundation of China [61701162, 61701005]en
dc.rightsCreative Commons Attribution 3.0 Unporteden
dc.subjectInterference managementen
dc.subjectmobile base stationen
dc.subjectsuccessive interference cancellationen
dc.subjectwireless networken
dc.titleThe Mobile Base Station Strategy for Wireless Networks With Successive Interference Cancellationen
dc.typeArticle - Refereeden
dc.contributor.departmentElectrical and Computer Engineeringen
dc.description.notesThis work was supported by the National Natural Science Foundation of China under Grant 61701162 and Grant 61701005.en
dc.title.serialIEEE Accessen

Files in this item


This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution 3.0 Unported
License: Creative Commons Attribution 3.0 Unported