Analysis of localized virtual structure constructions in wireless networks

Abstract

In wireless domain, finding the dominating set is one of the solutions for connectivity maintenance. Due to the dynamic topology, i.e. nodes move anywhere at any time: finding the dominating set also is a major task and lots of control messages are required for updating every change that occurs in the network. The objective of the research work is to analyze the performance of localized virtual structures in wireless networks. The key issues in wireless networks are to maintain a topology with minimum degree, self organization during link or node failure and reconstruction ability when the backbone changes the position. These issues arise during the path finding and maintenance between source and destination nodes. Existing research works in dominating set analysis, concentrate on any one of the above mentioned issues. But the nodes in wireless networks are battery operated; to solve all these issues separately more power is required. To overcome these issues various localized distributed approaches are introduced in this research work namely; localized virtual structure with minimum degree; marking scheme with tree based dominating set; self organized backbone network; link quality distributed approach for backbone construction and finally cluster backbone approach. The first approach Localized Virtual Structure (LVS) uses self stability nodes to alleviate the fundamental wireless problems like connectivity and coverage. Localized Virtual Structure nodes have the ability to reduce the link and nodes for active information exchange based on local computations. Secondly, tree based marking scheme give the characteristics of intermediate nodes and analyze the Quality of Service issues. A dual tree based localized algorithm is proposed to construct and maintain the backbone network named as SOB- T or M (Self Organized Backbone- Tree or Mark), which means that tree or marking scheme are used to construct the backbone network.