In this article, a routing protocol EARP (Energy Aware Routing Protocol) with the terminal node is proposed, to deal with the impact of the limited energy resources of Cognitive Radio Networks on the whole network routing. The protocol allows choosing the route from the neighbor nodes in different transmission paths, according to energy consumption of a single node and the full path. If the path breaks, the protocol will increase local routing maintenance strategy. It effectively reduces the retransmission caused by the situation, and improves the routing efficiency. It also can prevent the link transmission process selecting the fault route due to the energy depletion. Through simulation experiments compared with the LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol, the results showed that in the same experimental environment, the proposed EARP could obviously balance the load, protect low energy nodes, prolong the network survival time and reduce packet loss rate and packet delay of data delivery. So it can improve the energy consumption of sensing node and provide routing capabilities.
针对认知无线网络有限的能量资源对全网路由的影响，提出了一种基于终端节点的能量感知路由协议EARP (Energy Aware routing protocol)。该协议允许根据单个节点和全路径的能量消耗，从不同传输路径的邻居节点中选择路由。如果路径中断，协议将增加本地路由维护策略。有效地减少了这种情况造成的重传，提高了路由效率。它还可以防止链路传输过程中由于能量损耗而选择故障路由。通过与LEACH (Low Energy Adaptive Clustering Hierarchy)路由协议的仿真实验对比，结果表明，在相同的实验环境下，提出的EARP路由协议能够明显均衡负载，保护低能量节点，延长网络生存时间，降低数据传输的丢包率和包延迟。因此，它可以提高传感节点的能耗，并提供路由能力。
{"title":"Energy Aware Routing Protocol for Cognitive Radio Networks","authors":"Yu Song, Xiaoli He, R. Binsack","doi":"10.4236/WSN.2017.93006","DOIUrl":"https://doi.org/10.4236/WSN.2017.93006","url":null,"abstract":"In this article, a routing protocol EARP (Energy Aware Routing Protocol) with the terminal node is proposed, to deal with the impact of the limited energy resources of Cognitive Radio Networks on the whole network routing. The protocol allows choosing the route from the neighbor nodes in different transmission paths, according to energy consumption of a single node and the full path. If the path breaks, the protocol will increase local routing maintenance strategy. It effectively reduces the retransmission caused by the situation, and improves the routing efficiency. It also can prevent the link transmission process selecting the fault route due to the energy depletion. Through simulation experiments compared with the LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol, the results showed that in the same experimental environment, the proposed EARP could obviously balance the load, protect low energy nodes, prolong the network survival time and reduce packet loss rate and packet delay of data delivery. So it can improve the energy consumption of sensing node and provide routing capabilities.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"09 1","pages":"103-115"},"PeriodicalIF":0.0,"publicationDate":"2017-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46162289","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}
Raqeebir Rab, S. Sagar, N. Sakib, A. Haque, M. Islam, Ashikur Rahman
Reducing number of forwarding nodes is the main focus of any broadcasting algorithm designed for ad-hoc wireless networks. All reliable broadcasting techniques can be broadly classified under proactive and reactive approaches. In proactive approach, a node selects a subset of its neighbors as forwarding node and announces the forwarding node list in the packet header during broadcast. On the other hand, no such forwarding list is generated in reactive approach. Rather, a node (cognitively) determines by itself whether to forward the packet or not based on neighbor information. Dominant pruning and Self-pruning are two example techniques that fall under proactive and reactive approach respectively. Between the two methods, dominant pruning shows better performance than self-pruning in reducing number of forwarding nodes as they work with extended neighbor knowledge. However, appended forwarding node list increases message overhead and consumes more bandwidth. As a result, the approach becomes non-scalable in large networks. In this paper, we propose a reactive broadcasting technique based on self-pruning. The proposed approach dubbed as “Improved Self-pruning based Broadcasting (ISB)” algorithm completes the broadcast with smaller packet header (i.e., with no overhead) but uses extended neighbor knowledge. Simulation results show that ISB outperforms dominant pruning and self-pruning. Furthermore, as the network gets more spread and denser, ISB works remarkably well.
{"title":"Improved Self-Pruning for Broadcasting in Ad Hoc Wireless Networks","authors":"Raqeebir Rab, S. Sagar, N. Sakib, A. Haque, M. Islam, Ashikur Rahman","doi":"10.4236/WSN.2017.92004","DOIUrl":"https://doi.org/10.4236/WSN.2017.92004","url":null,"abstract":"Reducing number of forwarding nodes is the main focus of any broadcasting algorithm designed for ad-hoc wireless networks. All reliable broadcasting techniques can be broadly classified under proactive and reactive approaches. In proactive approach, a node selects a subset of its neighbors as forwarding node and announces the forwarding node list in the packet header during broadcast. On the other hand, no such forwarding list is generated in reactive approach. Rather, a node (cognitively) determines by itself whether to forward the packet or not based on neighbor information. Dominant pruning and Self-pruning are two example techniques that fall under proactive and reactive approach respectively. Between the two methods, dominant pruning shows better performance than self-pruning in reducing number of forwarding nodes as they work with extended neighbor knowledge. However, appended forwarding node list increases message overhead and consumes more bandwidth. As a result, the approach becomes non-scalable in large networks. In this paper, we propose a reactive broadcasting technique based on self-pruning. The proposed approach dubbed as “Improved Self-pruning based Broadcasting (ISB)” algorithm completes the broadcast with smaller packet header (i.e., with no overhead) but uses extended neighbor knowledge. Simulation results show that ISB outperforms dominant pruning and self-pruning. Furthermore, as the network gets more spread and denser, ISB works remarkably well.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"09 1","pages":"73-86"},"PeriodicalIF":0.0,"publicationDate":"2017-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43666795","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}
As much as accurate or precise position estimation is always desirable, coarse accuracy due to sensor node localization is often sufficient. For such level of accuracy, Range-free localization techniques are being explored as low cost alternatives to range based localization techniques. To manage cost, few location aware nodes, called anchors are deployed in the wireless sensor environment. It is from these anchors that all other free nodes are expected to estimate their own positions. This paper therefore, takes a look at some of the foremost Range-free localization algorithms, detailing their limitations, with a view to proposing a modified form of Centroid Localization Algorithm called Reach Centroid Localization Algorithm. The algorithm employs a form of anchor nodes position validation mechanism by looking at the consistency in the quality of Received Signal Strength. Each anchor within the vicinity of a free node seeks to validate the actual position or proximity of other anchors within its vicinity using received signal strength. This process mitigates multipath effects of radio waves, particularly in an enclosed environment, and consequently limits localization estimation errors and uncertainties. Centroid Localization Algorithm is then used to estimate the location of a node using the anchors selected through the validation mechanism. Our approach to localization becomes more significant, particularly in indoor environments, where radio signal signatures are inconsistent or outrightly unreliable. Simulated results show a significant improvement in localization accuracy when compared with the original Centroid Localization Algorithm, Approximate Point in Triangulation and DV-Hop.
{"title":"Reach Centroid Localization Algorithm","authors":"Adeniran Ademuwagun, Verdicchio Fabio","doi":"10.4236/WSN.2017.92005","DOIUrl":"https://doi.org/10.4236/WSN.2017.92005","url":null,"abstract":"As much as accurate or precise position estimation is always desirable, coarse accuracy due to sensor node localization is often sufficient. For such level of accuracy, Range-free localization techniques are being explored as low cost alternatives to range based localization techniques. To manage cost, few location aware nodes, called anchors are deployed in the wireless sensor environment. It is from these anchors that all other free nodes are expected to estimate their own positions. This paper therefore, takes a look at some of the foremost Range-free localization algorithms, detailing their limitations, with a view to proposing a modified form of Centroid Localization Algorithm called Reach Centroid Localization Algorithm. The algorithm employs a form of anchor nodes position validation mechanism by looking at the consistency in the quality of Received Signal Strength. Each anchor within the vicinity of a free node seeks to validate the actual position or proximity of other anchors within its vicinity using received signal strength. This process mitigates multipath effects of radio waves, particularly in an enclosed environment, and consequently limits localization estimation errors and uncertainties. Centroid Localization Algorithm is then used to estimate the location of a node using the anchors selected through the validation mechanism. Our approach to localization becomes more significant, particularly in indoor environments, where radio signal signatures are inconsistent or outrightly unreliable. Simulated results show a significant improvement in localization accuracy when compared with the original Centroid Localization Algorithm, Approximate Point in Triangulation and DV-Hop.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"09 1","pages":"87-101"},"PeriodicalIF":0.0,"publicationDate":"2017-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45629751","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}
Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.
{"title":"Location-Based Routing Protocols for Wireless Sensor Networks: A Survey","authors":"Arun K. Kumar, H. Y. Shwe, K. Wong, P. Chong","doi":"10.4236/WSN.2017.91003","DOIUrl":"https://doi.org/10.4236/WSN.2017.91003","url":null,"abstract":"Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"09 1","pages":"25-72"},"PeriodicalIF":0.0,"publicationDate":"2017-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47523107","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}
Energy conservation is becoming the main critical issue in wireless sensor network and also the main research area for most of the researchers. For improving the energy efficiency, sink mobility is used with constrain path in wireless sensor network. In order to solve these optimization problems, inter cluster Ant Colony Optimization Algorithm (ACO) is used with mobile sink (MS) and rendezvous nodes (RN). The proposed algorithm will improve 30% more network lifetime than the existing algorithm and prompts high accurate delivery of packets in highly dense network. a
{"title":"Optimizing Inter Cluster Ant Colony Optimization Data Aggregation Algorithm with Rendezvous Nodes and Mobile Sink","authors":"Annu Ghotra","doi":"10.4236/WSN.2017.91002","DOIUrl":"https://doi.org/10.4236/WSN.2017.91002","url":null,"abstract":"Energy conservation is becoming the main critical issue in wireless sensor network and also the main research area for most of the researchers. For improving the energy efficiency, sink mobility is used with constrain path in wireless sensor network. In order to solve these optimization problems, inter cluster Ant Colony Optimization Algorithm (ACO) is used with mobile sink (MS) and rendezvous nodes (RN). The proposed algorithm will improve 30% more network lifetime than the existing algorithm and prompts high accurate delivery of packets in highly dense network. \u0000a","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"09 1","pages":"16-24"},"PeriodicalIF":0.0,"publicationDate":"2017-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45263841","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}
One of the important aspects in wireless sensor networks is time synchronization. Many applications such as military activity monitoring, environmental monitoring and forest fire monitoring require highly accurate time synchronization. Time synchronization assures that all the sensor nodes in wireless sensor network have the same clock time. It is not only essential for aforementioned applications but it is mandatory for TDMA scheduling and proper duty cycle coordination. Time synchronization is a challenging problem due to energy constraints. Most of the existing synchronization protocols use fixed nodes for synchronization, but in the proposed synchronization, algorithm mobile nodes are used to synchronize the stationary nodes in the sensing field. In this paper, we propose a new time synchronization algorithm, named controlled mobility time synchronization (CMTS) with the objective to achieve the higher accuracy while synchronizing the nodes. The proposed approach is used in this paper to synchronize the nodes externally by using the mobile nodes. Simulation results exhibit that proposed controlled mobility time synchronization increases the synchronization precision and reduces the energy consumption as well as synchronization error by reducing the collisions and retransmissions.
{"title":"Controlled Mobility Time Synchronization for WSNs","authors":"Gopal Chand Gautam, N. C. Kaushal","doi":"10.4236/WSN.2017.91001","DOIUrl":"https://doi.org/10.4236/WSN.2017.91001","url":null,"abstract":"One of the important aspects in wireless sensor networks is time synchronization. Many applications such as military activity monitoring, environmental monitoring and forest fire monitoring require highly accurate time synchronization. Time synchronization assures that all the sensor nodes in wireless sensor network have the same clock time. It is not only essential for aforementioned applications but it is mandatory for TDMA scheduling and proper duty cycle coordination. Time synchronization is a challenging problem due to energy constraints. Most of the existing synchronization protocols use fixed nodes for synchronization, but in the proposed synchronization, algorithm mobile nodes are used to synchronize the stationary nodes in the sensing field. In this paper, we propose a new time synchronization algorithm, named controlled mobility time synchronization (CMTS) with the objective to achieve the higher accuracy while synchronizing the nodes. The proposed approach is used in this paper to synchronize the nodes externally by using the mobile nodes. Simulation results exhibit that proposed controlled mobility time synchronization increases the synchronization precision and reduces the energy consumption as well as synchronization error by reducing the collisions and retransmissions.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"09 1","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2017-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48023439","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}
Energy conservation and congestion control are widely researched topics in Wireless Sensor Networks in recent years. The main objective is to develop a model to find the optimized path on the basis of distance between source and destination and the residual energy of the node. This paper shows an implementation of nature inspired improved Bat Algorithm to control congestion in Wireless Sensor Networks at transport layer. The Algorithm has been applied on the fitness function to obtain an optimum solution. Simulation results have shown improvement in parameters like network lifetime and throughput as compared with CODA (Congestion Detection and Avoidance), PSO (Particle Swarm Optimization) algorithm and ACO (Ant Colony Optimization).
{"title":"Improved Bat Algorithm Based Energy Efficient Congestion Control Scheme for Wireless Sensor Networks","authors":"M. S. Manshahia, M. Dave, S. Singh","doi":"10.4236/WSN.2016.811018","DOIUrl":"https://doi.org/10.4236/WSN.2016.811018","url":null,"abstract":"Energy conservation and congestion control are widely researched topics in Wireless Sensor Networks in recent years. The main objective is to develop a model to find the optimized path on the basis of distance between source and destination and the residual energy of the node. This paper shows an implementation of nature inspired improved Bat Algorithm to control congestion in Wireless Sensor Networks at transport layer. The Algorithm has been applied on the fitness function to obtain an optimum solution. Simulation results have shown improvement in parameters like network lifetime and throughput as compared with CODA (Congestion Detection and Avoidance), PSO (Particle Swarm Optimization) algorithm and ACO (Ant Colony Optimization).","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"08 1","pages":"229-241"},"PeriodicalIF":0.0,"publicationDate":"2016-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70902521","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}
Modernization of armies is a constant process and is driven by intuitive fact that those who do not modernize will become extinct. In last five decades, the development of modern armies has taken place around Colonel John Boyd’s theory of OODA loop that deals with information superiority. Building a robust, mobile and capable network that could provide for novel appliances and information superiority is the main challenge which modernizers are facing. Network, suitable for future combat operations, and able to transport a vast amount of information on a battlefield, is expensive to build. Every mistake in design and the need to correct those mistakes could halt development in an army for years. Therefore, system dependability analysis during system design phase is needed. In this report, the concept of a future Battle Network System is described. The Report evaluates operational environment of BNS and possible failure reasons of the service, and illustrates the change in BNS Quality of Service due to probable transport layer errors. This paper describes the method of testing the concept of proposed network systems on the drawing board, and emphasizes design points for a new system. Nevertheless, the proposed method is by no means conclusive. Rather, it describes an engineering approach to define the main problems while creating MANET-based networking systems.
{"title":"Dependability in Future Battle Network System —Transport Layer Ability to Maintain Quality of Service","authors":"Veiko Dieves","doi":"10.4236/WSN.2016.810017","DOIUrl":"https://doi.org/10.4236/WSN.2016.810017","url":null,"abstract":"Modernization of armies is a constant process and is driven by intuitive fact that those who do not modernize will become extinct. In last five decades, the development of modern armies has taken place around Colonel John Boyd’s theory of OODA loop that deals with information superiority. Building a robust, mobile and capable network that could provide for novel appliances and information superiority is the main challenge which modernizers are facing. Network, suitable for future combat operations, and able to transport a vast amount of information on a battlefield, is expensive to build. Every mistake in design and the need to correct those mistakes could halt development in an army for years. Therefore, system dependability analysis during system design phase is needed. In this report, the concept of a future Battle Network System is described. The Report evaluates operational environment of BNS and possible failure reasons of the service, and illustrates the change in BNS Quality of Service due to probable transport layer errors. This paper describes the method of testing the concept of proposed network systems on the drawing board, and emphasizes design points for a new system. Nevertheless, the proposed method is by no means conclusive. Rather, it describes an engineering approach to define the main problems while creating MANET-based networking systems.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"08 1","pages":"211-228"},"PeriodicalIF":0.0,"publicationDate":"2016-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70902744","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 last few years, several recent developments concern a new proposed techniques of communication for WSN (Wireless Sensors Network) using a complex methods and technics. This network is considered a future platform for many applications like: medical, agriculture, industrial, monitoring and others. The challenge of this work consists in proposing a new design of transceiver for WSN based on IDWPT (Inverse Discrete Wavelet Packet Transform) in emitter and DWPT (Discrete Wavelet Packet Transform) in receiver for mono and multi users using AWGN Channel. We will propose in this paper, a new concept of impulse radio communication for multiband orthogonal communication for UWB (Ultra-wideband) applications. The main objective of this work is to present a new form of pulse communication adapted to low through-put short-range applications and is scalable according to the type of use but also the number of sensors.
{"title":"A Novel Transceiver Architecture Based on Wavelet Packet Modulation for UWB-IR WSN Applications","authors":"M. Tabaa","doi":"10.4236/WSN.2016.89016","DOIUrl":"https://doi.org/10.4236/WSN.2016.89016","url":null,"abstract":"In last few years, several recent \u0000developments concern a new proposed techniques of communication for WSN \u0000(Wireless Sensors Network) using a complex methods and technics. This network \u0000is considered a future platform for many applications like: medical, agriculture, \u0000industrial, monitoring and others. The challenge of this work consists in \u0000proposing a new design of transceiver for WSN based on IDWPT (Inverse Discrete \u0000Wavelet Packet Transform) in emitter and DWPT (Discrete Wavelet Packet \u0000Transform) in receiver for mono and multi users using AWGN Channel. We will propose \u0000in this paper, a new concept of impulse radio communication for multiband orthogonal \u0000communication for UWB (Ultra-wideband) applications. The main objective of this \u0000work is to present a new form of pulse communication adapted to low through-put \u0000short-range applications and is scalable according to the type of use but also \u0000the number of sensors.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"08 1","pages":"191-209"},"PeriodicalIF":0.0,"publicationDate":"2016-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70902786","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}
Wake-up radio (WuR) system is often presented as the best candidate for replacing traditional duty cycled Medium Access Control (MAC) protocols in Wireless Sensor Networks (WSNs). The Double Radio (DoRa) protocol is a new MAC protocol for in-band WuR system with addressing capabilities. While the DoRa protocol improves the WSNs energy efficiency, it still suffers from an overhearing problem when the WuR system is very often requested. The WuR wastes a noticeable amount of energy when overhearing to wake-up demand intended to other nodes, but it is neither measured nor solved in other works. In this paper, an adaptive duty-cycled DoRa (DC-DoRa) is then proposed to solve the overhearing problem. The primary concept of the work is to enable the WuR functionality before the node is addressed and to disable the WuR after the node sent data. Extensive simulations under OMNeT++ using real input parameters are then performed to show the significant energy-savings through the two protocols and the nearly suppression of overhearing with DC-DoRa. In fact, the mean power consumption is three-order below using the DoRa protocol compared to traditional MAC protocols. While overhearing can represent up to 93% of the WuR energy consumption with the DoRa protocol, it is reduced to only 1% with the DC-DoRa protocol.
{"title":"An Energy-Efficient Duty-Cycled Wake-Up Radio Protocol for Avoiding Overhearing in Wireless Sensor Networks","authors":"J. Lebreton, S. Kandukuri, N. Murad, R. Lorion","doi":"10.4236/WSN.2016.88015","DOIUrl":"https://doi.org/10.4236/WSN.2016.88015","url":null,"abstract":"Wake-up radio (WuR) system is often \u0000presented as the best candidate for replacing traditional duty cycled Medium \u0000Access Control (MAC) protocols in Wireless Sensor Networks (WSNs). The Double \u0000Radio (DoRa) protocol is a new MAC protocol for in-band WuR system with \u0000addressing capabilities. While the DoRa protocol improves the WSNs energy \u0000efficiency, it still suffers from an overhearing problem when the WuR system is \u0000very often requested. The WuR wastes a noticeable amount of energy when \u0000overhearing to wake-up demand intended to other nodes, but it is neither \u0000measured nor solved in other works. In this paper, an adaptive duty-cycled DoRa \u0000(DC-DoRa) is then proposed to solve the overhearing problem. The primary \u0000concept of the work is to enable the WuR functionality before the node is \u0000addressed and to disable the WuR after the node sent data. Extensive \u0000simulations under OMNeT++ using real input parameters are then performed to \u0000show the significant energy-savings through the two protocols and the nearly \u0000suppression of overhearing with DC-DoRa. In fact, the mean power consumption is \u0000three-order below using the DoRa protocol compared to traditional MAC \u0000protocols. While overhearing can represent up to 93% of the WuR energy \u0000consumption with the DoRa protocol, it is reduced to only 1% with the DC-DoRa \u0000protocol.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":"08 1","pages":"176-190"},"PeriodicalIF":0.0,"publicationDate":"2016-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70902763","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
扫码关注我们
求助内容：
应助结果提醒方式：