Haiyun Luo

Haiyun Luo

Auto-generated profile, based on publicly available information

Haiyun Luo

UCLA Computer Science Department

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
1 January 2005 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
HLHaiyun Luo
Haiyun Luo
FYFan Ye
Fan Ye
JCJerry Cheng
Jerry Cheng
SLSongwu Lu
Songwu Lu
LZLixia Zhang
Lixia Zhang

14 December 2006
Verified
Book Chapter
Closed access
PDF file
FYFan Ye
Fan Ye
HLHaiyun Luo
Haiyun Luo
SLSongwu Lu
Songwu Lu
LZLixia Zhang
Lixia Zhang

27 July 2001
Verified
Conference Paper
Closed access
JCJerry Cheng
Jerry Cheng
GZGary Zhong
Gary Zhong
HLHaiyun Luo
Haiyun Luo
SLSongwu Lu
Songwu Lu
Providing packet-level quality of service (QoS) is critical to support both rate-sensitive and delay-sensitive applications in the bandwidth-constrained, shared-channel, multihop wireless networks. This problem is challenging due to the unique issues such as location-dependent contention, inherent conflict between ensuring fairness and maximizing channel utilization, and the distributed nature of packet scheduling in such networks. In order to address these issues, we have taken a new self-organizing approach to QoS solutions for such networks. In this approach, local decision makers self-organize themselves and coordinate among one another, and collectively achieve the desired global property. Some features of our approach include fully localized design, coordination among local decision makers, intentional and optimized information propagation, scaling property and achievable global property. Two key contributions of this work are: (a) a model-referenced self-organizing design methodology for multihop wireless networks; and (b) a table-driven approach and a backoff-based approach to distributed packet scheduling that provides QoS performance bounds in terms of fairness, throughput and delay, maximizes channel spatial reuse, and arbitrates the conflict between fairness and maximal channel utilization. oth proposed designs work within the CSMA/CA MAC framework. We also compare the performance of these two approaches through simulations. Our extensive simulation results have confirmed the effectiveness of the proposed design.