Gen-Huey Chen

Learn More
The arrangement graph An,k, which is a generalization of the star graph (n − k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. Previously, the arrangement graph has proved Hamiltonian. In this paper, we further show that the arrangement graph remains Hamiltonian even if it(More)
With the provisioning of high-speed wireless LAN (WLAN) environments, traffic classes (e.g., VoIP or videoconference) with different QoS requirements will be introduced in future WLANs. The IEEE 802.11e draft is currently standardizing a distributed access approach, called the enhanced distributed coordination function (EDCF), to support service(More)