Distributed throughput maximization in wireless networks using the stability region
Download as DOCX, PDF0 likes194 views
The document proposes a game-theoretical framework to design distributed algorithms that control transmission range in wireless networks to maximize throughput. It defines the stability region as the set of input rates under which queues are stable. The goal is to adapt the stability region to end-to-end flows by having flows control node transmission ranges. Based on this, a new algorithm called WiMAX-Mesh-NTC is developed for IEEE 802.16 networks that maximizes throughput while guaranteeing stability. Simulation results show it achieves throughput levels that are at least 90% of optimal in 72% of scenarios.
Distributed throughput maximization in wireless networks using the stability region
- 1. ECRUITMENT SOLUTIONS (0)9751442511, 9750610101 #1, Ist Cross, Ist Main Road, Elango Nagar,Pondicherry-605 011. [email protected] www.ecruitments.com Distributed Throughput Maximization in Wireless Networks Using the Stability Region ABSTRACT: In this paper, a game-theoretical framework for the design of distributed algorithms that control the transmission range (TR) of nodes in order to maximize throughput in Wireless Multihop Networks (WMN) is proposed. It is based on the stability region of the link-scheduling policy adopted for the network. The stability region is defined as the set of input-packet rates under which the queues in the network are stable (i.e., positive recurrent). The goal of the TR-control algorithms is to adapt the stability region to a given set of end-to-end flows. In the algorithms, the flows control distributive the nodes’ TRs using the stability region in order to enable higher end-to-end packet rates while guaranteeing stability. In order to demonstrate how the algorithms can be designed using the proposed game- theoretical framework, a new TR-control algorithm for IEEE-802.16 WMNs is developed. Its convergence is demonstrated, and a performance bound is calculated. Finally, simulation results show that the algorithm is able to find the optimal TRs more effectively. The TRs achieve throughput levels that are at least 90 percent of the optimal throughput for 72 percent of the simulated scenarios, whereas the classic approach of spatial-reuse maximization does this for 62 percent of the scenarios.
- 2. ECRUITMENT SOLUTIONS (0)9751442511, 9750610101 #1, Ist Cross, Ist Main Road, Elango Nagar,Pondicherry-605 011. [email protected] www.ecruitments.com EXISTING SYSTEM: THE stability region of wireless multihop networks (WMNs) is a key factor of their performance. The end-to-end throughput and delay experienced by flows established across the network are directly related to the stability region: the larger the region, the lower the delay and the higher the throughput flows can support under longer distances. The stability region is defined as the set of input-packet rates under which the queues in the network are stable (i.e., positive recurrent). The goal of the TR-control algorithms is to adapt the stability region to a given set of end-to-end flows. In the algorithms, the flows control distributive the nodes’ TRs using the stability region in order to enable higher end-to-end packet rates while guaranteeing stability. In order to demonstrate how the algorithms can be designed using the proposed game-theoretical framework, a new TR control algorithm for IEEE-802.16 WMNs is developed. Its convergence is demonstrated, and a performance bound is calculated PROPOSED SYSTEM: A game-theoretical framework for the design of distributed algorithms that control the transmission range (TR) of nodes in order to maximize throughput in Wireless Multihop Networks (WMN) is proposed. A new framework for the development of distributed TR algorithms that maximize the total end-to-end throughput in WMNs was proposed. It can
- 3. ECRUITMENT SOLUTIONS (0)9751442511, 9750610101 #1, Ist Cross, Ist Main Road, Elango Nagar,Pondicherry-605 011. [email protected] www.ecruitments.com be used on any network whose link-scheduling policy’s stability region has been characterized. The framework consists of a potential game in which a given set of flows act as players that collaborate to control nodes’ TRs in order to maximize the packet rates they can support while guaranteeing stability. Based on the proposed framework, the WiMAX-Mesh-NTC algorithm was developed for WMNs that implement the IEEE-802.16 link- scheduling policy for mesh networks CONCLUSION: A new framework for the development of distributed TR algorithms that maximize the total end-to-end throughput in WMNs was proposed. It can be used on any network whose link-scheduling policy’s stability region has been characterized. The framework consists of a potential game in which a given set of flows act as players that collaborate to control nodes’ TRs in order to maximize the packet rates they can support while guaranteeing stability. Based on the proposed framework, the WiMAX-Mesh-NTC algorithm was developed for WMNs that implement the IEEE-802.16 link- scheduling policy for mesh networks. The convergence of WiMAX-Mesh NTC was characterized by means of the Nash equilibrium, and a performance bound was calculated by considering all the possible worst case scenarios. Finally, the WiMAX-Mesh-NTC performance was compared by means of simulation with the performance of other TR control algorithms (i.e., optimal, HSRA, MinPower, MaxPower). It was shown that WiMAX-Mesh-NTC outperforms MinPower and MaxPower, it performs as HSRA when the flow density is low, and it is outperformed by HSRA when the flow density increases.