Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime,...Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime, so as to prolong the lifetime of the whole WSN. In this paper, we propose a path-based data aggregation scheme （PBDAS） for grid-based wireless sensor networks. In order to extend the lifetime of a WSN, we construct a grid infrastructure by partitioning the whole sensor field into a grid of cells. Each cell has a head responsible for aggregating its own data with the data sensed by the others in the same cell and then transmitting out. In order to efficiently and rapidly transmit the data to the base station （BS）, we link each cell head to form a chain. Each cell head on the chain takes turn becoming the chain leader responsible for transmitting data to the BS. Aggregated data moves from head to head along the chain, and finally the chain leader transmits to the BS. In PBDAS, only the cell heads need to transmit data toward the BS. Therefore, the data transmissions to the BS substantially decrease. Besides, the cell heads and chain leader are designated in turn according to the energy level so that the energy depletion of nodes is evenly distributed. Simulation results show that the proposed PBDAS extends the lifetime of sensor nodes, so as to make the lifetime of the whole network longer.展开更多
The primary function of wireless sensor networks is to gather sensor data from the monitored area. Due to faults or malicious nodes, however, the sensor data collected or reported might be wrong. Hence it is important...The primary function of wireless sensor networks is to gather sensor data from the monitored area. Due to faults or malicious nodes, however, the sensor data collected or reported might be wrong. Hence it is important to detect events in the presence of wrong sensor readings and misleading reports. In this paper, we present a neighbor-based malicious node detection scheme for wireless sensor networks. Malicious nodes are modeled as faulty nodes behaving intelligently to lead to an incorrect decision or energy depletion without being easily detected. Each sensor node makes a decision on the fault status of itself and its neighboring nodes based on the sensor readings. Most erroneous readings due to transient faults are corrected by filtering, while nodes with permanent faults are removed using confidence-level evaluation, to improve malicious node detection rate and event detection accuracy. Each node maintains confidence levels of itself and its neighbors, indicating the track records in reporting past events correctly. Computer simulation shows that most of the malicious nodes reporting against their own readings are correctly detected unless they behave similar to the normal nodes. As a result, high event detection accuracy is also maintained while achieving low false alarm rate.展开更多
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.展开更多
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.展开更多
We propose an energy-based stochastic model of wireless sensor networks (WSNs) where each sensor node is randomly and alternatively in an active and a sleep mode. We first investigate the sensor model and derive the f...We propose an energy-based stochastic model of wireless sensor networks (WSNs) where each sensor node is randomly and alternatively in an active and a sleep mode. We first investigate the sensor model and derive the formula of the steady-state probability when there are a number of data packets in different sensor modes. We then determine important sensor’s performance measures in terms of energy consumptions, average data delay and throughput. The novelty of this paper is in its development of a stochastic model in WSN with active/sleep feature and the explicit results obtained for above mentioned energy consumption and performance characteristics. These results are expected to be useful as the fundamental results in the theoretical analysis and design of various hybrid WSNs with power mode consideration.展开更多
In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based o...In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based on a random key pre-distribution scheme using clustering,we present a novel random key revoca-tion protocol,which is suitable for large scale networks greatly and removes compromised information efficiently.The revocation protocol can guarantee network security by using less memory consumption and communication load,and combined by centralized and distributed revoca-tion,having virtues of timeliness and veracity for revoca-tion at the same time.展开更多
Recent development in sensor technologies makes wireless sensor networks (WSN) very popular in the last few years. A limitation of most popular sensors is that sensor nodes have a limited battery capacity that leads t...Recent development in sensor technologies makes wireless sensor networks (WSN) very popular in the last few years. A limitation of most popular sensors is that sensor nodes have a limited battery capacity that leads to lower the lifetime of WSN. For that, it raises the need to develop energy efficient solutions to keep WSN functioning for the longest period of time. Due to the fact that most of the nodes energy is spent on data transmission, many routing techniques in the literature have been proposed to expand the network lifetime such as the Online Maximum Lifetime heuristics (OML) and capacity maximization (CMAX). In this paper, we introduce an efficient priority based routing power management heuristic in order to increase both coverage and extend lifetime by managing the power at the sensor level. We accomplished that by setting priority metric in addition to dividing the node energy into two ratios;one for the sensor node originated data and the other part is for data relays from other sensors. This heuristic, which is called pERPMT (priority Efficient Routing Power Management Technique), has been applied to two well know routing techniques. Results from running extensive simulation runs revealed the superiority of the new methodology pERPMT over existing heuristics. The pEPRMT increases the lifetime up to 77% and 54% when compared to OML and CMAX respectively.展开更多
This paper presents a novel real-time routing protocol, called CBRR, with less energy consumption for wireless sensor networks (WSNs). End-to-End real-time requirements are fulfilled with speed or delay constraint at ...This paper presents a novel real-time routing protocol, called CBRR, with less energy consumption for wireless sensor networks (WSNs). End-to-End real-time requirements are fulfilled with speed or delay constraint at each hop through integrating the contention and neighbor table mechanisms. More precisely, CBRR maintains a neighbor table via the contention mechanism being dependent on wireless broadcast instead of beacons. Comprehensive simulations show that CBRR can not only achieve higher performance in static networks, but also work well for dynamic networks.展开更多
This work proposes a geographic routing protocol for UWSNs based on the construction of a 3D virtual grid structure, called Void-Avoidance Grid-based Multipath Position-based Routing (VA-GMPR). It consists of two main...This work proposes a geographic routing protocol for UWSNs based on the construction of a 3D virtual grid structure, called Void-Avoidance Grid-based Multipath Position-based Routing (VA-GMPR). It consists of two main components, the multipath routing scheme and the grid-based void avoidance (GVA) mechanism for handling routing holes. The multipath routing scheme adopts node-disjoint routes from the source to the sink in order to enhance network reliability and load balancing. While the GVA mechanism handles the problem of holes in 3D virtual grid structure based on three techniques: Hole bypass, path diversion, and path backtracking. The performance evaluation of the VA-GMPR protocol was compared to a recently proposed grid-based routing protocol for UWSNs, called Energy-efficient Multipath Geographic Grid-based Routing (EMGGR). The results showed that the VA-GMPR protocol outperformed the EMGGR protocol in terms of packet delivery ratio, and end-to end-delay. However, the results also showed that the VA-GMPR protocol exhibited higher energy consumption compared to EMGGR.展开更多
The IEEE 802.15.4 standard utilizes the CSMA-CA mechanism to control nodes’ access to the shared wireless communication medium. CSMA-CA implements the Binary Exponential Backoff (BEB) algorithm by which a node refrai...The IEEE 802.15.4 standard utilizes the CSMA-CA mechanism to control nodes’ access to the shared wireless communication medium. CSMA-CA implements the Binary Exponential Backoff (BEB) algorithm by which a node refrains from sending any packet before the expiry of its backoff period. After that, the node is required to sense the medium for two successive time slots to assert that the medium is clear from any ongoing transmissions (this is referred to as Clear Channel Assessment (CCA)). Upon finding the medium busy, the node doubles its backoff period and repeats that process. While effective in reducing the likelihood of collisions, this approach takes no measures to preserve the priorities among the nodes contending to access the medium. In this paper we propose the Priority-Based BEB (PB-BEB) algorithm in which we enhance BEB such that nodes’ priority is preserved. We provide a simulation study to examine the performance of PB-BEB. Our simulations show that the latter not only outperforms BEB in terms of fairness, but also show promising results in terms other parameters like channel utilization, reliability, and power conservation.展开更多
This work proposes an efficient disjoint multipath geographic routing algorithm for dense wireless sensor networks (WSN), called Multipath Grid-based Enabled Geographic Routing (MGEGR). The proposed algorithm relies o...This work proposes an efficient disjoint multipath geographic routing algorithm for dense wireless sensor networks (WSN), called Multipath Grid-based Enabled Geographic Routing (MGEGR). The proposed algorithm relies on the construction of a 2-D logical grid in the geographical region of deployment. The objective of the proposed scheme is to determine optimal or near-optimal (within a defined constant) multiple disjoint paths (multipath) from a source node to the sink, in order to enhance the reliability of the network. The determined multiple disjoint paths would be used by the source node in a round-robin way to balance the traffic across the disjoint paths, and to avoid discovered paths with cell holes. The proposed scheme limits the use of broadcasting to the process of gateway election within each cell, and the process of maintaining the table of neighbors of each gateway. Our simulation results show the effectiveness and scalability of our routing scheme with increased network size compared to on-demand routing protocols.展开更多
Wireless sensor networks are open architectures, so any potential threat can easily intercept, wiretap and counterfeit the information. Therefore, the safety of WSN is very important. Since any single key system canno...Wireless sensor networks are open architectures, so any potential threat can easily intercept, wiretap and counterfeit the information. Therefore, the safety of WSN is very important. Since any single key system cannot guarantee the security of the wireless sensor network for communications, this paper introduces a hierarchical key management scheme based on the different abilities of different sensor nodes in the clustered wireless sensor network. In this scheme, the nodes are distributed into several clusters, and a cluster head must be elected for each cluster. Private communication between cluster heads is realized through the encryption system based on the identity of each head while private communication between cluster nodes in a same cluster head is achieved through the random key preliminary distribution system. Considering the characteristics of WSN, we adopt dynamic means called dynamic cluster key management scheme to deal with master key, so master key will be updated according to the changed dynamic network topology. For cluster head node plays a pivotal role in this scheme, a trust manage-ment system should be introduced into the election of the cluster head which will exclude the malicious node from outside the cluster, thus improve the whole network security.展开更多
One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques ...One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.展开更多
Node localization is commonly employed in wireless networks. For example, it is used to improve routing and enhance security. Localization algorithms can be classified as range-free or range-based. Range-based algorit...Node localization is commonly employed in wireless networks. For example, it is used to improve routing and enhance security. Localization algorithms can be classified as range-free or range-based. Range-based algorithms use location metrics such as ToA, TDoA, RSS, and AoA to estimate the distance between two nodes. Proximity sensing between nodes is typically the basis for range-free algorithms. A tradeoff exists since range-based algorithms are more accurate but also more complex. However, in applications such as target tracking, localization accuracy is very important. In this paper, we propose a new range-based algorithm which is based on the density-based outlier detection algorithm (DBOD) from data mining. It requires selection of the K-nearest neighbours (KNN). DBOD assigns density values to each point used in the location estimation. The mean of these densities is calculated and those points having a density larger than the mean are kept as candidate points. Different performance measures are used to compare our approach with the linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD) algorithms. It is shown that the proposed algorithm performs better than these algorithms even when the anchor geometry about an unlocalized node is poor.展开更多
In this paper, a two-tiered Wireless Sensor Network (WSN) where nodes are divided into clusters and nodes forward data to base stations through cluster heads is considered. To maximize the network lifetime, two energy...In this paper, a two-tiered Wireless Sensor Network (WSN) where nodes are divided into clusters and nodes forward data to base stations through cluster heads is considered. To maximize the network lifetime, two energy efficient approaches are investigated. We first propose an approach that optimally locates the base stations within the network so that the distance between each cluster head and its closest base station is decreased. Then, a routing technique is developed to arrange the communication between cluster heads toward the base stations in order to guaranty that the gathered information effectively and efficiently reach the application. The overall dynamic framework that combines the above two schemes is described and evaluated. The experimental performance evaluation demonstrates the efficacy of topology control as a vital process to maximize the network lifetime of WSNs.展开更多
This paper examines the optimization of the lifetime and energy consumption of Wireless Sensor Networks (WSNs). These two competing objectives have a deep influence over the service qualification of networks and accor...This paper examines the optimization of the lifetime and energy consumption of Wireless Sensor Networks (WSNs). These two competing objectives have a deep influence over the service qualification of networks and according to recent studies, cluster formation is an appropriate solution for their achievement. To transmit aggregated data to the Base Station (BS), logical nodes called Cluster Heads (CHs) are required to relay data from the fixed-range sensing nodes located in the ground to high altitude aircraft. This study investigates the Genetic Algorithm (GA) as a dynamic technique to find optimum states. It is a simple framework that includes a proposed mathematical formula, which increasing in coverage is benchmarked against lifetime. Finally, the implementation of the proposed algorithm indicates a better efficiency compared to other simulated works.展开更多
The solution we propose optimizes the energy inside the wireless sensor network (WSN) with higher performance. The WSN is composed of many sensors nodes which collect the information, treat that information then send ...The solution we propose optimizes the energy inside the wireless sensor network (WSN) with higher performance. The WSN is composed of many sensors nodes which collect the information, treat that information then send it to the base station. The information is received by the base station (BS) then data?are?sent to the users by that BS. The most important element in sensor node is energy, as the lifetime of wireless sensor network depends on the sensor node energy. So many researches had been made in order to improve this energy basing routing protocols. As a result, we are able to propose a solution that optimizes this energy. In this paper, we are presenting a new approach of selecting node sensor base on routing protocol and process to send data to the base station. This ameliorates wireless sensor network lifetime and increases?the transmission sensor node to base station.展开更多
Research interest in sensor networks routing largely considers minimization of energy consumption as a major performance criterion to provide maximum sensors network lifetime. When considering energy conservation, rou...Research interest in sensor networks routing largely considers minimization of energy consumption as a major performance criterion to provide maximum sensors network lifetime. When considering energy conservation, routing protocols should also be designed to achieve fault tolerance in communications. Moreover, due to dynamic topology and random deployment, incorporating reliability into protocols for WSNs is very important. Hence, we propose an improved scalable clustering-based load balancing scheme (SCLB) in this paper. In SCLB scheme, scalability is achieved by dividing the network into overlapping multihop clusters each with its own cluster head node. Simulation results show that the proposed scheme achieves longer network lifetime with desirable reliability at the initial state compare with the existing multihop load balancing approach.展开更多
In Wireless Sensor Networks (WSN), the lifetime of sensors is the crucial issue. Numerous schemes are proposed to augment the life time of sensors based on the wide range of parameters. In majority of the cases, the c...In Wireless Sensor Networks (WSN), the lifetime of sensors is the crucial issue. Numerous schemes are proposed to augment the life time of sensors based on the wide range of parameters. In majority of the cases, the center of attraction will be the nodes’ lifetime enhancement and routing. In the scenario of cluster based WSN, multi-hop mode of communication reduces the communication cast by increasing average delay and also increases the routing overhead. In this proposed scheme, two ideas are introduced to overcome the delay and routing overhead. To achieve the higher degree in the lifetime of the nodes, the residual energy (remaining energy) of the nodes for multi-hop node choice is taken into consideration first. Then the modification in the routing protocol is evolved (Multi-Hop Dynamic Path-Selection Algorithm—MHDP). A dynamic path updating is initiated in frequent interval based on nodes residual energy to avoid the data loss due to path extrication and also to avoid the early dying of nodes due to elevation of data forwarding. The proposed method improves network’s lifetime significantly. The diminution in the average delay and increment in the lifetime of network are also accomplished. The MHDP offers 50% delay lesser than clustering. The average residual energy is 20% higher than clustering and 10% higher than multi-hop clustering. The proposed method improves network lifetime by 40% than clustering and 30% than multi-hop clustering which is considerably much better than the preceding methods.展开更多
The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission ...The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission in wireless sensor network is concluded as a kind of responsibility transmission. By redefining the responsibility and availability of nodes, the strategy for cluster head selection is studied, the responsibility and availability is determined by the combination of the residual energy, location and current flow of nodes. Based on the above, new clustering network topology control algorithm based on responsibility transmission CNTCABRT and hierarchical multi-hop CNTCABRT is presented in this paper, whose algorithm structure is along the famous LEACH algorithm. Experimental result demonstrates its promising performance over the famous LEACH algorithm in the cluster head selection, the size of cluster, the deployment of nodes and the lifetime of nodes, and several innovative conclusions are proposed finally.展开更多
基金supported by the NSC under Grant No.NSC-101-2221-E-239-032 and NSC-102-2221-E-239-020
文摘Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime, so as to prolong the lifetime of the whole WSN. In this paper, we propose a path-based data aggregation scheme （PBDAS） for grid-based wireless sensor networks. In order to extend the lifetime of a WSN, we construct a grid infrastructure by partitioning the whole sensor field into a grid of cells. Each cell has a head responsible for aggregating its own data with the data sensed by the others in the same cell and then transmitting out. In order to efficiently and rapidly transmit the data to the base station （BS）, we link each cell head to form a chain. Each cell head on the chain takes turn becoming the chain leader responsible for transmitting data to the BS. Aggregated data moves from head to head along the chain, and finally the chain leader transmits to the BS. In PBDAS, only the cell heads need to transmit data toward the BS. Therefore, the data transmissions to the BS substantially decrease. Besides, the cell heads and chain leader are designated in turn according to the energy level so that the energy depletion of nodes is evenly distributed. Simulation results show that the proposed PBDAS extends the lifetime of sensor nodes, so as to make the lifetime of the whole network longer.
文摘The primary function of wireless sensor networks is to gather sensor data from the monitored area. Due to faults or malicious nodes, however, the sensor data collected or reported might be wrong. Hence it is important to detect events in the presence of wrong sensor readings and misleading reports. In this paper, we present a neighbor-based malicious node detection scheme for wireless sensor networks. Malicious nodes are modeled as faulty nodes behaving intelligently to lead to an incorrect decision or energy depletion without being easily detected. Each sensor node makes a decision on the fault status of itself and its neighboring nodes based on the sensor readings. Most erroneous readings due to transient faults are corrected by filtering, while nodes with permanent faults are removed using confidence-level evaluation, to improve malicious node detection rate and event detection accuracy. Each node maintains confidence levels of itself and its neighbors, indicating the track records in reporting past events correctly. Computer simulation shows that most of the malicious nodes reporting against their own readings are correctly detected unless they behave similar to the normal nodes. As a result, high event detection accuracy is also maintained while achieving low false alarm rate.
文摘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.
文摘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.
文摘We propose an energy-based stochastic model of wireless sensor networks (WSNs) where each sensor node is randomly and alternatively in an active and a sleep mode. We first investigate the sensor model and derive the formula of the steady-state probability when there are a number of data packets in different sensor modes. We then determine important sensor’s performance measures in terms of energy consumptions, average data delay and throughput. The novelty of this paper is in its development of a stochastic model in WSN with active/sleep feature and the explicit results obtained for above mentioned energy consumption and performance characteristics. These results are expected to be useful as the fundamental results in the theoretical analysis and design of various hybrid WSNs with power mode consideration.
基金supported by the Ministry of Education Doctor Foundation in China under Grant No. 20050699037
文摘In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based on a random key pre-distribution scheme using clustering,we present a novel random key revoca-tion protocol,which is suitable for large scale networks greatly and removes compromised information efficiently.The revocation protocol can guarantee network security by using less memory consumption and communication load,and combined by centralized and distributed revoca-tion,having virtues of timeliness and veracity for revoca-tion at the same time.
文摘Recent development in sensor technologies makes wireless sensor networks (WSN) very popular in the last few years. A limitation of most popular sensors is that sensor nodes have a limited battery capacity that leads to lower the lifetime of WSN. For that, it raises the need to develop energy efficient solutions to keep WSN functioning for the longest period of time. Due to the fact that most of the nodes energy is spent on data transmission, many routing techniques in the literature have been proposed to expand the network lifetime such as the Online Maximum Lifetime heuristics (OML) and capacity maximization (CMAX). In this paper, we introduce an efficient priority based routing power management heuristic in order to increase both coverage and extend lifetime by managing the power at the sensor level. We accomplished that by setting priority metric in addition to dividing the node energy into two ratios;one for the sensor node originated data and the other part is for data relays from other sensors. This heuristic, which is called pERPMT (priority Efficient Routing Power Management Technique), has been applied to two well know routing techniques. Results from running extensive simulation runs revealed the superiority of the new methodology pERPMT over existing heuristics. The pEPRMT increases the lifetime up to 77% and 54% when compared to OML and CMAX respectively.
文摘This paper presents a novel real-time routing protocol, called CBRR, with less energy consumption for wireless sensor networks (WSNs). End-to-End real-time requirements are fulfilled with speed or delay constraint at each hop through integrating the contention and neighbor table mechanisms. More precisely, CBRR maintains a neighbor table via the contention mechanism being dependent on wireless broadcast instead of beacons. Comprehensive simulations show that CBRR can not only achieve higher performance in static networks, but also work well for dynamic networks.
文摘This work proposes a geographic routing protocol for UWSNs based on the construction of a 3D virtual grid structure, called Void-Avoidance Grid-based Multipath Position-based Routing (VA-GMPR). It consists of two main components, the multipath routing scheme and the grid-based void avoidance (GVA) mechanism for handling routing holes. The multipath routing scheme adopts node-disjoint routes from the source to the sink in order to enhance network reliability and load balancing. While the GVA mechanism handles the problem of holes in 3D virtual grid structure based on three techniques: Hole bypass, path diversion, and path backtracking. The performance evaluation of the VA-GMPR protocol was compared to a recently proposed grid-based routing protocol for UWSNs, called Energy-efficient Multipath Geographic Grid-based Routing (EMGGR). The results showed that the VA-GMPR protocol outperformed the EMGGR protocol in terms of packet delivery ratio, and end-to end-delay. However, the results also showed that the VA-GMPR protocol exhibited higher energy consumption compared to EMGGR.
文摘The IEEE 802.15.4 standard utilizes the CSMA-CA mechanism to control nodes’ access to the shared wireless communication medium. CSMA-CA implements the Binary Exponential Backoff (BEB) algorithm by which a node refrains from sending any packet before the expiry of its backoff period. After that, the node is required to sense the medium for two successive time slots to assert that the medium is clear from any ongoing transmissions (this is referred to as Clear Channel Assessment (CCA)). Upon finding the medium busy, the node doubles its backoff period and repeats that process. While effective in reducing the likelihood of collisions, this approach takes no measures to preserve the priorities among the nodes contending to access the medium. In this paper we propose the Priority-Based BEB (PB-BEB) algorithm in which we enhance BEB such that nodes’ priority is preserved. We provide a simulation study to examine the performance of PB-BEB. Our simulations show that the latter not only outperforms BEB in terms of fairness, but also show promising results in terms other parameters like channel utilization, reliability, and power conservation.
文摘This work proposes an efficient disjoint multipath geographic routing algorithm for dense wireless sensor networks (WSN), called Multipath Grid-based Enabled Geographic Routing (MGEGR). The proposed algorithm relies on the construction of a 2-D logical grid in the geographical region of deployment. The objective of the proposed scheme is to determine optimal or near-optimal (within a defined constant) multiple disjoint paths (multipath) from a source node to the sink, in order to enhance the reliability of the network. The determined multiple disjoint paths would be used by the source node in a round-robin way to balance the traffic across the disjoint paths, and to avoid discovered paths with cell holes. The proposed scheme limits the use of broadcasting to the process of gateway election within each cell, and the process of maintaining the table of neighbors of each gateway. Our simulation results show the effectiveness and scalability of our routing scheme with increased network size compared to on-demand routing protocols.
基金supported by National Natural Science Foundation of China Grant No. 60803150, No.60803151the National High Technology Research and Development Program of China under grant Nos.2008AA01Z411+1 种基金the Key Program of NSFC-Guangdong Union Foundation under Grant No.U0835004China Postdoctoral Science Foundation No. 20090451495
文摘Wireless sensor networks are open architectures, so any potential threat can easily intercept, wiretap and counterfeit the information. Therefore, the safety of WSN is very important. Since any single key system cannot guarantee the security of the wireless sensor network for communications, this paper introduces a hierarchical key management scheme based on the different abilities of different sensor nodes in the clustered wireless sensor network. In this scheme, the nodes are distributed into several clusters, and a cluster head must be elected for each cluster. Private communication between cluster heads is realized through the encryption system based on the identity of each head while private communication between cluster nodes in a same cluster head is achieved through the random key preliminary distribution system. Considering the characteristics of WSN, we adopt dynamic means called dynamic cluster key management scheme to deal with master key, so master key will be updated according to the changed dynamic network topology. For cluster head node plays a pivotal role in this scheme, a trust manage-ment system should be introduced into the election of the cluster head which will exclude the malicious node from outside the cluster, thus improve the whole network security.
文摘One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.
文摘Node localization is commonly employed in wireless networks. For example, it is used to improve routing and enhance security. Localization algorithms can be classified as range-free or range-based. Range-based algorithms use location metrics such as ToA, TDoA, RSS, and AoA to estimate the distance between two nodes. Proximity sensing between nodes is typically the basis for range-free algorithms. A tradeoff exists since range-based algorithms are more accurate but also more complex. However, in applications such as target tracking, localization accuracy is very important. In this paper, we propose a new range-based algorithm which is based on the density-based outlier detection algorithm (DBOD) from data mining. It requires selection of the K-nearest neighbours (KNN). DBOD assigns density values to each point used in the location estimation. The mean of these densities is calculated and those points having a density larger than the mean are kept as candidate points. Different performance measures are used to compare our approach with the linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD) algorithms. It is shown that the proposed algorithm performs better than these algorithms even when the anchor geometry about an unlocalized node is poor.
文摘In this paper, a two-tiered Wireless Sensor Network (WSN) where nodes are divided into clusters and nodes forward data to base stations through cluster heads is considered. To maximize the network lifetime, two energy efficient approaches are investigated. We first propose an approach that optimally locates the base stations within the network so that the distance between each cluster head and its closest base station is decreased. Then, a routing technique is developed to arrange the communication between cluster heads toward the base stations in order to guaranty that the gathered information effectively and efficiently reach the application. The overall dynamic framework that combines the above two schemes is described and evaluated. The experimental performance evaluation demonstrates the efficacy of topology control as a vital process to maximize the network lifetime of WSNs.
文摘This paper examines the optimization of the lifetime and energy consumption of Wireless Sensor Networks (WSNs). These two competing objectives have a deep influence over the service qualification of networks and according to recent studies, cluster formation is an appropriate solution for their achievement. To transmit aggregated data to the Base Station (BS), logical nodes called Cluster Heads (CHs) are required to relay data from the fixed-range sensing nodes located in the ground to high altitude aircraft. This study investigates the Genetic Algorithm (GA) as a dynamic technique to find optimum states. It is a simple framework that includes a proposed mathematical formula, which increasing in coverage is benchmarked against lifetime. Finally, the implementation of the proposed algorithm indicates a better efficiency compared to other simulated works.
文摘The solution we propose optimizes the energy inside the wireless sensor network (WSN) with higher performance. The WSN is composed of many sensors nodes which collect the information, treat that information then send it to the base station. The information is received by the base station (BS) then data?are?sent to the users by that BS. The most important element in sensor node is energy, as the lifetime of wireless sensor network depends on the sensor node energy. So many researches had been made in order to improve this energy basing routing protocols. As a result, we are able to propose a solution that optimizes this energy. In this paper, we are presenting a new approach of selecting node sensor base on routing protocol and process to send data to the base station. This ameliorates wireless sensor network lifetime and increases?the transmission sensor node to base station.
文摘Research interest in sensor networks routing largely considers minimization of energy consumption as a major performance criterion to provide maximum sensors network lifetime. When considering energy conservation, routing protocols should also be designed to achieve fault tolerance in communications. Moreover, due to dynamic topology and random deployment, incorporating reliability into protocols for WSNs is very important. Hence, we propose an improved scalable clustering-based load balancing scheme (SCLB) in this paper. In SCLB scheme, scalability is achieved by dividing the network into overlapping multihop clusters each with its own cluster head node. Simulation results show that the proposed scheme achieves longer network lifetime with desirable reliability at the initial state compare with the existing multihop load balancing approach.
文摘In Wireless Sensor Networks (WSN), the lifetime of sensors is the crucial issue. Numerous schemes are proposed to augment the life time of sensors based on the wide range of parameters. In majority of the cases, the center of attraction will be the nodes’ lifetime enhancement and routing. In the scenario of cluster based WSN, multi-hop mode of communication reduces the communication cast by increasing average delay and also increases the routing overhead. In this proposed scheme, two ideas are introduced to overcome the delay and routing overhead. To achieve the higher degree in the lifetime of the nodes, the residual energy (remaining energy) of the nodes for multi-hop node choice is taken into consideration first. Then the modification in the routing protocol is evolved (Multi-Hop Dynamic Path-Selection Algorithm—MHDP). A dynamic path updating is initiated in frequent interval based on nodes residual energy to avoid the data loss due to path extrication and also to avoid the early dying of nodes due to elevation of data forwarding. The proposed method improves network’s lifetime significantly. The diminution in the average delay and increment in the lifetime of network are also accomplished. The MHDP offers 50% delay lesser than clustering. The average residual energy is 20% higher than clustering and 10% higher than multi-hop clustering. The proposed method improves network lifetime by 40% than clustering and 30% than multi-hop clustering which is considerably much better than the preceding methods.
文摘The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission in wireless sensor network is concluded as a kind of responsibility transmission. By redefining the responsibility and availability of nodes, the strategy for cluster head selection is studied, the responsibility and availability is determined by the combination of the residual energy, location and current flow of nodes. Based on the above, new clustering network topology control algorithm based on responsibility transmission CNTCABRT and hierarchical multi-hop CNTCABRT is presented in this paper, whose algorithm structure is along the famous LEACH algorithm. Experimental result demonstrates its promising performance over the famous LEACH algorithm in the cluster head selection, the size of cluster, the deployment of nodes and the lifetime of nodes, and several innovative conclusions are proposed finally.
