Efficient node numbering for cost effective K fault tolerant wireless network

The reliability of any wireless communication network is considered as one of the key issue in designing network topology. Geographical locations of nodes play a crucial role in the cost of the network. The topological design of any communication network needs to realize a specified performance at minimal cost. This paper focuses on various approaches of numbering nodes in a topology design and analyses their performance for a range of networks. The paper proposes an efficient node numbering considering technique parallel organization for designing a cost effective K-connected wireless network which eventually guarantees (K-1) fault tolerance.