Minimum Spanning Tree in Cognitive Radio Networks: A Distributed Approach to Maintain for Node Failures

摘要

Now a day's, cognitive radio networks (CRNs) is an emerging area of research in wireless communication paradigm. In CRN, the secondary user (SU) node exploits radio environment of primary user (PU) for spectrum holes and thus maximizes spectrum utilization. The communication and computation may be interfered by arbitrarily appearance of PU for its channel. However, it can be handled by increasing the size of available vacate channel set. The backup set for channels would help to avoid premature failure. Therefore, the present work proposes a SU-NODES REPLACEMENT (SUNR) distributed algorithm for maintaining minimum spanning tree (MST) after single node failure in CRN. Our MST tree maintenance algorithm successfully tackles unpredictable disconnection and makes the protocol fault-tolerant. The correctness proof and simulation is included for algorithm verification.