By Topic

Journal of Communications and Networks

Issue 5 • Oct. 2010

Filter Results

Displaying Results 1 - 22 of 22
  • [Front cover]

    Publication Year: 2010, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (367 KB)
    Freely Available from IEEE
  • [Front inside cover]

    Publication Year: 2010, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (297 KB)
    Freely Available from IEEE
  • Euclidian distance minimization of probability density functions for blind equalization

    Publication Year: 2010, Page(s):399 - 405
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1644 KB) | HTML iconHTML

    Blind equalization techniques have been used in broadcast and multipoint communications. In this paper, two criteria of minimizing Euclidian distance between two probability density functions (PDFs) for adaptive blind equalizers are presented. For PDF calculation, Parzen window estimator is used. One criterion is to use a set of randomly generated desired symbols at the receiver so that PDF of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of non-binary quasi-cyclic LDPC codes based on multiplicative groups and Euclidean geometries

    Publication Year: 2010, Page(s):406 - 410
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (710 KB) | HTML iconHTML

    This paper presents an approach to the construction of non-binary quasi-cyclic (QC) low-density parity-check (LDPC) codes based on multiplicative groups over one Galois field GF(q) and Euclidean geometries over another Galois field GF(2s). Codes of this class are shown to be regular with girth 6 ≤ g ≤ 18 and have low densities. Finally, simulation results show that the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure broadcasting using multiple antennas

    Publication Year: 2010, Page(s):411 - 432
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB) | HTML iconHTML

    We consider three different secure broadcasting scenarios: i) Broadcast channels with common and confidential messages (BCC), ii) multi-receiver wiretap channels with public and confidential messages, and iii) compound wiretap channels. The BCC is a broadcast channel with two users, where in addition to the common message sent to both users, a private message, which needs to be kept hidden as much... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of decode-and-forward relaying with partial relay selection for multihop transmission over Rayleigh fading channels

    Publication Year: 2010, Page(s):433 - 441
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1524 KB) | HTML iconHTML

    Multihop transmission is a promising technique that helps in achieving broader coverage (excellent network connectivity) and preventing the impairment of wireless channels. This paper proposes a cluster-based multihop wireless network that makes use of the advantages of multihop relaying, i.e., path loss gain, and partial relay selection in each hop, i.e., spatial diversity. In this partial relay ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A full rate dual relay cooperative approach for wireless systems

    Publication Year: 2010, Page(s):442 - 448
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB) | HTML iconHTML

    Cooperative relaying methods have attracted a lot of interest in the past few years. A conventional cooperative relaying scheme has a source, a destination, and a single relay. This cooperative scheme can support one symbol transmission per time slot, and is called full rate transmission. However, existing full rate cooperative relay approaches provide asymmetrical gain for different transmitted s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed uplink resource allocation in multi-cell wireless data networks

    Publication Year: 2010, Page(s):449 - 458
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1059 KB) | HTML iconHTML

    In this paper, we present a distributed resource allocation algorithm for multi-cell uplink systems that increases the weighted sum of the average data rates over the entire network under the average transmit power constraint of each mobile station. For the distributed operation, we arrange each base station (BS) to allocate the resource such that its own utility gets maximized in a non-cooperativ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximization of zero-error probability for adaptive channel equalization

    Publication Year: 2010, Page(s):459 - 465
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1395 KB) | HTML iconHTML

    A new blind equalization algorithm that is based on maximizing the probability that the constant modulus errors concentrate near zero is proposed. The cost function of the proposed algorithm is to maximize the probability that the equalizer output power is equal to the constant modulus of the transmitted symbols. Two blind information-theoretic learning (ITL) algorithms based on constant modulus e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving maximum system throughput with cooperative relaying: A case study of IEEE 802.16j multi-hop relay

    Publication Year: 2010, Page(s):466 - 474
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2026 KB) | HTML iconHTML

    Various types of cooperative relaying (CR) schemes exhibit different levels of throughput and outage performance because of their inherent trade-off between diversity gain and opportunity cost; in other words, the overhead that is associated with cooperation. This article attempts to answer whether cooperative communication is beneficial or not from the system-level viewpoint and furthermore, if i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clipping value estimate for iterative tree search detection

    Publication Year: 2010, Page(s):475 - 479
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (925 KB) | HTML iconHTML

    The clipping value, defined as the log-likelihood ratio (LLR) in the case wherein all the list of candidates have the same binary value, is investigated, and an effective method to estimate it is presented for iterative tree search detection. The basic principle behind the method is that the clipping value of a channel bit is equal to the LLR of the maximum probability of correct decision of the b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Idle mode for deep power save in IEEE 802.11 WLANs

    Publication Year: 2010, Page(s):480 - 491
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1802 KB) | HTML iconHTML

    Along with the wide acceptance of IEEE 802.11 wireless local area network (WLAN), new applications such as Internet protocol (IP) telephony over WLAN are fast emerging today. For battery-powered IP phone devices, the life time extension is a key concern for the market acceptance while today's 802.11 is not optimized for such an operation. In this paper, we propose a novel idle mode operation, whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed space-time coded non-orthogonal DF protocols with source antenna switching

    Publication Year: 2010, Page(s):492 - 498
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1668 KB) | HTML iconHTML

    In this paper, a new distributed space-time coded (DS-TCed) non-orthogonal decode-and-forward (NDF) protocol with source antenna switching (SAS) is proposed, where two antennas associated with each radio frequency chain can be alternatively used in the first and second phases. Several DSTC schemes for the NDF with SAS (NDF-SAS) protocol are proposed and their average pairwise error probability for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP-GT: A new approach to congestion control based on goodput and throughput

    Publication Year: 2010, Page(s):499 - 509
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3060 KB) | HTML iconHTML

    A plethora of transmission control protocol (TCP) congestion control algorithms have been devoted to achieving the ultimate goal of high link utilization and fair bandwidth sharing in high bandwidth-delay product (HBDP) networks. We present a new insight into the TCP congestion control problem; in particular an end-to-end delay-based approach for an HBDP network. Our main focus is to design an end... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive energy-efficient and low-latency MAC protocol for wireless sensor networks

    Publication Year: 2010, Page(s):510 - 517
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2060 KB) | HTML iconHTML

    In this paper, an adaptive MAC protocol (variable load adaptive (VLA)-MAC) is proposed for wireless sensor networks. This protocol can achieve high energy efficiency and provide low latency under variable-traffic-load conditions. In the case of VLA-MAC, traffic load is measured online and used for adaptive adjustment. Sensor nodes transmit packets in bursts under high load conditions to alleviate ... View full abstract»

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

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (454 KB)
    Freely Available from IEEE
  • Call for papers

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (326 KB)
    Freely Available from IEEE
  • Call for papers

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (331 KB)
    Freely Available from IEEE
  • [Advertisement]

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (286 KB)
    Freely Available from IEEE
  • Copyright transfer form

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Journal of Communications and Networks (JCN)

    Publication Year: 2010, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (280 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2010, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (367 KB)
    Freely Available from IEEE

Aims & Scope

The Journal of Communications and Networks is published six times per year, and is committed to publishing high-quality papers that advance the state-of-the-art and practical applications of communications and information networks.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Anthony Ephremides
University of Maryland