Journal of Communications and Networks Impact Factor & Information

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

Journal description

Current impact factor: 0.75

Impact Factor Rankings

2015 Impact Factor Available summer 2015
2013 / 2014 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
Year

Additional details

5-year impact 0.30
Cited half-life 5.00
Immediacy index 0.08
Eigenfactor 0.00
Article influence 0.14
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
    ​ green

Publications in this journal

  • [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
  • [Show abstract] [Hide abstract]
    ABSTRACT: Energy harvesting devices have been proposed for sensor networking applications where batteries cannot be replaced, and cooperative communication schemes have been used to increase energy efficiency for wireless systems. Here, we develop transmission scheduling schemes for multi-terminal cooperative energy harvesting networks that maximize the packet delivery ratio, i.e., the probability that an event is reported successfully. We see that the proposed scheme provides virtually the same performance as the state-of-the-art threshold-based scheme, but does not require auxiliary parameter optimization. The proposed scheme also permits extensions to multiple cooperating nodes and sources, and it can be modified to accommodate fairness constraints.
    Journal of Communications and Networks 06/2015; 17(3):256-264. DOI:10.1109/JCN.2015.000047
  • [Show abstract] [Hide abstract]
    ABSTRACT: Avionic databuses fulfill a critical function in the connection and communication of aircraft components and functions such as flight-control, navigation, and monitoring. Ethernet-based avionic databuses have become the mainstream for large aircraft owning to their advantages of full-duplex communication with high bandwidth, low latency, low packet-loss, and low cost. As a new generation aviation network communication standard, avionics full-duplex switched ethernet (AFDX) adopted concepts from the telecom standard, asynchronous transfer mode (ATM). In this technology, the switches are the key devices influencing the overall performance. This paper reviews the avionic databus with emphasis on the switch architecture classifications. Based on a comparison, analysis, and discussion of the different switch architectures, we propose a new avionic switch design based on a time-division switch fabric for high flexibility and scalability. This also merges the design concept of space-partition switch fabric to achieve reliability and predictability. The new switch architecture, called space partitioned shared memory switch (SPSMS), isolates the memory space for each output port. This can reduce the competition for resources and avoid conflicts, decrease the packet forwarding latency through the switch, and reduce the packet loss rate. A simulation of the architecture with optimized network engineering tools (OPNET) confirms the efficiency and significant performance improvement over a classic shared memory switch, in terms of overall packet latency, queuing delay, and queue size.
    Journal of Communications and Networks 06/2015; 17(3):286-295. DOI:10.1109/JCN.2015.000051
  • [Show abstract] [Hide abstract]
    ABSTRACT: In a recent paper [1], the authors investigated the maximum stable throughput region of a network composed of a rechargeable primary user and a secondary user plugged to a reliable power supply. The authors studied the cases of an infinite and a finite energy queue at the primary transmitter. However, the results of the finite case are incorrect. We show that under the proposed energy queue model (a decoupled M/D/l queueing system with Bernoulli arrivals and the consumption of one energy packet per time slot), the energy queue capacity does not affect the stability region of the network.
    Journal of Communications and Networks 06/2015; 17(3):265-266. DOI:10.1109/JCN.2015.000048
  • [Show abstract] [Hide abstract]
    ABSTRACT: Due to the difficulty of coordination in the cellular uplink, it is a practical challenge how to achieve the optimal throughput scaling with distributed scheduling. In this paper, we propose a distributed and opportunistic user scheduling (DOUS) that achieves the optimal throughput scaling in a single-input multiple-output interfering multiple-access channel, i.e., a multi-cell uplink network, with M antennas at each base station (BS) and N users in a cell. In a distributed fashion, each BS adopts M random receive beamforming vectors and then selects M users such that both sufficiently large desired signal power and sufficiently small generating interference are guaranteed. As a main result, it is proved that full multiuser diversity gain can be achieved in each cell when a sufficiently large number of users exist. Numerical evaluation confirms that in a practical setting of the multi-cell network, the proposed DOUS outperforms the existing distributed user scheduling algorithms in terms of sum-rate.
    Journal of Communications and Networks 06/2015; 17(3):267-274. DOI:10.1109/JCN.2015.000049
  • [Show abstract] [Hide abstract]
    ABSTRACT: Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.
    Journal of Communications and Networks 06/2015; 17(3):306-320. DOI:10.1109/JCN.2015.000053
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present a reliability-based iterative proportionality-logic decoding algorithm for two classes of structured low-density parity-check (LDPC) codes. The main contributions of this paper include: 1) Syndrome messages instead of extrinsic messages are processed and exchanged between variable nodes and check nodes, which can reduce the decoding complexity; 2) a more flexible decision mechanism is developed in which the decision threshold can be self-adjusted during the iterative process. Such decision mechanism is particularly effective for decoding the majority-logic decodable codes; 3) only part of the variable nodes satisfying the pre-designed criterion are involved for the presented algorithm, which is in the proportionality-logic sense and can further reduce the computational complexity. Simulation results show that, when combined with factor correction techniques and appropriate proportionality parameter, the presented algorithm performs well and can achieve fast decoding convergence rate while maintaining relative low decoding complexity, especially for small quantized levels (3–4 bits). The presented algorithm provides a candidate for those application scenarios where the memory load and the energy consumption are extremely constrained.
    Journal of Communications and Networks 06/2015; 17(3):213-220. DOI:10.1109/JCN.2015.000042
  • [Show abstract] [Hide abstract]
    ABSTRACT: Coupled schemes between service-oriented architecture (SOA) and Web 2.0 have recently been researched. Web-based content providers and telecommunications company (Telecom) based Internet protocol television (IPTV) providers have struggled against each other to accommodate more three-screen service subscribers. Since the advent of Web 2.0, more abundant reproduced content can be circulated. However, because according to increasing device's resolution and content formats IPTV providers transcode content in advance, network bandwidth, storage and operation costs for content management systems (CMSs) are wasted. In this paper, we present a user centric CMS for open IPTV, which integrates SOA and Web 2.0. Considering content popularity based on a Zipf-like distribution to solve these problems, we analyze the performance between the user centric CMS and the conventional Web syndication system for normalized costs. Based on the user centric CMS, we implement a social Web TV with device-aware function, which can aggregate, transcode, and deploy content over social networking service independently.
    Journal of Communications and Networks 06/2015; 17(3):296-305. DOI:10.1109/JCN.2015.000052
  • [Show abstract] [Hide abstract]
    ABSTRACT: In mobile social network, it is a critical challenge to select an optimal set of devices to supply high quality service constantly under dynamic network topology and the limit of device capacity in mobile ad-hoc network (MANET). In this paper, a multi-devices composition and maintenance problem is proposed with ubiquitous service model and network model. In addition, a multi-devices composition and maintenance approach with dynamic planning is proposed to deal with this problem, consisting of service discovery, service composition, service monitor and service recover. At last, the simulation is implemented with OPNET and MATLAB and the result shows this mechanism is better applied to support complex ubiquitous service.
    Journal of Communications and Networks 04/2015; 17(2):110-117. DOI:10.1109/JCN.2015.000024
  • [Show abstract] [Hide abstract]
    ABSTRACT: Although mobile applications are an essential characteristic of wireless sensor networks, most existing media access control (MAC) protocols focus primarily on static networks. In these protocols, fixed periodic neighbor discovery and schedule updating are used to connect and synchronize neighbors to provide successful data transmission; however, they cannot adapt to mobile speed variation and degrade the network performance dramatically. In this paper, we propose a mobile-supporting mechanism for MAC protocols, in which the decision to update the neighbors of a mobile node is made adaptively according to the mobile speed. Analysis and simulation results demonstrate that the mechanism efficiently avoids the disconnection of a mobile node from its neighbors and achieves a better performance as compared with fixed periodic neighbor discovery.
    Journal of Communications and Networks 04/2015; 17(2):203-209. DOI:10.1109/JCN.2015.000034
  • [Show abstract] [Hide abstract]
    ABSTRACT: In recent years, electronic commerce and online social networks (OSNs) have experienced fast growth, and as a result, recommendation systems (RSs) have become extremely common. Accuracy and robustness are important performance indexes that characterize customized information or suggestions provided by RSs. However, nefarious users may be present, and they can distort information within the RSs by creating fake identities (Sybils). Although prior research has attempted to mitigate the negative impact of Sybils, the presence of these fake identities remains an unsolved problem. In this paper, we introduce a new weighted link analysis and influence level for RSs resistant to Sybil attacks. Our approach is validated through simulations of a broad range of attacks, and it is found to outperform other state-of-the-art recommendation methods in terms of both accuracy and robustness.
    Journal of Communications and Networks 04/2015; 17(2):145-156. DOI:10.1109/JCN.2015.000028
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose a method to reduce mobile social network services (SNSs) traffic using a mobile integrated SNS gateway (MISG) to improve network communication performance between the mobile client and SNS servers. The gateway connects the client and SNS servers using the contents adapter and the web service adapter and helps to improve communication performance using its cache engine. An integrated SNS application, the user's client, communicates with the gateway server using integrated SNS protocol. In addition, the gateway can alert the client to new SNS contents because of the broker server implemented by the message queuing telemetry transport protocol. We design and develop the modules of the gateway server and the integrated SNS application. We then measure the performance of MISG in terms of content response time and describe the result of the experiment.
    Journal of Communications and Networks 04/2015; 17(2):118-125. DOI:10.1109/JCN.2015.000025
  • [Show abstract] [Hide abstract]
    ABSTRACT: A new block low-density parity-check (Block-LDPC) code based on quadratic permutation polynomials (QPPs) is proposed. The parity-check matrix of the Block-LDPC code is composed of a group of permutation submatrices that correspond to QPPs. The scheme provides a large range of implementable LDPC codes. Indeed, the most popular quasi-cyclic LDPC (QC-LDPC) codes are just a subset of this scheme. Simulation results indicate that the proposed scheme can offer similar error performance and implementation complexity as the popular QC-LDPC codes.
    Journal of Communications and Networks 04/2015; 17(2):157-161. DOI:10.1109/JCN.2015.000029
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we introduce a system and a set of algorithms for disseminating popular content to a large group of wireless clients spread over a wide area. This area is partitioned into multiple cells and there is a base station in each cell which is able to broadcast to the clients within its radio coverage. Dissemination of information in the proposed system is hybrid in nature: Each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Then the clients cooperate by exchanging packets to obtain their desired messages while they are moving arbitrarily over the area. In this paper, fundamental trade-offs between the average information delivery completion time at the clients and different parameters of the system such as bandwidth usage by the base stations, average energy consumption by the clients and the popularity of the spread information are studied. Moreover different heuristic algorithms are proposed to control and maintain a balance over these trade-offs. Also, the more complicated case of multiple sessions where each client is interested in an arbitrary subset of sessions is considered and two variants of the basic dissemination algorithm are proposed. The performance of all the proposed algorithms is evaluated via extensive numerical experiments.
    Journal of Communications and Networks 04/2015; 17(2):133-144. DOI:10.1109/JCN.2015.000027
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper provides an analytic performance evaluation of the bit error rate (BER) of underlay decode-and-forward cognitive networks with best relay selection over Rayleigh multipath fading channels. A generalized BER expression valid for arbitrary operational parameters is firstly presented in the form of a single integral, which is then employed for determining the diversity order and coding gain for different best relay selection scenarios. Furthermore, a novel and highly accurate closed-form approximate BER expression is derived for the specific case where relays are located relatively close to each other. The presented results are rather convenient to handle both analytically and numerically, while they are shown to be in good agreement with results from respective computer simulations. In addition, it is shown that as in the case of conventional relaying networks, the behaviour of underlay relaying cognitive networks with best relay selection depends significantly on the number of involved relays.
    Journal of Communications and Networks 04/2015; 17(2):162-171. DOI:10.1109/JCN.2015.000030