Time synchronization is one of the base techniques in wireless sensor networks(WSNs).This paper proposes a novel time synchronization protocol which is a robust consensusbased algorithm in the existence of transmissio...Time synchronization is one of the base techniques in wireless sensor networks(WSNs).This paper proposes a novel time synchronization protocol which is a robust consensusbased algorithm in the existence of transmission delay and packet loss.It compensates for transmission delay and packet loss firstly,and then,estimates clock skew and clock offset in two steps.Simulation and experiment results show that the proposed protocol can keep synchronization error below 2μs in the grid network of 10 nodes or the random network of 90 nodes.Moreover,the synchronization accuracy in the proposed protocol can keep constant when the WSN works up to a month.展开更多
Mutual synchronization is a ubiquitous phenomenon that exists in various natural systems. The individual participants in this process can be modeled as oscillators, which interact by discrete pulses. In this paper, we...Mutual synchronization is a ubiquitous phenomenon that exists in various natural systems. The individual participants in this process can be modeled as oscillators, which interact by discrete pulses. In this paper, we analyze the synchronization condition of two- and multi-oscillators system, and propose a linear pulse-coupled oscillators model. We prove that the proposed model can achieve synchronization for almost all conditions. Numerical simulations are also included to investigate how different model parameters affect the synchronization. We also discuss the implementation of the model as a new approach for time synchronization in wireless sensor networks.展开更多
In this work we find a lower bound on the energy required for synchronizing moving sensor nodes in a Wireless Sensor Network (WSN) affected by large-scale fading, based on clock estimation techniques. The energy requi...In this work we find a lower bound on the energy required for synchronizing moving sensor nodes in a Wireless Sensor Network (WSN) affected by large-scale fading, based on clock estimation techniques. The energy required for synchronizing a WSN within a desired estimation error level is specified by both the transmit power and the required number of messages. In this paper we extend our previous work introducing nodes’ movement and the average message delay in the total energy, including a comprehensive analysis on how the distance between nodes impacts on the energy and synchronization quality trade-off under large-scale fading effects.展开更多
L-SYNC is a synchronization protocol for Wireless Sensor Networks which is based on larger degree clustering providing efficiency in homogeneous topologies. In L-SYNC, the effectiveness of the routing algorithm for th...L-SYNC is a synchronization protocol for Wireless Sensor Networks which is based on larger degree clustering providing efficiency in homogeneous topologies. In L-SYNC, the effectiveness of the routing algorithm for the synchronization precision of two remote nodes was considered. Clustering in L-SYNC is according to larger degree techniques. These techniques reduce cluster overlapping, resulting in the routing algorithm requiring fewer hops to move from one cluster to another remote cluster. Even though L-SYNC offers higher precision compared to other algorithms, it does not support heterogeneous topologies and its synchronization algorithm can be influenced by unreliable data. In this paper, we present the L-SYNCng (L-SYNC next generation) protocol, working in heterogeneous topologies. Our proposed protocol is scalable in unreliable and noisy environments. Simulation results illustrate that L-SYNCng has better precision in synchronization and scalability.展开更多
Time synchronization is a critical middleware service of wireless sensor networks. Researchers have already proposed some time synchronization algorithms. However, due to the demands for various synchronization precis...Time synchronization is a critical middleware service of wireless sensor networks. Researchers have already proposed some time synchronization algorithms. However, due to the demands for various synchronization precision, existing time synchronization algorithms often need to be adapted. So it is necessary to evaluate these adapted algorithms before use. Software simulation is a valid and quick way to do it. In this paper, we present a time synchronization simulator, Simsync, for wireless sensor networks. We decompose the packet delay into 6 delay components and model them separately. The frequency of crystal oscillator is modeled as Gaussian. To testify its effectiveness, we simulate the reference broadcast synchronization algorithm (RBS) and the timing-sync synchronization algorithm (TPSN) on Simsync. Simulated results are also presented and analyzed.展开更多
This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and off...This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and offsets, the algorithm is designed to include offset compensation and skew compensation. The local clocks are not directly modified, thus the virtual clocks are built according to the local clocks via the compensation parameters. Each node achieves a virtual consensus clock by periodically updated compensation parameters. Finally, the effectiveness of the proposed algorithm is verified through a number of simulations in a mesh network. It is proved that the proposed algorithm has the advantage of being distributed, asymptotic convergence, and robust to new node joining.展开更多
To cope with the arbitrariness of the network delays,a novel method,referred to as the composite particle filter approach based on variational Bayesian(VB-CPF),is proposed herein to estimate the clock skew and clock o...To cope with the arbitrariness of the network delays,a novel method,referred to as the composite particle filter approach based on variational Bayesian(VB-CPF),is proposed herein to estimate the clock skew and clock offset in wireless sensor networks.VB-CPF is an improvement of the Gaussian mixture kalman particle filter(GMKPF)algorithm.In GMKPF,Expectation-Maximization(EM)algorithm needs to determine the number of mixture components in advance,and it is easy to generate overfitting and underfitting.Variational Bayesian EM(VB-EM)algorithm is introduced in this paper to determine the number of mixture components adaptively according to the observations.Moreover,to solve the problem of data packet loss caused by unreliable links,we propose a robust time synchronization(RTS)method in this paper.RTS establishes an autoregressive model for clock skew,and calculates the clock parameters based on the established autoregressive model in case of packet loss.The final simulation results illustrate that VB-CPF yields much more accurate results relative to GMKPF when the network delays are modeled in terms of an asymmetric Gaussian distribution.Moreover,RTS shows good robustness to the continuous and random dropout of time messages.展开更多
Many efforts have been made to develop time division multiple access (TDMA) slots allocation in a multi-hop converge-cast wireless sensor network (WSN), however, most of them either use complex algorithm or concer...Many efforts have been made to develop time division multiple access (TDMA) slots allocation in a multi-hop converge-cast wireless sensor network (WSN), however, most of them either use complex algorithm or concern frames only without simultaneous transmission in a single slot. In this paper, we present a timeslot assignment scheme for cluster-tree-based TDMA WSN, co:'ering three frequently used working modes in practical applications. The shortest frame formed can guarantee real-time conununication and is also facilitated for message and slot integration, since timeslots allocated to a single node are continuous. During allocation processes, the algorithms are distributed and light-weighted. The experiment resulted from a WSN prototype system shows that our scheme can achieve a good reliability.展开更多
In this work, the existing trade-off between time synchronization quality and energy is studied for both large-scale and small-scale fading wireless channels. We analyze the clock offset estimation problem using one-w...In this work, the existing trade-off between time synchronization quality and energy is studied for both large-scale and small-scale fading wireless channels. We analyze the clock offset estimation problem using one-way, two-way and N-way message exchange mechanisms affected by Gaussian and exponentially distributed impairments. Our main contribution is a general relationship between the total energy required for synchronizing a wireless sensor network and the clock offset estimation error by means of the transmit power, number of transmitted messages and average message delay, deriving the energy optimal lower bound as a function of the time synchronization quality and the number of hops in a multi-hop network.展开更多
The Data Timed Sending (DTS) protocol contributes to the energy savings in Wireless Sensor Networks (WSNs) and prolongs the sensor nodes’ battery lifetime. DTS saves energy by transmitting short packets, without data...The Data Timed Sending (DTS) protocol contributes to the energy savings in Wireless Sensor Networks (WSNs) and prolongs the sensor nodes’ battery lifetime. DTS saves energy by transmitting short packets, without data payload, from the sensor nodes to the base station or the cluster head according to the Time Division Multiple Access (TDMA) scheduling. Placing the short packets into appropriate slots and subslots in the TDMA frames transfers the information about the measured values and node identity. This paper presents the proof of concept of the proposed DTS protocol and provides verification of the energy savings using the QualNet®communication simulation platform (QualNet) and the SunTM Small Programmable Object Technology (Sun SPOT) testbed platform (for single hop and multi hop scenarios). The simulations and the testbed measurements confirm that the DTS protocol can provide energy savings up to 30% when compared with the IEEE 802.15.4 standard in unslotted Carrier Sense Multiple Access with Collision Avoidance (CSMA-CA) mode at 2.4 GHz frequency band.展开更多
The threat of malware in wireless sensor network has stimulated some activities to model and analyze the malware prevalence.To understand the dynamics of malware propagation in wireless sensor network,we propose a nov...The threat of malware in wireless sensor network has stimulated some activities to model and analyze the malware prevalence.To understand the dynamics of malware propagation in wireless sensor network,we propose a novel epidemic model named as e-SEIR(susceptible-exposed-infectious-recovered)model,which is a set of delayed differential equations,in this paper.The model has taken into account the following two factors:1 Multi-state antivirus measures;2 Temporary immune period.Then,the stability and Hopf bifurcation at the equilibria of linearized model are carefully analyzed by considering the distribution of eigenvalues of characteristic equations.Both mathematical analysis and numerical simulations show that the dynamical features of the proposed model rely on the basic reproduction number R0 and time delayτ.This novel model can help us to better understand and predict the propagation behaviors of malware in wireless sensor networks.展开更多
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.展开更多
Recent advances in wireless sensor technology have enabled simultaneous exploitation of multiple channels in wireless sensor systems. In this paper, a novel time synchronization algorithm is proposed for multi- channe...Recent advances in wireless sensor technology have enabled simultaneous exploitation of multiple channels in wireless sensor systems. In this paper, a novel time synchronization algorithm is proposed for multi- channel Wireless Sensor Networks (WSNs) called Multi-Channel Time Synchronization (MCTS) protocol. Time synchronization is critical for many WSN applications and enables efficient communications between sensor nodes along with intelligent spectrum access. Contrary to many existing protocols that do not exploit multi-channel communications, the protocol takes advantage of potential multiple channels and distributes the synchronization of different nodes to distinct channels and thus, reduces the convergence time of synchronization processes significantly.展开更多
To aware the topology of wireless sensor networks (WSN) with time-variety, and load-balance the resource of communication and energy, an opportunistic routing protocol for WSN based on Opportunistic Routing Entropy an...To aware the topology of wireless sensor networks (WSN) with time-variety, and load-balance the resource of communication and energy, an opportunistic routing protocol for WSN based on Opportunistic Routing Entropy and ant colony optimization, called ACO-TDOP, is proposed. At first, based on the second law of thermo-dynamics, we introduce the concept of Opportunistic Routing Entropy which is a parameter representing the transmission state of each node by taking into account the power left and the distance to the sink node. Then, it is proved that the problem of route thinking about Opportunistic Routing Entropy is shown to be NP-hard. So the protocol, ACO-TDOP, is proposed. At last, numerical results confirm that the ACO-TDOP is energy conservative and throughput gainful compared with other two existing routing protocols, and show that it is efficacious to analyze and uncover fundamental of message transmission with Opportunistic Routing in wireless network using the second law of thermodynamics.展开更多
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.展开更多
In order to improve network connectivity in clustered wireless sensor networks,a node cooperative algorithm based on virtual antenna arrays is proposed.All the nodes in the network are assumed to be clustered via Pois...In order to improve network connectivity in clustered wireless sensor networks,a node cooperative algorithm based on virtual antenna arrays is proposed.All the nodes in the network are assumed to be clustered via Poisson Voronoi tessellation(PVT).The activation of the node cooperative algorithm is determined by the cluster heads(CHs) according to communication links.When the cooperative algorithm is activated,the CH selects cooperative nodes(CNs) from its members to form a virtual antenna array.With the cooperation,nodes can extend the inter-cluster communication range to directly contact with further nodes after a coverage hole is detected,or compensate for channel gains while inter-cluster transmission fails due to deep channel fading.Simulation results show that the proposed algorithm achieves better network connectivity and energy efficiency.It can reduce outage probability,sustain network connectivity and maintain operations as long as possible,which prolongs network operation time.展开更多
[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectual...[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectualization. [Method] Based on the application characteristics of Wireless Sensor Network (WSN), the intelligent greenhouse monitoring system was designed. And for the incompleteness strategy of load balancing in the Low-Energy Adaptive Clustering Hierarchy (LEACH), a Real- time Threshold Routing Algorithm (RTRA) was proposed. [Result] The performance of network lifetime and network delay of RTRA were tested in MATLAB and found that, within the same testing environment, RTRA can save nodes energy consumption, prolong network lifetime, and had better real-time performance than LEACH. The al- gorithm satisfies the crops' requirements on real-time and energy efficiency in the greenhouse system. [Conclusion] For the good performance on real-time, the de- signed intelligent greenhouse real-time monitoring system laid the foundation for the research and development of agricultural informatization and intellectualization.展开更多
Wireless Sensor Networks(WSNs) has become a popular research topic due to its resource constraints. Energy consumption and transmission delay is crucial requirement to be handled to enhance the popularity of WSNs. In ...Wireless Sensor Networks(WSNs) has become a popular research topic due to its resource constraints. Energy consumption and transmission delay is crucial requirement to be handled to enhance the popularity of WSNs. In order to overcome these issues, we have proposed an Efficient Packet Scheduling Technique for Data Merging in WSNs. Packet scheduling is done by using three levels of priority queue and to reduce the transmission delay. Real-time data packets are placed in high priority queue and Non real-time data packets based on local or remote data are placed on other queues. In this paper, we have used Time Division Multiple Access(TDMA) scheme to efficiently determine the priority of the packet at each level and transmit the data packets from lower level to higher level through intermediate nodes. To reduce the number of transmission, efficient data merge technique is used to merge the data packet in intermediate nodes which has same destination node. Data merge utilize the maximum packet size by appending the merged packets with received packets till the maximum packet size or maximum waiting time is reached. Real-time data packets are directly forwarded to the next node without applying data merge. The performance is evaluated under various metrics like packet delivery ratio, packet drop, energy consumption and delay based on changing the number of nodes and transmission rate. Our results show significant reduction in various performance metrics.展开更多
As wireless sensor networks (WSN) are deployed in fire monitoring, object tracking applications, security emerges as a central requirement. A case that Sybil node illegitimately reports messages to the master node w...As wireless sensor networks (WSN) are deployed in fire monitoring, object tracking applications, security emerges as a central requirement. A case that Sybil node illegitimately reports messages to the master node with multiple non-existent identities (ID) will cause harmful effects on decision-making or resource allocation in these applications. In this paper, we present an efficient and lightweight solution for Sybil attack detection based on the time difference of arrival (TDOA) between the source node and beacon nodes. This solution can detect the existence of Sybil attacks, and locate the Sybil nodes. We demonstrate efficiency of the solution through experiments. The experiments show that this solution can detect all Sybil attack cases without missing.展开更多
In this paper,a model with two mutual learning neural networks named Tree Parity Machine(TPM) is firstly introduced,as well as its cryptographic property of weight synchronization with that of chaos cryptography is co...In this paper,a model with two mutual learning neural networks named Tree Parity Machine(TPM) is firstly introduced,as well as its cryptographic property of weight synchronization with that of chaos cryptography is comparatively discussed. A full empirical study on the stability and security of the TPM weight synchronization is conducted in detail. Then two improvement methods for the weight synchronization are proposed. Experiment results show that the improved TPM synchronization model can be efficiently against the third party attack. At last,a lightweight TPM-based key management scheme is proposed for TinySec on wireless sensor networks,which is full implemented on the Mica2 node and the performance test result is acceptable.展开更多
文摘Time synchronization is one of the base techniques in wireless sensor networks(WSNs).This paper proposes a novel time synchronization protocol which is a robust consensusbased algorithm in the existence of transmission delay and packet loss.It compensates for transmission delay and packet loss firstly,and then,estimates clock skew and clock offset in two steps.Simulation and experiment results show that the proposed protocol can keep synchronization error below 2μs in the grid network of 10 nodes or the random network of 90 nodes.Moreover,the synchronization accuracy in the proposed protocol can keep constant when the WSN works up to a month.
文摘Mutual synchronization is a ubiquitous phenomenon that exists in various natural systems. The individual participants in this process can be modeled as oscillators, which interact by discrete pulses. In this paper, we analyze the synchronization condition of two- and multi-oscillators system, and propose a linear pulse-coupled oscillators model. We prove that the proposed model can achieve synchronization for almost all conditions. Numerical simulations are also included to investigate how different model parameters affect the synchronization. We also discuss the implementation of the model as a new approach for time synchronization in wireless sensor networks.
文摘In this work we find a lower bound on the energy required for synchronizing moving sensor nodes in a Wireless Sensor Network (WSN) affected by large-scale fading, based on clock estimation techniques. The energy required for synchronizing a WSN within a desired estimation error level is specified by both the transmit power and the required number of messages. In this paper we extend our previous work introducing nodes’ movement and the average message delay in the total energy, including a comprehensive analysis on how the distance between nodes impacts on the energy and synchronization quality trade-off under large-scale fading effects.
文摘L-SYNC is a synchronization protocol for Wireless Sensor Networks which is based on larger degree clustering providing efficiency in homogeneous topologies. In L-SYNC, the effectiveness of the routing algorithm for the synchronization precision of two remote nodes was considered. Clustering in L-SYNC is according to larger degree techniques. These techniques reduce cluster overlapping, resulting in the routing algorithm requiring fewer hops to move from one cluster to another remote cluster. Even though L-SYNC offers higher precision compared to other algorithms, it does not support heterogeneous topologies and its synchronization algorithm can be influenced by unreliable data. In this paper, we present the L-SYNCng (L-SYNC next generation) protocol, working in heterogeneous topologies. Our proposed protocol is scalable in unreliable and noisy environments. Simulation results illustrate that L-SYNCng has better precision in synchronization and scalability.
基金Supported in part by National Basic Research Program of P. R. China(2005CB321604) in part by National Natural Science Foundation of P. R. China (90207002)
文摘Time synchronization is a critical middleware service of wireless sensor networks. Researchers have already proposed some time synchronization algorithms. However, due to the demands for various synchronization precision, existing time synchronization algorithms often need to be adapted. So it is necessary to evaluate these adapted algorithms before use. Software simulation is a valid and quick way to do it. In this paper, we present a time synchronization simulator, Simsync, for wireless sensor networks. We decompose the packet delay into 6 delay components and model them separately. The frequency of crystal oscillator is modeled as Gaussian. To testify its effectiveness, we simulate the reference broadcast synchronization algorithm (RBS) and the timing-sync synchronization algorithm (TPSN) on Simsync. Simulated results are also presented and analyzed.
基金Supported by the National Natural Science Foundation of China(No.61340034)the Research Program of Application Foundation and Advanced Technology of Tianjin(No.13JCYBJC15600)
文摘This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and offsets, the algorithm is designed to include offset compensation and skew compensation. The local clocks are not directly modified, thus the virtual clocks are built according to the local clocks via the compensation parameters. Each node achieves a virtual consensus clock by periodically updated compensation parameters. Finally, the effectiveness of the proposed algorithm is verified through a number of simulations in a mesh network. It is proved that the proposed algorithm has the advantage of being distributed, asymptotic convergence, and robust to new node joining.
基金This work was supported by the National Natural Science Foundation of China(No.61672299)the Natural Science Foundation of the Higher Education Institutions of Jiangsu Province of China(No.18KJB520035)+2 种基金the Youth Foundation of Nanjing University of Finance and Economics(No.L-JXL18002)the Youth Foundation of Nanjing University of Posts and Telecommunications(No.NY218142)the Natural Science Foundation of Jiangsu Province(No.BK20160913).
文摘To cope with the arbitrariness of the network delays,a novel method,referred to as the composite particle filter approach based on variational Bayesian(VB-CPF),is proposed herein to estimate the clock skew and clock offset in wireless sensor networks.VB-CPF is an improvement of the Gaussian mixture kalman particle filter(GMKPF)algorithm.In GMKPF,Expectation-Maximization(EM)algorithm needs to determine the number of mixture components in advance,and it is easy to generate overfitting and underfitting.Variational Bayesian EM(VB-EM)algorithm is introduced in this paper to determine the number of mixture components adaptively according to the observations.Moreover,to solve the problem of data packet loss caused by unreliable links,we propose a robust time synchronization(RTS)method in this paper.RTS establishes an autoregressive model for clock skew,and calculates the clock parameters based on the established autoregressive model in case of packet loss.The final simulation results illustrate that VB-CPF yields much more accurate results relative to GMKPF when the network delays are modeled in terms of an asymmetric Gaussian distribution.Moreover,RTS shows good robustness to the continuous and random dropout of time messages.
基金Supported by the National High Technology Research and Development Programme of China ( No. 2006AA040302 2007AA041201 +1 种基金 2007AA041301 )the National Creative Research Groups Science Foundation of China (No. 60721062)
文摘Many efforts have been made to develop time division multiple access (TDMA) slots allocation in a multi-hop converge-cast wireless sensor network (WSN), however, most of them either use complex algorithm or concern frames only without simultaneous transmission in a single slot. In this paper, we present a timeslot assignment scheme for cluster-tree-based TDMA WSN, co:'ering three frequently used working modes in practical applications. The shortest frame formed can guarantee real-time conununication and is also facilitated for message and slot integration, since timeslots allocated to a single node are continuous. During allocation processes, the algorithms are distributed and light-weighted. The experiment resulted from a WSN prototype system shows that our scheme can achieve a good reliability.
文摘In this work, the existing trade-off between time synchronization quality and energy is studied for both large-scale and small-scale fading wireless channels. We analyze the clock offset estimation problem using one-way, two-way and N-way message exchange mechanisms affected by Gaussian and exponentially distributed impairments. Our main contribution is a general relationship between the total energy required for synchronizing a wireless sensor network and the clock offset estimation error by means of the transmit power, number of transmitted messages and average message delay, deriving the energy optimal lower bound as a function of the time synchronization quality and the number of hops in a multi-hop network.
文摘The Data Timed Sending (DTS) protocol contributes to the energy savings in Wireless Sensor Networks (WSNs) and prolongs the sensor nodes’ battery lifetime. DTS saves energy by transmitting short packets, without data payload, from the sensor nodes to the base station or the cluster head according to the Time Division Multiple Access (TDMA) scheduling. Placing the short packets into appropriate slots and subslots in the TDMA frames transfers the information about the measured values and node identity. This paper presents the proof of concept of the proposed DTS protocol and provides verification of the energy savings using the QualNet®communication simulation platform (QualNet) and the SunTM Small Programmable Object Technology (Sun SPOT) testbed platform (for single hop and multi hop scenarios). The simulations and the testbed measurements confirm that the DTS protocol can provide energy savings up to 30% when compared with the IEEE 802.15.4 standard in unslotted Carrier Sense Multiple Access with Collision Avoidance (CSMA-CA) mode at 2.4 GHz frequency band.
基金National Natural Science Foundation of China(No.61379125)
文摘The threat of malware in wireless sensor network has stimulated some activities to model and analyze the malware prevalence.To understand the dynamics of malware propagation in wireless sensor network,we propose a novel epidemic model named as e-SEIR(susceptible-exposed-infectious-recovered)model,which is a set of delayed differential equations,in this paper.The model has taken into account the following two factors:1 Multi-state antivirus measures;2 Temporary immune period.Then,the stability and Hopf bifurcation at the equilibria of linearized model are carefully analyzed by considering the distribution of eigenvalues of characteristic equations.Both mathematical analysis and numerical simulations show that the dynamical features of the proposed model rely on the basic reproduction number R0 and time delayτ.This novel model can help us to better understand and predict the propagation behaviors of malware in wireless sensor networks.
文摘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.
基金supported in part by TEKES(Finnish Funding Agency for Technology and Innovation)as part of the Wireless Sensor and Actuator Networks for Measurement and Control(WiSA-II)programby the U.S.Army Research Office under Cooperative Agreement W911NF-04-2-0054.
文摘Recent advances in wireless sensor technology have enabled simultaneous exploitation of multiple channels in wireless sensor systems. In this paper, a novel time synchronization algorithm is proposed for multi- channel Wireless Sensor Networks (WSNs) called Multi-Channel Time Synchronization (MCTS) protocol. Time synchronization is critical for many WSN applications and enables efficient communications between sensor nodes along with intelligent spectrum access. Contrary to many existing protocols that do not exploit multi-channel communications, the protocol takes advantage of potential multiple channels and distributes the synchronization of different nodes to distinct channels and thus, reduces the convergence time of synchronization processes significantly.
文摘To aware the topology of wireless sensor networks (WSN) with time-variety, and load-balance the resource of communication and energy, an opportunistic routing protocol for WSN based on Opportunistic Routing Entropy and ant colony optimization, called ACO-TDOP, is proposed. At first, based on the second law of thermo-dynamics, we introduce the concept of Opportunistic Routing Entropy which is a parameter representing the transmission state of each node by taking into account the power left and the distance to the sink node. Then, it is proved that the problem of route thinking about Opportunistic Routing Entropy is shown to be NP-hard. So the protocol, ACO-TDOP, is proposed. At last, numerical results confirm that the ACO-TDOP is energy conservative and throughput gainful compared with other two existing routing protocols, and show that it is efficacious to analyze and uncover fundamental of message transmission with Opportunistic Routing in wireless network using the second law of thermodynamics.
文摘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.
基金The National Natural Science Foundation of China ( No.60872004, 60972026)the Important National Science and Technology Specific Projects (No. 2010ZX03006-002-01)the Research Fund of the National Mobile Communications Research Laboratory of Southeast University (No.2010A08)
文摘In order to improve network connectivity in clustered wireless sensor networks,a node cooperative algorithm based on virtual antenna arrays is proposed.All the nodes in the network are assumed to be clustered via Poisson Voronoi tessellation(PVT).The activation of the node cooperative algorithm is determined by the cluster heads(CHs) according to communication links.When the cooperative algorithm is activated,the CH selects cooperative nodes(CNs) from its members to form a virtual antenna array.With the cooperation,nodes can extend the inter-cluster communication range to directly contact with further nodes after a coverage hole is detected,or compensate for channel gains while inter-cluster transmission fails due to deep channel fading.Simulation results show that the proposed algorithm achieves better network connectivity and energy efficiency.It can reduce outage probability,sustain network connectivity and maintain operations as long as possible,which prolongs network operation time.
基金Supported by the Science and Technology Surface Project of Yunnan Province(2010ZC142)the Doctoral Foundation of Dali University(KYBS201015),the Scientific Research Program for College Students of Dali University~~
文摘[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectualization. [Method] Based on the application characteristics of Wireless Sensor Network (WSN), the intelligent greenhouse monitoring system was designed. And for the incompleteness strategy of load balancing in the Low-Energy Adaptive Clustering Hierarchy (LEACH), a Real- time Threshold Routing Algorithm (RTRA) was proposed. [Result] The performance of network lifetime and network delay of RTRA were tested in MATLAB and found that, within the same testing environment, RTRA can save nodes energy consumption, prolong network lifetime, and had better real-time performance than LEACH. The al- gorithm satisfies the crops' requirements on real-time and energy efficiency in the greenhouse system. [Conclusion] For the good performance on real-time, the de- signed intelligent greenhouse real-time monitoring system laid the foundation for the research and development of agricultural informatization and intellectualization.
文摘Wireless Sensor Networks(WSNs) has become a popular research topic due to its resource constraints. Energy consumption and transmission delay is crucial requirement to be handled to enhance the popularity of WSNs. In order to overcome these issues, we have proposed an Efficient Packet Scheduling Technique for Data Merging in WSNs. Packet scheduling is done by using three levels of priority queue and to reduce the transmission delay. Real-time data packets are placed in high priority queue and Non real-time data packets based on local or remote data are placed on other queues. In this paper, we have used Time Division Multiple Access(TDMA) scheme to efficiently determine the priority of the packet at each level and transmit the data packets from lower level to higher level through intermediate nodes. To reduce the number of transmission, efficient data merge technique is used to merge the data packet in intermediate nodes which has same destination node. Data merge utilize the maximum packet size by appending the merged packets with received packets till the maximum packet size or maximum waiting time is reached. Real-time data packets are directly forwarded to the next node without applying data merge. The performance is evaluated under various metrics like packet delivery ratio, packet drop, energy consumption and delay based on changing the number of nodes and transmission rate. Our results show significant reduction in various performance metrics.
基金the Specialized Research Foundation for the Doctoral Program of Higher Education(Grant No.20050248043)
文摘As wireless sensor networks (WSN) are deployed in fire monitoring, object tracking applications, security emerges as a central requirement. A case that Sybil node illegitimately reports messages to the master node with multiple non-existent identities (ID) will cause harmful effects on decision-making or resource allocation in these applications. In this paper, we present an efficient and lightweight solution for Sybil attack detection based on the time difference of arrival (TDOA) between the source node and beacon nodes. This solution can detect the existence of Sybil attacks, and locate the Sybil nodes. We demonstrate efficiency of the solution through experiments. The experiments show that this solution can detect all Sybil attack cases without missing.
基金supported by the following funds:the Open Fund of the State Key Laboratory of Software Development Environment under Grant No.SKLSDE- 2009KF-2-01Beihang University, the National Basic Research Program of China (973 Program) under Grant No. 2005CB321901 and No.2010CB328106-3+1 种基金the Natural Science Foundation of China under Grant No.60773115the Open Fund of the Zhejiang Provincial Key Laboratory of Information Security
文摘In this paper,a model with two mutual learning neural networks named Tree Parity Machine(TPM) is firstly introduced,as well as its cryptographic property of weight synchronization with that of chaos cryptography is comparatively discussed. A full empirical study on the stability and security of the TPM weight synchronization is conducted in detail. Then two improvement methods for the weight synchronization are proposed. Experiment results show that the improved TPM synchronization model can be efficiently against the third party attack. At last,a lightweight TPM-based key management scheme is proposed for TinySec on wireless sensor networks,which is full implemented on the Mica2 node and the performance test result is acceptable.