A scalable wireless virtual LAN

This paper presents a Wireless Virtual Local Area Network (WVLAN) to support mobility in IPoverATM local area networks. Mobility is handled by a joint ATMlayer handoff for connection rerouting and MAClayer handoff for location tracking, such that the effects of mobility are localized and transparent to the higherlayer protocols. Different functions, such as Address Resolution Protocol (ARP), mobile location, and ATM connection admission are combined to reduce protocol overhead and frontend delay for connectionless packet transmission in connectionoriented ATM networks. The proposed WVLAN, through the use of ATM technology, provides a scalable wireless virtual LAN solution for IP mobile hosts.     

Simulation‐based performance evaluation of routing protocols for mobile ad hoc networks

In this paper we evaluate several routing protocols for mobile, wireless, ad hoc networks via packetlevel simulations. The ad hoc networks are multihop wireless networks with dynamically changing network connectivity owing to mobility. The protocol suite includes several routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, endtoend delay, and routing load for a given traffic and mobility model. Both small (30 nodes) and medium sized (60 nodes) networks are used. It is observed that the new generation of ondemand routing protocols use much lower routing load, especially with small number of peertopeer conversations. However, the traditional link state and distance vector protocols provide, in general, better packet delivery and endtoend delay performance.     

Building video‐on‐demand servers

We have designed and implemented a controllable software architecture for a VideoonDemand (VOD) server. With the proposed software architecture, many system design issues can be investigated. For example, we studied several disk striping schemes in the storage subsystem and examined the impact of the disk striping schemes on the utilization of system resources. In the processing component, we observed that additional concurrent video streams can be supported by using efficient memory interleaving. Buffering with a large memory space in the processing subsystem is a common technique to alleviate the latency variance of accessing different system components. By employing userlevel control and scheduling, the variance can be decreased thereby reducing the resulting buffer space needed for each video stream. In the network subsystem, we adopted a serverdriven approach for investigating MPEG2 video delivery over Asynchronous Transfer Mode (ATM) networks. The VOD server controls the pace of video transmission and reduces the complexity of the client. Since the client has limited buffer space (due to cost considerations), we have reduced the buffer requirement by regulating the transmission based on timing information embedded in the MPEG2 streams. Our research and experimental results are based on a VOD server which is currently under construction. The prototype server is based on an SGI sharedmemory multiprocessor with a mass storage system consisting of RAID3 disk arrays. Using 30 RAID3 disk arrays, preliminary experimental results show that the prototype server can potentially support more than 360 highquality video streams with careful design and coordination of the different system components.     

Floor acquisition multiple access (FAMA) in single‐channel wireless networks

The FAMANCS protocol is introduced for wireless LANs and adhoc networks that are based on a single channel and asynchronous transmissions (i.e., no time slotting). FAMANCS (for floor acquisition multiple access with nonpersistent carrier sensing) guarantees that a single sender is able to send data packets free of collisions to a given receiver at any given time. FAMANCS is based on a threeway handshake between sender and receiver in which the sender uses nonpersistent carrier sensing to transmit a requesttosend (RTS) and the receiver sends a cleartosend (CTS) that lasts much longer than the RTS to serve as a busy tone that forces all hidden nodes to back off long enough to allow a collisionfree data packet to arrive at the receiver. It is shown that carrier sensing is needed to support collisionfree transmissions in the presence of hidden terminals when nodes transmit RTSs asynchronously. The throughput of FAMANCS is analyzed for singlechannel networks with and without hidden terminals; the analysis shows that FAMANCS performs better than ALOHA, CSMA, and all prior proposals based on collision avoidance dialogues (e.g., MACA, MACAW, and IEEE 802.11 DFWMAC) in the presence of hidden terminals. Simulation experiments are used to confirm the analytical results.     

A pattern classification proposal for object‐oriented audio coding in MPEG‐4

The future MPEG4 standard will adopt an objectoriented encoding strategy whereby an audio source is encoded at a very low bitrate by adapting a suitable coding scheme to the local characteristics of the signal. One of the most delicate issues in this approach is that the overall performance of the audio encoder greatly depends on the accuracy with which the input signal is classified. This paper shows that the difficult problem of audio classification for objectoriented coding can be effectively solved by selecting a salient set of acoustic parameters and adopting a fuzzy model for each audio object, obtained by a soft computinghybrid learning tool. The audio classifier proposed operates at two levels: recognition of the class to which the input signal belongs (talkspurt, music, noise, signaling tones) and then recognition of the subclass to which it belongs. The results obtained show that fuzzy logic is a valid alternative to the matching techniques of a traditional pattern recognition approach.     

Scalable parallel simulations of wireless networks with WiPPET: Modeling of radio propagation,mobility and protocols

We review the design, selected applications and performance of WiPPET (Wireless Propagation and Protocol Evaluation Testbed), a general parallel simulation testbed for various types of wireless networks. WiPPET has been written in TeD/C++, an objectoriented modeling framework that isolates network modeling from the underlying parallel discrete event simulator. We describe the techniques for modeling radio propagation (long and shortscale fading and interference) and protocols that promote scalability of parallel simulations at session and packet timescales. We outline two selected applications of WiPPET: integrated radio resource management in a mobile wireless network; and packet losses due to mobility and shortscale fading over a radio link. We illustrate the efficiency of the simulator under two partitioning schemes with parallel performance data obtained using the Georgia Time Warp optimistic simulator.     

Scheduling and bandwidth allocation for the distribution of archived video in VOD systems

Providing costeffective videoondemand (VOD) services necessitates reducing the required bandwidth for transporting video over highspeed networks. In this paper, we investigate efficient schemes for transporting archived MPEGcoded video over a VOD distribution network. A video stream is characterized by a timevarying traffic envelope, which provides an upper bound on the bit rate. Using such envelopes, we show that video streams can be scheduled for transmission over the network such that the perstream allocated bandwidth is significantly less than the source peak rate. In a previous work [13], we investigated stream scheduling and bandwidth allocation using global traffic envelopes and homogeneous streams. In this paper, we generalize the scheduling scheme in [13] to include the heterogeneous case. We then investigate the allocation problem under windowbased traffic envelopes, which provide tight bounds on the bit rate. Using such envelopes, we introduce three streamscheduling schemes for multiplexing video connections at a server. The performance of these schemes is evaluated under static and dynamic scenarios. Our results indicate a significant reduction in the perstream allocated bandwidth when stream scheduling is used. While this reduction is obtained through statistical multiplexing, the transported streams are guaranteed stringent, deterministic quality of service (i.e., zero loss rate and small, bounded delay). In contrast to video smoothing, our approach requires virtually no buffer at the settop box since frames are delivered at their playback rate.     

A multi‐attribute shot segmentation algorithm for video programs

This paper describes a new algorithm for detecting cuts, thereby segmenting a video into shots. Our Webbased video library contains a large volume of news and documentary material; most of the transitions between shots in that type of programming are cuts, rather than dissolves or other complex transitions. We have developed an accurate multiattribute algorithm for detecting cuts in video programs. The algorithm uses a motion metric to identify a set of cuts, then uses luminance histograms to eliminate false cuts. Our experimental results show that this algorithm is more accurate than previous motionbased transition detection algorithms.     

NETMAN: The design of a collaborative wearable computer system

This paper presents a wearable groupware system designed to enhance the communication and cooperation of highly mobile network technicians. It provides technicians in the field with the capabilities for realtime audioconferencing, transmission of video images back to the office, and contextsensitive access to a shared notebook. An infrared locationtracking device allows for the automatic retrieval of notebook entries depending on the user's current location.     

Performance comparison of battery power consumption in wireless multiple access protocols

Energy efficiency is an important issue in mobile wireless networks since the battery life of mobile terminals is limited. Conservation of battery power has been addressed using many techniques such as variable speed CPUs, flash memory, disk spindowns, and so on. We believe that energy conservation should be an important factor in the design of networking protocols for mobile wireless networks. In particular, this paper addresses energy efficiency in medium access control (MAC) protocols for wireless networks. The paper develops a framework to study the energy consumption of a MAC protocol from the transceiver usage perspective. This framework is then applied to compare the performance of a set of protocols that includes IEEE 802.11, ECMAC, PRMA, MDRTDMA, and DQRUMA*. The performance metrics considered are transmitter and receiver usage times for packet transmission and reception. The time estimates are then combined with power ratings for a Proxim RangeLAN2 radio card to obtain an estimate of the energy consumed for MAC related activities. The analysis here shows that protocols that aim to reduce the number of contentions perform better from an energy consumption perspective. The receiver usage time, however, tends to be higher for protocols that require the mobile to sense the medium before attempting transmission. The paper also provides a set of principles that could be applied when designing access protocols for wireless networks.*ECMAC: energyconserving MAC. PRMA: packet reservation multiple access. MDRTDMA: multiservices dynamic reservation TDMA. DQRUMA: distributedqueuing request update multiple access.     

A Markov modulated fluid queueing system with strict priority

We investigate a Markov modulated fluid queueing system with strict priority. The input process is composed of two fluid flows which are stored in buffer1 and buffer2, respectively. The rates of these fluid flows depend on the current state of a finite state Markov chain. Buffer1 has full assignment of priority (=strict priority) for service and so buffer2 is served at a residual service rate when buffer1 is empty. We explicitly derive the stationary joint distribution of the two buffer contents in the system by a spectral decomposition method. In the case of a twostate Markov chain, the joint distribution is explicitly expressed in terms of the system parameters. Also the joint moments and tail distributions of the two buffer contents are obtained and some numerical examples are presented.     

An adaptive algorithm for optimizing the packet size used in wireless ARQ protocols

We develop an algorithm that allows an ARQ protocol to dynamically optimize the packet size based on estimates of the channel biterrorrate. Our algorithm is particularly useful for wireless and satellite channels where the biterrorrates tend to be relatively high and time variable. Our algorithm uses the acknowledgment history to make estimates of the channel biterrorrate, based on which the optimal packet size can be chosen. We develop a Markov chain model for the analysis of the system, under static channel conditions, and show that the algorithm can achieve close to optimal performance using a history of just 10,000 bits. We also use the Gilbert–Elliott twostate Markov channel to model dynamic channel conditions. We show, through simulation, that the algorithm performs well even under rapidly changing channel conditions. Finally, we discuss a maximum likelihood approach for choosing the packet size, which performs almost optimally but is much easier to implement.     

Dynamic capacity allocation and hybrid multiplexing techniques for ATM wireless LANs

We consider digital wireless multimedia LANs and timevarying traffic rates. To deal effectively with the dynamics of the timevarying traffic rates, a Traffic Monitoring Algorithm (TMA) is deployed to dynamically allocate channel capacities to the heterogeneous traffics. The TMA is implemented as a higher level protocol that dictates the capacity boundaries within two distinct framed transmission techniques: a Framed Time DomainBased (FTDB) technique and a Framed CDMA (FCDMA) technique. The performance of the TMA in the presence of the FTDB technique is compared to its performance in the presence of the FCDMA technique for some traffic scenarios. The performance metrics used for the TMAFTDB and TMAFCDMA combinations are channel capacity utilization factors, traffic rejection rates, and traffic delays. It is found that the TMAFTDB is superior to the TMAFCDMA when the speed of the transmission links is relatively low and the lengths of the transmitted messages are relatively short. As the speed of the transmission links and the length of the transmitted messages increase, the TMAFCDMA eventually outperforms the TMAFTDB.     

Consistency management in Deno

We describe a new replicatedobject protocol designed for use in mobile and weaklyconnected environments. The protocol differs from previous protocols in combining epidemic information propagation with voting, and in using fixed perobject currencies for voting. The advantage of epidemic protocols is that data movement only requires pairwise communication. Hence, there is no need for a majority quorum to be available and simultaneously connected at any single time. The protocols increase availability by using voting, rather than primarycopy or primarycommit schemes. Finally, the use of perobject currencies allows voting to take place in an entirely decentralized fashion, without any server having complete knowledge of group membership. We show that currency allocation can be used to implement diverse policies. For example, uniform currency distributions emulate traditional voting schemes, while allocating all currency to a single server emulates a primarycopy scheme. We present simulation results showing both schemes, as well as the performance advantages of using currency proxies to temporarily reallocate currency during planned disconnections. Furthermore, we discuss an initial design of the underlying replicatedobject system and present a basic API.     

The effects of asymmetry on TCP performance

In this paper, we study the effects of network asymmetry on endtoend TCP performance and suggest techniques to improve it. The networks investigated in this study include a wireless cable modem network and a packet radio network, both of which can form an important part of a mobile ad hoc network. In recent literature (e.g., [18]), asymmetry has been considered in terms of a mismatch in bandwidths in the two directions of a data transfer. We generalize this notion of bandwidth asymmetry to other aspects of asymmetry, such as latency and mediaaccess, and packet error rate, which are common in widearea wireless networks. Using a combination of experiments on real networks and simulation, we analyze TCP performance in such networks where the throughput achieved is not solely a function of the link and traffic characteristics in the direction of data transfer (the forward direction), but depends significantly on the reverse direction as well. We focus on bandwidth and latency asymmetries, and propose and evaluate several techniques to improve endtoend performance. These include techniques to decrease the rate of acknowledgments on the constrained reverse channel (ack congestion control and ack filtering), techniques to reduce source burstiness when acknowledgments are infrequent (TCP sender adaptation), and algorithms at the reverse bottleneck router to schedule data and acks differently from FIFO (acksfirst scheduling).     

On proxy agents, mobility, and web access

With the emerging need for ubiquitous access to information, web access from mobile clients is gaining increasing importance. Unfortunately, the underlying protocols of the web are not designed to support operations from a resource poor platform in a low bandwidth, disconnection prone environment. Efforts to create systems to support mobile browsing have typically been proxybased. However, such solutions have recently been criticized due to their nonscalability. Developments in ad hoc networking also threaten the viability of proxybased approaches. In this paper, we critically examine the proxybased approach and its place in mobile access to the web in particular, and networked multimedia information in general. We argue for a hybrid approach that uses both proxybased and end–end techniques as appropriate, suggest when each is more appropriate, and present a preliminary implementation.     

Low‐noise,low‐voltage,low‐power IF gain controlled amplifiers for wireless communication

Circuit solutions of various types of gain controlled IF amplifiers with digital and analog gain control are described. Advantages and disadvantages of the different solutions are shown. Requirements for lowpower, lowvoltage, low noise, high gain and linearity at high IFfrequencies from the system point of view are worked out. Solutions will be presented to optain optimum performance by technology and circuit design technique for digital wireless telephone systems used for GSM and PCN systems.     

Supporting collaborative field operations with personal information processing systems

This paper describes a twoyear research project to develop a personal information processing system (PIPS) solution for the roving industrial field operator. Our PIPS system comprises (1) an RF network to deliver wireless digital information, (2) a wearable computer for delivering webbased information (the hardware is a twopiece system composed of a beltworn NetPC attached via a curly cable to a handheld unit with a mouse/display device combination), and (3) software applications that provide added value in the field. Unique challenges in designing such a system for this environment include providing: (1) good RF coverage in an environment with many metal structures; (2) an intrinsically safe, lightweight, lowcost hardware system; and (3) software that is compatible with the wearable system and supports collaboration in the field.     

Admission control with priorities: Approaches for multi‐rate wireless systems

Priority based linkbandwidth partitioning is required to support wireless multimedia services, having diverse QoS (delay, throughput) requirements, in mobile ad hoc networks with multimedia nodes. A new class of service disciplines, termed batch and prioritize or BP admission control (AC), is proposed. The BP algorithms use the delay tolerance of applications to batch requests in time slots. Bandwidth assignment is made either at the end of the slot, or during the slot, on a priority basis. Analytical and simulation models are developed to quantify the performance of the BP schemes. The results are compared with those obtained for a FirstComeFirstServed (FCFS) service discipline. The class of BP schemes trade off the delay and loss tolerance of applications to improve the net carried traffic on the link. Further, such schemes enable an easy implementation for adaptive prioritization, where the degree of precedence given to an application varies with offered load and the link capacity.     

Demand re‐registration for PCS database restoration

In a Personal Communications Services (PCS) network, mobility databases such as Home Location Register (HLR) and Visitor Location Register (VLR) are utilized to support mobility management for Mobile Stations (MSs). If the location databases fail, the location information loss or corruption will seriously degrade the service offered to the subscribers. In this paper, we propose a new VLR failure recovery scheme called demand reregistration. In this scheme, the VLR broadcasts a reregistration request to all MSs after the VLR failure. When an MS receives the reregistration request, it sends a registration message to the VLR to recover the location record. Since all MSs will reregister after receiving the broadcasting request, traffic jam (and thus collisions) may occur. If a collision occurs, then the involved MSs must resend the registration messages. This paper studies the performance of demand reregistration by investigating how effectively the reregistration can recover the location record for an MS before the first MS call termination occurs. Our results indicate that demand reregistration can effectively recover VLR failure.