Priority Based Scheduling Algorithm Using Time and Transmission Length in 802.11 Networks
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.