![]() |
CiteULike | ![]() |
MSukruKuran's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Algorithms for routing and centralized scheduling in IEEE 802.16 mesh networksby: H. Shetiya, V. Sharma
Wireless Communications and Networking Conference, 2006. WCNC 2006. IEEE, Vol. 1 (18 September 2006), pp. 147-152.
|
Reviews
[Write a review of this article]
Notes for this article
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIEEE 802.16 standards for wireless metropolitan area networks (WMANs) include a mesh mode of operation for improving the coverage and throughput of the network. In this paper, we consider the problem of routing and centralized scheduling for such networks. We first fix the routing, which reduces the network to a tree. We then present a finite horizon dynamic programming framework. Using it we obtain various scheduling algorithms depending upon the cost function. Next we consider simpler suboptimal algorithms and compare their performances
BibTeX record
RIS record