@article {Simula.simula.251,
	title = {Availability-Aware Multimedia Scheduling in Heterogeneous Wireless Networks},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {60},
	number = {3},
	year = {2010},
	pages = {692-703},
	author = {Zhou, L. and Wang, H. and Lian, S. and Zhang, Yan and Athanasios V. {Vasilakos}}
}
@article {Simula.simula.249,
	title = {Distributed Media Services in P2P-Based Vehicular Networks},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {60},
	number = {2},
	year = {2010},
	pages = {692-703},
	author = {Zhou, L. and Zhang, Yan and Song, K. and Jing, W. and Athanasios V. {Vasilakos}}
}
@article {Simula.nd.445,
	title = {A Resilient and Scalable Flocking Scheme in Autonomous Vehicular Networks},
	journal = {Mobile Networks and Applications},
	volume = {15},
	number = {1},
	year = {2010},
	pages = {126-136},
	author = {Xiong, N. and Athanasios V. {Vasilakos} and Yang, L.T and Pedrycz, W. and Zhang, Yan and Li, Y.}
}
@article {Simula.ND.131,
	title = {Call Admission Control Algorithms in OFDM-Based Wireless Multiservice Networks},
	journal = {Wireless Personal Communications},
	volume = {50},
	number = {1},
	year = {2009},
	pages = {99-104},
	publisher = {Springer},
	author = {Zhang, Yan and Chen, Y. and He, J. and Wang, C. and Athanasios V. {Vasilakos}}
}
@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}}
}
