Power-efficient M-ary PSSK Communications with Uncertain Phase Errors

M-ary phase-silence-shift-keying (PSSK), one of power-efficient modulation schemes, has enhanced symbol error rate (SER) performance by 6 dB compared with that of the conventional phase-shift-keying (PSK). Phase tracking problem of the PSSK with phase-locked-loop (PLL) is discussed in this paper. Capacity of the PSSK for the additive white Gaussian noise (AWGN) channel and Rayleigh fading channel is analyzed. Capacity loss of the PSSK due to the PLL is small, which tells us that the PSSK demodulator can be practically implemented.     

5G Based on Cognitive Radio

Both the cognitive radio (CR) and the fifth generation of cellular wireless standards (5G) are considered to be the future technologies: on one hand, CR offers the possibility to significantly increase the spectrum efficiency, by smart secondary users (CR users) using the free licensed users spectrum holes; on the other hand, the 5G implies the whole wireless world interconnection (WISDOM—Wireless Innovative System for Dynamic Operating Megacommunications concept), together with very high data rates Quality of Service (QoS) service applications. In this paper, they are combined together into a “CR based 5G”. With this aim, two novel ideas are advanced: the 5G terminal is a CR terminal and the CR technology is chosen for WISDOM concept. Thus, the 5G takes CR flexibility and adaptability and makes the first step through a commercial and tangible form.     

A Distributed Energy-Aware Routing Protocol for Underwater Wireless Sensor Networks

The design of routing protocols for Underwater Wireless Sensor Networks (UWSNs) poses many challenges due to the intrinsic properties of underwater environments. In this paper we present DUCS (Distributed Underwater Clustering Scheme), a new GPS-free routing protocol that does not use flooding techniques, minimizes the proactive routing message exchange and uses data aggregation to eliminate redundant information. Besides, DUCS assumes random node mobility and compensates the high propagation delays of the underwater medium using a continually adjusted timing advance combined with guard time values to minimize data loss. The theoretical and simulation studies carried out demonstrate its effectiveness.     

Aggregation convergecast scheduling in wireless sensor networks

We consider the problem of scheduling in wireless sensor networks for the purposes of aggregation convergecast. We observe that existing schemes adopt essentially a two phase approach, consisting of, first, a tree construction and, second, a scheduling phase. Following a similar approach, we propose two new improvements, one to each of the two phases. Starting with a new lower bound on the schedule length, we make use of it in the tree construction phase. The tree construction phase consists of solutions to instances of bipartite graph semi-matchings. The scheduling phase is a weight-based priority scheme that obeys dependency (tree) and interference constraints. Our extensive experiments show that, overall, our proposed solution not only outperforms all previously proposed solutions in terms of schedule length, but it also significantly extends the network’s lifetime.     

Towards the realistic planning of GMPLS-based optical transport networks

The multi-granular switching concept defined in Generalized Multiprotocol Label Switching (GMPLS) is expected to be a future-proof solution for mitigating the Optical Crossconnet scalability problems associated with the skyrocketing growth of traffic in optical transport networks. In this paper, we address the problem of planning the GMPLS-based (or multi-granular) transport network with color (or label) conversion and signal regeneration capabilities. The objective of the problem is to minimize the total weighted port count in the transport network. The novelty of this problem lies in the incorporation of the following for the first time: (1) considering all traffic granularities defined in GMPLS; (2) allowing wavelength, waveband, and fiber conversions; (3) considering the optical-reach limitation of optical signals; and (4) customizing the optical reach of all-optical paths. Due to the computational complexity of the problem, we propose various efficient heuristics that are capable of solving large-sized problems in a reasonable amount of time. In order to achieve the best possible solution to the planning problem, a comprehensive evaluation of different heuristic variations through illustrative examples and simulations is conducted. The results also provide valuable insights into many issues that can contribute to further research and development in this area.