Maintaining trajectory privacy in mobile wireless sensor networks

Mobile wireless sensor networks (MWSN) is a subdomain of wireless sensor networks in which sensors and/or sinks are mobile. In this study, we propose a scheme for providing trajectory privacy of mobile sink nodes. The proposed scheme is based on random distribution of data packets. Moreover, sensor nodes do not use location information of the mobile sink or its trajectory. We performed simulation based and analytical performance evaluations for the proposed scheme. The results show that a network with up to 99% data delivery rate can be obtained by appropriate configuration while maintaining a fair level of trajectory privacy of the mobile sink node

Distributed Power Allocation for Sink-Centric Clusters in Multiple Sink Wireless Sensor Networks

Due to the battery resource constraints, saving energy is a critical issue in wireless sensor networks, particularly in large sensor networks. One possible solution is to deploy multiple sink nodes simultaneously. Another possible solution is to employ an adaptive clustering hierarchy routing scheme. In this paper, we propose a multiple sink cluster wireless sensor networks scheme which combines the two solutions, and propose an efficient transmission power control scheme for a sink-centric cluster routing protocol in multiple sink wireless sensor networks, denoted as MSCWSNs-PC. It is a distributed, scalable, self-organizing, adaptive system, and the sensor nodes do not require knowledge of the global network and their location. All sinks effectively work out a representative view of a monitored region, after which power control is employed to optimize network topology. The simulations demonstrate the advantages of our new protocol

Dynamic key ring update mechanism for mobile wireless sensor networks

Key distribution is an important issue to provide security in Wireless Sensor Networks (WSNs). Many of the key pre-distribution schemes proposed for static WSNs perform poorly when they are applied to Mobile Wireless Sensor Networks (MWSNs). In this paper, we propose Dynamic Key Ring Update (DKRU) mechanism for MWSNs. The aim of DKRU mechanism is to enable sensor nodes to update their key rings periodically during movement, by observing the frequent keys in their neighbors. Our mechanism can be used together with different key pre-distribution schemes and it helps to increase the performance of them. For the performance evaluation basis, we used our mechanism together with a location based key pre-distribution scheme. Our results show that DKRU mechanism increases the local and global connectivity when it is applied to MWSNs. Moreover, our mechanism does not cause a significant degradation in network resiliency

Securing location discovery in wireless sensor networks

Providing security for wireless sensor networks in hostile environments has a significant importance. Resilience against malicious attacks during the process of location discovery has an increasing need. There are many applications that rely on sensor nodes\u27 locations to be accurate in order to function correctly. The need to provide secure, attack resistant location discovery schemes has become a challenging research topic. In this thesis, location discovery techniques are discussed and the security threats and attacks are explained. I also present current secure location discovery schemes which are developed for range-based location discovery. The thesis goal is to develop a secure range-free location discovery scheme. This is accomplished by enhancing the voting-based scheme developed in [8, 9] to be used as the bases for developing a secure range-free location discovery scheme. Both the enhancement voting-based and the secure range-free schemes are implemented on Sun SPOT wireless sensors and subjected to various levels of location discovery attacks and tested under different sensor network scales using a simulation program developed for testing purposes

Security and Privacy in Heterogeneous Wireless and Mobile Networks: Challenges and Solutions

abstract: The rapid advances in wireless communications and networking have given rise to a number of emerging heterogeneous wireless and mobile networks along with novel networking paradigms, including wireless sensor networks, mobile crowdsourcing, and mobile social networking. While offering promising solutions to a wide range of new applications, their widespread adoption and large-scale deployment are often hindered by people's concerns about the security, user privacy, or both. In this dissertation, we aim to address a number of challenging security and privacy issues in heterogeneous wireless and mobile networks in an attempt to foster their widespread adoption. Our contributions are mainly fivefold. First, we introduce a novel secure and loss-resilient code dissemination scheme for wireless sensor networks deployed in hostile and harsh environments. Second, we devise a novel scheme to enable mobile users to detect any inauthentic or unsound location-based top-k query result returned by an untrusted location-based service providers. Third, we develop a novel verifiable privacy-preserving aggregation scheme for people-centric mobile sensing systems. Fourth, we present a suite of privacy-preserving profile matching protocols for proximity-based mobile social networking, which can support a wide range of matching metrics with different privacy levels. Last, we present a secure combination scheme for crowdsourcing-based cooperative spectrum sensing systems that can enable robust primary user detection even when malicious cognitive radio users constitute the majority.Dissertation/ThesisPh.D. Electrical Engineering 201

LOCATION AWARE CLUSTER BASED ROUTING IN WIRELESS SENSOR NETWORKS

Wireless sensor nodes are usually embedded in the physical environment and report sensed data to a central base station. Clustering is one of the most challenging issues in wireless sensor networks. This paper proposes a new cluster scheme for wireless sensor network by modified the K means clustering algorithm. Sensor nodes are deployed in a harsh environment and randomly scattered in the region of interest and are deployed in a flat architecture. The transmission of packet will reduce the network lifetime. Thus, clustering scheme is required to avoid network traffic and increase overall network lifetime. In order to cluster the sensor nodes that are deployed in the sensor network, the location information of each sensor node should be known. By knowing the location of the each sensor node in the wireless sensor network, clustering is formed based on the highest residual energy and minimum distance from the base station. Among the group of nodes, one node is elected as a cluster head using centroid method. The minimum distance between the cluster node’s and the centroid point is elected as a cluster head. Clustering of nodes can minimize the residual energy and maximize the network performance. This improves the overall network lifetime and reduces network traffic

Location-Aware Dynamic Session-Key Management for Grid-Based Wireless Sensor Networks

Security is a critical issue for sensor networks used in hostile environments. When wireless sensor nodes in a wireless sensor network are distributed in an insecure hostile environment, the sensor nodes must be protected: a secret key must be used to protect the nodes transmitting messages. If the nodes are not protected and become compromised, many types of attacks against the network may result. Such is the case with existing schemes, which are vulnerable to attacks because they mostly provide a hop-by-hop paradigm, which is insufficient to defend against known attacks. We propose a location-aware dynamic session-key management protocol for grid-based wireless sensor networks. The proposed protocol improves the security of a secret key. The proposed scheme also includes a key that is dynamically updated. This dynamic update can lower the probability of the key being guessed correctly. Thus currently known attacks can be defended. By utilizing the local information, the proposed scheme can also limit the flooding region in order to reduce the energy that is consumed in discovering routing paths

Hybrid Training With Binary Search Protocol for Wireless Sensor Networks

Locationing problem in Wireless Sensor Networks(WSN) can be viewed as a general distributed sensor problem. It is with sensors that can discover other nodes or estimate ranges between nodes. that serve as position references. In this paper. we show that sensors acquire coarse-grain location awareness by the training protocol. The training protocol which hybrids the synchronization and training procedure. In this protocol, synchronization and training are combined into one scheme. The sink node sends two beacons in each slot instead of one. In the training, sensor searching for its location using a binary search scheme. Our simulation results shown less number of cycles needed for training