By Topic

Communications Letters, IEEE

Issue 10 • Date Oct. 2003

Filter Results

Displaying Results 1 - 15 of 15
  • On the channel spacing of multichannel ALOHA

    Publication Year: 2003 , Page(s): 469 - 471
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (297 KB) |  | HTML iconHTML  

    We investigate the performance of a multichannel radio access network with spectrally overlapped channels. Taking into account the adjacent channel interference, we derive a new expression for the throughput of the multichannel ALOHA with capture in the Rayleigh fading environment. Relative to the throughput of orthogonal multichannel ALOHA, numerical results show that a significant improvement is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel approach to source routing for multi-hop ad hoc networks

    Publication Year: 2003 , Page(s): 472 - 474
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (213 KB) |  | HTML iconHTML  

    The popularity of wireless ad hoc networks has significantly increased over the past years. As a result, a great scientific effort has been made to develop and implement efficient routing protocols, able to cope with the stochastically varying topology of such networks. We present an efficient routing protocol that combines source routing, caching of routes, and the use of sequence numbers to alle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collision analysis for a multi-Bluetooth picocells environment

    Publication Year: 2003 , Page(s): 475 - 477
    Cited by:  Papers (21)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (313 KB) |  | HTML iconHTML  

    Operating in the unlicensed 2.4-GHz ISM band, a Bluetooth piconet will inevitably encounter the interference problem from other piconets. With a special channel model and packet formats, one research issue is how to predict the packet collision effect in a multi-piconet environment. In an earlier work (El-Hoiydi (2001)), this problem is studied, but the result is still very limited, due to the ass... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outage and BER analysis of cellular CDMA for integrated services with correlated signal and interference

    Publication Year: 2003 , Page(s): 478 - 480
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (328 KB) |  | HTML iconHTML  

    In this letter, we evaluate the outage and "minimum duration outage" probabilities for integrated services in cellular code-division multiple-acess systems considering correlation among signal and interferers. Correlation is found to lower the outage probability. The effect of correlation and power control error on bit error rate is also studied. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact capacity distributions for MIMO systems with small numbers of antennas

    Publication Year: 2003 , Page(s): 481 - 483
    Cited by:  Papers (35)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (296 KB) |  | HTML iconHTML  

    It is well known that multiple input multiple output (MIMO) systems offer the promise of achieving very high spectrum efficiencies (many tens of bit/s/Hz) in a mobile environment. The gains in MIMO capacity are sensitive to the presence of spatial correlation introduced by the radio environment. In this letter we consider the capacity outage performance of MIMO systems in correlated environments. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nakagami-m fading modeling in the frequency domain for OFDM system analysis

    Publication Year: 2003 , Page(s): 484 - 486
    Cited by:  Papers (49)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (362 KB) |  | HTML iconHTML  

    Nakagami-m fading modeling in the frequency domain is investigated. For frequency-selective Nakagami-m fading channels, we show the magnitudes of the channel frequency responses to be also Nakagami-m distributed random variables with fading and mean power parameters as explicit functions of the fading and mean power parameters of the channel impulse responses. Based on this new model, the bit erro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combined linear pre-equalization and BLAST equalization with channel correlation feedback

    Publication Year: 2003 , Page(s): 487 - 489
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (254 KB) |  | HTML iconHTML  

    In this letter, we study linear pre-equalization in conjunction with BLAST equalization. Linear pre-equalization is based on the assumption that the channel state information available at the transmitter is limited to the second order statistics of channel and noise (long term channel state information or LT-CSI). Through simulations, we compare different design criteria for the pre-equalizer and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Small worlds in wireless networks

    Publication Year: 2003 , Page(s): 490 - 492
    Cited by:  Papers (79)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (218 KB) |  | HTML iconHTML  

    In this study, the concept of small worlds is investigated in the context of wireless networks. Wireless networks are spatial graphs that tend to be much more clustered than random networks and have much higher path length characteristics. We observe that by adding a few short cut links, path length of wireless networks is reduced drastically. More interestingly, such short cut links need not be r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A statistical framework for EDF scheduling

    Publication Year: 2003 , Page(s): 493 - 495
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (279 KB) |  | HTML iconHTML  

    Earliest deadline first (EDF) has become one of the most promising scheduling schemes for providing quality-of-service differentiation over high speed networks. In this letter, we study the deadline violation (loss) probability at an EDF scheduling switch. An analytical framework has been developed for estimating the loss probabilities for the aggregated traffic and the individual flows. This enab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum size matching is unstable for any packet switch

    Publication Year: 2003 , Page(s): 496 - 498
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (243 KB) |  | HTML iconHTML  

    Input-queued packet switches use a matching algorithm to configure a nonblocking switch fabric (e.g., a crossbar). Ideally, the matching algorithm will guarantee 100% throughput for a broad class of traffic, so long as the switch is not oversubscribed. An intuitive choice is the maximum size matching (MSM) algorithm, which maximizes the instantaneous throughput. It was shown (McKeown et al. (1999)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for solving logical topology design problems within constrained computation time

    Publication Year: 2003 , Page(s): 499 - 501
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (217 KB) |  | HTML iconHTML  

    We present a framework for solving logical topology design (LTD) problems in a constrained amount of computation time. Our framework uses a search space dimensionality (SSD) reduction technique that exploits a tradeoff between computation time and solution quality. We have demonstrated that our framework offers improved solution quality in comparison to an existing SSD reduction technique reported... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High speed IP address lookup architecture using hashing

    Publication Year: 2003 , Page(s): 502 - 504
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (427 KB) |  | HTML iconHTML  

    One of the most important design issues for IP routers responsible for datagram forwarding in computer networks is the route-lookup mechanism. In this letter, we explore a practical IP address lookup scheme which converts the longest prefix matching problem into the exact matching problem. In the proposed architecture, the forwarding table is composed of multiple SRAM, and each SRAM represents an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay-optimal service curve allocation scheme

    Publication Year: 2003 , Page(s): 505 - 507
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (300 KB) |  | HTML iconHTML  

    A service allocation scheme has been proposed in this letter, so that as many real-time sessions with deterministic delay bounds as possible can be admitted in service curve algorithms. The proposed scheme is superior to the previous scheme especially when a session passes through multiple routers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiple access collision avoidance protocol for multicast services in mobile ad hoc networks

    Publication Year: 2003 , Page(s): 508 - 510
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (387 KB) |  | HTML iconHTML  

    In order to improve cross-layer optimization, we propose a multiple access collision avoidance protocol that combines RTS/CTS with scheduling algorithms to support the multicast routing protocol. We avoid collision by including additional information in the RTS. The proposed scheme, together with extra benefits, such as power saving, reliable data transmission and higher channel utilization compar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MaxNet: a congestion control architecture for scalable networks

    Publication Year: 2003 , Page(s): 511 - 513
    Cited by:  Papers (30)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (263 KB) |  | HTML iconHTML  

    MaxNet is a distributed congestion control architecture. This paper analyzes the stability properties of MaxNet. We show that MaxNet is stable for networks with arbitrary delays, numbers of sources, capacities, and topologies. Unlike existing proposals, MaxNet does not need to estimate the number of bottleneck links on the end-to-end path to achieve these scaling properties. View full abstract»

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

Aims & Scope

IEEE Communications Letters  is aimed at satisfying the need for rapid dissemination of information, offering a vehicle for authors to expose their results to be used in future developments. This ensures early recognition of work. 

 

 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
George K. Karagiannidis
Aristotle University of Thessaloniki
Greece