Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024505
Walid Bouksani, B. A. Bensaber
We propose in this paper a security protocol based on a dynamic change of pseudonyms for privacy in Vehicular Ad hoc NETworks (VANET). Our proposal ensures privacy for the driver and his vehicle whether he is transmitter or receiver of the message. By handling all possible cases of changes in vehicle behavior during traffic, we ensure a safe and secure traffic management. We built the architecture of our solution on three essential devices designed for VANET. In three steps, the anonymity is guaranteed by our Real Initial New protocol (RIN). This latest provides a high security to vehicles.
{"title":"An efficient and dynamic pseudonyms change system for privacy in VANET","authors":"Walid Bouksani, B. A. Bensaber","doi":"10.1109/ISCC.2017.8024505","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024505","url":null,"abstract":"We propose in this paper a security protocol based on a dynamic change of pseudonyms for privacy in Vehicular Ad hoc NETworks (VANET). Our proposal ensures privacy for the driver and his vehicle whether he is transmitter or receiver of the message. By handling all possible cases of changes in vehicle behavior during traffic, we ensure a safe and secure traffic management. We built the architecture of our solution on three essential devices designed for VANET. In three steps, the anonymity is guaranteed by our Real Initial New protocol (RIN). This latest provides a high security to vehicles.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128799836","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-01DOI: 10.1109/ISCC.2017.8024567
J.L. Martinez, P. F. Rosa, Flávio de Oliveira Silva, C. Ferreira, Pedro Bispo, Daniel Corujo, R. Aguiar
Software Defined Networking (SDN) and Network Function Virtualization (NFV) are catching the attention of telecom operators. Telecom environments establish a set of Carrier Grade requirements such as high availability, high throughput and low latency. To address these challenges SDN deploys logically-centralized controllers, such as ONOS and OpenDayLight. Based on the JAIN SLEE component model, which is a Carrier Grade component already deployed at telecom operators, and the Libfluid OpenFlow driver, this work presents the CREDENCE, a carrier grade SDN controller, which in our evaluation shows that it offers a higher throughput and a lower latency when compared to ONOS, OpenDayLight, Ryu and POX.
{"title":"CREDENCE: A Carrier Grade Software Defined Networking control environment based on the JAIN SLEE component model","authors":"J.L. Martinez, P. F. Rosa, Flávio de Oliveira Silva, C. Ferreira, Pedro Bispo, Daniel Corujo, R. Aguiar","doi":"10.1109/ISCC.2017.8024567","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024567","url":null,"abstract":"Software Defined Networking (SDN) and Network Function Virtualization (NFV) are catching the attention of telecom operators. Telecom environments establish a set of Carrier Grade requirements such as high availability, high throughput and low latency. To address these challenges SDN deploys logically-centralized controllers, such as ONOS and OpenDayLight. Based on the JAIN SLEE component model, which is a Carrier Grade component already deployed at telecom operators, and the Libfluid OpenFlow driver, this work presents the CREDENCE, a carrier grade SDN controller, which in our evaluation shows that it offers a higher throughput and a lower latency when compared to ONOS, OpenDayLight, Ryu and POX.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122213419","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-01DOI: 10.1109/ISCC.2017.8024690
Z. Mao, Jing Ma, Yuming Jiang, Bin Yao
WiFi Direct is a recent device-to-device communication technology standardized by the WiFi Alliance. Its increasing availability on popular mobile systems (e.g. Android) presents a unique opportunity for developers to implement mobile social networks (MSNs), a new paradigm that facilitates data dissemination without Internet access by leveraging human mobility and short-range communication technologies. Since WiFi Direct is not originally designed for such applications, it is significant to learn its performance in practice. In this paper, we investigate goodput and fairness of WiFi Direct for data dissemination in MSNs. To this end, we develop an MSN application and conduct three sets of experiments on a testbed comprising several Android devices. Experimental results show that the data loads and mobility of nodes greatly impact the goodput and fairness.
{"title":"Performance evaluation of WiFi Direct for data dissemination in mobile social networks","authors":"Z. Mao, Jing Ma, Yuming Jiang, Bin Yao","doi":"10.1109/ISCC.2017.8024690","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024690","url":null,"abstract":"WiFi Direct is a recent device-to-device communication technology standardized by the WiFi Alliance. Its increasing availability on popular mobile systems (e.g. Android) presents a unique opportunity for developers to implement mobile social networks (MSNs), a new paradigm that facilitates data dissemination without Internet access by leveraging human mobility and short-range communication technologies. Since WiFi Direct is not originally designed for such applications, it is significant to learn its performance in practice. In this paper, we investigate goodput and fairness of WiFi Direct for data dissemination in MSNs. To this end, we develop an MSN application and conduct three sets of experiments on a testbed comprising several Android devices. Experimental results show that the data loads and mobility of nodes greatly impact the goodput and fairness.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130751083","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-01DOI: 10.1109/ISCC.2017.8024709
M. Backhaus, G. Schäfer
Appropriate attacker models are generally known to be a fundamental prerequisite for any security evaluation of complex systems or networks. This paper deals with worst-case attacker models targeted to cause maximum damage in an overlay network by deliberately disturbing links within the underlying transport network topology. The flexibility of rerouting in underlay and overlay networks leads to complex dynamics in the topology of such two-layered overlay networks, which needs to be appropriately considered in attacker modeling. In this article, we present two worst-case attacker models based on the Minimum Overlay Cut, which either try to maximize network damage with a given number of possible outages, or aim at a given level of damage with minimal effort. For this, we developed a novel Integer Linear Programming (ILP) formulation for the Minimum Cut, that uses less binary variables than existing approaches, and is therefore better suited to deal with larger networks as well as multiple demands. An evaluation of a typical VPN overlay scenario shows that our worst-case models give significantly more realistic assessments of potential damages than two alternatively evaluated random and greedy strategies.
{"title":"Worst-case attacker models for two-layered networks based on the Minimum Overlay Cut","authors":"M. Backhaus, G. Schäfer","doi":"10.1109/ISCC.2017.8024709","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024709","url":null,"abstract":"Appropriate attacker models are generally known to be a fundamental prerequisite for any security evaluation of complex systems or networks. This paper deals with worst-case attacker models targeted to cause maximum damage in an overlay network by deliberately disturbing links within the underlying transport network topology. The flexibility of rerouting in underlay and overlay networks leads to complex dynamics in the topology of such two-layered overlay networks, which needs to be appropriately considered in attacker modeling. In this article, we present two worst-case attacker models based on the Minimum Overlay Cut, which either try to maximize network damage with a given number of possible outages, or aim at a given level of damage with minimal effort. For this, we developed a novel Integer Linear Programming (ILP) formulation for the Minimum Cut, that uses less binary variables than existing approaches, and is therefore better suited to deal with larger networks as well as multiple demands. An evaluation of a typical VPN overlay scenario shows that our worst-case models give significantly more realistic assessments of potential damages than two alternatively evaluated random and greedy strategies.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131269134","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-01DOI: 10.1109/ISCC.2017.8024559
Celso A. R. L. Brennand, A. Boukerche, R. Meneguette, L. Villas
An increase of vehicles in a city without an efficient infrastructure of traffic management can cause damages not only financial but also environmental and social. In order to support urban traffic system to relieve the traffic congestion and the damage caused by congestion of vehicles, in this paper, we propose a mechanism for Intelligent Transport Systems named FOg RoutE VEhiculaR (FOREVER), in order to assist the traffic management in Vehicular Networks (VANET). For achieving this, FOREVER will detect and recommend an alternative route for the vehicles to avoid previous congestion. FOREVER is based on FOG computing paradigm that aims of to compute and modify the route of the vehicle to avoid the formation of congestion. Thus, the results show that FOREVER had a reduction about 7.9% of the CO2 emissions, 8.3% the stop time and 7.6% of the trip time.
{"title":"A novel urban traffic management mechanism based on FOG","authors":"Celso A. R. L. Brennand, A. Boukerche, R. Meneguette, L. Villas","doi":"10.1109/ISCC.2017.8024559","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024559","url":null,"abstract":"An increase of vehicles in a city without an efficient infrastructure of traffic management can cause damages not only financial but also environmental and social. In order to support urban traffic system to relieve the traffic congestion and the damage caused by congestion of vehicles, in this paper, we propose a mechanism for Intelligent Transport Systems named FOg RoutE VEhiculaR (FOREVER), in order to assist the traffic management in Vehicular Networks (VANET). For achieving this, FOREVER will detect and recommend an alternative route for the vehicles to avoid previous congestion. FOREVER is based on FOG computing paradigm that aims of to compute and modify the route of the vehicle to avoid the formation of congestion. Thus, the results show that FOREVER had a reduction about 7.9% of the CO2 emissions, 8.3% the stop time and 7.6% of the trip time.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132033616","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-01DOI: 10.1109/ISCC.2017.8024504
Tawfiq Nebbou, H. Fouchal, M. Lehsaini, Marwane Ayaida
Routing messages over vehicular ad hoc networks (VANETs) is usually achieved through geographic routing protocols. In such networks, the vehicle dynamics causes rapid changes on the vehicle density and the communication links. In order to be efficient to route messages from a vehicle to another, we need to locate each node (its position), this is achieved by a location service. This study works on simple location service adapted for unicast routing over VANETs in city environment. This service is able to find a route from a route from a source to the destination and this route is the one passing through the most dense path‥ We have implemented our proposal on the OMNET++ simulator and we have conducted extensive simulations in different scenarios to evaluate its scalability and robustness against frequent topology changes. The results obtained have shown that our proposed protocol provides significant improvements in terms of packet delivery ratio, end-to-end delay and overhead compared to EGyTAR protocol.
{"title":"A cooperative location service for VANETs","authors":"Tawfiq Nebbou, H. Fouchal, M. Lehsaini, Marwane Ayaida","doi":"10.1109/ISCC.2017.8024504","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024504","url":null,"abstract":"Routing messages over vehicular ad hoc networks (VANETs) is usually achieved through geographic routing protocols. In such networks, the vehicle dynamics causes rapid changes on the vehicle density and the communication links. In order to be efficient to route messages from a vehicle to another, we need to locate each node (its position), this is achieved by a location service. This study works on simple location service adapted for unicast routing over VANETs in city environment. This service is able to find a route from a route from a source to the destination and this route is the one passing through the most dense path‥ We have implemented our proposal on the OMNET++ simulator and we have conducted extensive simulations in different scenarios to evaluate its scalability and robustness against frequent topology changes. The results obtained have shown that our proposed protocol provides significant improvements in terms of packet delivery ratio, end-to-end delay and overhead compared to EGyTAR protocol.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134120688","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-01DOI: 10.1109/ISCC.2017.8024675
Limin Li, Yahui Yang, Zhonghai Wu
Cloud storage is a service provided by cloud service provider (CSP). More and more individuals and organizations accept the scheme and outsource their data to CSP seeking to reduce local storage burden. Since the outsourced files are no longer under the data owners' direct control and CSP is not trustworthy, it is necessary for data owners to check the integrity of their files outsourced to CSP. To address this crucial problem, some provable data possession (PDP) protocols have been presented. In order to obtain higher availability, storing multiple replicas is a common strategy in cloud storage. Most recent researches on multiple-replica provable data possession (MR-PDP) use homomorphic linear authenticators (HLAs) to generate aggregated tags for the blocks at the same indices in each replica, but it cannot verify single replica to identify the corrupted replicas. In this paper, we proposed a novel multiple replica provable data possession scheme, named FMR-PDP. In FMR-PDP, we compute tags based on vector dot product instead of expensive group exponentiation operations, and only generate one tag for all blocks at the same indices in each replica. Our FMR-PDP scheme supports a flexible data possession verification, which means the data owner can check any number of replicas in a verification. In addition, we make a comprehensive performance analysis, which shows that our proposed scheme is flexible and efficient.
{"title":"FMR-PDP: Flexible multiple-replica provable data possession in cloud storage","authors":"Limin Li, Yahui Yang, Zhonghai Wu","doi":"10.1109/ISCC.2017.8024675","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024675","url":null,"abstract":"Cloud storage is a service provided by cloud service provider (CSP). More and more individuals and organizations accept the scheme and outsource their data to CSP seeking to reduce local storage burden. Since the outsourced files are no longer under the data owners' direct control and CSP is not trustworthy, it is necessary for data owners to check the integrity of their files outsourced to CSP. To address this crucial problem, some provable data possession (PDP) protocols have been presented. In order to obtain higher availability, storing multiple replicas is a common strategy in cloud storage. Most recent researches on multiple-replica provable data possession (MR-PDP) use homomorphic linear authenticators (HLAs) to generate aggregated tags for the blocks at the same indices in each replica, but it cannot verify single replica to identify the corrupted replicas. In this paper, we proposed a novel multiple replica provable data possession scheme, named FMR-PDP. In FMR-PDP, we compute tags based on vector dot product instead of expensive group exponentiation operations, and only generate one tag for all blocks at the same indices in each replica. Our FMR-PDP scheme supports a flexible data possession verification, which means the data owner can check any number of replicas in a verification. In addition, we make a comprehensive performance analysis, which shows that our proposed scheme is flexible and efficient.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132954915","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-01DOI: 10.1109/ISCC.2017.8024609
Panagiotis Vamvakas, Eirini-Eleni Tsiropoulou, S. Papavassiliou, J. Baras
In this paper, the problem of joint users' uplink transmission power and rate allocation in NOMA wireless networks is studied, under the scenario that each user is simultaneously requesting multiple services. Each user is associated with a two-variable utility function that represents his satisfaction from his allocated resources (i.e., power and rate). In order to appropriately reflect the combined needs of the user for bundling different types of services under the same common umbrella, user's utility function consists of two parts while different percentages are adopted by each user for each part in order to express his need for real and non-real time services. The joint resource allocation problem is directly confronted as a two-variable optimization problem and formulated as a non-cooperative game. The theory of S-modular multivariable games is adopted towards determining the Nash equilibrium point of the game. A distributed, iterative and low complexity algorithm for computing game's Nash equilibrium is introduced, while updating user's uplink transmission power and rate at the same step. Detailed numerical results exhibit the ability of the proposed framework to simultaneously satisfy diverse multiple services requested by the same user.
{"title":"Optimization and resource management in NOMA wireless networks supporting real and non-real time service bundling","authors":"Panagiotis Vamvakas, Eirini-Eleni Tsiropoulou, S. Papavassiliou, J. Baras","doi":"10.1109/ISCC.2017.8024609","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024609","url":null,"abstract":"In this paper, the problem of joint users' uplink transmission power and rate allocation in NOMA wireless networks is studied, under the scenario that each user is simultaneously requesting multiple services. Each user is associated with a two-variable utility function that represents his satisfaction from his allocated resources (i.e., power and rate). In order to appropriately reflect the combined needs of the user for bundling different types of services under the same common umbrella, user's utility function consists of two parts while different percentages are adopted by each user for each part in order to express his need for real and non-real time services. The joint resource allocation problem is directly confronted as a two-variable optimization problem and formulated as a non-cooperative game. The theory of S-modular multivariable games is adopted towards determining the Nash equilibrium point of the game. A distributed, iterative and low complexity algorithm for computing game's Nash equilibrium is introduced, while updating user's uplink transmission power and rate at the same step. Detailed numerical results exhibit the ability of the proposed framework to simultaneously satisfy diverse multiple services requested by the same user.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133375724","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-01DOI: 10.1109/ISCC.2017.8024583
Yue Li, P. A. Frangoudis, Y. H. Aoul, P. Bertin
We focus on QoE-optimized video delivery in a wireless heterogeneous network setting, where users equipped with multi-interface devices access a Dynamic Adaptive Streaming over HTTP (DASH) video service. We provide an Integer Linear Programming (ILP) formulation for the problem of optimal joint video quality and network interface selection and a heuristic algorithm to solve it, shown via simulation and testbed experiments to achieve near-optimal performance in terms of Quality of Experience (QoE), with reduced execution time. We further design a video delivery architecture based on the emerging Mobile Edge Computing (MEC) standard, where our video quality and network selection functionality is executed as a MEC application. Notably, our architecture transparently operates with standard DASH clients.
{"title":"A Mobile Edge Computing-assisted video delivery architecture for wireless heterogeneous networks","authors":"Yue Li, P. A. Frangoudis, Y. H. Aoul, P. Bertin","doi":"10.1109/ISCC.2017.8024583","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024583","url":null,"abstract":"We focus on QoE-optimized video delivery in a wireless heterogeneous network setting, where users equipped with multi-interface devices access a Dynamic Adaptive Streaming over HTTP (DASH) video service. We provide an Integer Linear Programming (ILP) formulation for the problem of optimal joint video quality and network interface selection and a heuristic algorithm to solve it, shown via simulation and testbed experiments to achieve near-optimal performance in terms of Quality of Experience (QoE), with reduced execution time. We further design a video delivery architecture based on the emerging Mobile Edge Computing (MEC) standard, where our video quality and network selection functionality is executed as a MEC application. Notably, our architecture transparently operates with standard DASH clients.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125617784","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-01DOI: 10.1109/ISCC.2017.8024574
Andre Riker, M. Curado, E. Monteiro
With the recent emergence of energy-harvesting technologies in wireless devices, new challenges have to be addressed by Machine-to-Machine (M2M) communication protocols. The Neutral Operation problem is a relevant problem that seeks to maintain the energy reserve of a node in a level that minimizes energy depletion and maximizes the usage of the harvested-energy. However, neutral operation in a multihop network is a more complex issue, since the nodes lack full knowledge of the network and the nodes have diverse harvesting and consumption profiles. A simplification of the Neutral Operation problem is proposed, named Neutral Operation of the Minimum Energy Node, in which the node with the lowest amount of energy determines the operation of the whole network. This paper proposes a battery-aware solution, called Routing and Aggregation for Minimum Energy (RAME), that performs data-aggregation on the traffic load according to the minimum energy reserve on the path. As part the proposed solution, a kinetic battery model has been developed to provide non-linear battery level estimation. Besides, the Routing Protocol for Low-Power and Lossy Networks (RPL) was enhanced to use the kinetic battery estimation as metric for parent node selection and to find periodically the minimum energy reserve on the available paths. The performance evaluation of the proposed mechanism using Contiki shows the benefits of RAME in comparison to the M2M standard protocols.
{"title":"Neutral Operation of the Minimum Energy Node in energy-harvesting environments","authors":"Andre Riker, M. Curado, E. Monteiro","doi":"10.1109/ISCC.2017.8024574","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024574","url":null,"abstract":"With the recent emergence of energy-harvesting technologies in wireless devices, new challenges have to be addressed by Machine-to-Machine (M2M) communication protocols. The Neutral Operation problem is a relevant problem that seeks to maintain the energy reserve of a node in a level that minimizes energy depletion and maximizes the usage of the harvested-energy. However, neutral operation in a multihop network is a more complex issue, since the nodes lack full knowledge of the network and the nodes have diverse harvesting and consumption profiles. A simplification of the Neutral Operation problem is proposed, named Neutral Operation of the Minimum Energy Node, in which the node with the lowest amount of energy determines the operation of the whole network. This paper proposes a battery-aware solution, called Routing and Aggregation for Minimum Energy (RAME), that performs data-aggregation on the traffic load according to the minimum energy reserve on the path. As part the proposed solution, a kinetic battery model has been developed to provide non-linear battery level estimation. Besides, the Routing Protocol for Low-Power and Lossy Networks (RPL) was enhanced to use the kinetic battery estimation as metric for parent node selection and to find periodically the minimum energy reserve on the available paths. The performance evaluation of the proposed mechanism using Contiki shows the benefits of RAME in comparison to the M2M standard protocols.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113994525","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
扫码关注我们
求助内容：
应助结果提醒方式：