An efficient in‐network caching decision algorithm for Internet of things

Recently, content‐centric networking (CCN) has become one of the important technologies for enabling the future networks. Along with its recognized potentialities as a content retrieval and dissemination solution, CCN has been also recently considered as a promising architecture for the Internet of things (IoT), because of 2 main features such as named‐based routing and in‐network caching. However, IoT is characterized by challenging features: small storage capacity of resource‐constrained devices due to cost and limitation of energy and especially transient data that impose stringent requirements on the information freshness. As a consequence, the intrinsic caching mechanisms existing in CCN approach do not well suit IoT domains; hence, providing a specific caching policy at intermediate nodes is a very challenging task. This paper proposes an effective multiattribute in‐network caching decision algorithm that performs a caching strategy in CCN‐IoT network by considering a set of crucial attributes including the content store size, hop count, particularly key temporal properties like data freshness, and the node energy level. Simulation results proved that our proposed approach outperforms 2 cache management schemes (probabilistic least recently used and AlwaysCache–first in first out in terms of improving total hit rate, reducing data retrieval delay, and enhancing content reusability in IoT environment).     

Differential Game for Distributed Power Control in Device-to-Device Communications Underlaying Cellular Networks

Wireless Personal Communications - In the formulating of power control for wireless networks, the radio channel is commonly formulated using static models of optimization or game theory. In these...     

End‐to‐end security‐reliability analysis of multi‐hop cognitive relaying protocol with TAS/SC‐based primary communication,total interference constraint and asymmetric fading channels

In this paper, we analyze the tradeoff between outage probability (OP) and intercept probability (IP) for a multi‐hop relaying scheme in cognitive radio (CR) networks. In the proposed protocol, a multi‐antenna primary transmitter (PT) communicates with a multi‐antenna primary receiver (PR), using transmit antenna selection (TAS) / selection combining (SC) technique, while a secondary source attempts to transmit its data to a secondary destination via a multi‐hop approach in presence of a secondary eavesdropper. The secondary transmitters such as source and relays have to adjust their transmit power to satisfy total interference constraint given by PR. We consider an asymmetric fading channel model, where the secondary channels are Rician fading, while the remaining ones experience the Rayleigh fading. Moreover, an optimal interference allocation method is proposed to minimize OP of the primary network. For the secondary network, we derive exact expressions of end‐to‐end OP and IP which are verified by Monte Carlo simulations.     

Identification of adequate neurally adjusted ventilatory assist (NAVA) during systematic increases in the NAVA level

Neurally adjusted ventilatory assist (NAVA) delivers airway pressure (P(aw)) in proportion to the electrical activity of the diaphragm (EAdi) using an adjustable proportionality constant (NAVA level, cm·H(2)O/μV). During systematic increases in the NAVA level, feedback-controlled down-regulation of the EAdi results in a characteristic two-phased response in P(aw) and tidal volume (Vt). The transition from the 1st to the 2nd response phase allows identification of adequate unloading of the respiratory muscles with NAVA (NAVA(AL)). We aimed to develop and validate a mathematical algorithm to identify NAVA(AL). P(aw), Vt, and EAdi were recorded while systematically increasing the NAVA level in 19 adult patients. In a multistep approach, inspiratory P(aw) peaks were first identified by dividing the EAdi into inspiratory portions using Gaussian mixture modeling. Two polynomials were then fitted onto the curves of both P(aw) peaks and Vt. The beginning of the P(aw) and Vt plateaus, and thus NAVA(AL), was identified at the minimum of squared polynomial derivative and polynomial fitting errors. A graphical user interface was developed in the Matlab computing environment. Median NAVA(AL) visually estimated by 18 independent physicians was 2.7 (range 0.4 to 5.8) cm·H(2)O/μV and identified by our model was 2.6 (range 0.6 to 5.0) cm·H(2)O/μV. NAVA(AL) identified by our model was below the range of visually estimated NAVA(AL) in two instances and was above in one instance. We conclude that our model identifies NAVA(AL) in most instances with acceptable accuracy for application in clinical routine and research.     

Characterization of charge trapping in SiO2/Al2O3 dielectric stacks by pulsed C–V technique

In this work, charge trapping in SiO₂/Al₂O₃ dielectric stacks is characterized by means of pulsed capacitance–voltage measurements. The proposed technique strongly reduces the measurement time and, as a consequence, the impact of charge trapping on the measurement results. Flat band voltage shift and fast current transient during short stress pulses are systematically monitored and the centroid and the amount of the trapped charge are extracted using a first-order model.     

On teletraffic applications to OBS

We provide teletraffic models for loss probability evaluation of optical burst switching (OBS). We show that the popular Engset formula is not exact for OBS modeling and demonstrate that in certain cases it is not appropriate. A new exact model is provided. The various models are compared using numerical results for various OBS alternatives with and without burst segmentation.     

Design of ring convolutional trellis codes for MAP decoding of MPEG-4 images

We propose a trellis-coded modulation system using continuous-phase frequency-shift keying (CPFSK) and ring convolutional codes for transmitting the bits generated by an embedded zerotree wavelet encoder. Improved performance is achieved by using maximum a posteriori decoding of the zerotree symbols, and ring convolutional trellis codes are determined for this decoding method. The CPFSK transmitter is decomposed into a memoryless modulator and a continuous phase encoder over the ring of integers modulo 4; the latter is combined with a polynomial convolutional encoder over the same ring. In the code design process, a search is made of the combined trellis, where the branch metrics are modified to include the source transition matrix. Simulation results of image transmission are provided using the optimized system, including mismatched channel cases.     

Very high-order microring resonator filters for WDM applications

High-order microring resonators having from 1 to 11 coupled cavities are demonstrated. These filters exhibit low loss, flat tops, and out-of-band rejection ratios that can exceed 80 dB. They achieve performance that is suitable for commercial applications.     

Service level negotiation andcops-sls protocol

The Internet is a set of interconnected domains in which different QoS technologies can be deployed. The dynamic provision of end-to-end QoS over heterogeneousip networks assumes the negotiation of mutually acceptablesla. This paper presents the concept of intra-, inter- and multiple-domain service level negotiation using thecops-sls protocol. The negotiation process gives different parties in the negotiation the ability to agree upon the service level that a data stream can obtain, along with the permissible pricing of the service.