The exploitation of Wireless Sensor Networks (WSN) is constrained by limited power, low computing power and storage and short-range radio transmission. Many routing protocols respecting these constraints were develope...The exploitation of Wireless Sensor Networks (WSN) is constrained by limited power, low computing power and storage and short-range radio transmission. Many routing protocols respecting these constraints were developed but, it still lacks formal and standardized solutions being able to help in their configuration. The configuration management that responds to this concern is very important in this type of network. It consists of the definition of data models to configure and is very necessary for the good network performance. Tangible results were obtained in traditional networks with the emergence of NETCONF and YANG standards, but on the best of our humble knowledge there are none yet in WSNs. We propose in this paper wsn-routing-protocol, a YANG data model for routing protocols configuration in WSNs. Following our model, we propose two YANG configuration data models based on the latter: they are respectively aodv for AODV and rpl for RPL.展开更多
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 sc...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.展开更多
Routing protocols are perceived to be growing hotspots and required to devote more time and work to studying it. Research on routing protocols of wireless sensor networks is significantly important to accurately guide...Routing protocols are perceived to be growing hotspots and required to devote more time and work to studying it. Research on routing protocols of wireless sensor networks is significantly important to accurately guide the application. Theoretical analysis and comparison are one of the key steps in the protocol research. Restricted by irreversible factors of power and others, lifetime of wireless sensor networks is very short. In this paper, we analyze and compare the characteristics and application fields of existing protocols. On the basis of that, this paper mainly proposes an improved directed diffusion exploring the phase of reinforcing path, which chooses the way to strengthen the path after evaluating the critical factors. It was determined by simulation that improved directed diffusion has a higher transmission rate, and it satisfies the requirements, which balancing the energy consumption and prolonging the lifetime.展开更多
In this paper, a routing protocol for wireless sensor network, baptized energy based protocol (EBP) is proposed. Wireless sensor network presents many challenges and constraints, and one of the major constraints is th...In this paper, a routing protocol for wireless sensor network, baptized energy based protocol (EBP) is proposed. Wireless sensor network presents many challenges and constraints, and one of the major constraints is the routing problem. Due to the limited energy of sensor nodes, routing in this type of network shall perform efficiently to maximize the network lifetime. One of the proposed algorithms is the directional source aware routing protocol (DSAP) which, after simulation, showed a lot of limitations and drawbacks. The modified directional source aware routing protocol (MDSAP) was proposed by the authors of this paper to address some of the DSAP’s limitations but remains limited to a fixed topology, fixed source and stationary nodes. So EBP is proposed and operated under different scenarios and showed, after its simulation using TinyOS, many advantages in terms of load balancing, free looping, minimizing packet error rate and maximizing network lifetime.展开更多
This paper provides a deep evaluation of the energy consumption of routing protocols. The evaluation is done along with other metrics such as throughput and packet delivery ratio (PDR). We introduce two more metrics t...This paper provides a deep evaluation of the energy consumption of routing protocols. The evaluation is done along with other metrics such as throughput and packet delivery ratio (PDR). We introduce two more metrics to capture the efficiency of the energy consumption: e-throughput and e-PDR. Both are ratios in relation to the energy. We consider the three low layers of the stack. Three types of routing protocols are used: proactive, reactive, and hybrid. At the MAC and PHY layer, three radio types are considered: 802.11a/b/g. Finally, the number of nodes is varying in random topologies, with nodes being static or mobile. Simulations are conducted using NS3. The parameters of a real network interface card are used. From the results in mobile position scenarios, no protocol is outperforming the others;even if OLSR has the lowest energy consumption, most of the time. However, in constant position scenarios, AODV consumed a lower energy, apart from the scenarios using the 802.11a standard where HWMP energy consumption is the lowest. Regarding the energy efficiency, AODV protocols provided the best e-throughput and OLSR the best e-PDR in overall configurations. A framework for selecting energy-efficient routing protocol depending on network characteristics is proposed at the end.展开更多
New wireless sensor network applications (e.g., military surveillance) require higher reliability than a simple best effort service could provide. Classical reliable transport protocols like Transmission Control Proto...New wireless sensor network applications (e.g., military surveillance) require higher reliability than a simple best effort service could provide. Classical reliable transport protocols like Transmission Control Protocol (TCP) are not well suited for wireless sensor networks due to both the characteristics of the network nodes (low computing power, strong energy constraints) and those of the main applications running on those nodes (low data rates). Recent researches present new transport protocols for wireless sensor networks providing various type of reliability and using new mechanisms for loss detection and recovery, and congestion control. This paper presents a survey on reliable transport protocol for WSNs.展开更多
Many advances have been made in sensor technologies which are as varied as the applications;and many more are in progress. It has been reasonable to design and develop small size sensor nodes of low cost and low power...Many advances have been made in sensor technologies which are as varied as the applications;and many more are in progress. It has been reasonable to design and develop small size sensor nodes of low cost and low power. In this work, we have explored some energy-efficient routing protocols (LEACH, Directed Diffusion, Gossiping and EESR) and their expansions (enhancements), and furthermore, their tactics specific to wireless sensor network, such as data aggregation and in-network processing, clustering, different node role assignment, and data-centric methods. After that we have compared these explored routing protocols based on different metrics that affect the specific application requirements and WSN in general.展开更多
Nowadays,the widespread application of 5G has promoted rapid development in different areas,particularly in the Internet of Things(IoT),where 5G provides the advantages of higher data transfer rate,lower latency,and w...Nowadays,the widespread application of 5G has promoted rapid development in different areas,particularly in the Internet of Things(IoT),where 5G provides the advantages of higher data transfer rate,lower latency,and widespread connections.Wireless sensor networks(WSNs),which comprise various sensors,are crucial components of IoT.The main functions of WSN include providing users with real-time monitoring information,deploying regional information collection,and synchronizing with the Internet.Security in WSNs is becoming increasingly essential because of the across-the-board nature of wireless technology in many fields.Recently,Yu et al.proposed a user authentication protocol forWSN.However,their design is vulnerable to sensor capture and temporary information disclosure attacks.Thus,in this study,an improved protocol called PSAP-WSNis proposed.The security of PSAP-WSN is demonstrated by employing the ROR model,BAN logic,and ProVerif tool for the analysis.The experimental evaluation shows that our design is more efficient and suitable forWSN environments.展开更多
Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in t...Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in the routing function.This article introduces Enhanced Metaheuristics with Trust Aware Secure Route Selection Protocol(EMTA-SRSP)for WSN.The presented EMTA-SRSP technique majorly involves the optimal selection of routes in WSN.To accomplish this,the EMTA-SRSP technique involves the design of an oppositional Aquila optimization algorithm to choose safe routes for data communication.For the clustering process,the nodes with maximum residual energy will be considered cluster heads(CHs).In addition,the OAOA technique gets executed to choose optimal routes based on objective functions with multiple parameters such as energy,distance,and trust degree.The experimental validation of the EMTA-SRSP technique is tested,and the results exhibited a better performance of the EMTA-SRSP technique over other approaches.展开更多
Wireless sensor networks (WSNs) attract considerable amount of research efforts from both industry and academia. With limited power and computational capability available on a sensor node, robustness and efficiency ar...Wireless sensor networks (WSNs) attract considerable amount of research efforts from both industry and academia. With limited power and computational capability available on a sensor node, robustness and efficiency are the main concerns when designing a routing protocol for WSNs with low complexity. There are various existing design approaches, such as data-centric approach, hierarchical approach and location-based approach, which were designed for a particular application with specific requirements. In this paper, we study the design and implementation of a routing protocol for data acquisition in WSNs. The designed routing protocol is named Centralized Sensor Protocol for Information via Negotiation (CSPIN), which essentially combines the advertise-request-transfer process and a routing distribution mechanism. Implementation is realized and demonstrated with the Crossbow MicaZ hardware using nesC/TinyOS. It was our intention to provide a hand-on study of implementation of centralized routing protocol for WSNs.展开更多
The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs...The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).展开更多
Sensor networks tend to support different traffic patterns since more and more emerging applications have diverse needs. We present MGRP, a Multi-Gradient Routing Protocol for wireless sensor networks, which is fully ...Sensor networks tend to support different traffic patterns since more and more emerging applications have diverse needs. We present MGRP, a Multi-Gradient Routing Protocol for wireless sensor networks, which is fully distributed and efficiently supports endto-end, one-to-many and many-to-one traffic patterns by effectively construct and maintain a gradient vector for each node. We further combine neighbor link estimation with routing information to reduce packet exchange on network dynamics and node failures. We have implemented MGRP on Tiny OS and evaluated its performance on real-world testbeds. The result shows MGRP achieves lower end-to-end packet delay in different traffic patterns compared to the state of the art routing protocols while still remains high packet delivery ratio.展开更多
Reducing the energy consumption of available resources is still a problem to be solved in Wireless Sensor Networks (WSNs). Many types of existing routing protocols are developed to save power consumption. In these pro...Reducing the energy consumption of available resources is still a problem to be solved in Wireless Sensor Networks (WSNs). Many types of existing routing protocols are developed to save power consumption. In these protocols, cluster-based routing protocols are found to be more energy efficient. A cluster head is selected to aggregate the data received from root nodes and forwards these data to the base station in cluster-based routing. The selection of cluster heads should be efficient to save energy. In our proposed protocol, we use static clustering for the efficient selection of cluster heads. The proposed routing protocol works efficiently in large as well as small areas. For an optimal number of cluster head selection we divide a large sensor field into rectangular clusters. Then these rectangular clusters are further grouped into zones for efficient communication between cluster heads and a base station. We perform MATLAB simulations to observe the network stability, throughput, energy consumption, network lifetime and the number of cluster heads. Our proposed routing protocol outperforms in large areas in comparison with the LEACH, MH-LEACH, and SEP routing protocols.展开更多
The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network(WSN).Although the hierarchical routing protocol can effectively cope with large-scale application scenarios,how...The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network(WSN).Although the hierarchical routing protocol can effectively cope with large-scale application scenarios,how to elect a secure cluster head and balance the network load becomes an enormous challenge.In this paper,a Trust Management-based and Low Energy Adaptive Clustering Hierarchy protocol(LEACH-TM)is proposed.In LEACH-TM,by using the number of dynamic decision cluster head nodes,residual energy and density of neighbor nodes,the size of the cluster can be better constrained to improve energy efficiency,and avoid excessive energy consumption of a node.Simultaneously,the trust management scheme is introduced into LEACH-TM to defend against internal attacks.The simulation results show that,compared with LEACH-SWDN protocol and LEACH protocol,LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption,and can effectively mitigate the influence of malicious nodes on cluster head selection,which can greatiy guarantee the security of the overall network.展开更多
Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requireme...Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.展开更多
Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of ...Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.展开更多
Energy aware routing protocols can be classified into energy saver and energy manager. Energy saver protocols decrease energy consumption totally. Most of them try to find the shortest path between source and destinat...Energy aware routing protocols can be classified into energy saver and energy manager. Energy saver protocols decrease energy consumption totally. Most of them try to find the shortest path between source and destination to reduce energy consumption. But energy manager protocols balance energy consumption in network to avoid network partitioning. Finding best route only based on energy balancing consideration may lead to long path with high delay and decreases network lifetime. On the other hand, finding best route only with the shortest distance consideration may lead to network partitioning. This paper improves SEER [1] routing protocol. Traditional SEER is only energy saver and has poor idea about energy balancing. Our proposed protocol, named BEAR, considers energy balancing and optimal distance both. It finds a fair tradeoff between energy balancing and optimal distance by learning automata concept. We simulate and evaluate routing protocols by Glomosim [2] simulator.展开更多
Wireless Sensor Networks (WSNs) are used in different civilian, military, and industrial applications. Recently, many routing protocols have been proposed attempting to find suitable routes to transmit data. In this p...Wireless Sensor Networks (WSNs) are used in different civilian, military, and industrial applications. Recently, many routing protocols have been proposed attempting to find suitable routes to transmit data. In this paper we propose a Fuzzy Energy Aware tree-based Routing (FEAR) protocol that aims to enhance existing tree-based routing protocols and prolong the network’s life time by considering sensors’ limited energy. The design and implementation of the new protocol is based on cross-layer structure where information from different layers are utilized to achieve the best power saving. Each node maintains a list of its neighbors in order to use neighbors’links in addition to the parent-child links. The protocol is tested and compared with other tree-based protocols and the simulation results show that FEAR protocol is more energy-efficient than comparable protocols. According to the results FEAR protocol saves up to 70.5% in the number of generated control messages and up to 55.08% in the consumed power.展开更多
文摘The exploitation of Wireless Sensor Networks (WSN) is constrained by limited power, low computing power and storage and short-range radio transmission. Many routing protocols respecting these constraints were developed but, it still lacks formal and standardized solutions being able to help in their configuration. The configuration management that responds to this concern is very important in this type of network. It consists of the definition of data models to configure and is very necessary for the good network performance. Tangible results were obtained in traditional networks with the emergence of NETCONF and YANG standards, but on the best of our humble knowledge there are none yet in WSNs. We propose in this paper wsn-routing-protocol, a YANG data model for routing protocols configuration in WSNs. Following our model, we propose two YANG configuration data models based on the latter: they are respectively aodv for AODV and rpl for RPL.
文摘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.
文摘Routing protocols are perceived to be growing hotspots and required to devote more time and work to studying it. Research on routing protocols of wireless sensor networks is significantly important to accurately guide the application. Theoretical analysis and comparison are one of the key steps in the protocol research. Restricted by irreversible factors of power and others, lifetime of wireless sensor networks is very short. In this paper, we analyze and compare the characteristics and application fields of existing protocols. On the basis of that, this paper mainly proposes an improved directed diffusion exploring the phase of reinforcing path, which chooses the way to strengthen the path after evaluating the critical factors. It was determined by simulation that improved directed diffusion has a higher transmission rate, and it satisfies the requirements, which balancing the energy consumption and prolonging the lifetime.
文摘In this paper, a routing protocol for wireless sensor network, baptized energy based protocol (EBP) is proposed. Wireless sensor network presents many challenges and constraints, and one of the major constraints is the routing problem. Due to the limited energy of sensor nodes, routing in this type of network shall perform efficiently to maximize the network lifetime. One of the proposed algorithms is the directional source aware routing protocol (DSAP) which, after simulation, showed a lot of limitations and drawbacks. The modified directional source aware routing protocol (MDSAP) was proposed by the authors of this paper to address some of the DSAP’s limitations but remains limited to a fixed topology, fixed source and stationary nodes. So EBP is proposed and operated under different scenarios and showed, after its simulation using TinyOS, many advantages in terms of load balancing, free looping, minimizing packet error rate and maximizing network lifetime.
文摘This paper provides a deep evaluation of the energy consumption of routing protocols. The evaluation is done along with other metrics such as throughput and packet delivery ratio (PDR). We introduce two more metrics to capture the efficiency of the energy consumption: e-throughput and e-PDR. Both are ratios in relation to the energy. We consider the three low layers of the stack. Three types of routing protocols are used: proactive, reactive, and hybrid. At the MAC and PHY layer, three radio types are considered: 802.11a/b/g. Finally, the number of nodes is varying in random topologies, with nodes being static or mobile. Simulations are conducted using NS3. The parameters of a real network interface card are used. From the results in mobile position scenarios, no protocol is outperforming the others;even if OLSR has the lowest energy consumption, most of the time. However, in constant position scenarios, AODV consumed a lower energy, apart from the scenarios using the 802.11a standard where HWMP energy consumption is the lowest. Regarding the energy efficiency, AODV protocols provided the best e-throughput and OLSR the best e-PDR in overall configurations. A framework for selecting energy-efficient routing protocol depending on network characteristics is proposed at the end.
文摘New wireless sensor network applications (e.g., military surveillance) require higher reliability than a simple best effort service could provide. Classical reliable transport protocols like Transmission Control Protocol (TCP) are not well suited for wireless sensor networks due to both the characteristics of the network nodes (low computing power, strong energy constraints) and those of the main applications running on those nodes (low data rates). Recent researches present new transport protocols for wireless sensor networks providing various type of reliability and using new mechanisms for loss detection and recovery, and congestion control. This paper presents a survey on reliable transport protocol for WSNs.
文摘Many advances have been made in sensor technologies which are as varied as the applications;and many more are in progress. It has been reasonable to design and develop small size sensor nodes of low cost and low power. In this work, we have explored some energy-efficient routing protocols (LEACH, Directed Diffusion, Gossiping and EESR) and their expansions (enhancements), and furthermore, their tactics specific to wireless sensor network, such as data aggregation and in-network processing, clustering, different node role assignment, and data-centric methods. After that we have compared these explored routing protocols based on different metrics that affect the specific application requirements and WSN in general.
文摘Nowadays,the widespread application of 5G has promoted rapid development in different areas,particularly in the Internet of Things(IoT),where 5G provides the advantages of higher data transfer rate,lower latency,and widespread connections.Wireless sensor networks(WSNs),which comprise various sensors,are crucial components of IoT.The main functions of WSN include providing users with real-time monitoring information,deploying regional information collection,and synchronizing with the Internet.Security in WSNs is becoming increasingly essential because of the across-the-board nature of wireless technology in many fields.Recently,Yu et al.proposed a user authentication protocol forWSN.However,their design is vulnerable to sensor capture and temporary information disclosure attacks.Thus,in this study,an improved protocol called PSAP-WSNis proposed.The security of PSAP-WSN is demonstrated by employing the ROR model,BAN logic,and ProVerif tool for the analysis.The experimental evaluation shows that our design is more efficient and suitable forWSN environments.
基金This research was supported by the Universiti Sains Malaysia(USM)and the Ministry of Higher Education Malaysia through Fundamental Research GrantScheme(FRGS-Grant No:FRGS/1/2020/TK0/USM/02/1).
文摘Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in the routing function.This article introduces Enhanced Metaheuristics with Trust Aware Secure Route Selection Protocol(EMTA-SRSP)for WSN.The presented EMTA-SRSP technique majorly involves the optimal selection of routes in WSN.To accomplish this,the EMTA-SRSP technique involves the design of an oppositional Aquila optimization algorithm to choose safe routes for data communication.For the clustering process,the nodes with maximum residual energy will be considered cluster heads(CHs).In addition,the OAOA technique gets executed to choose optimal routes based on objective functions with multiple parameters such as energy,distance,and trust degree.The experimental validation of the EMTA-SRSP technique is tested,and the results exhibited a better performance of the EMTA-SRSP technique over other approaches.
文摘Wireless sensor networks (WSNs) attract considerable amount of research efforts from both industry and academia. With limited power and computational capability available on a sensor node, robustness and efficiency are the main concerns when designing a routing protocol for WSNs with low complexity. There are various existing design approaches, such as data-centric approach, hierarchical approach and location-based approach, which were designed for a particular application with specific requirements. In this paper, we study the design and implementation of a routing protocol for data acquisition in WSNs. The designed routing protocol is named Centralized Sensor Protocol for Information via Negotiation (CSPIN), which essentially combines the advertise-request-transfer process and a routing distribution mechanism. Implementation is realized and demonstrated with the Crossbow MicaZ hardware using nesC/TinyOS. It was our intention to provide a hand-on study of implementation of centralized routing protocol for WSNs.
文摘The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).
基金supported by National Key Technologies Research and Development Program of China under Grant No.2014BAH14F01National Science and Technology Major Project of China under Grant No.2012ZX03005007+1 种基金National NSF of China Grant No.61402372Fundamental Research Funds for the Central Universities Grant No.3102014JSJ0003
文摘Sensor networks tend to support different traffic patterns since more and more emerging applications have diverse needs. We present MGRP, a Multi-Gradient Routing Protocol for wireless sensor networks, which is fully distributed and efficiently supports endto-end, one-to-many and many-to-one traffic patterns by effectively construct and maintain a gradient vector for each node. We further combine neighbor link estimation with routing information to reduce packet exchange on network dynamics and node failures. We have implemented MGRP on Tiny OS and evaluated its performance on real-world testbeds. The result shows MGRP achieves lower end-to-end packet delay in different traffic patterns compared to the state of the art routing protocols while still remains high packet delivery ratio.
文摘Reducing the energy consumption of available resources is still a problem to be solved in Wireless Sensor Networks (WSNs). Many types of existing routing protocols are developed to save power consumption. In these protocols, cluster-based routing protocols are found to be more energy efficient. A cluster head is selected to aggregate the data received from root nodes and forwards these data to the base station in cluster-based routing. The selection of cluster heads should be efficient to save energy. In our proposed protocol, we use static clustering for the efficient selection of cluster heads. The proposed routing protocol works efficiently in large as well as small areas. For an optimal number of cluster head selection we divide a large sensor field into rectangular clusters. Then these rectangular clusters are further grouped into zones for efficient communication between cluster heads and a base station. We perform MATLAB simulations to observe the network stability, throughput, energy consumption, network lifetime and the number of cluster heads. Our proposed routing protocol outperforms in large areas in comparison with the LEACH, MH-LEACH, and SEP routing protocols.
基金supported by the National Natural Science Foundation of China(Grant No.61571303,No.61571004)the Shanghai Natural Science Foundation(Grant No.21ZR1461700)+3 种基金the Shanghai Sailing Program(Grant No.19YF1455800)the National Science and Technology Major Project of China(No.2018ZX03001031)the Fundamental Research Funds for State Key Laboratory of Synthetical Automation for Process Industries(Grant No.PAL-N201703)the National Key Research and Development Program of China-Internet of Things and Smart City Key Program(No.2019YFB2101600,NO.2019YFB2101602,No.2019YFB2101602-03).
文摘The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network(WSN).Although the hierarchical routing protocol can effectively cope with large-scale application scenarios,how to elect a secure cluster head and balance the network load becomes an enormous challenge.In this paper,a Trust Management-based and Low Energy Adaptive Clustering Hierarchy protocol(LEACH-TM)is proposed.In LEACH-TM,by using the number of dynamic decision cluster head nodes,residual energy and density of neighbor nodes,the size of the cluster can be better constrained to improve energy efficiency,and avoid excessive energy consumption of a node.Simultaneously,the trust management scheme is introduced into LEACH-TM to defend against internal attacks.The simulation results show that,compared with LEACH-SWDN protocol and LEACH protocol,LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption,and can effectively mitigate the influence of malicious nodes on cluster head selection,which can greatiy guarantee the security of the overall network.
文摘Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.
基金Acknowledgements Supported by the Fundamental Research Funds for the Central Universities(72104988), The National High Technology Research and Development Program of China ( 2009AA01 Z204, 2007AA01Z429, 2007AA01Z405), The post doctor science foundation of China (20090451495, 20090461415) The National Natural science foundation of China (60874085, 60633020, 60803151 ), The Natural Science Basic Research Plan in Shaanxi Province of China (Program No. SJ08F13), The Aviation Sci- ence Foundation of China (2007ZD31003, 2008ZD31001 )
文摘Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.
文摘Energy aware routing protocols can be classified into energy saver and energy manager. Energy saver protocols decrease energy consumption totally. Most of them try to find the shortest path between source and destination to reduce energy consumption. But energy manager protocols balance energy consumption in network to avoid network partitioning. Finding best route only based on energy balancing consideration may lead to long path with high delay and decreases network lifetime. On the other hand, finding best route only with the shortest distance consideration may lead to network partitioning. This paper improves SEER [1] routing protocol. Traditional SEER is only energy saver and has poor idea about energy balancing. Our proposed protocol, named BEAR, considers energy balancing and optimal distance both. It finds a fair tradeoff between energy balancing and optimal distance by learning automata concept. We simulate and evaluate routing protocols by Glomosim [2] simulator.
文摘Wireless Sensor Networks (WSNs) are used in different civilian, military, and industrial applications. Recently, many routing protocols have been proposed attempting to find suitable routes to transmit data. In this paper we propose a Fuzzy Energy Aware tree-based Routing (FEAR) protocol that aims to enhance existing tree-based routing protocols and prolong the network’s life time by considering sensors’ limited energy. The design and implementation of the new protocol is based on cross-layer structure where information from different layers are utilized to achieve the best power saving. Each node maintains a list of its neighbors in order to use neighbors’links in addition to the parent-child links. The protocol is tested and compared with other tree-based protocols and the simulation results show that FEAR protocol is more energy-efficient than comparable protocols. According to the results FEAR protocol saves up to 70.5% in the number of generated control messages and up to 55.08% in the consumed power.