One critical step to successfully integrate wireless data networks to the high-speed wired backbone is the design of network control policies that efficiently utilize resources to provide Quality of Service (QoS) to the users in the integrated networks. Such a design has remained a challenge since wireless networks are time-varying in nature, not only in terms of user/packet arrivals but also in terms of physical channel conditions and access opportunities. In this thesis, we study the stochastic control of time-varying networks to design efficient scheduling and resource allocation policies. In particular, in Chapter 3, we focus on a broad class of control policies that work based on a pick-and-compare principle for networks with time-varying channels. By trading the throughput for complexity and memory requirement, these policies require less complexity compared to the well-investigated throughput-optimal Generalized Maximum Weight Matching (GMWM) policy and also require only linear-memory storage with the number of data-flows. Through Lyapunov analysis tools, we characterize the stability region and delay performance of the studied policies and show how they vary in response to the channel variations. In Chapter 4, we go into further detail and consider the problem of network control from a new perspective through which we carefully incorporate the time-efficiency of underlying scheduling algorithms. Specifically, we develop a policy that dynamically adjusts the time given to the available scheduling algorithms according to queue-backlog and channel correlations. We study the resulting stability region of developed policy and show that the region is at least as large as the one for any static policy. Finally, motivated by the current under-utilization of wireless spectrum, in Chapter 5, we investigate the control of cognitive radio networks as a special example of networks that provide time-varying access opportunities. We assume that users dynamically join and leave the network and may have different utility functions, or could collaborate for a common purpose. We develop a policy that performs joint admission and resource control and works for any user load, either inside or outside the capacity region. Through Lyapunov Optimization techniques, we show that the developed policy can achieve a utility performance arbitrarily close to the optimality with a tradeoff in the average service delay of admitted users.

This dissertation develops optimal algorithms for distributed detection and estimation in static and mobile sensor networks. In distributed detection or estimation scenarios in clustered wireless sensor networks, sensor motes observe their local environment, make decisions or quantize these observations into local estimates of finite length, and send/relay them to a Cluster-Head (CH). For event detection tasks that are subject to both measurement errors and communication errors, we develop an algorithm that combines a Maximum a Posteriori (MAP) approach for local and global decisions with low-complexity channel codes and processing algorithms. For event estimation tasks that are subject to measurement errors, quantization errors and communication errors, we develop an algorithm that uses dithered quantization and channel compensation to ensure that each mote's local estimate received by the CH is unbiased and then lets the CH fuse these estimates into a global one using a Best Linear Unbiased Estimator (BLUE). We then determine both the minimum energy required for the network to produce an estimate with a prescribed error variance and show how this energy must be allocated amongst the motes in the network. In mobile wireless sensor networks, the mobility model governing each node will affect the detection accuracy at the CH and the energy consumption to achieve this level of accuracy. Correlated Random Walks (CRWs) have been proposed as mobility models that accounts for time dependency, geographical restrictions and nonzero drift. Hence, the solution to the continuous-time, 1-D, finite state space CRW is provided and its statistical behavior is studied both analytically and numerically. The impact of the motion of sensor on the network's performance is also studied.

The popularity of ubiquitous Internet services has spurred the fast growth of wireless communications by launching data hungry multimedia applications to mobile devices. Powered by spectrum agile cognitive radios, the newly emerged cognitive radio networks (CRN) are proposed to provision the efficient spectrum reuse to improve spectrum utilization. Unlicensed users in CRN, or secondary users (SUs), access the temporarily idle channels in a secondary and opportunistic fashion while preventing harmful interference to licensed primary users (PUs). To effectively detect and exploit the spectrum access opportunities released from a wide spectrum, the heterogeneous wireless channel characteristics and the underlying prioritized spectrum reuse features need to be considered in the protocol design and resource management schemes in CRN, which plays a critical role in unlicensed spectrum sharing among multiple users. The purpose of this dissertation is to address the challenges of utilizing heterogeneous wireless channels in CRN by its intrinsic dynamic and diverse natures, and build the efficient, scalable and, more importantly, practical dynamic spectrum access mechanisms to enable the cost-effective transmissions for unlicensed users. Note that the spectrum access opportunities exhibit the diversity in the time/frequency/space domain, secondary transmission schemes typically follow three design principles including 1) utilizing local free channels within short transmission range, 2) cooperative and opportunistic transmissions, and 3) effectively coordinating transmissions in varying bandwidth. The entire research work in this dissertation casts a systematic view to address these principles in the design of the routing protocols, medium access control (MAC) protocols and radio resource management schemes in CRN. Specifically, as spectrum access opportunities usually have small spatial footprints, SUs only communicate with the nearby nodes in a small area. Thus, multi-hop transmissions in CRN are considered in this dissertation to enable the connections between any unlicensed users in the network. CRN typically consist of intermittent links of varying bandwidth so that the decision of routing is closely related with the spectrum sensing and sharing operations in the lower layers. An efficient opportunistic cognitive routing (OCR) scheme is proposed in which the forwarding decision at each hop is made by jointly considering physical characteristics of spectrum bands and diverse activities of PUs in each single band. Such discussion on spectrum aware routing continues coupled with the sensing selection and contention among multiple relay candidates in a multi-channel multi-hop scenario. An SU selects the next hop relay and the working channel based upon location information and channel usage statistics with instant link quality feedbacks. By evaluating the performance of the routing protocol and the joint channel and route selection algorithm with extensive simulations, we determine the optimal channel and relay combination with reduced searching complexity and improved spectrum utilization. Besides, we investigate the medium access control (MAC) protocol design in support of multimedia applications in CRN. To satisfy the quality of service (QoS) requirements of heterogeneous applications for SUs, such as voice, video, and data, channels are selected to probe for appropriate spectrum opportunities based on the characteristics and QoS demands of the traffic along with the statistics of channel usage patterns. We propose a QoS-aware MAC protocol for multi-channel single hop scenario where each single SU distributedly determines a set of channels for sensing and data transmission to satisfy QoS requirements. By analytical model and simulations, we determine the service differentiation parameters to provision multiple levels of QoS. We further extend our discussion of dynamic resource management to a more practical deployment case. We apply the experiences and skills learnt from cognitive radio study to cellular communications. In heterogeneous cellular networks, small cells are deployed in macrocells to enhance link quality, extend network coverage and offload traffic. As different cells focus on their own operation utilities, the optimization of the total system performance can be analogue to the game between PUs and SUs in CRN. However, there are unique challenges and operation features in such case. We first present challenging issues including interference management, network coordination, and interworking between cells in a tiered cellular infrastructure. We then propose an adaptive resource management framework to improve spectrum utilization and mitigate the co-channel interference between macrocells and small cells. A game-theory-based approach is introduced to handle power control issues under constrained control bandwidth and limited end user capability. The inter-cell interference is mitigated based upon orthogonal transmissions and strict protection for macrocell users. The research results in the dissertation can provide insightful lights on flexible network deployment and dynamic spectrum access for prioritized spectrum reuse in modern wireless systems. The protocols and algorithms developed in each topic, respectively, have shown practical and efficient solutions to build and optimize CRN.

The most significant challenge for next wireless generation is to work opportunistically on the spectrum without a fixed spectrum allocation. Cognitive Radio (CR) is the candidate technology to utilize spectrum white space, which requires the CR to change its operating channel as the white space moves. In a CR ad-hoc network, each node could tune to a different channel; as a result, it cannot communicate with other nodes. This different tuning is due to the difficulty of maintaining Common Control Channel (CCC) in opportunistic spectrum network, and keeping the nodes synchronized in ad-hoc network. The CR ad-hoc network requires a protocol to match tuning channels between ad-hoc nodes, namely, rendezvous channels. In this thesis, two distributed Medium Access Control (MAC) protocols are designed that provide proper rendezvous channel without CCC or synchronization. The Balanced Incomplete Block Design (BIBD) is used in both protocols to provide our protocols a method of rendezvous between CR ad-hoc nodes. In fact, the BIBD guarantees there is at least one common element between any two blocks. If the channels are assigned to the BIBD elements and the searching sequence to the BIBD block, there is a guarantee of a rendezvous at least in one channel for each searching sequence. The first protocol uses a single-BIBD sequence and a multi-channel sensing. Alternatively, the second protocol uses a multi-BIBD sequence and a single-channel sensing. The single-sequence protocol analysis is based on the discrete Markov Chain. At the same time, the sequence structure of the BIBD in a multi-sequence protocol is used to define the Maximum Time to Rendezvous (MTTR). The simulation results confirm that the protocols outperform other existing protocols with respect to Time to Rendezvous (TTR), channel utilization, and network throughput. In addition, both protocols fairly distribute the network load on channels, and share the channels fairly among network nodes. This thesis provides straight forward and efficiently distributed MAC protocols for the CR ad-hoc networks.

The most significant challenge for next wireless generation is to work opportunistically on the spectrum without a fixed spectrum allocation. Cognitive Radio (CR) is the candidate technology to utilize spectrum white space, which requires the CR to change its operating channel as the white space moves. In a CR ad-hoc network, each node could tune to a different channel; as a result, it cannot communicate with other nodes. This different tuning is due to the difficulty of maintaining Common Control Channel (CCC) in opportunistic spectrum network, and keeping the nodes synchronized in ad-hoc network. The CR ad-hoc network requires a protocol to match tuning channels between ad-hoc nodes, namely, rendezvous channels. In this thesis, two distributed Medium Access Control (MAC) protocols are designed that provide proper rendezvous channel without CCC or synchronization. The Balanced Incomplete Block Design (BIBD) is used in both protocols to provide our protocols a method of rendezvous between CR ad-hoc nodes. In fact, the BIBD guarantees there is at least one common element between any two blocks. If the channels are assigned to the BIBD elements and the searching sequence to the BIBD block, there is a guarantee of a rendezvous at least in one channel for each searching sequence. The first protocol uses a single-BIBD sequence and a multi-channel sensing. Alternatively, the second protocol uses a multi-BIBD sequence and a single-channel sensing. The single-sequence protocol analysis is based on the discrete Markov Chain. At the same time, the sequence structure of the BIBD in a multi-sequence protocol is used to define the Maximum Time to Rendezvous (MTTR). The simulation results confirm that the protocols outperform other existing protocols with respect to Time to Rendezvous (TTR), channel utilization, and network throughput. In addition, both protocols fairly distribute the network load on channels, and share the channels fairly among network nodes. This thesis provides straight forward and efficiently distributed MAC protocols for the CR ad-hoc networks.

The objective of the proposed research is to develop interference-aware resource management techniques for CR networks that opportunistically operate within the licensed primary networks spectrum and to investigate the application of such CR techniques to emerging wireless networks. In this thesis, we report on a set of laboratory experiments that we undertook to analyze the interference between the CR-based wireless regional-area network (WRAN) standard and the digital television (DTV) broadcasting system. We determined the tolerable levels of WRAN interference into DTV receivers and studied the effect of these interference levels on WRAN deployment. Based on the need for efficient utilization of the primary network spectrum, we propose efficient interference-aware radio resource allocation (RRA) techniques for orthogonal frequency-division multiple access (OFDMA) CR networks. These RRA techniques aim to maximize the CR network throughput and to keep the CR interference to the primary network at or below a predefined threshold, known as the "interference temperature" limit. Moreover, we propose a joint spectrum-sensing design and power control algorithm that lead to increased CR network throughput and efficient protection of the PUs from undue interference. Interference coordination (IC) is considered a key technique for capacity maximization in emerging heterogeneous wireless networks. We propose a CR-based IC and RRA algorithm for OFDMA femtocell deployments to achieve efficient spectrum utilization and maximum network throughput. CR is envisioned as a key enabling technology for future wireless networks; our novel CR techniques will provide other researchers useful tools to design such networks.

The thesis presents research on multiobjective optimization based on memetic computing and its applications in engineering. We have introduced a framework for adaptive multiobjective memetic optimization algorithms (AMMOA) with an information theoretic criterion for guiding the selection, clustering, and local refinements. A robust stopping criterion for AMMOA has also been introduced to solve non-linear and large-scale optimization problems. The framework has been implemented for different benchmark test problems with remarkable results. This thesis also presents two applications of these algorithms. First, an optimal image data hiding technique has been formulated as a multiobjective optimization problem with conflicting objectives. In particular, trade-off factors in designing an optimal image data hiding are investigated to maximize the quality of watermarked images and the robustness of watermark. With the fixed size of a logo watermark, there is a conflict between these two objectives, thus a multiobjective optimization problem is introduced. We propose to use a hybrid between general regression neural networks (GRNN) and the adaptive multiobjective memetic optimization algorithm (AMMOA) to solve this challenging problem. This novel image data hiding approach has been implemented for many different test natural images with remarkable robustness and transparency of the embedded logo watermark. We also introduce a perceptual measure based on the relative Rényi information spectrum to evaluate the quality of watermarked images. The second application is the problem of joint spectrum sensing and power control optimization for a multichannel, multiple-user cognitive radio network. We investigated trade-off factors in designing efficient spectrum sensing techniques to maximize the throughput and minimize the interference. To maximize the throughput of secondary users and minimize the interference to primary users, we propose a joint determination of the sensing and transmission parameters of the secondary users, such as sensing times, decision threshold vectors, and power allocation vectors. There is a conflict between these two objectives, thus a multiobjective optimization problem is used again in the form of AMMOA. This algorithm learns to find optimal spectrum sensing times, decision threshold vectors, and power allocation vectors to maximize the averaged opportunistic throughput and minimize the averaged interference to the cognitive radio network. / February 2016

M. Tech. Electrical Engineering. / Proposes certain approaches aimed at improving handover from the users point of view, the benefits may include enhanced quality of service, avoidance of handover disruption and reduction of handover rate, irrespective of high traffic loads at the BSs.The proposed scheme improves the network performance by minimising the handover delay time and also enhancing the effective use of radio resources

M. Tech. Electrical Engineering. / Presents an IPv6-based mobility support scheme for vehicular scenarios. The focus of this study is on modelling of an efficient network layer handover scheme suitable for vehicular network environments. In order to achieve this, a Vehicular Fast handovers for Mobile IPv6 (VFMIPv6) network layer protocol has been proposed.

The popularity of ubiquitous Internet services has spurred the fast growth of wireless communications by launching data hungry multimedia applications to mobile devices. Powered by spectrum agile cognitive radios, the newly emerged cognitive radio networks (CRN) are proposed to provision the efficient spectrum reuse to improve spectrum utilization. Unlicensed users in CRN, or secondary users (SUs), access the temporarily idle channels in a secondary and opportunistic fashion while preventing harmful interference to licensed primary users (PUs). To effectively detect and exploit the spectrum access opportunities released from a wide spectrum, the heterogeneous wireless channel characteristics and the underlying prioritized spectrum reuse features need to be considered in the protocol design and resource management schemes in CRN, which plays a critical role in unlicensed spectrum sharing among multiple users. The purpose of this dissertation is to address the challenges of utilizing heterogeneous wireless channels in CRN by its intrinsic dynamic and diverse natures, and build the efficient, scalable and, more importantly, practical dynamic spectrum access mechanisms to enable the cost-effective transmissions for unlicensed users. Note that the spectrum access opportunities exhibit the diversity in the time/frequency/space domain, secondary transmission schemes typically follow three design principles including 1) utilizing local free channels within short transmission range, 2) cooperative and opportunistic transmissions, and 3) effectively coordinating transmissions in varying bandwidth. The entire research work in this dissertation casts a systematic view to address these principles in the design of the routing protocols, medium access control (MAC) protocols and radio resource management schemes in CRN. Specifically, as spectrum access opportunities usually have small spatial footprints, SUs only communicate with the nearby nodes in a small area. Thus, multi-hop transmissions in CRN are considered in this dissertation to enable the connections between any unlicensed users in the network. CRN typically consist of intermittent links of varying bandwidth so that the decision of routing is closely related with the spectrum sensing and sharing operations in the lower layers. An efficient opportunistic cognitive routing (OCR) scheme is proposed in which the forwarding decision at each hop is made by jointly considering physical characteristics of spectrum bands and diverse activities of PUs in each single band. Such discussion on spectrum aware routing continues coupled with the sensing selection and contention among multiple relay candidates in a multi-channel multi-hop scenario. An SU selects the next hop relay and the working channel based upon location information and channel usage statistics with instant link quality feedbacks. By evaluating the performance of the routing protocol and the joint channel and route selection algorithm with extensive simulations, we determine the optimal channel and relay combination with reduced searching complexity and improved spectrum utilization. Besides, we investigate the medium access control (MAC) protocol design in support of multimedia applications in CRN. To satisfy the quality of service (QoS) requirements of heterogeneous applications for SUs, such as voice, video, and data, channels are selected to probe for appropriate spectrum opportunities based on the characteristics and QoS demands of the traffic along with the statistics of channel usage patterns. We propose a QoS-aware MAC protocol for multi-channel single hop scenario where each single SU distributedly determines a set of channels for sensing and data transmission to satisfy QoS requirements. By analytical model and simulations, we determine the service differentiation parameters to provision multiple levels of QoS. We further extend our discussion of dynamic resource management to a more practical deployment case. We apply the experiences and skills learnt from cognitive radio study to cellular communications. In heterogeneous cellular networks, small cells are deployed in macrocells to enhance link quality, extend network coverage and offload traffic. As different cells focus on their own operation utilities, the optimization of the total system performance can be analogue to the game between PUs and SUs in CRN. However, there are unique challenges and operation features in such case. We first present challenging issues including interference management, network coordination, and interworking between cells in a tiered cellular infrastructure. We then propose an adaptive resource management framework to improve spectrum utilization and mitigate the co-channel interference between macrocells and small cells. A game-theory-based approach is introduced to handle power control issues under constrained control bandwidth and limited end user capability. The inter-cell interference is mitigated based upon orthogonal transmissions and strict protection for macrocell users. The research results in the dissertation can provide insightful lights on flexible network deployment and dynamic spectrum access for prioritized spectrum reuse in modern wireless systems. The protocols and algorithms developed in each topic, respectively, have shown practical and efficient solutions to build and optimize CRN.