Professional Documents
Culture Documents
2)
Due to the different transmission radii of sensor nodes, these problems are further complicated by the existence of two different kinds of communication paths in heterogeneous wireless sensor networks, namely, two-way paths, along which wireless communications exist in both directions; and one-way paths, along which wireless communications exist in only one direction. Assuming that sensor nodes have different transmission radii, while relay nodes use the same transmission radius, this paper comprehensively analyzes the range of problems introduced by the different levels of fault tolerance (full or partial) coupled with the different types of path (one-way or twoway). Since each of these problems is NP-hard, we develop Ok2-approximation algorithms for both one-way and two-way partial fault-tolerant relay node placement, as well as Ok3approximation algorithms for both one-way and two-way full fault-tolerant relay node placement ( is the best performance ratio of existing approximation algorithms for finding a minimum k-vertex connected spanning graph). To facilitate the applications in higher dimensions, we also extend these algorithms and derive their performance ratios in d-dimensional heterogeneous wireless sensor networks d 3. Finally, heuristic implementations of these algorithms are evaluated via QualNet simulations.
INDEX TERMS
Heterogeneous wireless sensor networks, relay node placement, approximation algorithms.
NC CT