Subscribe

Issue No.05 - May (2010 vol.9)

pp: 643-656

Xiaofeng Han , University of Delaware, Newark

Xiang Cao , University of Delaware, Newark

Errol L. Lloyd , University of Delaware, Newark

Chien-Chung Shen , University of Delaware, Newark

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2009.161

ABSTRACT

Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identical transmission radius. In contrast, this paper addresses the problem of deploying relay nodes to provide fault tolerance with higher network connectivity in heterogeneous wireless sensor networks, where sensor nodes possess different transmission radii. Depending on the level of desired fault tolerance, such problems can be categorized as: 1) full fault-tolerant relay node placement, which aims to deploy a minimum number of relay nodes to establish k (k \ge 1) vertex-disjoint paths between every pair of sensor and/or relay nodes and 2) partial fault-tolerant relay node placement, which aims to deploy a minimum number of relay nodes to establish k (k \ge 1) vertex-disjoint paths only between every pair of sensor nodes. 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 two-way). Since each of these problems is NP-hard, we develop O(\sigma k^2)-approximation algorithms for both one-way and two-way partial fault-tolerant relay node placement, as well as O(\sigma k^3)-approximation algorithms for both one-way and two-way full fault-tolerant relay node placement (\sigma 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 \ge 3). Finally, heuristic implementations of these algorithms are evaluated via QualNet simulations.

INDEX TERMS

Heterogeneous wireless sensor networks, relay node placement, approximation algorithms.

CITATION

Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chung Shen, "Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks",

*IEEE Transactions on Mobile Computing*, vol.9, no. 5, pp. 643-656, May 2010, doi:10.1109/TMC.2009.161REFERENCES

- [1] G. Lin and G. Xue, "Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length,"
Information Processing Letters, vol. 69, no. 2, pp. 53-57, Jan. 1999.- [2] A. Frank and E. Tardos, "An Application of Submodular Flows,"
Linear Algebra Application, vol. 243, nos. 1/2, pp. 329-348, 1989.- [3] M. Younis and K. Akkaya, "Strategies and Techniques for Node Placement in Wireless Sensor Networks,"
Ad Hoc Networks, vol. 6, no. 4, pp. 621-655, June 2008.- [4] I. Akyildiz, D. Pompili, and T. Melodia, "Underwater Acoustic Sensor Networks: Research Challenges,"
Ad Hoc Networks, vol. 3, no. 3, pp. 257-279, Mar. 2005.- [5] D. Chen, D. Du, X. Hu, G. Lin, L. Wang, and G. Xue, "Approximations for Steiner Trees with Minimum Number of Steiner Points,"
J. Global Optimization, vol. 18, no. 1, pp. 17-33, 2000.- [6] E.L. Lloyd and G. Xue, "Relay Node Placement in Wireless Sensor Networks,"
IEEE Trans. Computers, vol. 56, no. 1, pp. 134-138, Jan. 2007.- [7] J.L. Bredin, E.D. Demaine, M. Hajiaghayi, and D. Rus, "Deploying Sensor Networks with Guaranteed Capacity and Fault Tolerance,"
Proc. ACM MobiHoc, pp. 309-319, 2005.- [8] A. Kashyap, S. Khuller, and M. Shayman, "Relay Placement for Higher Order Connectivity in Wireless Sensor Networks,"
Proc. IEEE INFOCOM, pp. 1-12, Apr. 2006.- [9] J. Tang, B. Hao, and A. Sen, "Relay Node Placement in Large Scale Wireless Sensor Networks,"
Computer Comm., vol. 29, no. 4, pp. 490-501, Feb. 2006.- [10] M. Garey and D. Johnson,
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.- [11] W. Zhang, G. Xue, and S. Misra, "Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms,"
Proc. IEEE INFOCOM, pp. 1649-1657, 2007.- [12] G. Kortsarz1, R. Krauthgamer, and J.R. Lee, "Hardness of Approximation for Vertex-Connectivity Network Design Problems,"
SIAM J. Computing, vol. 33, no. 3, pp. 704-720, 2004.- [13] X. Cheng, D. Du, L. Wang, and B. Xu, "Relay Sensor Placement in Wireless Sensor Networks,"
Wireless Networks, vol. 14, no. 3, pp. 347-355, June 2008.- [14] "Qualnet Simulator," Scalable Network Technologies, Inc., http:/www.scalable-networks.com, 2008.
- [15] R. Ravi and D.P. Williamson, "An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems,"
Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 332-341, 1995.- [16] R. Ravi and D.P. Williamson, "An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems,"
Algorithmica, vol. 34, pp. 98-107, 2002.- [17] G. Kortsarz1 and Z. Nutov, "Approximating Node Connectivity Problems via Set Covers,"
Algorithmica, vol. 37, pp. 75-92, 2003.- [18] J. Cheriyan, S. Vempala, and A. Vetta, "Approximation Algorithms for Minimum-Cost K-Vertex Connected Subgraphs,"
Proc. 34th Ann. ACM Symp. Theory of Computing, pp. 306-312, 2002.- [19] N. Li and J.C. Hou, "Flss: A Fault-Tolerant Topology Control Algorithm for Wireless Networks,"
Proc. ACM MobiCom, pp. 275-286, 2004. |