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

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

Description

  • Impact factor
    0.75
    Show 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

  • [Show abstract] [Hide abstract]
    ABSTRACT: Radio frequency (RF) jamming is a denial of service attack targeted at wireless networks. In resource-hungry scenarios with constant traffic demand, jamming can create connectivity problems and seriously affect communication. Therefore, the vulnerabilities of wireless networks must be studied. In this study, we investigate a particular type of RF jamming that exploits the semantics of physical (PHY) andmedium access control (MAC) layer protocols. This can be extended to any wireless communication network whose protocol characteristics and operating frequencies are known to the attacker. We propose two efficient jamming techniques: A low-data-rate random jamming and a shot-noise based protocol-aware RF jamming. Both techniques use shot-noise pulses to disrupt ongoing transmission ensuring they are energy efficient, and they significantly reduce the detection probability of the jammer. Further, we derived the tight upper bound on the duration and the number of shot-noise pulses for Wi-Fi, GSM, and WiMax networks. The proposed model takes consider the channel access mechanism employed at the MAC layer, data transmission rate, PHY/MAC layer modulation and channel coding schemes. Moreover, we analyze the effect of different packet sizes on the proposed jamming methodologies. The proposed jamming attack models have been experimentally evaluated for 802.11b networks on an actual testbed environment by transmitting data packets of varying sizes. The achieved results clearly demonstrate a considerable increase in the overall jamming efficiency of the proposed protocolaware jammer in terms of packet delivery ratio, energy expenditure and detection probabilities over contemporary jammingmethods provided in the literature.
    Journal of Communications and Networks 08/2014; 16(4):397-406.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose an anti-interference cooperative spectrum sharing strategy for cognitive system, in which a secondary system can operate on the same spectrum of a primary system. Specifically, the primary system leases a fraction of its transmission time to the secondary system in exchange for cooperation to achieve the target rate. To gain access to the spectrum of the primary system, the secondary system needs to allocate a fraction of bandwidth to help forward the primary signal. As a reward, the secondary system can use the remaining bandwidth to transmit its own signal. The secondary system uses different bandwidth to transmit the primary and its own signal. Thus, there will be no interference felt at primary and secondary systems. We study the joint optimization of time and bandwidth allocation such that the transmission rate of the secondary system is maximized, while guaranteeing the primary system, as a higher priority, to achieve its target transmission rate. Numerical results show that the secondary system can gain significant improvement with the proposed strategy.
    Journal of Communications and Networks 01/2014; 16(2):140-145.
  • [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 01/2014; 16(3):311-321.
  • [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 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: 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: 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: 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: Spectrum sensing is a key technical challenge for cognitive radio (CR). It is well known that multicycle cyclostation-arity (MC) detection is a powerful method for spectrum sensing. However, a conventional MC detector is difficult to implement because of its high computational complexity. This paper considers reducing computational complexity by simplifying the test statistic of a conventional MC detector. On the basis of this simplification process, an improved MC detector is proposed. Compared with the conventional detector, the proposed detector has low-computational complexity and high-accuracy sensing performance. Subsequently, the sensing performance is further investigated for the cases of Rayleigh, Nakagami-m, Rician, and Rayleigh fading and lognormal shadowing channels. Furthermore, square-law combining (SLC) is introduced to improve the detection capability in fading and shadowing environments. The corresponding closed-form expressions of average detection probability are derived for each case by the moment generation function (MGF) and contour integral approaches. Finally, illustrative and analytical results show the efficiency and reliability of the proposed detector and the improvement in sensing performance by SLC in multipath fading and lognormal shadowing environments.
    Journal of Communications and Networks 01/2014; 16(2):162-171.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This article presents a novel cooperative spectrum sharing (CSS) scheme. The primary transmitter transmits a complex Quadrature amplitude modulation (QAM) signal in the first phase, and CSS occurs in the second phase. The secondary transmitter with the largest forwarding channel gain among the nodes that successfully decode the primary signal in the first phase is selected for CSS. This selected node employs a pulse-amplitude modulation (PAM) signal for primary information message (IM) instead of the QAM signal, and it employs a modified PAM signal for the secondary IM. The proposed modified PAM signal depends on the amplitude of the primary PAM signal. This method results in no mutual interference and negligible primary interference constraint and allows a higher degree of exploitation of spatial diversity, thus enabling increase in secondary power to improve primary transmission. The outage performance is enhanced in both the primary and secondary systems. The critical region, in which the primary outage performance is enhanced with the proposed CSS scheme, can be adjusted and widened by varying either the modulation cooperation sharing factor or the number of secondary transmitters.
    Journal of Communications and Networks 01/2014; 16(3):280-292.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios; wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a Hn factor approximation to the theoretical optimum, where Hn = 1 + 1/2 + ?? + 1/n = ln(n) + 1, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms.
    Journal of Communications and Networks 01/2014; 16(3):335-343.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Multimedia content is very sensitive to packet loss and therefore multimedia streams are typically protected against packet loss, either by supporting retransmission requests or by adding redundant forward error correction (FEC) data. However, the redundant FEC information introduces significant additional bandwidth requirements, as compared to the bitrate of the original video stream. Especially on wireless and mobile networks, bandwidth availability is limited and variable. In this article, an adaptive FEC (A-FEC) system is presented whereby the redundancy rate is dynamically adjusted to the packet loss, based on feedback messages from the client. We present a statistical model of our A-FEC system and validate the proposed system under different packet loss conditions and loss probabilities. The experimental results show that 57??95% bandwidth gain can be achieved compared with a static FEC approach.
    Journal of Communications and Networks 01/2014; 16(3):322-334.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Since the day the Internet became a common and reliable mechanism for communication and data transfer, security officers and enthusiasts rallied to enforce security standards on data transported over the globe. Whenever a user tries communicating with another recipient on the Internet, vital information is sent over different networks until the information is dropped, intercepted, or normally reaches the recipient. Critical information traversing networks is usually encrypted. In order to conceal the sender's identity, different implementations have proven successful ?? one of which is the invention of anonymous networks. This paper thoroughly investigates one of the most common and existing techniques used during data communication for avoiding traffic analysis as well as assuring data integrity ?? the onion router (TOR). The paper also scrupulously presents the benefits and drawbacks of TOR
    Journal of Communications and Networks 01/2014; 16(4):415-420.
  • [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 01/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 01/2014; 16(4):363-370.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The trend of an increasing demand for a high-qualityuser experience, coupled with a shortage of radio resources, has necessitated more advanced wireless techniques to cooperatively achieve the required quality-of-experience enhancement. In this study, we investigate the critical problem of rate splitting in heterogeneous cellular networks, where concurrent transmission, for instance, the coordinated multipoint transmission and reception of LTE-A systems, shows promise for improvement of network-wide capacity and the user experience. Unlike most current studies, which only deal with spectral efficiency enhancement, we implement an optimal rate splitting strategy to improve both spectral efficiency and energy efficiency by exploring and exploiting cooperation diversity. First, we introduce the motivation for our proposed algorithm, and then employ the typical cooperative bargaining game to formulate the problem. Next, we derive the best response function by analyzing the dual problem of the defined primal problem. The existence and uniqueness of the proposed cooperative bargaining equilibrium are proved, and more importantly, a distributed algorithm is designed to approach the optimal unique solution under mild conditions. Finally, numerical results show a performance improvement for our proposed distributed cooperative rate splitting algorithm.
    Journal of Communications and Networks 01/2014; 16(2):121-129.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we investigate the fundamental performance limits of the cooperative sensing using energy detection by considering the unlimited number of sensing nodes. Although a lot of cognitive radio research so far proposed various uses of energy detection because of its simplicity, the performance limits of energy detection have not been studied when a large number of sensing nodes exist. First, we show that when the sensing nodes see the independent and identically distributed channel conditions, then as the number of sensing nodes N goes to infinity, the OR rule of hard decision achieves zero of false alarm Pf for any given target probability of detection $bar {P_d}$ irrespective of the non-zero received primary user signal to noise ratio ??. Second, we show that under the same condition, when the AND rule of hard decision is used, there exists a lower bound of Pf. Interestingly, however, for given $bar {P_d}$, Pf goes to 1 as N goes to infinity. Third, we show that when the soft decision is used, there exists a way of achieving 100% utilization of secondary user, i.e., the sensing time overhead ratio goes to zero so does Pf. We verify our analyses by performing extensive simulations of the proposed unlimited cooperative sensing. Finally, we suggest a way of incorporating the unlimited cooperative sensing into a practical cellular system such as long term evolution-advanced by exploiting the existing frame structure of absolute blank subframe to implement the in-band sensing.
    Journal of Communications and Networks 01/2014; 16(2):172-182.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Exploiting the energy-delay tradeoff for energy saving is critical for developing green wireless communication systems. In this paper, we investigate the delay-constrained energy-efficient packet transmission. We aim to minimize the energy consumption of multiple randomly arrived packets in an additive white Gaussian noise channel subject to individual packet delay constraints, by taking into account the practical on-off circuit power consumption at the transmitter. First, we consider the offline case, by assuming that the full packet arrival information is known a priori at the transmitter, and formulate the energy minimization problem as a non-convex optimization problem. By exploiting the specific problem structure, we propose an efficient scheduling algorithm to obtain the globally optimal solution. It is shown that the optimal solution consists of two types of scheduling intervals, namely "selected-off" and "always-on" intervals, which correspond to bits-per-joule energy efficiency maximization and "lazy scheduling" rate allocation, respectively. Next, we consider the practical online case where only causal packet arrival information is available. Inspired by the optimal offline solution, we propose a new online scheme. It is shown by simulations that the proposed online scheme has a comparable performance with the optimal offline one and outperforms the design without considering on-off circuit power as well as the other heuristically designed online schemes.
    Journal of Communications and Networks 01/2014; 16(1):36-44.
  • [Show abstract] [Hide abstract]
    ABSTRACT: A novel method for extracting frequency slippage signal from radar full pulse sequence is presented. For the radar full pulse sequence received by radar interception receiver, radio frequency (RF) and time of arrival (TOA) of all pulses constitute a two-dimensional information sequence. In a complex and intensive electromagnetic environment, the TOA of pulses is distributed unevenly, randomly, and in a nonstationary manner, preventing existing methods from directly analyzing such time series and effectively extracting certain signal features. This work applies Gaussian noise insertion and structure function to the TOA-RF information sequence respectively such that the equalization of time intervals and correlation processing are accomplished. The components with different frequencies in structure function series are separated using empirical mode decomposition. Additionally, a chaos detection model based on the Duffing equation is introduced to determine the useful component and extract the changing features of RF. Experimental results indicate that the proposed methodology can successfully extract the slippage signal effectively in the case that multiple radar pulse sequences overlap.
    Journal of Communications and Networks 01/2014; 16(1):92-97.

Related Journals