Wireless Ad Hoc and Sensor Networks
Wireless Ad Hoc and Sensor Networks Wireless Ad Hoc and Sensor Networks
Admission Controller Design for High-Speed Networks 163Once the admission controller is expressed as a state equation (Equation4.30), its performance and overall stability can be analyzed in conjunctionwith the congestion controller using hybrid system theory. Here, a nonsmoothLyapunov function will be used along the system trajectoryndefined by Equation 4.30. The continuous state space, X ⊆ R , is partitionedinto a finite number of connected open regions, Ω q ,where X =∪qΩ q, q∈ Q = N. Note that the regions, Ω q , are not required tobe disjoint. In each region a controller, u is designed by any technique. Itis assumed that the controller gives a satisfactory performance only inregion Ω q for all q∈ Q.As each closed-loop system is stable,xk ( + 1) = f( xk ( ), uk ( )) is stable for all x ∈Ω q,a standard Lyapunov functionVq( x, t):X x R→R exists in Ω q. These Lyapunov functions can be+combined to produce a nonsmooth Lyapunov function, which globallyrepresents the dynamics of the hybrid system. Here, the congestion controlleralong with Equation 4.27 becomes a local control law and the rulesused for admission control switch the controller.DEFINITION 4.5.1 (ANTSAKLIS ET AL. 1995, RAMADGE AND WONHAM 1989)A nonsmooth Lyapunov function, Vxk ( ( ), k), is assumed to be left continuouson k ∈[ k0 , ∞)and differentiable almost everywhere on ( t O , ∞)excepton the set T s = { k0, k1, ..., } when switches occur. The constraint ∆V < 0 isreplaced by a stronger condition: the nonincreasing condition.Vxk ( ( ), k ) < Vxk ( ( ), k ) if k > ki i j j i j(4.33)THEOREM 4.5.1 (ADMISSION CONTROL SCHEME STABILITY)Given the hybrid system H whose dynamics are governed by Equation 4.1 andEquation 4.30, if its controller is selected as Equation 4.6 (Jagannathan 2002) tothe buffer dynamics and (4.31) for congestion control, and the Lyapunov functionsin each region have the same values on the boundaries, Ω q , then the originof the discrete-state space of the hybrid system is asymptotically stable.The next section details the simulation results.4.6 Simulation ResultsThis section discusses the network model, parameters, and constants usedin the simulations to test the effectiveness of the proposed algorithm. Thetraffic sources used in the simulation are also discussed and the simulationresults are explained. In our admission control example, we drive thesources independently with both voice (ON/OFF) and video (MPEG)data. We use fixed packets of length 53 bytes referred to here as cells.
164 Wireless Ad Hoc and Sensor Networks4.6.1 Adaptive Estimator ModelPrevious six values of buffer occupancy were used as inputs to the NNas a trade-off between approximation and computation. The greater thenumber of past values of buffer occupancy used, the better is the approximation,but large numbers of past values increase the computation, whichin turn not only causes delays at the network switches but also wastesresources. As the number of inputs to the ARMAX model at each switchis 6 and the output is a single value, the parameter vector, Wk ˆ ( ) , is a6 by 1 vector for each switch. The regression vector, φ(.) , will then consistof current and past values of buffer occupancy. The initial adaptationgain, α, is taken as 0.1 and is updated using the projection algorithm as01 .α( k)=T . The buffer occupancy for both the switches is consideredempty, initially. The initial parameter estimates are chosen( 01 . + φ( xk ( )) φ( xk ( )))as ˆ( ) = [0 0 0 0 0 0] T for each switch. However, one can select any initialvalues for the parameters. The parameter-tuning updates derived hereinwere deployed for the simulation. The network model and the trafficsources used in the simulations are discussed next.θ 1x dck4.6.2 Network ModelThe network model used in simulations is similar to that shown inFigure 4.1 and Figure 4.2. For each simulation, the buffer length at theingress node/switch, , is selected to be as small as 10 cells and it isaltered to go as high as 350 cells. Cell losses, ( ), are defined as xk ( )− x dwhen xk ( ) > x d . The CLR is defined as the total number of cells discardedat the destination owing to buffer flows divided by the total number ofcells transmitted. Target cell transfer or transmission delay is the totaltime taken by a source to complete its transmission from its starting point.The transmission delay is defined as Ta− Ti, where T i is the intended timeto transmit the data, and T a is the total actual time needed to transmitthe data. If the source sends its data before its intended time, then anegative value is obtained, indicating that the source has completed itstransmission well before its target time. On the other hand, if a delay isencountered, then it is typically represented by a positive value, implyingthat the sources took longer than their intended time.In the simulations, a two-switch scenario is considered. Four MPEGsources are assumed to be transmitting at Switch 1. The output ofSwitch 1 is connected to Switch 2. In addition, Switch 2 also allows4 MPEG sources. Initially, it is assumed that the physically availablebandwidth at both switches is equal to the PCR of all the sources.Four sources are to be admitted at Switch 1 and four at Switch 2. Inaddition, at 3000 units of time, the output of Switch 1 is admitted atSwitch 2.
- Page 135 and 136: 112 Wireless Ad Hoc and Sensor Netw
- Page 137 and 138: 114 Wireless Ad Hoc and Sensor Netw
- Page 139 and 140: 116 Wireless Ad Hoc and Sensor Netw
- Page 141 and 142: 118 Wireless Ad Hoc and Sensor Netw
- Page 143 and 144: 120 Wireless Ad Hoc and Sensor Netw
- Page 145 and 146: 122 Wireless Ad Hoc and Sensor Netw
- Page 147 and 148: 124 Wireless Ad Hoc and Sensor Netw
- Page 149 and 150: 126 Wireless Ad Hoc and Sensor Netw
- Page 151 and 152: 128 Wireless Ad Hoc and Sensor Netw
- Page 153 and 154: 130 Wireless Ad Hoc and Sensor Netw
- Page 155 and 156: 132 Wireless Ad Hoc and Sensor Netw
- Page 157 and 158: 134 Wireless Ad Hoc and Sensor Netw
- Page 159 and 160: 136 Wireless Ad Hoc and Sensor Netw
- Page 161 and 162: 138 Wireless Ad Hoc and Sensor Netw
- Page 163 and 164: 140 Wireless Ad Hoc and Sensor Netw
- Page 165 and 166: 142 Wireless Ad Hoc and Sensor Netw
- Page 167 and 168: 144 Wireless Ad Hoc and Sensor Netw
- Page 170 and 171: 4Admission Controller Design for Hi
- Page 172 and 173: Admission Controller Design for Hig
- Page 174 and 175: Admission Controller Design for Hig
- Page 176 and 177: Admission Controller Design for Hig
- Page 178 and 179: Admission Controller Design for Hig
- Page 180 and 181: Admission Controller Design for Hig
- Page 182 and 183: Admission Controller Design for Hig
- Page 184 and 185: Admission Controller Design for Hig
- Page 188 and 189: Admission Controller Design for Hig
- Page 190 and 191: Admission Controller Design for Hig
- Page 192 and 193: Admission Controller Design for Hig
- Page 194 and 195: Admission Controller Design for Hig
- Page 196 and 197: Admission Controller Design for Hig
- Page 198: Admission Controller Design for Hig
- Page 201 and 202: 178 Wireless Ad Hoc and Sensor Netw
- Page 203 and 204: 180 Wireless Ad Hoc and Sensor Netw
- Page 205 and 206: 182 Wireless Ad Hoc and Sensor Netw
- Page 207 and 208: 184 Wireless Ad Hoc and Sensor Netw
- Page 209 and 210: 186 Wireless Ad Hoc and Sensor Netw
- Page 211 and 212: 188 Wireless Ad Hoc and Sensor Netw
- Page 213 and 214: 190 Wireless Ad Hoc and Sensor Netw
- Page 215 and 216: 192 Wireless Ad Hoc and Sensor Netw
- Page 217 and 218: 194 Wireless Ad Hoc and Sensor Netw
- Page 219 and 220: 196 Wireless Ad Hoc and Sensor Netw
- Page 221 and 222: 198 Wireless Ad Hoc and Sensor Netw
- Page 223 and 224: 200 Wireless Ad Hoc and Sensor Netw
- Page 225 and 226: 202 Wireless Ad Hoc and Sensor Netw
- Page 227 and 228: 204 Wireless Ad Hoc and Sensor Netw
- Page 229 and 230: 206 Wireless Ad Hoc and Sensor Netw
- Page 231 and 232: 208 Wireless Ad Hoc and Sensor Netw
- Page 233 and 234: 210 Wireless Ad Hoc and Sensor Netw
- Page 235 and 236: 212 Wireless Ad Hoc and Sensor Netw
164 <strong>Wireless</strong> <strong>Ad</strong> <strong>Hoc</strong> <strong>and</strong> <strong>Sensor</strong> <strong>Networks</strong>4.6.1 <strong>Ad</strong>aptive Estimator ModelPrevious six values of buffer occupancy were used as inputs to the NNas a trade-off between approximation <strong>and</strong> computation. The greater thenumber of past values of buffer occupancy used, the better is the approximation,but large numbers of past values increase the computation, whichin turn not only causes delays at the network switches but also wastesresources. As the number of inputs to the ARMAX model at each switchis 6 <strong>and</strong> the output is a single value, the parameter vector, Wk ˆ ( ) , is a6 by 1 vector for each switch. The regression vector, φ(.) , will then consistof current <strong>and</strong> past values of buffer occupancy. The initial adaptationgain, α, is taken as 0.1 <strong>and</strong> is updated using the projection algorithm as01 .α( k)=T . The buffer occupancy for both the switches is consideredempty, initially. The initial parameter estimates are chosen( 01 . + φ( xk ( )) φ( xk ( )))as ˆ( ) = [0 0 0 0 0 0] T for each switch. However, one can select any initialvalues for the parameters. The parameter-tuning updates derived hereinwere deployed for the simulation. The network model <strong>and</strong> the trafficsources used in the simulations are discussed next.θ 1x dck4.6.2 Network ModelThe network model used in simulations is similar to that shown inFigure 4.1 <strong>and</strong> Figure 4.2. For each simulation, the buffer length at theingress node/switch, , is selected to be as small as 10 cells <strong>and</strong> it isaltered to go as high as 350 cells. Cell losses, ( ), are defined as xk ( )− x dwhen xk ( ) > x d . The CLR is defined as the total number of cells discardedat the destination owing to buffer flows divided by the total number ofcells transmitted. Target cell transfer or transmission delay is the totaltime taken by a source to complete its transmission from its starting point.The transmission delay is defined as Ta− Ti, where T i is the intended timeto transmit the data, <strong>and</strong> T a is the total actual time needed to transmitthe data. If the source sends its data before its intended time, then anegative value is obtained, indicating that the source has completed itstransmission well before its target time. On the other h<strong>and</strong>, if a delay isencountered, then it is typically represented by a positive value, implyingthat the sources took longer than their intended time.In the simulations, a two-switch scenario is considered. Four MPEGsources are assumed to be transmitting at Switch 1. The output ofSwitch 1 is connected to Switch 2. In addition, Switch 2 also allows4 MPEG sources. Initially, it is assumed that the physically availableb<strong>and</strong>width at both switches is equal to the PCR of all the sources.Four sources are to be admitted at Switch 1 <strong>and</strong> four at Switch 2. Inaddition, at 3000 units of time, the output of Switch 1 is admitted atSwitch 2.