• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.265-266
• /
• 2015

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/1 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
• /
• v.17 no.3
• /
• pp.256-264
• /
• 2015

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
• /
• v.17 no.3
• /
• pp.241-246
• /
• 2015

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
• /
• v.17 no.3
• /
• pp.221-230
• /
• 2015

Rateless codes have been shown to be able to provide greater flexibility and efficiency than fixed-rate codes for multicast applications. In the following, we optimize rateless codes for unequal error protection (UEP) for multimedia multicasting to a set of heterogeneous users. The proposed designs have the objectives of providing either guaranteed or best-effort quality of service (QoS). A randomly interleaved rateless encoder is proposed whereby users only need to decode symbols up to their own QoS level. The proposed coder is optimized based on measured transmission properties of standardized raptor codes over wireless channels. It is shown that a guaranteed QoS problem formulation can be transformed into a convex optimization problem, yielding a globally optimal solution. Numerical results demonstrate that the proposed optimized random interleaved UEP rateless coder's performance compares favorably with that of other recently proposed UEP rateless codes.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.209-216
• /
• 2014

Cognitive radio (CR) has been proposed to solve the spectrum utilization problem by dynamically exploiting the unused spectrum. In CR networks, a spectrum selection scheme is an important process to efficiently exploit the spectrum holes, and an efficient channel allocation scheme must be designed to minimize interference to the primary network as well as to achieve better spectrum utilization. In this paper, we propose a multichannel selection algorithm that uses spectrum hole prediction to limit the interference to the primary network and to exploit channel characteristics in order to enhance channel utilization. The proposed scheme considers both the interference length and the channel capacity to limit the interference to primary users and to enhance system performance. By using the proposed scheme, channel utilization is improved whereas the system limits the collision rate of the CR packets.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.155-161
• /
• 2014

Mobility can lead to continual loss of data and service interruptions during communications in multi-hop cognitive radio networks. Mobility of primary users (PUs) or cognitive users (CUs) requires adjustment of multi-hop communications among CUs to avoid any interference to PUs. To provide durable and reliable data routing that ensures continuous network service, we propose mobility-aware cognitive routing (MCR) for multi-hop cognitive radio networks. MCR examines the risk level of each node against interference regions and selects the most reliable path for data delivery using a Markov predictor. Through simulation, we verify that the proposed scheme can avoid route destruction preemptively and achieve reliable data delivery.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.110-120
• /
• 2014

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
• /
• v.16 no.2
• /
• pp.202-208
• /
• 2014

Wireless network information services allow end systems to discover heterogeneous networks and spectrum available for secondary use at or near their current location, helping them to cope with increasing traffic and finite spectrum resources. We propose a unified architecture that allows end systems to find nearby base stations that are using either licensed, shared or unlicensed spectrum across multiple network operators. Our study evaluates the performance and scalability of spatial databases storing base station coverage area geometries. The measurement results indicate that the current spatial databases perform well even when the number of coverage areas is very large. A single logical spatial database would likely be able to satisfy the query load for a large national cellular network. We also observe that coarse geographic divisions can significantly improve query performance.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.321-328
• /
• 2013

In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.252-257
• /
• 2013

To alleviate the damage caused by key exposures, Dodis et al. introduced the notion of key-insulated security where secret keys are periodically updated by using a physically insulated helper key. To decrease the risk of helper key exposures, Hanaoka et al. advocated parallel key-insulated mechanism where distinct helpers are independently used in key updates. In this paper, we propose the first parallel key-insulated signature scheme which is provably secure without resorting to the random oracle methodology. Our scheme not only allows frequent key updating, but also does not increase the risk of helper key exposures.