Clustering‐based scheduling: A new class of scheduling algorithms for single‐hop lightwave networks

In wavelength division multiplexing (WDM) star networks, the construction of the transmission schedule is a key issue, which essentially affects the network performance. Up to now, classic scheduling techniques consider the nodes' requests in a sequential service order. However, these approaches are static and do not take into account the individual traffic pattern of each node. Owing to this major drawback, they suffer from low performance, especially when operating under asymmetric traffic. In this paper, a new class of scheduling algorithms for WDM star networks, which is based on the use of clustering techniques, is introduced. According to the proposed Clustering‐Based Scheduling Algorithm (CBSA), the network's nodes are organized into clusters, based on the number of their requests per channel. Then, their transmission priority is defined beginning from the nodes belonging to clusters with higher demands and ending to the nodes of clusters with fewer requests. The main objective of the proposed scheme is to minimize the length of the schedule by rearranging the nodes' service order. Furthermore, the proposed CBSA scheme adopts a prediction mechanism to minimize the computational complexity of the scheduling algorithm. Extensive simulation results are presented, which clearly indicate that the proposed approach leads to a significantly higher throughput‐delay performance when compared with conventional scheduling algorithms. We believe that the proposed clustering‐based approach can be the base of a new generation of high‐performance scheduling algorithms for WDM star networks. Copyright © 2008 John Wiley & Sons, Ltd.     

中国充电器标准化带来的变化

中国政府率先开始了手机充电器的标准化,其目的是让用户更换手机终端后可继续使用原来的充电器,从而通过削减废弃物达到保护环境的目的。     

Information-Bearing Noncoherently Modulated Pilots for MIMO Training

In this correspondence, we deal with noncoherent communications over multiple-input-multiple-output (MIMO) wireless links. For a Rayleigh flat block-fading channel with M transmit- and N receive-antennas and a channel coherence interval of length T, it is well known that for TGtM, or, at high signal-to-noise-ratio (SNR) rhoGt1 and Mlesmin{N,lfloorT/2rfloor}, unitary space-time modulation (USTM) is capacity-achieving, but incurs exponential demodulation complexity in T. On the other hand, conventional training-based schemes that rely on known pilot symbols for channel estimation simplify the receiver design, but they induce certain SNR loss. To achieve desirable tradeoffs between performance and complexity, we propose a novel training approach where USTM symbols over a short length T_tau(tau is a small fraction of T, and recovers part of the SNR loss experienced by the conventional training-based schemes. When rhorarrinfin and TgesT_tau ges2M=2Nrarrinfin, but the ratios alpha=M/T, alpha₁ =T_tau/T are fixed, we obtain analytical expressions of the asymptotic SNR loss for both the conventional and new training-based approaches, serving as a guideline for practical designs     

Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks

In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been proposed for QoS wireline-wireless networking. The basic notion in PFQ is that the bandwidth allocated to a session is proportional to a positive weight _i . Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitations on the range of QoS that can be supported. We develop PFQ with deterministic time-varying weight assignments, and we propose a low-overhead algorithm capable of supporting arbitrary piecewise linear service curves which achieve delay-bandwidth decoupling. Unlike existing service-curve based algorithms, our time-varying PFQ scheme does not exhibit the punishment phenomenon, and allows sessions to exploit the extra bandwidth in under-loaded networks.     

CoopStor: a cooperative reliable and efficient data collection protocol in fault and delay tolerant wireless networks

Wireless Networks - Internet of things consist in the deployment of constrained and battery-powered devices with a radio interface. Most industrial applications require to respect strict...     

Special Issue on the Internet of Things (ISCC 2020)

Journal of Signal Processing Systems -     

Semi-Supervised Deep Learning for Multi-Tissue Segmentation from Multi-Contrast MRI

Journal of Signal Processing Systems - Segmentation of thigh tissues (muscle, fat, inter-muscular adipose tissue (IMAT), bone, and bone marrow) from magnetic resonance imaging (MRI) scans is useful...     

On Supporting Secure Information Distribution in Heterogeneous Systems Using Standard Technologies

This paper presents an integrated security architecture for heterogeneous distributed systems. Based on the MPEG-21 standard data structures and the MPEG-M standard services, the proposed architecture provides a unified, fine-grained solution for protecting each information unit circulated in the system. In this context, a novel scheme for translating the access control rules, initially expressed by means of the standard MPEG-21 Rights Expression Language, into Ciphertext-Policy Attribute-Based Encryption access trees is introduced, thereby enabling offline authorization based on the users’ attributes, also encapsulated and certified using MPEG-21 licenses. The proposed framework provides a detailed approach in all the steps of the information protection process, from attribute acquisition to data encryption and decryption.     

Ultralong 20 Milliseconds Charge Separation Lifetime for Photoilluminated Oligophenylenevinylene–Azafullerene Systems

The synthesis and characterization of oligophenylenevinylene (OPV)–azafullerene (C₅₉N) systems in the form of OPV–C₅₉N donor–acceptor dyad 1 and C₅₉N–OPV–C₅₉N acceptor–donor–acceptor triad 2 is accomplished. Photoinduced electronic interactions between OPV and C₅₉N within 1 and 2 are assessed by UV–vis and photoluminescence. The redox properties of 1 and 2 are investigated, revealing a set of one‐electron oxidation and three one‐electron reduction processes owed to OPV and C₅₉N, respectively. The electrochemical bandgap for 1 and 2 is calculated as 1.44 and 1.53 eV, respectively, and the free energy for the formation of the charge‐separated state for 1 and 2 via the singlet‐excited state of OPV is found negative, proving a thermodynamically favorable the process. Photoexcitation assays are performed in toluene and o‐dichlorobenzene (oDCB) and the reactions are monitored with time‐resolved absorption and emission spectroscopies. Competitive photoinduced energy and electron transfer are identified to occur in both systems, with the former being dominant in 2 . Markedly, the charge‐separated state in oDCB exhibits a much longer lifetime compared to that in toluene, reaching 20 ms for 1 , the highest ever reported value for fullerene‐based materials. These unprecedented results are rationalized by considering conformational phenomena affecting the charge‐separated state.