By Topic

Selected Areas in Communications, IEEE Journal on

Issue 11 • Date Nov. 2006

Filter Results

Displaying Results 1 - 25 of 28
  • Table of contents

    Publication Year: 2006 , Page(s): c1 - c4
    Save to Project icon | Request Permissions | PDF file iconPDF (43 KB)  
    Freely Available from IEEE
  • IEEE Journal on Selected Areas in Communications publication information

    Publication Year: 2006 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (35 KB)  
    Freely Available from IEEE
  • Guest Editorial Multihop Wireless Mesh Networks

    Publication Year: 2006 , Page(s): 1957 - 1959
    Save to Project icon | Request Permissions | PDF file iconPDF (816 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks

    Publication Year: 2006 , Page(s): 1960 - 1971
    Cited by:  Papers (85)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (487 KB) |  | HTML iconHTML  

    Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of close-by transmissions; effective routing schemes can alleviate potential congestion on any gateways to the Internet, thereby improving per-client throughput. Unlike previous heuristic approaches, we mathematically formulate the joint channel assignment and routing problem, taking into account the interference constraints, the number of channels in the network, and the number of radios available at each mesh router. We then use this formulation to develop a solution for our problem that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients. We show that the performance of our algorithms is within a constant factor of that of any optimal algorithm for the joint channel assignment and routing problem. Our evaluation demonstrates that our algorithm can effectively exploit the increased number of channels and radios, and it performs much better than the theoretical worst case bounds View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Channel Assignment and Routing in Multiradio Multichannel Multihop Wireless Networks

    Publication Year: 2006 , Page(s): 1972 - 1983
    Cited by:  Papers (34)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1440 KB) |  | HTML iconHTML  

    In this paper, we first identify several challenges in designing a joint channel assignment and routing (JCAR) protocol in heterogeneous multiradio multichannel multihop wireless networks (M3WNs) using commercial hardware [e.g., IEEE 802.11 Network Interface Card (NIC)]. We then propose a novel software solution, called Layer 2.5 JCAR, which resides between the MAC layer and routing layer. JCAR jointly coordinates the channel selection on each wireless interface and the route selection among interfaces based on the traffic information measured and exchanged among the two-hop neighbors. Since interference is one of the major factors that constrain the performance in a M3 WN, in this paper, we introduce an important channel cost metric (CCM) which actually reflects the interference cost and is defined as the sum of expected transmission time weighted by the channel utilization over all interfering channels (for each node). In CCM, both the interference and the diverse channel characteristics are taken into account. An expression for CCM is derived in terms of equivalent fraction of air time by explicitly taking the radio heterogeneity into consideration. Using CCM as one of the key performance measures, we propose a distributed algorithm (heuristic) that produces near-optimal JCAR solution. To evaluate the efficacy of our heuristics, we conduct extensive simulations using the network simulator NS2. To demonstrate implementation feasibility, we conducted various experiments for the proposed distributed JCAR algorithm on a multihop wireless network testbed with nine wireless nodes, each is equipped with single/multiple 802.11a/g cards. Both experimental and simulation results demonstrate the effectiveness and implementation easiness of our proposed software solution View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quality-Aware Routing Metrics for Time-Varying Wireless Mesh Networks

    Publication Year: 2006 , Page(s): 1984 - 1994
    Cited by:  Papers (46)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (936 KB) |  | HTML iconHTML  

    This paper considers the problem of selecting good paths in a wireless mesh network. It is well-known that picking the path with the smallest number of hops between two nodes often leads to poor performance, because such paths tend to use links that could have marginal quality. As a result, quality-aware routing metrics are desired for networks that are built solely from wireless radios. Previous work has developed metrics (such as ETX) that work well when wireless channel conditions are relatively static (DeCouto , 2003), but typical wireless channels experience variations at many time-scales. For example, channels may have low average packet loss ratios, but with high variability, implying that metrics that use the mean loss ratio will perform poorly. In this paper, we describe two new metrics, called modified expected number of transmissions (mETX) and effective number of transmissions (ENT) that work well under a wide variety of channel conditions. In addition to analyzing and evaluating the performance of these metrics, we provide a unified geometric interpretation for wireless quality-aware routing metrics. Empirical observations of a real-world wireless mesh network suggest that mETX and ENT could achieve a 50% reduction in the average packet loss rate compared with ETX View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DCMA: A Label Switching MAC for Efficient Packet Forwarding in Multihop Wireless Networks

    Publication Year: 2006 , Page(s): 1995 - 2004
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1062 KB) |  | HTML iconHTML  

    This paper addresses the problem of efficient packet forwarding in a multihop, wireless "mesh" network. We present an efficient interface contained forwarding (ICF) architecture for a "wireless router," i.e., a forwarding node with a single wireless network interface card (NIC) in a multihop wireless network that allows a packet to be forwarded entirely within the NIC of the forwarding node without requiring per-packet intervention by the node's CPU. To effectively forward packets in a pipelined fashion without incurring the 802.11-related overheads of multiple independent channel accesses, we specify a slightly modified version of the 802.11 MAC, called data driven cut-through multiple access (DCMA) that uses multiprotocol label switching (MPLS)-like labels in the control packets, in conjunction with a combined ACK/RTS packet, to reduce 802.11 channel access latencies. Our proposed technique can be used in combination with "frame bursting" as specified by the IEEE 802.11e standard to provide an end-to-end cut-through channel access. Using extensive simulations, we compare the performance of DCMA with 802.11 DCF MAC with respect to throughput and latency and suggest a suitable operating region to get maximum benefits using our mechanism as compared to 802.11 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient IEEE 802.11 ESS Mesh Network Supporting Quality-of-Service

    Publication Year: 2006 , Page(s): 2005 - 2017
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1178 KB) |  | HTML iconHTML  

    IEEE 802.11 infrastructure basic service set (BSS) wireless local area networks (WLANs) are widely used, each comprising an access point (AP) and its associated stations. There is a need to interconnect BSSs wirelessly to create an extended service set (ESS) mesh network. We propose a solution for the architecture and protocols of a mesh distributed coordination function (MDCF) to interconnect a large number of APs in order to form an efficient ESS mesh network under distributed control. MDCF applies time-division multiple access to share the radio medium and is able to run on a single frequency channel on top of the IEEE 802.11a/b/g physical layers, concurrently to legacy stations. MDCF is capable to efficiently exploit channel capacity, fairly distribute bandwidth among the mesh points and support multihop relaying of a large number of concurrent traffic flows strictly observing specific quality-of-service requirements. Example simulation results proof the outstanding performance of the new concept proposed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Distributed End-to-End Reservation Protocol for IEEE 802.11-Based Wireless Mesh Networks

    Publication Year: 2006 , Page(s): 2018 - 2027
    Cited by:  Papers (22)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (733 KB) |  | HTML iconHTML  

    This paper presents an end-to-end reservation protocol for quality-of-service (QoS) support in the medium access control layer of wireless multihop mesh networks. It reserves periodically repeating time slots for QoS-demanding applications, while retaining the distributed coordination function (DCF) for best effort applications. The key features of the new protocol, called "distributed end-to-end allocation of time slots for real-time traffic (DARE), are distributed setup, interference protection, and scheduling of real-time data packets, as well as the repair of broken reservations and the release of unused reservations. A simulation-based performance study compares the delay and throughput of DARE with those of DCF and the priority-based enhanced distributed channel access (EDCA) used in IEEE 802.11e. In contrast to DCF and EDCA, DARE has a low, nonvarying delay and a constant throughput for each reserved flow View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DMesh: Incorporating Practical Directional Antennas in Multichannel Wireless Mesh Networks

    Publication Year: 2006 , Page(s): 2028 - 2039
    Cited by:  Papers (29)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (721 KB) |  | HTML iconHTML  

    Wireless mesh networks (WMNs) have been proposed as an effective solution for ubiquitous last-mile broadband access. Three key factors that affect the usability of WMNs are high throughput, cost-effectiveness, and ease of deployability. In this paper, we propose DMesh, a WMN architecture that combines spatial separation from directional antennas with frequency separation from orthogonal channels to improve the throughput of WMNs. DMesh achieves this improvement without inhibiting cost-effectiveness and ease of deployability by utilizing practical directional antennas that are widely and cheaply available (e.g., patch and yagi) in contrast to costly and bulky smart beamforming directional antennas. Thus, the key challenge in DMesh is to exploit spatial separation from such practical directional antennas despite their lack of electronic steerability and interference nulling, as well as the presence of significant sidelobes and backlobes. In this paper, we study how such practical directional antennas can improve the throughput of a WMN. Central to our architecture is a distributed, directional channel assignment algorithm for mesh routers that effectively exploits the spatial and frequency separation opportunities in a DMesh network. Simulation results show that DMesh improves the throughput of WMNs by up to 231% and reduces packet delay drastically compared to a multiradio multichannel omni antenna network. A DMesh implementation in our 16-node 802.11b WMN testbed using commercially available practical directional antennas provides transmission control protocol throughput gains ranging from 31% to 57% View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Turbo Coding With Soft Information Relaying in Multihop Relay Networks

    Publication Year: 2006 , Page(s): 2040 - 2050
    Cited by:  Papers (82)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (688 KB) |  | HTML iconHTML  

    It has been shown that distributed turbo coding (DTC) can approach the capacity of a wireless relay network. In the existing DTC schemes, it is usually assumed that error-free decoding is performed at a relay. We refer to this type of DTC schemes as perfect DTC. In this paper, we propose a novel DTC scheme. For the proposed scheme, instead of making a decision on the transmitted information symbols at the relay as in perfect DTC, we calculate and forward the corresponding soft information. We derive parity symbol soft estimates for the interleaved source information when only the a posteriori probabilities of the information symbols are known. The results show that the proposed scheme can effectively mitigate error propagation due to erroneous decoding at the relay. Simulation results also confirm that the proposed scheme approaches the outage probability bound of a distributed two-hop relay network at high signal-to-noise ratios View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair Allocation of Subcarrier and Power in an OFDMA Wireless Mesh Network

    Publication Year: 2006 , Page(s): 2051 - 2060
    Cited by:  Papers (45)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1230 KB) |  | HTML iconHTML  

    This paper presents a new fair scheduling scheme for orthogonal frequency-division multiple-access-based wireless mesh networks (WMNs), which fairly allocates subcarriers and power to mesh routers (MRs) and mesh clients to maximize the Nash bargaining solution fairness criterion. In WMNs, since not all the information necessary for scheduling is available at a central scheduler (e.g., MR), it is advantageous to involve the MR and as many mesh clients as possible in distributed scheduling based on the limited information that is available locally at each node. Instead of solving a single global control problem, we hierarchically decouple the subcarrier and power allocation problem into two subproblems, where the MR allocates groups of subcarriers to the mesh clients, and each mesh client allocates transmit power among its subcarriers to each of its outgoing links. We formulate the two subproblems by nonlinear integer programming and nonlinear mixed integer programming, respectively. A simple and efficient solution algorithm is developed for the MR's problem. Also, a closed-form solution is obtained by transforming the mesh client's problem into a time-division scheduling problem. Extensive simulation results demonstrate that the proposed scheme provides fair opportunities to the respective users (mesh clients) and a comparable overall end-to-end rate when the number of mesh clients increases View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource Allocation for OFDMA Relay Networks With Fairness Constraints

    Publication Year: 2006 , Page(s): 2061 - 2069
    Cited by:  Papers (106)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (448 KB) |  | HTML iconHTML  

    This paper studies the resource allocation for orthogonal frequency-division multiple-access relay network with multiple source nodes, multiple relay nodes, and a single destination node. The optimal source/relay/subcarrier allocation problem with fairness constraint on relay nodes is formulated as a binary integer programming problem. The problem is then tackled using a graph theoretical approach by transforming it into a linear optimal distribution problem in a directed graph. Upper bound of the solution is discussed and simulation results are studied to evaluate the algorithm performance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity and QoS for a Scalable Ring-Based Wireless Mesh Network

    Publication Year: 2006 , Page(s): 2070 - 2080
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1010 KB) |  | HTML iconHTML  

    The wireless mesh network (WMN) is an economical solution to support ubiquitous broadband services. This paper investigates the tradeoffs among quality-of-service (QoS), capacity, and coverage in a scalable multichannel ring-based WMN. We suggest a simple frequency planning in the proposed ring-based WMN to improve the capacity with QoS support, and to make the system more scalable in terms of coverage. We develop a physical (PHY)/medium access control (MAC) cross-layer analytical model to evaluate the delay, jitter, and throughput of the proposed WMN, by taking account of the carrier sense multiple-access (CSMA) MAC protocol, and the impact of hop distance on transmission rate in the physical layer. Furthermore, the mixed-integer nonlinear programming optimization approach is applied to determine the optimal number of rings and the associated ring widths, aiming at maximizing the capacity and coverage of a mesh cell subject to the delay requirement View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-Latency Broadcast in Multirate Wireless Mesh Networks

    Publication Year: 2006 , Page(s): 2081 - 2091
    Cited by:  Papers (24)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (597 KB) |  | HTML iconHTML  

    In a multirate wireless network, a node can dynamically adjust its link transmission rate by switching between different modulation schemes. In the current IEEE802.11a/b/g standards, this rate adjustment is defined for unicast traffic only. In this paper, we consider a wireless mesh network (WMN), where a node can dynamically adjust its link-layer multicast rates to its neighbors, and address the problem of realizing low-latency network-wide broadcast in such a mesh. We first show that the multirate broadcast problem is significantly different from the single-rate case. We will then present an algorithm for achieving low-latency broadcast in a multirate mesh which exploits both the wireless multicast advantage and the multirate nature of the network. Simulations based on current IEEE802.11 parameters show that multirate multicast can reduce broadcast latency by 3-5 times compared with using the lowest rate alone. In addition, we show the significance of the product of transmission rate and transmission coverage area in designing multirate WMNs for broadcast View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks

    Publication Year: 2006 , Page(s): 2092 - 2103
    Cited by:  Papers (51)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (643 KB) |  | HTML iconHTML  

    The optimal and distributed provisioning of high throughput in mesh networks is known as a fundamental but hard problem. The situation is exacerbated in a wireless setting due to the interference among local wireless transmissions. In this paper, we propose a cross-layer optimization framework for throughput maximization in wireless mesh networks, in which the data routing problem and the wireless medium contention problem are jointly optimized for multihop multicast. We show that the throughput maximization problem can be decomposed into two subproblems: a data routing subproblem at the network layer, and a power control subproblem at the physical layer with a set of Lagrangian dual variables coordinating interlayer coupling. Various effective solutions are discussed for each subproblem. We emphasize the network coding technique for multicast routing and a game theoretic method for interference management, for which efficient and distributed solutions are derived and illustrated. Finally, we show that the proposed framework can be extended to take into account physical-layer wireless multicast in mesh networks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-Layer Optimized Video Streaming Over Wireless Multihop Mesh Networks

    Publication Year: 2006 , Page(s): 2104 - 2115
    Cited by:  Papers (25)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (848 KB) |  | HTML iconHTML  

    The proliferation of wireless multihop communication infrastructures in office or residential environments depends on their ability to support a variety of emerging applications requiring real-time video transmission between stations located across the network. We propose an integrated cross-layer optimization algorithm aimed at maximizing the decoded video quality of delay-constrained streaming in a multihop wireless mesh network that supports quality-of-service. The key principle of our algorithm lays in the synergistic optimization of different control parameters at each node of the multihop network, across the protocol layers-application, network, medium access control, and physical layers, as well as end-to-end, across the various nodes. To drive this optimization, we assume an overlay network infrastructure, which is able to convey information on the conditions of each link. Various scenarios that perform the integrated optimization using different levels ("horizons") of information about the network status are examined. The differences between several optimization scenarios in terms of decoded video quality and required streaming complexity are quantified. Our results demonstrate the merits and the need for cross-layer optimization in order to provide an efficient solution for real-time video transmission using existing protocols and infrastructures. In addition, they provide important insights for future protocol and system design targeted at enhanced video streaming support across wireless mesh networks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Backbone Topology Synthesis for Multiradio Mesh Networks

    Publication Year: 2006 , Page(s): 2116 - 2126
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1210 KB) |  | HTML iconHTML  

    Wireless local area network (WLAN) systems are widely implemented today to provide hot-spot coverage. Operated typically in an infrastructure mode, each WLAN is managed by an access point (AP). Wireless mesh networks (WMNs) are employed for the purpose of extending the wireless coverage scope by interconnecting the underlying AP nodes. The capability and performance behavior of the WMN can further be upgraded by using multiple communications channels and by having more capable nodes use multiple radio modules. In this paper, we present a fully distributed multiradio backbone synthesis algorithm, which serves to construct a mesh backbone network of APs. We assume more capable nodes, such as APs, to be equipped with two radio modules, while less capable nodes employ a single radio module. Multihop communications among distant client stations take place in accordance with a routing algorithm that uses the mesh backbone to establish inter-WLAN routes. The presented backbone construction algorithm and the associated on-demand backbone-based routing mechanism are shown to improve the system's delay-throughput performance, as well as its asynchronous and distributed behavior in a stable fashion View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints

    Publication Year: 2006 , Page(s): 2127 - 2136
    Cited by:  Papers (49)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (650 KB) |  | HTML iconHTML  

    In a wireless mesh network (WMN), the traffic is aggregated and forwarded towards the gateways. Strategically placing and connecting the gateways to the wired backbone is critical to the management and efficient operation of a WMN. In this paper, we address the problem of gateways placement, consisting in placing a minimum number of gateways such that quality-of-service (QoS) requirements are satisfied. We propose a polynomial time near-optimal algorithm which recursively computes minimum weighted Dominating Sets (DS), while consistently preserving QoS requirements across iterations. We evaluate the performance of our algorithm using both analysis and simulation, and show that it outperforms other alternative schemes by comparing the number of gateways placed in different scenarios View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations

    Publication Year: 2006 , Page(s): 2137 - 2146
    Cited by:  Papers (35)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (860 KB) |  | HTML iconHTML  

    Recently, the notion that a logical next step towards future mobile radio networks is to introduce multihop relaying into cellular networks, has gained wide acceptance. Nevertheless, due to the inherent drawbacks of multihop relaying, e.g., the requirement for extra radio resources for relaying hops, and the sensitivity to the quality of relaying routes, multihop cellular networks (MCNs) require a well-designed radio resource allocation strategy in order to secure performance gains. In this paper, the optimal radio resource allocation problem in MCNs, with the objective of throughput maximization, is formulated mathematically and proven to be NP-hard. Considering the prohibitive complexity of finding the optimal solution for such an NP-hard problem, we propose an efficient heuristic algorithm, named integrated radio resource allocation (IRRA), to find suboptimal solutions. The IRRA is featured as a low-complexity algorithm that involves not only base station (BS) resource scheduling, but also routing and relay station (RS) load balancing. Specifically, a load-based scheme is developed for routing. A mode-aware BS resource-scheduling scheme is proposed for handling links in different transmission modes, i.e., direct or multihop. Moreover, a priority-based RS load balancing approach is presented for the prevention of the overloading of RSs. Within the framework of the IRRA, the above three functions operate periodically with coordinated interactions. To prove the effectiveness of the proposed IRRA algorithm, a case study was carried out based on enhanced uplink UMTS terrestrial radio access/frequency-division duplex with fixed RSs. The IRRA is evaluated through system level simulations, and compared with two other cases: 1) nonrelaying and 2) relaying with a benchmark approach. The results show that the proposed algorithm can ensure significant gains in terms of cell throughput View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Optimizations for Deploying VoIP Services in Mesh Networks

    Publication Year: 2006 , Page(s): 2147 - 2158
    Cited by:  Papers (39)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1917 KB) |  | HTML iconHTML  

    In the recent past, there has been a tremendous increase in the popularity of VoIP services as a result of huge growth in broadband access. The same voice-over-Internet protocol (VoIP) service poses new challenges when deployed over a wireless mesh network, while enabling users to make voice calls using WiFi phones. Packet losses and delay due to interference in a multiple-hop mesh network with limited capacity can significantly degrade the end-to-end VoIP call quality. In this work, we discuss the basic requirements for efficient deployment of VoIP services over a mesh network. We present and evaluate practical optimizing techniques that can enhance the network capacity, maintain the VoIP quality and handle user mobility efficiently. Extensive experiments conducted on a real testbed and ns-2 provide insights into the performance issues and demonstrate the level of improvement that can be obtained by the proposed techniques. Specifically, we find that packet aggregation along with header compression can increase the number of supported VoIP calls in a multihop network by 2-3 times. The proposed fast path switching is highly effective in maintaining the VoIP quality. Our fast handoff scheme achieves almost negligible disruption during calls to roaming clients View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for papers on vehicular networks

    Publication Year: 2006 , Page(s): 2159
    Save to Project icon | Request Permissions | PDF file iconPDF (136 KB)  
    Freely Available from IEEE
  • Call for papers on advances in peer-to-peer streaming systems

    Publication Year: 2006 , Page(s): 2160
    Save to Project icon | Request Permissions | PDF file iconPDF (161 KB)  
    Freely Available from IEEE
  • Call for papers on cognitive radio: Theory and applications

    Publication Year: 2006 , Page(s): 2161
    Save to Project icon | Request Permissions | PDF file iconPDF (145 KB)  
    Freely Available from IEEE
  • Call for papers on control and communications

    Publication Year: 2006 , Page(s): 2162
    Save to Project icon | Request Permissions | PDF file iconPDF (129 KB)  
    Freely Available from IEEE

Aims & Scope

IEEE Journal on Selected Areas in Communications focuses on all telecommunications, including telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Muriel Médard
MIT