EASND: Energy Adaptive Secure Neighbour Discovery Scheme for Wireless Sensor Networks

Wireless Sensor Network (WSN) is defined as a distributed system of networking, which is enabled with set of resource constrained sensors, thus attempt to providing a large set of capabilities and connectivity interferences. After deployment nodes in the network must automatically affected heterogeneity of framework and design framework steps, including obtaining knowledge of neighbor nodes for relaying information. The primary goal of the neighbor discovery process is reducing power consumption and enhancing the lifespan of sensor devices. The sensor devices incorporate with advanced multi-purpose protocols, and specifically communication models with the pre-eminent objective of WSN applications. This paper introduces the power and security aware neighbor discovery for WSNs in symmetric and asymmetric scenarios. We have used different of neighbor discovery protocols and security models to make the network as a realistic application dependent model. Finally, we conduct simulation to analyze the performance of the proposed EASND in terms of energy efficiency, collisions, and security. The node channel utilization is exceptionally elevated, and the energy consumption to the discovery of neighbor nodes will also be significantly minimized. Experimental results show that the proposed model has valid accomplishment

Methods and Tools for Battery-free Wireless Networks

Embedding small wireless sensors into the environment allows for monitoring physical processes with high spatio-temporal resolutions. Today, these devices are equipped with a battery to supply them with power. Despite technological advances, the high maintenance cost and environmental impact of batteries prevent the widespread adoption of wireless sensors. Battery-free devices that store energy harvested from light, vibrations, and other ambient sources in a capacitor promise to overcome the drawbacks of (rechargeable) batteries, such as bulkiness, wear-out and toxicity. Because of low energy input and low storage capacity, battery-free devices operate intermittently; they are forced to remain inactive for most of the time charging their capacitor before being able to operate for a short time. While it is known how to deal with intermittency on a single device, the coordination and communication among groups of multiple battery-free devices remain largely unexplored. For the first time, the present thesis addresses this problem by proposing new methods and tools to investigate and overcome several fundamental challenges

A survey of adaptive services to cope with dynamics in wireless self-organizing networks

In this article, we consider different types of wireless networks that benefit from and, in certain cases, require self-organization. Taking mobile ad hoc, wireless sensor, wireless mesh, and delay-tolerant networks as examples of wireless self-organizing networks (WSONs), we identify that the common challenges these networks face are mainly due to lack of centralized management, device heterogeneity, unreliable wireless communication, mobility, resource constraints, or the need to support different traffic types. In this context, we survey several adaptive services proposed to handle these challenges. In particular, we group the adaptive services as core services and network-level services. By categorizing different types of services that handle adaptation and the types of adaptations, we intend to provide useful design guidelines for achieving self-organizing behavior in network protocols. Finally, we discuss open research problems to encourage the design of novel protocols for WSONs.</jats:p

Energy Efficient Protocols for Delay Tolerant Networks

The delay tolerant networks (DTNs) is characterized by frequent disconnections and long delays of links among devices due to mobility, sparse deployment of devices, attacks, and noise, etc. Considerable research efforts have been devoted recently to DTNs enabling communications between network entities with intermittent connectivity. Unfortunately, mobile devices have limited energy capacity, and the fundamental problem is that traditional power-saving mechanisms are designed assuming well connected networks. Due to much larger inter-contact durations than contact durations, devices spend most of their life time in the neighbor discovery, and centralized power-saving strategies are difficult. Consequently, mobile devices consume a significant amount of energy in the neighbor discovery, rather than in infrequent data transfers. Therefore, distributed energy efficient neighbor discovery protocols for DTNs are essential to minimize the degradation of network connectivity and maximize the benefits from mobility. In this thesis, we develop sleep scheduling protocols in the medium access control (MAC) layer that are adaptive and distributed under different clock synchronization conditions: synchronous, asynchronous, and semi-asynchronous. In addition, we propose a distributed clock synchronization protocol to mitigate the clock synchronization problem in DTNs. Our research accomplishments are briefly outlined as follows: Firstly, we design an adaptive exponential beacon (AEB) protocol. By exploiting the trend of contact availability, beacon periods are independently adjusted by each device and optimized using the distribution of contact durations. The AEB protocol significantly reduces energy consumption while maintaining comparable packet delivery delay and delivery ratio. Secondly, we design two asynchronous clock based sleep scheduling (ACDS) protocols. Based on the fact that global clock synchronization is difficult to achieve in general, predetermined patterns of sleep schedules are constructed using hierarchical arrangements of cyclic difference sets such that devices independently selecting different duty cycle lengths are still guaranteed to have overlapping awake intervals with other devices within the communication range. Thirdly, we design a distributed semi-asynchronous sleep scheduling (DSA) protocol. Although the synchronization error is unavoidable, some level of clock accuracy may be possible for many practical scenarios. The sleep schedules are constructed to guarantee contacts among devices having loosely synchronized clocks, and parameters are optimized using the distribution of synchronization error. We also define conditions for which the proposed semi-asynchronous protocol outperforms existing asynchronous sleep scheduling protocols. Lastly, we design a distributed clock synchronization (DCS) protocol. The proposed protocol considers asynchronous and long delayed connections when exchanging relative clock information among nodes. As a result, smaller synchronization error achieved by the proposed protocol allows more accurate timing information and renders neighbor discovery more energy efficient. The designed protocols improve the lifetime of mobile devices in DTNs by means of energy efficient neighbor discoveries that reduce the energy waste caused by idle listening problems

Empty cell management for grid based resource discovery protocols in ad hoc networks

Master'sMASTER OF ENGINEERIN

Energy-Efficient Querying of Wireless Sensor Networks

Due to the distributed nature of information collection in wireless sensor networks and the inherent limitations of the component devices, the ability to store, locate, and retrieve data and services with minimum energy expenditure is a critical network function. Additionally, effective search protocols must scale efficiently and consume a minimum of network energy and memory reserves. A novel search protocol, the Trajectory-based Selective Broadcast Query protocol, is proposed. An analytical model of the protocol is derived, and an optimization model is formulated. Based on the results of analysis and simulation, the protocol is shown to reduce the expected total network energy expenditure by 45.5 percent to 75 percent compared to current methods. This research also derives an enhanced analytical node model of random walk search protocols for networks with limited-lifetime resources and time-constrained queries. An optimization program is developed to minimize the expected total energy expenditure while simultaneously ensuring the proportion of failed queries does not exceed a specified threshold. Finally, the ability of the analytical node model to predict the performance of random walk search protocols in large-population networks is established through extensive simulation experiments. It is shown that the model provides a reliable estimate of optimum search algorithm parameters

QoS BASED ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORK

A Wireless Sensor Networks (WSN) is composed of a large number of low-powered sensor nodes that are randomly deployed to collect environmental data. In a WSN, because of energy scarceness, energy efficient gathering of sensed information is one of the most critical issues. Thus, most of the WSN routing protocols found in the literature have considered energy awareness as a key design issue. Factors like throughput, latency and delay are not considered as critical issues in these protocols. However, emerging WSN applications that involve multimedia and imagining sensors require end-to-end delay within acceptable limits. Hence, in addition to energy efficiency, the parameters (delay, packet loss ratio, throughput and coverage) have now become issues of primary concern. Such performance metrics are usually referred to as the Quality of Service (QoS) in communication systems. Therefore, to have efficient use of a sensor node’s energy, and the ability to transmit the imaging and multimedia data in a timely manner, requires both a QoS based and energy efficient routing protocol. In this research work, a QoS based energy efficient routing protocol for WSN is proposed. To achieve QoS based energy efficient routing, three protocols are proposed, namely the QoS based Energy Efficient Clustering (QoSEC) for a WSN, the QoS based Energy Efficient Sleep/Wake Scheduling (QoSES) for a WSN, and the QoS based Energy Efficient Mobile Sink (QoSEM) based Routing for a Clustered WSN. Firstly, in the QoSEC, to achieve energy efficiency and to prolong network/coverage lifetime, some nodes with additional energy resources, termed as super-nodes, in addition to normal capability nodes, are deployed. Multi-hierarchy clustering is done by having super-nodes (acting as a local sink) at the top tier, cluster head (normal node) at the middle tier, and cluster member (normal node) at the lowest tier in the hierarchy. Clustering within normal sensor nodes is done by optimizing the network/coverage lifetime through a cluster-head-selection algorithm and a sleep/wake scheduling algorithm. QoSEC resolves the hot spot problem and prolongs network/coverage lifetime. Secondly, the QoSES addressed the delay-minimization problem in sleep/wake scheduling for event-driven sensor networks for delay-sensitive applications. For this purpose, QoSES assigns different sleep/wake intervals (longer wake interval) to potential overloaded nodes, according to their varied traffic load requirement defined a) by node position in the network, b) by node topological importance, and c) by handling burst traffic in the proximity of the event occurrence node. Using these heuristics, QoSES minimizes the congestion at nodes having heavy traffic loads and ultimately reduces end-to-end delay while maximizing the throughput. Lastly, the QoSEM addresses hot spot problem, delay minimization, and QoS assurance. To address hot-spot problem, mobile sink is used, that move in the network to gather data by virtue of which nodes near to the mobile sink changes with each movement, consequently hot spot problem is minimized. To achieve delay minimization, static sink is used in addition to the mobile sink. Delay sensitive data is forwarded to the static sink, while the delay tolerant data is sent through the mobile sink. For QoS assurance, incoming traffic is divided into different traffic classes and each traffic class is assigned different priority based on their QoS requirement (bandwidth, delay) determine by its message type and content. Furthermore, to minimize delay in mobile sink data gathering, the mobile sink is moved throughout the network based on the priority messages at the nodes. Using these heuristics, QoSEM incur less end-to-end delay, is energy efficient, as well as being able to ensure QoS. Simulations are carried out to evaluate the performance of the proposed protocols of QoSEC, QoSES and QoSEM, by comparing their performance with the established contemporary protocols. Simulation results have demonstrated that when compared with contemporary protocols, each of the proposed protocol significantly prolong the network and coverage lifetime, as well as improve the other QoS routing parameters, such as delay, packet loss ratio, and throughput

A Survey on the Communication Protocols and Security in Cognitive Radio Networks

A cognitive radio (CR) is a radio that can change its transmission parameters based on the perceived availability of the spectrum bands in its operating environment. CRs support dynamic spectrum access and can facilitate a secondary unlicensed user to efficiently utilize the available underutilized spectrum allocated to the primary licensed users. A cognitive radio network (CRN) is composed of both the secondary users with CR-enabled radios and the primary users whose radios need not be CR-enabled. Most of the active research conducted in the area of CRNs has been so far focused on spectrum sensing, allocation and sharing. There is no comprehensive review paper available on the strategies for medium access control (MAC), routing and transport layer protocols, and the appropriate representative solutions for CRNs. In this paper, we provide an exhaustive analysis of the various techniques/mechanisms that have been proposed in the literature for communication protocols (at the MAC, routing and transport layers), in the context of a CRN, as well as discuss in detail several security attacks that could be launched on CRNs and the countermeasure solutions that have been proposed to avoid or mitigate them. This paper would serve as a good comprehensive review and analysis of the strategies for MAC, routing and transport protocols and security issues for CRNs as well as would lay a strong foundation for someone to further delve onto any particular aspect in greater depth

Collaborative Caching for efficient and Robust Certificate Authority Services in Mobile Ad-Hoc Networks

Security in Mobile Ad-Hoc Network (MANET) is getting a lot of attention due to its inherent vulnerability to a wide spectrum of attacks. Threats exist in every layer of MANET stack, and different solutions have been adapted for each security problem. Additionally, availability is an important criterion in most MANET solutions, but many security frameworks did not consider it. Public-Key Infrastructure (PKI) is no exception, and its deployment in MANET needs major design and implementation modifications that can fit constraints unique to this environment. Our focus in this dissertation is to adapt and increase the availability of Certificate Authority (CA) services, as a major PKI entity, in MANET. Several attempts have been proposed to deal with the problem of deploying CA in MANET to provide a generic public-key framework, but each either ends up sacrificing system security or availability. Here, the main goal of our work is to provide a solution that addresses performance and security issues of providing MANET-based PKI. Particularly, we would like to maintain the availability of the services provided by CA while keeping the network\u27s packet overhead as low as possible. In this dissertation, we present a MANET-based framework suitable for exchanging public-key certificates by collaborative caching between MANET clients. We show that our system can meet the challenges of providing robust and secure CA services in MANET. Augmented by simulation results, we demonstrate quantitatively the feasibility of our work as we were able to reduce network overhead associated with threshold based CA queries up to 92% as compared to related work in addition to having a very short response time. The dependency on CA servers has been reduced, and the system was able to tolerate as much as two-third inoperative CA servers without noticeable decrease in the service performance