"If we knew what we were doing, it wouldn't be called research, would it?" ~Albert Einstein

Chen Qian





Department of Computer Science
University of Texas at Austin

Austin, TX 78712

Email: cqian AT cs Dot utexas Dot edu
Office: ACES 5SE
Phone #: 512-739-3392

- - - [Vitae](pdf) - - - - [useful links] - - -

Biography

I am a Ph.D. candidate at the Department of Computer Science, University of Texas at Austin. I am working in computer networking with Prof. Simon S. Lam. I was the recipient of the James C. Browne Graduate Fellowship in 2012.

I got the Master of Philosophy from Department of Computer Science and Engineering at Hong Kong University of Science and Technology, where I worked under the supervision of Prof. Lionel M. Ni, a world-class computer scientist as well as a nice man. I also had collaborations with Prof. Yunhao Liu. My research topics there were mainly in Wireless Sensor Networks and Pervasive/Ubiquitous Computing. I was awarded the two-year HKUST Postgraduate Studentship during my master's study.

I obtained my Bachelor's degree (highest honor) from Department of Computer Science, Nanjing University in 2006. I was a member of State Key Laboratory for Novel Software Technology, Nanjing University under the supervision of Prof. Jiafu Xu (see the wiki page of the pioneer computer scientist of China, Prof. Jiafu Xu) and Prof. Fangmin Song.

I graduated from Suzhou High School and Suzhou No.10 Middle School in 2002 and 1999, respectively.

Research Interests

Computer networks and distributed systems, data center networks and cloud computing, wirelessand mobile networks.

Publications:

2012

[TPDS] Chen Qian, Yunhuai Liu, Hoilun Ngan, and Lionel M. Ni, "ASAP: Scalable Arbitration for Contactless RFID Systems," accepted by IEEE Transactions on Parallel and Distributed Systems. [PDF]

2011

[SIGCOMM Workshop: GreenNet'11] Song Han, Tianji Li, Chen Qian, Douglas Leith, Aloysius K. Mok, Simon S. Lam, "HartFi: An Energy-Efficient Localization System", in Proceedings of ACM SIGCOMM Workshop on Energy and IT: from Green Networking to Smarter Systems, Toronto, ON, Canada, 2011. [PDF]

[ICDCS'11] Chen Qian and Simon S. Lam, ``Greedy Distance Vector Routing,'' in Proceedings of The 31st International Conference on Distributed Computing Systems (IEEE ICDCS), Minneapolis, Minnesota, 2011. Acceptance Ratio: 15%. [PDF]
Distance Vector routing selects the optimal routing path, but has high routing state and control overhead. Geographic routing is efficient in routing state, but physical distance might not be a good estimate for routing cost. Greedy Distance Vecotor (GDV) achieves the best of two worlds. GDV uses estimated routing costs to destinations which are locally computed from node positions in a virtual space. It is the first geographic routing protocol designed to optimize end-to-end path costs using any additive routing metric, such as: hop count, latency, ETX, ETT, etc. In addition, GDV requires no node location information.

[ICDCS'11] Yuanqing Zheng, Mo Li, and Chen Qian, ``PET: Probabilistic Estimating Tree for Large-Scale RFID Estimation,'' in Proceedings of The 31st International Conference on Distributed Computing Systems (IEEE ICDCS), Minneapolis, Minnesota, 2011. Acceptance Ratio: 15%. [PDF]

[SIGMETRICS'11] Simon S. Lam and Chen Qian, "Geographic Routing in d-dimensional Spaces with Guaranteed Delivery and Low Stretch," in Proceedings of International Conference on Measurement and Modeling ofComputer Systems (ACM SIGMETRICS), San Jose, California, 2011. Acceptance Ratio: 26/177=14.7%. [PDF]
We present a novel geographic routing protocol, MDT, with several major advances over previous geographic protocols. First, our protocol achieves an average routing stretch close to 1. Second, our protocol can be used for nodes located in d-dimensional Euclidean spaces (d>=2). Third, it guarantees message delivery for arbitrary connectivity graphs, and node locations which may be accurate, inaccurate, or arbitrary. MDT is scalable and communication-efficient.

[TPDS] Chen Qian, Hoilun Ngan, Yunhao Liu, andLionel M. Ni, "Cardinality Estimation for Large-scale RFID Systems," IEEE Transactions on Parallel and Distributed Systems (TPDS), Sep. 2011. (Spotlight Paper of the issue, 40+ citations along with the conference version ) [PDF]

2010

[ICDCS'10] Chen Qian, Yunhuai Liu, Hoi-Lun Ngan, andLionel M. Ni, "ASAP: Scalable Identification and Counting for Contactless RFID Systems", in Proceedings of The 30th International Conference on Distributed Computing Systems (IEEE ICDCS), Genoa, Italy, 2010. Acceptance Ratio: 84/585=14.3%. [PDF]
When RFID tags are mobile and in large numbers, existing collision-arbitration protocols might not satisfy the scalability and time-efficiency requirements of many applications. To address this problem, we propose Adaptively Splitting-based Arbitration Protocol (ASAP), a scheme that provides low-latency RFID identification and has stable performance for up to billions of tags.

2009

[SenSys'09 Poster] Chen Qian, Simon S. Lam, and Vinod Venkataraman, "A Wireless Routing Protocol in d-dimensional Spaces", in Proceedings of The 7th ACM Conference on Embedded Networked Sensor Systems (ACM SenSys), Poster, Berkely, CA, 2009.

2008

[ICPADS'08] Xi Zhou, Guangtao Xue, Chen Qian, and Minglu Li, "Efficient Data Suppression for Wireless Sensor Networks", in Proceedings of 14th Intl Conference on Parallel and Distributed Systems (ICPADS), 2008.

Chen Qian , "Efficient Cardinality Counting for Large-scale RFID Systems", Thesis of Master of Philosophy, Hong Kong University of Science and Technology. [PDF]

[MASS'08] Jian Ma, Chen Qian, Qian Zhang, and Lionel M. Ni, "Opportunistic Transmission Based QoS Topology Control in Wireless Sensor Networks", in Proceedings of the Fifth IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2008). Acceptance Ratio: 60 out of 250+ [PDF]

[PerCom'08] Chen Qian, Hoi-Lun Ngan, and Yunhao Liu, "Cardinality Estimation for Large-scale RFID Systems'', in Proceedings of the Sixth Annual IEEE International Conference on Pervasive Computing and Communication (IEEE PerCom 2008). Acceptance Ratio: 19/160=11.9%, 40+ citations. Please read the journal version on TPDS [PDF]
We present a tag cardinality counting scheme, LoF, with three major advantages. First, LoF reduces the time cost from O(N) to O(logN), where N is the tag number. Second, LoF increases the system operating range from O(L) tags to 2^L tags, where L is the length of a ALOHA frame. Third, LoF supports RFID systems with multiple readers.

2007

[MobiOpp'07] Jian Ma, Qian Zhang, Chen Qian, and Lionel M. Ni, "Energy-efficient opportunistic topology control in wireless sensor networks", in Proceedings of the First International Workshop on Mobile Opportunistic Networking (ACM/SIGMOBILE MobiOpp 2007) in conjunction with MobiSys2007. [PDF]

Chen Qian, "Quantum Entanglement in Quantum Computing", in Quantum Computing (Jiafu Xu and Fangmin Song, eds.) Chapter 3, Nanjing University, 2007. (in Chinese)

2006

Chen Qian, "Quantum Entanglement and Quantum Computing", Journal of Computer Science, Nov. 2006. (in Chinese)

Technical Program Committee Member

HotPOST: The Fourth International Workshop on Hot Topics in Peer-to-Peer Computing and Online Social Networking, 2012

Reviewer

IEEE Transactions on Parallel and Distributed Systems; ACM Transaction on Sensor Networks; IEEE Transaction on Wireless Communication; IEEE
Transaction on Mobile Computing; Elsevier Computer Communications; Ad Hoc and Sensor Wireless Networks: An International Journal; IEEE Transactions on Automation Science and Engineering; Wireless Networks (Springer); International Journal of Distributed Sensor Networks
IEEE Infocom 2009, 2012; IEEE ICC 2008, 2012; IEEE Infocom 2008, 2009, 2011; IEEE ICDCS 2011; ACM MobiHoc 2008; IEEE PerCom 2008, 2009; IEEE IWQoS 2007; IEEE RTSS 2007 ICDCN 2008; IEEE ICC 2008; IEEE MASS 2008; IEEE ICPADS 2008; ACM/SIGMOBILE MobiOpp 2007; IEEE Globecom 2007;
National Science Foundation of China (NSFC), 2008.



Last modified: Aug, 2011