International Journal of Communication Systems

Cover image for Vol. 31 Issue 3

Edited By: Professor Mohammad S. Obaidat

Impact Factor: 1.066

ISI Journal Citation Reports © Ranking: 2016: 73/89 (Telecommunications); 190/262 (Engineering Electrical & Electronic)

Online ISSN: 1099-1131

Recently Published Issues

See all

The International Journal of Communication Systems

The International Journal of Communication Systems provides a forum for R&D, open to researchers from all types of institutions and organisations worldwide, aimed at the increasingly important area of communication technology. The Journal's emphasis is particularly on the issues impacting behaviour at the system, service and management levels. Published twelve times a year, it provides coverage of advances that have a significant potential to impact the immense technical and commercial opportunities in the communications sector.

Click here to learn more about this journal.

Recently Published Articles

  1. Joint service function chain deploying and path selection for bandwidth saving and VNF reuse

    Dan Li, Julong Lan and Peng Wang

    Version of Record online: 18 JAN 2018 | DOI: 10.1002/dac.3523

    Thumbnail image of graphical abstract

    By setting the upper bound of path length, and maximizing the reused VMs under the path length constraint, we can balance the uses of link and VM resources. We propose an algorithm called longest function assignment sequence (LFAS) to reserve empty VMs for VNFs not assigned to reusable VMs. We incrementally find subpaths that most efficiently reuse existing VMs on the basis of LFAS to find a suitable path for each request easily and quickly.

  2. Design and extensive hardware performance analysis of an efficient pairwise key generation scheme for Smart Grid

    Dariush Abbasinezhad-Mood and Morteza Nikooghadam

    Version of Record online: 16 JAN 2018 | DOI: 10.1002/dac.3507

    Thumbnail image of graphical abstract

    In this paper, we have proposed a detailed efficient and secure pairwise shared key generation scheme among the power operator, data collectors, and measurement devices in Smart Grid. More importantly, we have implemented the cryptographic elements on (a) an ARM Cortex-M3 microcontroller, (b) an Intel Core i7-4702MQ processor, and (c) 4 ARM processors, three 32-bit and one 64-bit. Last but not least, we have evaluated the feasibility of using the ARM processors to be employed for the data collectors.

  3. Design and modeling of survivable network planning for software-defined data center networks in smart city

    Yuhuai Peng, Xiaojie Wang, Dawei Shen, Wei Yan, Yanhua Fu and Qingxu Deng

    Version of Record online: 16 JAN 2018 | DOI: 10.1002/dac.3509

    Thumbnail image of graphical abstract
    1. We present a survivable network planning model based on SDN
    2. The elastic network planning problem is formulated as a mixed ILP problem to minimize the number of unprotected nodes
    3. Three effective schemes including K-means clustering algorithm based on simulated annealing, greedy routing algorithm, and Lagrangian relaxation algorithm are proposed for feasible solutions.
  4. Experimental assessment of LNC-based cooperative communication schemes using commercial off-the-shelf wireless sensor network nodes

    Odilson T. Valle, Gerson Budke, Carlos Montez, Ricardo Moraes and Francisco Vasques

    Version of Record online: 16 JAN 2018 | DOI: 10.1002/dac.3508

    Thumbnail image of graphical abstract

    Linear network coding (LNC) and cooperative communication techniques can be useful to support reliable communication in a wireless sensor network (WSN). However, an effective use of LNC-based communication techniques imposes the availability of WSN nodes able to perform the encoding/decoding tasks within the required timing constraints. This paper reports an experimental assessment of commercial off-the-shelf (COTS) WSN nodes running LNC techniques.

  5. Analysis of D2D-pairing scheme based on Voronoi diagram in cellular networks

    Chun-Peng Liu, Chen-Guang He and Wei-Xiao Meng

    Version of Record online: 16 JAN 2018 | DOI: 10.1002/dac.3513

    Thumbnail image of graphical abstract

    In the proposed D2D pairing model, random D2D terminals are splitted by Voronoi Diagram. Ruling small range D2D communications, it cause lower co-channel interferences. This leads that the D2D or cellular links coverage probability are promoted dramatically. Further, compairing with strictly greedy solution, the D2D paring based on Voronoi Diagram is local optimal, and it provides more fairness. Copyright .c 2010 John Wiley & Sons, Ltd.

SEARCH

SEARCH BY CITATION