Horst F. Wedde

BeeHive: An efficient fault-tolerant routing algorithm inspired by honey bee behavior

Bees organize their foraging activities as a social and communicative effort, indicating both the direction, distance and quality of food sources to their fellow foragers through a ”dance” inside the bee hive (on the ”dance floor”). In this paper we present a novel routing algorithm, BeeHive, which has been inspired by the communicative and evaluative methods and procedures of honey bees. In this algorithm, bee agents travel through network regions called foraging zones. On their way their information on the network state is delivered for updating the local routing tables. BeeHive is fault tolerant, scalable, and relies completely on local, or regional, information, respectively. We demonstrate through extensive simulations that BeeHive achieves a similar or better performance compared to state-of-the-art algorithms.

BeeAdHoc: an energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior

In this paper we present BeeAdHoc, a new routing algorithm for energy efficient routing in mobile ad hoc networks. The algorithm is inspired by the foraging principles of honey bees. The algorithm mainly utilizes two types of agents, scouts and foragers, for doing routing in mobile ad hoc networks. BeeAdHoc is a reactive source routing algorithm and it consumes less energy as compared to existing state-of-the-art routing algorithms because it utilizes less control packets to do routing. The results of our extensive simulation experiments show that BeeAdHoc consumes significantly less energy as compared to DSR, AODV, and DSDV, which are state-of-the-art routing algorithms, without making any compromise on traditional performance metrics (packet delivery ratio, delay and throughput).

A comprehensive review of nature inspired routing algorithms for fixed telecommunication networks

The major contribution of the paper is a comprehensive survey of existing state-of-the-art Nature inspired routing protocols for fixed telecommunication networks developed by researchers who are trained in novel and different design doctrines and practices. Nature inspired routing protocols have been becoming the focus of research because they achieve the complex task of routing through simple agents which traverse the network and collect the routing information in an asynchronous fashion. Each node in the network has a limited information about the state of the network, and it routes data packets to their destination based on this local information. The agent-based routing algorithms provide adaptive and efficient utilization of network resources in response to changes in the network catering for load balancing and fault management. The paper describes the important features of stigmergic routing algorithms, evolutionary routing algorithms and artificial intelligence routing algorithms for fixed telecommunication networks. We also provide a summary of the protocols developed by the networking community. We believe that the survey will be instrumental in bridging the gap among different communities involved in research of telecommunication networks.

The wisdom of the hive applied to mobile ad-hoc networks

In this paper we present an energy efficient routing algorithm, BeeAdHoc, which is inspired from foraging principles of honey bees. The bee behavior was instrumental in designing efficient mobile agents, scouts and foragers, for routing in mobile ad-hoc networks. We did extensive simulations to verify that BeeAdHoc consumes significantly less wireless network card energy as compared to DSR, AODV, and DSDV, which are existing state-of-the-art routing algorithms, but without compromising traditional performance metrics, packet delivery ratio and delay.

Modeling a solution for a control problem in distributed systems by restrictions

Abstract For an independent representation of the constraints on processes in distributed system parts the formalism of Loosely Coupled Systems is recalled. The event structure is derived only from prespecified restrictions of behaviour, concurrency of events is described in elementary and local terms. Formal construction methods (constraint module and slack phase techniques) are defined and used to model a solution for a control problem under various constraints (fairness). The correctness of the solution is proved using a general and new formal procedure: A restricted case graph is evaluated which is minimal with respect to the needed information. For the sake of evaluation the system is reduced to another one by a simple and efficient algorithm. It is proved that the wanted restricted case graph is an invariant under the algorithm. In the reduced system the restricted case graph is very simple to compute.

A performance evaluation framework for nature inspired routing algorithms

Performance evaluation of routing protocols is an important area of research that deals with the analysis and investigation of such protocols. A performance evaluation framework unveils different facets of a protocol and explores its behavior under diversified network operations. The nature inspired routing community, at the moment, lacks such a framework. Therefore, in this paper we propose a comprehensive performance evaluation framework that will empower the routing protocol designers to design state-of-the-art algorithms and extensively evaluate their performance. Using our framework, we exhaustively evaluated three state-of-the-art nature inspired routing algorithms. The results show some undiscovered aspects of the algorithms and provide valuable understanding about their merits and demerits. We believe that this will be the first major step in designing, standardizing and developing a performance evaluation library that will facilitate an extensive and unbiased evaluation of nature inspired routing algorithms.

Highly dynamic and scalable VANET routing for avoiding traffic congestions

Traffic congestions have become a major problem in metropolitan areas world-wide, within and between cities, in particular due to the highly dynamic character of congestion building and dissolving. Our earlier work on the novel multi-agent BeeHive routing algorithms [1,2,3] derived from the honey bee behavior exhibits high adaptability and flexibility, high throughput and fault BAtolerance at a so far unsurpassed degree. Part of the algorithm is concerned with dynamically updating the quality weights of the communication links which at the key feature for the probabilistic routing decisions. We integrated these algorithms into a distributed traffic control model where vehicles are directed under decentralized control at each road intersection. The result is the

Role-based access control in ambient and remote space

In the era of Ubiquitous Computing and world-wide data transfer mobility, as an innovative aspect of professional activities, imposes new andcomplex problems of mobile and distributed access to information,services, and on--line negotiations for this purpose. This paperrestricts itself to presenting a distributed and location--dependentRBAC approach which is multi--layered. Also an adapted form ofAdministration Nets is presented whichallows the scheduling of distributed on--line processes for automatedlocation--dependent negotiating procedures, and for provingtheir correctness. Examples are discussed in some detail.

Modular authorization

There are three major drawbacks of a centralized security administration in distributed systems: It creates a bottleneck for request handling, it tends to enforce homogeneous security structures in heterogeneous user groups and organizations, and it is a weak point in terms of security attacks, reliability, and fault tolerance. In this paper we introduce a distributed authorization concept which is based on a modular authorization language for supporting cooperatingdistributed authorization teams. These teams are partially ordered into a hierarchy in that they inherit authorization rules from higher order teams but still exercise their autonomy by (dynamically) setting local rules that serve the special local needs in distributed organizations.Conflictsbetween between rules inherited from different higher ranking sources, orviolationsof higher order rules through local rules would be detected, on the logical level or through request evaluation, as contradictions or contradicting results, respectively. Conflict resolution mechanisms are presented, and examples are discussed extensively.

Building Large, Complex, Distributed Safety-Critical OperatingSystems

Safety-critical systems typically operate in unpredictable environments. Requirements for safety and reliability are in conflict with those for real-time responsiveness. Due to unpredictable environmental needs there is no static trade-off between measures to accommodate the conflicting objectives. Instead every feature or operating system service has to be adaptive. Finally, for any design problem, there cannot be any closed-form (formal) approach taking care at the same time of (external) time constraints or deadlines, and synchronization requirements in distributed design. The reason is that these two aspects are causally independent. - In this situation we worked out a heuristic experimental, performance-driven and performance-based methodology that allows in an educated way to start with a coarse system model, with accurate logical expectations regarding its behavior. Through experiments these expectations are validated. If they are found to successfully stand the tests extended expectations and model features are generated for refining the previous design as well as its performance criteria. The refinement is done in such a way that the previous experimental configurations are extreme model cases or data profiles which both logically and experimentally are to reproduce the behavior of the previous modeling step. Thus the novel performance aspects or tendencies could then unambiguously be attributed to the influences of the refined model features. We termed this methodology Incremental Experimentation. As a general methodology it relies on a principle of comparative performance studies rather than on realistic data for narrow application ranges. The paper describes how we applied a 5-step design and refinement procedure for developing, analyzing, and evaluating our distributed operating system MELODY that exhibits novel services for supporting real-time and safety-critical applications in unpredictable environments. Experimental set-ups and theme-related findings are discussed in particular.