Journal of Communications and Networks Impact Factor & Information

Publisher: Hanʼguk Tʻongsin Hakhoe; IEEE Communications Society, Institute of Electrical and Electronics Engineers

Current impact factor: 1.01

Impact Factor Rankings

2015 Impact Factor Available summer 2016
2014 Impact Factor 1.007
2013 Impact Factor 0.747
2012 Impact Factor 0.309
2011 Impact Factor 0.291
2010 Impact Factor 0.351
2009 Impact Factor 0.224
2008 Impact Factor 0.273
2007 Impact Factor 0.223
2006 Impact Factor 0.233
2005 Impact Factor 0.457
2004 Impact Factor 0.403
2003 Impact Factor 0.571
2002 Impact Factor 0.463

Impact factor over time

Impact factor

Additional details

5-year impact 0.78
Cited half-life 3.50
Immediacy index 0.07
Eigenfactor 0.00
Article influence 0.35
Website Journal of Communications and Networks website
Other titles JCN
ISSN 1229-2370
OCLC 41177577
Material type Periodical
Document type Journal / Magazine / Newspaper

Publisher details

Institute of Electrical and Electronics Engineers

  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author can archive a post-print version
  • Conditions
    • Author's pre-print on Author's personal website, employers website or publicly accessible server
    • Author's post-print on Author's server or Institutional server
    • Author's pre-print must be removed upon publication of final version and replaced with either full citation to IEEE work with a Digital Object Identifier or link to article abstract in IEEE Xplore or replaced with Authors post-print
    • Author's pre-print must be accompanied with set-phrase, once submitted to IEEE for publication ("This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible")
    • Author's pre-print must be accompanied with set-phrase, when accepted by IEEE for publication ("(c) 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.")
    • IEEE must be informed as to the electronic address of the pre-print
    • If funding rules apply authors may post Author's post-print version in funder's designated repository
    • Author's Post-print - Publisher copyright and source must be acknowledged with citation (see above set statement)
    • Author's Post-print - Must link to publisher version with DOI
    • Publisher's version/PDF cannot be used
    • Publisher copyright and source must be acknowledged
  • Classification

Publications in this journal

  • Journal of Communications and Networks 10/2015; 17(5):517-524. DOI:10.1109/JCN.2015.000090

  • Journal of Communications and Networks 10/2015; 17(5):525-533. DOI:10.1109/JCN.2015.000091

  • Journal of Communications and Networks 10/2015; 17(5):499-505. DOI:10.1109/JCN.2015.000088

  • Journal of Communications and Networks 10/2015; 17(5):506-516. DOI:10.1109/JCN.2015.000089

  • Journal of Communications and Networks 10/2015; 17(5):463-472. DOI:10.1109/JCN.2015.000084

  • Journal of Communications and Networks 10/2015; 17(5):482-490. DOI:10.1109/JCN.2015.000086

  • Journal of Communications and Networks 10/2015; 17(5):534-540. DOI:10.1109/JCN.2015.000092

  • Journal of Communications and Networks 10/2015; 17(5):491-498. DOI:10.1109/JCN.2015.000087

  • Journal of Communications and Networks 10/2015; 17(5):453-462. DOI:10.1109/JCN.2015.000083

  • Journal of Communications and Networks 10/2015; 17(5):473-481. DOI:10.1109/JCN.2015.000085
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers a wideband cognitive radio network which can simultaneously sense multiple narrowband channels and thus aggregate the detected available channels for transmission and proposes a novel cognitive radio system that exhibits improved sensing throughput and can save power consumption of secondary user (SU) compared to the conventional cognitive radio system studied so far. More specifically, under the proposed cognitive radio system, we study the problem of designing the optimal sensing time and power allocation strategy, in order to maximize the ergodic throughput of the proposed cognitive radio system under two different schemes, namely the wideband sensing-based spectrum sharing scheme and the wideband opportunistic spectrum access scheme. In our analysis, besides the average interference power constraint at primary user, the average transmit power constraint of SU is also considered for the two schemes and then a subgradient algorithm is developed to obtain the optimal sensing time and the corresponding power allocation strategy. Finally, numerical simulations are presented to verify the performance of the two proposed schemes.
    Journal of Communications and Networks 08/2015; 17(4):394-405. DOI:10.1109/JCN.2015.000070
  • [Show abstract] [Hide abstract]
    ABSTRACT: Effective link quality estimation is a vital issue for reliable routing in wireless networks. This paper studies the performance of expected transmission count (ETX) under different traffic loads. Although ETX shows good performance under light load, its performance gets significantly worse when the traffic load is high. A broadcast packet storm due to new route discoveries severely affects the link ETX values under high traffic load, which makes it difficult to find a good path. This paper presents the design and implementation of a variation of ETX called high load ??? ETX (HETX), which reduces the impact of route request broadcast packets to link metric values under high load. We also propose a reliable routing protocol using link quality metrics, which is called link quality distance vector (LQDV). We conducted the evaluation of the performance of three metrics ??? HETX, ETX and minimum hop-count. The simulation results show that HETX improves the average route throughput by up to 25% over ETX under high traffic load. Minimum hop-count has poor performance compared with both HETX and ETX at all of the different traffic loads. Under light load, HETX and ETX show the same performance.
    Journal of Communications and Networks 08/2015; 17(4):370-383. DOI:10.1109/JCN.2015.000068
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this study, we present an approach for reducing the information inaccuracy of existing star aggregation based on bypass links when there are multi-constraint QoS parameters in asymmetric networks. In our approach, bypass links with low similarity are selected. Links that are not chosen as bypass links are included in each group depending on the star's link characteristics. Moreover, each link group is aggregated differently according to the similarity of the links that make up the group. The selection of a bypass link by using link similarity reduces the existing time complexity of O(N3) to O(N) by virtue of the simplification of the selection process. In addition, the adaptive integration according to the characteristics of the links in each group is designed to reduce the information inaccuracy caused by static aggregation. Simulation results show that the proposed method maintains low information distortion; specifically, it is 3.8 times lower than that of the existing method, even when the number of nodes in a network increases.
    Journal of Communications and Networks 08/2015; 17(4):428-439. DOI:10.1109/JCN.2015.000073
  • [Show abstract] [Hide abstract]
    ABSTRACT: This study addresses the effects of channel estimation error and mutual interference between licensed and unlicensed systems on outage performance of reactive relay selection in unlicensed systems over independent non-identical (i.n.i) Rayleigh fading channels and under both the maximum transmit power constraint and primary outage constraint. Toward this end, power allocation for unlicensed users is first recommended to satisfy both constraints and account for channel estimation error and mutual interference. Then, we derive an exact closed-form outage probability representation for unlicensed systems to quickly evaluate this effect in key operation parameters. Various results corroborate the derived expressions and provide useful insights into system performance.
    Journal of Communications and Networks 08/2015; 17(4):362-369. DOI:10.1109/JCN.2015.000067
  • [Show abstract] [Hide abstract]
    ABSTRACT: Since the invention of turbo codes in 1993 there has been an enormous interest and progress in the field of capacity approaching code constructions. Many classical constructions have been replaced by newer, better performing codes with feasible decoding complexity. Most of these modern code constructions, such as turbo codes, Gallager's low-density parity-check (LDPC) codes and their generalizations, can be modeled by sparse graphical models. Spatial coupling of sparse graphical models has in the last years attracted a lot of interest due to the threshold saturation phenomenon, which leads to capacity achieving performance with iterative message passing decoding. Polar codes are a recently discovered class of capacity achieving codes that are formed by an explicit construction based on a phenomenon called channel polarization. These codes, too, have various low-complexity decoding algorithms based on message passing on a sparse graph that has a recursive structure similar to that of fast transforms in signal processing.
    Journal of Communications and Networks 08/2015; 17(4):325-327. DOI:10.1109/JCN.2015.000062
  • [Show abstract] [Hide abstract]
    ABSTRACT: It is known that the progressive edge-growth (PEG) algorithm can be used to construct low-density parity-check (LDPC) codes at finite code lengths with large girths through the establishment of edges between variable and check nodes in an edge-by-edge manner. In [1], the authors derived a class of LDPC codes for relay communication systems by extending the full-diversity root-LDPC code. However, the submatrices of the parity-check matrix H corresponding to this code were constructed separately; thus, the girth of H was not optimized. To solve this problem, this paper proposes a modified PEG algorithm for use in the design of large girth and full-diversity LDPC codes. Simulation results indicated that the LDPC codes constructed using the modified PEG algorithm exhibited a more favorable frame error rate performance than did codes proposed in [1] over block-fading channels.
    Journal of Communications and Networks 08/2015; 17(4):346-350. DOI:10.1109/JCN.2015.000065
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present an iterative reliability-based modified majority-logic decoding algorithm for two classes of structured low-density parity-check codes. Different from the conventional modified one-step majority-logic decoding algorithms, we design a turbo-like iterative strategy to recover the performance degradation caused by the simply flipping operation. The main computational loads of the presented algorithm include only binary logic and integer operations, resulting in low decoding complexity. Furthermore, by introducing the iterative set, a very small proportion (less than 6%) of variable nodes are involved in the reliability updating process, which can further reduce the computational complexity. Simulation results show that, combined with the factor correction technique and a well-designed non-uniform quantization scheme, the presented algorithm can achieve a significant performance improvement and a fast decoding speed, even with very small quantization levels (3???4 bits resolution). The presented algorithm provides a candidate for trade-offs between performance and complexity.
    Journal of Communications and Networks 08/2015; 17(4):339-345. DOI:10.1109/JCN.2015.000064
  • [Show abstract] [Hide abstract]
    ABSTRACT: Cognitive radio networks (CRNs) have emerged as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows a secondary network comprising of secondary users (SUs) to coexist with a primary network comprising of licensed primary users (PUs) subject to the condition that SUs do not cause any interference to the primary network. Since it is necessary for SUs to avoid any interference to the primary network, PU activity precludes attempts of SUs to access the licensed spectrum and forces frequent channel switching for SUs. This dynamic nature of CRNs, coupled with the possibility that an SU may not share a common channel with all its neighbors, makes the task of multicast routing especially challenging. In this work, we have proposed a novel multipath on-demand multicast routing protocol for CRNs. The approach of multipath routing, although commonly used in unicast routing, has not been explored for multicasting earlier. Motivated by the fact that CRNs have highly dynamic conditions, whose parameters are often unknown, the multicast routing problem is modeled in the reinforcement learning based framework of learning automata. Simulation results demonstrate that the approach of multipath multicasting is feasible, with our proposed protocol showing a superior performance to a baseline state-of-the-art CRN multicasting protocol.
    Journal of Communications and Networks 08/2015; 17(4):406-418. DOI:10.1109/JCN.2015.000071
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider a relaying system which employs a single relay in a wireless network with distributed sources and destinations. Here, all source, destination, and relay nodes are equipped with multiple antennas. For amplify-and-forward relay systems, we confirm the achievable sum rate through a joint multiple source precoders and a single relay filter design. To this end, we propose a new linear processing scheme in terms of maximizing the sum rate performance by applying a blockwise relaying method combined with geometric programming techniques. By allowing the global channel knowledge at the source nodes, we show that this joint design problem is formulated as a standard geometric program, which can guarantees a global optimal value under the modified sum rate criterion. Simulation results show that the proposed blockwise relaying scheme with the joint power allocation method provides substantial sum rate gain compared to the conventional schemes.
    Journal of Communications and Networks 06/2015; 17(3):241-246. DOI:10.1109/JCN.2015.000045
  • [Show abstract] [Hide abstract]
    ABSTRACT: To facilitate the base station planning in high speed railway communication systems, it is necessary to consider the functional relationships between the base station transmit power and space parameters such as train velocity and cell radius. Since these functions are able to present some inherent system properties determined by its spatial topology, they will be referred to as the power-space functions in this paper. In light of the fact that the line-of-sight path persists the most power of the received signal of each passing train, this paper considers the average transmission rate and bounds on power-space functions based on the additive white Gaussian noise channel (AWGN) model. As shown by Monte Carlo simulations, using AWGN channel instead of Rician channel introduces very small approximation errors, but a tractable mathematical framework and insightful results. Particularly, lower bounds and upper bounds on the average transmission rate, as well as transmit power as functions of train velocity and cell radius are presented in this paper. It is also proved that to maintain a fixed amount of service or a fixed average transmission rate, the transmit power of a base station needs to be increased exponentially, if the train velocity or cell radius is increased, respectively.
    Journal of Communications and Networks 06/2015; 17(3):231-240. DOI:10.1109/JCN.2015.000044