By Topic

Journal of Communications and Networks

Issue 4 • Aug. 2010

Filter Results

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

    Publication Year: 2010, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (381 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
  • Why Gabor frames? Two fundamental measures of coherence and their role in model selection

    Publication Year: 2010, Page(s):289 - 307
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB) | HTML iconHTML

    The problem of model selection arises in a number of contexts, such as subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper studies non-asymptotic model selection for the general case of arbitrary (random or deterministic) design matrices and arbitrary nonzero entries of the signal. In this regard, it generalizes the notion of incohe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel multiple access scheme via compressed sensing with random data traffic

    Publication Year: 2010, Page(s):308 - 316
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1068 KB) | HTML iconHTML

    The problem of compressed sensing (CS) based multiple access is studied under the assumption of random data traffic. In many multiple access systems, i.e., wireless sensor networks (WSNs), data arrival is random due to the bursty data traffic for every transmitter. Following the recently developed CS methodology, the technique of compressing the transmitter identities into data transmissions is pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The expectation and sparse maximization algorithm

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

    In recent years, many sparse estimation methods, also known as compressed sensing, have been developed. However, most of these methods presume that the measurement matrix is completely known. We develop a new blind maximum likelihood method — the expectation-sparse-maximization (ESpaM) algorithm — for models where the measurement matrix is the product of one unknown and one known mat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New construction of quaternary low correlation zone sequence sets from binary low correlation zone sequence sets

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

    In this paper, using binary (N, M, L, є) low correlation zone (LCZ) sequence sets, we construct new quaternary LCZ sequence sets with parameters (2N, 2M, L, 2є). Binary LCZ sequences for the construction should have period N ≡ 3 mod 4, L|N, and the balance property. The proposed method corresponds to a quaternary extension of the extended construction of binary LCZ sequ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal power-throughput tradeoff study for MIMO fading ad-hoc networks

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

    In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended proportional fair scheduling for statistical QoS guarantee in wireless networks

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

    Opportunistic scheduling provides the capability of resource management in wireless networks by taking advantage of multiuser diversity and by allowing delay variation in delivering data packets. It generally aims to maximize system throughput or guarantee fairness and quality of service (QoS) requirements. In this paper, we develop an extended proportional fair (PF) scheduling policy that can sta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy efficient cooperative LEACH protocol for wireless sensor networks

    Publication Year: 2010, Page(s):358 - 365
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (769 KB) | HTML iconHTML

    We develop a low complexity cooperative diversity protocol for low energy adaptive clustering hierarchy (LEACH) based wireless sensor networks. A cross layer approach is used to obtain spatial diversity in the physical layer. In this paper, a simple modification in clustering algorithm of the LEACH protocol is proposed to exploit virtual multiple-input multiple-output (MIMO) based user cooperation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network-coding-based coded cooperation

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

    Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-coding-based coded cooperation scheme. When a user decodes its partner's information correctly in the first frame, it transmits the combination of the partner's parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An online response system for anomaly traffic by incremental mining with genetic optimization

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

    A flooding attack, such as DoS or Worm, can be easily created or even downloaded from the Internet, thus, it is one of the main threats to servers on the Internet. This paper presents an online real-time network response system, which can determine whether a LAN is suffering from a flooding attack within a very short time unit. The detection engine of the system is based on the incremental mining ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sharing information for event analysis over the wide Internet

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

    Cross-domain event information sharing is a topic of great interest in the area of event based network management. In this work we use data sets which represent actual attacks in the operational Internet. We analyze the data sets to understand the dynamics of the attacks and then go onto show the effectiveness of sharing incident related information to contain these attacks. We describe universal ... 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 (324 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
  • [Advertisement]

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (286 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 (381 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