Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440585
Z. Abduljabbar, Hai Jin, A. Yassin, Z. Hussien, M. Hussain, Salah H. Abbdal, Deqing Zou
A number of image/message document authentication and integrity schemes have been conducted to recognize any modification in the exchange of documents between two entities (sender and receiver) within a cloud environment. Existing solutions are based on combining key-based hash function with traditional factors (steganography, smart-card, timestamp). However, none of the proposed schemes appear to be sufficiently designed as a secure scheme to prevent common forms of attack such as replay, forgery, stolen verifier, brute force, and insider attacks. In this paper, we propose a scheme to ensure message/image document integrity for each user's login by providing one-time biometric message/image authentication code called MACLESS, which is a summation of combining the key-based hash function (MAC-SHA-1) of a message/image document and the one-time bio-key. Thereafter, MACLESS is hidden in a cover image based steganography anonymity. The proposed scheme has several important security attributes, such as phase key agreement, users' one-time bio-key, and one-time authentication code is valid only for one user's login session. Finally, security analysis and experimental results demonstrate and prove the invulnerability and efficiency of the proposed scheme.
{"title":"Robust scheme to protect authentication code of message/image documents in cloud computing","authors":"Z. Abduljabbar, Hai Jin, A. Yassin, Z. Hussien, M. Hussain, Salah H. Abbdal, Deqing Zou","doi":"10.1109/ICCNC.2016.7440585","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440585","url":null,"abstract":"A number of image/message document authentication and integrity schemes have been conducted to recognize any modification in the exchange of documents between two entities (sender and receiver) within a cloud environment. Existing solutions are based on combining key-based hash function with traditional factors (steganography, smart-card, timestamp). However, none of the proposed schemes appear to be sufficiently designed as a secure scheme to prevent common forms of attack such as replay, forgery, stolen verifier, brute force, and insider attacks. In this paper, we propose a scheme to ensure message/image document integrity for each user's login by providing one-time biometric message/image authentication code called MACLESS, which is a summation of combining the key-based hash function (MAC-SHA-1) of a message/image document and the one-time bio-key. Thereafter, MACLESS is hidden in a cover image based steganography anonymity. The proposed scheme has several important security attributes, such as phase key agreement, users' one-time bio-key, and one-time authentication code is valid only for one user's login session. Finally, security analysis and experimental results demonstrate and prove the invulnerability and efficiency of the proposed scheme.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130376156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440548
C. Palazzi, Armir Bujari, S. Mirri
Cloud-based entertainment is becoming a hot topic for researchers and practitioners. In this context, thin client or cloud based gaming promise to attract users with the possibility to dematerialize the console and let the user play any possible game for any platform through the Internet. Basically, the computational burden is left to the cloud while the user enjoys a fat video feed accessed through her/his thin client via the shared wireless gateway. Unfortunately, this model of interaction also raises new complex technical issues that requires specific networking solutions. In this short paper we aim at addressing the heterogeneous flow coexistence problem at the home wireless gateway. We propose a solution based on a TCP Vegas-like congestion control algorithm deployed on top of the home gateway. Our solution works out of the box with the standard protocols at server, router and client level, thereby making deployment straightforward.
{"title":"Reducing queuing delays through VoAP","authors":"C. Palazzi, Armir Bujari, S. Mirri","doi":"10.1109/ICCNC.2016.7440548","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440548","url":null,"abstract":"Cloud-based entertainment is becoming a hot topic for researchers and practitioners. In this context, thin client or cloud based gaming promise to attract users with the possibility to dematerialize the console and let the user play any possible game for any platform through the Internet. Basically, the computational burden is left to the cloud while the user enjoys a fat video feed accessed through her/his thin client via the shared wireless gateway. Unfortunately, this model of interaction also raises new complex technical issues that requires specific networking solutions. In this short paper we aim at addressing the heterogeneous flow coexistence problem at the home wireless gateway. We propose a solution based on a TCP Vegas-like congestion control algorithm deployed on top of the home gateway. Our solution works out of the box with the standard protocols at server, router and client level, thereby making deployment straightforward.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130834486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440559
Xin Liu, Junhua Yan
We consider an energy-efficient multichannel cognitive radio (CR) where the secondary user (SU) can harvest the signal energy from the primary user (PU). The goal is to determine an optimal joint spectrum sensing and transmission power allocation that maximizes the average throughput of the multichannel SU subject to the constraints of sensing probabilities, interference power and total transmission power. The allocation scheme is formulated as a joint optimization problem, whose optimal solution is obtained through the joint optimization algorithm based on alternating direction optimization. Analytical and numerical results show that the proposed energy-efficient CR outperforms the traditional CR without energy harvesting and the transmission power of the energy-efficient CR improves both with the increasing of the spectrum sensing time and the presence probability of the PU.
{"title":"Optimal energy-efficient multichannel cognitive radio with primary energy harvesting","authors":"Xin Liu, Junhua Yan","doi":"10.1109/ICCNC.2016.7440559","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440559","url":null,"abstract":"We consider an energy-efficient multichannel cognitive radio (CR) where the secondary user (SU) can harvest the signal energy from the primary user (PU). The goal is to determine an optimal joint spectrum sensing and transmission power allocation that maximizes the average throughput of the multichannel SU subject to the constraints of sensing probabilities, interference power and total transmission power. The allocation scheme is formulated as a joint optimization problem, whose optimal solution is obtained through the joint optimization algorithm based on alternating direction optimization. Analytical and numerical results show that the proposed energy-efficient CR outperforms the traditional CR without energy harvesting and the transmission power of the energy-efficient CR improves both with the increasing of the spectrum sensing time and the presence probability of the PU.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125984907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440618
Genya Ishigaki, N. Shinomiya
This paper proposes an algorithm to determine a controller location on a given network considering burdens of all communication nodes. The burden is defined by extending stress centrality, which indicates a load of each node based on the number of edge disjoint paths. In order to analyze characteristics of the proposed placement algorithm, our simulations compare it with other placement algorithms and the theoretically optimum values in terms of node burdens, latency, survivability and path stability.
{"title":"Controller placement algorithm to alleviate burdens on communication nodes","authors":"Genya Ishigaki, N. Shinomiya","doi":"10.1109/ICCNC.2016.7440618","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440618","url":null,"abstract":"This paper proposes an algorithm to determine a controller location on a given network considering burdens of all communication nodes. The burden is defined by extending stress centrality, which indicates a load of each node based on the number of edge disjoint paths. In order to analyze characteristics of the proposed placement algorithm, our simulations compare it with other placement algorithms and the theoretically optimum values in terms of node burdens, latency, survivability and path stability.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126285662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440605
E. Weyulu, G. Lusilao-Zodi
Wireless networks have dynamic transmission properties as the wireless channel conditions randomly change over time due to several environmental factors. When transmitting real-time applications such as video, the dynamic properties of wireless networks can have detrimental effects on the quality of the video delivered to a user. Many Quality of Service (QoS) guarantee techniques to improve video quality in wireless networks are available. However, these mainly focus on traffic shaping based on bandwidth requirements and prioritization and do not take into account the effects a changing wireless channel might have on the transmitted video. With an increasing amount of video applications being transmitted over wireless networks, alternative methods to provide QoS guarantees should be investigated. This research proposes an adaptive Forward Error Control (FEC) mechanism that dynamically adjusts the number of error control packets based on the traffic load in the network and the state of the wireless channel. When the wireless channel is bad, such as during a rain storm, the proposed mechanism reduces the amount of FEC packets added thereby reducing computational overhead in the network. This enables the receiver to recover the information sent by the transmitter faster with fewer errors than it otherwise would. Simulation results using video trace files show an improvement over existing solutions in terms of the number of FEC packets added while overall the user-perceived quality of the video streaming session is maintained at the same level, even when the network is experiencing a high Packet Error Rate (PER).
{"title":"A dynamic forward error control scheme for video streaming over wireless networks","authors":"E. Weyulu, G. Lusilao-Zodi","doi":"10.1109/ICCNC.2016.7440605","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440605","url":null,"abstract":"Wireless networks have dynamic transmission properties as the wireless channel conditions randomly change over time due to several environmental factors. When transmitting real-time applications such as video, the dynamic properties of wireless networks can have detrimental effects on the quality of the video delivered to a user. Many Quality of Service (QoS) guarantee techniques to improve video quality in wireless networks are available. However, these mainly focus on traffic shaping based on bandwidth requirements and prioritization and do not take into account the effects a changing wireless channel might have on the transmitted video. With an increasing amount of video applications being transmitted over wireless networks, alternative methods to provide QoS guarantees should be investigated. This research proposes an adaptive Forward Error Control (FEC) mechanism that dynamically adjusts the number of error control packets based on the traffic load in the network and the state of the wireless channel. When the wireless channel is bad, such as during a rain storm, the proposed mechanism reduces the amount of FEC packets added thereby reducing computational overhead in the network. This enables the receiver to recover the information sent by the transmitter faster with fewer errors than it otherwise would. Simulation results using video trace files show an improvement over existing solutions in terms of the number of FEC packets added while overall the user-perceived quality of the video streaming session is maintained at the same level, even when the network is experiencing a high Packet Error Rate (PER).","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"30 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120965452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440651
Wenjia Li, Xianshu Zhu
Body area networks (BAN) has recently emerged as an important enabling technology to support various telehealth applications. Because of its unique application domain, it is critical to ensure the secure and reliable gathering of patient's physiological signs. However, most of the existing security solutions for BANs focus on using encryption techniques to secure the data transmission or provide authentication. On the other hand, it is well understood that BANs are also extremely vulnerable to various malicious attacks, which have not attracted abundant research attention so far. In this paper, an attack-resilient malicious node detection scheme (BAN-Trust) is proposed for wireless body area networks that is able to detect and cope with malicious attacks in BANs. The effectiveness and efficiency of the proposed BAN-Trust scheme is validated through extensive experiments.
{"title":"BAN-trust: An attack-resilient malicious node detection scheme for body area networks","authors":"Wenjia Li, Xianshu Zhu","doi":"10.1109/ICCNC.2016.7440651","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440651","url":null,"abstract":"Body area networks (BAN) has recently emerged as an important enabling technology to support various telehealth applications. Because of its unique application domain, it is critical to ensure the secure and reliable gathering of patient's physiological signs. However, most of the existing security solutions for BANs focus on using encryption techniques to secure the data transmission or provide authentication. On the other hand, it is well understood that BANs are also extremely vulnerable to various malicious attacks, which have not attracted abundant research attention so far. In this paper, an attack-resilient malicious node detection scheme (BAN-Trust) is proposed for wireless body area networks that is able to detect and cope with malicious attacks in BANs. The effectiveness and efficiency of the proposed BAN-Trust scheme is validated through extensive experiments.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131713758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440722
Xianfeng Li, Yuanxin Lin, Wen J. Li
Ternary Content Addressable Memory (TCAM) is the de-facto standard device used for high-speed packet classification. Despite its capability for line-speed queries, it is very power hungry and area inefficient The latest TCAM devices by leading vendors come with an power saving mechanism where a subset of its TCAM blocks can be selectively activated. Recent research efforts exploit this feature to reduce power consumption with pre-classification steps. However, the state-of-the-art technique achieves power savings at the expense of poor utilization of TCAM capacity, and the potential of power reduction is not fully exploited in many cases. In this paper, we propose GreenTCAM, an optimized two-stage design for TCAM-based packet classification. Based on common characteristics of rule sets, our design is able to group rules more compactly into TCAM blocks, and activates a minimum subset of these blocks for each incoming packet. Experimental results show that our design achieves a 93.6% power reduction with a TCAM storage overhead of only 5.6% on average.
{"title":"GreenTCAM: A memory- and energy-efficient TCAM-based packet classification","authors":"Xianfeng Li, Yuanxin Lin, Wen J. Li","doi":"10.1109/ICCNC.2016.7440722","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440722","url":null,"abstract":"Ternary Content Addressable Memory (TCAM) is the de-facto standard device used for high-speed packet classification. Despite its capability for line-speed queries, it is very power hungry and area inefficient The latest TCAM devices by leading vendors come with an power saving mechanism where a subset of its TCAM blocks can be selectively activated. Recent research efforts exploit this feature to reduce power consumption with pre-classification steps. However, the state-of-the-art technique achieves power savings at the expense of poor utilization of TCAM capacity, and the potential of power reduction is not fully exploited in many cases. In this paper, we propose GreenTCAM, an optimized two-stage design for TCAM-based packet classification. Based on common characteristics of rule sets, our design is able to group rules more compactly into TCAM blocks, and activates a minimum subset of these blocks for each incoming packet. Experimental results show that our design achieves a 93.6% power reduction with a TCAM storage overhead of only 5.6% on average.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115322056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440545
Catia Prandi, P. Salomoni, M. Roccetti, Valentina Nisi, N. Nunes
In this paper we present results gathered from field trials while using a pervasive game, called Geo-Zombie. It intermixes reality with virtual zombies, providing a game experience to be lived in the urban environment. Geo-Zombie is designed for a specific goal: engaging people in collecting geo-referenced data about urban accessibility. The game has been designed with the aim to involve a large number of players/volunteers in the activity of signaling urban barriers while walking. To get ammo to react to a zombie attack, in fact, players can sense/map (crowdsensing) urban barriers and facilities and transmit those information back to an operative center (crowdsourcing). With the aim to assess the efficacy of Geo-Zombie, we conducted real experiments contrasting three different mobile apps, specifically designed to: i) simply collect urban information without providing any gaming experience (Basic), ii) reward volunteers that participate in the crowdsourcing activity (Reward), and iii) provide fun and entertainment to players who contribute (Geo-Zombie). We here provide results along two different perspectives: a quantitative one (e.g., number of collected data and similar) and a qualitative one (i.e., the players' experience). These results confirm the feasibility and suitability of our approach and stimulate interesting discussions.
{"title":"Walking with Geo-Zombie: A pervasive game to engage people in urban crowdsourcing","authors":"Catia Prandi, P. Salomoni, M. Roccetti, Valentina Nisi, N. Nunes","doi":"10.1109/ICCNC.2016.7440545","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440545","url":null,"abstract":"In this paper we present results gathered from field trials while using a pervasive game, called Geo-Zombie. It intermixes reality with virtual zombies, providing a game experience to be lived in the urban environment. Geo-Zombie is designed for a specific goal: engaging people in collecting geo-referenced data about urban accessibility. The game has been designed with the aim to involve a large number of players/volunteers in the activity of signaling urban barriers while walking. To get ammo to react to a zombie attack, in fact, players can sense/map (crowdsensing) urban barriers and facilities and transmit those information back to an operative center (crowdsourcing). With the aim to assess the efficacy of Geo-Zombie, we conducted real experiments contrasting three different mobile apps, specifically designed to: i) simply collect urban information without providing any gaming experience (Basic), ii) reward volunteers that participate in the crowdsourcing activity (Reward), and iii) provide fun and entertainment to players who contribute (Geo-Zombie). We here provide results along two different perspectives: a quantitative one (e.g., number of collected data and similar) and a qualitative one (i.e., the players' experience). These results confirm the feasibility and suitability of our approach and stimulate interesting discussions.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132216243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440588
A. Yazidi, H. Hammer, A. Bai, P. Engelstad
With the proliferation of threats of leakage of sensitive information such as military classified documents, information guards have recently gained increased interest. An information guard is merely a filter than controls the content of the exchanged information between two domains where one of them has a higher confidentiality level than the other one. The main role of an information guard is to block leakage of the sensitive information from the higher confidentiality domain to the lower confidentiality domain. An example of a higher confidentiality domain is a military network while a subcontractor network is an example of a lower confidentiality domain. The common practice is to use an automatic information guard based on predefined list of words that is called "dirty word list" in order to decide the security level of a document and consequently release it to the lower confidentially domain or block it. Traditional information guards are configured manually based on the notion of "Dirty Lists". The classification logic of traditional information guards uses the occurrence of words from the "Dirty Lists". In this paper, we advocate the use of machine learning as a corner stone for building advanced information guards. Machine learning can also be used as a supplement to the decision obtained based on "Dirty Lists" classification. Machine learning has hardly been analysed for this problem, and the analysis on topical classification presented here provides new knowledge and a basis for further work within this area. Ten different machine learning algorithms were applied on real life data from a military context. Presented results are promising and demonstrates that machine learning can become a useful tool to assist humans in determining the appropriate security label of an information object.
{"title":"On the feasibility of machine learning as a tool for automatic security classification: A position paper","authors":"A. Yazidi, H. Hammer, A. Bai, P. Engelstad","doi":"10.1109/ICCNC.2016.7440588","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440588","url":null,"abstract":"With the proliferation of threats of leakage of sensitive information such as military classified documents, information guards have recently gained increased interest. An information guard is merely a filter than controls the content of the exchanged information between two domains where one of them has a higher confidentiality level than the other one. The main role of an information guard is to block leakage of the sensitive information from the higher confidentiality domain to the lower confidentiality domain. An example of a higher confidentiality domain is a military network while a subcontractor network is an example of a lower confidentiality domain. The common practice is to use an automatic information guard based on predefined list of words that is called \"dirty word list\" in order to decide the security level of a document and consequently release it to the lower confidentially domain or block it. Traditional information guards are configured manually based on the notion of \"Dirty Lists\". The classification logic of traditional information guards uses the occurrence of words from the \"Dirty Lists\". In this paper, we advocate the use of machine learning as a corner stone for building advanced information guards. Machine learning can also be used as a supplement to the decision obtained based on \"Dirty Lists\" classification. Machine learning has hardly been analysed for this problem, and the analysis on topical classification presented here provides new knowledge and a basis for further work within this area. Ten different machine learning algorithms were applied on real life data from a military context. Presented results are promising and demonstrates that machine learning can become a useful tool to assist humans in determining the appropriate security label of an information object.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123749793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-10DOI: 10.1109/ICCNC.2016.7440720
Alessandro Biason, M. Zorzi
Energy Harvesting allows the devices in a Wireless Sensor Network to recharge their batteries through environmental energy sources. While in the literature the main focus is on devices with ideal batteries, in reality several inefficiencies have to be considered to correctly design the operating regimes of an Energy Harvesting Device (EHD). In this work we describe how the throughput optimization problem changes under real battery constraints in an EHD. In particular, we consider imperfect knowledge of the state of charge of the battery and storage inefficiencies, i.e., part of the harvested energy is wasted in the battery recharging process. We formulate the problem as a Markov Decision Process, basing our model on some realistic observations about transmission, consumption and harvesting power. We find the performance upper bound with a real battery and numerically discuss the novelty introduced by the real battery effects. We show that using the old policies obtained without considering the real battery effects is strongly suboptimal and may even result in zero throughput.
{"title":"On the effects of battery imperfections in an energy harvesting device","authors":"Alessandro Biason, M. Zorzi","doi":"10.1109/ICCNC.2016.7440720","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440720","url":null,"abstract":"Energy Harvesting allows the devices in a Wireless Sensor Network to recharge their batteries through environmental energy sources. While in the literature the main focus is on devices with ideal batteries, in reality several inefficiencies have to be considered to correctly design the operating regimes of an Energy Harvesting Device (EHD). In this work we describe how the throughput optimization problem changes under real battery constraints in an EHD. In particular, we consider imperfect knowledge of the state of charge of the battery and storage inefficiencies, i.e., part of the harvested energy is wasted in the battery recharging process. We formulate the problem as a Markov Decision Process, basing our model on some realistic observations about transmission, consumption and harvesting power. We find the performance upper bound with a real battery and numerically discuss the novelty introduced by the real battery effects. We show that using the old policies obtained without considering the real battery effects is strongly suboptimal and may even result in zero throughput.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132394398","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
扫码关注我们
求助内容：
应助结果提醒方式：