Description

Wireless network is any type of computer network that uses wireless data connections for connecting network nodes. The capacity of wireless networks is strongly dependent on the number of concurrent active transmissions that can be accommodated by the network, which is commonly referred to as the level of spectrum spatial reuse. In a wireless network where the spectrum is shared among all communicating links, neighboring communications may cause strong interference on adjacent links causing transmissions on these links to collide and, therefore, be corrupted. The proposed system uses an efficient scheduling algorithm for providing reliable communication. It requires each network node to maintain a queue for each flow traversing it. At each time slot, it works to activate (select) a set of non-interference links in the network (i.e., it selects a set of non-interference links for transmitting packets), which leads to the maxi-mum sum of link weights multiplying their corresponding link rates, to transmit packets. The link weight associated with a link is defined as the largest flow weight on the link, where the flow weight on a link is the queue back-log differential for the flow between the two endpoints of the link. This algorithm includes updating the position of all nodes in the network and provide routing with the available link rate. Simulation results show increase in the performance of the network in terms of the metrics such as throughput and delay.