Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7997282
I. Farris, T. Taleb, Miloud Bagaa, H. Flinck
Extending cloud infrastructure to the Network Edge represents a breakthrough to support delay-sensitive applications in next 5G cellular systems. In this context, to enable ultrashort response times, fast relocation of service instances between edge nodes is required to cope with user mobility. To face this issue, proactive service replication is considered a promising strategy to reduce the overall migration time and to guarantee the desired Quality of Experience (QoE). On the other hand, the provisioning of replicas over multiple edge nodes increases the resource consumption of constrained edge nodes and the relevant deployment cost. Given the two conflicting objectives, in this paper we investigate different optimization models for proactive service migration at the Network Edge, which can exploit prediction of user mobility patterns. In particular, we define two Integer Linear Problem optimization schemes, which aim at respectively minimizing the QoE degradation due to service migration, and the cost of replicas' deployment. Performance evaluation shows the effectiveness of our proposed solutions.
{"title":"Optimizing service replication for mobile delay-sensitive applications in 5G edge network","authors":"I. Farris, T. Taleb, Miloud Bagaa, H. Flinck","doi":"10.1109/ICC.2017.7997282","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997282","url":null,"abstract":"Extending cloud infrastructure to the Network Edge represents a breakthrough to support delay-sensitive applications in next 5G cellular systems. In this context, to enable ultrashort response times, fast relocation of service instances between edge nodes is required to cope with user mobility. To face this issue, proactive service replication is considered a promising strategy to reduce the overall migration time and to guarantee the desired Quality of Experience (QoE). On the other hand, the provisioning of replicas over multiple edge nodes increases the resource consumption of constrained edge nodes and the relevant deployment cost. Given the two conflicting objectives, in this paper we investigate different optimization models for proactive service migration at the Network Edge, which can exploit prediction of user mobility patterns. In particular, we define two Integer Linear Problem optimization schemes, which aim at respectively minimizing the QoE degradation due to service migration, and the cost of replicas' deployment. Performance evaluation shows the effectiveness of our proposed solutions.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"3 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89514342","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}
Multiple-input multiple-output (MIMO) is an essential technology for modern wireless communication systems. Spatial modulation (SM) is an evolving MIMO transmission scheme for energy-efficient massive MIMO systems. SM conveys the information of transmit antenna indices and modulated symbols in MIMO systems. A variant spatial permutation modulation (SPM) was further proposed to include transmit and time diversities by transmitting a permutation array of antenna indices during several time instants. The SPM achieves better error rate performance than the SM especially in fast fading channel. This paper investigates sphere decoding algorithms for the SPM receiver. An ordering scheme was proposed to reduce the number of visited nodes in the spherical tree search. The improved ordered sphere decoding saves about 95.6% computational complexity corresponding to 22.7 times throughput in the software implementation.
{"title":"Sphere decoding for spatial permutation modulation MIMO systems","authors":"Jung-Chun Chi, Yu-Cheng Yeh, I-Wei Lai, Yuan-Hao Huang","doi":"10.1109/ICC.2017.7997167","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997167","url":null,"abstract":"Multiple-input multiple-output (MIMO) is an essential technology for modern wireless communication systems. Spatial modulation (SM) is an evolving MIMO transmission scheme for energy-efficient massive MIMO systems. SM conveys the information of transmit antenna indices and modulated symbols in MIMO systems. A variant spatial permutation modulation (SPM) was further proposed to include transmit and time diversities by transmitting a permutation array of antenna indices during several time instants. The SPM achieves better error rate performance than the SM especially in fast fading channel. This paper investigates sphere decoding algorithms for the SPM receiver. An ordering scheme was proposed to reduce the number of visited nodes in the spherical tree search. The improved ordered sphere decoding saves about 95.6% computational complexity corresponding to 22.7 times throughput in the software implementation.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"80 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91026548","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 : 2017-07-28DOI: 10.1109/ICC.2017.7996479
Weilin Qu, Meng Zhang, Xiang Cheng, Peizhong Ju
In this paper, an effective low complexity generalized spatial modulation (GenSM) scheme with transmit antenna grouping is proposed for massive multi-input multi-output (MIMO) system to deal with the channel correlation among transmit antennas. In the proposed scheme, all transmit antennas are divided into several equal-sized groups, and spatial modulation (SM) is carried out to select one active antenna in each group independently. Two different grouping methods, i.e., block grouping and interleaved grouping, are introduced to optimize the error performance in low and high signal-to-noise ratio (SNR) region, respectively. In consideration of the large amount of transmit antennas in a massive MIMO system, both linear and 2-dimensional transmit antenna arrays are considered in our design. To evaluate the performance, a closed-form expression of the average bit error probability (ABEP) upper bound is derived for all proposed grouping methods and Monte-Carlo simulations are conducted to verify the analysis and reveal the performance gain of the proposed scheme in terms of bit error rate (BER) in comparison with conventional GenSM.
{"title":"Generalized spatial modulation with transmit antenna grouping for massive MIMO","authors":"Weilin Qu, Meng Zhang, Xiang Cheng, Peizhong Ju","doi":"10.1109/ICC.2017.7996479","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996479","url":null,"abstract":"In this paper, an effective low complexity generalized spatial modulation (GenSM) scheme with transmit antenna grouping is proposed for massive multi-input multi-output (MIMO) system to deal with the channel correlation among transmit antennas. In the proposed scheme, all transmit antennas are divided into several equal-sized groups, and spatial modulation (SM) is carried out to select one active antenna in each group independently. Two different grouping methods, i.e., block grouping and interleaved grouping, are introduced to optimize the error performance in low and high signal-to-noise ratio (SNR) region, respectively. In consideration of the large amount of transmit antennas in a massive MIMO system, both linear and 2-dimensional transmit antenna arrays are considered in our design. To evaluate the performance, a closed-form expression of the average bit error probability (ABEP) upper bound is derived for all proposed grouping methods and Monte-Carlo simulations are conducted to verify the analysis and reveal the performance gain of the proposed scheme in terms of bit error rate (BER) in comparison with conventional GenSM.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"20 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78212180","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 : 2017-07-28DOI: 10.1109/ICC.2017.7996919
Junquan Deng, O. Tirkkonen, Tao Chen
We consider two-hop Device-to-device (D2D) relaying in multi-cell downlink networks. D2D relaying is envisioned to be a promising cell coverage extension technique, which can provide improved cell-edge performance without a dense infrastructure deployment. Relaying complicates the resource allocation and interference management in multi-cell networks. We first study the aggregate co-channel interference characteristics when D2D relaying is applied. A fluid network model is used to analyze the inter-cell interference in a multi-cell network with a minimum inter-base station distance. We develop a model for capturing the interaction between relaying decisions made in the own cell and inter-cell interference created to other cells. We investigate network steady state, and optimize key parameters for network-level management. Both simulation and analysis results are provided to help to understand the performance of D2D relaying.
{"title":"D2D relay management in multi-cell networks","authors":"Junquan Deng, O. Tirkkonen, Tao Chen","doi":"10.1109/ICC.2017.7996919","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996919","url":null,"abstract":"We consider two-hop Device-to-device (D2D) relaying in multi-cell downlink networks. D2D relaying is envisioned to be a promising cell coverage extension technique, which can provide improved cell-edge performance without a dense infrastructure deployment. Relaying complicates the resource allocation and interference management in multi-cell networks. We first study the aggregate co-channel interference characteristics when D2D relaying is applied. A fluid network model is used to analyze the inter-cell interference in a multi-cell network with a minimum inter-base station distance. We develop a model for capturing the interaction between relaying decisions made in the own cell and inter-cell interference created to other cells. We investigate network steady state, and optimize key parameters for network-level management. Both simulation and analysis results are provided to help to understand the performance of D2D relaying.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"2 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84366837","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 : 2017-07-28DOI: 10.1109/ICC.2017.7996413
Yi-Chi Chen, I-Wei Lai, Kwang-Cheng Chen
Cognitive radio ad hoc networks (CRAHNs) emerge as a spectrum efficient networking technology to enable autonomous machine-to-machine communication among massive number of IoT devices. However, spectrum sharing results in opportunistic links and CRAHN becomes a kind of opportunistic networks. To reduce latency in CRAHN and to achieve overall spectrum efficiency by avoiding tremendous feedback signaling, CRAHNs of open-loop physical layer transmission open a new avenue under massive operations. The new technology challenge associated with such new CRAHNs lies in error control with only local networking information without relying on feedback control over each opportunistic link. Path-time codes virtually realizing multi-input-multi-output over network layer have been innovated to resolve such a dilemma. However, effective multipath routing considering interference remains unclear. In this paper, be taking network topological factors and interference into account, we analytically derive SINR approximations to design power control and multi-path greedy routing. By stochastic geometry analysis, we also show that the resilient operation for large-scale CRAHNs can be facilitated with the aid of path-time codes.
{"title":"Resilient large-scale cognitive radio ad hoc networking using path-time codes","authors":"Yi-Chi Chen, I-Wei Lai, Kwang-Cheng Chen","doi":"10.1109/ICC.2017.7996413","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996413","url":null,"abstract":"Cognitive radio ad hoc networks (CRAHNs) emerge as a spectrum efficient networking technology to enable autonomous machine-to-machine communication among massive number of IoT devices. However, spectrum sharing results in opportunistic links and CRAHN becomes a kind of opportunistic networks. To reduce latency in CRAHN and to achieve overall spectrum efficiency by avoiding tremendous feedback signaling, CRAHNs of open-loop physical layer transmission open a new avenue under massive operations. The new technology challenge associated with such new CRAHNs lies in error control with only local networking information without relying on feedback control over each opportunistic link. Path-time codes virtually realizing multi-input-multi-output over network layer have been innovated to resolve such a dilemma. However, effective multipath routing considering interference remains unclear. In this paper, be taking network topological factors and interference into account, we analytically derive SINR approximations to design power control and multi-path greedy routing. By stochastic geometry analysis, we also show that the resilient operation for large-scale CRAHNs can be facilitated with the aid of path-time codes.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"6 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87945093","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 : 2017-05-22DOI: 10.1109/ICC.2017.7996796
Federico Clazzer, E. Paolini, Iacopo Mambelli, Č. Stefanović
Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve performance competitive with that of orthogonal schemes. So far the optimization of the repetition degree profile, defining the probability for a user to transmit a given number of replicas, has mainly been performed targeting the collision channel model. In this paper the analysis is extended to a block fading channel model, also assuming capture effect at the receiver. Density evolution equations are developed for the new setting and, based on them, some repetition degree profiles are optimized and analyzed via Monte Carlo simulation in a finite frame length setting. The derived distributions are shown to achieve throughputs largely exceeding 1 [packet/slot].
{"title":"Irregular repetition slotted ALOHA over the Rayleigh block fading channel with capture","authors":"Federico Clazzer, E. Paolini, Iacopo Mambelli, Č. Stefanović","doi":"10.1109/ICC.2017.7996796","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996796","url":null,"abstract":"Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve performance competitive with that of orthogonal schemes. So far the optimization of the repetition degree profile, defining the probability for a user to transmit a given number of replicas, has mainly been performed targeting the collision channel model. In this paper the analysis is extended to a block fading channel model, also assuming capture effect at the receiver. Density evolution equations are developed for the new setting and, based on them, some repetition degree profiles are optimized and analyzed via Monte Carlo simulation in a finite frame length setting. The derived distributions are shown to achieve throughputs largely exceeding 1 [packet/slot].","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"77 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86928365","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996513
P. Vizarreta, M. Condoluci, C. M. Machuca, Toktam Mahmoodi, W. Kellerer
With Network Function Virtualization (NFV), network functions are deployed as modular software components on the commodity hardware, and can be further chained to provide services, offering much greater flexibility and lower cost of the service deployment for the network operators. At the same time, replacing the network functions implemented in purpose built hardware with software modules poses a great challenge for the operator to maintain the same level of performance. The grade of service promised to the end users is formalized in the Service Level Agreement (SLA) that typically contains the QoS parameters, such as minimum guaranteed data rate, maximum end to end latency, port availability and packet loss. State of the art solutions can guarantee only data rate and latency requirements, while service availability, which is an important service differentiator is mostly neglected. This paper focuses on the placement of virtualized network functions, aiming to support service differentiation between the users, while minimizing the associated service deployment cost for the operator. Two QoS-aware placement strategies are presented, an optimal solution based on the Integer Linear Programming (ILP) problem formulation and an efficient heuristic to obtain near optimal solution. Considering a national core network case study, we show the cost overhead of availability-awareness, as well as the risk of SLA violation when availability constraint is neglected. We also compare the proposed function placement heuristic to the optimal solution in terms of cost efficiency and execution time, and demonstrate that it can provide a good estimation of the deployment cost in much shorter time.
{"title":"QoS-driven function placement reducing expenditures in NFV deployments","authors":"P. Vizarreta, M. Condoluci, C. M. Machuca, Toktam Mahmoodi, W. Kellerer","doi":"10.1109/ICC.2017.7996513","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996513","url":null,"abstract":"With Network Function Virtualization (NFV), network functions are deployed as modular software components on the commodity hardware, and can be further chained to provide services, offering much greater flexibility and lower cost of the service deployment for the network operators. At the same time, replacing the network functions implemented in purpose built hardware with software modules poses a great challenge for the operator to maintain the same level of performance. The grade of service promised to the end users is formalized in the Service Level Agreement (SLA) that typically contains the QoS parameters, such as minimum guaranteed data rate, maximum end to end latency, port availability and packet loss. State of the art solutions can guarantee only data rate and latency requirements, while service availability, which is an important service differentiator is mostly neglected. This paper focuses on the placement of virtualized network functions, aiming to support service differentiation between the users, while minimizing the associated service deployment cost for the operator. Two QoS-aware placement strategies are presented, an optimal solution based on the Integer Linear Programming (ILP) problem formulation and an efficient heuristic to obtain near optimal solution. Considering a national core network case study, we show the cost overhead of availability-awareness, as well as the risk of SLA violation when availability constraint is neglected. We also compare the proposed function placement heuristic to the optimal solution in terms of cost efficiency and execution time, and demonstrate that it can provide a good estimation of the deployment cost in much shorter time.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"26 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74024563","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996331
J. Niu, Huanpei Chen, Qingjuan Zhao, Limin Su, Mohammed Atiquzzaman
Automatic multi-document abstractive summarization system is used to summarize several documents into a short one with generated new sentences. Many of them are based on word-graph and ILP method, and lots of sentences are ignored because of the heavy computation load. To reduce computation and generate readable and informative summaries, we propose a novel abstractive multi-document summarization system based on chunk-graph (CG) and recurrent neural network language model (RNNLM). In our approach, A CG which is based on word-graph is constructed to organize all information in a sentence cluster, CG can reduce the size of graph and keep more semantic information than word-graph. We use beam search and character-level RNNLM to generate readable and informative summaries from the CG for each sentence cluster, RNNLM is a better model to evaluate sentence linguistic quality than n-gram language model. Experimental results show that our proposed system outperforms all baseline systems and reach the state-of-art systems, and the system with CG can generate better summaries than that with ordinary word-graph.
{"title":"Multi-document abstractive summarization using chunk-graph and recurrent neural network","authors":"J. Niu, Huanpei Chen, Qingjuan Zhao, Limin Su, Mohammed Atiquzzaman","doi":"10.1109/ICC.2017.7996331","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996331","url":null,"abstract":"Automatic multi-document abstractive summarization system is used to summarize several documents into a short one with generated new sentences. Many of them are based on word-graph and ILP method, and lots of sentences are ignored because of the heavy computation load. To reduce computation and generate readable and informative summaries, we propose a novel abstractive multi-document summarization system based on chunk-graph (CG) and recurrent neural network language model (RNNLM). In our approach, A CG which is based on word-graph is constructed to organize all information in a sentence cluster, CG can reduce the size of graph and keep more semantic information than word-graph. We use beam search and character-level RNNLM to generate readable and informative summaries from the CG for each sentence cluster, RNNLM is a better model to evaluate sentence linguistic quality than n-gram language model. Experimental results show that our proposed system outperforms all baseline systems and reach the state-of-art systems, and the system with CG can generate better summaries than that with ordinary word-graph.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"36 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74085507","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 : 2017-05-21DOI: 10.1109/ICC.2017.7997160
Georgios Z. Papadopoulos, T. Matsui, P. Thubert, Géraldine Texier, T. Watteyne, N. Montavont
Recent standardization activities bring high Quality of Service (QoS) and predictability to Internet of Things (IoT), which are “going industrial”. Critical applications such as industrial process control, smart grid or vehicle automation require deterministic transmissions with properties such as on-time data deliveries and end-to-end reliability close to 100%. Traditional radio technologies based on collision detection and retransmission introduce unpredictable delays, and can not ensure reliable delivery within a narrowly bounded time. This paper proposes to exploit spatial diversity and packet redundancy to compensate for the inherently lossy wireless medium. We introduce “Leapfrog Collaboration”, a communication mechanism which takes advantage of communication overhearing, and in which parallel transmissions over two paths are scheduled. Promiscuous listening between the paths enables nodes to possibly overhear transmissions on the other. We evaluate the delay and jitter of the communication by simulation using Contiki OS and show that Leapfrog Collaboration outperforms the default retransmission-based approach of IEEE802.15.4-TSCH by up to 28% and 54%, respectively, while providing high network reliability.
{"title":"Leapfrog collaboration: Toward determinism and predictability in industrial-IoT applications","authors":"Georgios Z. Papadopoulos, T. Matsui, P. Thubert, Géraldine Texier, T. Watteyne, N. Montavont","doi":"10.1109/ICC.2017.7997160","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997160","url":null,"abstract":"Recent standardization activities bring high Quality of Service (QoS) and predictability to Internet of Things (IoT), which are “going industrial”. Critical applications such as industrial process control, smart grid or vehicle automation require deterministic transmissions with properties such as on-time data deliveries and end-to-end reliability close to 100%. Traditional radio technologies based on collision detection and retransmission introduce unpredictable delays, and can not ensure reliable delivery within a narrowly bounded time. This paper proposes to exploit spatial diversity and packet redundancy to compensate for the inherently lossy wireless medium. We introduce “Leapfrog Collaboration”, a communication mechanism which takes advantage of communication overhearing, and in which parallel transmissions over two paths are scheduled. Promiscuous listening between the paths enables nodes to possibly overhear transmissions on the other. We evaluate the delay and jitter of the communication by simulation using Contiki OS and show that Leapfrog Collaboration outperforms the default retransmission-based approach of IEEE802.15.4-TSCH by up to 28% and 54%, respectively, while providing high network reliability.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"38 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73110230","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 : 2017-05-21DOI: 10.1109/ICC.2017.7997008
Rémi Bonnefoi, C. Moy, J. Palicot
Power control (PC) and discontinuous transmission (DTx) can reduce the power consumption of a base station (BS). When both are used, there is, for each user, a trade-off between service time and transmit power in order to minimize the energy consumption of the base station. In this paper, we analyse this trade-off and we propose a new efficient algorithm for the computation of the optimal service time and transmit power of all users. We show that in most cases, closed-form expressions can be used. For others, we prove that the search for the optimum can be changed into a root-finding problem which can be solved efficiently with the Newton's method. Numerical results show that, compared to the use of DTx only, the proposed strategy allows to save up to 4% (7W) of the total energy consumption.
{"title":"New macrocell downlink energy consumption minimization with cell DTx and power control","authors":"Rémi Bonnefoi, C. Moy, J. Palicot","doi":"10.1109/ICC.2017.7997008","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997008","url":null,"abstract":"Power control (PC) and discontinuous transmission (DTx) can reduce the power consumption of a base station (BS). When both are used, there is, for each user, a trade-off between service time and transmit power in order to minimize the energy consumption of the base station. In this paper, we analyse this trade-off and we propose a new efficient algorithm for the computation of the optimal service time and transmit power of all users. We show that in most cases, closed-form expressions can be used. For others, we prove that the search for the optimum can be changed into a root-finding problem which can be solved efficiently with the Newton's method. Numerical results show that, compared to the use of DTx only, the proposed strategy allows to save up to 4% (7W) of the total energy consumption.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"49 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80120420","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
扫码关注我们
求助内容：
应助结果提醒方式：