Directional transmission and reception using multiple-input multiple-output (MIMO) technologies allows spatial multiplexing in a wireless network. However, multipath propagations in radio channels usually result in the angular spread of signal power, which causes interference among the sectors. Moreover, the random movement of the nodes leads to the variation of the interference. An accurate and mathematically tractable packet-level channel model is a key issue to evaluate the capacity and performance of the spatial multiplexing networks. In this paper, we have considered an indoor mobile ad hoc network where the sink node is equipped with an antenna array for beamforming. First, based on the angular power spectral density (APSD) of the indoor channels obtained by our field measurements, the interference among two nodes is evaluated. Second, by assuming two-dimensional random walk of the network nodes, a finite state Markov chain (FSMC) model is proposed to present the random variation of the signal-to-interference ratio (SIR) of the directional links from the nodes to the sink. The closed-form expressions of the state transition probabilities and steady state distributions are derived. Simulation results are also presented to demonstrate the channel evolution process. The proposed packet-level channel model can be conveniently incorporated into analytical frameworks and fast simulations of upper-layer network protocols.
{"title":"A packet-level model for MIMO spatial multiplexing channels in indoor environments","authors":"Ruonan Zhang, Jianping Zhao, Zhimeng Zhong, Heng Qin","doi":"10.1109/ICCW.2015.7247238","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247238","url":null,"abstract":"Directional transmission and reception using multiple-input multiple-output (MIMO) technologies allows spatial multiplexing in a wireless network. However, multipath propagations in radio channels usually result in the angular spread of signal power, which causes interference among the sectors. Moreover, the random movement of the nodes leads to the variation of the interference. An accurate and mathematically tractable packet-level channel model is a key issue to evaluate the capacity and performance of the spatial multiplexing networks. In this paper, we have considered an indoor mobile ad hoc network where the sink node is equipped with an antenna array for beamforming. First, based on the angular power spectral density (APSD) of the indoor channels obtained by our field measurements, the interference among two nodes is evaluated. Second, by assuming two-dimensional random walk of the network nodes, a finite state Markov chain (FSMC) model is proposed to present the random variation of the signal-to-interference ratio (SIR) of the directional links from the nodes to the sink. The closed-form expressions of the state transition probabilities and steady state distributions are derived. Simulation results are also presented to demonstrate the channel evolution process. The proposed packet-level channel model can be conveniently incorporated into analytical frameworks and fast simulations of upper-layer network protocols.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"48 1","pages":"549-554"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76231402","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247429
Emad Danish, W. Fernando, M. Alreshoodi, J. Woods
In the video streaming arena, and especially within the wireless transmission domain, measuring users' quality of experience (QoE) has become a pressing issue for it offers several benefits to both the service provider and the end user. However, available measurement techniques that adopt a full reference model (FR) are impractical in real-time transmission scenarios since they require the original video sequence available at the receiver's end. Hence, no-reference (NR) models fill this gap by providing less accurate measurement but sufficiently reliable for real-time video streaming. In this paper, we propose and evaluate a hybrid no-reference prediction model for the perceptual quality of video in the wireless domain. The model is based on fuzzy inference systems (FIS), and exploits several key parameters from both the application layer and physical layer. Hence the model is realized by means of mapping quality of service to quality of experience (QoS/QoE). The model is evaluated in contrast to random neural networks (RNN), and simulation results show considerable prediction accuracy of the model with a correlation coefficient of 92.17% and 0.1098 root mean square error.
{"title":"A hybrid prediction model for video quality by QoS/QoE mapping in wireless streaming","authors":"Emad Danish, W. Fernando, M. Alreshoodi, J. Woods","doi":"10.1109/ICCW.2015.7247429","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247429","url":null,"abstract":"In the video streaming arena, and especially within the wireless transmission domain, measuring users' quality of experience (QoE) has become a pressing issue for it offers several benefits to both the service provider and the end user. However, available measurement techniques that adopt a full reference model (FR) are impractical in real-time transmission scenarios since they require the original video sequence available at the receiver's end. Hence, no-reference (NR) models fill this gap by providing less accurate measurement but sufficiently reliable for real-time video streaming. In this paper, we propose and evaluate a hybrid no-reference prediction model for the perceptual quality of video in the wireless domain. The model is based on fuzzy inference systems (FIS), and exploits several key parameters from both the application layer and physical layer. Hence the model is realized by means of mapping quality of service to quality of experience (QoS/QoE). The model is evaluated in contrast to random neural networks (RNN), and simulation results show considerable prediction accuracy of the model with a correlation coefficient of 92.17% and 0.1098 root mean square error.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"129 1","pages":"1723-1728"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76275250","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247257
Derya Malak, M. Al-Shalash
Content distribution using direct device-to-device (D2D) communication is a promising approach for optimizing the utilization of air-interface resources in 5G network. To achieve the best utilization of network resources, the network should bias the distribution of cached content. The optimal caching distribution depends on the content demand distribution. In this paper, we model the locations of transmitting and receiving devices by a homogeneous Poisson Point Process (PPP), and use results from stochastic geometry to derive the probability of successful content delivery in the presence of D2D interference and noise. We formulate an optimization problem to maximize the total probability of content delivery, assuming user demands are modeled by a Zipf distribution. We also develop strategies to optimize content caching, and bound the total coverage probability for multiple file caching scenarios.
{"title":"Device-to-device content distribution: Optimal caching strategies and performance bounds","authors":"Derya Malak, M. Al-Shalash","doi":"10.1109/ICCW.2015.7247257","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247257","url":null,"abstract":"Content distribution using direct device-to-device (D2D) communication is a promising approach for optimizing the utilization of air-interface resources in 5G network. To achieve the best utilization of network resources, the network should bias the distribution of cached content. The optimal caching distribution depends on the content demand distribution. In this paper, we model the locations of transmitting and receiving devices by a homogeneous Poisson Point Process (PPP), and use results from stochastic geometry to derive the probability of successful content delivery in the presence of D2D interference and noise. We formulate an optimization problem to maximize the total probability of content delivery, assuming user demands are modeled by a Zipf distribution. We also develop strategies to optimize content caching, and bound the total coverage probability for multiple file caching scenarios.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"113 1","pages":"664-669"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76350622","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247367
Athanasios Stavridis, H. Haas
In this paper, the Bit Error Rate (BER) performance of three major space modulation techniques in a Multiple-Input Multiple-Output (MIMO) Visible Light Communication (VLC) system is studied. The considered space modulation techniques are Optical Spatial Modulation (OSM); Optical Generalized Spatial Modulation (OGeSM); and Optical Multi-Stream Spatial Modulation (OMS-SM). The space modulation techniques are evaluated against two benchmark systems: Optical Spatial MultipleXing (OSMX) and Optical Repetition Coding (ORC). The performance assessment, for both the space modulation schemes and the benchmark systems, is undertaken using simulation and analytical results. For the considered system setup, it is concluded that, in relative low Signal-to-Noise Ratio (SNR), OSM offers the best performance. Whereas, in relative high SNR and for high spectral efficiency, OMS-SM is the most efficient scheme in terms of BER.
{"title":"Performance evaluation of space modulation techniques in VLC systems","authors":"Athanasios Stavridis, H. Haas","doi":"10.1109/ICCW.2015.7247367","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247367","url":null,"abstract":"In this paper, the Bit Error Rate (BER) performance of three major space modulation techniques in a Multiple-Input Multiple-Output (MIMO) Visible Light Communication (VLC) system is studied. The considered space modulation techniques are Optical Spatial Modulation (OSM); Optical Generalized Spatial Modulation (OGeSM); and Optical Multi-Stream Spatial Modulation (OMS-SM). The space modulation techniques are evaluated against two benchmark systems: Optical Spatial MultipleXing (OSMX) and Optical Repetition Coding (ORC). The performance assessment, for both the space modulation schemes and the benchmark systems, is undertaken using simulation and analytical results. For the considered system setup, it is concluded that, in relative low Signal-to-Noise Ratio (SNR), OSM offers the best performance. Whereas, in relative high SNR and for high spectral efficiency, OMS-SM is the most efficient scheme in terms of BER.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"17 2 1","pages":"1356-1361"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79804819","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247445
Jian Liu, Kun Huang, Hong Rong, Huimei Wang, Ming Xian
Cloud computing is a promising computing paradigm which has drawn extensive attention from both academia and industry. Since that the cloud is very likely to be outside of the trust domain of the users, serious concerns over the confidentiality of the outsourced data are arising. Traditional encryption methods guarantee data confidentiality, but also limit the functionality of the cloud storage as few operations are supported over encrypted data. The main technique contribution of this paper is that we present an efficient data forwarding scheme for the erasure-coded and encrypted cloud, which enforces the cloud not only provide data reliability and confidentiality, but also support the functionality that the encrypted data can be forwarded to another user without being retrieved back. Specifically, we design an all-or-nothing transform based encryption and a variant of ElGamal-based proxy re-encryption algorithms, blending them with the Reed-Solomon erasure code, our scheme is quite more efficient compared with previous studies and only needs to update partial data blocks instead of the whole file for data forwarding. In addition, our scheme also satisfies another practical property that the original data owner can no longer decrypt or forward the re-encrypted data again to other users after a complete data forwarding, which is termed to be “original inaccessibility” in our study. Analysis shows that our scheme is secure and satisfactory. Finally we theoretically and experimentally evaluate the performance of our scheme and the results indicate that our scheme is efficient in the procedure of file dispersal, forward and retrieval.
{"title":"Efficient and secure data forwarding for erasure-code-based cloud storage","authors":"Jian Liu, Kun Huang, Hong Rong, Huimei Wang, Ming Xian","doi":"10.1109/ICCW.2015.7247445","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247445","url":null,"abstract":"Cloud computing is a promising computing paradigm which has drawn extensive attention from both academia and industry. Since that the cloud is very likely to be outside of the trust domain of the users, serious concerns over the confidentiality of the outsourced data are arising. Traditional encryption methods guarantee data confidentiality, but also limit the functionality of the cloud storage as few operations are supported over encrypted data. The main technique contribution of this paper is that we present an efficient data forwarding scheme for the erasure-coded and encrypted cloud, which enforces the cloud not only provide data reliability and confidentiality, but also support the functionality that the encrypted data can be forwarded to another user without being retrieved back. Specifically, we design an all-or-nothing transform based encryption and a variant of ElGamal-based proxy re-encryption algorithms, blending them with the Reed-Solomon erasure code, our scheme is quite more efficient compared with previous studies and only needs to update partial data blocks instead of the whole file for data forwarding. In addition, our scheme also satisfies another practical property that the original data owner can no longer decrypt or forward the re-encrypted data again to other users after a complete data forwarding, which is termed to be “original inaccessibility” in our study. Analysis shows that our scheme is secure and satisfactory. Finally we theoretically and experimentally evaluate the performance of our scheme and the results indicate that our scheme is efficient in the procedure of file dispersal, forward and retrieval.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"460 1","pages":"1820-1826"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77728970","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}
In this paper, a sectorized multi-cell massive multiple-input multiple-output (MIMO) system is considered with a spatially correlated channel model. Since sum-throughput per cell is an important index for evaluating a multi-cell system, we derive the ergodic achievable uplink sum-throughput per cell of the sectorized system and give the deterministic approximation of it based on the large random matrix theory. Numerical results indicate that sum-throughput per cell can be greatly increased compared to the conventional multi-cell massive MIMO system, which validates the effectiveness of the sectorized system. Moreover, it can be seen that the deterministic approximation is consistent with the result of Monte-Carlo simulation.
{"title":"Uplink sum-throughput evaluation of sectorized multi-cell massive MIMO system","authors":"Jiahui Li, Qiang He, Limin Xiao, Xibin Xu, Shidong Zhou","doi":"10.1109/ICCW.2015.7247331","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247331","url":null,"abstract":"In this paper, a sectorized multi-cell massive multiple-input multiple-output (MIMO) system is considered with a spatially correlated channel model. Since sum-throughput per cell is an important index for evaluating a multi-cell system, we derive the ergodic achievable uplink sum-throughput per cell of the sectorized system and give the deterministic approximation of it based on the large random matrix theory. Numerical results indicate that sum-throughput per cell can be greatly increased compared to the conventional multi-cell massive MIMO system, which validates the effectiveness of the sectorized system. Moreover, it can be seen that the deterministic approximation is consistent with the result of Monte-Carlo simulation.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"49 1","pages":"1143-1148"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77707130","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247496
T. Hynek, David Halls, J. Sýkora
A wireless relay node employing Wireless Physical Layer Network Coding (WPLNC) must use a specific mapping in order to combine incoming signals. This mapping, however, cannot be selected arbitrarily. Together with the signals from the other network relays, it has to allow the destinations to be able to recover the source data from the available observations. Moreover the mapping should optimize a local relay utility function. This task can be easily solved in centralized networks. In decentralized ones, such as sensor or smart metering networks, a mapping assignment should be derived from mutual node communication, cooperation and/or signaling. In this paper we focus on the practical hardware implementation of such a distributed algorithm called a Distributed Learning Algorithm (DLA). In a two source, two relay and two destination network scenario we have implemented a non-cooperative game-based process that selects the WPLNC mapping of each individual relay node guaranteeing invertibility of WPLNC at the destinations as well as optimizing the relay's utility function, namely the output modulation cardinality. The implementation testbed is based on Software Defined Radio (SDR) modules and it is used to verify the algorithm properties in real-world conditions.
{"title":"Hardware implementation of Distributed Learning Algorithm for mapping selection for Wireless Physical Layer Network Coding","authors":"T. Hynek, David Halls, J. Sýkora","doi":"10.1109/ICCW.2015.7247496","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247496","url":null,"abstract":"A wireless relay node employing Wireless Physical Layer Network Coding (WPLNC) must use a specific mapping in order to combine incoming signals. This mapping, however, cannot be selected arbitrarily. Together with the signals from the other network relays, it has to allow the destinations to be able to recover the source data from the available observations. Moreover the mapping should optimize a local relay utility function. This task can be easily solved in centralized networks. In decentralized ones, such as sensor or smart metering networks, a mapping assignment should be derived from mutual node communication, cooperation and/or signaling. In this paper we focus on the practical hardware implementation of such a distributed algorithm called a Distributed Learning Algorithm (DLA). In a two source, two relay and two destination network scenario we have implemented a non-cooperative game-based process that selects the WPLNC mapping of each individual relay node guaranteeing invertibility of WPLNC at the destinations as well as optimizing the relay's utility function, namely the output modulation cardinality. The implementation testbed is based on Software Defined Radio (SDR) modules and it is used to verify the algorithm properties in real-world conditions.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"29 1","pages":"2127-2132"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80067704","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247565
Ö. Bulakci, Zhe Ren, Chan Zhou, J. Eichinger, P. Fertl, D. G. Serrano, S. Stańczak
Mobile networks are experiencing the avalanche of data traffic, which is coupled with the billions of wirelessly connected data-intensive devices using diverse multimedia services and applications. Prospective studies suggest that traffic volume would increase a thousand-fold over the next decade. Furthermore, the users expect the utmost in quality with seamless connectivity to the broadband access. On this basis, moving networks emerge as a promising enhancement for fifth generation (5G) systems to enable flexible network deployment that goes beyond the scope of conventional fixed access nodes. Within the framework of moving networks, nomadic nodes (NNs) can enable demand-driven service provisioning to increase the network capacity or to extend the cell coverage area, and to reduce network energy consumption. NNs can be mounted on vehicles within a car-sharing fleet. In this paper, we look at the envisioned dynamic and flexible network deployment through NNs, and demonstrate analyses on the operation of nomadic networks.
{"title":"Towards flexible network deployment in 5G: Nomadic node enhancement to heterogeneous networks","authors":"Ö. Bulakci, Zhe Ren, Chan Zhou, J. Eichinger, P. Fertl, D. G. Serrano, S. Stańczak","doi":"10.1109/ICCW.2015.7247565","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247565","url":null,"abstract":"Mobile networks are experiencing the avalanche of data traffic, which is coupled with the billions of wirelessly connected data-intensive devices using diverse multimedia services and applications. Prospective studies suggest that traffic volume would increase a thousand-fold over the next decade. Furthermore, the users expect the utmost in quality with seamless connectivity to the broadband access. On this basis, moving networks emerge as a promising enhancement for fifth generation (5G) systems to enable flexible network deployment that goes beyond the scope of conventional fixed access nodes. Within the framework of moving networks, nomadic nodes (NNs) can enable demand-driven service provisioning to increase the network capacity or to extend the cell coverage area, and to reduce network energy consumption. NNs can be mounted on vehicles within a car-sharing fleet. In this paper, we look at the envisioned dynamic and flexible network deployment through NNs, and demonstrate analyses on the operation of nomadic networks.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"43 1","pages":"2572-2577"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81060215","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247531
A. Sadek, T. Kadous, Kai Tang, Heechoon Lee, M. Fan
Innovations enabling efficient spectrum utilization is a key element to optimize user experience with growing data demand. This paper discusses the approach of extending enhancements in cellular technology like LTE to unlicensed band for higher spectral efficiency and better user experience. A key challenge for such extension is the coexistence with legacy technology such as Wi-Fi. The description herein highlights techniques for effective coexistence. The results include evaluation and lab data that demonstrate how the technology provide benefit to surrounding Wi-Fi deployment and contribute towards enhancing spectral efficiency of the unlicensed band.
{"title":"Extending LTE to unlicensed band - Merit and coexistence","authors":"A. Sadek, T. Kadous, Kai Tang, Heechoon Lee, M. Fan","doi":"10.1109/ICCW.2015.7247531","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247531","url":null,"abstract":"Innovations enabling efficient spectrum utilization is a key element to optimize user experience with growing data demand. This paper discusses the approach of extending enhancements in cellular technology like LTE to unlicensed band for higher spectral efficiency and better user experience. A key challenge for such extension is the coexistence with legacy technology such as Wi-Fi. The description herein highlights techniques for effective coexistence. The results include evaluation and lab data that demonstrate how the technology provide benefit to surrounding Wi-Fi deployment and contribute towards enhancing spectral efficiency of the unlicensed band.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"1 1","pages":"2344-2349"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86508753","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247173
N. Le, P. Martins, L. Decreusefond, A. Vergne
Energy saving is one of the most investigated problems in wireless networks. In this paper, we introduce two homology based algorithms: a simulated annealing one and a robust one. These algorithms optimize the energy consumption at network level while maintaining the maximal coverage. By using simplicial homology, the complex geometrical calculation of the coverage is reduced to simple matrix computation. The simulated annealing algorithm gives a solution that approaches the global optimal one. The robust algorithm gives a local optimal solution. Our simulations show that this local optimal solution also approaches the global optimal one. Our algorithms can save at most 65% of system's maximal consumption power in polynomial time. The probability density function of the optimized radii of cells is also analyzed and discussed.
{"title":"Simplicial homology based energy saving algorithms for wireless networks","authors":"N. Le, P. Martins, L. Decreusefond, A. Vergne","doi":"10.1109/ICCW.2015.7247173","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247173","url":null,"abstract":"Energy saving is one of the most investigated problems in wireless networks. In this paper, we introduce two homology based algorithms: a simulated annealing one and a robust one. These algorithms optimize the energy consumption at network level while maintaining the maximal coverage. By using simplicial homology, the complex geometrical calculation of the coverage is reduced to simple matrix computation. The simulated annealing algorithm gives a solution that approaches the global optimal one. The robust algorithm gives a local optimal solution. Our simulations show that this local optimal solution also approaches the global optimal one. Our algorithms can save at most 65% of system's maximal consumption power in polynomial time. The probability density function of the optimized radii of cells is also analyzed and discussed.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"1 1","pages":"166-172"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89364998","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
扫码关注我们
求助内容：
应助结果提醒方式：