Journal of Communications and Networks 

About: Journal of Communications and Networks is an academic journal published by Institute of Electrical and Electronics Engineers. The journal publishes majorly in the area(s): Computer science & Wireless network. It has an ISSN identifier of 1229-2370. It is also open access. Over the lifetime, 1439 publications have been published receiving 21470 citations. The journal is also known as: JCN (Online) & JCN (Print).

Compressive sensing: From theory to applications, a survey

Abstract: Compressive sensing (CS) is a novel sampling paradigm that samples signals in a much more efficient way than the established Nyquist sampling theorem. CS has recently gained a lot of attention due to its exploitation of signal sparsity. Sparsity, an inherent characteristic of many natural signals, enables the signal to be stored in few samples and subsequently be recovered accurately, courtesy of CS. This article gives a brief background on the origins of this idea, reviews the basic mathematical foundation of the theory and then goes on to highlight different areas of its application with a major emphasis on communications and network domain. Finally, the survey concludes by identifying new areas of research where CS could be beneficial.

Emerging challenges: Mobile networking for “Smart Dust”

Abstract: Large-scale networks of wireless sensors are becoming increasingly tractable. Advances in hardware technology and engineering design have led to dramatic reductions in size, power consumption and cost for digital circuitry, wireless communications and Micro ElectroMechanical Systems (MEMS). This has enabled very compact, autonomous and mobile nodes, each containing one or more sensors, computation and communication capabilities, and a power supply. The missing ingredient is the networking and applications layers needed to harness this revolutionary capability into a complete system. We review the key elements of the emergent technology of “Smart Dust” and outline the research challenges they present to the mobile networking and systems community, which must provide coherent connectivity to large numbers of mobile network nodes co-located within a small volume.

Effects of channel aging in massive MIMO systems

Abstract: Multiple-input multiple-output (MIMO) communication may provide high spectral efficiency through the deployment of a very large number of antenna elements at the base stations. The gains from massive MIMO communication come from the use of multiuser MIMO on the uplink and downlink, but with a large excess of antennas at the base station compared to the number of served users. Initial work on massive MIMO did not fully address several practical issues associated with its deployment. This paper considers the impact of channel aging on the performance of massive MIMO systems. The effects of channel variation are characterized as a function of different system parameters assuming a simple model for the channel time variations at the transmitter. Channel prediction is proposed to overcome channel aging effects. The analytical results on aging show how capacity is lost due to time variation in the channel. Numerical results in a multiceli network show that massive MIMO works even with some channel variation and that channel prediction could partially overcome channel aging effects.

Optimal packet scheduling in a multiple access channel with energy harvesting transmitters

Abstract: In this paper, we investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the packet arrivals, we assume that packets have already arrived and are ready to be transmitted at the transmitter before the transmission starts. Our goal is to minimize the time by which all packets from both users are delivered to the destination through controlling the transmission powers and transmission rates of both users. We first develop a generalized iterative backward waterfilling algorithm to characterize the maximum departure region of the transmitters for any given deadline T. Then, based on the sequence of maximum departure regions at energy arrival instants, we decompose the transmission completion time minimization problem into convex optimization problems and solve the overall problem efficiently.

Distributed heuristics for connected dominating sets in wireless ad hoc networks

Abstract: A connected dominating set (CDS) for a graph G(V, E) is a subset V' of V, such that each node in V — V' is adjacent to some node in V', and V' induces a connected subgraph. CDSs have been proposed as a virtual backbone for routing in wireless ad hoc networks. However, it is NP-hard to find a minimum connected dominating set (MCDS). An approximation algorithm for MCDS in general graphs has been proposed in the literature with performance guarantee of 3 + In Δ where Δ is the maximal nodal degree [1]. This algorithm has been implemented in distributed manner in wireless networks [2]–[4]. This distributed implementation suffers from high time and message complexity, and the performance ratio remains 3 + In Δ. Another distributed algorithm has been developed in [5], with performance ratio of Θ(n). Both algorithms require two-hop neighborhood knowledge and a message length of Ω (Δ). On the other hand, wireless ad hoc networks have a unique geometric nature, which can be modeled as a unit-disk graph (UDG), and thus admits heuristics with better performance guarantee. In this paper we propose two destributed heuristics with constant performance ratios. The time and message complexity for any of these algorithms is O(n), and O(n log n), respectively. Both of these algorithms require only single-hop neighborhood knowledge, and a message length of O (1).