Moussa Aboubakar, Mounir Kellil, A. Bouabdallah, P. Roux
Designing scalable and energy-efficient routing protocols for IoT low power networks is a particularly challenging problem. The IETF ROLL Working Group has defined and standardized an IPv6 routing protocol for IoT low power networks called RPL (IPv6 Routing Protocol for Low-Power and Lossy Networks) [1]. This protocol builds and maintains dynamic routes among network devices based on various objective functions (OFs) that exploit different network metrics for parent node selection (e.g., ETX-based [2], Energy-based [3]), etc.). With such OFs, RPL organizes the network topology as a Destination Oriented Directed Acyclic Graph (DODAG). However, the performance of RPL may be affected by frequent network topology changes, which may be caused by different factors like node battery depletion, link quality degradation, etc. Indeed, in such situations, the OF functions do not guarantee optimal maintenance of the RPL tree. To address this issue, this paper describes how Supervised Learning can be leveraged to improve RPL performance and energy efficiency by mitigating RPL DODAG instability when the network conditions, used by the RPL’s OF functions, change frequently. We use an offline supervised learning to provide the optimal value of the transmission range (the maximal distance to which a node can send its data to another one) that mitigates the instability of the RPL network, and hence minimizes the energy consumption. The preliminary simulation results show that our proposal can improve network performance and increase network lifetime.
{"title":"Toward Intelligent Reconfiguration of RPL Networks using Supervised Learning","authors":"Moussa Aboubakar, Mounir Kellil, A. Bouabdallah, P. Roux","doi":"10.1109/WD.2019.8734236","DOIUrl":"https://doi.org/10.1109/WD.2019.8734236","url":null,"abstract":"Designing scalable and energy-efficient routing protocols for IoT low power networks is a particularly challenging problem. The IETF ROLL Working Group has defined and standardized an IPv6 routing protocol for IoT low power networks called RPL (IPv6 Routing Protocol for Low-Power and Lossy Networks) [1]. This protocol builds and maintains dynamic routes among network devices based on various objective functions (OFs) that exploit different network metrics for parent node selection (e.g., ETX-based [2], Energy-based [3]), etc.). With such OFs, RPL organizes the network topology as a Destination Oriented Directed Acyclic Graph (DODAG). However, the performance of RPL may be affected by frequent network topology changes, which may be caused by different factors like node battery depletion, link quality degradation, etc. Indeed, in such situations, the OF functions do not guarantee optimal maintenance of the RPL tree. To address this issue, this paper describes how Supervised Learning can be leveraged to improve RPL performance and energy efficiency by mitigating RPL DODAG instability when the network conditions, used by the RPL’s OF functions, change frequently. We use an offline supervised learning to provide the optimal value of the transmission range (the maximal distance to which a node can send its data to another one) that mitigates the instability of the RPL network, and hence minimizes the energy consumption. The preliminary simulation results show that our proposal can improve network performance and increase network lifetime.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131010004","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}
IoT devices should be easy to deploy and able to endure long periods of activity in the field without further intervention. LoRaWAN is geared to attain these objectives. European developers can easily leverage the public gateways of The Things Networks (TTN) already installed to obtain connectivity for LoRaWAN end-devices. In many developing countries Internet access cannot be taken for granted thus precluding the use of TTN. In this paper, we present a solution that allows connecting local IoT end-nodes to a LoRaWAN gateway without the need of internet access, at low cost and with low power consumption. We implement the three building blocks of the LoRaWAN architecture (Gateway, Network Server and Application Server) in a single box based on a Raspberry Pi and a LoRaWAN module. Local access to the application data is offered via a WiFi Access Point, allowing community members to access their community data even when there is no Internet access. In addition to real time IoT data, bulletin board like services can be implemented in the local repository to provide educational, health and other content that addresses the most pressing needs of isolated communities. The complete box with mentioned capabilities constitutes then the Base Station (BS).
{"title":"TLTN – The local things network: on the design of a LoRaWAN gateway with autonomous servers for disconnected communities","authors":"Pape Abdoulaye Barro, M. Zennaro, E. Pietrosemoli","doi":"10.1109/WD.2019.8734239","DOIUrl":"https://doi.org/10.1109/WD.2019.8734239","url":null,"abstract":"IoT devices should be easy to deploy and able to endure long periods of activity in the field without further intervention. LoRaWAN is geared to attain these objectives. European developers can easily leverage the public gateways of The Things Networks (TTN) already installed to obtain connectivity for LoRaWAN end-devices. In many developing countries Internet access cannot be taken for granted thus precluding the use of TTN. In this paper, we present a solution that allows connecting local IoT end-nodes to a LoRaWAN gateway without the need of internet access, at low cost and with low power consumption. We implement the three building blocks of the LoRaWAN architecture (Gateway, Network Server and Application Server) in a single box based on a Raspberry Pi and a LoRaWAN module. Local access to the application data is offered via a WiFi Access Point, allowing community members to access their community data even when there is no Internet access. In addition to real time IoT data, bulletin board like services can be implemented in the local repository to provide educational, health and other content that addresses the most pressing needs of isolated communities. The complete box with mentioned capabilities constitutes then the Base Station (BS).","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126793405","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}
Password-based Authenticated Key Exchange (PAKE) is an attractive solution for secure authentication and key agreement between two parties over insecure networks by using only a human-memorable password. Introduced by Bellovin, the approach has been receiving much attention from researchers and motivating many follow-up works. In this paper, we introduce a new paradigm of designing PAKE protocols using signcryption scheme. The proposed protocol, called Password-based Signcryption Key Exchange (PSKE), not only formally fulfills all security requirements but also is able to provide outstanding computational efficiency over some patented protocols, which target two-party setting such as EKE, J-PAKE, and SRP. These features make PSKE suitable for remote user authentication in the Internet of Things (IoT) context where remote users need to authenticate to IoT devices before securely retrieving real-time raw data at any time from these devices.
{"title":"Password-Based Authenticated Key Exchange Based on Signcryption for the Internet of Things","authors":"Van-Hoan Hoang, E. Lehtihet, Y. Ghamri-Doudane","doi":"10.1109/WD.2019.8734196","DOIUrl":"https://doi.org/10.1109/WD.2019.8734196","url":null,"abstract":"Password-based Authenticated Key Exchange (PAKE) is an attractive solution for secure authentication and key agreement between two parties over insecure networks by using only a human-memorable password. Introduced by Bellovin, the approach has been receiving much attention from researchers and motivating many follow-up works. In this paper, we introduce a new paradigm of designing PAKE protocols using signcryption scheme. The proposed protocol, called Password-based Signcryption Key Exchange (PSKE), not only formally fulfills all security requirements but also is able to provide outstanding computational efficiency over some patented protocols, which target two-party setting such as EKE, J-PAKE, and SRP. These features make PSKE suitable for remote user authentication in the Internet of Things (IoT) context where remote users need to authenticate to IoT devices before securely retrieving real-time raw data at any time from these devices.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130992885","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}
C. Caillouet, Tahiry Razafindralambo, Dimitrios Zorbas
Lifetime is the main issue of wireless sensors networks. Since the nodes are often placed in inaccessible places, the replacement of their battery is not an easy task. Moreover, the node maintenance is a costly and time consuming operation when the nodes are high in numbers. Energy harvesting technologies have recently been developed to replenish part or all of the required energy that allows a node to function. In this paper, we use dedicated chargers carried by drones that can fly over the network and transmit energy to the nodes using radio-frequency (RF) signals. We formulate and optimally solve the Optimal Drone Placement and Planning Problem (OD3P) by using a given number of flying drones, in order to efficiently recharge wireless sensor nodes. Unlike other works in the literature, we assume that the drones can trade altitude with coverage and recharge power, while each drone can move across different positions in the network to extend coverage. We present a linear program as well as a fast heuristic algorithm to meet the minimum energy demands of the nodes in the shortest possible amount of time. Our simulation results show the effectiveness of our approaches for network scenarios with up to 50 sensors and a 50 × 50m terrain size.
{"title":"Optimal placement of drones for fast sensor energy replenishment using wireless power transfer","authors":"C. Caillouet, Tahiry Razafindralambo, Dimitrios Zorbas","doi":"10.1109/WD.2019.8734203","DOIUrl":"https://doi.org/10.1109/WD.2019.8734203","url":null,"abstract":"Lifetime is the main issue of wireless sensors networks. Since the nodes are often placed in inaccessible places, the replacement of their battery is not an easy task. Moreover, the node maintenance is a costly and time consuming operation when the nodes are high in numbers. Energy harvesting technologies have recently been developed to replenish part or all of the required energy that allows a node to function. In this paper, we use dedicated chargers carried by drones that can fly over the network and transmit energy to the nodes using radio-frequency (RF) signals. We formulate and optimally solve the Optimal Drone Placement and Planning Problem (OD3P) by using a given number of flying drones, in order to efficiently recharge wireless sensor nodes. Unlike other works in the literature, we assume that the drones can trade altitude with coverage and recharge power, while each drone can move across different positions in the network to extend coverage. We present a linear program as well as a fast heuristic algorithm to meet the minimum energy demands of the nodes in the shortest possible amount of time. Our simulation results show the effectiveness of our approaches for network scenarios with up to 50 sensors and a 50 × 50m terrain size.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125292044","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}
In this paper, we optimize the slot allocation for uplink communication in a network comprising multiple VLC based access points (APs) and an RF-AP in an indoor environment. Instead of connecting a node to either a single VLC-AP or an RF-AP, node exploits the resources of multiple APs. An optimization problem is formulated for the allocation of these resources with the objective of increasing the overall network throughput. As a result, we get a resource allocation scheme that utilize multiple VLC and RF APs (MV + RF), in contrast to previous schemes that optimize resource allocation utilizing the resources of a single VLC and use RF for overloaded traffic, namely (SV O RF). We compare the performance of the proposed (MV + RF ) with (SV O RF) and (MV O RF) in which a node is assigned resources from multiple VLC-APs and RF-AP is utilized only for overloaded traffic. The results demonstrate that the proposed scheme outperforms other schemes both at the node and the network level and achieves on average 26 to 35% improved throughput over different parameter settings.
在本文中，我们在室内环境中优化了由多个基于VLC的接入点(ap)和RF-AP组成的网络中上行通信的插槽分配。节点利用多个ap的资源，而不是连接单个VLC-AP或RF-AP。以提高整体网络吞吐量为目标，对这些资源的分配提出了优化问题。因此，我们得到了一种利用多个VLC和RF ap (MV + RF)的资源分配方案，而不是以前利用单个VLC的资源优化资源分配并将RF用于过载流量的方案，即(SV O RF)。我们比较了所提出的(MV + RF)与(SV O RF)和(MV O RF)的性能，其中一个节点从多个vlc - ap分配资源，RF- ap仅用于过载流量。结果表明，该方案在节点和网络级别上都优于其他方案，在不同的参数设置下，平均吞吐量提高了26 ~ 35%。
{"title":"Optimization of Slot Allocation in Hybrid VLC/RF Networks for Throughput Maximization","authors":"M. Amjad, H. K. Qureshi, Sobia Jangsher","doi":"10.1109/WD.2019.8734271","DOIUrl":"https://doi.org/10.1109/WD.2019.8734271","url":null,"abstract":"In this paper, we optimize the slot allocation for uplink communication in a network comprising multiple VLC based access points (APs) and an RF-AP in an indoor environment. Instead of connecting a node to either a single VLC-AP or an RF-AP, node exploits the resources of multiple APs. An optimization problem is formulated for the allocation of these resources with the objective of increasing the overall network throughput. As a result, we get a resource allocation scheme that utilize multiple VLC and RF APs (MV + RF), in contrast to previous schemes that optimize resource allocation utilizing the resources of a single VLC and use RF for overloaded traffic, namely (SV O RF). We compare the performance of the proposed (MV + RF ) with (SV O RF) and (MV O RF) in which a node is assigned resources from multiple VLC-APs and RF-AP is utilized only for overloaded traffic. The results demonstrate that the proposed scheme outperforms other schemes both at the node and the network level and achieves on average 26 to 35% improved throughput over different parameter settings.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129252047","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}
Index Modulation (IM) is a technique that activate k out of n subcarriers of an OFDM symbol to transmit ${{p}_{1}}=leftlfloor {{log }_{2}}binom{n}{k} rightrfloor $ bits in symbol’s indexes. Since both the symbol’s spectrum width and transmission air-time duration remain the same, OFDM-IM outperforms OFDM’s Spectral Efficiency (SE) for larger values of $binom{n}{k}$. However, OFDM-IM requires an extra step called Index Selector (IxS) which takes Tα time units to map a given p1-bit input to its corresponding pattern of active subcarriers. This extra overhead virtually enlarges the symbol duration, which is not captured by the classic SE definition. To fulfill this gap, in this work we present the Spectro-Computational Efficiency (SCE) metric. SCE parameterizes either the absolute runtime of Tα on a reference hardware or its computational complexity Tα(n, k) as function of n and k. Based on SCE, we present theoretical case studies to identify the asymptotic bounds for Tα(n, k) across different choices of k. if Tα(n, n/2) is at most linear on n the resulting overhead is asymptotically negligible and IxS can handle an arbitrarily large OFDM symbol. Otherwise, OFDM-IM’s SCE tends to zero regardless of the hardware processor speed. Also, we situate the inflection-point values for OFDM-IM’s SCE between $binom{6}{3}$ and $binom{14}{7}$ in some practical case studies.
{"title":"What is the Cost of the Index Selector Task for OFDM with Index Modulation?","authors":"Saulo Queiroz, J. Vilela, E. Monteiro","doi":"10.1109/WD.2019.8734233","DOIUrl":"https://doi.org/10.1109/WD.2019.8734233","url":null,"abstract":"Index Modulation (IM) is a technique that activate k out of n subcarriers of an OFDM symbol to transmit ${{p}_{1}}=leftlfloor {{log }_{2}}binom{n}{k} rightrfloor $ bits in symbol’s indexes. Since both the symbol’s spectrum width and transmission air-time duration remain the same, OFDM-IM outperforms OFDM’s Spectral Efficiency (SE) for larger values of $binom{n}{k}$. However, OFDM-IM requires an extra step called Index Selector (IxS) which takes Tα time units to map a given p1-bit input to its corresponding pattern of active subcarriers. This extra overhead virtually enlarges the symbol duration, which is not captured by the classic SE definition. To fulfill this gap, in this work we present the Spectro-Computational Efficiency (SCE) metric. SCE parameterizes either the absolute runtime of Tα on a reference hardware or its computational complexity Tα(n, k) as function of n and k. Based on SCE, we present theoretical case studies to identify the asymptotic bounds for Tα(n, k) across different choices of k. if Tα(n, n/2) is at most linear on n the resulting overhead is asymptotically negligible and IxS can handle an arbitrarily large OFDM symbol. Otherwise, OFDM-IM’s SCE tends to zero regardless of the hardware processor speed. Also, we situate the inflection-point values for OFDM-IM’s SCE between $binom{6}{3}$ and $binom{14}{7}$ in some practical case studies.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130047158","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}
This paper presents the results of a wideband channel measurement campaign carried out in an indoor environment with representative inventory of a factory. The measurements were carried out using a frequency domain channel sounder from 3.4 - 3.8 GHz and the virtual array method was adopted for averaging small-scale fading effects. From the average power delay profile (APDP), parameters for the Saleh-Valenzuela (S-V) model were extracted for line-of-sight (LoS) and non line-of-sight (NLoS) sites. The ray decay from the S-V model increased with cluster delay for all LoS sites and the delay spread for NLoS sites were higher than LoS locations. The NLoS delay spread was also higher than the results obtained at 2.4 GHz for the same measurement locations. The APDPs from both LoS and NLoS sites showed clustering effects with a mean cluster number of 8/7 for LoS/NLoS sites.
{"title":"Characterizing the Indoor Industrial Channel at 3.5GHz for 5G","authors":"E. I. Adegoke, R. Edwards, W. Whittow, A. Bindel","doi":"10.1109/WD.2019.8734160","DOIUrl":"https://doi.org/10.1109/WD.2019.8734160","url":null,"abstract":"This paper presents the results of a wideband channel measurement campaign carried out in an indoor environment with representative inventory of a factory. The measurements were carried out using a frequency domain channel sounder from 3.4 - 3.8 GHz and the virtual array method was adopted for averaging small-scale fading effects. From the average power delay profile (APDP), parameters for the Saleh-Valenzuela (S-V) model were extracted for line-of-sight (LoS) and non line-of-sight (NLoS) sites. The ray decay from the S-V model increased with cluster delay for all LoS sites and the delay spread for NLoS sites were higher than LoS locations. The NLoS delay spread was also higher than the results obtained at 2.4 GHz for the same measurement locations. The APDPs from both LoS and NLoS sites showed clustering effects with a mean cluster number of 8/7 for LoS/NLoS sites.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130639669","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}
The need for sensors to deliver, communicate, collect, alert, and share information in various applications has made wireless sensor networks very popular. However, due to its limited resources in terms of computation power, battery life and memory storage of the sensor nodes, it is challenging to add security features to provide the confidentiality, integrity, and availability. Blockchain technology ensures security and avoids the need of any trusted third party. However, applying Blockchain in a resource-constrained wireless sensor network is a challenging task because Blockchain is power, computation, and memory hungry in nature and demands heavy bandwidth due to control overheads. In this paper, a new routing and a private communication Blockchain framework is designed and tested with Constant Bit rate (CBR). The proposed Load Balancing Multi-Hop (LBMH) routing shares and enhances the battery life of the Cluster Heads and reduce control overhead during Block updates, but due to limited storage and energy of the sensor nodes, Blockchain in sensor networks may never become a reality unless computation, storage and battery life are readily available at low cost.
{"title":"Will Blockchain Technology Become a Reality in Sensor Networks?","authors":"Jims Marchang, Gregg Ibbotson, Paul Wheway","doi":"10.1109/WD.2019.8734268","DOIUrl":"https://doi.org/10.1109/WD.2019.8734268","url":null,"abstract":"The need for sensors to deliver, communicate, collect, alert, and share information in various applications has made wireless sensor networks very popular. However, due to its limited resources in terms of computation power, battery life and memory storage of the sensor nodes, it is challenging to add security features to provide the confidentiality, integrity, and availability. Blockchain technology ensures security and avoids the need of any trusted third party. However, applying Blockchain in a resource-constrained wireless sensor network is a challenging task because Blockchain is power, computation, and memory hungry in nature and demands heavy bandwidth due to control overheads. In this paper, a new routing and a private communication Blockchain framework is designed and tested with Constant Bit rate (CBR). The proposed Load Balancing Multi-Hop (LBMH) routing shares and enhances the battery life of the Cluster Heads and reduce control overhead during Block updates, but due to limited storage and energy of the sensor nodes, Blockchain in sensor networks may never become a reality unless computation, storage and battery life are readily available at low cost.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121426126","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}
Routing protocol design is very important in network design, because an effective routing protocol can greatly improve network performance. As heavy and aggregated load and interference will decrease the performance, to balance load and interference, an effective load- and interference-balance hybrid routing protocol (LIB-HRP) is proposed in this paper. Unlike existing hybrid routing protocols, LIB-HRP considers the load condition at interfering nodes, because the interfering node with heavy load will have much influence on the current node. The heavier load condition at interfering node can bring a longer duration of interference. Besides, as mesh clients have limited energy, energy condition is taken into account for mesh clients in the proposed approach. Simulation results show that LIB-HRP can obtain better performance in terms of average packet loss ratio, delay, network throughput and energy consumption.
{"title":"Load- and Interference-Balance Hybrid Routing Protocol for Hybrid Wireless Mesh Network","authors":"Y. Chai, Xiao-Jun Zeng","doi":"10.1109/WD.2019.8734257","DOIUrl":"https://doi.org/10.1109/WD.2019.8734257","url":null,"abstract":"Routing protocol design is very important in network design, because an effective routing protocol can greatly improve network performance. As heavy and aggregated load and interference will decrease the performance, to balance load and interference, an effective load- and interference-balance hybrid routing protocol (LIB-HRP) is proposed in this paper. Unlike existing hybrid routing protocols, LIB-HRP considers the load condition at interfering nodes, because the interfering node with heavy load will have much influence on the current node. The heavier load condition at interfering node can bring a longer duration of interference. Besides, as mesh clients have limited energy, energy condition is taken into account for mesh clients in the proposed approach. Simulation results show that LIB-HRP can obtain better performance in terms of average packet loss ratio, delay, network throughput and energy consumption.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125711437","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}
Wi-Fi networks lack energy consumption management mechanisms. In particular, during nighttime periods, the energy waste may be significant, since all Access Points (APs) are kept switched on even though there is minimum or null traffic demand. The fact that more than 80% of all wireless traffic is originated or terminated indoor, and served by Wi-Fi, has led the scientific community to look into energy saving mechanisms for Wi-Fi networks. State of the art solutions address the problem by switching APs on and off based on manually inserted schedules or by analyzing real-time traffic demand. The first are vendor specific; the second may induce frequent station (STA) handoffs, which has an impact on network performance. The lack of implementability of solutions is also a shortcoming in most works.We propose an algorithm, named Energy Consumption Management Algorithm (ECMA), that learns the daytime and nighttime periods of the Wi-Fi network. ECMA was designed having in mind its implementability over legacy Wi-Fi equipment. At daytime, the radio interfaces of the AP (2.4 GHz and 5 GHz) are switched on and off automatically, according to the traffic demand. At nighttime, clusters of APs, covering the same area, are formed, leaving one AP always switched on for basic coverage and the redundant APs swichted off to maximize energy savings, while avoiding coverage and performance hampering. Simulation results show energy savings of up to 50% are possible using the ECMA algorithm.
{"title":"Energy Consumption Management for Dense Wi-Fi Networks","authors":"Paulo Silva, Nuno T. Almeida, R. Campos","doi":"10.1109/WD.2019.8734187","DOIUrl":"https://doi.org/10.1109/WD.2019.8734187","url":null,"abstract":"Wi-Fi networks lack energy consumption management mechanisms. In particular, during nighttime periods, the energy waste may be significant, since all Access Points (APs) are kept switched on even though there is minimum or null traffic demand. The fact that more than 80% of all wireless traffic is originated or terminated indoor, and served by Wi-Fi, has led the scientific community to look into energy saving mechanisms for Wi-Fi networks. State of the art solutions address the problem by switching APs on and off based on manually inserted schedules or by analyzing real-time traffic demand. The first are vendor specific; the second may induce frequent station (STA) handoffs, which has an impact on network performance. The lack of implementability of solutions is also a shortcoming in most works.We propose an algorithm, named Energy Consumption Management Algorithm (ECMA), that learns the daytime and nighttime periods of the Wi-Fi network. ECMA was designed having in mind its implementability over legacy Wi-Fi equipment. At daytime, the radio interfaces of the AP (2.4 GHz and 5 GHz) are switched on and off automatically, according to the traffic demand. At nighttime, clusters of APs, covering the same area, are formed, leaving one AP always switched on for basic coverage and the redundant APs swichted off to maximize energy savings, while avoiding coverage and performance hampering. Simulation results show energy savings of up to 50% are possible using the ECMA algorithm.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130865434","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
扫码关注我们
求助内容：
应助结果提醒方式：