Is Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks?

published_or_final_versio

Topology-transparent distributed multicast and broadcast scheduling in mobile ad hoc networks

Transmission scheduling is a key problem in mobile ad hoc networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length in mobile ad hoc networks. Most algorithms are dependent on the exact network topology and cannot adapt to the dynamic topology in a mobile wireless network. To overcome this limitation, several topology-transparent scheduling algorithms have been proposed. The slots are assigned to guarantee that there is at least one collision-free time slot in each frame. In this paper, we consider multicast and broadcast, and propose a novel topology-transparent distributed scheduling algorithm. Instead of guaranteeing at least one collision-free transmission, the proposed algorithm guarantees one successful transmission exceeding a given probability, and achieves a much better average throughput. The simulation results show that the performance of our proposed algorithm is much better than the conventional TDMA and other existing algorithms in most cases. © 2012 IEEE.published_or_final_versio

Topology-Transparent Scheduling in Mobile Ad Hoc Networks With Multiple Packet Reception Capability

Recent advances in the physical layer have enabled wireless devices to have multiple packet reception (MPR) capability, which is the capability of decoding more than one packet, simultaneously, when concurrent transmissions occur. In this paper, we focus on the interaction between the MPR physical layer and the medium access control (MAC) layer. Some random access MAC protocols have been proposed to improve the network performance by exploiting the powerful MPR capability. However, there are very few investigations on the schedule-based MAC protocols. We propose a novel m-MPR-l-code topology-transparent scheduling ((m, l)-TTS) algorithm for mobile ad hoc networks with MPR, where m indicates the maximum number of concurrent transmissions being decoded, and l is the number of codes assigned to each user. Our algorithm can take full advantage of the MPR capability to improve the network performance. The minimum guaranteed throughput and average throughput of our algorithm are studied analytically. The improvement of our (m, l)-TTS algorithm over the conventional topology-transparent scheduling algorithms with the collision-based reception model is linear with m. The simulation results show that our proposed algorithm performs better than slotted ALOHA as well.published_or_final_versio

Topology-Transparent Broadcast Scheduling with Erasure Coding in Wireless Networks

published_or_final_versio

Topology-Transparent Scheduling in Mobile Ad Hoc Networks Supporting Heterogeneous Quality of Service Guarantees

Transmission scheduling plays a critical role in mobile ad hoc networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length. Most algorithms require information on the network topology and cannot adapt to the dynamic topology in mobile scenarios. To overcome this limitation, topology-transparent scheduling algorithms have been proposed. Most of them, based on Galois field theory, Latin square, and block design theory, assign time slots to users and guarantee that there is at least one collision-free slot in each frame for each user. To the best of our knowledge, none of these topology-transparent algorithms support multiple quality of service (QoS) requirements. In this paper, we exploit the variable-weight optical orthogonal codes (VW-OOC) to design a topology-transparent scheduling algorithm in wireless ad hoc networks with multiple QoS levels. We study the performance, in terms of minimum guaranteed throughput and average throughput, of our proposed algorithm analytically and by extensive simulations.published_or_final_versio

Performance Improvement of Topology-Transparent Broadcast Scheduling in Mobile Ad Hoc Networks

published_or_final_versio

A heterogeneous peer-to-peer network testbed

In this paper, we describe a heterogeneous peer-to-peer network testbed, which is developed as part of a joint research project to investigate novel resource discovery and content distribution protocols in a heterogeneous wired/wireless environment. We describe the testbed requirements, the testbed architecture, the multi-functional wireless node, and the software architecture. We also describe some of the proposed protocols to be developed and tested on the testbed. © 2009 IEEE.published_or_final_versionThe 1st International Conference on Ubiquitous and Future Networks (ICUFN 2009), Hong Kong, 7-9 June 2009. In Proceedings of the 1st ICUFN, 2009, p. 46-5

In-plane dielectric properties of epitaxial 0.65Pb(Mg[sub ⅓]Nb[sub ⅔])O₃-0.35 PbTiO₃ thin films in a very wide frequency range

Author name used in this publication: Y. WangAuthor name used in this publication: H. L. W. ChanAuthor name used in this publication: C. L. ChoyAuthor name used in this publication: K. C. Cheng2004-2005 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

Identification of amino acid substitutions in mutated peptides of nucleoprotein from avian influenza virus

Nucleoprotein (NP), the structural component of ribonucleoprotein complex of avian influenza virus, performs multiple essential functions in the regulation of viral RNA synthesis and in the control of nuclear traffic of viral proteins. Mutations have often been found in NP, some of which are relevant to viral survival strategies. In this study, we used nanospray-MS/MS to analyze tryptic digestion of nucleoprotein of avian influenza virus (H5N1) and to identify three mutated peptides. The MS/MS analyses allowed the confident determination of the three mutated amino acid residues F313Y, I194V and V408I/L in the mutated peptides of LLQNSQVYSLIRPNENPAHK, GVGTMVMELVR and ASAGQI/LSVQPTFSVQR, respectively. © 2009 Elsevier B.V. All rights reserved.postprin

Prevalence of antibiotic-resistant intestinal flora in patients undergoing transrectal ultrasonography-guided prostate biopsy (TRUS-Bx) and its implication for clinical practice: preliminary results

Oral (Free Paper) Session I - Prostate Cancer: Diagnosis to Treatment: OP.1-2香港泌尿外科學會OBJECTIVE: An important factor determining the choice of antibiotic for TRUS-Bx prophylaxis and treatment of post-biopsy infection is the prevalence of quinolone-resistant and ESBL-producing organisms in the rectum of patients undergoing this procedure. We aim to determine these prevalence values in patients undergoing TRUS-Bx and to study their correlation with the microbiological data of patients ...published_or_final_versionThe 17th Annual Scientific Meeting of the Hong Kong Urological Association, Hong Kong, 6 November 2011. In Program Book, 2011, p. 3