Pub Date : 2016-05-22DOI: 10.1109/ICC.2016.7511428
D. Ohmann, A. Awada, I. Viering, M. Simsek, G. Fettweis
Multi-connectivity is a promising concept for addressing challenging requirements in next generation wireless networks. We put forward a modeling framework for analyzing signal-to-interference-and-noise ratio (SINR) distributions in inter-frequency multi-connectivity scenarios. The most important features are a best server association based on random shadowing, multiple path loss models, and intra-/inter-frequency shadowing cross-correlation. Furthermore, we consider diverse antenna types, such as sectorized antennas and antenna arrays with beamforming, to accurately model the distinct properties of conventional as well as upcoming millimeter wave carrier frequencies. In the analysis, we focus on the lower tail of the SINR distributions in order to explore the availability performance. The modeling results, which are corroborated by simulations, show that certain combinations of carrier frequencies can significantly improve the availability as well as the throughput performance compared to single-frequency usage.
{"title":"Achieving high availability in wireless networks by inter-frequency multi-connectivity","authors":"D. Ohmann, A. Awada, I. Viering, M. Simsek, G. Fettweis","doi":"10.1109/ICC.2016.7511428","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511428","url":null,"abstract":"Multi-connectivity is a promising concept for addressing challenging requirements in next generation wireless networks. We put forward a modeling framework for analyzing signal-to-interference-and-noise ratio (SINR) distributions in inter-frequency multi-connectivity scenarios. The most important features are a best server association based on random shadowing, multiple path loss models, and intra-/inter-frequency shadowing cross-correlation. Furthermore, we consider diverse antenna types, such as sectorized antennas and antenna arrays with beamforming, to accurately model the distinct properties of conventional as well as upcoming millimeter wave carrier frequencies. In the analysis, we focus on the lower tail of the SINR distributions in order to explore the availability performance. The modeling results, which are corroborated by simulations, show that certain combinations of carrier frequencies can significantly improve the availability as well as the throughput performance compared to single-frequency usage.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129905265","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510932
T. Raddo, A. Sanches, I. Monroy, B. Borges
In this paper, the packet throughput performance of multiservice, multirate optical code-division multiple-access (OCDMA) networks is addressed based on two distinct multirate techniques, namely multilength code and multicode. A new analytical formalism to evaluate the packet throughput performance of both multirate techniques is proposed. The proposed formalism can be successfully applied for performance evaluation of any arbitrary number of user classes in the system as well as for both 1-D and 2-D codes. The bit error rate (BER) and packet correct probability expressions are derived considering the multiple-access interference (MAI) as binomially distributed. The packet throughput expression, by its turn, is derived considering a Poisson distribution for the composite packet arrivals. Numerical results show that the multicode technique is a good candidate for future multiservice, multirate OCDMA implementations, where higher rates and diversified patterns of data traffic will be major network requirements.
{"title":"Packet throughput performance of multiservice, multirate OCDMA in elastic networks","authors":"T. Raddo, A. Sanches, I. Monroy, B. Borges","doi":"10.1109/ICC.2016.7510932","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510932","url":null,"abstract":"In this paper, the packet throughput performance of multiservice, multirate optical code-division multiple-access (OCDMA) networks is addressed based on two distinct multirate techniques, namely multilength code and multicode. A new analytical formalism to evaluate the packet throughput performance of both multirate techniques is proposed. The proposed formalism can be successfully applied for performance evaluation of any arbitrary number of user classes in the system as well as for both 1-D and 2-D codes. The bit error rate (BER) and packet correct probability expressions are derived considering the multiple-access interference (MAI) as binomially distributed. The packet throughput expression, by its turn, is derived considering a Poisson distribution for the composite packet arrivals. Numerical results show that the multicode technique is a good candidate for future multiservice, multirate OCDMA implementations, where higher rates and diversified patterns of data traffic will be major network requirements.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130484650","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511164
M. Mohamad, R. Nilsson, Jaap van de Beek
The N-continuous precoder for the suppression of OOB emission in OFDM systems that minimizes the EVM is introduced. We show that the minimum in-band interference due to the introduced precoding approach is 3 dB less than the inband interference of existing N-continuous precoders. Moreover, we introduce a novel practical block precoder that approaches the performance of the suggested optimal precoder. We analyze the spectrum of the OFDM signal after block precoding, the inband interference due to block precoding and the effect of block precoding on the BER. The price to pay for block precoding is the computational complexity that grows linearly with the block size.
{"title":"Minimum-EVM N-continuous OFDM","authors":"M. Mohamad, R. Nilsson, Jaap van de Beek","doi":"10.1109/ICC.2016.7511164","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511164","url":null,"abstract":"The N-continuous precoder for the suppression of OOB emission in OFDM systems that minimizes the EVM is introduced. We show that the minimum in-band interference due to the introduced precoding approach is 3 dB less than the inband interference of existing N-continuous precoders. Moreover, we introduce a novel practical block precoder that approaches the performance of the suggested optimal precoder. We analyze the spectrum of the OFDM signal after block precoding, the inband interference due to block precoding and the effect of block precoding on the BER. The price to pay for block precoding is the computational complexity that grows linearly with the block size.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130547518","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510996
Huang Chen, Shizhong Xu, Xiong Wang, Yangming Zhao, Ke Li, Yang Wang, Wei Wang, Lemin Li
As Network Function Virtualization (NFV) becomes reality and cloud computing offers a scalable pay-as-you-go charging model, more network operators would like to outsource their Service Function Chains (SFC) to the public clouds in order to reduce the operational cost. However, how to minimize the operational cost with Quality of Service (QoS) guarantee when outsourcing SFC is still an open problem. In this paper, we are to study this problem when there are large number of candidate cloud providers with diverse pricing schemes of network functions. In addition, extra delay is introduced as the result of outsourcing SFCs. Firstly, we formulate this problem as an Integer Linear Programming (ILP) model. Then we design an efficient heuristic algorithm named QoS-Guaranteed SFC Outsourcing algorithm (QGSO) based on Hidden Markov Model (HMM). The extensive simulations show that QGSO saves up to 75.8% cost compared with that of deploying network functions in local network. QGSO also achieves up to 42.6% cost savings compared with the result of first-fit based optimization algorithm.
{"title":"Towards optimal outsourcing of service function chain across multiple clouds","authors":"Huang Chen, Shizhong Xu, Xiong Wang, Yangming Zhao, Ke Li, Yang Wang, Wei Wang, Lemin Li","doi":"10.1109/ICC.2016.7510996","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510996","url":null,"abstract":"As Network Function Virtualization (NFV) becomes reality and cloud computing offers a scalable pay-as-you-go charging model, more network operators would like to outsource their Service Function Chains (SFC) to the public clouds in order to reduce the operational cost. However, how to minimize the operational cost with Quality of Service (QoS) guarantee when outsourcing SFC is still an open problem. In this paper, we are to study this problem when there are large number of candidate cloud providers with diverse pricing schemes of network functions. In addition, extra delay is introduced as the result of outsourcing SFCs. Firstly, we formulate this problem as an Integer Linear Programming (ILP) model. Then we design an efficient heuristic algorithm named QoS-Guaranteed SFC Outsourcing algorithm (QGSO) based on Hidden Markov Model (HMM). The extensive simulations show that QGSO saves up to 75.8% cost compared with that of deploying network functions in local network. QGSO also achieves up to 42.6% cost savings compared with the result of first-fit based optimization algorithm.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126704582","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511050
Eduardo Cerritos, F. Lin, David de la Bastida
International standards such as ETSI SmartM2M and oneM2M have defined a client-server model as the common service architecture for IoT/M2M systems. Moreover, the IoT/M2M servers are normally provisioned in a cloud environment. This paper proposes a highly scalable architecture for all such cloud-based IoT/M2M systems. The uniqueness of our architecture is the incorporation of a Master Node in the cloud that is aware of system resources and incoming traffic so that it not only can dynamically decide load balancing policies but also proactively react to scalability needs. When compared with other cloud implementations without such a Master Node, our proposed system achieves faster response time and lower energy consumption.
ETSI SmartM2M和oneM2M等国际标准已经将客户端-服务器模型定义为物联网/M2M系统的通用服务架构。此外，IoT/M2M服务器通常在云环境中配置。本文为所有此类基于云的IoT/M2M系统提出了一种高度可扩展的架构。我们架构的独特之处在于在云中集成了一个主节点，它知道系统资源和传入流量，因此它不仅可以动态决定负载平衡策略，还可以主动响应可伸缩性需求。与其他没有主节点的云实现相比，我们提出的系统实现了更快的响应时间和更低的能耗。
{"title":"High scalability for cloud-based IoT/M2M systems","authors":"Eduardo Cerritos, F. Lin, David de la Bastida","doi":"10.1109/ICC.2016.7511050","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511050","url":null,"abstract":"International standards such as ETSI SmartM2M and oneM2M have defined a client-server model as the common service architecture for IoT/M2M systems. Moreover, the IoT/M2M servers are normally provisioned in a cloud environment. This paper proposes a highly scalable architecture for all such cloud-based IoT/M2M systems. The uniqueness of our architecture is the incorporation of a Master Node in the cloud that is aware of system resources and incoming traffic so that it not only can dynamically decide load balancing policies but also proactively react to scalability needs. When compared with other cloud implementations without such a Master Node, our proposed system achieves faster response time and lower energy consumption.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127008043","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}
How to enhance the communication efficiency and quality on vehicular networks is one critical important issue. While with the larger and larger scale of vehicular networks in dense cities, the real-world datasets show that the vehicular networks essentially belong to the complex network model. Meanwhile, the extensive research on complex networks has shown that the complex network theory can both provide an accurate network illustration model and further make great contributions to the network design, optimization and management. In this paper, we start with analyzing characteristics of a taxi GPS dataset and then establishing the vehicular-to-infrastructure, vehicle-to-vehicle and the hybrid communication model, respectively. Moreover, we propose a clustering algorithm for station selection, a traffic allocation optimization model and an information source selection model based on the communication performances and complex network theory.
{"title":"Complex network theoretical analysis on information dissemination over vehicular networks","authors":"Jingjing Wang, Chunxiao Jiang, Longxiang Gao, Shui Yu, Zhu Han, Yong Ren","doi":"10.1109/ICC.2016.7511133","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511133","url":null,"abstract":"How to enhance the communication efficiency and quality on vehicular networks is one critical important issue. While with the larger and larger scale of vehicular networks in dense cities, the real-world datasets show that the vehicular networks essentially belong to the complex network model. Meanwhile, the extensive research on complex networks has shown that the complex network theory can both provide an accurate network illustration model and further make great contributions to the network design, optimization and management. In this paper, we start with analyzing characteristics of a taxi GPS dataset and then establishing the vehicular-to-infrastructure, vehicle-to-vehicle and the hybrid communication model, respectively. Moreover, we propose a clustering algorithm for station selection, a traffic allocation optimization model and an information source selection model based on the communication performances and complex network theory.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129123709","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510989
M. Cheng, Yizong Ling, W. Wu
This paper addresses detecting in-band wormholes in wireless ad hoc networks. The detection scheme requires collecting the end-to-end delay of packets at the receiver and then applying a sequential change point detection algorithm to detect abrupt changes in the delay time series. A new change point detection algorithm, named SW-CLT, is proposed. The algorithm is based on the Central Limit Theorem (CLT) and does not involve using a preset detecting threshold. The algorithm is compared with the non-parametric cumulative sum (NP-CUSUM) because the non-parametric version is believed to be more robust to highly dynamic data than the parametric version. SW-CLT has the ability to adjust its detection threshold with the variance of the data, and therefore is more robust than NP-CUSUM, which uses a preset threshold. Simulation results from ns3 verified the advantage of SW-CLT over NP-CUSUM in all simulated scenarios.
{"title":"In-band wormhole detection in wireless ad hoc networks using change point detection method","authors":"M. Cheng, Yizong Ling, W. Wu","doi":"10.1109/ICC.2016.7510989","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510989","url":null,"abstract":"This paper addresses detecting in-band wormholes in wireless ad hoc networks. The detection scheme requires collecting the end-to-end delay of packets at the receiver and then applying a sequential change point detection algorithm to detect abrupt changes in the delay time series. A new change point detection algorithm, named SW-CLT, is proposed. The algorithm is based on the Central Limit Theorem (CLT) and does not involve using a preset detecting threshold. The algorithm is compared with the non-parametric cumulative sum (NP-CUSUM) because the non-parametric version is believed to be more robust to highly dynamic data than the parametric version. SW-CLT has the ability to adjust its detection threshold with the variance of the data, and therefore is more robust than NP-CUSUM, which uses a preset threshold. Simulation results from ns3 verified the advantage of SW-CLT over NP-CUSUM in all simulated scenarios.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123225708","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510831
Chenhui Hu, Ronghui Ju, Yusong Shen, Pan Zhou, Quanzheng Li
Modern e-health systems have undergone rapid development thanks to the advances in communications, computing and machine learning technology. Especially, deep learning has great superiority in image analysis and disease prediction. In this paper, we use Alzheimer's Disease (AD) as an example to show advantages of deep learning in diagnosing brain diseases and providing clinical decision support. Firstly, we convert raw functional magnetic resonance imaging (fMRI) to a matrix to represent activity of 90 brain regions. Secondly, to represent the functional connectivity between different brain regions, a correlation matrix is obtained by calculating the correlation between each pair of brain regions. In the next, a targeted autoencoder network is built to classify the correlation matrix, which is sensitive to AD. Finally, the experiment results show that our proposed method for AD prediction achieves much better effects than traditional means. It finds the correlations between different brain regions efficiently, provides strong reference for AD prediction. Compared to Support Vector Machine (SVM), about 25% improvement is gained in prediction accuracy. The e-health field becomes more complete and effective owing to that. Our work helps predict AD at an early stage and take measures to slow down or even prevent the onset of it.
{"title":"Clinical decision support for Alzheimer's disease based on deep learning and brain network","authors":"Chenhui Hu, Ronghui Ju, Yusong Shen, Pan Zhou, Quanzheng Li","doi":"10.1109/ICC.2016.7510831","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510831","url":null,"abstract":"Modern e-health systems have undergone rapid development thanks to the advances in communications, computing and machine learning technology. Especially, deep learning has great superiority in image analysis and disease prediction. In this paper, we use Alzheimer's Disease (AD) as an example to show advantages of deep learning in diagnosing brain diseases and providing clinical decision support. Firstly, we convert raw functional magnetic resonance imaging (fMRI) to a matrix to represent activity of 90 brain regions. Secondly, to represent the functional connectivity between different brain regions, a correlation matrix is obtained by calculating the correlation between each pair of brain regions. In the next, a targeted autoencoder network is built to classify the correlation matrix, which is sensitive to AD. Finally, the experiment results show that our proposed method for AD prediction achieves much better effects than traditional means. It finds the correlations between different brain regions efficiently, provides strong reference for AD prediction. Compared to Support Vector Machine (SVM), about 25% improvement is gained in prediction accuracy. The e-health field becomes more complete and effective owing to that. Our work helps predict AD at an early stage and take measures to slow down or even prevent the onset of it.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123516924","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511386
Li Yang, Kun Wang, Chenhan Xu, Chunsheng Zhu, Yanfei Sun
The advances of network technology and mobile communication technology are making eHealth possible. In eHealth systems, physiological data and relevant context-aware data are acquired continuously and in real time. At the same time, such large-scale data results in huge challenges in the aspect of real-time big data processing since eHealth data appears in the form of data stream. Therefore, we propose a novel incremental learning algorithm, namely α-SVMSGD, which improves the SVMSGD (Support Vector Machine-Stochastic Gradient Descent) algorithm by updating the training data with the continuous data stream. Besides, this α-SVMSGD may handle the problem that original SVMSGD cannot further mine the useful information in unclassified data. In α-SVMSGD, the process of training data updating is completed by introducing the concept of forgetting mechanism, in which the forgetting factor α is introduced to weed out useless training data. α-SVMSGD is applied into ambient assisted living communications, and further incorporated into the data filtering layer of a local data processing architecture (LDPA) to reduce data redundancy. Simulation results confirm that the proposed algorithm is a promising data redundancy solution for classification without loss of accuracy in the case of real-time data stream.
{"title":"An incremental learning classification algorithm based on forgetting factor for eHealth networks","authors":"Li Yang, Kun Wang, Chenhan Xu, Chunsheng Zhu, Yanfei Sun","doi":"10.1109/ICC.2016.7511386","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511386","url":null,"abstract":"The advances of network technology and mobile communication technology are making eHealth possible. In eHealth systems, physiological data and relevant context-aware data are acquired continuously and in real time. At the same time, such large-scale data results in huge challenges in the aspect of real-time big data processing since eHealth data appears in the form of data stream. Therefore, we propose a novel incremental learning algorithm, namely α-SVMSGD, which improves the SVMSGD (Support Vector Machine-Stochastic Gradient Descent) algorithm by updating the training data with the continuous data stream. Besides, this α-SVMSGD may handle the problem that original SVMSGD cannot further mine the useful information in unclassified data. In α-SVMSGD, the process of training data updating is completed by introducing the concept of forgetting mechanism, in which the forgetting factor α is introduced to weed out useless training data. α-SVMSGD is applied into ambient assisted living communications, and further incorporated into the data filtering layer of a local data processing architecture (LDPA) to reduce data redundancy. Simulation results confirm that the proposed algorithm is a promising data redundancy solution for classification without loss of accuracy in the case of real-time data stream.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"176 1 Pt 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123665428","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510696
A. Afzal, Syed Ali Raza Zaidi, D. McLernon, M. Ghogho
In this paper, we develop a comprehensive analytical framework for cellular networks that are enhanced with coordinated device-to-device (D2D) communication, where the D2D devices are equipped with content caching capabilities. The base station (BS) coordinates the D2D communication by establishing a D2D link between the requesting user and the nearest D2D helper within the same cell if the latter contains the requested content, otherwise, the BS serves the user itself. The motivation behind restricting D2D pairs within a macro cell is to make coordinated D2D communication realizable as the BS can keep track of the content of the devices without the increased overhead of inter-BS coordination. This approach is similar to LTE direct, where D2D pairing is managed by the BS. We model the locations of BS and D2D helpers using a homogeneous Poisson point process (HPPP). The distribution of the distance between the tagged user and its neighboring D2D helper within the cell is derived using disk approximation for the Voronoi cell, which is shown to be reasonably accurate. We fully characterize the cellular and D2D coverage and the link spectral efficiency of such a network. Our results reveal that cache enabled D2D communication becomes more effective as the requesting user moves away from the BS and high performance gains can be achieved compared to conventional cellular networks, especially when the popularity distribution is skewed and most popular files are requested.
{"title":"On the analysis of cellular networks with caching and coordinated device-to-device communication","authors":"A. Afzal, Syed Ali Raza Zaidi, D. McLernon, M. Ghogho","doi":"10.1109/ICC.2016.7510696","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510696","url":null,"abstract":"In this paper, we develop a comprehensive analytical framework for cellular networks that are enhanced with coordinated device-to-device (D2D) communication, where the D2D devices are equipped with content caching capabilities. The base station (BS) coordinates the D2D communication by establishing a D2D link between the requesting user and the nearest D2D helper within the same cell if the latter contains the requested content, otherwise, the BS serves the user itself. The motivation behind restricting D2D pairs within a macro cell is to make coordinated D2D communication realizable as the BS can keep track of the content of the devices without the increased overhead of inter-BS coordination. This approach is similar to LTE direct, where D2D pairing is managed by the BS. We model the locations of BS and D2D helpers using a homogeneous Poisson point process (HPPP). The distribution of the distance between the tagged user and its neighboring D2D helper within the cell is derived using disk approximation for the Voronoi cell, which is shown to be reasonably accurate. We fully characterize the cellular and D2D coverage and the link spectral efficiency of such a network. Our results reveal that cache enabled D2D communication becomes more effective as the requesting user moves away from the BS and high performance gains can be achieved compared to conventional cellular networks, especially when the popularity distribution is skewed and most popular files are requested.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116187536","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
扫码关注我们
求助内容：
应助结果提醒方式：