Download - ijcer

Implementation Of An Algorithmic To Improve…
Number belong to each node is also node ID. Nodes [ 1, 3, 5, 9, 14 ] are Articulation Points for the given Graph.
Edges show that two nodes are sufficient near to communicate with each other through Bi-directional link.
There is no case of any MAC Layer Collision, Interference, Hidden Station Problem and Exposed Station
Problem.
3.2.1 Analysis Framework of Proposed Algorithm I
This Algorithm is an improvement on Guha and Khuller‟s Algorithm with addition of Articulation
Point Concept. This Algorithm runs in two Phases. In First Phase, it finds Articulation Points. In Second Phase,
it generates Dominating Set Nodes in Connected manner.
Let us Consider Network which consists of 10 Nodes.
Fig. 3.3 :N/w 10 Nodes
Algorithm I
First Phase
Step 1 : All Articulation Points of Graph are computed. In the above Graph, Articulation
Points are Nodes [ 1, 3, 4, 6 ].
Step 2 : Now, randomly select any one Articulation Point and color it Black.
Suppose, we have selected Node [ 4 ].
Step 3 : Now, all the Adjacent White Nodes of Black Node i.e. Node [ 5 ] are colored
Gray i.e. in our case Nodes [ 1, 5, 6, 9 ].
Second Phase
The size of Dominating nodes generates in Connected manner. The main idea of this Phase is to grow
Dominating Set. This Phase works as follows :
Step 1 : If any Gray colored Node is an Articulation Point, then color it Black.
Step 2 : Else, a Gray Node with Largest number of White Adjacent Nodes is selected
Step 3 : Now, Repeat Step ( 3 ) of Phase I.
Now, we will move further by taking into account the steps involved in IInd Phase in terms of Iterations.
Iteration 1 ( Fig. 3.3 (d) )
www.ijceronline.com ||May ||2013|| Page 86