抽象的な

Optimum Service Interval and Service Period: MBR in Wireless Networks

Ms. K.Tamilarasi, Mrs. R.Bharathi

The real time application of WLAN is in need of contention free channel access. The contention free channel access will provide predictable and deterministic flow of packets from one to other nodes. It also provides energy efficiency by means of powering on the wireless nodes only if it is in exclusive access. The exact resource requirements in wireless real time system while scheduling for Quality of Service at the central authority is very complicated. Therefore the real time constraint of periodic stream of given nodes can be solved by minimum channel bandwidth reservation. The problem in minimum bandwidth reservation is optimized by using a generic algorithm. The generic algorithm extended to three scheduling policies which states about the scheduling. The scheduling is made for the effective packet transmission. The three scheduling policies used are fixed-priority, Earliest Deadline First (EDF), and First In First Out (FIFO). The algorithm is implemented to minimize the bandwidth and to reduce the computational complexities. Therefore it is said to provide better Quality of Service (QoS). In the way to gain maximum energy efficiency the Base Station (BS) chooses optimal Service Interval (SI) value. Service Interval (SI) is used by different client nodes which is a multiple of the beacon interval of the base station. The Reservations i.e. Service Period (SPs) of various nodes with different Service Intervals can be integrated and composed efficiently