Search

Between MANET nodes as between Wireless Sensor Networks (WSN) nodes, route information is needed for the data packets sent by the sensor nodes to reach the target node. Route information is provided using proactive and reactive routing protocols, considering performance criteria such as efficiency, delay, packet transmission rate, packet drop rate and energy. In proactive routing protocols, route information is created on a table-based basis, while in reactive routing protocols, route information is created on a request basis. Change in speed as a mobility factor affects the performance of routing protocols positively or negatively. In this study, an experiment was carried out in the NS2 simulation environment on how AODV and DSR reactive routing protocols and DSDV proactive routing protocol perform at different selected speeds in efficiency, delay, packet transmission rate and packet drop rate metrics, and it is aimed to determine which one is the best performer. It is seen that the speed unit with the highest performance of the AODV protocol is 10 m/s (36 km/s), while the speed unit with the most performance of the DSDV and DSR protocols is 5 m/s (18 km/s). In addition, speed points between the selected speeds are also important in MANET. Due to this importance, performance measurements at 6, 7, 8 and 9 m/sec speeds are also presented with the same simulation parameters to be used future works, although they are not included in the comparison in the current study. [ABSTRACT FROM AUTHOR]

In large data center, virtual machines are connected dynamically and data are moved between the physical machines and the virtual machines. With this environment, the Network Layer transfers the packets to the Transport Layer. To improve the security and to increase the speed of the packet transmission in the network layer, packet-filtering is carried out by firewalls based on the decision of routers namely Network addresses, Ports or Protocols. Earlier packet filtering techniques are IP data-gram, Queuing and Scheduling. In order to overcome the limitation in security mechanisms in the above filtering techniques, hashing algorithms are used for analyzing the elements in the packets that are stored in the Hash tables. The hashing algorithms are used in Quotient filter, Bloom filter, Cuckoo filter and Adaptive Cuckoo Filter (ACF). AMDS is termed as An Approximate Membership Data Structures were used to store the fingerprints in cuckoo hash tables. In this paper an attempt is made to improve the searching strategy in Cuckoo filter. Spring constant factor and Leivy Flight theorem is introduced in the searching strategy for best solution identification path. A suit of benchmark functions are employed to verify the performance of network with respect to time, speed and the memory space in the packets transmission. The performance of the Enhanced searching strategy gives better result when compared to ACF. [ABSTRACT FROM AUTHOR]

5G cellular IoT has several advantages compared to other access technologies, enabling operators to serve a wider area and more IoT devices. However, in the urban transportation system, a massive number of vehicles exhaust the available resources in the cell, resulting in excessive load in the 5G cellular network. This article proposes a novel reinforcement learning based V2V routing (RLbR) framework, which offloads non‐realtime traffic into the V2V network and significantly relieves the load of 5G cellular network. Meanwhile, we propose a V2V routing algorithm. Specifically, the Q‐values of neighbouring vehicles are firstly calculated according to the cache factor CF and energy factor EF and evaluate the quality of neighbouring vehicles. Then, the position factor PF is calculated, based on which, the vehicle forwards the data packet. In addition, an environment model is designed to accelerate the convergence of Q‐table. The results show that the RLbR framework brings the highest offload rate compared to the other three frameworks, and simultaneously, the proposed algorithm improves the lifetime of the V2V network and performs well in terms of delivery ratio and average delay. [ABSTRACT FROM AUTHOR]

A burst‐mode receiver chip‐set including a preamplifier and limiting amplifier which can recover both 9.95 Gb/s and 2.49 Gbit/s packets within a short 64.3 ns preamble time is described in this paper. This receiver is also able to settle while receiving a packet that includes over 72 bits of CID. To realise these characteristics, we placed a rapid peak‐detecting AGC in the preamplifier IC and a rapid discharge block between the ICs. Our receiver achieved high sensitivities of –31.2 dBm for 9.95 Gb/s and –36.5 dBm for 2.49 Gb/s within a 64.3 ns preamble and with a payload packet that includes 72 bits of CID. In addition, this receiver meets the ITU‐T G.9807.1 E1 and G.987.2 E1 Recommendations even if a packet includes such long stretches of constant signal level as 768 bits of CID in the case of 9.95 Gb/s and 256 bits of CID in the case of 2.49 Gb/s. [ABSTRACT FROM AUTHOR]

We experimentally and theoretically investigate the wavelength switching dynamics of an injection-seeded Er doped fiber ring laser. The fiber ring laser is seeded by an external cavity laser diode that is amplitude modulated with a long period 50% duty cycle wave form so that the return to steady state can be investigated. It is found that the laser suffers from severe large-amplitude relaxation oscillations and slow decay times that limit the available wavelength switching speed. [ABSTRACT FROM AUTHOR]

There are more and more structured traffic flows (a.k.a coflow) in today's data center networks. Completing a coflow is extremely important for various applications, e.g., MapReduce. To reduce the coflow completion time or CCT, one may increase the link capacity by applying advanced optical circuit switches in data center networks. Due to special features of optical circuit switches, both traffic scheduling and circuit scheduling will influence the CCT. However, previous solutions have some significant limitations: they consider either coflow scheduling, or circuit scheduling for only one optical circuit switch, which are both insufficient. In this paper, we study the integrated coflow and circuit scheduling (GCCS) problem with the objective to minimize the CCT, and prove its NP-hardness. We present an integrated algorithm which includes two steps, coflow scheduling and circuit scheduling, respectively. We also analyze that the proposed algorithm can achieve the approximation ratio $O(h)$O(h) in most practical situations, where $h$h is the maximum number of ports among all lightpaths. Through large-scale simulations, we demonstrate that the integrated solution can significantly reduce the CCT by about 43-70 percent compared with the state-of-the-art coflow scheduler for optical networks. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of clock skew and offset estimation (CSOE) for the IEEE 1588 precision time protocol. Built on the classical two-way message exchange scheme, IEEE 1588 is a prominent synchronization protocol for packet switched networks. Due to the presence of random queuing delays in a packet switched network, the joint recovery of clock skew and offset from the received packet timestamps can be viewed as a statistical estimation problem. Recently, assuming perfect clock skew information, minimax optimum clock offset estimators were developed for IEEE 1588. Building on this work, we first develop joint optimum invariant clock skew and offset estimators for IEEE 1588 for known queuing delay statistics and unlimited computational complexity. We then show that the developed estimators are minimax optimum, i.e., these estimators minimize the maximum skew normalized mean square estimation error over all possible values of the unknown parameters. Minimax optimum estimators that utilize information from past timestamps to improve accuracy are also introduced. The developed optimum estimators provide useful fundamental limits for evaluating the performance of CSOE schemes. These performance limits can aid system designers to develop algorithms with the desired computational complexity that achieve performance close to the performance of the optimum estimators. If a designer finds an approach with a complexity they find acceptable and which provides performance close to the optimum performance, they can use it and know they have near optimum performance. This is precisely the approach used in communications when comparing to capacity. [ABSTRACT FROM AUTHOR]

Coded caching, which could significantly reduce the maximum amount of transmission rate during the peak traffic times in wireless network, has been widely studied recently. Apart from the transmission rate, sub-packetization $F$ reflecting the implementation complexity, is also concerned in coded caching. The grouping method proposed by Shanmugam et al. is well-known and widely used to reduce the sub-packetization level of the coded caching problem. In this paper, we propose a concatenating construction method for coded caching schemes, which generalizes the grouping method. Moreover, we demonstrate the advantage of our method in reducing the transmission rate over the grouping method. In particular, some new explicit schemes are obtained from previously known schemes. From one of these schemes, we can derive all the results by Tang and Ramamoorthy as special cases. Furthermore, the analysis and comparison of these new schemes are also performed. [ABSTRACT FROM AUTHOR]

In high performance data center networks, switching the data from source node to destination node needs a proper signal processing to decode the address bits and switch the data and to avoid contention. In this article, we propose the hardware design for switching the data from one node to other bi‐directionally. The design is verified in an experimental test bed. [ABSTRACT FROM AUTHOR]

Abstract The purpose of this paper is to solve the problem of low recognition accuracy of three-degree-of-freedom myoelectric prosthesis and long training time.According to the nonstationarity of the EMG signal, the wavelet packet is used to decompose the EMG signal and the energy and variance of the wavelet packet coefficients of the four-channel EMG signal are extracted as feature vectors.Then Particle Swarm Optimization(PSO) was combined with improved support vector machine(ISVM) to construct a new model(PSO-ISVM). Under the premise of ensuring the sparseness of the SVM, the slack variables and the decision function was improved to reduce the constraint conditions for solving the optimal face in the quadratic programming. SVM is optimized by the PSO in order to improve the accuracy of the model.The experimental results show that the improved algorithm can effectively identify six kinds of commonly used upper limb movements compared with the traditional SVM. The average recognition rate reaches 90.66% and training time can be shortened 0.042 s. [ABSTRACT FROM AUTHOR]

This paper presents vehicle-to-vehicle telescreen (VVT) and a multicast scheme to disseminate digital signage multimedia services to vehicular ad hoc networks (VANETs). Multimedia dissemination in VANETs is challenging because of the high packet losses (PLs), delays and longer disconnection times, which degrade the network quality of service (QoS) and user quality of experience (QoE). To reduce the PLs and delays, most existing multimedia multicast schemes in VANETs primarily select routes based on longer route expiration times (RET) or lowest path delays. The RET-based schemes suffer less from PLs when there are fewer active multicastings in the network. When the number of active multicastings increases, delay-based schemes suffer less from PLs comparatively. This tradeoff implies to design an adaptive mechanism by mutually complementing the RET-based and delay-based schemes to reduce PLs and delays. In this paper, we propose a multicriteria adaptive opportunistic treecast routing protocol (MAOTRP), which adapts the route selection mechanism according to active multicastings for efficient multimedia dissemination in VVT. The MAOTRP adjusts the weights of route selection parameters, including RET and delays, by considering their contribution in improving packet delivery ratio. MAOTRP extends a tree-based multicast protocol to provide robustness through alternate routes for link failures to reduce PLs. Through several experimental evaluations, we show that the proposed dissemination scheme improves QoS and QoE, and reduces the average disconnection time. [ABSTRACT FROM AUTHOR]

In this paper, the problem of finite-time state estimation for delayed periodic neural networks over multiple-packet transmission is addressed. The components of measurement output are separately transmitted by multiple-packet transmission, and the randomly occurring packet dropouts of different channels are described by mutually independent Bernoulli processes. In order to improve the robustness of the estimator, a non-fragile estimator is designed. In addition, some sufficient criteria are given to ensure that the estimation error system is stochastically finite-time stable and stochastically finite-time bounded, and the gains of non-fragile estimator are then derived based on these results. Finally, simulation results are provided to illustrate the effectiveness of the proposed estimator design approach. [ABSTRACT FROM AUTHOR]

Function packet set is a dynamic model of information law, which introduces function concept into packet set and improves it; function packet set is a function set pair composed of function internal packet set SF¯ and function outer packet set SF; or, (SF¯,SF) is a function packet set. Packet reasoning is a dynamic reasoning generated from packet set, and it’s composed of internal packet reasoning and outer packet reasoning. This paper introduces function into packet reasoning, improves packet reasoning and gives packet information law reasoning; by cross-penetration of function outer packet set with outer packet information law reasoning, the studies on intelligent fusion of outer packet information law and its outer separating are given. The generating of outer packet information law reasoning of intelligent fusion of outer packet information law, intelligent fusion of outer packet information law with attribute conjunctive reduction theorem, outer separating and reducing of intelligent fusion of outer packet information law and outer separating of intelligent fusion of outer packet information law with discovery-application of unknown information law are given in this paper. [ABSTRACT FROM AUTHOR]

We consider networked control systems (NCSs) composed of a linear plant and a linear controller interconnected by packet-based communication channels with communication constraints. We are interested in the setup where direct-feedthrough terms are present in the plant and/or in the controller, a case that is largely ignored in the literature due to its inherent complexity and counterintuitive results in the analysis despite its relevance for important classes of controllers including Proportional–Integral (PI) regulators. This setup calls for a novel stability analysis, for which we take a renewed look at the concept of uniformly globally exponentially stable (UGES) scheduling protocols that turned out to be instrumental in earlier approaches. We provide a generalization of the UGES property, called ( D P , D C ) -UGES with D P ∕ D C being the direct-feedthrough matrices of the plant/controller, respectively, and we present generic conditions on these direct-feedthrough terms D P ∕ D C such that the classical UGES property of scheduling protocols implies ( D P , D C ) -UGES. This allows us to derive conditions leading to a maximally allowable transmission interval (MATI) such that stability of the overall NCS is guaranteed. In addition, it is shown that it is possible to get more tailored results for the well-known sampled-data (SD), round-robin (RR), and try-once-discard (TOD) protocols leading to less conservative conditions on the direct-feedthrough terms than the generic ones. We also introduce new ( D P , D C ) -UGES scheduling protocols, designed to handle the direct-feedthrough terms in a more effective way than existing protocols. Our results are illustrated using the example of a batch reactor. [ABSTRACT FROM AUTHOR]

This paper studies the problem of determining sensor locations in a large sensor network using only relative distance (range) measurement. Based on the barycentric coordinate representation, we propose a totally asynchronous distributed algorithm under DILOC framework due to independence of sensor update instants and unreliable networks with communication delays and packet losses. Through modeling the asynchronous algorithm as a linear difference equation with time-varying delays, we prove that the location estimates of sensors are globally convergent to the true coordinates if: (1) time interval between any two consecutive update instants is bounded from below and above, (2) communication delays and successive packet losses between sensors are finite. Simulation examples are provided to demonstrate the effectiveness of the theoretical result. [ABSTRACT FROM AUTHOR]

In this paper, we address the issue of rule duplication during network updates in software-defined networking (SDN). In SDN, network update involves the controller in sending update packets to desired set of switches, where the update rules are installed. To ensure update consistency, old flow rules are stored until the total update procedure is complete. Higher consumption of ternary content addressable memories (TCAMs) during update increases the cost of network update and decreases the scalability of SDN. In this paper, we propose an approach for consistent update with redundancy reduction, named CURE, which reduces the TCAM usage during update. CURE prioritizes switches according to their usage pattern and schedules updates based on priority zones. The proposed approach guarantees that highly loaded switches are updated first. CURE also maintains packet-level consistency by implementing a multilevel queuing approach. In this framework, each switch in the current update region stores the incoming packets in individual device queues until the switch completes update. Therefore, after the initiation of an update, packets are processed according to new rules only. The results of performance evaluation depict that the average rule space utilization during update using CURE is 29.954% less than using the two-phase update proposed in the existing literature. [ABSTRACT FROM AUTHOR]

The notion of thoughts, ideas and other information fixed in a tangible medium of expression for purposes of reproducing, displaying or communicating the information to others has its origins in antiquity. Both the information itself and its symbolic expression are purely conceptual entities until fixed in a material object. When an intangible means of expression, in which symbolic logic is represented as or converted to machine-independent data structures in digital form, and structured as digital objects (i.e., digital entities), this implementation may be viewed as the logical equivalent of fixation in a material object; and, in this context, we are viewing a block as a particular way of structuring a digital object, and a blockchain in itself as a digital object that incorporates one or more objects. In considering the development of commerce based on the Digital Object (DO) Architecture, an interesting area for exploration and development has been introduced around the concept of mobile computer programs configured as digital objects. This technology may play an important role in the management of software embedded in new Internet of Things (IoT) devices such as microcontrollers, where issues have arisen with respect to the interoperability of such software with other resources in the developing IoT. There have been many efforts over the years to evolve the Internet to embrace new technology, such as the DO Architecture, and we hope this trend continues unabated. [ABSTRACT FROM AUTHOR]

Nowadays chip multiprocessors (CMPs) tend to increase the number of cores, usually implementing a distributed shared last level cache (LLC). The network on chip (NoC) is in charge of interconnecting the cores, memory controller(s) and cache banks, largely impacting memory access latency. Packet switching (PS) is typically used in NoCs but circuit switching (CS) may complement PS achieving higher performance if the circuit is established before its need. In this paper we propose PROSA, an architecture to improve memory access latency by using CS. In PROSA, the coherence protocol steers the circuit setup logic in order to configure circuits before they are needed and only for the time they are required. PROSA uses a clustered router approach where groups of four routers are clustered and their circuit control logic is combined. Based on key design decisions, we present different PROSA versions, analyzing their impact on applications and NoC performance. PROSA is able to reduce applications’ execution time by 35 percent while it significantly reduces average network flit latency by 54 percent, leading to a reduction of miss load (and store) latency of 21 percent (in CMP systems with 64 processors). PROSA needs 8.4 percent more area, but reduces power consumption by 7 percent. [ABSTRACT FROM AUTHOR]

This paper explores the scheduling problem of input-queued switches, based on a new algebraic method of edge coloring called complex coloring. The proposed scheduling algorithm possesses three important features inherent from complex coloring: parallelizability, optimality and rearrangeability. Parallelizability makes the algorithm running very fast in a distributed manner, optimality ensures that the algorithm always returns a proper connection pattern with the minimum number of required colors, and rearrangeability allows partially re-scheduling the existing connection patterns if the traffic patterns only changes slightly. The amortized time complexity of the proposed parallel scheduling algorithm, in terms of the time to compute a matching in a timeslot, is [ABSTRACT FROM AUTHOR]

IP traceback using packet marking technique allows direct traceback of attackers. Under this strategy en route routers inject mark into packets which is later used to unambiguously identify the source of an attack. Star coloring approach allows the mark to be reused, thereby saving bit space and at the same time explicitly identify the attacker. As the Internet structure is unknown, in the present work we propose a distributed approach of assigning color (mark) to routers such that the star color template is followed without consideration of the graph structure. An algorithm is proposed to minimize the color assignment conflict. The convergence of the algorithm is also discussed. Simulation study is presented to support the convergence analysis. [ABSTRACT FROM AUTHOR]

Packet loss is a significant cause of visual impairments in video broadcasting over packet-switched networks. There are several subjective and objective video quality assessment methods focused on the overall perception of video quality. However, less attention has been paid on the visibility of packet loss artifacts appearing in spatially and temporally limited regions of a video sequence. In this paper, we present the results of a subjective study, using a methodology where a video sequence is displayed on a touchscreen and the users tap it in the positions where they observe artifacts. We also analyze the objective features derived from those artifacts, and propose different models for combining those features into an objective metric for assessing the noticeability of the artifacts. The practical results show that the proposed metric predicts visibility of packet loss impairments with a reasonable accuracy. The proposed method can be applied for developing packetization and error recovery schemes to minimize the subjectively experienced distortion in error-prone networked video systems. [ABSTRACT FROM AUTHOR]

In this paper, an all-optical parallel reservoir computing (RC) system with two channels for the optical packet header recognition is proposed and simulated, which is based on a semiconductor ring laser (SRL) with the characteristic of bidirectional light paths. The parallel optical loops are built through the cross-feedback of the bidirectional light paths where every optical loop can independently recognize each injected optical packet header. Two input signals are mapped and recognized simultaneously by training all-optical parallel reservoir, which is attributed to the nonlinear states in the laser. The recognition of optical packet headers for two channels from 4 bits to 32 bits is implemented through the simulation optimizing system parameters and therefore, the optimal recognition error ratio is 0. Since this structure can combine with the wavelength division multiplexing (WDM) optical packet switching network, the wavelength of each channel of optical packet headers for recognition can be different, and a better recognition result can be obtained. [ABSTRACT FROM AUTHOR]

Kurtogram can adaptively select the resonant frequency band, and then the characteristic fault frequency can be obtained by analyzing the selected band. However, the kurtogram is easily affected by random impulses and noise. In recent years, improvements to kurtogram have been concentrated on two aspects: (a) the decomposition method of the frequency band; and (b) the selection index of the optimal frequency band. In this article, a new method called Teager Energy Entropy Ratio Gram (TEERgram) is proposed. The TEER algorithm takes the wavelet packet transform (WPT) as the signal frequency band decomposition method, which can adaptively segment the frequency band and control the noise. At the same time, Teager Energy Entropy Ratio (TEER) is proposed as a computing index for wavelet packet subbands. WPT has better decomposition properties than traditional finite impulse response (FIR) filtering and Fourier decomposition in the kurtogram algorithm. At the same time, TEER has better performance than the envelope spectrum or even the square envelope spectrum. Therefore, the TEERgram method can accurately identify the resonant frequency band under strong background noise. The effectiveness of the proposed method is verified by simulation and experimental analysis. [ABSTRACT FROM AUTHOR]

Securing mobile ad hoc networks (MANET) has been the interest of researchers recently because of its use in important security sectors such as police, rescue teams, and the military. One method to ensure a secure ad hoc network is to identify malicious nodes (hostile) from good nodes by their reputation based on the past experience of packet delivery. In this paper, we explore by applying reputation in various ways the effect to the throughput of a MANET ad hoc network. We simulate four different scenarios where the node reputation is evaluated to choose the most reliable route and eliminate the effect of malicious nodes performing gray-hole attack. One of the applied scenarios is a hybrid method where a sender node takes in consideration the reputation of all the nodes forming a route to choose the most reliable route. We find that by applying the hybrid method the performance of the network is the best and data packets are more likely to be delivered successfully to the intended destination in a very hostile environment. [ABSTRACT FROM AUTHOR]

Today the networks of operational and technological communications are built using digital channel switching systems. In the future, operative technological network (OTN) networks should implement packet-switching systems. The transition to packet technologies leads to a change in the conditions for voice transmission, so it is necessary to analyze the quality of voice transmission in the prospective OTN networks. [ABSTRACT FROM AUTHOR]

Mobility load balancing (MLB) aims to resolve the mismatch between the distribution of network resources and the traffic demands. In this paper, we identify two key policies that characterize jointly an MLB method and propose algorithms for them to stabilize a network and increase the resource efficiency of a network. We adopt the synchronization model observed in nature to devise the first policy called a load assignment policy that determines the amount of loads tradable among cells. We design the second policy called a target selection policy by using the matching theory with preferences to determine the optimal pairs of user equipment (UE) and their new serving cells when the UE in an overloaded cell need to be handed over to its neighboring cells. Through mathematical analysis, we show the stability and the optimality of the proposed MLB method. We also show through simulation studies that the proposed method can distribute loads among cells more evenly than the conventional methods, which increases the total network throughput and the quality of service provided to UE. [ABSTRACT FROM AUTHOR]

To enhance the computational efficiency of mobile devices is helpful to realize the application of Ad Hoc network routing technology for video transmission. However, there are still many problems in the application of video transmission based on Ad Hoc network technology, such as the problem of random packet loss caused by node and channel failure. The routing technology which can meet the requirements of QoS technology can be realized in the process of multimedia video transmission. However, because of the deviation in the process of network information transmission and the role of network dynamic topology, QoS routing in Ad Hoc is provided in the complex process of video transmission. Application of multipath routing protocol based on Ad Hoc can improve the throughput of the network information data and enhance the stability of data transmission. Aiming at the problem of choosing the interference path with different height, a multi-path routing protocol based on Ad Hoc network routing technology was proposed in this paper. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks nowadays find wide variety of applications especially in real time. Innovative methods of energy efficient protocols and transmission reduction techniques keep improving to enhance the lifetime of the sensor nodes as they are powered by non-rechargeable batteries. Multi hop transmission and data aggregation are major techniques to reduce the power spent by the sensor node. In this paper, we propose a new ribbon structure for the existing multi hop WSN topologies with modified media access control mechanism called co-operative MAC. The ribbon structure is proposed to reap benefits of PEGASIS and APTEEN protocols. The low power consumption as in PEGASIS is maintained but the number of data packets transmitted is reduced by half. In the proposed scheme, only one of the two nodes along the parallel path involves in data transmission alternating roles in every cycle of aggregation. However, for values sensed above threshold, the inactive node interferes with normal cycle and gets its data transmitted to the sink node. This algorithm is compared with cluster based and chain based protocols and the simulation results show significant energy savings. [ABSTRACT FROM AUTHOR]

The evolved packet core (EPC) network is the mobile network standardized by the 3rd Generation Partnership Project and represents the recent evolution of mobile networks providing high-speed data rates and on-demand connectivity services. Software-defined networking (SDN) is recently gaining momentum in network research as a new generation networking technique. An SDN-based EPC is expected to introduce gains to the EPC control plane architecture in terms of simplified, and perhaps even software-based, vendor independent infrastructure nodes. In this paper, we propose a novel SDN-based EPC architecture along with the protocol-level detailed implementation and provide a mechanism for identifying information fields exchanged between SDN-EPC entities that maintains correct functionality with minimal impact on the conventional design. Furthermore, we present the first comprehensive network performance evaluation for the SDN-based EPC versus the conventional EPC and provide a comparative analysis of 2 networks performances identifying potential bottlenecks and performance issues. The evaluation focuses on 2 network control operations, namely, the S1-handover and registration operations, taking into account several factors, and assessing performance metrics such as end-to-end delay (E2ED) for completion of the respective control operation, and EPC nodes utilization figures. [ABSTRACT FROM AUTHOR]

The tracking control of H∞ dynamic output feedback is proposed for the fuzzy networked systems of the same category, in which each system is discrete-time nonlinear and is missing measurable data. In other words, the loss of data packet occurs randomly in both the uplink and the downlink. The independent variables that are called the Bernoulli random variables are considered to design the loss of data packets. The method of parallel distributed compensation (PDC) in terms of the T-S fuzzy model is applied to investigate the dynamic controller of tracking control on the systems. Then, it is presented that the analytical H∞ performance of the output error between the reference model and the fuzzy model for the closed-loop system containing dynamic output feedback controller is proven. Furthermore, the achieved sufficient conditions in terms of LMIs ensure that the closed-loop system is stochastically stable in the H∞ sense. Finally, a numerical system is offered to show the effectiveness of the established technique. [ABSTRACT FROM AUTHOR]

This study investigates sliding mode control (SMC) for non-linear networked control systems (NCSs) subject to packet disordering as well as external disturbances. The main objectives of the proposed method are to predict packet disordering and to stabilise the NCSs in case of the unknown packet disordering in the future. Firstly, linearisation of non-linear systems and the technology of adopting the newest control input with a stochastic parameter are employed to model the system as a linear Markovian jumping system. Secondly, with the application of a time series prediction model, the phenomenon of disordering better under the novel measurement is portrayed. Then, robust H∞ SMC is designed by solving the linear matrix inequalities (LMIs). Finally, examples with sampled disordering packets are simulated to illustrate the effectiveness and advantages of the proposed method. [ABSTRACT FROM AUTHOR]

We establish the local Langlands conjecture for small rank general spin groups GSpin4 and GSpin6 as well as their inner forms. We construct appropriate L-packets and prove that these L-packets satisfy the properties expected of them to the extent that the corresponding local factors are available.We are also able to determine the exact sizes of the L-packets in many cases. [ABSTRACT FROM AUTHOR]

RapidIO (http://rapidio.org/) technology is a packet-switched high-performance fabric, which has been under active development since 1997. The technology is used in all 4G/LTE base stations worldwide. RapidIO is also used in embedded systems that require high reliability, low latency, and deterministic operations in a heterogeneous environment. RapidIO has several offloading features in hardware, therefore relieving the CPUs from time- and power-consuming work. Most importantly, it allows for remote direct memory access and thus zero-copy data transfer. In addition, it lends itself readily to integration with field-programmable gate arrays. In this paper, we investigate RapidIO as a technology for high-speed data acquisition (DAQ) networks, in particular the DAQ system of an LHC experiment. We present measurements using a generic multiprotocol event-building emulation tool that was developed for the LHCb experiment. Event building using a local area network, such as the one foreseen for the future LHCb DAQ, puts heavy requirements on the underlying network as all data sources from the collider will want to send to the same destinations at the same time. This may lead to an instantaneous overcommitment of the output buffers of the switches. We will present results from implementing an event building cluster based on RapidIO interconnect, focusing on the bandwidth capabilities of the technology as well as its scalability. [ABSTRACT FROM AUTHOR]

Small scale fading signals resulting from multipath propagation can cause signal strength variations in the range of several dB. Resulting from the fluctuating signal strengths, the wake-up packet reception rate can decrease significantly. Using antenna diversity can greatly mitigate these effects. This article presents a novel wireless sensor node with wake-up receiver that uses an equal-gain diversity method with two antennas in the wake-up path. Summation of the two diversity branch signals is done after the passive demodulation of the incoming signals. As a result, the wireless sensor node requires almost no additional active parts that would increase power consumption. Furthermore, we demonstrate experimentally the improved wake-up robustness and reliability achieved by this diversity technique in a multipath environment. [ABSTRACT FROM AUTHOR]

There are two major issues in spatial crowdsourcing: travel route optimization and control policies. To address the two issues above, we introduce the concept of Pocket switch network (PSN) into the CD-system. First, we formulate a generalized optimization problem into three aspects of connectivity, profit and risk, motivated by the concepts in PSN. Afterward, these three aspects are mathematically described and optimized by a routing algorithm based on dynamic mobility and social graph. This algorithm consists of two parts: social graph extraction and social mobility based routing. Social graph learns the social knowledge of each patrician while social mobility based routing decides the leaving nodes of the passages according to their social graph. Finally, we evaluated the effectiveness and robustness of the proposed method on the realistic traces. The results demonstrated its superior performance in connectivity, profit, and risk. [ABSTRACT FROM AUTHOR]

Field-programmable gate-arrays (FPGAs) have evolved to include embedded memory, high-speed I/O interfaces and processors, making them both more efficient and easier-to-use for compute acceleration and networking applications. However, implementing on-chip communication is still a designer’s burden wherein custom system-level buses are implemented using the fine-grained FPGA logic and interconnect fabric. Instead, we propose augmenting FPGAs with an embedded network-on-chip (NoC) to implement system-level communication. We design custom interfaces to connect a packet-switched NoC to the FPGA fabric and I/Os in a configurable and efficient way and then define the necessary conditions to implement common FPGA design styles with an embedded NoC. Four application case studies highlight the advantages of using an embedded NoC. We show that access latency to external memory can be $\sim$ 1.5$\times$ lower. Our application case study with image compression shows that an embedded NoC improves frequency by 10-80%, reduces utilization of scarce long wires by 40% and makes design easier and more predictable. Additionally, we leverage the embedded NoC in creating a programmable Ethernet switch that can support up to 819 Gb/s-5 $\times$ more switching bandwidth and 3$\times$ lower area compared to previous work. Finally, we design a 400 Gb/s NoC-based packet processor that is very flexible and more efficient than other FPGA-based packet processors. [ABSTRACT FROM AUTHOR]