Pub Date : 2018-05-07DOI: 10.23919/WIOPT.2018.8362860
Pengwenlong Gu, Cunqing Hua, R. Khatoun, Yue Wu, A. Serhrouchni
Radio Frequency (RF) jamming attacks constitute a major threat to the availability of control channel communications in the vehicular networks. In particular, the victim vehicles may fail to receive the safety related messages from the Road Side Unit (RSU) due to persistent jamming attacks, which can possibly cause tremendous economic loss and claim human lives. In this paper, we propose a cooperative anti-jamming beamforming scheme for the control channel jamming problem in vehicular networks, which takes advantage of the multi-antenna and spatial diversity provided by the RSU and relay vehicles to improve the transmission reliability of the victim vehicles. The anti-jamming beamformer design problem is formulated as a Mixed-integer Nonlinear Programming (MINLP) problem, which is intractable in general. We address this challenging problem by reformulating it as a sequence of convex sub-problems using the semi-definite relaxation (SDR) and convex-concave procedure (CCP) methods. Simulation results are provided to investigate the convergence of the proposed scheme, and significant performance gain can be observed comparing with other benchmark schemes.
{"title":"Cooperative relay beamforming for control channel jamming in vehicular networks","authors":"Pengwenlong Gu, Cunqing Hua, R. Khatoun, Yue Wu, A. Serhrouchni","doi":"10.23919/WIOPT.2018.8362860","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362860","url":null,"abstract":"Radio Frequency (RF) jamming attacks constitute a major threat to the availability of control channel communications in the vehicular networks. In particular, the victim vehicles may fail to receive the safety related messages from the Road Side Unit (RSU) due to persistent jamming attacks, which can possibly cause tremendous economic loss and claim human lives. In this paper, we propose a cooperative anti-jamming beamforming scheme for the control channel jamming problem in vehicular networks, which takes advantage of the multi-antenna and spatial diversity provided by the RSU and relay vehicles to improve the transmission reliability of the victim vehicles. The anti-jamming beamformer design problem is formulated as a Mixed-integer Nonlinear Programming (MINLP) problem, which is intractable in general. We address this challenging problem by reformulating it as a sequence of convex sub-problems using the semi-definite relaxation (SDR) and convex-concave procedure (CCP) methods. Simulation results are provided to investigate the convergence of the proposed scheme, and significant performance gain can be observed comparing with other benchmark schemes.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125508510","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}
Pub Date : 2018-05-07DOI: 10.23919/WIOPT.2018.8362889
V. Sukumaran, C. Singh
We study stability properties of single-source single-destination delay tolerant networks with random packet arrivals and buffered relay nodes, using source spray and wait routing. We derive the stability threshold, the supremum of arrival rates for which the source queue is stable, as a function of the buffer space at the relays. In particular, we show that the stability threshold only doubles as the relays' buffer size increases from one to infinity for a network without packet delivery feedback. For the system without packet delivery feedback, we propose lower bounds for the average queueing delay and average delivery delay for packets and compare with simulations. We also obtain the stability threshold numerically for a network with instantaneous packet delivery feedback.
{"title":"Stability properties of delay tolerant networks with buffered relay nodes","authors":"V. Sukumaran, C. Singh","doi":"10.23919/WIOPT.2018.8362889","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362889","url":null,"abstract":"We study stability properties of single-source single-destination delay tolerant networks with random packet arrivals and buffered relay nodes, using source spray and wait routing. We derive the stability threshold, the supremum of arrival rates for which the source queue is stable, as a function of the buffer space at the relays. In particular, we show that the stability threshold only doubles as the relays' buffer size increases from one to infinity for a network without packet delivery feedback. For the system without packet delivery feedback, we propose lower bounds for the average queueing delay and average delivery delay for packets and compare with simulations. We also obtain the stability threshold numerically for a network with instantaneous packet delivery feedback.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127303273","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}
Pub Date : 2018-05-07DOI: 10.23919/WIOPT.2018.8362868
Cheng Zhan, Guo Yao
To address the explosively growing demand for mobile traffic, wireless device-to-device (D2D) networks have been introduced, where caching at user devices can be exploited to alleviate the burden on base stations. In this paper, we consider joint caching and transmission of scalable video coding (SVC) streaming over wireless D2D networks. We formulate a joint caching and transmission problem using integer linear programming to minimize the average download time for user, and prove that finding the optimal solution is NP-hard. A heuristic solution is proposed based on a two-phase sub-optimization problem focusing on caching and transmission decisions, which is solved by using relaxed linear programming. Simulation results show that the proposed scheme can significantly reduce the average download time in comparison with existing caching strategies.
{"title":"SVC-based caching and transmission strategy in wireless device-to-device networks","authors":"Cheng Zhan, Guo Yao","doi":"10.23919/WIOPT.2018.8362868","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362868","url":null,"abstract":"To address the explosively growing demand for mobile traffic, wireless device-to-device (D2D) networks have been introduced, where caching at user devices can be exploited to alleviate the burden on base stations. In this paper, we consider joint caching and transmission of scalable video coding (SVC) streaming over wireless D2D networks. We formulate a joint caching and transmission problem using integer linear programming to minimize the average download time for user, and prove that finding the optimal solution is NP-hard. A heuristic solution is proposed based on a two-phase sub-optimization problem focusing on caching and transmission decisions, which is solved by using relaxed linear programming. Simulation results show that the proposed scheme can significantly reduce the average download time in comparison with existing caching strategies.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126462771","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}
Pub Date : 2018-05-07DOI: 10.23919/WIOPT.2018.8362810
T. Nguyen, O. Brun, B. Prabhu
We investigate the asymptotic performance of a reward incentive Delay Tolerant Network based on mean field limit. We consider a two-hop network with one source and one destination and N relays. The source is backlogged and sends messages to the destination by forwarding to the relays it meets. For each message, there is a promised reward for the first one who successfully transmits it to the destination. It was shown in a previous work, the optimal policy for the relays is of thresholds type (a relay will accept a message until certain time and drop it after a second threshold). When the second threshold in infinite, we give the mean-field ODE and show that all the messages have the same probability of success. When the second threshold is finite we only give an ODE approximation since the dynamics are not Markovian.
{"title":"Mean-field limit of the fixed-reward incentive mechanism in delay tolerant networks","authors":"T. Nguyen, O. Brun, B. Prabhu","doi":"10.23919/WIOPT.2018.8362810","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362810","url":null,"abstract":"We investigate the asymptotic performance of a reward incentive Delay Tolerant Network based on mean field limit. We consider a two-hop network with one source and one destination and N relays. The source is backlogged and sends messages to the destination by forwarding to the relays it meets. For each message, there is a promised reward for the first one who successfully transmits it to the destination. It was shown in a previous work, the optimal policy for the relays is of thresholds type (a relay will accept a message until certain time and drop it after a second threshold). When the second threshold in infinite, we give the mean-field ODE and show that all the messages have the same probability of success. When the second threshold is finite we only give an ODE approximation since the dynamics are not Markovian.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128128375","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}
Pub Date : 2018-05-07DOI: 10.23919/WIOPT.2018.8362850
Yuanyuan He, Jianbing Ni, Ben Niu, Fenghua Li, Xuemin Shen
Customized-bus Sharing Service (CSS) enables a centralized server to schedule comfortable bus trips for users by ride clustering based on the individual requirements. It has been increasingly popular in crowded metropolises, bringing a lot of convenience and reducing trip costs to users. Ride clustering is essential for the server to determine the stops of a customized bus, but it also leads to the exposure of users' current locations and spatio-temporal patterns. Although privacy-preserving ride clustering can generate optimal bus routes, it depends on frequent interactions between users and the server, so all the users should be always online. In this paper, we propose a privacy-preserving ride clustering scheme for CSS to support off-line users, in which fog computing is introduced to assist the server in generating bus route without the exposure of users' travel plans. Fog servers are able to perform ride clustering interacting with the server, after receiving the preferred pick-up and drop-off positions from users. Thus, the users are unnecessary to be always online. In addition, the Paillier cryptosystem and randomization technique are leveraged to protect the user's privacy without sacrificing the clustering quality. Finally, the proposed privacy-preserving ride clustering scheme is demonstrated to have the advantage of low computational and communication overhead with high security guarantees.
{"title":"Privacy-preserving ride clustering for customized-bus sharing: A fog-assisted approach","authors":"Yuanyuan He, Jianbing Ni, Ben Niu, Fenghua Li, Xuemin Shen","doi":"10.23919/WIOPT.2018.8362850","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362850","url":null,"abstract":"Customized-bus Sharing Service (CSS) enables a centralized server to schedule comfortable bus trips for users by ride clustering based on the individual requirements. It has been increasingly popular in crowded metropolises, bringing a lot of convenience and reducing trip costs to users. Ride clustering is essential for the server to determine the stops of a customized bus, but it also leads to the exposure of users' current locations and spatio-temporal patterns. Although privacy-preserving ride clustering can generate optimal bus routes, it depends on frequent interactions between users and the server, so all the users should be always online. In this paper, we propose a privacy-preserving ride clustering scheme for CSS to support off-line users, in which fog computing is introduced to assist the server in generating bus route without the exposure of users' travel plans. Fog servers are able to perform ride clustering interacting with the server, after receiving the preferred pick-up and drop-off positions from users. Thus, the users are unnecessary to be always online. In addition, the Paillier cryptosystem and randomization technique are leveraged to protect the user's privacy without sacrificing the clustering quality. Finally, the proposed privacy-preserving ride clustering scheme is demonstrated to have the advantage of low computational and communication overhead with high security guarantees.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131024091","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}
Pub Date : 2018-05-07DOI: 10.23919/WIOPT.2018.8362872
Wen Wu, Qinghua Shen, Khalid Aldubaikhy, Nan Cheng, Ning Zhang, Xuemin Shen
The ultra-dense edge networks with mmWave and beamforming are envisioned as a potential solution to satisfy the high rate and capacity requirements in 5G networks. In IEEE 802.11 ad, which is the first beamforming-enabled WLAN standard, all stations (STs) contend for beamforming (BF) training opportunities in associated beamforming training (A-BFT) slots. However, due to limited number of A-BFT slots, BF training suffers from a severe collision issue, especially in dense networks, which results in a low channel utilization in the A-BFT stage. To achieve the maximum channel utilization, it is of significance to allocate A-BFT slots efficiently. Therefore, in this paper, we propose an analytical model to analyze IEEE 802.11 ad medium access control (MAC) protocol in BF training stage. In particular, we analyze the successful transmission probability and channel utilization of IEEE 802.11 ad MAC protocol in the dense network. Based on theoretical analysis, we provide the optimal number of A-BFT slots. In addition, theoretical analysis indicates that the maximum channel utilization in the A-BFT stage is barely e−1 which is the same as that of slotted ALOHA protocol. Simulation results are provided to validate the accuracy of the analytical model and theoretical analysis.
{"title":"Enhance the edge with beamforming: Performance analysis of beamforming-enabled WLAN","authors":"Wen Wu, Qinghua Shen, Khalid Aldubaikhy, Nan Cheng, Ning Zhang, Xuemin Shen","doi":"10.23919/WIOPT.2018.8362872","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362872","url":null,"abstract":"The ultra-dense edge networks with mmWave and beamforming are envisioned as a potential solution to satisfy the high rate and capacity requirements in 5G networks. In IEEE 802.11 ad, which is the first beamforming-enabled WLAN standard, all stations (STs) contend for beamforming (BF) training opportunities in associated beamforming training (A-BFT) slots. However, due to limited number of A-BFT slots, BF training suffers from a severe collision issue, especially in dense networks, which results in a low channel utilization in the A-BFT stage. To achieve the maximum channel utilization, it is of significance to allocate A-BFT slots efficiently. Therefore, in this paper, we propose an analytical model to analyze IEEE 802.11 ad medium access control (MAC) protocol in BF training stage. In particular, we analyze the successful transmission probability and channel utilization of IEEE 802.11 ad MAC protocol in the dense network. Based on theoretical analysis, we provide the optimal number of A-BFT slots. In addition, theoretical analysis indicates that the maximum channel utilization in the A-BFT stage is barely e−1 which is the same as that of slotted ALOHA protocol. Simulation results are provided to validate the accuracy of the analytical model and theoretical analysis.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130875064","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}
Pub Date : 2018-05-07DOI: 10.23919/WIOPT.2018.8362882
Junkai Liu, Ke Luo, Zhi Zhou, Xu Chen
The explosion of resource-hungry mobile applications has posed great challenges on the underlying mobile devices which typically have limited computation resource. In response, device-to-device (D2D) computation offloading is envisioned as a promising approach to the problem by gearing resource-rich devices and resource-poor devices. Towards real-time and efficient computation offloading, in this paper, we proposed a novel edge resource pooling framework called ERP, in which a massive crowd of devices at the network edge exploit D2D collaboration for pooling and sharing computation resource with each other. Specifically, we first formulate the utility maximization problem under both computation and communication constraints as a mixed-integer linear programming (MILP), which is further proven to be NP-hard. To address this challenge, we propose a centralized greedy heuristic based on the classical maximum network flow problem, which schedules the task offloading in a cost-efficient manner. Rigorous theoretical analysis and extensive evaluations demonstrate the effectiveness of the heuristic to some extent.
{"title":"A D2D offloading approach to efficient mobile edge resource pooling","authors":"Junkai Liu, Ke Luo, Zhi Zhou, Xu Chen","doi":"10.23919/WIOPT.2018.8362882","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362882","url":null,"abstract":"The explosion of resource-hungry mobile applications has posed great challenges on the underlying mobile devices which typically have limited computation resource. In response, device-to-device (D2D) computation offloading is envisioned as a promising approach to the problem by gearing resource-rich devices and resource-poor devices. Towards real-time and efficient computation offloading, in this paper, we proposed a novel edge resource pooling framework called ERP, in which a massive crowd of devices at the network edge exploit D2D collaboration for pooling and sharing computation resource with each other. Specifically, we first formulate the utility maximization problem under both computation and communication constraints as a mixed-integer linear programming (MILP), which is further proven to be NP-hard. To address this challenge, we propose a centralized greedy heuristic based on the classical maximum network flow problem, which schedules the task offloading in a cost-efficient manner. Rigorous theoretical analysis and extensive evaluations demonstrate the effectiveness of the heuristic to some extent.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115627098","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}
Pub Date : 2018-05-01DOI: 10.23919/WIOPT.2018.8362874
J. Coon, Mihai-Alin Badiu, Deniz Gündüz
The characterization of topological uncertainty in wireless networks using the formalism of graph entropy has received interest in the spatial networks community. In this paper, we develop lower bounds on the entropy of a wireless network by conditioning on potential network observables. Two approaches are considered: 1) conditioning on subgraphs, and 2) conditioning on node positions. The first approach is shown to yield a relatively tight bound on the network entropy. The second yields a loose bound, in general, but it provides insight into the dependence between node positions (modelled using a homogenous binomial point process in this work) and the network topology.
{"title":"On the conditional entropy of wireless networks","authors":"J. Coon, Mihai-Alin Badiu, Deniz Gündüz","doi":"10.23919/WIOPT.2018.8362874","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362874","url":null,"abstract":"The characterization of topological uncertainty in wireless networks using the formalism of graph entropy has received interest in the spatial networks community. In this paper, we develop lower bounds on the entropy of a wireless network by conditioning on potential network observables. Two approaches are considered: 1) conditioning on subgraphs, and 2) conditioning on node positions. The first approach is shown to yield a relatively tight bound on the network entropy. The second yields a loose bound, in general, but it provides insight into the dependence between node positions (modelled using a homogenous binomial point process in this work) and the network topology.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123027131","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}
Pub Date : 2018-05-01DOI: 10.23919/WIOPT.2018.8362849
Kota Srinivas Reddy, Sharayu Moharir, N. Karamchandani
In this work, we focus on distributed cache systems with non-uniform storage capacity across caches. We compare the performance of our system with the performance of a system with the same cumulative storage distributed evenly across the caches. We characterize the extent to which the performance of the distributed cache system deteriorates due to storage heterogeneity. The key takeaway from this work is that the effects of heterogeneity in the storage capabilities depend heavily on the popularity profile of the contents being cached and delivered. We analytically show that compared to the case where contents popularity is comparable across contents, lopsided popularity profiles are more tolerant to heterogeneity in storage capabilities. We validate our theoretical results via simulations.
{"title":"Effects of storage heterogeneity in distributed cache systems","authors":"Kota Srinivas Reddy, Sharayu Moharir, N. Karamchandani","doi":"10.23919/WIOPT.2018.8362849","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362849","url":null,"abstract":"In this work, we focus on distributed cache systems with non-uniform storage capacity across caches. We compare the performance of our system with the performance of a system with the same cumulative storage distributed evenly across the caches. We characterize the extent to which the performance of the distributed cache system deteriorates due to storage heterogeneity. The key takeaway from this work is that the effects of heterogeneity in the storage capabilities depend heavily on the popularity profile of the contents being cached and delivered. We analytically show that compared to the case where contents popularity is comparable across contents, lopsided popularity profiles are more tolerant to heterogeneity in storage capabilities. We validate our theoretical results via simulations.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124044575","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}
Pub Date : 2018-05-01DOI: 10.23919/WIOPT.2018.8362870
Jeonghun Park, N. Lee, R. Heath
We characterize the ergodic spectral efficiency of a cooperative type of K-tier heterogeneous networks (HetNets) with limited feedback. Specifically, a base station (BS) coordination set is formed by using dynamic clustering across the tiers, wherein the intra-cluster interference is mitigated by using multi-cell zero-forcing based on limited feedback. Modeling the network based on stochastic geometry, we derive analytical expressions for the ergodic spectral efficiency as a function of the system parameters. Leveraging the obtained expression, we formulate a feedback allocation problem and obtain a solution to improve the ergodic spectral efficiency. Simulations show the spectral efficiency improvement by using the proposed feedback allocation. One major finding in the obtained solution is that allocating more feedback to stronger intra-cluster BSs is efficient.
{"title":"Multi-cell coordination in K-tier heterogeneous downlink cellular networks: Dynamic clustering and feedback allocation","authors":"Jeonghun Park, N. Lee, R. Heath","doi":"10.23919/WIOPT.2018.8362870","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362870","url":null,"abstract":"We characterize the ergodic spectral efficiency of a cooperative type of K-tier heterogeneous networks (HetNets) with limited feedback. Specifically, a base station (BS) coordination set is formed by using dynamic clustering across the tiers, wherein the intra-cluster interference is mitigated by using multi-cell zero-forcing based on limited feedback. Modeling the network based on stochastic geometry, we derive analytical expressions for the ergodic spectral efficiency as a function of the system parameters. Leveraging the obtained expression, we formulate a feedback allocation problem and obtain a solution to improve the ergodic spectral efficiency. Simulations show the spectral efficiency improvement by using the proposed feedback allocation. One major finding in the obtained solution is that allocating more feedback to stronger intra-cluster BSs is efficient.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126545844","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：