RSVP extensions for real-time services in wireless mobile networks

Currently, the RSVP model, which is efficient resource reservation in the fixed endpoints, becomes invalid under host mobility. We investigate the problems of standard RSVP in providing real-time services in wireless mobile networks. We also observe carefully how to interoperate IntServ services over DiffServ networks, and how to map IntServ QoS parameters into a wireless link. We then identify the advantages and drawbacks of the existing RSVP proposals to support QoS under both micromobility and macromobility. We finally propose a dynamic resource allocation scheme for reducing service disruption of real-time applications due to frequent mobility of a host     

Efficient channel assignment method for multimedia traffic in wireless mesh networks

In wireless mesh networks, the availability of spectrum should be utilized efficiently because the exchanging of traffic rate of multimedia applications is increasing day to day. The traffic of multimedia content may degrade the network performance in terms of high packet loss and throughput degradation because of asynchronous behavior between the sender and the receiver. The proposed Efficient Channel Reservation and Assignment (EchRA) results in successful originating and handing off of multimedia call transmissions using the four dimensional Markov chain process. The EChRA algorithm, proposed in this paper, achieves the maximum throughput performance considering the parameters of blocking probability, dropping probability, and synchronized dwell time between the source and destination. The quality of service is guaranteed by sharing the available slots and by using efficient queuing model to service the incoming and handoff calls, and henceforth, the successful completion of handoff calls rate is increased. Copyright © 2015 John Wiley & Sons, Ltd.     

Call admission control scheme for real-time services in packet-switched OFDM wireless networks

A call admission control scheme is proposed for real-time services in packet-switched orthogonal frequency division multiplexing （OFDM） wireless cellular networks. The main idea of the proposed scheme is to use maximum acceptance ratio to maintain maximum channel utilization for real-time services according to the desired packet-level and call- level quality-of-service （QoS） requirements. The acceptance ratio is periodically adjusted by using a time discrete Markov chain and Wiener prediction theory according to the varying traffic load. Extensive simulation results show that this algorithm maintains high channel utilization, even as it guarantees packet-level and call-level QoS requirements for real-time services.     

Efficient link-heterogeneous multicast for wireless mesh networks

A wireless mesh network (WMN) is a type of communication network made up of wireless devices and organized in a mesh topology. Multicast is a fundamental service in WMNs because it efficiently distributes data among a group of nodes. Multicast algorithms in WMNs are designed to maximize system throughput and minimize delay in order to satisfy the end users?? requirement. Previous work has unrealistically assumed that the underlying WMN is link-homogeneous. We consider one important form of link heterogeneity: different link loss ratios, or equivalently different ETX. Different from other work addressing multicast in wireless networks, we point out that the local broadcast quality relies on the worst involved link. We model different link loss ratios by defining a new graph theory problem, Heterogeneous Weighted Steiner Connected Dominating Set (HW-SCDS), on an edge-weighted directed graph, where the edge weights model ETX, the reciprocal of link loss ratios. We minimize the number of transmissions in a multicast by computing a minimum HW-SCDS in the edge-weighted graph. We prove that HW-SCDS is NP-hard and devise a greedy algorithm for it. To improve the effectiveness of our algorithm, we design a dedicated channel assignment algorithm. Simulations show that our algorithm significantly outperforms the current best WMN multicast algorithm by both increasing throughput and reducing delay.     

低轨卫星通信中基于公平性的信道借用策略

首先建立了LEO卫星移动模型和用户多媒体业务量模型,然后通过计算机仿真,分析了各种信道分配策略在LEO卫星多媒体通信中的性能,提出了信道借用切换策略(CBS),仿真结果表明其能很好地满足LEO卫星多媒体业务的服务质量(QoS),同时也提高了系统的信道利用率,最后讨论了3种不同信道借用策略的公平性和系统性能。     

An adaptive quality of service channel borrowing algorithm for cellular networks

A multimedia call consists of three main sub‐streams (i.e. video, audio and data) each with its own distinct quality of service (QoS) requirements (e.g. packet loss rate, delay tolerance, and jitter). These requirements constitute a specific fixed QoS level. In contrast to static approaches, we propose an adaptive QoS platform in which each sub‐stream declares a preset range of acceptable QoS levels (e.g. maximum, acceptable, minimum) instead of just a single level. This range of QoS levels is pre‐defined in a user‐defined profile (UDP). In this paper, we propose a channel borrowing algorithm based on such adaptive QoS platform. In our proposed algorithm, an acceptor cell that has used all its channels can borrow from any neighbouring (donor) cell as long as this donor cell has some channels available after satisfying a minimum QoS (minQ) level defined in the UDP. A donor cell that is assigning QoS levels (to calls under its coverage) higher than the minQ levels will declare those channels as available for borrowing by other acceptor cells. The criteria for choosing the free channel include not only the number of free channels, but also the QoS levels in the donor cell. The criteria are also extended to include the effect of channel locking on the number of free channels, and the QoS levels on the locked cells. The algorithm is not triggered unless it does not cause any call dropping in either the donor cell, or the cells affected by call blocking. In the meantime, the call blocking rate is significantly decreased while the offered load increases. Copyright © 2003 John Wiley & Sons, Ltd.     

Dynamic channel assignment strategy for mobile cellular networksbased on compact patterns with maximised channel borrowing

Compact pattern with maximised channel borrowing (CPMCB), a novel dynamic channel assignment strategy (DCA), provides efficient spectrum reuse in cellular mobile networks. Numerical examples show 8% more traffic carrying capacity than borrowing with directional channel locking (BDCL), and ~80% more compared with the fixed channel assignment strategy (FCA)     

Efficient broadcasting protocols for regular wireless sensor networks

The wireless sensor network (WSN) has attracted lots of attention recently. Broadcast is a fundamental operation for all kinds of networks and it has not been addressed seriously in the WSN. Therefore, we propose two types of power and time efficient broadcasting protocols, namely one‐to‐all and all‐to‐all broadcasting protocols, for five different WSN topologies. Our one‐to‐all broadcasting protocols conserve power and time by choosing as few relay nodes as possible to scatter packets to the whole network. Besides, collisions are carefully handled such that our one‐to‐all broadcasting protocols can achieve 100% reachability. By assigning each node a proper channel, our all‐to‐all broadcasting protocols are collision free and efficient. Numerical evaluation results compare the performance of the five topologies and show that our broadcasting protocols are power and time efficient. Copyright © 2005 John Wiley & Sons, Ltd.     

Efficient clustering algorithms for self-organizing wireless sensor networks

Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy resources available in these networks. In this paper, we make contributions towards improving the efficiency of self-organization in wireless sensor networks. We first present a novel approach for message-efficient clustering, in which nodes allocate local “growth budgets” to neighbors. We introduce two algorithms that make use of this approach. We analyze the message complexity of these algorithms and provide performance results from simulations. The algorithms produce clusters of bounded size and low diameter, using significantly fewer messages than the earlier, commonly used, Expanding Ring approach. Next, we present a new randomized methodology for designing the timers of cluster initiators. This methodology provides a probabilistic guarantee that initiators will not interfere with each other. We derive an upper bound on the expected time for network decomposition that is logarithmic in the number of nodes in the network. We also present a variant that optimistically allows more concurrency among initiators and significantly reduces the network decomposition time. However, it produces slightly more clusters than the first method. Extensive simulations over different topologies confirm the analytical results and demonstrate that our proposed methodology scales to large networks.     

Distributed semi-synchronous channel coordination for multi-channel wireless networks

In multi-channel wireless networks, multi-channel diversity can increase the number of concurrent transmissions and thus improve the throughput performance as data transmission on a wireless channel does not interfere with transmissions on the other non-overlapping channels. However, multi-channel coordination may cause severe performance degradation due to hidden terminals, missing receivers, or broadcast deafness problems if the channel usage information is not properly shared among the neighboring nodes. In this paper, we devise a semi-synchronous multi-channel coordination protocol that enables wireless nodes to: (i) efficiently exchange channel and coordination information, and (ii) reduce the overhead of channel switchings. In the proposed protocol, a rendezvous interval is set up in a distributed manner depending on the traffic rate and pattern, and each node independently switches its channel when it can complete its transmissions and then returns to the control channel within the rendezvous interval. This approach makes all nodes return to the control channel at almost the same time without incurring a severe synchronization overhead. Through subsequent analyses and simulation studies, we show that the proposed protocol effectively reduces the number of channel switchings, thereby achieving higher throughput in various multi-channel networking environments.     

Bandwidth aggregation for real-time applications in heterogeneous wireless networks

A variety of wireless interfaces are available for today's mobile user to access Internet content. When coverage areas of these different technologies overlap, a terminal equipped with multiple interfaces can use them simultaneously to improve the performance of its applications. In this paper, we motivate the advantages that can be had through simultaneous use of multiple interfaces and present a network layer architecture that enables diverse multiaccess services. In particular, we explore in depth one such service provided by the architecture: Bandwidth Aggregation (BAG) for real-time applications. An important aspect of the architecture when providing BAG services for real-time applications is the scheduling algorithm that partitions the traffic onto different interfaces such that the QoS requirements of the application are met. We propose one such algorithm Earliest Delivery Path First (EDPF), that ensures packets meet their playback deadlines by scheduling packets based on the estimated delivery time of the packets. We show through analysis that EDPF performs close to an idealized Aggregated Single Link (ASL) discipline, where the multiple interfaces are replaced by a single interface with same aggregated bandwidth. A prototype implementation and extensive simulations carried using video and delay traces show the performance improvement BAG with EDPF scheduling offers over using just the Highest Bandwidth Interface (HBI) and other scheduling approaches based on weighted round robin.     

基于无线传感器网络汇聚传输实时性的分布式调度算法

在无线传感器网络多种应用中,各节点需要在短时间内将采集的数据传输至汇聚节点,从而形成多对一的汇聚传输。针对网络汇聚传输的实时性,提出了一种分布式的节点传输调度算法。各节点只需要根据一跳范围内的邻居信息进行传输调度。仿真和分析表明该算法可以有效避免数据碰撞,并使得完成一次全网数据收集所需要的时隙数基本在网络节点总数的1.6到1.8倍左右,比目前其他调度算法在实时性和复杂度方面更具有优势。     

A distributed control strategy for wireless ATM networks

Cellular networks are expected to be upgraded to offer Personal Communication Services (PCS). The mobility management and wireless call control approach used in cellular networks are currently being proposed for use in PCS networks. Recent work indicates that both the signaling load and database update rates caused by these mobility management and call control procedures will increase significantly in next generation PCS networks. In this paper, we propose and analyze a new cluster-based architecture and define algorithms to effectively handle mobility management and call control functions for PCS. We assume an ATM network infrastructure. Some of the key aspects of our proposal include simplifying the mobile location and tracking function, performing connection setup in segments, eliminating the need for user service profile downloads between networks, and more efficient routing of connections by removing the need for an anchor switch. Advantages of this approach include a reduction in signaling traffic load, improved call/connection setup delays, and more efficient routing of connections. We carry out an analysis of our solution for high-tier PCS applications.     

Energy-efficient node deployment strategy for wireless sensor networks

To balancing energy consumption in wireless sensor networks, we proposed a fixed time interval node broadcasting scheme under variational acceleration straight-line movement model. Simulation results show that the approach proposed in this paper has a superior performance on energy consumption balance compared to uniform broadcasting methods.     

A unified wireless LAN architecture for real-time and non-real-timecommunication services

This paper addresses how to support both real-time and non-real-time communication services in a wireless LAN with dynamic time-division duplexed (D-TDD) transmission. With D-TDD, a frequency channel is time-shared for both downlink and uplink transmissions under the dynamic access control of the base station. The base station (1) handles uplink transmissions by polling mobiles in a certain order determined on a per-connection (per-message) basis for transmitting real-time (non-real-time) traffic from mobiles and (2) schedules the transmission of downlink packets. To handle location-dependent, time-varying, and bursty errors, we adopt the channel-state prediction, transmission deferment, and retransmission. We consider the problems of scheduling and multiplexing downlink packet transmissions, and polling mobiles for uplink transmissions depending on the channel state. We also establish conditions necessary to admit each new real-time connection by checking if the connection's delivery-delay bound can be guaranteed as long as the channel stays in good condition without compromising any of the existing guarantees. Last, the performance of the proposed protocol is evaluated to demonstrate how the protocol works and to study the effects of various parameters of the protocol     

Efficient clustering-based data aggregation techniques for wireless sensor networks

In wireless sensor network applications for surveillance and reconnaissance, large amounts of redundant sensing data are frequently generated. It is important to control these data with efficient data aggregation techniques to reduce energy consumption in the network. Several clustering methods were utilized in previous works to aggregate large amounts of data produced from sensors in target tracking applications (Park in A dissertation for Doctoral in North Carolina State University, 2006). However, such data aggregation algorithms show effectiveness only in restricted environments, while posing great problems when adapting to other various situations. To alleviate these problems, we propose two hybrid clustering based data aggregation mechanisms. The combined clustering-based data aggregation mechanism can apply multiple clustering techniques simultaneously in a single network depending on the network environment. The adaptive clustering-based data aggregation mechanism can adaptively choose a suitable clustering technique, depending on the status of the network. The proposed mechanisms can increase the data aggregation efficiency as well as improve energy efficiency and other important issues compared to previous works. Performance evaluation via mathematical analysis and simulation has been made to show the effectiveness of the proposed mechanisms.     

Resource assignment for integrated services in wireless ATM networks

The task of supporting integrated multirate multimedia traffic in a bandwidth-poor wireless environment poses a significant challenge for network designers. In this paper we propose a novel bandwidth allocation strategy which partitions the available bandwidth amongst the different traffic classes in a manner that ensures quality-of-service guarantees for digital video while minimizing the maximum blocking probability for voice and data connections. At the connection level, near-optimum utilization of the reserved bandwidth for video traffic is achieved through an intra-frame statistical multiplexing algorithm, while at the system level the delicate task of partitioning the bandwidth between voice, video and data is accomplished by developing an efficient algorithm which uses traffic parameters consisting only of the aggregate traffic load and the total available bandwidth. The algorithm, built on non-trivial mathematical results is robust, easy to implement and has a geometric rate of convergence which ensures that the partitioning points are found quickly. These properties make it well suited for practical implementations, even for cases where changes in the aggregate traffic loads cause bandwidth allocations to be recomputed frequently. © 1998 John Wiley & Sons, Ltd.     

Efficient VLSI for Lempel-Ziv compression in wireless datacommunication networks

We present a parallel algorithm, architecture, and implementation for efficient Lempel-Ziv (LZ)-based data compression. The parallel algorithm exhibits a scalable, parameterized, and regular structure and is well suited for VLSI array implementation. Based on our parallel algorithm and systematic design methodologies, two semisystolic array architectures have been developed which are low power and area efficient. The first architecture trades off the compression speed for the area and has a low run-time overhead for multichannel compression. The second architecture achieves a high compression rate (one data symbol per clock) at the expense of the area due to a large clock load and global wiring. Compared to a recent state-of-the-art parallel architecture, our first array structure requires significantly less chip area (≃330 k versus ≃36 k transistors) and more than an order of magnitude less power (≈1.0 W versus ≈70 mW) while still providing the compression speed required for most data communication applications. Hence, data compression can be adopted in portable data communication as well as wireless local area networks. The second architecture has at least three times less area and power while providing the same constant compression rate. To demonstrate the correctness of our design, a prototype module for the first architecture has been implemented using 1.2 μ complementary metal-oxide-semiconductor (CMOS) technology. The compression module contains 32 simple and identical processors, has an average compression rate of 12.5 million bytes/s, and consumes 18.34 mW without the dictionary (≈70 mW with a 4.1k SRAM for the dictionary) while operating at a 100 MHz clock rate (simulated)     

A hybrid channel allocation method for wireless communication networks

In this paper a new hybrid channel allocation method is presented, which focuses on both nominal and dynamic channel allocation. Copyright © 2000 John Wiley & Sons, Ltd.