2006年 第32卷 第6期
2006, 32(6): 839-845.
摘要:
Sensor network has experienced world-wide explosive interests in recent years. It combines the technology of modern microelectronic sensors, embedded computational processing systems, and modern computer and wireless networking methodologies. In this overview paper, we first provide some rationales for the growth of sensor networking. Then we discuss various basic concepts and hardware issues. Four basic application cases in the US. National Science Foundation funded Ceneter for Embedded Networked Sensing program at UCLA are presented. Finally, six challenging issues in sensor networks are discussed. Numerous references including relevant papers, books, and conferences that have appeared in recent years are given.
Sensor network has experienced world-wide explosive interests in recent years. It combines the technology of modern microelectronic sensors, embedded computational processing systems, and modern computer and wireless networking methodologies. In this overview paper, we first provide some rationales for the growth of sensor networking. Then we discuss various basic concepts and hardware issues. Four basic application cases in the US. National Science Foundation funded Ceneter for Embedded Networked Sensing program at UCLA are presented. Finally, six challenging issues in sensor networks are discussed. Numerous references including relevant papers, books, and conferences that have appeared in recent years are given.
2006, 32(6): 846-855.
摘要:
Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node should know the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, the neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.
Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node should know the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, the neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.
2006, 32(6): 856-866.
摘要:
Sensor networks provide means to link people with real world by processing data in real time collected from real-world and routing the query results to the right people. Application examples include continuous monitoring of environment, building infrastructures and human health. Many researchers view the sensor networks as databases, and the monitoring tasks are performed as subscriptions, queries, and alert. However, this point is not precise. First, databases can only deal with well-formed data types, with well-defined schema for their interpretation, while the raw data collected by the sensor networks, in most cases, do not fit to this requirement. Second, sensor networks have to deal with very dynamic targets, environment and resources, while databases are more static. In order to fill this gap between sensor networks and databases, we propose a novel approach, referred to as “spatiotemporal data stream segmentation”, or “stream segmentation” for short, to address the dynamic nature and deal with “raw” data of sensor networks. Stream segmentation is defined using Bayesian Networks in the context of sensor networks, and two application examples are given to demonstrate the usefulness of the approach.
Sensor networks provide means to link people with real world by processing data in real time collected from real-world and routing the query results to the right people. Application examples include continuous monitoring of environment, building infrastructures and human health. Many researchers view the sensor networks as databases, and the monitoring tasks are performed as subscriptions, queries, and alert. However, this point is not precise. First, databases can only deal with well-formed data types, with well-defined schema for their interpretation, while the raw data collected by the sensor networks, in most cases, do not fit to this requirement. Second, sensor networks have to deal with very dynamic targets, environment and resources, while databases are more static. In order to fill this gap between sensor networks and databases, we propose a novel approach, referred to as “spatiotemporal data stream segmentation”, or “stream segmentation” for short, to address the dynamic nature and deal with “raw” data of sensor networks. Stream segmentation is defined using Bayesian Networks in the context of sensor networks, and two application examples are given to demonstrate the usefulness of the approach.
2006, 32(6): 867-874.
摘要:
In wireless sensor networks, topology control plays an important role for data forwarding efficiency in the data gathering applications. In this paper, we present a novel topology control and data forwarding mechanism called REMUDA, which is designed for a practical indoor parking lot management system. REMUDA forms a tree-based hierarchical network topology which brings as many nodes as possible to be leaf nodes and constructs a virtual cluster structure. Meanwhile, it takes the reliability, stability and path length into account in the tree construction process. Through an experiment in a network of 30 real sensor nodes, we evaluate the performance of REMUDA and compare it with LEPS which is also a practical routing protocol in TinyOS. Experiment results show that REMUDA can achieve better performance than LEPS.
In wireless sensor networks, topology control plays an important role for data forwarding efficiency in the data gathering applications. In this paper, we present a novel topology control and data forwarding mechanism called REMUDA, which is designed for a practical indoor parking lot management system. REMUDA forms a tree-based hierarchical network topology which brings as many nodes as possible to be leaf nodes and constructs a virtual cluster structure. Meanwhile, it takes the reliability, stability and path length into account in the tree construction process. Through an experiment in a network of 30 real sensor nodes, we evaluate the performance of REMUDA and compare it with LEPS which is also a practical routing protocol in TinyOS. Experiment results show that REMUDA can achieve better performance than LEPS.
2006, 32(6): 875-880.
摘要:
Lossy link is one of the unique characteristics in random-deployed sensor networks. We envision that robustness and reliability of routing cannot be ensured purely in network layer. Our idea is to enhance the performance of routing protocol by cross-layer interaction. We modified mint protocol, a routing protocol in TinyOS and proposed an enhanced version of mint called PA-mint. A transmission power control interface is added to network layer in PA-mint. When routing performance of the current network is not satisfied, PA-mint monotonically increases the transmission power via the interface we added. PA-mint is able to connect orphan nodes and robust to node mobility or key nodes failure. In the case that automatic request retransmission is employed, the number of retransmissions can be reduced by PA-mint. Results from experiments show that PA-mint increases the reliability and robustness of routing protocol by cross-layer interaction.
Lossy link is one of the unique characteristics in random-deployed sensor networks. We envision that robustness and reliability of routing cannot be ensured purely in network layer. Our idea is to enhance the performance of routing protocol by cross-layer interaction. We modified mint protocol, a routing protocol in TinyOS and proposed an enhanced version of mint called PA-mint. A transmission power control interface is added to network layer in PA-mint. When routing performance of the current network is not satisfied, PA-mint monotonically increases the transmission power via the interface we added. PA-mint is able to connect orphan nodes and robust to node mobility or key nodes failure. In the case that automatic request retransmission is employed, the number of retransmissions can be reduced by PA-mint. Results from experiments show that PA-mint increases the reliability and robustness of routing protocol by cross-layer interaction.
2006, 32(6): 881-891.
摘要:
The data gathering manner of wireless sensor networks, in which data is forwarded towards the sink node, would cause the nodes near the sink node to transmit more data than those far from it. Most data gathering mechanisms now do not do well in balancing the energy consumption among nodes with different distances to the sink, thus they can hardly avoid the problem that nodes near the sink consume energy more quickly, which may cause the network rupture from the sink node. This paper presents a data gathering mechanism called PODA, which grades the output power of nodes according to their distances from the sink node. PODA balances energy consumption by setting the nodes near the sink with lower output power and the nodes far from the sink with higher output power. Simulation results show that the PODA mechanism can achieve even energy consumption in the entire network, improve energy efficiency and prolong the network lifetime.
The data gathering manner of wireless sensor networks, in which data is forwarded towards the sink node, would cause the nodes near the sink node to transmit more data than those far from it. Most data gathering mechanisms now do not do well in balancing the energy consumption among nodes with different distances to the sink, thus they can hardly avoid the problem that nodes near the sink consume energy more quickly, which may cause the network rupture from the sink node. This paper presents a data gathering mechanism called PODA, which grades the output power of nodes according to their distances from the sink node. PODA balances energy consumption by setting the nodes near the sink with lower output power and the nodes far from the sink with higher output power. Simulation results show that the PODA mechanism can achieve even energy consumption in the entire network, improve energy efficiency and prolong the network lifetime.
2006, 32(6): 892-899.
摘要:
Wireless sensor networks have already enabled numerous embedded wireless applications such as military, environmental monitoring, intelligent building, etc. Because micro-sensor nodes are supposed to operate for months or even years with very limited battery power source, it is a challenge for researchers to obtain long operating hour without scarifying original system performances. In this paper, the energy consumption sources of the wireless sensor networks are firstly analyzed, with the digital processing and radio transceiver units being emphasized. Then, we introduce the design scheme of our energy-aware wireless sensor network (GAINS). In GAINS, techniques to conserve the energy are exploited including the energy optimization node, software and energy-efficient communication protocol. The design architecture of our ultra low power wireless sensor network (WO-LPP) is specially presented.
Wireless sensor networks have already enabled numerous embedded wireless applications such as military, environmental monitoring, intelligent building, etc. Because micro-sensor nodes are supposed to operate for months or even years with very limited battery power source, it is a challenge for researchers to obtain long operating hour without scarifying original system performances. In this paper, the energy consumption sources of the wireless sensor networks are firstly analyzed, with the digital processing and radio transceiver units being emphasized. Then, we introduce the design scheme of our energy-aware wireless sensor network (GAINS). In GAINS, techniques to conserve the energy are exploited including the energy optimization node, software and energy-efficient communication protocol. The design architecture of our ultra low power wireless sensor network (WO-LPP) is specially presented.
2006, 32(6): 900-906.
摘要:
Recent advancements in wireless communication and microchip techniques have accelerated the development of wireless sensor networks (WSN). Key management in WSN is a critical and challenging problem because of the inner characteristics of sensor networks: deployed in hostile environments, limited resource and ad hoc nature. This paper investigates the constraints and special requirements of key management in sensor network environment, and some basic evaluation metrics are introduced. The key pre-distribution scheme is thought as the most suitable solution for key management problem in wireless sensor networks. It can be classified into four classes: pure probabilistic key predistribution, polynomial-based, Blom′s matrix-based, and deterministic key predistribution schemes. In each class of methods, the related research papers are discussed based on the basic evaluation metrics. Finally, the possible research directions in key management are discussed.
Recent advancements in wireless communication and microchip techniques have accelerated the development of wireless sensor networks (WSN). Key management in WSN is a critical and challenging problem because of the inner characteristics of sensor networks: deployed in hostile environments, limited resource and ad hoc nature. This paper investigates the constraints and special requirements of key management in sensor network environment, and some basic evaluation metrics are introduced. The key pre-distribution scheme is thought as the most suitable solution for key management problem in wireless sensor networks. It can be classified into four classes: pure probabilistic key predistribution, polynomial-based, Blom′s matrix-based, and deterministic key predistribution schemes. In each class of methods, the related research papers are discussed based on the basic evaluation metrics. Finally, the possible research directions in key management are discussed.
2006, 32(6): 907-914.
摘要:
Knowing the locations of nodes in wireless sensor networks (WSN) is essential for many applications. Nodes in a WSN can have multiple capabilities and exploiting one or more of the capabilities can help to solve the localization problem. In this paper, we assume that each node in a WSN has the capability of distance measurement and present a location computation technique called linear intersection for node localization. We also propose an applied localization model using linear intersection and do some concerned experiments to estimate the location computation algorithm.
Knowing the locations of nodes in wireless sensor networks (WSN) is essential for many applications. Nodes in a WSN can have multiple capabilities and exploiting one or more of the capabilities can help to solve the localization problem. In this paper, we assume that each node in a WSN has the capability of distance measurement and present a location computation technique called linear intersection for node localization. We also propose an applied localization model using linear intersection and do some concerned experiments to estimate the location computation algorithm.
2006, 32(6): 915-921.
摘要:
This paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of global deployment or topology, etc). We propose the algorithms and show mathematical analysis to support our claims. The paper ends with simulation studies and discussion of results.
This paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of global deployment or topology, etc). We propose the algorithms and show mathematical analysis to support our claims. The paper ends with simulation studies and discussion of results.
2006, 32(6): 922-928.
摘要:
Wireless sensor network (WSN) of active sensors suffers from serious inter-sensor interference (ISI) and imposes new design and implementation challenges. In this paper, based on the ultrasonic sensor network, two time-division based distributed sensor scheduling schemes are proposed to deal with ISI by scheduling sensors periodically and adaptively respectively. Extended Kalman filter (EKF) is used as the tracking algorithm in distributed manner. Simulation results show that the adaptive sensor scheduling scheme can achieve superior tracking accuracy with faster tracking convergence speed.
Wireless sensor network (WSN) of active sensors suffers from serious inter-sensor interference (ISI) and imposes new design and implementation challenges. In this paper, based on the ultrasonic sensor network, two time-division based distributed sensor scheduling schemes are proposed to deal with ISI by scheduling sensors periodically and adaptively respectively. Extended Kalman filter (EKF) is used as the tracking algorithm in distributed manner. Simulation results show that the adaptive sensor scheduling scheme can achieve superior tracking accuracy with faster tracking convergence speed.
2006, 32(6): 929-937.
摘要:
In this paper, we consider the analysis, implementation, and application of wideband sources using both seismic and acoustic sensors. We use the approximate maximum likelihood (AML) algorithm to perform acoustic direction of arrival (DOA). For non-uniform noise spectra, whitening filtering was applied to the received acoustic signals before the AML operation. For short-range seismic DOA applications, one method was based on eigen-decomposition of the covariance matrix and a second method was based on surface wave analysis. Two well-known optimization schemes were used to estimate the source locations from the estimated DOAs at sensors of known locations. Experimental estimation of the DOAs and resulting localizations using the acoustic and seismic signals generated by striking a heavy metal plate by a hammer were reported.
In this paper, we consider the analysis, implementation, and application of wideband sources using both seismic and acoustic sensors. We use the approximate maximum likelihood (AML) algorithm to perform acoustic direction of arrival (DOA). For non-uniform noise spectra, whitening filtering was applied to the received acoustic signals before the AML operation. For short-range seismic DOA applications, one method was based on eigen-decomposition of the covariance matrix and a second method was based on surface wave analysis. Two well-known optimization schemes were used to estimate the source locations from the estimated DOAs at sensors of known locations. Experimental estimation of the DOAs and resulting localizations using the acoustic and seismic signals generated by striking a heavy metal plate by a hammer were reported.
2006, 32(6): 938-946.
摘要:
An accelerometry-based gait analysis approach via the platform of sensor network is reported in this paper. The hardware units of the sensor network are wearable accelerometers that are attached at the limbs of human body. For the specific task of gait analysis, flexion angles of the thighs during gait cycles are computed. A Kalman filter is designed to estimate the flexion-extension angle, angular velocity of the thigh using the output of the wearable accelerometers. The proposed approach has been applied to four subjects and the performance is compared with videobased approach. Comparative results indicate that with the proposed Kalman filter, the sensor network is able to track the movement of the thighs during gait cycles with good accuracy and simultaneously detect major gait event of foot contact from the waveform of the angular velocity.
An accelerometry-based gait analysis approach via the platform of sensor network is reported in this paper. The hardware units of the sensor network are wearable accelerometers that are attached at the limbs of human body. For the specific task of gait analysis, flexion angles of the thighs during gait cycles are computed. A Kalman filter is designed to estimate the flexion-extension angle, angular velocity of the thigh using the output of the wearable accelerometers. The proposed approach has been applied to four subjects and the performance is compared with videobased approach. Comparative results indicate that with the proposed Kalman filter, the sensor network is able to track the movement of the thighs during gait cycles with good accuracy and simultaneously detect major gait event of foot contact from the waveform of the angular velocity.
2006, 32(6): 947-955.
摘要:
In wireless sensor networks, target classification differs from that in centralized sensing systems because of the distributed detection, wireless communication and limited resources. We study the classification problem of moving vehicles in wireless sensor networks using acoustic signals emitted from vehicles. Three algorithms including wavelet decomposition, weighted k-nearest-neighbor andDempster-Shafer theory are combined in this paper. Finally, we use real world experimental data to validate the classification methods. The result shows that wavelet based feature extraction method can extract stable features from acoustic signals. By fusion with Dempster's rule, the classification performance is improved.
In wireless sensor networks, target classification differs from that in centralized sensing systems because of the distributed detection, wireless communication and limited resources. We study the classification problem of moving vehicles in wireless sensor networks using acoustic signals emitted from vehicles. Three algorithms including wavelet decomposition, weighted k-nearest-neighbor andDempster-Shafer theory are combined in this paper. Finally, we use real world experimental data to validate the classification methods. The result shows that wavelet based feature extraction method can extract stable features from acoustic signals. By fusion with Dempster's rule, the classification performance is improved.
2006, 32(6): 956-967.
摘要:
This research is dedicated to develop a safety measurement for human-machine cooperative system, in which the machine region and the human region cannot be separated due to the overlap and the movement both from human and from machines. Our proposal here is to automatically monitor the moving objects by image sensing/recognition method, such that the machine system can get enough information about the environment situation and about the production progress at any time, and therefore the machines can accordingly take some corresponding actions automatically to avoid hazard. For this purpose, two types of monitor systems are proposed. The first type is based on the omni directional vision sensor, and the second is based on the stereo vision sensor. Each type may be used alone or together with another type, depending on the safety system's requirements and the specific situation of the manufacture field to be monitored. In this paper, the description about these two types are given, and as for the special application of these image sensors into safety control, the construction of a hierarchy safety system is proposed.
This research is dedicated to develop a safety measurement for human-machine cooperative system, in which the machine region and the human region cannot be separated due to the overlap and the movement both from human and from machines. Our proposal here is to automatically monitor the moving objects by image sensing/recognition method, such that the machine system can get enough information about the environment situation and about the production progress at any time, and therefore the machines can accordingly take some corresponding actions automatically to avoid hazard. For this purpose, two types of monitor systems are proposed. The first type is based on the omni directional vision sensor, and the second is based on the stereo vision sensor. Each type may be used alone or together with another type, depending on the safety system's requirements and the specific situation of the manufacture field to be monitored. In this paper, the description about these two types are given, and as for the special application of these image sensors into safety control, the construction of a hierarchy safety system is proposed.
2006, 32(6): 968-977.
摘要:
This paper introduces a parking management system based on a wireless sensor network developed by our group. The system consists of a large amount of parking space monitoring nodes, a few parking guiding nodes, a sink node and a management station. All the nodes exchange information with each other through wireless communication. The prototype of the parking management system has been implemented and the preliminary test results show that the performance of the system can satisfy the requirements of the application.
This paper introduces a parking management system based on a wireless sensor network developed by our group. The system consists of a large amount of parking space monitoring nodes, a few parking guiding nodes, a sink node and a management station. All the nodes exchange information with each other through wireless communication. The prototype of the parking management system has been implemented and the preliminary test results show that the performance of the system can satisfy the requirements of the application.
2006, 32(6): 978-987.
摘要:
An approach based on fuzzy logic for matching both articulated and non-articulated objects across multiple non-overlapping field of views (FoVs) from multiple cameras is proposed. We call it fuzzy logic matching algorithm (FLMA). The approach uses the information of object motion, shape and camera topology for matching objects across camera views. The motion and shape information of targets are obtained by tracking them using a combination of ConDensation and CAMShift tracking algorithms. The information of camera topology is obtained and used by calculating the projective transformation of each view with the common ground plane. The algorithm is suitable for tracking non-rigid objects with both linear and non-linear motion. We show videos of tracking objects across multiple cameras based on FLMA. From our experiments, the system is able to correctly match the targets across views with a high accuracy.
An approach based on fuzzy logic for matching both articulated and non-articulated objects across multiple non-overlapping field of views (FoVs) from multiple cameras is proposed. We call it fuzzy logic matching algorithm (FLMA). The approach uses the information of object motion, shape and camera topology for matching objects across camera views. The motion and shape information of targets are obtained by tracking them using a combination of ConDensation and CAMShift tracking algorithms. The information of camera topology is obtained and used by calculating the projective transformation of each view with the common ground plane. The algorithm is suitable for tracking non-rigid objects with both linear and non-linear motion. We show videos of tracking objects across multiple cameras based on FLMA. From our experiments, the system is able to correctly match the targets across views with a high accuracy.
2006, 32(6): 988-998.
摘要:
For the autonomous guided vehicle (AGV) used mainly in unfixed work fields, a machine vision method was proposed for the navigation system, in which a series of navigation-signs are placed along the travel route. The navigation system detects and recognizes these signs, and accordingly informs the travel control system. In order for the navigation to have balanced ability of 1) covering a large area and 2) recognizing details of the sign, the proposed vision method was designed to be a hybrid one, using both the stereo vision and the traditional 2D template matching. The former implemented a coarse recognition function for above 1), and the later implemented a fine recognition function for above 2). The results from the coarse recognition were used in the fine recognition for the gaze control to input suitable 2D image of the signs. Experiments on a prototype system show the feasibility of the proposed hybrid method in achieving the objective specifications for a typicalb AGV.
For the autonomous guided vehicle (AGV) used mainly in unfixed work fields, a machine vision method was proposed for the navigation system, in which a series of navigation-signs are placed along the travel route. The navigation system detects and recognizes these signs, and accordingly informs the travel control system. In order for the navigation to have balanced ability of 1) covering a large area and 2) recognizing details of the sign, the proposed vision method was designed to be a hybrid one, using both the stereo vision and the traditional 2D template matching. The former implemented a coarse recognition function for above 1), and the later implemented a fine recognition function for above 2). The results from the coarse recognition were used in the fine recognition for the gaze control to input suitable 2D image of the signs. Experiments on a prototype system show the feasibility of the proposed hybrid method in achieving the objective specifications for a typicalb AGV.
2006, 32(6): 999-1007.
摘要:
In this paper, the effects of packaging material and structure of fiber Bragg grating sensor performance are investigated. The effects of thermal expansion coefficient of different embedding materials on the temperature sensitivities of the FBG sensors are studied both theoretically and experimentally with good agreement, which provides a means for selection of FBG packaging material to achieve desired temperature sensitivity. We also demonstrate a 4-point bending structured FBG lateral force sensor that measures up to 242N force with well-preserved reflection spectrum, whereas for 3-point bending structure, multiple-peaks start to occur when applied force reaches 72N.
In this paper, the effects of packaging material and structure of fiber Bragg grating sensor performance are investigated. The effects of thermal expansion coefficient of different embedding materials on the temperature sensitivities of the FBG sensors are studied both theoretically and experimentally with good agreement, which provides a means for selection of FBG packaging material to achieve desired temperature sensitivity. We also demonstrate a 4-point bending structured FBG lateral force sensor that measures up to 242N force with well-preserved reflection spectrum, whereas for 3-point bending structure, multiple-peaks start to occur when applied force reaches 72N.
2006, 32(6): 1008-1014.
摘要:
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.
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.
