12.07.2015 Views

Wireless Ad Hoc and Sensor Networks

Wireless Ad Hoc and Sensor Networks

Wireless Ad Hoc and Sensor Networks

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

148 <strong>Wireless</strong> <strong>Ad</strong> <strong>Hoc</strong> <strong>and</strong> <strong>Sensor</strong> <strong>Networks</strong>regulating the traffic flows according to changing network conditionsThis, however, requires an underst<strong>and</strong>ing of network dynamics. As aresult, it is not possible to determine the equivalent capacity of bufferthresholds for multimedia high-speed networks in bursty flow conditionsor under dynamic conditions (Dziong et al. 1997). On the other h<strong>and</strong>,conventional AC schemes, based on mathematical analysis, providerobust solutions for different kinds of traffic environments, but suffer fromestimation (modeling error) <strong>and</strong> approximation errors (real-time), so theyare not suitable for dynamic environments (Dziong et al. 1997). <strong>Networks</strong>are forced to make decisions based on incomplete information, which, ifnot done properly, degrades performance of the network. Therefore, aneuro-fuzzy approach for AC is proposed (Chen et al. 1999, Cheng et al.1999). Although this approach appears to make decisions in the presenceof incomplete information, it is not clear whether the approach can beimplemented in real-time, <strong>and</strong> further, no mathematical analysis is providedin Chen et al. (1999) <strong>and</strong> Cheng et al. (1999) to show its performance.Information on available b<strong>and</strong>width is required by the network todecide whether to accept a new source or not. Routes are typically selected<strong>and</strong> sources accepted so as to minimize a certain measure of resourceswhile providing adequate QoS to the carried traffic. This requires anaccurate estimate of traffic conditions <strong>and</strong> the impact of adding a newsource. Subsequently, this information is provided for calculating theamount of b<strong>and</strong>width currently allocated to accommodate existingsources, <strong>and</strong> by identifying how much additional b<strong>and</strong>width needs to bereserved on links over which new traffic is to be routed.Because of the statistical multiplexing of traffic <strong>and</strong> shared buffers, bothaccounting <strong>and</strong> reservation are based on some aggregate statistical measuresmatching the overall traffic dem<strong>and</strong>, rather than physically dedicatedb<strong>and</strong>width or buffer space per source. In order to obtain an accurateaccounting of b<strong>and</strong>width currently used, the current traffic onto theselinks has to be determined. The available b<strong>and</strong>width estimation schemesare based on simulation curves (Bae <strong>and</strong> Suda 1991). The major drawbackof using simulation curves is that in addition to requiring storage of theprecomputed curves at the b<strong>and</strong>width control points, the static nature ofthe information may not accurately reflect the dynamic <strong>and</strong> nonlinearbehavior of the network traffic conditions <strong>and</strong> connection characteristics.Although certain b<strong>and</strong>width estimation <strong>and</strong> allocation methods areheuristic (Jamin et al. 1997) in nature, others use neural <strong>and</strong> fuzzy logic(Chen et al. 1999, Cheng et al. 1999). Some of the schemes that utilize anestimate of the network traffic use the backpropagation algorithm or alinear least-squares method. Because the backpropagation algorithm isnot proved to converge in all circumstances <strong>and</strong> requires a learning phaseinitially, other online schemes were proposed. For instance, the linearleast-squares algorithm, though computationally simple, may not provide

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!