期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2012
卷号：3
期号：4
页码：1645-1652
出版社：Technopark Publications
摘要：The fairness of IEEE 802.11 wireless networks is rigid to forecast and organize since it constructed based on uncertainty and difficulty of the MAC conflicts and dynamics. So, there is a great extent of packet data to be met in a network traffic jam and the packet data was collapsed since the nodes in the network are random. Multiple-path source routing permits data source node to dispense the entire traffic between the probable offered paths. But, in this case jamming possessions were not measured. The previous work has presented the jamming characteristics in 802.11 networks using reed Solomon code which encode and decode the packet data in the source and destination to avoid the packet data to get lost. But the jamming problem is not much considered. To improve the controllability of jamming characteristics, this paper presents a priority based scheduling algorithm using time and transmission length (PSATT) based on priority of nodes given which has minimal time and transmission length. A scheduling of the packet data to be processed is done based on priority of nodes which has minimal length and transmission length in the network environment. To reduce the network jam in 802.11 networks, a central scheduler is desired to choose how to assign the stations‟ requests into numerous concurrent channels. As the scheduling time is restricted, we extend a Lagrangian relaxation based scheduling algorithm for network traffic jam problem. An experimental evaluation is done with the set of nodes in the network and shows that the proposed PSATT is better in performance in terms of scheduling time consumption, traffic allocation, average delay compared to an existing managing jamming characteristics of 802.11 networks using reed solomon codes.
关键词：IEEE 802.11 networks; scheduling algorithm; time and transmission schedule based on priority; jamming characteristics
