Adaptive Resource Allocation for Cognitive Wireless Ad Hoc Networks

Download or read book Adaptive Resource Allocation for Cognitive Wireless Ad Hoc Networks written by Behdis Eslamnour and published by . This book was released on 2010 with total page 374 pages. Available in PDF, EPUB and Kindle. Book excerpt: "Widespread use of resource constrained wireless ad hoc networks requires careful management of the network resources in order to maximize the utilization. In cognitive wireless networks, resources such as spectrum, energy, communication links/paths, time, space, modulation scheme, have to be managed to maintain quality of service (QoS). Therefore in the first paper, a distributed dynamic channel allocation scheme is proposed for multi-channel wireless ad hoc networks with single-radio nodes. The proposed learning scheme adapts the probabilities of selecting each channel as a function of the error in the performance index at each step. Due to frequent changes in topology and flow traffic over time, wireless ad hoc networks require a dynamic routing protocol that adapts to the changes of the network while allocating network resources. In the second paper, approximate dynamic programming (ADP) techniques are utilized to find dynamic routes, while solving discrete-time Hamilton-Jacobi-Bellman (HJB) equation forward-in-time for route cost. The third paper extends the dynamic routing to multi-channel multi-interface networks which are affected by channel uncertainties and fading channels. By the addition of optimization techniques through load balancing over multiple paths and multiple wireless channels, utilization of wireless channels throughout the network is enhanced. Next in the fourth paper, a decentralized game theoretic approach for resource allocation of the primary and secondary users in a cognitive radio networks is proposed. The priorities of the networks are incorporated in the utility and potential functions which are in turn used for resource allocation. The proposed game can be extended to a game among multiple co-existing networks, each with different priority levels"--Abstract, leaf iv.