Coverage Issues in Wireless Ad-Hoc Sensor Networks

Wireless Ad-Hoc sensor networks have a broad range of applications in the military,vigilance, environment monitoring, and healthcare fields. Coverage of the sensor networks describes how well an area is monitored. The coverage problem has been studied extensively, especially when combined with connectivity and well-organized. Coverage is a typical problem in the wireless sensor networks to fulfil issued sensing tasks. In general, sensing analysis represents how well an area is monitored by sensors. The quality of the sensor network can be reflected by levels of coverage and connectivity that it offers. The coverage issues have been studied extensively, especially when combined with connectivity and energy efficiency. Constructing a connected fully covered, and energy efficient sensor network is valuable for real world applications due to limited resources of sensor nodes. The survey recent contributions addressing energy efficient coverage problems in the context of static WASNs, networks in which sensor nodes do not move once they are deployed and present in some detail of the algorithms, assumptions, and results. A comprehensive comparison among these approaches is given from perspective of design objectives, assumptions, algorithm attributes and related results

A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods

The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. However, additional constraints to graph coloring scenarios that account for various networking conditions result in additional complexity to standard graph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.Comment: 10 pages, 5 figure

An Energy Balanced Dynamic Topology Control Algorithm for Improved Network Lifetime

In wireless sensor networks, a few sensor nodes end up being vulnerable to potentially rapid depletion of the battery reserves due to either their central location or just the traffic patterns generated by the application. Traditional energy management strategies, such as those which use topology control algorithms, reduce the energy consumed at each node to the minimum necessary. In this paper, we use a different approach that balances the energy consumption at each of the nodes, thus increasing the functional lifetime of the network. We propose a new distributed dynamic topology control algorithm called Energy Balanced Topology Control (EBTC) which considers the actual energy consumed for each transmission and reception to achieve the goal of an increased functional lifetime. We analyze the algorithm's computational and communication complexity and show that it is equivalent or lower in complexity to other dynamic topology control algorithms. Using an empirical model of energy consumption, we show that the EBTC algorithm increases the lifetime of a wireless sensor network by over 40% compared to the best of previously known algorithms