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.
Self-organization is an evolutionary process in which the e.ects of the environment are minimal; i.e., where the development of new, complex structures primarily takes place in and throughout the system itself. Natural phenomena, living forms, or social systems (e.g., growing crystals, cells aggregation, ant colonies) are examples of self-organizing systems in which a global order of the system emerges...
Summary form only given. As robotic systems are getting cheaper and easier to produce in mass, more and more applications envision future systems in which groups of simple robots are expected to self-organize and cooperate to perform complex tasks. While earlier developments have mostly emphasized an empiric approach, observing the emergence of collective behavior under given circumstances, there...
Robotics has been paid a lot attentions because of its wide applications, like explore unknown planet or rescue people after earthquake or fire. In a group of mobile robots, robots are usually weak and are easy to get crash, especially working in dangerous or harsh environment. Unfortunately, to the best of our knowledge, only a few studies address on robot failure, especially transient failure. Therefore,...
Consider a system composed of mobile robots (mobile sensors) that move on the plane, each of which independently executing its own instance of an algorithm. Given a desired geometric pattern, the flocking problem consists in ensuring that the robots form this pattern and maintain it while moving together on the plane. In this paper, we look at the flocking problem in the presence of faulty robots,...
Active queue management (AQM) is an effective method used in Internet routers for congestion control, and to achieve a trade off between link utilization and delay. The de facto standard, the random early detection (RED) AQM scheme, and most of its variants use average queue length as a congestion indicator to trigger packet dropping.This paper proposes a novel numerical algorithm based on self-tuning...
Research on wireless sensor networks has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Among various issues, energy consumption is one of the most important criteria for routing protocol in wireless sensor networks (WSNs). This paper introduces an energy efficient clustering algorithm for mobile sensor network...
Recently, flocking of a group of mobile robots is gained a lot of attentions due to its wide applications, such as manufacturing, surveillance and space exploration. It is necessary for all robots to adapt to the complex environment during flocking. In this paper, we propose a decentralized flocking algorithm, which can avoid collision between a robot and its neighbors and the collision between robots...
This paper compares several parametric and adaptive failure detection schemes in terms of their respective QoS. We introduce an improvement over existing methods, and evaluate their benefits. First, we propose an optimization to enhance the adaptation of Chen's FD, which significantly improves QoS, especially in the aggressive range and when the network is unstable. Second, we address the problem...
The scheduling of real-time tasks with fault-tolerant requirements has been an important problem in multiprocessor systems. Primary-backup (PB) approach is often used as a fault-tolerant technique to guarantee the deadlines of tasks despite the presence of faults. In this paper we propose a PB-based task scheduling approach, wherein an allocation parameter is used to search the available time slots...
In multiprocessor systems, redundant scheduling is a technique that trades processing power for increased reliability. One approach, called primary-backup task scheduling, is often used in real-time multiprocessor systems to ensure that deadlines are met in spite of faults. Briefly, it consists in scheduling a secondary task conditionally, in such a way that the secondary task actually gets executed...
In this study, we focus on a self-deployment problem for a swarm of autonomous mobile robots that can be used to build a sensor networking infrastructure with equilateral triangle lattice configurations. In order to deploy the swarm, this paper proposes a self-stabilizing distributed self- deployment algorithm under a robot model with the following features: no identification numbers, no common coordinates,...
The paper presents a fail-safe mobility management and a collision prevention platform for a group of asynchronous cooperative mobile robots. The fail-safe platform consists of a time-free collision prevention protocol, which guarantees that no collision can occur between robots, independently of timeliness properties of the system, and even in the presence of timing errors in the environment. The...
In this paper, we present an anonymous, stable, communication efficient, stabilizing leader election algorithm that works using anonymous communication primitives. The algorithm offers properties similar to that of the Omega failure detector, with the added property of totally ordering the sequence of proposed leaders. The algorithm does not need to know beforehand the identity or the number of processes...
Active queue management (AQM) is an effective method used in Internet routers to enhance congestion control, and to achieve a trade off between link utilization and delay. The de facto standard, the random early detection (RED) AQM scheme, and most of its variants use queue length as a congestion indicator to trigger packet dropping. Random early detection (RED) is a widely studied active queue management...
It is widely recognized that distributed systems would greatly benefit from the availability of a generic failure detection service. There are however several issues that must be addressed before such a service can actually be implemented. In this paper, we highlight the issue related to propagating information on failures in the phi failure detector for large-scale systems. Traditionally, failure...
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.