Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
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 expandQuick Abstract | 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 predetermined message. The applications includes proxy signatures, limited free downloads, and the rating web site. We give two instances of metered signatures: One is based on the computational Diffie-Hellman problem (CDHP) using a bilinear map and the other is based on the RSA problem. In both schemes, the signature and certificate size and the verification cost are constant with respect to k. Further, we show that the proposed metered signatures admit batch verification of many signatures almost at one verification cost with small security loss. 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 expandQuick Abstract | 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 this paper. On the basis of the many-to-one concept, the proposed method uses a new multi-peer aggregation technique to enhance the utilization of down-link bandwidth. In addition, an adaptive peer assignment algorithm is also introduced in order to minimize the overall transmission time. Experimental results show that by using our proposed method, the utilization of down-link bandwidth is significantly improved, and the overall transmission time is greatly reduced. 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 expandQuick Abstract | 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 eigenvectors can be orthonormalized within a linear computational complexity. While the PASTd algorithm tries to extracts orthonormalized eigenvectors, the new scheme orthonormalizes the eigenvectors after their extraction, yielding much more tacking efficiency. We apply the new tracking scheme for blind adaptive multiuser detection for non-stationary cellular CDMA environment and use extensive simulation results to demonstrate the performance improvement of the proposed scheme. 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 expandQuick Abstract | 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 of surviving users at each iteration of the SUS and the number of streams for transmission is calculated. Secondly, the received signal power of ZF-BF is represented as a function of the elements of the upper triangular matrix from QR decomposition of the channel matrix. Thirdly, we approximate the received signal power of ZF-BF with the SUS as the maximum of scaled chi-square random variables where the scaling factor is approximated as a function of both OLT and the number of users in the system. Putting all the above derivations and order statistics together, the approximated ergodic sum rate of ZF-BF with the SUS is shown in a closed form. The simulation results verify that the approximation tightly matches with the sample average for any OLT and even for a small number of users. 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
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 MIMO is optimized to minimize the total energy consumption. It is also found that the optimal number of all the nodes participating in cooperative communication does not vary with the number of nodes that have data to transmit. The proposition is proved mathematically. The influence of long-haul distance and modulation constellation size on the total energy consumption is investigated. A cooperative MIMO scheme with help-node participation is proposed and the simulation results show that the proposed scheme achieves significant energy saving. 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
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 Hadamard matrix, which is a special case of Jacket matrices. Also, it can achieve full rate and full diversity with the simple decoding. Simulations show the good performance of the proposed codes in terms of symbol error rate. For generality, a kind of quasi-orthogonal STBC may be similarly designed with the improved performance. 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 expandQuick Abstract | 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-phase approach. 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 expandQuick Abstract | 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 adaptive reactions to the network conditions are sought in real time. To this aim, a neural approximation technique is studied to exploit an optimal pricing control law, able to counteract traffic changes with a small on-line computational effort. Owing to the generality of the mathematical framework under investigation, our control methodology can be generalized for other decision variables and cost functionals. 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 expandQuick Abstract | 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 efficiency and accuracy. The CPS system is able to operate independent of the internal network protocol state, and it is designed to schedule packet streams in fine-grained time intervals to meet the resource requirement. This approach simplifies the design of the CPS system, and leads us to obtain the intended output bandwidth. We implemented our prototype system in Linux, and measured the performance of the network resource management system under various network QoS constraints. The distinctive features of our principles are as follows: It is robust and accurate, and its operation is independent of internal network protocols. 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 expandQuick Abstract | 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) constraints, and this rbuf-blocking problem causes considerable throughput loss when multiple paths are used simultaneously. In this research paper, we demonstrate the weakness of SCTP-CMT rbuf constraints, and we then identify that rbuf-blocking problem in SCTP multihoming is mostly due to its loss-based nature for detecting network congestion. We present a simulation-based performance comparison of FAST TCP versus SCTP in high-speed networks for solving a number of throughput issues. This work proposes an end-to-end transport layer protocol (i.e., FAST TCP multihoming as a reliable, delay-based, multihome-aware, and selective ACK-based transport protocol), which can transfer data between a multihomed source and destination hosts through multiple paths simultaneously. Through extensive ns-2 simulations, we show that FAST TCP multihoming achieves the desired goals under a variety of network conditions. The experimental results and survey presented in this research also provide an insight on design decisions for the future high-speed multihomed transport layer protocols. 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