Efficient path key establishment for wireless sensor networks

Key predistribution schemes have been proposed as means to overcome wireless sensor network constraints such as limited communication and processing power. Two sensor nodes can establish a secure link with some probability based on the information stored in their memories, though it is not always possible that two sensor nodes may set up a secure link. In this paper, we propose a new approach that elects trusted common nodes called “Proxies” which reside on an existing secure path linking two sensor nodes. These sensor nodes are used to send the generated key which will be divided into parts (nuggets) according to the number of elected proxies. Our approach has been assessed against previously developed algorithms, and the results show that our algorithm discovers proxies more quickly which are closer to both end nodes, thus producing shorter path lengths. We have also assessed the impact of our algorithm on the average time to establish a secure link when the transmitter and receiver of the sensor nodes are “ON.” The results show the superiority of our algorithm in this regard. Overall, the proposed algorithm is well suited for wireless sensor networks

Research on Sensor Network Spectrum Detection Technology based on Cognitive Radio Network

With the bursting development of computer science and the hardware technology, Internet of Things and wireless sensor networks has been popularly studied in the community of engineering. Under the environment of Internet of Things, we carry out theoretical analysis and numerical simulation on the sensor network spectrum detection technology based on cognitive radio network. As a means of information and intelligence, information service system is an important research hotspot in the field of Internet of things. Wireless sensor network is composed of a large number of micro sensor nodes, which have the function of information collection, data processing, and wireless communication, characterized by the integration of wireless self-organization. However, most of the methodologies proposed by the other institutes are suffering form the high complexity while with the high time-consuming when processing information. Therefore, this study is to assess the economic feasibility of using the optimized multipath protocol availability and the increased bandwidth and several mobile operators through the use of cost-benefit analysis, single path selection model is to develop more path agreement to achieve better performance. To test the robustness, we compare our method with the other state-of-the-art approach in the simulation section and proves the effectiveness of our methodology. The experimental result reflected that our approach could achieve higher accuracy with low time-consuming when dealing with complex sources of information

Rule-based inference and decomposition for distributed in-network processing in wireless sensor networks

Wireless sensor networks are application specific and necessitate the development of specific network and information processing architectures that can meet the requirements of the applications involved. A common type of application for wireless sensor networks is the event-driven reactive application, which requires reactive actions to be taken in response to events. In such applications, the interest is in the higher-level information described by complex event patterns, not in the raw sensory data of individual nodes. Although the central processing of information produces the most accurate results, it is not an energy-efficient method because it requires a continuous flow of raw sensor readings over the network. As communication operations are the most expensive in terms of energy usage, the distributed processing of information is indispensable for viable deployments of applications in wireless sensor networks. This method not only helps in reducing the total amount of packets transmitted in the network and the total energy consumed by the sensor nodes, but also produces scalable and fault-tolerant networks. For this purpose, we present two schemes that distribute information processing to appropriate nodes in the network. These schemes use reactive rules, which express relations between event patterns and actions, in order to capture reactive behavior. We also share the results of the performance of our algorithms and the simulations based on our approach that show the success of our methods in decreasing network traffic while still realizing the desired functionality. © 2016, Springer-Verlag London

Self-adaptive Routing in Multi-hop Sensor Networks

Sensor networks are used for applications in monitoring harsh environments including reconnaissance and surveillance of areas that may be inaccessible to humans. Such applications depend on reliable collection, distribution and delivery of information to processing centres which may involve multi-hop wireless networks which experience disruptions in communication and exhibit packet drops, connectivity loss and congestion. Some of these faults are periodic, attributed to external, recurring factors. In this paper, we study an effective way to forecast such repetitive conditions using time-series analysis. We, further, present an application-level, autonomic routing service that adapts sensor readings routes to avoid areas in which failures or congestion are expected. A prototype system of the approach is developed based on an existing middleware solution for sensor network management. Simulation results on the performance of this approach are also presented. © 2011 IFIP.Accepted versio

Improving Performance of WSN Based On Hybrid Range Based Approach

Improving the performance of WSN supported hybrid range based approach. WSN is self-possessed minimization error of nodes prepared with limited resources, limited memory and computational abilities. WSNs reliably work in unidentified hubs and numerous situations, it's difficult to trade sensor hubs after deployment, and therefore a fundamental objective is to optimize the sensor nodes' lifetime. A WSN may be a set of a large number of resource-constrained sensor nodes which have abilities for information detection, processing, and short-range radio communication, Analysis localization error minimization based several applications of wireless sensor networks (WSN) need data regarding the geographical location of each detector node. Self-organization and localization capabilities are one in every of the foremost necessary needs in detector networks. It provides a summary of centralized distance-based algorithms for estimating the positions of nodes during very sensing nodes. Secure localization of unknown nodes during a very wireless detector network (WSN) may be a vital analysis subject wireless sensor networks (WSN), a component of enveloping computing, are presently getting used on a large scale to look at period environmental standing, Be that as it may, these sensors work underneath extraordinary vitality imperatives and are planned by remembering an application. Proposed approaches are sensing node location and challenging task, involve assessing sort of various parameters needed by the target application. In study realize drawback not sense positioning of nodes .but proposed approach formula recognizes the optimal location of nodes supported minimize error and best answer in WSN. Localization algorithms mentioned with their benefits and disadvantages. Lastly, a comparative study of localization algorithms supported the performance in WSN. This was often done primarily to offer a summary of the proposed approach known today for reliable data and minimizing the energy consumption in wireless sensor networks

Cross-layer design for wireless sensor relay networks

In recent years, the idea of wireless sensor networks has gathered a great deal of attention. A distributed wireless sensor network may have hundreds of small sensor nodes. Each individual sensor contains both processing and communication elements and is designed in some degree to monitor the environmental events specified by the end user of the network. Information about the environment is gathered by sensors and delivered to a remote collector. This research conducts an investigation with respect to the energy efficiency and the cross-layer design in wireless sensor networks. Motivated by the multipath utilization and transmit diversity capability of space-time block codes (STBC), a new energy efficient cooperative routing algorithm using the STBC is proposed. Furthermore, the steady state performance of the network is analyzed via a Markov chain model. The proposed approach in this dissertation can significantly reduce the energy consumption and improve the power efficiency. This work also studies the application of differential STBC for wireless multi-hop sensor networks over fading channels. Using differential STBC, multiple sensors are selected acting as parallel relay nodes to receive and relay collected data. The proposed technique offers low complexity, since it does not need to track or estimate the time-varying channel coefficients. Analysis and simulation results show that the new approach can improve the system performance. This dissertation models the cooperative relay method for sensor networks using a Markov chain and an M/G/1 queuing system. The analytical and simulation results indicate system improvements in terms of throughput and end-to-end delay. Moreover, the impact of network resource constraints on the performance of multi-hop sensor networks with cooperative relay is also investigated. The system performance under assumptions of infinite buffer or finite buffer sizes is studied, the go through delay and the packet drop probability are improved compared to traditional single relay method. Moreover, a packet collision model for crucial nodes in wireless sensor networks is introduced. Using such a model, a space and network diversity combining (SNDC) method is designed to separate the collision at the collector. The network performance in terms of throughput, delay, energy consumption and efficiency are analyzed and evaluated

Reliable routing protocols for dynamic wireless ad hoc and sensor networks

The vision of ubiquitous computing requires the development of devices and technologies, which can be pervasive without being intrusive. The basic components of such a smart environment will be small nodes with sensing and wireless communications capabilities, able to organize flexibly into a network for data collection and delivery. The constant improvements in digital circuit technology, has made the deployment of such small, inexpensive, low-power, distributed devices, which are capable of information gathering, processing, and communication in miniature packaging, a reality.\ud Realizing such a network presents very significant challenges, especially at the protocol and software level. Major steps forward are required in the field of communications protocol, data processing, and application support. Although sensor nodes will be equipped with a power supply (battery) and embedded processor that makes them autonomous and self-aware, their functionality and capabilities will be very limited. The resource limitations of Wireless Sensor Networks (WSN), especially in terms of energy, require novel and collaborative approach for the wireless communication. Therefore, collaboration between nodes is essential to deliver smart services in a ubiquitous setting. Current research in this area generally assumes a rather static network, leading to a strong performance degradation in a dynamic environment. In this thesis we investigate new algorithms for routing in dynamic wireless environment and evaluate their feasibility through experimentation. These algorithms will be key for building self-organizing and collaborative sensor networks\ud that show emergent behavior and can operate in a challenging environment where\ud nodes move, fail and energy is a scarce resource.\ud We develop the technology needed for building self-organizing and collabora-\ud tive sensor networks using reconfigurable smart sensor nodes, which are self-aware,self-reconfigurable and autonomous. This technology will enable the creation of a new generation of sensors, which can effectively network together so as to provide a flexible platform for the support of a large variety of mobile sensor network applications. In this thesis, we address the dynamics of sink nodes, sensor nodes and event in the routing of wireless sensor networks, while maintaining high reliability and low energy consumption. The hypothesis is that this requires different routing protocols and approaches. The varying application scenarios of wireless sensor\ud networks require different routing protocols and approaches as well.\ud This thesis has three major contributions to the routing in dynamic wireless\ud sensor networks. Firstly, a combination between a new multipath on-Demand Rout-\ud ing protocol and a data-splitting scheme which results in an e±cient solution for high reliability and low traffic. Secondly, a cross-layered approach with a self-organizing medium access control protocol and a tightly integrated source routing protocol is designed for high mobility sensor networks. Finally, a data-centric approach based on cost estimation is designed to disseminate aggregated data from data source to destination with high efficiency

Designing and Implimentation of Spatial IP Address Assignment Scheme for a Wireless Network

Wireless sensor networks are composed of large numbers up to thousands of tiny radio- equipped sensors. Every sensor has a small microprocessor with enough power to allow the sensors to autonomously form networks through which sensor information is gathered. Wireless sensor networks makes it possible to monitor places like nuclear disaster areas or volcano craters without requiring humans to be immediately present. Many wireless sensor network applications cannot be performed in isolation; the sensor network must somehow be connected to monitoring and controlling entities. This research paper investigates a novel approach for connecting sensor networks to existing networks: by using the TCP/IP protocol suite in the sensor network, the sensors can be directly connected to an outside network without the need for special proxy servers or protocol converters. Bringing TCP/IP to wireless sensor networks is a challenging task, however. First, because of their limited physical size and low cost, sensors are severely constrained in terms of memory and processing power. Traditionally, these constraints have been considered too limiting for a sensor to be able to use the TCP/IP protocols. In this research paper, I show that even tiny sensors can communicate using TCP/IP. Second, the harsh communication conditions make TCP/IP perform poorly in terms of both throughput and energy efficiency. With this research paper, I suggest a number of optimizations that are intended to increase the performance of TCP/IP for sensor networks. The results of the work presented in this research paper have a significant impact on the embedded TCP/IP networking community. The software evolves as part of the research paper has become widely known in the community. The software is mentioned in books on embedded systems and networking, is used in academic courses on embedded systems, is the focus of articles in professional magazines, is incorporated in embedded operating systems, and is used in a

Energy efficient organization and modeling of wireless sensor networks

With their focus on applications requiring tight coupling with the physical world, as opposed to the personal communication focus of conventional wireless networks, wireless sensor networks pose significantly different design, implementation and deployment challenges. Wireless sensor networks can be used for environmental parameter monitoring, boundary surveillance, target detection and classification, and the facilitation of the decision making process. Multiple sensors provide better monitoring capabilities about parameters that present both spatial and temporal variances, and can deliver valuable inferences about the physical world to the end user. In this dissertation, the problem of the energy efficient organization and modeling of dynamic wireless sensor networks is investigated and analyzed. First, a connectivity distribution model that characterizes the corresponding sensor connectivity distribution for a multi-hop sensor networking system is introduced. Based on this model, the impact of node connectivity on system reliability is analyzed, and several tradeoffs among various sleeping strategies, node connectivity and power consumption, are evaluated. Motivated by the commonality encountered in the mobile sensor wireless networks, their self-organizing and random nature, and some concepts developed by the continuum theory, a model is introduced that gives a more realistic description of the various processes and their effects on a large-scale topology as the mobile wireless sensor network evolves. Furthermore, the issue of developing an energy-efficient organization and operation of a randomly deployed multi-hop sensor network, by extending the lifetime of the communication critical nodes and as a result the overall network\u27s operation, is considered and studied. Based on the data-centric characteristic of wireless sensor networks, an efficient Quality of Service (QoS)-constrained data aggregation and processing approach for distributed wireless sensor networks is investigated and analyzed. One of the key features of the proposed approach is that the task QoS requirements are taken into account to determine when and where to perform the aggregation in a distributed fashion, based on the availability of local only information. Data aggregation is performed on the fly at intermediate sensor nodes, while at the same time the end-to-end latency constraints are satisfied. An analytical model to represent the data aggregation and report delivery process in sensor networks, with specific delivery quality requirements in terms of the achievable end-to-end delay and the successful report delivery probability, is also presented. Based on this model, some insights about the impact on the achievable system performance, of the various designs parameters and the tradeoffs involved in the process of data aggregation and the proposed strategy, are gained. Furthermore, a localized adaptive data collection algorithm performed at the source nodes is developed that balances the design tradeoffs of delay, measurement accuracy and buffer overflow, for given QoS requirements. The performance of the proposed approach is analyzed and evaluated, through modeling and simulation, under different data aggregation scenarios and traffic loads. The impact of several design parameters and tradeoffs on various critical network and application related performance metrics, such as energy efficiency, network lifetime, end-to-end latency, and data loss are also evaluated and discussed