Decentralized mobility models for data collection in wireless sensor networks

Controlled mobility in wireless sensor networks provides many benefits towards enhancing the network performance and prolonging its lifetime. Mobile elements, acting as mechanical data carriers, traverse the network collecting data using single-hop communication, instead of the more energy demanding multi-hop routing to the sink. Scaling up from single to multiple mobiles is based more on the mobility models and the coordination methodology rather than increasing the number of mobile elements in the network. This work addresses the problem of designing and coordinating decentralized mobile elements for scheduling data collection in wireless sensor networks, while preserving some performance measures, such as latency and amount of data collected. We propose two mobility models governing the behaviour of the mobile element, where the incoming data collection requests are scheduled to service according to bidding strategies to determine the winner element. Simulations are run to measure the performance of the proposed mobility models subject to the network size and the number of mobile elements.<br /

Location based services in wireless ad hoc networks

In this dissertation, we investigate location based services in wireless ad hoc networks from four different aspects - i) location privacy in wireless sensor networks (privacy), ii) end-to-end secure communication in randomly deployed wireless sensor networks (security), iii) quality versus latency trade-off in content retrieval under ad hoc node mobility (performance) and iv) location clustering based Sybil attack detection in vehicular ad hoc networks (trust). The first contribution of this dissertation is in addressing location privacy in wireless sensor networks. We propose a non-cooperative sensor localization algorithm showing how an external entity can stealthily invade into the location privacy of sensors in a network. We then design a location privacy preserving tracking algorithm for defending against such adversarial localization attacks. Next we investigate secure end-to-end communication in randomly deployed wireless sensor networks. Here, due to lack of control on sensors\u27 locations post deployment, pre-fixing pairwise keys between sensors is not feasible especially under larger scale random deployments. Towards this premise, we propose differentiated key pre-distribution for secure end-to-end secure communication, and show how it improves existing routing algorithms. Our next contribution is in addressing quality versus latency trade-off in content retrieval under ad hoc node mobility. We propose a two-tiered architecture for efficient content retrieval in such environment. Finally we investigate Sybil attack detection in vehicular ad hoc networks. A Sybil attacker can create and use multiple counterfeit identities risking trust of a vehicular ad hoc network, and then easily escape the location of the attack avoiding detection. We propose a location based clustering of nodes leveraging vehicle platoon dispersion for detection of Sybil attacks in vehicular ad hoc networks --Abstract, page iii

Practical security scheme design for resource-constrained wireless networks

The implementation of ubiquitous computing (or pervasive computing) can leverage various types of resource-constrained wireless networks such as wireless sensor networks and wireless personal area networks. These resource-constrained wireless networks are vulnerable to many malicious attacks that often cause leakage, alteration and destruction of critical information due to the insecurity of wireless communication and the tampers of devices. Meanwhile, the constraints of resources, the lack of centralized management, and the demands of mobility of these networks often make traditional security mechanisms inefficient or infeasible. So, the resource-constrained wireless networks pose new challenges for information assurance and call for practical, efficient and effective solutions. In this research, we focus on wireless sensor networks and aim at enhancing confidentiality, authenticity, availability and integrity, for wireless sensor networks. Particularly, we identify three important problems as our research targets: (1) key management for wireless sensor networks (for confidentiality), (2) filtering false data injection and DoS attacks in wireless sensor networks (for authenticity and availability), and (3) secure network coding (for integrity). We investigate a diversity of malicious attacks against wireless sensor networks and design a number of practical schemes for establishing pairwise keys between sensor nodes, filtering false data injection and DoS attacks, and securing network coding against pollution attacks for wireless sensor networks. Our contributions from this research are fourfold: (1) We give a taxonomy of malicious attacks for wireless sensor networks. (2) We design a group-based key management scheme using deployment knowledge for wireless sensor networks to establish pair-wise keys between sensor nodes. (3) We propose an en-route scheme for filtering false data injection and DoS attacks in wireless sensor networks. (4) We present two efficient schemes for securing normal and XOR network coding against pollution attacks. Simulation and experimental results show that our solutions outperform existing ones and are suitable for resource-constrained wireless sensor networks in terms of computation overhead, communication cost, memory requirement, and so on

Data Aggregation Based Proactive Data Reporting Protocol for Wireless Sensor Network

Wireless sensor networks are the grouping of tiny sensor nodes that gathers the information by sensing activeness from the surroundings similar lands, forests, hills, sea. Power saving is a critical issue in wireless sensor networks since sensor nodes are battery-powered. To achieve optimized network performance at collecting a small portion of sensed data in network is in current researches. There are many protocols available for the successful communication. Sink trail and sink trail-s are the two energy efficient proactive data reporting protocols for mobile sink based on data collection with low complexity and reduced control overhead. In wireless sensor networks, using mobile sinks mobility rather than static sink for data collection is the new trend. Recently the researches are giving the concentration on moving patterns of the mobile sink to achieve optimized network performance, collecting a small area of sensed data in the network and also reducing energy consumption is main motto of the recent searches. Sink trail and sink trail-S protocols aim to conserve energy by turning off unnecessary sensors while simultaneously preserving a constant level of routing fidelity. In the proposed system we proposed the system that provides solution over mobility problems in wireless sensor network with energy saving methodology using aggregation technique. DOI: 10.17762/ijritcc2321-8169.150616

BUILDING OF A KEY MANAGEMENT APPROACH OF EFFICIENT COMMUNICATIONS IN WIRELESS SYSTEMS

In our work a certificate less effective key management method for supporting of secured communication within dynamic wireless network systems that are characterised by means of mobility of node. Dynamic wireless sensor networks facilitate mobility of sensor nodes; make possible extensive network coverage and more exact service than static sensor networks. For dealing of address security, management protocols of encryption key for dynamic wireless networks were proposed in past years based on symmetric key encryption and but they suffer from high communication transparency and needs huge memory space to store up shared pair wise keys. To the best of our information, resourceful as well as secure key management methods in support of dynamic wireless sensor networks were  not yet been proposed.  The proposed key management method manages efficient key updates when a node depart or else connect a cluster and make sure of  forward as well as backward key secrecy

M-ATTEMPT: A New Energy-Efficient Routing Protocol for Wireless Body Area Sensor Networks

In this paper, we propose a new routing protocol for heterogeneous Wireless Body Area Sensor Networks (WBASNs); Mobility-supporting Adaptive Threshold-based Thermal-aware Energy-efficientMulti-hop ProTocol (M-ATTEMPT). A prototype is defined for employing heterogeneous sensors on human body. Direct communication is used for real-time traffic (critical data) or on-demand data while Multi-hop communication is used for normal data delivery. One of the prime challenges in WBASNs is sensing of the heat generated by the implanted sensor nodes. The proposed routing algorithm is thermal-aware which senses the link Hot-spot and routes the data away from these links. Continuous mobility of human body causes disconnection between previous established links. So, mobility support and energy-management is introduced to overcome the problem. Linear Programming (LP) model for maximum information extraction and minimum energy consumption is presented in this study. MATLAB simulations of proposed routing algorithm are performed for lifetime and successful packet delivery in comparison with Multi-hop communication. The results show that the proposed routing algorithm has less energy consumption and more reliable as compared to Multi-hop communication.Comment: arXiv admin note: substantial text overlap with arXiv:1208.609

Multi-hop optimal position based opportunistic routing for wireless sensor networks

Wireless sensor network is a collection of a group of sensors connected to monitor an area of interest. Installation flexibility, mobility, reduced cost and scalability have given popularity to wireless sensor networks. Opportunistic routing is a routing protocol that takes the advantage of broadcasting nature of wireless sensor network for multi-hop communication. Considering the importance of communication between source-destination pairs in a wireless sensor network a Multi-hop Optimal position based Opportunistic Routing (MOOR) protocol is proposed in this paper. The algorithm chooses the path with minimum distance and number of hops between source and destination for transmission of data in the network. It is illustrated by simulation experiments that the proposed protocol has a good effect on End-to-End delay and lifetime of the network. In addition, it is observed that the average End-to-End delay is lesser for different simulation times when compared with existing EEOR protocol

Communication models for monitoring and mobility verification in mission critical wireless networks

Recent technological advances have seen wireless sensor networks emerge as an interesting research topic because of its ability to realize mission critical applications like in military or wildfire detection. The first part of the thesis focuses on the development of a novel communication scheme referred here as a distributed wireless critical information-aware maintenance network (DWCIMN), which is presented for preventive maintenance of network-centric dynamic systems. The proposed communication scheme addresses quality of service (QoS) issues by using a combination of a head-of-the-line queuing scheme, efficient bandwidth allocation, weight-based backoff mechanism, and a distributed power control scheme. A thorough analysis of a head-of-the-line priority queuing scheme is given for a single-server, finite queue with a batch arrival option and user priorities. The scheme is implemented in the Network Simulator (NS-2), and the results demonstrate reduced queuing delays and efficient bandwidth allocation for time-critical data over non time critical data. In the second part, we introduce a unique mobility verification problem in wireless sensor networks wherein the objective is to verify the claimed mobility path of a node in a co-operating mission critical operation between two allies. We address this problem by developing an efficient power-control based mobility verification model. The simulation framework is implemented in Matlab and the results indicate successful detection of altered claimed paths within a certain error bound --Abstract, page iii