Abstract

Reliability is one of the major issues with wireless networks. Failure in multiple radio channels often lead to poor communication even complete disruption in services. Increasing reliability of a network may point to the requirement of multiple paths between two terminals in the network. Hence, a link fault tolerant network design with low cost is important. Fault tolerance of a network is defined as the ability of the network to endure any link or node failure and cater uninterrupted connection for all services. The paper presents a technique to counter the issue of fault tolerance in a wireless mesh network (with static subscriber stations) so that it can sustain malfunction in multiple radio channels and optimize the spectrum usage. A K-fault tolerant network has at least K+1 number of distinct routes between two nodes. So, given a set of nodes and the cost of links there is a need to design a network assigning minimal number of links satisfying some specified connectivity requirements between a pair of terminals.

References

• EWA Szlachcic, Jacek Mlynek , "Efficiency Analysis in communication network topology design " 4th IEEE International conference on dependability of Computer System 2009.
• S. Latha, Ph. D thesis titled "On some aspects of topological design of computer networks," Faculty of information and communication engineering Anna University Chennai, 2009.
• Steiglitz K. , Weiner P. Kleitman D. J. , "The Design of Minimum Cost Survival Network," IEEE Transactions on Circuit Theory, pp. 455-460, 1969.
• S. Latha. , S. K. Srivatsa, "Topological Design of a K-connected Communication Network," WSEAS Trans. On Communications, Vol. 6, No. 4, pp. 657-662, 2007.
• V. N. Kamalesh and S. K. Srivatsa, "On the design of minimum cost survivable network topologies," 15th National conferences on communication, IIT Guwahati, India, pp 394-397, 16-18th Jan 2009.
• Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna, , "Network design for vertex connectivity" Proceedings of the 40th annual ACM symposium on Theory of computing, Victoria, British Columbia, Canada, pp 167-176, 17-20 May 2008.
• S. Latha, S. K. Srivatsa , "On Some Aspects of Design of Cheapest Survivable Networks," International Journal of Computer Science and Network Security, 210 Vol. 7 No. 11, pp. . 210-211, November 2007.
• S. Singh, N. Rajpal, A. K. Sharma, "K-fault tolerant in Mobile Adhoc network under cost constraint," International Conference on Electronics Computer Technology, Vol. 6, pp. 368-372, 2010.
• V. N. Kamlesh , Srivatsa S. K , "Topological Design of Minimum Cost Survivable Computer Communication Networks: Bipartite Graph Method," (IJCSIS) International Journal of Computer Science and Information Security, Vol. 3, No. 1, 2009.
• R. H. Jan , F. J. Hwang and S. T. Cheng "Topological optimization of a communication network subject to a reliability constraint", IEEE Trans. Reliability, vol. 42, pp. 63 -70, 1993.
• Sheng-Tzong Cheng, "Topological Optimization of a Reliable Communication Network," IEEE Transactions on Reliability, vol- 47, pp 239-248, 1998.
• A. Q. Ansari ,P. C. Saxena, K D Gupta, , "Cost Optimized K-Fault Tolerant Channel Assignment in Wireless Network," Proc. Int. Conf. On Parallel, Distributed and Grid Computing, pp. 18-21, 6-8 Dec, 2012.