Optimal placement of relay nodes over limited positions in wireless sensor networks

This paper tackles the challenge of optimally placing relay nodes (RNs) in wireless sensor networks given a limited set of positions. The proposed solution consists of: 1) the usage of a realistic physical layer model based on a Rayleigh block-fading channel; 2) the calculation of the signal-to-interference-plus-noise ratio (SINR) considering the path loss, fast fading, and interference; and 3) the usage of a weighted communication graph drawn based on outage probabilities determined from the calculated SINR for every communication link. Overall, the proposed solution aims for minimizing the outage probabilities when constructing the routing tree, by adding a minimum number of RNs that guarantee connectivity. In comparison to the state-of-the art solutions, the conducted simulations reveal that the proposed solution exhibits highly encouraging results at a reasonable cost in terms of the number of added RNs. The gain is proved high in terms of extending the network lifetime, reducing the end-to-end- delay, and increasing the goodput

Reconfigurable middleware architectures for large scale sensor networks

Wireless sensor networks, in an effort to be energy efficient, typically lack the high-level abstractions of advanced programming languages. Though strong, the dichotomy between these two paradigms can be overcome. The SENSIX software framework, described in this dissertation, uniquely integrates constraint-dominated wireless sensor networks with the flexibility of object-oriented programming models, without violating the principles of either. Though these two computing paradigms are contradictory in many ways, SENSIX bridges them to yield a dynamic middleware abstraction unifying low-level resource-aware task reconfiguration and high-level object recomposition. Through the layered approach of SENSIX, the software developer creates a domain-specific sensing architecture by defining a customized task specification and utilizing object inheritance. In addition, SENSIX performs better at large scales (on the order of 1000 nodes or more) than other sensor network middleware which do not include such unified facilities for vertical integration

Quantized Routing Models for Clustering Scheme in Wireless Sensor Networks

AbstractClustering routing protocols are effective topology approaches which can increase the scalability of wireless sensor networks and efficiently utilize the limited energy resources of the sensors. However, the loading or energy consumption of sensors in networks is heterogeneous so that some sensors may die earlier than the others. In this case, data from sensors will not be delivered properly to the base station. Many previous studies have focused on energyefficient routing protocols to prolong the network lifetime without considering the influences of transmitting range or availability of compression. In this paper, we propose quantized models to simulate the operations of clustering routing protocols and evaluate the energy consumption of networks as well as the load distribution of sensors. Besides, the cluster head selection algorithm is developed correspondingly. The comparison of data reception rate for LEACH with our model in cases of different compression rates by simulations is also presented

Tracking the path of a mobile radioactive source using a wireless sensor network

This report describes several experiments used to characterize and test a network of radiation sensors. The purpose of these tests is to assess the feasibility of using these sensors to detect and track radioactive sources in a large field, as in a battlefield or on a military campus. Simulated radiation measurements are used to compare the result of radiation detection accuracy in tracking the moving target and to find its path as early as possible. This is done via changing the number of sensing nodes deployed (deployment density), as well as the models of the detectors. This thesis describes algorithms for both detecting the presence and tracking the position of radioactive sources. It formulates the detection problem as a nonparametric hypothesis-testing problem that is solved by comparing a statistic computed over some window of observation of the data to a threshold value. If this threshold is exceeded then it is decided that a source is present. The tracking results thus found are compared with the actual chosen path within the implemented experiment. Detection delay has been measured while trading off battery consumption and accuracy

Energy-Aware Constrained Relay Node Deployment for Sustainable Wireless Sensor Networks

© 2016 IEEE. This paper considers the problem of communication coverage for sustainable data forwarding in wireless sensor networks, where an energy-aware deployment model of relay nodes (RNs) is proposed. The model used in this paper considers constrained placement and is different from the existing one-tiered and two-tiered models. It supposes two different types of sensor nodes to be deployed, i) energy rich nodes (ERNs), and ii) energy limited nodes (ELNs). The aim is thus to use only the ERNs for relaying packets, while ELN's use will be limited to sensing and transmitting their own readings. A minimum number of RNs is added if necessary to help ELNs. This intuitively ensures sustainable coverage and prolongs the network lifetime. The problem is reduced to the traditional problem of minimum weighted connected dominating set (MWCDS) in a vertex weighted graph. It is then solved by taking advantage of the simple form of the weight function, both when deriving exact and approximate solutions. Optimal solution is derived using integer linear programming (ILP), and a heuristic is given for the approximate solution. Upper bounds for the approximation of the heuristic (versus the optimal solution) and for its runtime are formally derived. The proposed model and solutions are also evaluated by simulation. The proposed model is compared with the one-tiered and two-tiered models when using similar solution to determine RNs positions, i.e., minimum connected dominating set (MCDS) calculation. Results demonstrate the proposed model considerably improves the network life time compared to the one-tiered model, and this by adding a lower number of RNs compared to the two-tiered model. Further, both the heuristic and the ILP for the MWCDS are evaluated and compared with a state-of-the-art algorithm. The results show the proposed heuristic has runtime close to the ILP while clearly reducing the runtime compared to both ILP and existing heuristics. The results also demonstrate scalability of the proposed solution

DESIGN OF MOBILE DATA COLLECTOR BASED CLUSTERING ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

Wireless Sensor Networks (WSNs) consisting of hundreds or even thousands of nodes, canbe used for a multitude of applications such as warfare intelligence or to monitor the environment. A typical WSN node has a limited and usually an irreplaceable power source and the efficient use of the available power is of utmost importance to ensure maximum lifetime of eachWSNapplication. Each of the nodes needs to transmit and communicate sensed data to an aggregation point for use by higher layer systems. Data and message transmission among nodes collectively consume the largest amount of energy available in WSNs. The network routing protocols ensure that every message reaches thedestination and has a direct impact on the amount of transmissions to deliver messages successfully. To this end, the transmission protocol within the WSNs should be scalable, adaptable and optimized to consume the least possible amount of energy to suite different network architectures and application domains. The inclusion of mobile nodes in the WSNs deployment proves to be detrimental to protocol performance in terms of nodes energy efficiency and reliable message delivery. This thesis which proposes a novel Mobile Data Collector based clustering routing protocol for WSNs is designed that combines cluster based hierarchical architecture and utilizes three-tier multi-hop routing strategy between cluster heads to base station by the help of Mobile Data Collector (MDC) for inter-cluster communication. In addition, a Mobile Data Collector based routing protocol is compared with Low Energy Adaptive Clustering Hierarchy and A Novel Application Specific Network Protocol for Wireless Sensor Networks routing protocol. The protocol is designed with the following in mind: minimize the energy consumption of sensor nodes, resolve communication holes issues, maintain data reliability, finally reach tradeoff between energy efficiency and latency in terms of End-to-End, and channel access delays. Simulation results have shown that the Mobile Data Collector based clustering routing protocol for WSNs could be easily implemented in environmental applications where energy efficiency of sensor nodes, network lifetime and data reliability are major concerns

Data Aggregation and its Impact on Overall QoS of Lossy Wireless Sensor Network: A Survey

In Wireless sensor network, packet loss due to buffer overflow of sensor nodes and the delay caused due to retransmission of that lost packet is a major problem. So a big challenge is to improve the delay performance along with reliability of WSN. The goal of the proposed system is to broadcast sensed data to focus on delay performance. Also congestion at collector node due to duplicate sensed data in network is reduced by data aggregation, for this we compute a function at the collector node from the information gathered by spatially distributed sensor nodes. Because wireless sensor network applications require various levels of communication reliability (CR), the data transmission should satisfy the desired CR of the applications. Here, we propose a flexible loss recovery mechanism (called Active Caching) for sensor network applications with various CRs. The proposed scheme caches data packets at intermediate nodes over routing paths computed by CR to retransmit lost packets during multi-hop transmissions. DOI: 10.17762/ijritcc2321-8169.150516