Wireless Ad Hoc and Sensor Networks

208 Wireless Ad Hoc and Sensor Networks6Plot for SIR vs Time units54Node 1Node 2Node 3Node 4Node 5Node 6Node 7Node 8Node 9Node 10Node 11SIR32100 200 400 600 800 1000 1200 1400 1600 1800Time unitsFIGURE 5.19Response of Bambo’s update during admission of new links.the link 5 to get admitted into the network causing severe interference tolink 1. In fact, Figure 5.19 and Figure 5.20 depict that the individual powersof all active links increase significantly as link 5 is being added into thesystem, causing a surge in power consumption of all active links.The SSCD and optimal schemes simulation displayed in Figure 5.21 andFigure 5.22 would not allow link 5 to be added into the system. In fact,SSCD and optimal DPC schemes use an extra requirement that has to besatisfied by the admission-seeking links. The admission links power upgradually, but whenever a link power update is greater than a predefinedvalue (which implies it would cause high interference when added to theactive links), the link is dropped from the network. The threshold levelshould be carefully selected to increase the efficiency of the network.The comparison of the total power consumed for the two schemes inFigure 5.23 illustrates clearly that the total power consumed using theoptimal DPC update is way below that of Bambos scheme. Hence, theoptimal DPC scheme provides efficient admission control.Example 5.3.2: Evaluation of Admission Delay and DroppedLinks with Number of UsersTo study the effect of number of users gaining admission and delay, considerthe scenario from Example 5.3.1 except the number of admission seekinglinks is increased. Figure 5.24 and Figure 5.25 show the dependence of