@inproceedings {Simula.netsys.20,
	title = {Reliable Channel Selection and Routing for Real-Time Services Over Cognitive Radio Mesh Networks},
	journal = {Qshine 2010},
	year = {2010},
	publisher = {ACM},
	type = {Conference},
	abstract = {In Cognitive Radio Mesh Networks (CogMesh), Secondary Mesh Routers (SMRs) can opportunistically utilize the licensed spectrums for the traffic of the Secondary Mesh Users (SMUs). How to guarantee Quality of Service (QoS) for real-time services over CogMesh is still an opening issue. In this paper, we present a discrete-time vacation queueing system to abstract the Primary User (PU) interruption to SMR data transmission. Moreover, we formulate the optimization problem of joint channel selection and routing, to achieve minimum end-to-end delay for SMR while guaranteeing the channel unavailability. A heuristic method is proposed to solve this problem and results show our proposed method performs the most close to the optimal scheme, and outperforms the minimal unavailability scheme and minimal delay scheme in terms of end-to-end delay and solution rate.},
	author = {Xie, Lang and Poul E. {Heegaard} and Zhang, Yan and Xiang, Jie},
	editor = {Zhang, Xi}
}
@inproceedings {Simula.ND.123,
	title = {Optimal Spectrum Scheduling in Cognitive Wireless Mesh Networks},
	journal = {Proceedings of International Wireless Communications and Mobile Computing Conference 2008 (IWCMC{\textquoteright}08)},
	year = {2008},
	pages = {724-728},
	publisher = {IEEE press},
	type = {Conference},
	abstract = {In a Cognitive Wireless Mesh Network (CogMesh), each Cognitive Radio (CR) enabled mesh node can sense and opportunistically access the under-utilized spectrums in the primary system. Since the unoccupied spectrum is location-dependent and time-dependent, the available spectrums in each mesh node are different. With this spectrum heterogeneity, each node shall have the knowledge of spectrum, scheduling, and routing path of other nodes such that it cacommunicate with them with minimal cost and no collision. The problem may occur in a number of the situations, e.g. the routing table re-building and the unicast real-time applications. In this paper, we focus on the 2-hop spectrum scheduling, which will enable any pair of 2-hop neighborhood nodes know the spectrum, collision-free scheduling, and minimal-cost routing path. Two optimal strategies are proposed to address the spectrum scheduling: Optimal Deterministic Spectrum Scheduling (ODS) and Optimal Randomized Spectrum Scheduling (ORS). In the deterministic situation, with the scheme ODS, the 2-hop spectrum scheduling can be solved in polynomial time. In the randomized situation, with the scheme ORS, the 2-hop spectrum scheduling can be solved in polynomial time with high probability at least (1-\frac{1}{n}) where n denotes the network size. The simulation experiment is carried out to show the achievable performance of the proposed algorithms.},
	isbn = {978-1-4244-2202-9},
	author = {Xin, Qin and Zhang, Yan and Xiang, Jie},
	editor = {Chen, Hsiao-Hwa and Zhang, Xi and Guizani, Mohsen and Athanasios V. {Vasilakos}}
}
