@article {Simula.ND.233,
	title = {Optimal Fault-Tolerant Broadcasting in Wireless Mesh Networks},
	journal = {Wiley Wireless Communications and Mobile Computing},
	volume = {11},
	number = {5},
	year = {2011},
	month = {Jan},
	pages = {610-620},
	author = {Xin, Qin and Zhang, Yan and Laurence T. {Yang}}
}
@inproceedings {Simula.telco.22,
	title = {Channel Assignment Scheme in Multi-Channel Multi-Radio Wireless Mesh Networks},
	journal = {Proceedings of 8th International Conference of Numerical Analysis and Applied Mathematics},
	year = {2010},
	publisher = {American Institute of Physics},
	type = {Conference},
	isbn = {978-0-7354-0834-0},
	author = {Xia, Yan and Gong, ZhengHu and Xin, Qin},
	editor = {Theodore E. {Simos} and Psihoyios, George and Tsitouras, Ch.}
}
@inproceedings {Simula.telco.16,
	title = {Gateway Selection Scheme for Throughput Optimization in Multi-Radio Multi-Channel Wireless Mesh Networks Under Physical Interference Model},
	journal = {Proceedings of the 5th International Conference on Communications and Networking in China, (Invited Paper), ChinaCom 2010},
	year = {2010},
	publisher = {IEEE},
	type = {Conference},
	isbn = {973-963-9799-97-4},
	author = {Xin, Qin and Yao, Xin and Paal Einar {Engelstad}},
	editor = {Hsiao-Hwa Chen et {al.}}
}
@inproceedings {Simula.telco.18,
	title = {Latency-Efficient Communication in Wireless Mesh Networks Under Consideration of Large Interference Range},
	journal = {Proceedings of 8th International Conference of Numerical Analysis and Applied Mathematics},
	year = {2010},
	publisher = {American Institute of Physics},
	type = {Conference},
	isbn = {978-0-7354-0834-0},
	author = {Xin, Qin and Yao, Xin and Paal Einar {Engelstad}},
	editor = {Theodore E. {Simos} and Psihoyios, George and Tsitouras, Ch.}
}
@inproceedings {Simula.nd.463,
	title = {Latency-Efficient M2M Multicasting in Wireless Mesh Networks Under Physical Interference Model},
	journal = {Proceedings of IEEE Wireless Communications and Networking Conference, WCNC 2010},
	year = {2010},
	publisher = {IEEE},
	type = {1},
	isbn = {978-1-4244-6396-1},
	author = {Xin, Qin and Wang, Yanbo},
	editor = {Shafi, Mansoor and Guo, Jay}
}
@inproceedings {Simula.nd.465,
	title = {Minimum-Latency Communication in Wireless Mesh Networks Under Physical Interference Model},
	journal = {Proceedings of the IEEE 45th International Conference on Communications, ICC 2010},
	year = {2010},
	publisher = {IEEE},
	type = {Conference},
	isbn = {978-1-4244-6402-9},
	author = {Xin, Qin},
	editor = {Xiao, Chengshan and Jan C. {Olivier}}
}
@inproceedings {Simula.ND.347,
	title = {Almost Optimal Distributed M2M Multicasting in Wireless Mesh Networks},
	journal = {Proceedings of the 6th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2009)},
	year = {2009},
	publisher = {IEEE},
	type = {1},
	isbn = {978-1-4244-5113-5},
	author = {Xin, Qin and Manne, Fredrik and Zhang, Yan and Wang, Jianping and Zheng, Zeyu}
}
@article {Simula.ND.77,
	title = {Faster Deterministic Communication in Radio Networks},
	journal = {Algorithmica},
	volume = {54},
	number = {2},
	year = {2009},
	month = {June},
	pages = {226-242},
	publisher = {Springer},
	abstract = {We study the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed in advance based on full knowledge about the size and the topology of the network. We show that gossiping can be completed in O(D+\fracΔ{\l}og n}{\l}ogΔ-{\l}og{\l}og n}}) time units in any radio network of size n, diameter D, and maximum degree Δ = {\O}mega({\l}og n). This is an almost optimal schedule in the sense that there exists a radio network topology, specifically a Δ-regular tree, in which the radio gossiping cannot be completed in less than {\O}mega(D+\fracΔ{\l}og n}{\l}ogΔ}) units of time. Moreover, we show a D+O(\frac{\l}og^3 n}{\l}og{\l}og n}}) schedule for the broadcast task. Both our transmission schemes significantly improve upon the currently best known schedules in G{\k a}sieniec, Peleg, and Xin [PODC\&$\#$39;05], i.e., a O(D+Δ{\l}og n) time schedule for gossiping and a D+O({\l}og^3 n) time schedule for broadcast. Our broadcasting schedule also improves, for large D, a very recent O(D+{\l}og^2 n) time broadcasting schedule by Kowalski and Pelc.},
	doi = {10.1007/s00453-007-9136-0},
	author = {Cicalese, Ferdinando and Manne, Fredrik and Xin, Qin}
}
@inproceedings {Simula.nd.467,
	title = {Gateway Selection Scheme for Throughput Optimization in Multi-Radio Multi-Channel Wireless Mesh Networks},
	journal = {Proceedings of the Fifth International Conference onMobile Ad-hoc and Sensor Networks, (MSN 2009)},
	year = {2009},
	publisher = {IEEE},
	type = {1},
	isbn = {978-0-7695-3935-5},
	author = {Xin, Qin and Wang, Yanbo}
}
@inproceedings {Simula.ND.349,
	title = {Joint QoS-Aware Admission Control, Channel Assignment, and Power Allocation for Cognitive Radio Cellular Networks},
	journal = {Proceedings of the 6th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2009)},
	year = {2009},
	publisher = {IEEE},
	type = {1},
	isbn = {978-1-4244-5113-5},
	author = {Xin, Qin and Xiang, Jie}
}
@inproceedings {Simula.ND.345,
	title = {Latency-Optimal Communication in Wireless Mesh Networks},
	journal = {Proceedings of the 15th Asia-Pacific Conference on Communications (APCC 2009)},
	year = {2009},
	publisher = {IEEE},
	type = {1},
	abstract = {Wireless Mesh Networking (WMN) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study the minimum-latency communication primitive of gossiping (all-to-all communication) in known topology WMNs, i.e., where the schedule of transmissions is pre-computed in advance based on full knowledge about the size and the topology of the Wireless Mesh Network (WMN). Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. The problem of computing a minimum-latency gossiping schedule for a given WMN is NP-hard, hence it is only possible to get a polynomial approximation algorithm. In this paper, we show a deterministic approximation algorithm that can complete gossiping task in (D+\fracΔ{\l}og n}{\l}ogΔ}) time units in any WMN of size n, diameter D, and maximum degree Δ. This is an asymptotically optimal schedule in the sense that there exists a WMN topology, specifically a Δ-regular tree, in which the gossiping task cannot be accomplished in less than {\O}mega(D+\fracΔ{\l}og n}{\l}ogΔ}) units of time. Our algorithm also improves on currently best known gossiping schedule of length O(D+\fracΔ{\l}og n}{\l}ogΔ-{\l}og{\l}og n}}) in [Algorithmica 54(2):226-242, 2009].},
	isbn = {978-1-4244-4784-8},
	author = {Xin, Qin and Manne, Fredrik}
}
@inproceedings {Simula.ND.281,
	title = {Minimum-Latency Gossiping in Multi-Hop Wireless Mesh Networks},
	journal = {Proceedings of the IEEE 44th International Conference on Communications (ICC{\textquoteright}09)},
	year = {2009},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Wireless Mesh Networks (WMNs) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study the minimum-latency communication primitive of gossiping (all-to-all communication) in multi-hop ad-hoc WMNs. Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. Minimum-latency gossiping problem is known to be NP-hard even for the scenario in which the topology of the WMN is known to all mesh nodes in advance. We show an approximation scheme that can complete gossiping task in O(n{\l}og^{\frac{3}{2}} n) time units with high probability at least 1-\frac{1}{n} in any ad-hoc WMN of size n. Our algorithm allows the labels (identifiers) of the mesh nodes to be polynomially large in n. To the best of our knowledge, this is the first time that randomized algorithm has been considered in ad-hoc WMNs with large labels. Moreover, our gossiping scheme also significantly improved all current gossiping algorithms in terms of approximation ratio. Our work has approximation ratio at most O({\l}og^{\frac{3}{2}} n) which is a great improvement of the current best known state-of-the-art algorithm with approximation ratio O({\l}og^2 n) but for linearly large node labels by Czumaj and Rytter \cite{CR03} [FOCS\&$\#$39;03].},
	isbn = {978-1-4244-3435-0},
	author = {Xin, Qin and Zhang, Yan and Xiang, Jie}
}
@inproceedings {Simula.ND.331,
	title = {Optimal Sensing Cooperation for Spectrum Sharing in Cognitive Radio Networks},
	journal = {European Wireless 2009 (EW 2009)},
	year = {2009},
	month = {May},
	pages = {216-221},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Cognitive radio is a highly promising technology to efficiently solve the spectrum scarcity challenge and harmonize the networks heterogeneity. Through component spectrum sharing, Secondary Users (SUs) are able to opportunistically access licensed spectrum shared with the primary system. In the literature, spectrum sharing is normally investigated on the basis of the assumption that the spectrum sensing is perfect. However, in reality, the spectrum sensing can not be ideal, as demonstrated by two non-zero metrics, probability of misdetection and the probability of false alarm. In this paper, we focus on the interaction between spectrum sensing and spectrum sharing. In particular, we will study the optimization of cooperative spectrum sensing for achieving maximum spectrum utilization in cognitive radio networks. A new percentage rule is proposed for the spectrum sensing cooperation, which is more generic than quantity-based rules and is applicable in both sparse and dense sensing scenarios. An analytical model is presented to analyze the spectrum sharing performance. Numerical examples are presented to show the optimal percentage of cooperating sensors in achieving maximum utilization, which simultaneously achieve minimum blocking probabilities. Results are also shown to explore the impact of key system parameters on the performance metrics.},
	isbn = {978-1-4244-5935-3},
	doi = {10.1109/EW.2009.5357760},
	author = {Zhang, Yan and Xiang, Jie and Xin, Qin and Geir Egil {{\O}ien}},
	editor = {Marcos Katz Frank {Fitzek}}
}
@inproceedings {Simula.ND.85,
	title = {Approximating Border Length for DNA Microarray Synthesis},
	journal = {The 5th Annual Conference on Theory and Applications of Models of Computation (TAMC{\textquoteright}08)},
	volume = {Lecture Notes in Computer Science 4978},
	year = {2008},
	month = {April},
	pages = {410-422},
	publisher = {Springer},
	type = {Conference},
	isbn = {978-3-540-79227-7},
	author = {Cindy Y. {Li} and Prudence W.H {Wong} and Xin, Qin and Fencol C.C {Yung}},
	editor = {Agrawal, Manindra and Du, Ding-Zhu and Duan, Zhenhua and Li, Angsheng}
}
@article {Simula.ND.127,
	title = {Hybrid Rule Ordering in Classification Association Rule Mining},
	journal = {Transactions on Machine Learning and Data Mining},
	volume = {1},
	number = {1},
	year = {2008},
	month = {July},
	pages = {1-15},
	abstract = {Classification Association Rule Mining (CARM) is an approach to classifier generation that builds an Association Rule Mining based classifier using Classification Association Rules (CARs). Regardless of which particular CARM algorithm is used, a similar set of CARs is always generated from data, and a classifier is usually presented as an ordered list of CARs, based on a selected rule ordering strategy. Hence to produce an accurate classifier, it is essential to develop a rational rule ordering mechanism. In the past decade, a number of rule ordering strategies have been introduced. Six major ones can be identified: Confidence Support \& size-of-Antecedent (CSA), size-of-Antecedent Confidence \& Support (ACS), Confidence Support size-of-Antecedent class-distribution-Frequency \& Row-ordering (CSAFR), Weighted Relative Accuracy (WRA), Laplace Accuracy (LA), and Chi-square Testing ({\L}ambda^2). Broadly speaking, these strategies can be categorized into two groups: Support-Confidence (including CSA, ACS and CSAFR) and Rule Weighting (including WRA, LA and {\L}ambda^2). In this paper, we propose a hybrid rule ordering approach (framework) by combining one strategy taken from Support-Confidence and another strategy taken from Rule Weighting, which consequently develops nine rule ordering mechanisms. The experimental results demonstrate that all developed mechanisms perform well with respect to the accuracy of classification.},
	author = {Wang, Yanbo and Xin, Qin and Coenen, Frans}
}
@inproceedings {Simula.ND.104,
	title = {Optimal Fault-Tolerant Broadcasting in Wireless Mesh Networks},
	journal = {International Conference on High Performance Switching and Routing (HPSR{\textquoteright}08)},
	year = {2008},
	month = {May},
	pages = {151-157},
	publisher = {IEEE press},
	type = {Conference},
	abstract = {Wireless Mesh Networks (WMNs) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. In this paper, we study the broadcasting (one-to-all communication) in WMNs with known topology, i.e., where for each primitive the schedule of transmissions is precomputed in advance based on full knowledge about the size and the topology of the network. We show that broadcasting can complete in D+O({\l}og n) time units in the WMN with size n and diameter D. Furthermore, we explore the fault-tolerant broadcasting in WMN. We show an O(n)-time deterministic radio broadcasting schedule with large number of link failures. This is an optimal schedule in the sense that there exists a network topology in which the broadcasting cannot complete in less than {\O}mega(n) units of time.},
	isbn = {978-1-4244-1982-1},
	author = {Xin, Qin and Zhang, Yan},
	editor = {Song, Min and Yamanaka, Naoaki and Bianco, Andrea and Jin, Yaohui}
}
@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}}
}
@article {Simula.ND.76,
	title = {Time Efficient Radio Broadcasting in Planar Graphs},
	journal = {Journal of Networks},
	volume = {3},
	number = {2},
	year = {2008},
	month = {February},
	pages = {9-16},
	abstract = {We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed in advance based on full knowledge about the size and the topology of the network. We show that radio broadcasting can be completed in D+O({\l}og n) time units in planar graphs of size n, and with diameter D. This improves the currently best known D+O({\l}og^3n) time schedule proposed by Elkin and Kortsarz in \cite{EK05} [SODA{\textquoteright}05], and 3D time schedule due to G{\k a}sieniec, Peleg and Xin in \cite{GPX05} [PODC{\textquoteright}05]. In this paper, we also explore broadcasting in radio networks in the presence of edge failures.},
	author = {Manne, Fredrik and Xin, Qin}
}
@inproceedings {Simula.ND.75,
	title = {Faster Treasure Hunt, and Better Strongly Universal Exploration Sequences},
	journal = {The 18th International Symposium on Algorithms and Computation (ISAAC{\textquoteright}07)},
	year = {2007},
	publisher = {Springer},
	type = {Conference},
	abstract = {We study the explicit deterministic treasure hunt problem in an n-vertex network. This problem was firstly introduced by Ta-Shma, and Zwick in \cite{TZ07} [SODA{\textquoteright}07]. It is the variant of the well known rendezvous problem in which one of the robot (the treasure) is always stationary. We obtain an O(n^{c(1+\frac{1}{\l}ambda})})-time solution for this problem, which significantly improves the currently best known result of running time O(n^{2c}) in \cite{TZ07}, where c is a fixed constant from the construction of an universal exploration sequence in \cite{R05,TZ07}, {\l}ambda is a constant integer and {\l}ambda g 1. The treasure hunt problem motivates the study of strongly universal exploration sequences. We give a better explicit construction of strongly universal exploration sequences than the one in \cite{TZ07}.},
	isbn = {978-3-540-77118-0},
	author = {Xin, Qin},
	editor = {Takeshi, Tokuyama}
}
