Journal of Communications and Networks (J COMMUN NETW-S KOR )

Publisher: Hanʼguk Tʻongsin Hakhoe; IEEE Communications Society

Description

Impact factor 0.75

  • Hide impact factor history
     
    Impact factor
  • 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

Publications in this journal

  • Journal of Communications and Networks 10/2014;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.
    Journal of Communications and Networks 08/2014; 16(4):371-377.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we investigate the frequency domain channel estimation for multiple-input multiple-output (MIMO) single-carrier frequency-division multiple-access (SC-FDMA) systems. In MIMO SC-FDMA, code-division multiplexed (CDM) pilots such as cyclic-shifted Zadoff-Chu sequences have been adopted for channel estimation. However, most frequency domain channel estimation schemes were developed based on frequency-division multiplexing of pilots. We first develop a channel estimation error model by using CDM pilots, and then analyze the mean-square error (MSE) of various minimum MSE (MMSE) frequency domain channel estimation techniques. We show that the cascaded one-dimensional robust MMSE (C1D-RMMSE) technique is complexity-efficient, but it suffers from performance degradation due to the channel correlation mismatch when compared to the two-dimensional MMSE (2D-MMSE) technique. To improve the performance of C1D-RMMSE, we design a robust iterative channel estimation (RITCE) with a frequency replacement (FR) algorithm. After deriving the MSE of iterative channel estimation, we optimize the FR algorithm in terms of the MSE. Then, a low-complexity adaptation method is proposed for practical MIMO SC-FDMA systems, wherein FR is performed according to the reliability of the data estimates. Simulation results show that the proposed RITCE technique effectively improves the performance of C1D-RMMSE, thus providing a better performance-complexity tradeoff than 2D-MMSE.
    Journal of Communications and Networks 08/2014; 16(4):447-457.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In the future, an increasing number of heterogeneous networks will be connected with each other. Each of them has its own interest. Existing systems lack good incentive mechanisms to attract more networks to participate in cooperations. In this paper, we design an auction-based incentive mechanism for routing protocols applied in heterogeneous networking which is computationally efficient, individually rational, profitable, and truthful. Through several simulations, we evaluate the performance and validate the properties of our mechanism.
    Journal of Communications and Networks 08/2014; 16(4):458-464.
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider the problem of scheduling communications in wireless sensor networks (WSNs) to ensure battery preservation through the use of the sleeping mode of sensors. We propose a communication protocol for 1-hop WSNs and extend it to multi-hop WSNs through the use of a 1-hop clustering algorithm. We propose to schedule communications in each cluster in a virtual communication ring so as to avoid collisions. Since clusters are cliques, only one sensor can speak or listen in a cluster at a time, and all sensors need to speak in each of their clusters at least once to realize the communication protocol. We model this situation as a mathematical program.
    Journal of Communications and Networks 08/2014; 16(4):421-429.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Replication routing can greatly improve the data delivery performance by enabling multiple replicas of the same packet to be transmitted towards its destination simultaneously. It has been studied extensively recently and is now a widely accepted routing paradigm in delay tolerant networks (DTNs). However, in this field, the issue of how to maximize the utilization efficiency of limited replication quota in a resource-saving manner and therefore making replication routing to be more efficient in networks with limited resources has not received enough attention. In this paper, we propose a DTN routing protocol with back-pressure based replica distribution. Our protocol models the replica distribution problem from a resource allocation perspective and it utilizes the idea of back-pressure algorithm, which can be used for providing efficient network resource allocation for replication quota assignment among encountered nodes. Simulation results demonstrate that the proposed protocol significantly outperforms existing replication routing protocols in terms of packet delay and delivery ratio.
    Journal of Communications and Networks 08/2014; 16(4):378-384.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Despite several years of intense research, the security and cryptography in wireless sensor networks still have a number of ongoing problems. This paper describes how identification (ID)-based node authentication can be used to solve the key agreement problem in a three-layer interaction. The scheme uses a novel security mechanism that considers the characteristics, architecture, and vulnerability of the sensors, and provides an ID-based node authentication that does not require expensive certificates. The scheme describes the routing process using a simple ID suitable for low power and ID exposure, and proposes an ID-based node authentication. This method achieves low-cost communications with an efficient protocol. Results from this study demonstrates that it improves routing performance under different node densities, and reduces the computational cost of key encryption and decryption.
    Journal of Communications and Networks 08/2014; 16(4):363-370.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In recent years, wireless and mobile communication systems have become increasingly popular as the advance of hardware technologies makes the implementation of novel communication technologies feasible. With growing demand of software downloading and mobile multimedia services, the quality of service (QoS) provisioning and the management of network security have been critical in determining the success of future generation wireless communications. This special issue includes cutting-edge research achievements on the provisioning of QoS and security in wireless and mobile networks. The included papers present new research related to theory or practice of all aspects of security issues in ad hoc and sensor networks and QoS provisioning.
    Journal of Communications and Networks 08/2014; 16(4):358-362.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and costly. The most efficient way to increase efficiency is to adopt parallel principles. Purpose of this paper is to present the issue of parallel computing with emphasis on the analysis of parallel systems, the impact of communication delays on their efficiency and on overall execution time. Paper focuses is on finite algorithms for solving systems of linear equations, namely the matrix manipulation (Gauss elimination method, GEM). Algorithms are designed for architectures with shared memory (open multiprocessing, openMP), distributed-memory (message passing interface, MPI) and for their combination (MPI + openMP). The properties of the algorithms were analytically determined and they were experimentally verified. The conclusions are drawn for theory and practice.
    Journal of Communications and Networks 08/2014; 16(4):436-446.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.
    Journal of Communications and Networks 08/2014; 16(4):430-435.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor network (WSN) is considered to be one of the most important research fields for ubiquitous healthcare (u-healthcare) applications. Healthcare systems combined with WSNs have only been introduced by several pioneering researchers. However, most researchers collect physiological data from medical nodes located at static locations and transmit them within a limited communication range between a base station and the medical nodes. In these healthcare systems, the network link can be easily broken owing to the movement of the object nodes. To overcome this issue, in this study, the fast link exchange minimum cost forwarding (FLE-MCF) routing protocol is proposed. This protocol allows real-time multi-hop communication in a healthcare system based on WSN. The protocol is designed for a multi-hop sensor network to rapidly restore the network link when it is broken. The performance of the proposed FLE-MCF protocol is compared with that of a modified minimum cost forwarding (MMCF) protocol. The FLE-MCF protocol shows a good packet delivery rate from/to a fast moving object in a WSN. The designed wearable platform utilizes an adaptive linear prediction filter to reduce the motion artifacts in the original electrocardiogram (ECG) signal. Two filter algorithms used for baseline drift removal are evaluated to check whether real-time execution is possible on our wearable platform. The experiment results shows that the ECG signal filtered by adaptive linear prediction filter recovers from the distorted ECG signal efficiently.
    Journal of Communications and Networks 08/2014; 16(4):465-474.
  • [Show abstract] [Hide abstract]
    ABSTRACT: A hierarchical identity-based broadcast encryption (H-IBBE) scheme is an identity-based broadcast encryption (IBBE) scheme in a hierarchical environment. In order to obtain secure H-IBBE schemes in the quantum era, we propose an H-IBBE scheme based on the learning with errors problem assumption. Our scheme achieves indistinguishability from random under adaptive chosen-plaintext and chosen-identity attacks in the random oracle model.
    Journal of Communications and Networks 06/2014; 16(3):258-263.