By Topic

Communications and Networks, Journal of

Issue 3 • Date June 2010

Filter Results

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

    Publication Year: 2010 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (303 KB)  
    Freely Available from IEEE
  • [Front inside cover]

    Publication Year: 2010 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (297 KB)  
    Freely Available from IEEE
  • Metered signatures: How to restrict the signing capability

    Publication Year: 2010 , Page(s): 201 - 208
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (517 KB) |  | HTML iconHTML  

    We propose a new notion of metered signatures. Metered signature is an extension of k-times signatures in which a signer can generate only k signatures. However, the restriction of metered signatures can be more elaborate: It can be used k-times every day or to preserve the order of signed messages in some applications. Any violation of this regulation reveals a secret key or the signature on a pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new fast P2P video transmission method applied in asymmetrical speed channel environment

    Publication Year: 2010 , Page(s): 209 - 215
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1032 KB) |  | HTML iconHTML  

    In an asymmetrical speed channel environment like asymmetric digital subscriber line, the up-link bandwidth is normally smaller than the down-link bandwidth, which will lead to extremely low utilization of down-link bandwidth when current P2P video transmission is applied. To overcome this, a new fast P2P video transmission method applied in an asymmetrical speed channel environment is proposed in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel subspace tracking algorithm and its application to blind multiuser detection in cellular CDMA systems

    Publication Year: 2010 , Page(s): 216 - 221
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (718 KB) |  | HTML iconHTML  

    In this paper, we propose and develop a new algorithm for the principle subspace tracking by orthonormalizing the eigenvectors using an approximation of Gram-Schmidt procedure. We carry out a novel mathematical derivation to show that when this approximated version of Gram-Schmidt procedure is added to a modified form of projection approximation subspace tracking deflation (PASTd) algorithm, the e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sum rate approximation of zero-forcing beamforming with semi-orthogonal user selection

    Publication Year: 2010 , Page(s): 222 - 230
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (992 KB) |  | HTML iconHTML  

    In this paper, we present a closed-form approximation of the average sum rate of zero-forcing (ZF) beamforming (BF) with semi-orthogonal user selection (SUS). We first derive the survival probability associated with the SUS that absolute square of the channel correlation between two users is less than the orthogo-nalization level threshold (OLT). With this result, each distribution for the number ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy saving in cluster-based wireless sensor networks through cooperative MIMO with idle-node participation

    Publication Year: 2010 , Page(s): 231 - 239
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (955 KB) |  | HTML iconHTML  

    In cluster-based wireless sensor networks, the energy could be saved when the nodes that have data to transmit participate in cooperative multiple-input multiple-output (MIMO). In this paper, by making the idle nodes that have no data to transmit participate in the cooperative MIMO, it is found that much more energy could be saved. The number of the idle nodes that participate in the cooperative M... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-orthogonal space-time block codes designs based on Jacket transform

    Publication Year: 2010 , Page(s): 240 - 245
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (694 KB) |  | HTML iconHTML  

    Jacket matrices1, motivated by the complex Hadamard matrix, have played important roles in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a novel approach to design a simple class of space-time block codes (STBCs) to reduce its peak-to-average power ratio. The proposed code provides coding gain due to the characteristics of the complex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity assignment and routing for interactive multimedia service networks

    Publication Year: 2010 , Page(s): 246 - 252
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (801 KB) |  | HTML iconHTML  

    A binary linear integer program is formulated for the problem of expanding the capacity of a fiber optic network and routing the traffic to deliver new interactive multimedia services. A two-phase Lagrangian dual search procedure and a Lagrangian heuristic are developed. Computational results show superior performance of the two-phase subgradient optimization compared with the conventional one-pha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A measurement-based adaptive control mechanism for pricing in telecommunication networks

    Publication Year: 2010 , Page(s): 253 - 265
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1422 KB) |  | HTML iconHTML  

    The problem of pricing for a telecommunication network is investigated with respect to the users' sensitivity to the pricing structure. A functional optimization problem is formulated, in order to compute price reallocations as functions of data collected in real time during the network evolution. No a-priori knowledge about the users' utility functions and the traffic demands is required, since a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CPS: Operating system architecture for efficient network resource management with control-theoretic packet scheduler

    Publication Year: 2010 , Page(s): 266 - 274
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1936 KB) |  | HTML iconHTML  

    The efficient network resource management is one of the important topics in a real-time system. In this paper, we present a practical network resource management framework, control-theoretic packet scheduler (CPS) system. Using our framework, an operating system can schedule both input and output streams accurately and efficiently. Our framework adopts very portable feedback control theory for eff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation-based study of FAST TCP compared to SCTP: Towards multihoming implementation using FAST TCP

    Publication Year: 2010 , Page(s): 275 - 284
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2740 KB) |  | HTML iconHTML  

    The current multihome-aware protocols (like stream control transmission protocol (SCTP) or parallel TCP for concurrent multipath data transfer (CMT) are not designed for high-capacity and large-latency networks; they often have performance problems transferring large data files over shared long-distance wide area networks. It has been shown that SCTP-CMT is more sensitive to receive buffer (rbuf) ... 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
    Save to Project icon | Request Permissions | PDF file iconPDF (454 KB)  
    Freely Available from IEEE
  • Call for papers

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (324 KB)  
    Freely Available from IEEE
  • Call for papers

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (326 KB)  
    Freely Available from IEEE
  • [Advertisement]

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (286 KB)  
    Freely Available from IEEE
  • Journal of Communications and Networks (JCN)

    Publication Year: 2010 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (280 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2010 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (303 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
H. Vincent Poor
Princeton University