By Topic

Global Telecommunications Conference Workshops, 2004. GlobeCom Workshops 2004. IEEE

Date 29 Nov.-3 Dec. 2004

Filter Results

Displaying Results 1 - 25 of 105
  • Optimal dynamic periodic location update for UMTS mobile networks - a simulation approach

    Publication Year: 2004 , Page(s): 225 - 229
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (595 KB) |  | HTML iconHTML  

    Location management is essential for delivering services to mobile stations (MSs) in mobile networks. In 3GPP technical specifications for the circuit-switched domain of Universal Mobile Telecommunications System, both normal location update and periodic location update (PLAU) are adopted to track locations of MSs. PLAU is also used for detecting detachment of an MS from the network. In this paper, we analyze the cost of location management under the presence of abnormal detachments. Based on our cost analysis, we propose a simulation approach to find the optimal parameter to minimize the cost for the dynamic PLAU. A gradient descent algorithm is also implemented to find the optimal parameter for a different cost function. Results show that the cost is significantly deducted with the proposed optimal approach. Another contribution is that we show how to solve an optimization problem through a simulation approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient model of the www session

    Publication Year: 2004 , Page(s): 302 - 305
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (490 KB) |  | HTML iconHTML  

    The aim of this paper is to present a simplification of the www-browsing action model presented by the European Telecommunications Standards Institute. This simplification can be used in numerical simulations of the packed switched telecommunication traffic. We show that the simplification is accurate. The theoretical, statistical and sample simulation results are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The deafness problems and solutions in wireless ad hoc networks using directional antennas

    Publication Year: 2004 , Page(s): 108 - 113
    Cited by:  Papers (17)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (633 KB) |  | HTML iconHTML  

    This paper addresses the issue of deafness in directional antennas for wireless ad hoc networks. Deafness is caused when a node X repeatedly attempts to communicate with node Y but is unsuccessful, because Y is presently tuned to some other antenna beam. In this paper, we first outline the different factors which contribute to such deafness in directional antennas and its significant impact on network performance. We then propose two schemes to overcome deafness scenarios which are transparent to the underlying directional MAC protocol in use. In addition, we also claim that IEEE 802.11 short retry limit (SRL) needs a special handling in directional environment because of the presence of deafness. We have done a detailed performance evaluation of our schemes with different directional MAC protocols running over switched beam antennas and the initial results are found to be very promising. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reverse link power control algorithm based on game theory for multi-cell wireless data networks

    Publication Year: 2004 , Page(s): 459 - 468
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (696 KB) |  | HTML iconHTML  

    We propose a new decentralized power control algorithm for multi-cell wireless data networks that can fully utilize and equally assign radio resources to all mobile stations (MSs). Our approach employs game theory as its basis with a utility function and pricing, but uses the network (base station) to assist mobile stations in performing power control. This is similar to a leader-followers strategy used in the literature of game theory. As a result, the proposed algorithm is implemented in the form of closed loop power control. This proposed power control scheme can maximize the throughput of each MS and can fully utilize the amount of radio resources allowed in a cell. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of measurement-based equivalent bandwidth estimators

    Publication Year: 2004 , Page(s): 320 - 326
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (578 KB) |  | HTML iconHTML  

    This paper compares the efficacy of two measurement based equivalent bandwidth estimators: the Gaussian approximation allocation and the one based on fractal envelope process. These estimators represent a trade-off between accuracy and computational complexity. The estimators were evaluated under different scenarios using video, voice and data traffic. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NMP - a new networked music performance system

    Publication Year: 2004 , Page(s): 176 - 185
    Cited by:  Papers (2)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (953 KB) |  | HTML iconHTML  

    Although IT has penetrated into nearly every aspect of the work and life of human beings, music professionals still stick to the traditional way of carrying out rehearsals and concerts. Music performance in this way requires physical presence of the participants and has a number of inherent limitations. We introduce in this paper a prototype of a novel networked music performance system that enables the music professionals and enthusiasts to play with each other through cyberspace. An application like this is bandwidth demanding, highly delay-sensitive and requires the synchronization of the audio streams. Hence, the support from underlying end-systems and networks is critical. However, the current source coding mechanisms and the best-effort nature of the Internet poses many challenges to achieve the desired quality of service. We have implemented the prototype in a local area network environment on Linux PCs. The system contains four major interactive components and enables two different application scenarios of real-time rehearsal and rehearsal on-demand multi-channel audio transport and different audio compression schemes are supported. Our evaluation results based on both subjective and objective measurements show that the system suffices the audio quality level for the target application. In the future, we extend our system to larger scale and consider more realistic network conditions in the Internet. Moreover, the support for MPEG-4 AAC codec for even better quality of multi-channel audio streaming and enhanced audio quality under the same bandwidth constrains are added. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic pricing model for data services in GPRS networks

    Publication Year: 2004 , Page(s): 453 - 458
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (598 KB) |  | HTML iconHTML  

    GPRS data services are subject to severe performance degradation due to limited network resources. The technical approaches taken to alleviate the problem are not sufficient to encounter a complete range of incoming scenarios. In this paper, we define and study analytically a performance model for GPRS data services that takes into account prices that change dynamically, depending on the congestion in the system. The model is based on a Markov modulated Poisson process (MMPP), where the arrival rates are affected by a demand function. Performance metrics are also calculated. We believe that the proposed model captures the effect of dynamic pricing on the performance of GPRS data services in a realistic manner. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SEEHOC: scalable and robust end-to-end header compression techniques for wireless ad hoc networks

    Publication Year: 2004 , Page(s): 141 - 146
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (636 KB) |  | HTML iconHTML  

    End-to-end header compression provides a cost-effective mechanism for increasing the utilization and efficiency of wireless ad hoc networks. Current header compression algorithms are targeted towards directly connected nodes. In this paper, we discuss novel techniques that enable end-to-end header compression for multimedia flows traversing wireless ad hoc networks. Utilizing OPNET simulations and a rapid prototype, we show that the techniques significantly improve the utilization and efficiency of wireless ad hoc networks without introducing overheads that might cause loss of packets or impact the quality of the flows. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of rate control and QoS capabilities of BRAS

    Publication Year: 2004 , Page(s): 293 - 301
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (777 KB) |  | HTML iconHTML  

    This paper reports the initial results of OPNET simulation modeling of DSL Forum TR.59 and WT92 traffic management capabilities required in BRAS to deliver end-to-end IP QoS over an existing DSL access network and emerging architectures. TR.59 extends the role of the BRAS to include congestion management of the access network, provide IP QoS per user downstream and rate limiting upstream. The objective of the simulations and the results reported here is to demonstrate the feasibility of such an extension and to evaluate the efficiency of traffic management mechanisms in enabling the new required capabilities in BRAS. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MSAP - a protocol for efficient multimedia content search and distribution on the Internet

    Publication Year: 2004 , Page(s): 548 - 551
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (629 KB) |  | HTML iconHTML  

    More and more music or movie consumers are using Internet to download multimedia content. Consumers have more to consider than just the name of the artist when they buy multimedia content online. With thousands of web sites that are available on the Internet, it is time consuming for consumers to obtain the desired multimedia content, starting from the beginning of searching a title to the end of placing a purchase order. In this paper, we propose a protocol MSAP (multimedia service announcement protocol) that enables consumers to search and download multimedia content more effectively and faster. It also helps to establish a secure channel for the producers of the multimedia content to distribute their original multimedia content to consumers. We have implemented the initial MSAP prototype in our test bed and the results indicate that our approach is efficient and accurate. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast colored surface rendering for entertainment applications on small devices - an experimental study

    Publication Year: 2004 , Page(s): 536 - 539
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (511 KB) |  | HTML iconHTML  

    The actual small devices, such as smartphones, PDAs, and handheld devices, represent a challenging scenario. The applications running on those devices require a trade-off between the responsiveness felt by the user, and the onboard computational power. The latter resembles to the computational power of the early 90's computers. Therefore, this kind of hardware is inadequate to support the same solutions adopted by the actual personal computers. This paper emphasizes the usage of colors and wire-frame visualization as an effective solution to the above limitations. The focus of this work is on the visualization of bivariate function surfaces. This proposal allows both an high visual impact, still remaining fast and accurate, both the fast rendering of scenarios in several entertainment applications. The proposed visualization technique provides color visualization and is faster than any other presented in literature. The experiments here shown refer to the implementation of this proposal by means of the Java programming language, and to its execution into a smartphone. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of a proxy system for providing immersive audio communication to massively multi-player games

    Publication Year: 2004 , Page(s): 192 - 199
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (666 KB) |  | HTML iconHTML  

    In this paper, a distributed proxy architecture is introduced for the provisioning of an immersive audio communication service to massively multi-player online games. The immersive audio communication service enables each avatar to hear a realistic audio mix of conversations in its hearing range. In our earlier work, peer-to-peer and central server architectures have been proposed for this service. In this paper, a distributed proxy architecture with either using network multicast or unicast between proxies is introduced to address the limitations of the previous architectures. The main focus of this paper is to evaluate the bandwidth cost saving of network multicast in the distributed proxy architecture in different avatar grouping behaviours and distribution of game player scenarios. In addition, the effect of varying the number of proxy servers on communication delays and network bandwidth usages are investigated. We have developed a simulation environment that creates both the physical world (geographic distribution of participants and the Internet topology model) and the virtual world (distribution of avatars based on different avatar aggregation behaviors). Based on the simulation study, we provide recommendations on a cost-effective delivery architecture for this service. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multimedia broker for ubiquitous and accessible rich media content transcoding

    Publication Year: 2004 , Page(s): 186 - 191
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (722 KB) |  | HTML iconHTML  

    Entertainment multimedia applications based on synchronized continuous media are largely used on standard platforms and are becoming ubiquitous. To integrate rich and interactive multimedia in context aware applications, contents have to be produced and integrated by using mechanisms that choose and provide the richest version that meets user and device capabilities. In this context, we discuss on the design and implementation of an Internet application designed to support the development of multimedia applications for non standard devices by providing a media-brokering service. The media broker uses a SMIL-based description of the rich media and a CC/PP profile to adaptively compute the best version of the media content that can be delivered to a specific user and device. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dual-channel MAC protocol for mobile ad hoc networks

    Publication Year: 2004 , Page(s): 27 - 32
    Cited by:  Papers (15)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (514 KB) |  | HTML iconHTML  

    Recent studies have shown that the widely used IEEE 802.11 MAC is considerably inefficient in multihop networks. The inefficiency is due to the hidden terminal problem, the exposed terminal problem, the receiver blocking problem, and the ultra-flow contention problem. These four problems can lead to "explosion" of control packets and hence poor throughput performance. To address these problems, we propose a novel MAC protocol based upon the IEEE 802.11 MAC. The unique features of the proposed MAC protocol are 1) a system architecture with an out-of-band busy tone and two communication channels, one for control frames and the other for data frames, and 2) a message exchange procedure that provides a comprehensive solution to all the aforementioned four problems. Our studies show that the proposed scheme can simultaneously overcome the four problems, greatly improve spatial reuse, and eliminate the collisions of DATA packets. In addition, the simulation results demonstrate that the new scheme provides a more stable link layer with less control overheads and much less routing failures and significantly improves the throughput, as compared to the IEEE 802.11 MAC. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Peer-to-peer architecture and protocol for a massively multiplayer online game

    Publication Year: 2004 , Page(s): 519 - 528
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (851 KB) |  | HTML iconHTML  

    Massively multiplayer online games (MMOGs) are becoming a very important part of computer entertainment business. With recent development of broadband technologies, the increase of the number of players is putting a strong pressure on this type of applications. Commonly used clients/server systems do not cope well with scalability, limiting the number of players who interact with each other, are not robust enough and might be subject to bottleneck due to their centralized infrastructure. These systems also force the developers to invest enormous amount of money on hardware and time to design complex software systems. To solve these problems we propose a fully distributed, peer-to-peer architecture for MMOGs. In this paper we discuss the issues surrounding MMOGs, the limitations in term of network infrastructure, and the lack of simulation environment to study and evaluate network architecture and protocol. We use a peer-to-peer (P2P) based architecture and protocol to provide a more scalable, flexible and robust technology solution than currently used infrastructures. We have conducted the design and implementation of a modular MMOG: 'time-prisoners', using a P2P protocol developed in Java and JXTA. The characteristics of P2P overlays enable to organize dynamically, and in transparent way for the users, the group of players according to their locations in the virtual world, and allow to design scalable mechanism to distribute the game state to the players and to maintain the world consistent in case of node failures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling for the downlink in a CDMA network with imperfect channel estimation

    Publication Year: 2004 , Page(s): 469 - 476
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (632 KB) |  | HTML iconHTML  

    In this paper, the problem of scheduling for a single user on the downlink of a WCDMA network is addressed. Expressions are derived for the optimal effective bit rates when adaptive modulation and coding (AMC) and multicode transmission are employed. Traffic load aware scheduling is also studied. Since the selection of the modulation and coding scheme (MCS) and the number of multicodes requires an estimation of the downlink SIR, it is important to assess the performance degradation due to estimation errors. It is shown that the effective bit rate is quite sensitive to SIR estimation errors. The sensitivity can be reduced by using a conservative estimate of the SIR. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A GMPLS-controlled optical testbed for distributed storage services

    Publication Year: 2004 , Page(s): 363 - 368
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (674 KB) |  | HTML iconHTML  

    As services and applications become more integrated with the underlying network, it is desirable to increase the degree of coupling between end-to-end services and the provisioning, monitoring and recovery mechanisms of optical communications channels. In this paper, we describe an experimental demonstration of GMPLS control of an optical network for wide-area distributed storage services. The dynamic nature of GMPLS control enable scheduled backup of distributed storage over high-speed optical lightpaths provisioned on demand. Inter-working issues between application layer and transport layer are discussed, highlighting key design and implementation choices for connectivity discovery, signaling, optical hardware control and service resilience. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • itmBench: generalized API for Internet traffic managers

    Publication Year: 2004 , Page(s): 306 - 311
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (523 KB) |  | HTML iconHTML  

    Internet traffic managers (ITMs) are special machines placed at strategic places in the Internet. itmBench is an interface that allows users (e.g. network managers, service providers, or experimental researchers) to register different traffic control functionalities to run on one ITM or an overlay of ITMs. Thus itmBench offers a tool that is extensible and powerful yet easy to maintain. ITM traffic control applications could be developed either using a kernel API so they run in kernel space, or using a user-space API so they run in user space. We demonstrate the flexibility of itmBench by showing the implementation of a kernel module that provides a differentiated network service. Due to space limitations, we refer the reader to Gali Diamant et al. (December 16, 2003) for a user-space module that provides an overlay routing service. Our itmBench Linux-based prototype is free software and can be obtained from http: //www.cs.bu.edu/groups/itm/. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal online strategy to increment connection trees

    Publication Year: 2004 , Page(s): 484 - 490
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (534 KB) |  | HTML iconHTML  

    Constructing a tree spanning a given subset of vertices of a graph is a generic problem that has been extensively studied (for example the classical Steiner tree is one of them). In this paper, we propose to take into account a problem that has not been often studied: the dynamic part, in which new vertices must be inserted in a given tree. We propose to do these insertions with respect of structural constraints that we describe and to capture the efficiency of algorithms by a particular type of competitive ratios. The parameter to optimize in our study is related to distances between the connected vertices. Our main results are the following. We propose a method, called median-addition. We prove that its competitive ratio is non constant but optimal. This result is proved under the hypothesis that the algorithm does not know the sequence of added vertices (called unknown-future or online model). This method can be used to design communication structures for applications like video-conference in networks for example. In another part of the paper, we prove the surprising following result: even if the algorithm knows the sequence of additions of new vertices (hence everything is known in advance), no algorithm can have a constant competitive ratio. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A priority-based QoS routing protocol with zone reservation and adaptive call blocking for mobile ad hoc networks with directional antenna

    Publication Year: 2004 , Page(s): 50 - 55
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (675 KB) |  | HTML iconHTML  

    Existing priority-based QoS routing protocols in ad hoc wireless networks did not consider the effect of mutual interference between routes in wireless medium during routing. We have investigated the effect of mutual interference on the routing performance in wireless environment and explored the advantage of using zone-disjoint routes to avoid mutual interference and to improve the network performance. In this paper, a priority based QoS routing scheme is proposed that uses the notion of zone-disjoint routes. Our protocol avoids the contention between high and low priority routes by reserving high priority zone of communication. Low priority flows tries to avoid this zone by selecting the routes that is maximally zone-disjoint with respect to the high priority reserved zone and consequently allows a contention-free transmission of high priority traffic in that reserved zone. If, under some unavoidable situations, a low priority flow has to go through high priority reserved zone causing interference, then it blocks itself temporarily to allow contention-free transmission of high priority flows and later may resume the blocked communication if possible. We have evaluated the effectiveness of our proposed protocol on QualNet network simulator. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DWDM-RAM: an architecture for data intensive services enabled by next generation dynamic optical networks

    Publication Year: 2004 , Page(s): 400 - 409
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (687 KB) |  | HTML iconHTML  

    An architecture is proposed for data-intensive services enabled by next generation dynamic optical networks. The architecture supports new data communication services that allow for coordinating extremely large sets of distributed data. The architecture allows for novel features including algorithms for optimizing and scheduling data transfers, methods for allocating and scheduling network resources, and an intelligent middleware platform that is capable of interfacing application level services to the underlying optical technologies. The significance of the architecture is twofold: 1) it encapsulates "optical network resources" into a service framework to support dynamically provisioned and advance scheduled data-intensive transport services, and 2) it establishes a generalized enabling framework for intelligent services and applications over next generation networks, not necessarily optical end-to-end. DWDM-RAM is an implementation version of the architecture, which is conceptual as well as experimental. This architecture has been implemented in prototype on OMNInet, which is an advanced experimental metro area optical testbed that is based on novel architecture, protocols, control plane services (optical dynamic intelligent network-ODIN), and advanced photonic components. This paper presents the concepts behind the DWDM-RAM architecture and its design. The paper also describes an application scenario using the architecture's data transfer service and network resource services over the agile OMNInet testbed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving H.264 real-time streaming in MANETs through adaptive multipath routing techniques

    Publication Year: 2004 , Page(s): 433 - 441
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (562 KB) |  | HTML iconHTML  

    One of the main problems associated with MANETs is that mobility and the associated route discovery and maintenance procedures of reactive routing protocols cause interruptions on real-time video streams. Some of these interruptions are too large to be concealed using any sort of video technology, resulting in communications breaks unpleasant for the final end user. We present a solution for enhanced video transmission that increases route stability by using an improved route discovery process based on the DSR routing protocol, along with traffic splitting algorithms and a preventive route discovery mechanism. We also present a tuning methodology for an H.264 video codec in order to obtain optimal interaction with the underlying mechanisms proposed. Combining our proposals, we achieve up to 97% less interruptions on communication with high mobility, and over 1.2 dB of improvements in terms of video distortion. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A grid oriented lightpath provisioning system

    Publication Year: 2004 , Page(s): 395 - 399
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (578 KB) |  | HTML iconHTML  

    Multi-domain resource sharing is the fundamental feature of computing and data grid applications. In this paper, we address the issue of multi-domain optical network resource sharing and present a network management system designed for end-to-end lightpath provisioning across multiple independently managed domains. Our network management system, called user-controlled lightpath provisioning (UCLP) system, is based on the grid services concept and built on the Jini and JavaSpaces technologies. The UCLP system provides a traffic engineering approach to control network infrastructure for computing and data grid applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GhostShare - reliable and anonymous P2P video distribution

    Publication Year: 2004 , Page(s): 200 - 210
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (887 KB) |  | HTML iconHTML  

    P2P networks have emerged as a powerful multimedia content distribution mechanism. However, the widespread deployment of P2P networks are hindered by several issues, especially ones that influence end-user satisfaction, including privacy protection. In this paper, we propose GhostShare, a P2P network built on the pastry substrate, to distribute video content. The primary design goals of GhostShare are anonymity and load balancing for participating peers. We present simulation results that prove the effectiveness of GhostShare's load balancing mechanism and provide an analysis of the anonymity scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Admission control in IEEE 802.11 networks

    Publication Year: 2004 , Page(s): 258 - 265
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (532 KB) |  | HTML iconHTML  

    The IEEE 802.11e standard is intended to support the applications with QoS requirements. Such support is achieved by using differentiated categories for medium access. When the number of active stations is high, collision rate increases, affecting goodput and delay. In this paper, the effectiveness of two mechanisms for measurement-based admission control in 802.11e networks are evaluated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.