17,585 research outputs found
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
Unified clustering and communication protocol for wireless sensor networks
In this paper we present an energy-efficient cross layer protocol for providing application specific reservations in wireless senor networks called the “Unified Clustering and Communication Protocol ” (UCCP). Our modular cross layered framework satisfies three wireless sensor network requirements, namely, the QoS requirement of heterogeneous applications, energy aware clustering and data forwarding by relay sensor nodes. Our unified design approach is motivated by providing an integrated and viable solution for self organization and end-to-end communication is wireless sensor networks. Dynamic QoS based reservation guarantees are provided using a reservation-based TDMA approach. Our novel energy-efficient clustering approach employs a multi-objective optimization technique based on OR (operations research) practices. We adopt a simple hierarchy in which relay nodes forward data messages from cluster head to the sink, thus eliminating the overheads needed to maintain a routing protocol. Simulation results demonstrate that UCCP provides an energy-efficient and scalable solution to meet the application specific QoS demands in resource constrained sensor nodes. Index Terms — wireless sensor networks, unified communication, optimization, clustering and quality of service
Improving the lifetime of two-tiered sensor networks using genetic algorithm
Wireless sensor networks have been envisioned to have a wide range of applications which consist of many inexpensive and low-powered wireless nodes which are used to sense, gather, and transmit the data towards the base station. In Two-Tiered wireless sensor networks, nodes are grouped into clusters, with a minimum of one cluster-head to distribute the work load among the member nodes. In the recent years, higher-powered relay nodes have been proposed to act as cluster heads and these relay nodes form a network among themselves in order to improve the lifetime of the sensor networks. Since the nodes are generally energy constrained, efficient management of the network data communication scheme can maximize the lifetime of the networks. A Genetic Algorithm is the technique for randomized search and optimization which is based on Darwin\u27s Principal of Natural Selection. In this paper, we have proposed a Genetic Algorithm based solution for scheduling the data gathering of relay nodes that can significantly extend the lifetime of the relay node network. We have simulated our method on 15 different sizes of networks and measured the lifetime of the network as the number of rounds, until the first relay node runs out of battery power. For smaller networks, where the global optimum can be determined, our genetic algorithm based approach is always able to find the optimal solution with a lesser program run-time. For larger networks, we have compared our approach with traditional routing schemes and shown that our method leads to significant improvements
A Simple and Efficient Method to Mitigate the Hot Spot Problem in Wireless Sensor Networks
Much work on wireless sensor networks deals with or considers the hot
spot problem, i.e., the problem that the sensor nodes closest to the
base station are critical for the lifetime of the sensor network
because these nodes need to relay more packet than nodes further away
from the base station. Since it is often assumed that sensor nodes
will become inexpensive, a simple solution to the hot spot problem is
to place additional sensor nodes around the base stations. Using a
simple mathematical model we discuss the possible performance gains of
adding these supplementary nodes. Our results show that for certain
networks only a limited number of additional nodes are required to
fourfold network lifetime. We also show that the possible gain depends
heavily on the fraction of nodes already present in the vicinity of
the base station
ON RELAY NODE PLACEMENT PROBLEM FOR SURVIVABLE WIRELESS SENSOR NETWORKS
Wireless sensor networks are widely applied to many fields such as animal habitat monitoring, air traffic control, and health monitoring. One of the current problems with wireless sensor networks is the ability to overcome communication failures due to hardware failure, distributing sensors in an uneven geographic area, or unexpected obstacles between sensors. One common solution to overcome this problem is to place a minimum number of relay nodes among sensors so that the communication among sensors is guaranteed. This is called Relay Node Placement Problem (RNP). This problem has been proved as NP-hard for a simple connected graph. Therefore, many algorithms have been developed based on Steiner graphs. Since RNP for a connected graph is NP-hard, the RNP for a survivable network has been conjectured as NP-hard and the algorithms for a survivable network have also been developed based on Steiner graphs. In this study, we show the new approximation bound for the survivable wireless sensor networks using the Steiner graphs based algorithm. We prove that the approximation bound is guaranteed in an environment where some obstacles are laid, and also propose the newly developed algorithm which places fewer relay nodes than the existing algorithms. Consequently, the main purpose of this study is to find the minimum number of relay nodes in order to meet the survivability requirements of wireless sensor networks
Optimal Placement of Relay Stations in Wireless Sensor Networks
Wireless sensor networks (WSNs) are a collection of nodes organized into a cooperative network with sensing, processing and transmitting capabilities. WSNs are becoming an increasingly prominent technology that can be used in diverse application areas. In WSNs, cooperative relay stations are projected as one of the most cost effective solutions to meet the demanding requirement of capacity enhancement.
In this paper, major concerns of the wireless sensor networks addressed are optimizing the number of relay stations required for covering the desired percentage of sensor nodes by optimal placement of relay stations and optimal assignment of the sensors to the relay stations. The joint problem of relay station placement and coverage is formulated into a mixed integer program which is solvable by commercial GAMS software with Xpress-MP Solver. Sensitivity analysis is carried out, along with a case study to demonstrate the performance gain of the model
Optimization of Wireless Sensor Network Lifetime by Deploying Relay Sensors
Topology control in wireless sensor networks helps to lower node energy consumption by reducing transmission power and by confining interference, collisions and consequently retransmissions. Decrease in node energy consumption implies probability of increasing network lifetime. In this paper, first we analyze popular topology control algorithms used for optimizing the power consumption in the wireless sensor network and later propose a novel technique wherein power consumption is traded with additional relay nodes. We introduce relay nodes to make the network connected without increasing the transmit power. The relay node decreases the transmit power required while it may increase end-to-end delay. We design and analyze an algorithm that place an almost minimum number of relay nodes required to make network connected. We have implemented greedy version of this algorithm and demonstrated in simulation that it produces a high quality link. We use InterAvg, InterMax (no of nodes that can offer interference) MinMax, and MinTotal as metrics to analyze and compare various algorithms. Matlab and NS-2 are used for simulation purpose. Keywords: Energy saving, sensor networks, Interference, network connectivity, topology control
- …