The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Controller Area Network (CAN) has been the de facto standard in the automotive industry for the past two decades, and recently CAN with flexible data-rate has been standardized, which achieves higher speed. Further improvements are possible by exploiting the peculiar physical layer of CAN to perform distributed operations among network nodes. In this paper a proposal is made for an extension to the...
We study the problem of quantized consensus where some agents are subject to faults and attacks and might make updates arbitrarily. The network consists of integer-valued agents under directed communication links. The misbehaving agents are assumed to be omniscient and may try to prevent the normal agents to reach consensus. We show that consensus can be achieved among the normal agents via a simple...
In this paper, we study the robust consensus problem of a network of general discrete-time linear agents coordinating through unreliable communication channels. Two neighboring agents exchange information via a communication channel, which is modeled in this paper as an ideal transmission system subject to a multiplicative stochastic uncertainty. This uncertain channel model includes the commonly...
This paper addresses the robust consensus reliable control protocol design problem against actuator faults for linear parameter-varying multi-agent systems. First, the actuator faults are modeled via a polytopic uncertainty method. Second, a distributed observer is designed for the single agent by sharing the communication network sensors to estimate the state information. Then by these estimated...
Seamless host mobility is vital to future network mobility, and has been an active research area for a long time. Much research focuses on the performance of the data plane. In this paper, we present comprehensive analyses on the control (signalling) plane in the IETF Mobile IPv6, and compare it with the IRTF Identifier-Locator Network Protocol (ILNP). The control plane behaviour is important in order...
In this paper we focused on authentication on low-cost devices. We proposed a new mutual authentication protocol suitable for implementation on low-cost devices. The proposed protocol is simple and uses only appropriate low-cost Hash functions and Physical unclonable functions (PUFs). The proposed protocol enables secure transmission of information from the one user to the another user. For this purpose...
Continuously enriched distributed systems in data centers generate much network traffic in push-style one-to-many group mode, raising new requirements for multicast transport in terms of efficiency and robustness. Existing reliable multicast solutions, which suffer from low robustness and inefficiency in either host-side protocols or multicast routing, are not suitable for data centers. In order to...
Code identity is a fundamental concept for authenticated operations in Trusted Computing. In today's approach, the overhead of assigning an identity to a protected service increases linearly with the service code size. In addition, service code size continues to grow to accommodate richer services. This trend negatively impacts either the security or the efficiency of current protocols for trusted...
The 12th Workshop on Silicon Errors in Logic -- System Effects (SELSE) was held on March 29 -- 30, 2016, in Austin, Texas, USA. Detailed information about SELSE 2016 and previous SELSE workshops, including links to presentations, is available at http://www.selse.org. Three papers were selected as the Best of SELSE papers and are presented in this special DSN session.
The problem of enforcing the state variables of a network of heterogenous dynamical systems to agree on a predefined function of the corresponding initial conditions (e.g., the average value) is a problematic challenge when perturbations affect agents' dynamics. When the linear consensus algorithms are used, such uncertainties shift the equilibrium of the network with respect to the expected “nominal”...
A crucial feature in implementing the next generation of smart grids is how to introduce self-healing capabilities allowing to ensure a high quality of service to the users. We show how distributed communication protocols can enrich complex networks with self-healing capabilities; an obvious field of applications are infrastructural networks. In particular, we consider the case where the presence...
Large-scale multimedia data are being exponentially generated, stored and processed continuously nowadays. Along with the data explosion, the data owner is highly motivated to outsource his/her huge amount of data storage and computation-expensive processing jobs to the cloud by leveraging its abundant resources for cost reduction and flexibility. Despite the fascinating advantages, security and privacy...
Edge-computing is one of the most promising techniques to leverage the excess capacity that exists at users' premises. Unfortunately, edge-computing may be vulnerable to free-riding, i.e., to nodes that attempt to benefit from the system without providing any service in return. Traditional approaches model free-riders as rational nodes that strive to maximize a utility and apply Game Theory concepts...
In this paper, we study the robust consensus problem for a group of linear discrete-time agents to coordinate over an uncertain communication network, which is to achieve consensus against transmission errors and noises. We model the network by communication links subject to deterministic uncertainties, which can be either an additive perturbation described by some unknown transfer function or a norm...
This paper considers the fixed-time consensus tracking problem for a class of first-order multi-agent systems with directed topology, where the agents may be subject to unknown disturbances. First, some consensus tracking protocols for the nominal multi-agent systems are designed to make the states of followers track those of the leader within fixed time. Then, a new class of consensus tracking protocols...
To provide verifiability, cryptographic voting protocols usually require a public bulletin board forpublishing the election data, so that the data can be read and verified by everyone. The basic requirements onsuch a board are similar for most protocols, for example that nothing can be changed or deleted from the board. Typically, when it comes to implement a voting protocol in a real system, many...
In this paper, we consider the problem of optimal opportunistic spectrum access using full-duplex (FD) radios in presence of uncertain primary user (PU) channel statistics and propose a Sensing-and-Selectively-Transmit protocol (SaST). To optimize its throughput, the SU sensing period has to be carefully tuned. However, in absence of the exact knowledge of PU activity statistics, under SaST, the PU's...
Cooperative broadcasting is a promising technique for efficient as well as robust broadcast of information in ad hoc networks. The paper compares the capacity of scheduled cooperative broadcasting with the capacity of Spatial Reuse TDMA (STDMA) for broadcast traffic in ad hoc networks. Three different routing methods for STDMA are considered: a tree-based solution; default MPR-flooding; and a robust...
Quantum key distribution (QKD) is the future of the cryptography world. The QKD was invented to increase the security rate when exchanging a private key. Since 1984, several experimental attempts to design protocols have been developed based upon the rule of physics. These QKD protocols were represented by different algorithms with limited ability to stand up against quantum attacks. This paper evaluates...
Cooperative spectrum sensing, despite its effectiveness in enabling dynamic spectrum access, suffers from location privacy threats, merely because secondary users (SUs)' sensing reports that need to be shared with a fusion center to make spectrum availability decisions are highly correlated to the users' locations. It is therefore important that cooperative spectrum sensing schemes be empowered with...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.