{"title":"A mean-field game approach for distributed interference and resource management in heterogeneous cellular networks","authors":"Ali Y. Al-Zahrani, F. Yu, Minyi Huang","doi":"10.1109/GLOCOMW.2013.6855737","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6855737","url":null,"abstract":"Intercell interference has been known as a crucial issue in heterogeneous networks where different transmitter-receiver pairs compete for system resources. We solve this problem in two steps. We firstly assign the macrocell user with the optimum number of subchannels, which just guarantee the required quality of service. Then, the remaining subchannels are left to be shared by a large number of small cells using mean field game theory, which is proved to be more tractable than conventional game theory. Using recent advances of mean field approximation techniques, we convert the entangled traditional game of small cells system into a mean-field game where resources allocation is much easier and simpler. With different network topologies, simulation results show the effectiveness of our proposed scheme.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127435380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhaolong Ning, Qingyang Song, Lei Guo, A. Jamalipour
{"title":"Throughput improvement by network coding and spatial reuse in wireless mesh networks","authors":"Zhaolong Ning, Qingyang Song, Lei Guo, A. Jamalipour","doi":"10.1109/GLOCOMW.2013.6855672","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6855672","url":null,"abstract":"It is understood that the performance of network coding (NC) is largely dependent on link scheduling schemes, and greedy NC may in fact reduce network throughput due to the reduction of spectrum spatial reuse. In this paper, we study the interplay between NC and spatial reuse, and present a NC-aware link scheduling scheme to increase network throughput. Then, we propose an adaptive power control scheme to decrease interference so that NC and spatial reuse can be complementary in throughput improvement. Simulation results demonstrate that NC and spatial reuse are suitable for different network environments, and our proposed schemes can optimize network throughput by taking full advantage of the superiorities of both NC and spatial reuse in different network topologies.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127522116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Network-assisted discovery for device-to-device communications","authors":"Anastasios Thanos, Serveh Shalmashi, Guowang Miao","doi":"10.1109/GLOCOMW.2013.6825063","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825063","url":null,"abstract":"Network-assisted device-to-device (D2D) communications allow two devices to communicate with each other directly using one bidirectional link. Exchange of signaling messages with the base station allows the establishment of D2D communications. The discovery of D2D pairs of devices is an essential part of D2D communications as it provides the base station with all the information necessary to evaluate the possibility of D2D communication for the pair. This paper proposes two discovery algorithms, the centralized fully network-dependent and the semi centralized semi-network-dependent algorithms to identify D2D pairs through the exchange of a number of signaling messages. A comparison between those algorithms is performed with respect to delay and signaling overhead. Simulation results show that the second discovery algorithm is faster and more efficient than the first one in discovering new D2D pairs.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125165136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nandish P. Kuruvatti, A. Klein, Jörg Schneider, H. Schotten
{"title":"Exploiting diurnal user mobility for predicting cell transitions","authors":"Nandish P. Kuruvatti, A. Klein, Jörg Schneider, H. Schotten","doi":"10.1109/GLOCOMW.2013.6825002","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825002","url":null,"abstract":"Mobility of commuters is not purely random but rather direction oriented and may be learned after monitoring user movements for a couple of business days. Exploiting movement data and context information of diurnal user movements (public transportation, vehicular users, etc.) allows for predicting cell transitions and lays the basis e.g. for designing efficient resource reservation schemes or smart resource mapping approaches. In real life scenarios, several mobile users co-travel in public transport forming data intensive moving user clusters or moving networks. Various load balancing solutions exist to manage congestion situations that could arise. However, the crucial trigger for these solutions is timely prediction of arrival of moving user clusters or moving networks into a cell. This paper presents prediction and detection schemes that exploit context information for predicting user cell transitions and resulting congestion. These schemes are utilized to anticipate the arrival of data intensive moving user groups/moving networks, which are also referred to as \"hotspots\", into a cell. Simulation results demonstrate robust and timely prediction of these events and their applicability for handover optimization and smart resource management even at high velocities.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123698355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A reduced complexity receiver for multi-carrier faster-than-Nyquist signaling","authors":"F. Schaich, T. Wild","doi":"10.1109/GLOCOMW.2013.6824992","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6824992","url":null,"abstract":"Faster-than-Nyquist signaling originally proposed by J. E. Mazo promises higher spectral efficiencies by introducing controlled intersymbol interference at the transmitter at the cost of a higher receiver complexity. We propose a non-trellis based maximum likelihood (ML) receiver in conjunction with linear MMSE reception and interference cancellation for multi-carrier faster-than-Nyquist signaling (MC-FTN). The proposed receiver is able to collect the gains MC-FTN is promising while significantly reducing complexity compared to a receiver performing the optimum detection strategy (exhaustive search). We judge our receiver in terms of complexity, error rate performance and achieved spectral efficiency. The key question to be answered with respect to MC-FTN signaling in the view of a potential inclusion into a future 5G cellular communication system is: Are there scenarios in a realistic cellular communication setting for which gains from MC-FTN can be achieved at what complexity? This paper gives some insights covering all three aspects (scenarios, performance gains, complexity).","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125322405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yuki Sangenya, Fumihiro Inoue, M. Morikura, Koji Yamamoto, F. Nuno, T. Sugiyama
{"title":"Virtual continuous CWmin control scheme of WLAN","authors":"Yuki Sangenya, Fumihiro Inoue, M. Morikura, Koji Yamamoto, F. Nuno, T. Sugiyama","doi":"10.1109/GLOCOMW.2013.6855748","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6855748","url":null,"abstract":"This paper proposes a new CWmin control method called a virtual continuous CWmin control (VCCC) scheme. The key concept of this method is that it involves the use of small and large CWmin values probabilistically. The proposed scheme realizes the CWmin value as a nonnegative real number and solves the precise priority control problem. Moreover, we propose a theoretical analysis model for the proposed VCCC scheme. Computer simulation results show that the proposed scheme improves the throughput performance and achieves fairness between the uplink and the downlink flows in an infrastructure mode of the IEEE 802.11 based wireless LAN. The throughput of the proposed scheme is 15% higher than that of a conventional scheme when the number of wireless stations is 10. The difference between the theoretical analysis results and computer simulation results of the throughput performances is within 1%.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"429 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116001468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rateless-coding-assisted multi-packet spreading over mobile networks","authors":"Huazi Zhang, Zhaoyang Zhang, H. Dai","doi":"10.1109/GLOCOMW.2013.6855743","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6855743","url":null,"abstract":"A novel Rateless-coding-assisted Multi-Packet Relaying (RMPR) protocol is proposed for large-size data spreading in mobile wireless networks. With this lightweight and robust protocol, the packet redundancy is reduced by a factor of √n, while the spreading time is reduced at least by a factor of ln(n). Closed-form bounds and explicit non-asymptotic results are presented, which are further validated through simulations. Besides, the packet duplication phenomenon in the network setting is analyzed for the first time.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"475 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122184227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Communication architectures and protocols for networking unmanned aerial vehicles","authors":"Jun Li, Yifeng Zhou, L. Lamont","doi":"10.1109/GLOCOMW.2013.6825193","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825193","url":null,"abstract":"A fundamental but challenging problem in cooperation and control of multiple unmanned aerial vehicles (UAVs) is efficient networking of the UAVs over the wireless medium in rapidly changing environments. In this paper, we introduce four communication architectures for networking UAVs and review some military communication standards applicable to UAV communications. After discussions of pros and cons of each communication architecture, we conclude that a UAV ad hoc network is the most appropriate architecture to network a team of UAVs, while a multi-layer UAV ad hoc network is more suitable for multiple groups of heterogeneous UAVs. By comparing various legacy and next-generation military data link systems, we highlight that one important feature of the next-generation waveforms is their capability of Internet protocol (IP) based ad hoc networking, which allows UAVs to communicate with each other in a single- or multi-layer UAV ad hoc networks.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116831479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Benjebbour, Anxin Li, Yuya Saito, Y. Kishiyama, A. Harada, Takehiro Nakamura
{"title":"System-level performance of downlink NOMA for future LTE enhancements","authors":"A. Benjebbour, Anxin Li, Yuya Saito, Y. Kishiyama, A. Harada, Takehiro Nakamura","doi":"10.1109/GLOCOMW.2013.6824963","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6824963","url":null,"abstract":"This paper investigates the system-level performance of downlink non-orthogonal multiple access (NOMA) with power-domain user multiplexing at the transmitter side and successive interference canceller (SIC) on the receiver side. The goal is to clarify the performance gains of NOMA for future LTE (Long-Term Evolution) enhancements, taking into account design aspects related to the LTE radio interface such as, frequency-domain scheduling with adaptive modulation and coding (AMC), and NOMA specific functionalities such as error propagation of SIC receiver, multi-user pairing and transmit power allocation. In particular, a pre-defined user grouping and fixed per-group power allocation are proposed to reduce the overhead associated with power allocation signalling. Based on computer simulations, we show that for both wideband and subband scheduling and both low and high mobility scenarios, NOMA can still provide a hefty portion of its expected gains even with error propagation, and also when the proposed simplified user grouping and power allocation are used.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116834279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Eunhye Choi, Suin Song, Hye-Sun Kim, Jiyeon Hong, Hyunggon Park, M. Schaar
{"title":"Utility-based server management strategy in cloud networks","authors":"Eunhye Choi, Suin Song, Hye-Sun Kim, Jiyeon Hong, Hyunggon Park, M. Schaar","doi":"10.1109/GLOCOMW.2013.6825031","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825031","url":null,"abstract":"Numerous real-time applications are currently deployed over mobile networks - ranging from multimedia streaming, to real-time online games, to video conferences/chat, to real-time stock exchanges, etc. Supporting such applications is challenging because they have very stringent Quality of Service (QoS) requirements in terms of both throughput and delay. To address this challenge, in this paper, we propose to assist such mobile applications by a cloud-based network environment, which consists of multiple servers and clients (users). In cloud networks, servers can create multiple replica of the popular content in order to provide the needed QoS for the various service requests of the users. However, in order to efficiently provide services to the potentially large amount of service requests, it is essential for servers to strategically respond to the requests from users. Since the strategic response involves the resource management of the servers, we design a strategy which explicitly considers the service requests (e.g., service types, data priorities, delay constraints) as well as the servers' resource usages (e.g., current loads of servers, contributions of servers). Since the servers are strategic, they will aim to maximize their own utilities. Simulation results verify that the proposed approach enables servers to manage their resources more efficiently compared to existing approaches, thereby providing prioritized data processing and operating in a desired range and leading also to an improved performance for the users.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116867843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}