Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883972
W. Cowley, D. Giggenbach, R. M. Calvo
A novel transmission scheme for the forward link of a broadband satellite system that aims to avoid the need for feeder-link RF spectrum is described1. The hybrid scheme uses one or more optical uplinks from a hub station to geostationary satellite, plus one or more Ka band downlinks. The approach aims to retain the advantages of strong channel coding with high spectral efficiency, as used in recent high-speed digital video broadcast satellites, yet minimise on-board processing requirements. Promising simulation results are presented for a range of channel models, including channel measurements made with ESA's Artemis satellite.
{"title":"Optical transmission schemes for GEO feeder links","authors":"W. Cowley, D. Giggenbach, R. M. Calvo","doi":"10.1109/ICC.2014.6883972","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883972","url":null,"abstract":"A novel transmission scheme for the forward link of a broadband satellite system that aims to avoid the need for feeder-link RF spectrum is described1. The hybrid scheme uses one or more optical uplinks from a hub station to geostationary satellite, plus one or more Ka band downlinks. The approach aims to retain the advantages of strong channel coding with high spectral efficiency, as used in recent high-speed digital video broadcast satellites, yet minimise on-board processing requirements. Promising simulation results are presented for a range of channel models, including channel measurements made with ESA's Artemis satellite.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115331084","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-06-10DOI: 10.1109/ICC.2014.6883731
Yanjie Dong, Min Sheng, Shun Zhang, Chungang Yang
In this paper, we investigate the interference mitigation in femtocell networks, where femtocell access points (FAPs) are allowed to cooperate as different cooperative groups to allocate resources. We model the femtocell cooperation characteristics as a coalition formation game in partition form with non-transferable utility. Furthermore, a distributed coalition formation algorithm is proposed to enable each FAP to decide to depart from or join in a coalition independently, moreover, we devise a low complex iterative algorithm to optimize the allocation of each coalition's multi-dimensional resources for maximizing its FAPs' payoffs. By applying our proposed coalition formation scheme, a Nash stable FAP partition is formed and FAPs in each coalition can effectively exploit the cooperative gain to mitigate the interference and maximize the sum rate. Numerical results are provided to corroborate our proposed studies.
{"title":"Coalition based interference mitigation in femtocell networks with multi-resource allocation","authors":"Yanjie Dong, Min Sheng, Shun Zhang, Chungang Yang","doi":"10.1109/ICC.2014.6883731","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883731","url":null,"abstract":"In this paper, we investigate the interference mitigation in femtocell networks, where femtocell access points (FAPs) are allowed to cooperate as different cooperative groups to allocate resources. We model the femtocell cooperation characteristics as a coalition formation game in partition form with non-transferable utility. Furthermore, a distributed coalition formation algorithm is proposed to enable each FAP to decide to depart from or join in a coalition independently, moreover, we devise a low complex iterative algorithm to optimize the allocation of each coalition's multi-dimensional resources for maximizing its FAPs' payoffs. By applying our proposed coalition formation scheme, a Nash stable FAP partition is formed and FAPs in each coalition can effectively exploit the cooperative gain to mitigate the interference and maximize the sum rate. Numerical results are provided to corroborate our proposed studies.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115486514","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-06-10DOI: 10.1109/ICC.2014.6883347
S. Uludag, Murat Karakus, Evrim Guler
With the proliferation of the application areas of the Wireless Sensor Networks (WSNs) and the technological advances in sensor electronics, target tracking has become one of the most important functions in WSNs. The overwhelming majority of moving target tracking studies in WSNs has assumed either one-dimensional space (lineland), or two-dimensional domain (flat-land). However, many existing, such as environmental monitoring of rugged terrain, structural health monitoring of buildings, underground and underwater WSN applications, and emerging applications, such as search-and-rescue via Micro Aerial Vehicles, reconnaissance by insect-sized flying robots, need target tracking in three-dimensional space. In this study, we assume a Wireless Aerial Sensor Network (WASN) with conventional low-power and low-complexity features and devise a low spatial and temporal complexity moving target tracking mechanism in 3D based on g-h filter that considers measurement errors. Our prefatory simulations show promising preliminary results for our approach in terms of very low inaccuracy rates between the true location of the target and the forecasts at the sink node as well as negligible estimate errors in terms of Euclidean distance.
{"title":"Low-complexity 3D target tracking in Wireless Aerial Sensor Networks","authors":"S. Uludag, Murat Karakus, Evrim Guler","doi":"10.1109/ICC.2014.6883347","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883347","url":null,"abstract":"With the proliferation of the application areas of the Wireless Sensor Networks (WSNs) and the technological advances in sensor electronics, target tracking has become one of the most important functions in WSNs. The overwhelming majority of moving target tracking studies in WSNs has assumed either one-dimensional space (lineland), or two-dimensional domain (flat-land). However, many existing, such as environmental monitoring of rugged terrain, structural health monitoring of buildings, underground and underwater WSN applications, and emerging applications, such as search-and-rescue via Micro Aerial Vehicles, reconnaissance by insect-sized flying robots, need target tracking in three-dimensional space. In this study, we assume a Wireless Aerial Sensor Network (WASN) with conventional low-power and low-complexity features and devise a low spatial and temporal complexity moving target tracking mechanism in 3D based on g-h filter that considers measurement errors. Our prefatory simulations show promising preliminary results for our approach in terms of very low inaccuracy rates between the true location of the target and the forecasts at the sink node as well as negligible estimate errors in terms of Euclidean distance.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116116163","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-06-10DOI: 10.1109/ICC.2014.6883408
S. Hossein, A. Tabatabaei, N. Zivic
In this paper, a well-known algorithm of approximate message authentication code (AMAC), its generalized scheme and its improved version are reconsidered. Weaknesses are discovered and some solutions for improving the security and performance of the algorithm are suggested. We introduce the number of runs of ones into the old approaches to reduce the noise tolerance combined with two other Boolean functions. Analysis for security, performance and comparison considerations are given along with the simulation results.
{"title":"Revisiting a primitive: Analysis of approximate message authentication codes","authors":"S. Hossein, A. Tabatabaei, N. Zivic","doi":"10.1109/ICC.2014.6883408","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883408","url":null,"abstract":"In this paper, a well-known algorithm of approximate message authentication code (AMAC), its generalized scheme and its improved version are reconsidered. Weaknesses are discovered and some solutions for improving the security and performance of the algorithm are suggested. We introduce the number of runs of ones into the old approaches to reduce the noise tolerance combined with two other Boolean functions. Analysis for security, performance and comparison considerations are given along with the simulation results.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122340994","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-06-10DOI: 10.1109/ICC.2014.6883728
Yifan Li, Ping Wang, D. Niyato, Yang Zhang
Mobile social network (MSN) has been widely studied as a novel and effective way for communication in the current era of fast developing mobile devices, which enables the contents and services to be delivered opportunistically when mobile users contact. In this paper, we aim to optimize the content delivery from the content provider (CP) to the subscribers via relays in between. Tandem queueing model is applied to model the content delivery process, based on which absorbing Markov chain is used to derive the quality of the content delivery service received by the subscribers. The validity of the proposed queuing model has been verified by our simulation results. Observing that the content provider always has dominant control on the content delivery process and is pursuing the maximum profit by strategically designing the “rights” and “obligation” items for the subscribers, contract theory is adopted to reach an economically optimal solution. The numerical results verify the effectiveness of the contract-theoretic approach in maximizing the content provider's profit, and the capability to ensure the satisfaction of the heterogeneous subscribers with different quality of service (QoS) requirements.
在移动设备快速发展的今天，移动社交网络(Mobile social network, MSN)作为一种新颖而有效的通信方式，能够在移动用户联系时及时地传递内容和服务，受到了广泛的研究。在本文中，我们的目标是优化内容提供者(CP)之间通过中继到订阅者的内容传递。采用串联排队模型对内容分发过程进行建模，在此基础上利用吸收马尔可夫链来推导订阅者接收到的内容分发服务的质量。仿真结果验证了所提出的排队模型的有效性。考虑到内容提供商在内容交付过程中始终占据主导地位，并通过对订阅者的“权利”和“义务”项目进行战略性设计，追求利润最大化，采用契约理论寻求经济上的最优解。数值结果验证了契约理论方法在实现内容提供商利润最大化方面的有效性，以及保证具有不同服务质量(QoS)需求的异构用户的满意度的能力。
{"title":"Contract-theoretic modeling for content delivery in relay-based publish-subscribe networks","authors":"Yifan Li, Ping Wang, D. Niyato, Yang Zhang","doi":"10.1109/ICC.2014.6883728","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883728","url":null,"abstract":"Mobile social network (MSN) has been widely studied as a novel and effective way for communication in the current era of fast developing mobile devices, which enables the contents and services to be delivered opportunistically when mobile users contact. In this paper, we aim to optimize the content delivery from the content provider (CP) to the subscribers via relays in between. Tandem queueing model is applied to model the content delivery process, based on which absorbing Markov chain is used to derive the quality of the content delivery service received by the subscribers. The validity of the proposed queuing model has been verified by our simulation results. Observing that the content provider always has dominant control on the content delivery process and is pursuing the maximum profit by strategically designing the “rights” and “obligation” items for the subscribers, contract theory is adopted to reach an economically optimal solution. The numerical results verify the effectiveness of the contract-theoretic approach in maximizing the content provider's profit, and the capability to ensure the satisfaction of the heterogeneous subscribers with different quality of service (QoS) requirements.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122701830","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-06-10DOI: 10.1109/ICC.2014.6883613
Zhe Ji, Chao Dong, Youzheng Wang, Jianhua Lu
Quality of service (QoS) guarantees play a significant role in next-generation wireless networks and the concept of effective capacity is proposed to characterize the maximum arrival rate that a time-varying fading channel can support under a delay-QoS constraint. However, the probability density function (PDF)-based analysis of effective capacity over generalized fading channels suffers from mathematical intractability in some situations of interest. In this paper, an approach based on the moment generating function (MGF) is introduced, which is suitable to deduce the closed-form expression for effective capacity computation. We start with the general case of adaptation transmission policy under the assumption of channel side information (CSI) only at the receiver, and then extend it to other adaptation policies. In addition, we derive unified and concise expressions of effective capacity by means of Fox's H function, which can be easily calculated, accommodating a wide variety of fading scenarios. Finally, the formulas of effective capacity are verified by numerical and simulation results.
{"title":"On the analysis of effective capacity over generalized fading channels","authors":"Zhe Ji, Chao Dong, Youzheng Wang, Jianhua Lu","doi":"10.1109/ICC.2014.6883613","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883613","url":null,"abstract":"Quality of service (QoS) guarantees play a significant role in next-generation wireless networks and the concept of effective capacity is proposed to characterize the maximum arrival rate that a time-varying fading channel can support under a delay-QoS constraint. However, the probability density function (PDF)-based analysis of effective capacity over generalized fading channels suffers from mathematical intractability in some situations of interest. In this paper, an approach based on the moment generating function (MGF) is introduced, which is suitable to deduce the closed-form expression for effective capacity computation. We start with the general case of adaptation transmission policy under the assumption of channel side information (CSI) only at the receiver, and then extend it to other adaptation policies. In addition, we derive unified and concise expressions of effective capacity by means of Fox's H function, which can be easily calculated, accommodating a wide variety of fading scenarios. Finally, the formulas of effective capacity are verified by numerical and simulation results.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122740247","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-06-10DOI: 10.1109/ICC.2014.6883779
Cong Ding, R. Rojas-Cessa
We propose a scheme to schedule the transmission of data center traffic to guarantee a transmission rate for long flows without affecting the rapid transmission required by short flows. We call the proposed scheme Deadline-Aware Queue (DAQ). The traffic of a data center can be broadly classified into long and short flows, where the terms long and short refer to the amount of data to be transmitted. In a data center, the long flows require modest transmission rates to keep maintenance, data updates, and functional operation. Short flows require either fast service or be serviced within a tight deadline. Satisfaction of both classes of bandwidth demands is needed. DAQ uses per-class queues at supporting switches, keeps minimum flow state information, and uses a simple but effective flow control. The credit-based flow control, employed between switch and data sources, ensures lossless transmissions. We study the performance of DAQ and compare it to those of other existing schemes. The results show that the proposed scheme improves the achievable throughput for long flows up to 37% and the application throughput for short flows up to 33% when compared to other schemes. DAQ guarantees a minimum throughput for long flows despite the presence of heavy loads of short flows.
{"title":"DAQ: Deadline-Aware Queue scheme for scheduling service flows in data centers","authors":"Cong Ding, R. Rojas-Cessa","doi":"10.1109/ICC.2014.6883779","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883779","url":null,"abstract":"We propose a scheme to schedule the transmission of data center traffic to guarantee a transmission rate for long flows without affecting the rapid transmission required by short flows. We call the proposed scheme Deadline-Aware Queue (DAQ). The traffic of a data center can be broadly classified into long and short flows, where the terms long and short refer to the amount of data to be transmitted. In a data center, the long flows require modest transmission rates to keep maintenance, data updates, and functional operation. Short flows require either fast service or be serviced within a tight deadline. Satisfaction of both classes of bandwidth demands is needed. DAQ uses per-class queues at supporting switches, keeps minimum flow state information, and uses a simple but effective flow control. The credit-based flow control, employed between switch and data sources, ensures lossless transmissions. We study the performance of DAQ and compare it to those of other existing schemes. The results show that the proposed scheme improves the achievable throughput for long flows up to 37% and the application throughput for short flows up to 33% when compared to other schemes. DAQ guarantees a minimum throughput for long flows despite the presence of heavy loads of short flows.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122782100","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-06-10DOI: 10.1109/ICC.2014.6883789
Boyang Zhou, Chunming Wu, X. Hong, M. Jiang
Programming a network for innovative services or for function improvements has never been easier using Software-Defined Networking (SDN). However, the programming tasks can also be significantly complicated by the asynchrony of data plane states and complexities of service control states. In order to reduce the complexity for programming a network service in Distributed Control Plane of SDN, we propose a proGRAmming Control (GRACE) layer as a generic solution, which provides two key features, namely, reconfigurability and reusability. Their implementations deal with aforementioned challenges, thus to achieve the consistency of the data plane states and the reusability of the service control states at the distributed controllers. This paper introduces the reconfigurability and reusability with their design goals and their impact on the programmability of DCP. We further use two popular network services, ICN (Information-Centric Networking) and CDN (Content Distribution Networks) to illustrate these concepts. NS-3 simulations and PlanetLab emulations are conducted to show the advantage of using the GRACE layer for ICN and CDN. Results show that the ICN Interest delay is reduced by 19.6% and CDN request delay is reduced by 81% in extremely harsh network conditions.
{"title":"Programming network via Distributed Control in Software-Defined Networks","authors":"Boyang Zhou, Chunming Wu, X. Hong, M. Jiang","doi":"10.1109/ICC.2014.6883789","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883789","url":null,"abstract":"Programming a network for innovative services or for function improvements has never been easier using Software-Defined Networking (SDN). However, the programming tasks can also be significantly complicated by the asynchrony of data plane states and complexities of service control states. In order to reduce the complexity for programming a network service in Distributed Control Plane of SDN, we propose a proGRAmming Control (GRACE) layer as a generic solution, which provides two key features, namely, reconfigurability and reusability. Their implementations deal with aforementioned challenges, thus to achieve the consistency of the data plane states and the reusability of the service control states at the distributed controllers. This paper introduces the reconfigurability and reusability with their design goals and their impact on the programmability of DCP. We further use two popular network services, ICN (Information-Centric Networking) and CDN (Content Distribution Networks) to illustrate these concepts. NS-3 simulations and PlanetLab emulations are conducted to show the advantage of using the GRACE layer for ICN and CDN. Results show that the ICN Interest delay is reduced by 19.6% and CDN request delay is reduced by 81% in extremely harsh network conditions.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122875555","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-06-10DOI: 10.1109/ICC.2014.6883390
Dongxiao Liu, Hongwei Li, Yi Yang, Haomiao Yang
In smart grid, control center collects and aggregates users' electricity data via the smart meters. The aggregated data is also of great use for markets. To efficiently and securely distribute these data to markets, the existing schemes use Attribute-based Encryption (ABE) technique to achieve privacy preservation of sensitive data and fine-grained access control. However, the efficient attribute revocation problem has not been studied well. In this paper, leveraging the Third Party Auditor and Ciphertext-Policy ABE techniques, we propose a Multi-Authority Access Control with Efficient Attribute Revocation (MAAC-AR) scheme in smart grid. Security analysis demonstrates that MAAC-AR can achieve fine-grained access control, collusion resistance, privacy preservation and secure attribute revocation. Performance evaluation shows that MAAC-AR is more efficient compared with the existing schemes in terms of functionality as well as computation, communication and storage overhead.
{"title":"Achieving Multi-Authority Access Control with Efficient Attribute Revocation in smart grid","authors":"Dongxiao Liu, Hongwei Li, Yi Yang, Haomiao Yang","doi":"10.1109/ICC.2014.6883390","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883390","url":null,"abstract":"In smart grid, control center collects and aggregates users' electricity data via the smart meters. The aggregated data is also of great use for markets. To efficiently and securely distribute these data to markets, the existing schemes use Attribute-based Encryption (ABE) technique to achieve privacy preservation of sensitive data and fine-grained access control. However, the efficient attribute revocation problem has not been studied well. In this paper, leveraging the Third Party Auditor and Ciphertext-Policy ABE techniques, we propose a Multi-Authority Access Control with Efficient Attribute Revocation (MAAC-AR) scheme in smart grid. Security analysis demonstrates that MAAC-AR can achieve fine-grained access control, collusion resistance, privacy preservation and secure attribute revocation. Performance evaluation shows that MAAC-AR is more efficient compared with the existing schemes in terms of functionality as well as computation, communication and storage overhead.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"257 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122659770","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-06-10DOI: 10.1109/ICC.2014.6883630
K. F. Trillingsgaard, P. Popovski
Energy harvesting is becoming a viable option for powering small wireless devices. Energy for data transmission is supplied by the nature, such that when a transmission is about to take place in an arbitrary instant, the amount of available energy is a random quantity. The arrived energy is stored in a battery and transmissions are interrupted if the battery runs out of energy. We address communication in slot-based energy harvesting systems, where the transmitter communicates with ON-OFF signaling: in each slot it can either choose to transmit (ON) or stay silent (OFF). Two different models of harvesting and communication are addressed. In the first model an energy quantum can arrive, with a certain probability, in each slot. The second model is based on a frame of size F: energy arrives periodically over F slots, in batches containing a random number of energy quanta. We devise achievable strategies and compare the slot- with the frame-based model in the case of an errorless transmission channel. Additionally, for the slot-based model and channel with errors, we provide a new proof of the capacity achieved by the save-and-transmit scheme.
{"title":"Communication strategies for two models of discrete energy harvesting","authors":"K. F. Trillingsgaard, P. Popovski","doi":"10.1109/ICC.2014.6883630","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883630","url":null,"abstract":"Energy harvesting is becoming a viable option for powering small wireless devices. Energy for data transmission is supplied by the nature, such that when a transmission is about to take place in an arbitrary instant, the amount of available energy is a random quantity. The arrived energy is stored in a battery and transmissions are interrupted if the battery runs out of energy. We address communication in slot-based energy harvesting systems, where the transmitter communicates with ON-OFF signaling: in each slot it can either choose to transmit (ON) or stay silent (OFF). Two different models of harvesting and communication are addressed. In the first model an energy quantum can arrive, with a certain probability, in each slot. The second model is based on a frame of size F: energy arrives periodically over F slots, in batches containing a random number of energy quanta. We devise achievable strategies and compare the slot- with the frame-based model in the case of an errorless transmission channel. Additionally, for the slot-based model and channel with errors, we provide a new proof of the capacity achieved by the save-and-transmit scheme.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122978602","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
扫码关注我们
求助内容：
应助结果提醒方式：