By Topic

Journal of Communications and Networks

Issue 1 • Date Feb. 2012

Filter Results

Displaying Results 1 - 20 of 20
  • Table of Contents [Front cover]

    Publication Year: 2012, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2012, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (59 KB)
    Freely Available from IEEE
  • Capacity bounds in random wireless networks

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

    We consider a receiving node, located at the origin, and a Poisson point process (PPP) that models the locations of the desired transmitter as well as the interferers. Interference is known to be non-Gaussian in this scenario. The capacity bounds for additive non-Gaussian channels depend not only on the power of interference (i.e., up to second order statistics) but also on its entropy power which... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing RFID reader load with the meet-in-the-middle strategy

    Publication Year: 2012, Page(s):10 - 14
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    When tag privacy is required in radio frequency identification (ID) system, a reader needs to identify, and optionally authenticate, a multitude of tags without revealing their IDs. One approach for identification with lightweight tags is that each tag performs pseudo-random function with his unique embedded key. In this case, a reader (or a back-end server) needs to perform a brute-force search f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel cross-layer dynamic integrated priority-computing scheme for 3G+ systems

    Publication Year: 2012, Page(s):15 - 20
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1898 KB) | HTML iconHTML

    As Internet protocol and wireless communications have developed, the number of different types of mobile services has increased gradually. Existing priority-computing schemes cannot satisfy the dynamic requirements of supporting multiple services in future wireless communication systems, because the currently used factors, mainly user priority, are relatively simple and lack relevancy. To solve th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Curvature based ECG signal compression for effective communication on WPAN

    Publication Year: 2012, Page(s):21 - 26
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1406 KB) | HTML iconHTML

    As electrocardiogram (ECG) signals are generally sampled with a frequency of over 200 Hz, a method to compress diagnostic information without losing data is required to store and transmit them efficiently on a wireless personal area network (WPAN). In this paper, an ECG signal compression method for communications on WPAN, which uses feature points based on curvature, is proposed. The feature poin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind signal processing for impulsive noise channels

    Publication Year: 2012, Page(s):27 - 33
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6985 KB) | HTML iconHTML

    In this paper, a new blind signal processing scheme for equalization in fading and impulsive-noise channel environments is introduced based on probability density function matching method and a set of Dirac-delta functions. Gaussian kernel of the proposed blind algorithm has the effect of cutting out the outliers on the difference between the desired level values and impulse-infected outputs. And ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collision-free arbitration protocol for active RFID systems

    Publication Year: 2012, Page(s):34 - 39
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (879 KB) | HTML iconHTML

    Collisions between tags greatly reduce the identification speed in radio frequency identification (RFID) systems and increase communication overhead. In particular for an active RFID system, tags are powered by small batteries, and a large number of re-transmissions caused by collisions can deteriorate and exhaust the tag energy which may result in missing tags. An efficient collision-free arbitra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An iterative analysis of single-hop B-MAC networks under Poisson traffic

    Publication Year: 2012, Page(s):40 - 50
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3149 KB) | HTML iconHTML

    The Berkeley-medium access control (B-MAC) is a lightweight, configurable and asynchronous duty cycle medium access control (MAC) protocol in wireless sensor networks. This article presents an analytic modelling of single-hop B-MAC protocol under a Poisson traffic assumption. Our model considers important B-MAC parameters such as the sleep cycle, the two stage backoff mechanism, and the extended p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed coordination protocol for ad hoc cognitive radio networks

    Publication Year: 2012, Page(s):51 - 62
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2548 KB) | HTML iconHTML

    The exponential growth in wireless services has resulted in an overly crowded spectrum. The current state of spectrum al- location indicates that most usable frequencies have already been occupied. This makes one pessimistic about the feasibility of integrating emerging wireless services such as large-scale sensor net- works into the existing communication infrastructure. Cognitive radio is an eme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MAC protocol for reliable multicast over multi-hop wireless ad hoc networks

    Publication Year: 2012, Page(s):63 - 74
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1810 KB) | HTML iconHTML

    Multicast data communication is an efficient communication scheme, especially in multi-hop ad hoc networks where the media access control (MAC) layer is based on one-hop broadcast from one source to multiple receivers. Compared to unicast, multicast over a wireless channel should be able to deal with varying channel conditions of multiple users and user mobility to provide good quality to all user... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-layer reduction of wireless network card idle time to optimize energy consumption of pull thin client protocols

    Publication Year: 2012, Page(s):75 - 90
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2355 KB) | HTML iconHTML

    Thin client computing trades local processing for network bandwidth consumption by offloading application logic to remote servers. User input and display updates are exchanged between client and server through a thin client protocol. On wireless devices, the thin client protocol traffic can lead to a significantly higher power consumption of the radio interface. In this article, a cross-layer fram... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new route optimization scheme for network mobility: Combining ORC protocol with RRH and using quota mechanism

    Publication Year: 2012, Page(s):91 - 103
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2033 KB) | HTML iconHTML

    Network mobility (NEMO) based on mobile IP version 6 has been proposed for networks that move as a whole. Route optimization is one of the most important topics in the field of NEMO. The current NEMO basic support protocol defines only the basic working mode for NEMO, and the route optimization problem is not mentioned. Some optimization schemes have been proposed in recent years, but they have li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A provable authenticated certificateless group key agreement with constant rounds

    Publication Year: 2012, Page(s):104 - 110
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (521 KB) | HTML iconHTML

    Group key agreement protocols allow a group of users, communicating over a public network, to establish a shared secret key to achieve a cryptographic goal. Protocols based on certificateless public key cryptography (CL-PKC) are preferred since CL-PKC does not need certificates to guarantee the authenticity of public keys and does not suffer from key escrow of identity-based cryptography. Most pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Journal of Communications and Networks - Call for papers

    Publication Year: 2012, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Journal of Communications and Networks - Call for papers

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

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

    Publication Year: 2012, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (48 KB)
    Freely Available from IEEE
  • [Back inside cover]

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

    Publication Year: 2012, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (57 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