Dynamic bandwidth allocation for multimedia traffic with rate guarantee and fair access in WCDMA systems

Packet scheduling in a WCDMA system poses a new challenge due to its nature of variable bit rates and location-dependent, time-varying channel conditions. In this work, three new downlink scheduling algorithms for a WCDMA base station are proposed to support multimedia transmissions. Using a credit management and a compensation mechanism, our algorithms provide rate guarantee and fair access to mobile terminals. In particular, we propose to allow a user to simultaneously use multiple OVSF codes in a time-sharing manner, which we call a multicode, shared model. Using multiple codes allows us to compensate those users suffering from bad communication quality or even errors. The proposed schemes can tolerate a multistate link condition (compared to the typically assumed two-state, or good-or-bad, link condition) by adjusting the number of OVSF codes and the spreading factor of each code. Simulation results show that the proposed schemes do achieve higher bandwidth utilization while keeping transmission delay low.     

A borrow-and-return model to reduce client waiting time for broadcasting-based VOD services

One way to broadcast a popular video is to use multiple channels, each broadcasting a portion of the video periodically. Among the many schemes falling in this category, this paper focuses on several representative schemes (such as FB, Pagoda, and RFS ), which all share a FSFC property by repeatedly broadcasting the first segment of the video on the first channel. We propose a general borrow-and-return model that can be immediately applied to any scheme owning the FSFC property to reduce the viewer's waiting time without increasing the number of channels required. Given a group of videos, the basic idea is to lend the free time slots of videos without viewers to those videos with viewers to speedup the latter's transmission. By so doing, some bandwidth may be vacated by the borrowing videos to benefit others' transmission. The effectiveness of this model is analyzed by applying it to the FB scheme.     

An efficient reliable broadcasting protocol for wireless mobile ad hoc networks

The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to which we refer as the broadcast storm problem. This paper proposes an efficient reliable broadcasting protocol by taking care of the potential broadcast storm problem that could occur in the medium-access level. Existing protocols are either unreliable, or reliable but based on a too costly approach. Our protocol differs from existing protocols by adopting a low-cost broadcast, which does not guarantee reliability, as a basic operation. The reliability is ensured by additional acknowledgement and handshaking. Simulation results do justify the efficiency of the proposed protocol.     

A fast video-on-demand broadcasting scheme for popular videos

Broadcasting is a prospective approach to support near video-on-demand services with light communication overhead. By letting clients share channels, such approaches involve partitioning a video into segments and repeatedly broadcasting these segments in multiple channels. An early paper proposed a broadcasting scheme called RFS (recursive frequency splitting), which can significantly reduce clients' waiting time. While efficient, RFS suffers from a high computational complexity of O(nlogn), where n is the number of segments of the video, which is typically very large. This paper proposes an efficient segmentation scheme, which can significantly reduce the computational overhead by slightly sacrificing the number of segments that can be arranged as compared to RFS.     

The Orphan Problem in ZigBee Wireless Networks

ZigBee is a communication standard which is considered to be suitable for wireless sensor networks. In ZigBee, a device (with a permanent 64-bit MAC address) is said to join a network if it can successfully obtain a 16-bit network address from a parent device. Parent devices calculate addresses for their child devices by a distributed address assignment scheme. This assignment is easy to implement, but it restricts the number of children of a device and the depth of the network. We observe that the ZigBee address assignment policy is too conservative, thus usually making the utilization of the address pool poor. Those devices that cannot receive network addresses will be isolated from the network and become orphan nodes. In this paper, we show that the orphan problem can be divided into two subproblems: the bounded-degree-and-depth tree formation (BDDTF) problem and the end-device maximum matching (EDMM) problem. We then propose algorithms to relieve the orphan problem. Our simulation results show that the proposed schemes can effectively reduce the number of orphan devices compared to the ZigBee strategy.     

iMouse: An Integrated Mobile Surveillance and Wireless Sensor System

Incorporating the environment-sensing capability of wireless sensor networks into video- based surveillance systems can provide advanced services at a lower cost than traditional surveillance systems.The integrated mobile surveillance and wireless sensor system (iMouse) uses static and mobile wireless sensors to detect and then analyze unusual events in the environment.     

Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802.11 Ad Hoc Networks

This paper investigates the power mode management problem for an IEEE 802.11-based mobile ad hoc network (MANET) that allows mobile hosts to tune to the power-saving (PS) mode. There are two major issues that need to be addressed in this problem: (a) wakeup prediction and (b) neighbor discovery. The former is to deliver buffered packets to a PS host at the right time when its radio is turned on. The latter is to monitor the environment change under a mobile environment. One costly, and not scalable, solution is to time-synchronize all hosts. Another possibility is to design asynchronous protocols as proposed by Tseng et al. in [25]. In this paper, we adopt the latter approach and correlate this problem to the quorum system concept. We identify a rotation closure property for quorum systems. It is shown that any quorum system that satisfies this property can be translated to an asynchronous power-saving protocol for MANETs. Thus, the result bridges the classical quorum system design problem in the area of distributed systems to the power mode management problem in the area of mobile ad hoc networks. We derive a lower bound for quorum sizes for any quorum system that satisfies the rotation closure property. We identify a group of quorum systems that are optimal or near optimal in terms of quorum sizes, which can be translated to efficient asynchronous power-saving protocols. We also propose a new e-torus quorum system, which can be translated to an adaptive protocol that allows designers to trade hosts' neighbor sensibility for power efficiency. Simulation experiments are conducted to evaluate and compare the proposed protocols.     

Location awareness in ad hoc wireless mobile networks

Networks composed of dynamically repositioning mobile hosts require location awareness to provide new geographic services and to maximize routing efficiency and quality of service. Because wireless networks can operate in a 3D physical environment, exploiting mobile hosts' location information is both natural and inevitable. Emerging geographic services based on mobile ad-hoc networks (manets) must confront several challenges, including how to increase positioning accuracy and how to establish a connection from location information to the vast body of Web data, as in a tour-guide system for example     

A Seamless Handoff Mechanism for DHCP-Based IEEE 802.11 WLANs

IEEE 802.11 wireless networks have gained great popularity. However, handoff is always a critical issue in this area. In this paper, we propose a novel seamless handoff mechanism for IEEE 802.11 wireless networks which support IEEE 802.11i security standard. Our approach consists of a dynamic tunnel establishing procedure and a seamless handoff mechanism. Both intra- and inter-subnet handoff cases are considered in our seamless handoff approach. Our work focuses on handoffs in DHCP-based IP networks rather than mobile IP-supported networks, but the proposed scheme can be easily tailored to mobile IP-supported networks.