Showing papers by "Mugen Peng published in 2006"
01 Oct 2006
TL;DR: An functional architecture supporting wireless mesh networks (WMNs) for IEEE 802.16 standard with tree level based centralized scheduling for the multi-radio multi-channel with spatial reuse is proposed and simulation results show that the proposal is efficiency.
Abstract: This paper proposes an functional architecture supporting wireless mesh networks (WMNs) for IEEE 802.16 standard. Three essential techniques: collision avoiding, packet scheduling and wireless routing are intensively investigated. Based on the mesh extension of IEEE 802.16 medium access control (MAC) layer protocol and the relay-based characteristic of WMNs, the algorithms concerning with those three techniques are briefly reviewed. The suitable algorithms for collision avoiding and packet scheduling mechanisms are analyzed. Meanwhile, the wireless routing algorithm for the proposal architecture is investigated. Especially, the tree level based centralized scheduling for the multi-radio multi-channel with spatial reuse is proposed. The simulation results show that the proposal is efficiency. The future research work is presented and the research problem is focused finally.
11 citations
25 Jun 2006
TL;DR: A cross-layer resource allocation algorithm with guaranteed diverse QoS is proposed for WiMAX (worldwide interoperability for microwave access) system and the performance is evaluated based on the WiMAX dynamical system-level simulation and compared with other existing algorithm.
Abstract: A cross-layer resource allocation algorithm with guaranteed diverse QoS is proposed for WiMAX (Worldwide Interoperability for Microwave Access) system. In order to maximize the system throughput under satisfaction of the diverse QoS requirements, packet scheduling, subchannel allocation and adaptive modulation and coding schemes are jointly designed. The QoS requirements of real-time user are analytically derived through a statistical fashion, and individual scheduling strategy is employed for each type of service in consideration of its specific characteristics. The performance of the proposed algorithm is evaluated based on the WiMAX dynamical system-level simulation and compared with other existing algorithm.
8 citations
01 Oct 2006
TL;DR: A reasonable adaptive traffic multiplexing scheme based on the scalable coding is presented and aims to relax the influence to the transmission of existing traditional 3G services.
Abstract: Multimedia Broadcast/Multicast Service (MBMS) is enabling the delivery of new services, most notably those that are video related streaming, with demanding huge network resources leading to influence to existing services. In this paper, a reasonable adaptive traffic multiplexing scheme based on the scalable coding is presented and aims to relax the influence to the transmission of existing traditional 3G services. We discuss the implementation of this scheme combined with releasing MBMS channel by monitoring system load. According to the achieved results, our scheme based on scalable coding to release MBMS channel has the advantage of power saving with a slight increase of complexity in signalling compared with the fixed number of MBMS channels without multiplexing.
2 citations
01 Jun 2006
TL;DR: Simulation results of network throughput and average active link number show that the Fair algorithm utilizes network resources more efficiently than the FIFO algorithm.
Abstract: We consider the problem of centralized multihop scheduling in wireless mesh networks for solutions to realize intelligent transportation systems. A scheduling tree construction strategy is investigated, which could use any predetermined selection metrics, while avoiding primary and secondary interferences to a great extent. Two centralized multihop scheduling algorithms are presented to schedule nodes on the constructed scheduling tree. In contrast with FIFO algorithm, the Fair algorithm has the property that it guarantees fairness among downlink relay queues of each relay node, while making an efficient utilization of free mini-slots. The feasibility of scheduling tree construction strategy with both minimal hop count and maximal signal strength metrics for a mesh cell is studied through experiment. Simulation results of network throughput and average active link number show that the Fair algorithm utilizes network resources more efficiently than the FIFO algorithm.
2 citations
25 Jun 2006
TL;DR: In this article, the authors considered the problem of routing and scheduling to form a centralized spatial reuse designing framework for fixed multi-hop relay wireless access networks and proposed a new scheduling algorithm to schedule links on a tree level basis.
Abstract: In this paper, we consider the problem of routing and scheduling to form a centralized spatial reuse designing framework for fixed multihop relay wireless access networks. Both minimal hopcount and maximal signal strength strategies to construct a routing tree are investigated. New scheduling algorithm is presented to schedule links on a tree level basis. In contrast with graph coloring, the new method is more feasible to enable efficient spatial reuse while avoiding primary and secondary interferences to a great extent. The proposed scheme also has the property that it guarantees fairness among downlink relay queues of each fixed relay node. Simulation results of network throughput and average active link number show that the new policy utilizes network resources more efficiently than the normal fair scheduling mechanism. The effect of routing strategies on tree level scheduling is also studied through experiment.