Pub Date : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036975
Raúl Palacios, H. Haile, J. Alonso-Zarate, F. Granelli
The implementation of Network Coding (NC) in IEEE 802.11-based wireless networks presents the important challenge of providing additional transmission priority for the relay nodes responsible for coding. These nodes are able to convey more information in each transmission than those that forward single packets, by combining several received packets in a single coded packet. To transmit data, the nodes execute the IEEE 802.11 Medium Access Control (MAC) protocol, called the Distributed Coordination Function (DCF). Thus, they compete for the access to the wireless channel and get equal transmission opportunities under high congestion. As a result, congested relay nodes will severely limit the performance of the network. In this paper, we investigate a backwards-compatible mechanism, called Reverse Direction DCF (RD-DCF), that allows relay nodes to transmit data upon successful reception of data. We analyze the performance limits of the proposed protocol with and without NC in terms of throughput and energy efficiency. The performance evaluation considers different traffic loads, packet lengths, and data rates. The results of this work show that the proposed RD-DCF+NC protocol can improve throughput and energy efficiency up to 335% when compared to legacy DCF.
{"title":"Analysis of a network coding-aware MAC protocol for IEEE 802.11 wireless networks with Reverse Direction transmissions","authors":"Raúl Palacios, H. Haile, J. Alonso-Zarate, F. Granelli","doi":"10.1109/GLOCOM.2014.7036975","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036975","url":null,"abstract":"The implementation of Network Coding (NC) in IEEE 802.11-based wireless networks presents the important challenge of providing additional transmission priority for the relay nodes responsible for coding. These nodes are able to convey more information in each transmission than those that forward single packets, by combining several received packets in a single coded packet. To transmit data, the nodes execute the IEEE 802.11 Medium Access Control (MAC) protocol, called the Distributed Coordination Function (DCF). Thus, they compete for the access to the wireless channel and get equal transmission opportunities under high congestion. As a result, congested relay nodes will severely limit the performance of the network. In this paper, we investigate a backwards-compatible mechanism, called Reverse Direction DCF (RD-DCF), that allows relay nodes to transmit data upon successful reception of data. We analyze the performance limits of the proposed protocol with and without NC in terms of throughput and energy efficiency. The performance evaluation considers different traffic loads, packet lengths, and data rates. The results of this work show that the proposed RD-DCF+NC protocol can improve throughput and energy efficiency up to 335% when compared to legacy DCF.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"53 1","pages":"1218-1224"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75190873","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}
Wireless information and energy transfer (WIET) is a prominent technology to prolong the lifetime of battery-charging wireless networks. In this paper, we exploit the benefit of massive MIMO for WIET under external interference, and propose the antenna partition for information decoding and energy harvesting. Considering the effects of the external interference, i.e., interfering the information reception and benefiting the energy harvesting, we analyze the tradeoff between the data rate and the harvested energy, and obtain the achievable rate-energy (R-E) region. Then, we propose a low-complexity receive antenna partition algoritinterference mitigationhm for WIET in massive MIMO systems with the consideration of interference mitigation. The algorithm maximizes the data rate while guaranteeing a minimum harvested energy. It is found that the SNR of the low-complexity algorithm is at least an approximable half of the optimal SNR. Simulation results verify our theoretical claims and show the effectiveness of the proposed low-complexity antenna partition algorithm.
{"title":"Wireless information and energy transfer in interference aware massive MIMO systems","authors":"Hengzhi Wang, Wei Wang, Xiaoming Chen, Zhaoyang Zhang","doi":"10.1109/GLOCOM.2014.7037192","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037192","url":null,"abstract":"Wireless information and energy transfer (WIET) is a prominent technology to prolong the lifetime of battery-charging wireless networks. In this paper, we exploit the benefit of massive MIMO for WIET under external interference, and propose the antenna partition for information decoding and energy harvesting. Considering the effects of the external interference, i.e., interfering the information reception and benefiting the energy harvesting, we analyze the tradeoff between the data rate and the harvested energy, and obtain the achievable rate-energy (R-E) region. Then, we propose a low-complexity receive antenna partition algoritinterference mitigationhm for WIET in massive MIMO systems with the consideration of interference mitigation. The algorithm maximizes the data rate while guaranteeing a minimum harvested energy. It is found that the SNR of the low-complexity algorithm is at least an approximable half of the optimal SNR. Simulation results verify our theoretical claims and show the effectiveness of the proposed low-complexity antenna partition algorithm.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"48 1","pages":"2556-2561"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74439449","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036798
Huang Cheng, Xin Fei, A. Boukerche, M. Almulla
The RSU deployment algorithms to cover interest regions have emerged as promising areas of research in vehicular ad hoc networks. However, there is few research on the discovery of the interest regions. Besides, the deployment algorithms are usually proposed for either continuous coverage or sparse coverage. The wisdom of the model selection are rarely addressed. In this paper, we proposed a new algorithm to discover interest regions. A budget-constrained coverage selection algorithm is also presented to help network designers choose suitable coverage models to meet the budget and quality requirements. The algorithms are implemented on top of Ns2 and the simulations are carried out using SUMO and OpenStreet Maps. The performance comparison between our algorithm and other two clustering algorithms prove that our algorithm has a better performance in terms of contact time for both sparse coverage and continue coverage.
{"title":"Hotspot discovery algorithms in coverage selection model over VANETs","authors":"Huang Cheng, Xin Fei, A. Boukerche, M. Almulla","doi":"10.1109/GLOCOM.2014.7036798","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036798","url":null,"abstract":"The RSU deployment algorithms to cover interest regions have emerged as promising areas of research in vehicular ad hoc networks. However, there is few research on the discovery of the interest regions. Besides, the deployment algorithms are usually proposed for either continuous coverage or sparse coverage. The wisdom of the model selection are rarely addressed. In this paper, we proposed a new algorithm to discover interest regions. A budget-constrained coverage selection algorithm is also presented to help network designers choose suitable coverage models to meet the budget and quality requirements. The algorithms are implemented on top of Ns2 and the simulations are carried out using SUMO and OpenStreet Maps. The performance comparison between our algorithm and other two clustering algorithms prove that our algorithm has a better performance in terms of contact time for both sparse coverage and continue coverage.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"37 1","pages":"143-148"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74607463","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037372
Jemin Lee, Tony Q. S. Quek
Full-duplex (FD) radio has been introduced for bidirectional communications on the same temporal and spectral resources so as to maximize spectral efficiency. In this paper, motivated by the recent advances in FD radios, we provide a foundation for downlink hybrid-duplex heterogeneous networks (HDHNs), composed of multi-tier networks with a mixture of access points (APs) operating either in FD mode or half-duplex (HD) mode. Specifically, we characterize the network interference from FD-mode cells, and derive the HDHN throughput by accounting for AP spatial density, self-interference cancellation (IC) capability, and transmission power of APs and users. By quantifying the HDHN throughput, we present the effect of network parameters and the self-IC capability on the HDHN throughput, which shows the superiority of FD mode for larger AP densities (i.e., larger network interference and shorter communication distance) or higher self-IC capability.
{"title":"Heterogeneous network throughput with hybrid-duplex systems","authors":"Jemin Lee, Tony Q. S. Quek","doi":"10.1109/GLOCOM.2014.7037372","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037372","url":null,"abstract":"Full-duplex (FD) radio has been introduced for bidirectional communications on the same temporal and spectral resources so as to maximize spectral efficiency. In this paper, motivated by the recent advances in FD radios, we provide a foundation for downlink hybrid-duplex heterogeneous networks (HDHNs), composed of multi-tier networks with a mixture of access points (APs) operating either in FD mode or half-duplex (HD) mode. Specifically, we characterize the network interference from FD-mode cells, and derive the HDHN throughput by accounting for AP spatial density, self-interference cancellation (IC) capability, and transmission power of APs and users. By quantifying the HDHN throughput, we present the effect of network parameters and the self-IC capability on the HDHN throughput, which shows the superiority of FD mode for larger AP densities (i.e., larger network interference and shorter communication distance) or higher self-IC capability.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"83 1","pages":"3635-3640"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73248238","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037513
Quanxin Zhao, Y. Mao, S. Leng, Yuming Jiang
Multi-view video (MVV) consists of multiple video streams captured simultaneously by multiple closely spaced cameras and enables users to freely change their viewpoints by playing different video streams. Those close deployed cameras will capture overlapping frames (OFs) and then transmit OFs in multiple video streams. With the viewpoint change from one stream to another, redundant OFs in the latter stream can be useless for a user. Moreover, the redundant transmission will increase with the number of users and result in severe bandwidth waste for both base stations and users. In order to reduce the redundant transmission of OFs and increase energy efficiency (EE), a new architecture Overlapping Reduced Multi-view Video Transmission (ORMVVT), which is based on User dependent Multi-view video Streaming for Multi-users (UMSM), is proposed for downlink transmission of MVV in small cell networks (SCNs). Then, a novel resource allocation model is introduced to help users achieve different data rates according to their Quality of Service (QoS) requirements. Contrarily, for the simplicity of implementation, existing schemes can only support a single reception data rate for all users in a multicast group. Further, we formulate an optimization problem to maximize the EE with the QoS constraint of services. Finally, a suboptimal QoS-aware Energy-efficient Multicast Resource Allocation scheme (QEMRA) is proposed to reduce the computational complexity. Numerical results show that the proposed low-complexity QEMRA scheme is able to get a close-to-optimal performance under general fading distributions.
{"title":"QoS-aware energy-efficient multicast for multi-view video in indoor small cell networks","authors":"Quanxin Zhao, Y. Mao, S. Leng, Yuming Jiang","doi":"10.1109/GLOCOM.2014.7037513","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037513","url":null,"abstract":"Multi-view video (MVV) consists of multiple video streams captured simultaneously by multiple closely spaced cameras and enables users to freely change their viewpoints by playing different video streams. Those close deployed cameras will capture overlapping frames (OFs) and then transmit OFs in multiple video streams. With the viewpoint change from one stream to another, redundant OFs in the latter stream can be useless for a user. Moreover, the redundant transmission will increase with the number of users and result in severe bandwidth waste for both base stations and users. In order to reduce the redundant transmission of OFs and increase energy efficiency (EE), a new architecture Overlapping Reduced Multi-view Video Transmission (ORMVVT), which is based on User dependent Multi-view video Streaming for Multi-users (UMSM), is proposed for downlink transmission of MVV in small cell networks (SCNs). Then, a novel resource allocation model is introduced to help users achieve different data rates according to their Quality of Service (QoS) requirements. Contrarily, for the simplicity of implementation, existing schemes can only support a single reception data rate for all users in a multicast group. Further, we formulate an optimization problem to maximize the EE with the QoS constraint of services. Finally, a suboptimal QoS-aware Energy-efficient Multicast Resource Allocation scheme (QEMRA) is proposed to reduce the computational complexity. Numerical results show that the proposed low-complexity QEMRA scheme is able to get a close-to-optimal performance under general fading distributions.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"23 1","pages":"4478-4483"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75519194","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037303
M. Gomes, V. Silva, F. Cercas, M. Tomlinson
Magnitude modulation (MM) techniques applied to single carrier (SC) transmissions provide the potential for gains in power efficiency by reducing the signal's peak-to-average power ratio, allowing efficient power amplification at the transmitter's side. This paper presents an accurate analytical model to measure the intrinsic symbol error rate (SER) due to MM distortion for systems employing high-order constellations and proposes a new feedback based soft-iterative magnitude demodulation (SiMD) scheme for the receiver with proper estimation of the MM factors used in transmission in order to compensate for the MM distortion introduced at the transmitter. It is shown that this technique allows the design of MM highly power efficient SC transceivers with high spectral efficiency.
{"title":"Soft-iterative magnitude demodulation","authors":"M. Gomes, V. Silva, F. Cercas, M. Tomlinson","doi":"10.1109/GLOCOM.2014.7037303","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037303","url":null,"abstract":"Magnitude modulation (MM) techniques applied to single carrier (SC) transmissions provide the potential for gains in power efficiency by reducing the signal's peak-to-average power ratio, allowing efficient power amplification at the transmitter's side. This paper presents an accurate analytical model to measure the intrinsic symbol error rate (SER) due to MM distortion for systems employing high-order constellations and proposes a new feedback based soft-iterative magnitude demodulation (SiMD) scheme for the receiver with proper estimation of the MM factors used in transmission in order to compensate for the MM distortion introduced at the transmitter. It is shown that this technique allows the design of MM highly power efficient SC transceivers with high spectral efficiency.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"27 2","pages":"3225-3230"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72546681","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036829
Ju Ren, Yaoxue Zhang, Kuan Zhang, Xuemin Shen
Wireless sensor networks (WSNs) are vulnerable to selective forwarding attacks that selectively drop a subset of the forwarding packets to degrade network performances. Due to unstable wireless channels, the packet loss rate between sensor nodes might be high, especially in hostile environments. Therefore, it is difficult to distinguish the malicious drop and normal packet loss. In this paper, we propose a Channel-aware deputation System (CRS) to identify selective forwarding misbehaviours from normal packet losses caused by poor channel quality or medium access collision. Specifically, CRS is based on normal packet loss estimation and neighbour monitoring. Each node maintains a reputation table to evaluate forwarding behaviours of its neighbours. Reputation value is determined by the deviation of the monitored packet loss rate and estimated normal loss rate. The nodes with reputation below a threshold are identified as misbehaving nodes and isolated from data forwarding paths. Furthermore, we develop weighted reputation propagation and integration functions to improve detection efficiency. Through theoretical analysis and extensive simulations, we demonstrate that CRS can accurately detect selective forwarding attacks and significantly improve the network throughput.
{"title":"Exploiting channel-aware reputation system against selective forwarding attacks in WSNs","authors":"Ju Ren, Yaoxue Zhang, Kuan Zhang, Xuemin Shen","doi":"10.1109/GLOCOM.2014.7036829","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036829","url":null,"abstract":"Wireless sensor networks (WSNs) are vulnerable to selective forwarding attacks that selectively drop a subset of the forwarding packets to degrade network performances. Due to unstable wireless channels, the packet loss rate between sensor nodes might be high, especially in hostile environments. Therefore, it is difficult to distinguish the malicious drop and normal packet loss. In this paper, we propose a Channel-aware deputation System (CRS) to identify selective forwarding misbehaviours from normal packet losses caused by poor channel quality or medium access collision. Specifically, CRS is based on normal packet loss estimation and neighbour monitoring. Each node maintains a reputation table to evaluate forwarding behaviours of its neighbours. Reputation value is determined by the deviation of the monitored packet loss rate and estimated normal loss rate. The nodes with reputation below a threshold are identified as misbehaving nodes and isolated from data forwarding paths. Furthermore, we develop weighted reputation propagation and integration functions to improve detection efficiency. Through theoretical analysis and extensive simulations, we demonstrate that CRS can accurately detect selective forwarding attacks and significantly improve the network throughput.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"180 1","pages":"330-335"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72586042","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036857
J. Schloemann, R. Buehrer
In this paper, we investigate the benefit of inter-node collaboration in multidimensional location estimation. In particular, for networks with reference nodes at known locations and source nodes whose locations are unknown and to be estimated, we establish the value of collaboration for source node position estimation by presenting proof of a decreasing Cramér-Rao lower bound as additional source nodes (meeting some minimum connectivity requirements) are introduced into the collaborative position estimation problem. Prior work has shown this for one-dimensional location estimation; however, the previous proof as presented is not easily extendable to multidimensional location estimation. Following the completion of the proof, the minimum connectivity conditions for two-dimensional positioning using time-of-arrival and received-signal-strength ranging information are discussed. Lastly, the theoretical result is verified with numerical results through simulation.
{"title":"On the value of collaboration in multidimensional location estimation","authors":"J. Schloemann, R. Buehrer","doi":"10.1109/GLOCOM.2014.7036857","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036857","url":null,"abstract":"In this paper, we investigate the benefit of inter-node collaboration in multidimensional location estimation. In particular, for networks with reference nodes at known locations and source nodes whose locations are unknown and to be estimated, we establish the value of collaboration for source node position estimation by presenting proof of a decreasing Cramér-Rao lower bound as additional source nodes (meeting some minimum connectivity requirements) are introduced into the collaborative position estimation problem. Prior work has shown this for one-dimensional location estimation; however, the previous proof as presented is not easily extendable to multidimensional location estimation. Following the completion of the proof, the minimum connectivity conditions for two-dimensional positioning using time-of-arrival and received-signal-strength ranging information are discussed. Lastly, the theoretical result is verified with numerical results through simulation.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"55 1","pages":"498-504"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78597621","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036933
Jing Guo, S. Durrani, Xiangyun Zhou
This paper characterizes the aggregate interference at the primary user (PU) due to M secondary users (SUs) in an underlay cognitive network, where appropriate SU activity protocols are employed in order to limit the interference generated by the SUs. Different from prior works, we assume that the PU can be located anywhere inside an arbitrarily-shaped convex network region. Using the moment generating function (MGF) of the interference from a random SU, we derive general expressions for the n-th moment and the n-th cumulant of the aggregate interference for guard zone and multiple-threshold SU activity protocols. Using the cumulants, we study the convergence of the distribution of the aggregate interference to a Gaussian distribution. In addition, we compare the well-known closed-form distributions in the literature to approximate the complementary cumulative distribution function (CCDF) of the aggregate interference. Our results show that care must be undertaken in approximating the aggregate interference as a Gaussian distribution, even for a large number of SUs, since the convergence is not monotonie in general. In addition, the shifted lognormal distribution provides the overall best CCDF approximation, especially in the distribution tail region, for arbitrarily-shaped network regions.
{"title":"Characterization of aggregate interference in arbitrarily-shaped underlay cognitive networks","authors":"Jing Guo, S. Durrani, Xiangyun Zhou","doi":"10.1109/GLOCOM.2014.7036933","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036933","url":null,"abstract":"This paper characterizes the aggregate interference at the primary user (PU) due to M secondary users (SUs) in an underlay cognitive network, where appropriate SU activity protocols are employed in order to limit the interference generated by the SUs. Different from prior works, we assume that the PU can be located anywhere inside an arbitrarily-shaped convex network region. Using the moment generating function (MGF) of the interference from a random SU, we derive general expressions for the n-th moment and the n-th cumulant of the aggregate interference for guard zone and multiple-threshold SU activity protocols. Using the cumulants, we study the convergence of the distribution of the aggregate interference to a Gaussian distribution. In addition, we compare the well-known closed-form distributions in the literature to approximate the complementary cumulative distribution function (CCDF) of the aggregate interference. Our results show that care must be undertaken in approximating the aggregate interference as a Gaussian distribution, even for a large number of SUs, since the convergence is not monotonie in general. In addition, the shifted lognormal distribution provides the overall best CCDF approximation, especially in the distribution tail region, for arbitrarily-shaped network regions.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"299302 1","pages":"961-966"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77884950","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037077
Chao Fang, F. Yu, Tao Huang, Jiang Liu, Yun-jie Liu
Due to the in-network caching capability, Content-Centric Networking (CCN) has emerged as one of the most promising architectures for the diffusion of contents over the Internet. Most existing works on CCN focus on network resource utilization, and the energy efficiency aspect is largely ignored. In this paper, we formulate the energy consumption issue as a Mixed Integer Linear Programming (MILP) problem, and propose a centralized solution via spanning tree heuristic and a fully distributed energy consumption optimization algorithm via dual decomposition (DD) to solve the problem for CCN. The dual decomposition method transforms the centralized energy consumption optimization problem into the router status, link status, and link flow subproblems. Simulation results reveal that the proposed scheme exhibits a fast convergence speed, and achieves superior energy efficiency compared to other widely used schemes in CCN.
{"title":"A distributed energy consumption optimization algorithm for content-centric networks via dual decomposition","authors":"Chao Fang, F. Yu, Tao Huang, Jiang Liu, Yun-jie Liu","doi":"10.1109/GLOCOM.2014.7037077","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037077","url":null,"abstract":"Due to the in-network caching capability, Content-Centric Networking (CCN) has emerged as one of the most promising architectures for the diffusion of contents over the Internet. Most existing works on CCN focus on network resource utilization, and the energy efficiency aspect is largely ignored. In this paper, we formulate the energy consumption issue as a Mixed Integer Linear Programming (MILP) problem, and propose a centralized solution via spanning tree heuristic and a fully distributed energy consumption optimization algorithm via dual decomposition (DD) to solve the problem for CCN. The dual decomposition method transforms the centralized energy consumption optimization problem into the router status, link status, and link flow subproblems. Simulation results reveal that the proposed scheme exhibits a fast convergence speed, and achieves superior energy efficiency compared to other widely used schemes in CCN.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"70 1","pages":"1848-1853"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77904676","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
扫码关注我们
求助内容：
应助结果提醒方式：