Xiaofeng Gao

Xiaofeng Gao

Auto-generated profile, based on publicly available information

Xiaofeng Gao

Georgia Gwinnett College

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 June 2010 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
LDLing Ding
Ling Ding
XGXiaofeng Gao
Xiaofeng Gao
WWWeili Wu
Weili Wu
WLWonjun Lee
Wonjun Lee
XZXu Zhu
Xu Zhu
Ding-Zhu DuDing-Zhu Du
Ding-Zhu Du

31 March 2011 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
PDF file
YZYi Zhu
Yi Zhu
XGXiaofeng Gao
Xiaofeng Gao
WWWeili Wu
Weili Wu
JJJason P. Jue
Jason P. Jue
Optics InfoBase is the Optical Society's online library for flagship journals, partnered and copublished journals, and recent proceedings from OSA conferences.

9 October 2009 in IEEE Communications Letters
Verified
Journal Article
Closed access
YZYi Zhu
Yi Zhu
XGXiaofeng Gao
Xiaofeng Gao
JWJames K. Willson
James K. Willson
CMChangcun Ma
Changcun Ma
JJJason P. Jue
Jason P. Jue
WWWeili Wu
Weili Wu
In this paper we propose a new problem named energy-efficient multi-lingual cell broadcasting(EEML-CB) to support multi-lingual service in cell broadcasting system. We prove that the problem is NP-hard and then propose ILP model as well as a greedy algorithm named smart multi-lingual cell broadcasting (SMCB). We evaluated our heuristic by simulations.

29 April 2010 in IEEE Communications Letters
Verified
Journal Article
Closed access
SSShan Shan
Shan Shan
WWWei Wang
Wei Wang
HDHongjie Du
Hongjie Du
XGXiaofeng Gao
Xiaofeng Gao
WWWeili Wu
Weili Wu
In this paper, we discuss the minimum latency broadcast problem (MLB) in multi-channel multi-hop wireless networks (MLB-MC). This problem is NP-hard since its special version, MLB in single-channel network (MLB-SC) is proved to be NP-hard . We design an efficient approximation for MLB-MC, analyze its approximation ratio, and evaluate its performance via numerical experiments. Furthermore, we give a general theorem as an upper bound to compare the performance between approximations for MLB-MC and MLB-SC.