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

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


  • Impact factor
    Show impact factor history
    Impact factor
  • 5-year impact
  • Cited half-life
  • Immediacy index
  • Eigenfactor
  • Article influence
  • Website
    Journal of Communications and Networks website
  • Other titles
  • ISSN
  • OCLC
  • Material type
  • Document type
    Journal / Magazine / Newspaper

Publications in this journal

  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper focuses on contention-based medium access control (MAC) protocols used in wireless local area networks. We propose a novel MAC protocol called adaptive backoff tuning MAC (ABTMAC) based on IEEE 802.11 distributed coordination function (DCF). In our proposed MAC protocol, we utilize a fixed transmission attempt rate and each node dynamically adjusts its backoff window size considering the current network status. We determined the appropriate transmission attempt rate for both cases where the request-to-send/clear-to-send mechanism was and was not employed. Robustness against performance degradation caused by the difference between desired and actual values of the attempt rate parameter is considered when setting it. The performance of the protocol is evaluated analytically and through simulations. These results indicate that a wireless network utilizing ABTMAC performs better than one using IEEE 802.11 DCF.
    Journal of Communications and Networks 11/2014; 16(3):311-321.
  • 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 01/2014; 16(4):371-377.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Due to the unpredictable nature of channel availability, carrying delay-sensitive traffic in cognitive radio networks (CRNs) is very challenging. Spectrum leasing of radio resources has been proposed in the so called coordinated CRNs to improve the quality of service (QoS) experienced by secondary users (SUs). In this paper, the performance of coordinated CRNs under fixed-rate with hard-delay-constraints traffic is analyzed. For the adequate and fair performance comparison, call admission control strategies with fractional channel reservation to prioritize ongoing secondary calls over new ones are considered. Maximum Erlang capacity is obtained by optimizing the number of reserved channels. Numerical results reveal that system performance strongly depends on the value of the mean secondary service time relative to the mean primary service time. Additionally, numerical results show that, in CRNs without spectrum leasing, there exists a critical utilization factor of the primary resources from which it is not longer possible to guarantee the required QoS of SUs and, therefore, services with hard delay constraints cannot be even supported in CRNs. Thus, spectrum leasing can be essential for CRN operators to provide the QoS demanded by fixed-rate applications with hard delay constraints. Finally, the cost per capacity Erlang as function of both the utilization factor of the primary resources and the maximum allowed number of simultaneously rented channels is evaluated.
    Journal of Communications and Networks 01/2014; 16(2):130-139.
  • [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 01/2014; 16(3):258-263.
  • [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 01/2014; 16(4):447-457.
  • [Show abstract] [Hide abstract]
    ABSTRACT: As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling problem formulation and the structure of its optimal solution within a dynamic programming formulation, a low complexity online scheduling policy is proposed. The policy exploits the existence of thresholds for choosing rate and power levels as a function of stored energy, harvest state and time until the end of the horizon. The policy, which is based on computing an expected threshold, performs close to optimal on a wide range of example energy harvest patterns. Moreover, it achieves higher throughput values for a given delay, than throughput-optimal online policies developed based on infinite-horizon formulations in recent literature. The solution is extended to include ergodic time-varying (fading) channels, and a corresponding low complexity policy is proposed and evaluated for this case as well.
    Journal of Communications and Networks 01/2014; 16(3):393-300.
  • [Show abstract] [Hide abstract]
    ABSTRACT: A key technical challenge in TV white spaces is the efficient spectrum usage without interfering with primary users. This paper considers available spectrum discovery scheme using in-band sensing signal to support super Wi-Fi services effectively. The proposed scheme in this paper adopts non-contiguous orthogonal frequency-division multiplexing (NC-OFDM) to utilize the fragmented channel in TV white space due to microphones while this channel cannot be used in IEEE 802.11af. The proposed solution is a novel available spectrum discovery scheme by exploiting the advantages of a sensing signaling. The proposed method achieves considerable improvement in throughput and delay time. The proposed method can use more subcarriers for transmission by applying NC-OFDM in contrast with the conventional IEEE 802.11af standard. Moreover, the increased number of wireless microphones (WMs) hardly affects the throughput of the proposed method because our proposal only excludes some subcarriers used by WMs. Additionally, the proposed method can cut discovery time down to under 10 ms because it can find available channels in real time by exchanging sensing signal without interference to the WM.
    Journal of Communications and Networks 01/2014; 16(2):238-244.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this research, we study the problem of opportunistic spectrum access (OSA) in a time-varying environment with fading channels, where the channel state is characterized by both channel quality and the occupancy of primary users (PUs). First, a finite-state Markov channel model is introduced to represent a fading channel. Second, by probing channel quality and exploring the activities of PUs jointly, a two-dimensional partially observable Markov decision process framework is proposed for OSA. In addition, a greedy strategy is designed, where a secondary user selects a channel that has the best-expected data transmission rate to maximize the instantaneous reward in the current slot. Compared with the optimal strategy that considers future reward, the greedy strategy brings low complexity and relatively ideal performance. Meanwhile, the spectrum sensing error that causes the collision between a PU and a secondary user (SU) is also discussed. Furthermore, we analyze the multiuser situation in which the proposed single-user strategy is adopted by every SU compared with the previous one. By observing the simulation results, the proposed strategy attains a larger throughput than the previous works under various parameter configurations.
    Journal of Communications and Networks 01/2014; 16(2):217-226.
  • [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 01/2014; 16(4):458-464.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This work investigates two important performance metrics of underlay cooperative cognitive radio (CR) networks: Interference cumulative distribution function of licensed users and outage probability of unlicensed users. These metrics are thoroughly analyzed in realistic operating conditions such as imperfect fading channel information and strict transmit power constraint, which satisfies interference power constraint and maximum transmit power constraint, over Nakagami-m fading channels. Novel closed-form expressions are derived and subsequently validated extensively through comparisons with respective results from computer simulations. The proposed expressions are rather long but straightforward to handle both analytically and numerically since they are expressed in terms of well known built-in functions. In addition, the offered results provide the following technical insights: i) Channel information imperfection degrades considerably the performance of both unlicensed network in terms of OP and licensed network in terms of interference levels; ii) underlay cooperative CR networks experience the outage saturation phenomenon; Hi) the probability that the interference power constraint is satisfied is relatively low and depends significantly on the corresponding fading severity conditions as well as the channel estimation quality; iv) there exists a critical performance trade-off between unlicensed and licensed networks.
    Journal of Communications and Networks 01/2014; 16(1):10-17.
  • [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 01/2014; 16(4):421-429.
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider multiple-input multiple-output decode-and-forward relay systems in Rayleigh fading channels under the partial channel state information (CSI) that the channel statistics of the source-relay (SR) link and the instantaneous CSI of the source-destination and relay-destination links are known at the destination. In this paper, we propose a new near maximum likelihood (near-ML) decoder with two-level pairwise error probability (near-ML-2PEP) which uses the average PEP instead of the exact PEP. Then, we theoretically prove that the near-ML and near-ML-2PEP decoders achieve the maximum diversity, which is confirmed by Monte Carlo simulations. Moreover, we show that the near-ML-2PEP decoder can also achieve the maximum diversity by substituting the average PEP with the values that represent the error performance of the SR link.
    Journal of Communications and Networks 01/2014; 16(1):26-35.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This article proposes a spectrum sharing method which can avoid the mutual interference in both primary and secondary systems. The two systems make them a priority to use two single-dimension orthogonal signals, the real and imaginary pulse amplitude modulation signals, if the primary system is not in outage with this use. A secondary transmitter is selected to be the primary relay and the active secondary source to perform this. This allows a simultaneous spectrum access without any mutual interference. Otherwise, the primary system attempts to use a full two-dimensional signal, the quadrature amplitude modulation signal. If there is no outage with respect to this use, the secondary spectrum access is not allowed. When both of the previous attempts fail, the secondary system is allowed to freely use the spectrum two whole time slots. The analysis and simulation are provided to analyze the outage performance and they validate the considerable improvement of the proposed method as compared to the conventional one.
    Journal of Communications and Networks 01/2014; 16(2):110-120.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Transmission control protocol friendly rate control (TFRC) is designed to mainly provide optimal service for unicast applications, such as multimedia streaming in the best-effort Internet environment. However, high bandwidth networks with large delays present an environment where TFRC may have a problem in utilizing the full bandwidth. TFRC inherits the slow-start mechanism of TCP Reno, but this is a time-consuming process that may require many round-trip-times (RTTs), until an appropriate sending rate is reached. Another disadvantage inherited from TCP Reno is the RTT-unfairness problem, which severely affects the performance of long-RTT flows. In this paper, we suggest enhanced TFRC for high quality video streaming over high bandwidth delay product networks. First, we propose a fast startup scheme that increases the data rate more aggressively than the slow-start, while mitigating the overshooting problem. Second, we propose a bandwidth estimation method to achieve more equitable bandwidth allocations among streaming flows that compete for the same narrow link with different RTTs. Finally, we improve the responsiveness of TFRC in the presence of severe congestion. Simulation results have shown that our proposal can achieve a fast startup and provide fairness with competing flows compared to the original TFRC.
    Journal of Communications and Networks 01/2014; 16(3):344-354.