26,925 research outputs found

    Time synchronization in wireless sensor networks

    Get PDF
    Time synchronization is basic requirements for various applications in wireless sensor network, e.g., event detection, speed estimating, environment monitoring, data aggregation, target tracking, scheduling and sensor nodes cooperation. Time synchronization is also helpful to save energy in WSN because it provides the possibility to set nodes into the sleeping mode. In wireless sensor networks all of above applications need that all sensor nodes have a common time reference. However, most existing time synchronization protocols are likely to deteriorate or even be destroyed when the WSNs attack by malicious intruders. The recently developed maximum and minimum consensus based time synchronization protocol (MMTS) is a promising alternative as it does not depend on any reference node or network topology. But MMTS is vulnerable to message manipulation attacks. In this thesis, we focus on how to defend the MMTS protocol in wireless sensor networks under message manipulation attacks. We investigate the impact of message manipulation attacks over MMTS. Then, a Secured Maximum and Minimum Consensus based Time Synchronization (SMMTS) protocol is proposed to detect and invalidate message manipulation attacks

    PASSIVE TIME SYNCHRONIZATION IN SENSOR NETWORKS USING OPPORTUNISTIC FM RADIO SIGNALS

    Get PDF
    ABSTRACT Time synchronization is a critical piece of infrastructure for any wireless sensor network. It is necessary for applications such as audio localization, beam-forming, velocity calculation, and duplicate event detection. All of which require the coordination of multiple nodes. Recent advances in low-cost, low-power wireless sensors have led to an increased interest in large-scale networks of small, wireless, low-power sensor nodes. Because of the more stringent power and cost requirements that this technology is driving, current time synchronization techniques must be updated to capitalize on these advances. One time synchronization method developed specifically for wireless sensor networks is Reference Broadcast Synchronization. In RBS, a reference broadcast is transmitted to sensor nodes that require synchronization. Be recording the time of arrival, nodes can then use those time stamps to synchronize with each other. This project aimed to make the RBS system even more robust, energy efficient, and cost effective by replacing the reference broadcast with an ambient RF signal (FM, TV, AM, or satellite signals) already prevalent in the environment. The purpose of this project was to demonstrate the viability of using Opportunistic RF synchronization by 1.) quantifying error, 2.) applying this synchronization method in a real world application, and 3.), implementing a wireless sensor network using Android smart phones as sensor nodes. Many of the objectives for the project were successfully completed. For convenience and economic reasons, an FM signal was chosen as the reference broadcast. FM Radio Synchronization error was then quantified using local FM Radio stations. The results of this experiment were very favorable. Using 5 second segments for correlation, total error was found to be 0.208±4.499μs. Using 3 second segments, average error was 2.33 ± 6.784μs. Using 400ms segments, synchronization error was calculated to be 4.76 ± 8.835μs. These results were comparable to sync errors of methods currently in widespread use. It was also shown that Opportunistic RF Synchronization could be used in real world applications as well. Again FM was the RF signal of choice. FM Radio Synchronization was tested in an Audio Localization experiment with favorable results. Implementation of an Android Wireless Sensor Network according to our specifications, however, could not be achieved. HTC EVO 4G’s were programmed to communicate through TCP / IP network connections, record audio with a microphone, and to record FM Radio streams from the EVO’s internal FM radio. Although recording these two sources separately as different data tracks was successful, simultaneous recording of these streams could not be accomplished (simultaneous recording is essential for Opportunistic RF Synchronization). Although the Android smart phone implementation was not a total success, this project still provided data that supported the practical use of Opportunistic RF Synchronization.AFRLNo embarg

    A Wrapper-Based Approach to Sustained Time Synchronization in Wireless Sensor Networks

    Get PDF
    Time synchronization is an important service for wireless sensor network applications. Nodes in the network stay synchronized by exchanging periodic messages that carry local timestamps. Several algorithms have been proposed in the literature that are suited to different kinds of application scenarios. A common problem across these time synchronization algorithms is that the energy cost of message exchange is high. In fact, the cost of radio communication far outstrips the cost of performing local operations on the processor. If the message exchanges were stopped, nodes will fall out of sync, and may no longer be able to meet application requirements. This thesis presents a wrapper-based approach to sustained time synchronization for wireless sensor networks. As such, this solution Booster for Time Synchronization Protocol (BTSP) will act as a wrapper around a given time synchronization protocol, and will apply local corrector operations to extend the time duration between two message exchanges between nodes. The wrapper performs at least as good as the original protocol provided, reduces the number of message exchanges on average, and consequently the energy consumed, significantly. BTSP has been implemented for TinyOS and evaluated on XSM motes in conjunction with TPSN, a popular time synchronization protocol for sensor network

    A Wrapper-Based Approach to Sustained Time Synchronization in Wireless Sensor Networks

    Get PDF
    Time synchronization is an important service for wireless sensor network applications. Nodes in the network stay synchronized by exchanging periodic messages that carry local timestamps. Several algorithms have been proposed in the literature that are suited to different kinds of application scenarios. A common problem across these time synchronization algorithms is that the energy cost of message exchange is high. In fact, the cost of radio communication far outstrips the cost of performing local operations on the processor. If the message exchanges were stopped, nodes will fall out of sync, and may no longer be able to meet application requirements. This thesis presents a wrapper-based approach to sustained time synchronization for wireless sensor networks. As such, this solution Booster for Time Synchronization Protocol (BTSP) will act as a wrapper around a given time synchronization protocol, and will apply local corrector operations to extend the time duration between two message exchanges between nodes. The wrapper performs at least as good as the original protocol provided, reduces the number of message exchanges on average, and consequently the energy consumed, significantly. BTSP has been implemented for TinyOS and evaluated on XSM motes in conjunction with TPSN, a popular time synchronization protocol for sensor network

    Smart Wireless Sensor Networks

    Get PDF
    The recent development of communication and sensor technology results in the growth of a new attractive and challenging area - wireless sensor networks (WSNs). A wireless sensor network which consists of a large number of sensor nodes is deployed in environmental fields to serve various applications. Facilitated with the ability of wireless communication and intelligent computation, these nodes become smart sensors which do not only perceive ambient physical parameters but also be able to process information, cooperate with each other and self-organize into the network. These new features assist the sensor nodes as well as the network to operate more efficiently in terms of both data acquisition and energy consumption. Special purposes of the applications require design and operation of WSNs different from conventional networks such as the internet. The network design must take into account of the objectives of specific applications. The nature of deployed environment must be considered. The limited of sensor nodes� resources such as memory, computational ability, communication bandwidth and energy source are the challenges in network design. A smart wireless sensor network must be able to deal with these constraints as well as to guarantee the connectivity, coverage, reliability and security of network's operation for a maximized lifetime. This book discusses various aspects of designing such smart wireless sensor networks. Main topics includes: design methodologies, network protocols and algorithms, quality of service management, coverage optimization, time synchronization and security techniques for sensor networks

    Overlapping Multi-hop Clustering for Wireless Sensor Networks

    Full text link
    Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Traditionally, clustering algorithms aim at generating a number of disjoint clusters that satisfy some criteria. In this paper, we formulate a novel clustering problem that aims at generating overlapping multi-hop clusters. Overlapping clusters are useful in many sensor network applications, including inter-cluster routing, node localization, and time synchronization protocols. We also propose a randomized, distributed multi-hop clustering algorithm (KOCA) for solving the overlapping clustering problem. KOCA aims at generating connected overlapping clusters that cover the entire sensor network with a specific average overlapping degree. Through analysis and simulation experiments we show how to select the different values of the parameters to achieve the clustering process objectives. Moreover, the results show that KOCA produces approximately equal-sized clusters, which allows distributing the load evenly over different clusters. In addition, KOCA is scalable; the clustering formation terminates in a constant time regardless of the network size
    corecore