Issue 1 • March 2019

Purchase of this issue is not available.

Filter Results

Displaying Results 1 - 16 of 16
  • Table of contents

    Publication Year: 2019, Page(s): C1
    Request permission for reuse | PDF file iconPDF (129 KB)
    Freely Available from IEEE
  • IEEE COMMUNICATIONS SOCIETY

    Publication Year: 2019, Page(s): C2
    Request permission for reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Editorial

    Publication Year: 2019, Page(s): 1
    Request permission for reuse | PDF file iconPDF (68 KB) | HTML iconHTML
    Freely Available from IEEE
  • A Markov Model of Slice Admission Control

    Publication Year: 2019, Page(s):2 - 5
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (458 KB) | HTML iconHTML

    The emerging feature of network slicing in future fifth generation networks calls for efficient slice management. Recent studies have been focusing on the mechanism of slice admission control, which functions in a manner of state machine. This letter proposes a general state model for synchronous slice admission control, and proves it to be Markovian under a set of weak constraints. An analytical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Game of One/Two Strategic Friendly Jammers Versus a Malicious Strategic Node

    Publication Year: 2019, Page(s):6 - 9
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (653 KB) | HTML iconHTML

    We present a game-theoretic analysis of the interaction between a malicious node, attempting to perform unauthorized radio transmission, and friendly jammers trying to disrupt the malicious communications. We investigate the strategic behavior of the jammers against a rational malicious node and highlight counterintuitive results for this conflict. We also analyze the impact of multiple friendly j... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handover-Aware Content Replication for Mobile-CDN

    Publication Year: 2019, Page(s):10 - 13
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (706 KB) | HTML iconHTML

    This letter proposes a handover-aware content replication mechanism for mobile content delivery networks. This mechanism allows us to select the most optimal surrogate servers and assign these to the mobile clients through built-in tables. The optimal surrogate selection process begins by predicting the mobility of clients through Gauss–Markov model. Then, it continues with server modeling based o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Latency in Verifying Connection Setup in Dynamic Optical Networks

    Publication Year: 2019, Page(s):14 - 17
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (454 KB) | HTML iconHTML

    We consider dynamic applications that require new connections to be established with very low setup times. One challenge is determining when to initiate transmission, which can be based on a timing mechanism or based on receiving positive acknowledgment that the connection has been properly established. We investigate the latter strategy and analyze the added latency that is imposed by requiring v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Soft-TTL: Time-Varying Fractional Caching

    Publication Year: 2019, Page(s):18 - 21
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (440 KB) | HTML iconHTML

    Standard time-to-live (TTL) cache management prescribes the storage of entire files, or possibly fractions thereof, for a given amount of time after a request. As a generalization of this approach, this letter proposes the storage of a time-varying, diminishing, fraction of a requested file. Accordingly, the cache progressively evicts parts of the file over an interval of time following a request.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collision-Prevention Conditions for Wireless Personal Area Networks

    Publication Year: 2019, Page(s):22 - 25
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (577 KB) | HTML iconHTML

    In this Letter, we present a theoretical investigation for collision occurrence between adjacent IEEE 802.15.4 wireless personal area networks (WPANs), thus laying the foundation for collision-prevention approaches. Specifically, we identify and present the necessary and sufficient conditions to prevent collisions. The identified conditions can be used to devise collision-prevention mechanisms and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Enhancement in P300 ERP Single Trial by Machine Learning Adaptive Denoising Mechanism

    Publication Year: 2019, Page(s):26 - 29
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (594 KB) | HTML iconHTML

    The P300-based lie detection scheme is yet another and advantageous tactic for unadventurous polygraphy. In the proposed scheme, the raw electroencephalogram (EEG) signals are assimilated from 15 subjects during deception detection. After the assimilation, EEG signals are separated using an independent component analysis. The proposed adaptive denoising approach, extracts three kinds of features f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Meta-Key: A Secure Data-Sharing Protocol Under Blockchain-Based Decentralized Storage Architecture

    Publication Year: 2019, Page(s):30 - 33
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (577 KB) | HTML iconHTML

    In this letter we propose Meta-key, a data-sharing mechanism that enables users share their encrypted data under a blockchain-based decentralized storage architecture. All the data-encryption keys are encrypted by the owner’s public key and put onto the blockchain for safe and secure storage and easy key-management. Encrypted data are stored in dedicated storage nodes and proxy re-encryption mecha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cost-Aware Fair Allocation Mechanism for Multi-Resource Servers

    Publication Year: 2019, Page(s):34 - 37
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (637 KB) | HTML iconHTML

    We propose a cost-aware measure to establish fair-sharing of multi-resource/heterogeneous servers among multiple users. Each server attributes a virtual cost to the total allocated resources to each user, and strives to allocate resources to users attaining the minimum virtual cost. With the new mechanism, called per-server virtual cost fairness (PS-VCF), users do not envy the cost-allotments of e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Average Throughput of Myopic Policy for Opportunistic Access Over Block Fading Channels

    Publication Year: 2019, Page(s):38 - 41
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (374 KB) | HTML iconHTML

    This letter considers a multi-channel access problem in a cognitive radio network with ${M}$ primary users and a multi-channel secondary user (SU). SU selects ${K}$ channels for transmission without knowing the channel states or statistics of channel evo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Idle Capacity in Optical Networks to Pre-Plan as Many Additional Paths as Possible for Enhancing Service Connection Availability

    Publication Year: 2019, Page(s):42 - 45
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (519 KB) | HTML iconHTML

    A network is not always fully loaded during operation and may have idle capacity which is neither carrying any network services nor providing protection for working capacities. This idle capacity may be used to pre-plan as many additional paths as possible to enhance service connection availability with only some extra pre-planning in the network central controller. Our proposed adaptive multi-pat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Networking Letters Author Guidelines

    Publication Year: 2019, Page(s):46 - 47
    Request permission for reuse | PDF file iconPDF (67 KB)
    Freely Available from IEEE
  • IEEE Communications Society

    Publication Year: 2019, Page(s): C3
    Request permission for reuse | PDF file iconPDF (67 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Networking Letters publishes short papers in a rapid publication cycle on original research results derived from theoretical or experimental exploration of the area of communication/computer networking, covering various information transport networks over various physical layer technologies, both wireline and wireless, or hybrids of these.  

Full Aims & Scope

Meet Our Editors

Editor-in-Chief

George Rouskas
Department of Computer Science
North Carolina State University
Raleigh, NC 27695
rouskas@ncsu.edu
http://rouskas.csc.ncsu.edu/