2 Preface In distributed and parallel computing environments, there are many computational problems that require efficient communication and coordination between the processes. For such problems there have been proposed several distributed structures, each designed to solve a particular problem or a class of problems. The distributed structures take into account the particularities of the speci...

Internet measurements have shown that network failures happen frequently, and that existing routing protocols can take multiple seconds, or even minutes, to converge after a failure. During these routing convergence periods, some packets may already be en-route to their destinations and new packets may be sent. These in-flight packets can encounter routing loops, delays, and losses. However, li...

We propose ant routing as a powerful means to enhance communications in meshed regular and irregular satellite constellations. Ant routing resembles basic mechanisms from distributed swarm intelligence in biological systems, and turns out to become an appealing solution when routing becomes a crucial problem in a complex network scenario, where traditional (deterministic) techniques either fail...

We propose ant routing as a powerful means to enhance communications in meshed regular and irregular satellite constellations. Ant routing resembles basic mechanisms from distributed swarm intelligence in biological systems, and turns out to become an appealing solution when routing becomes a crucial problem in a complex network scenario, where traditional (deterministic) techniques either fail...

A disadvantage of Link State routing schemes is that exact shortest path calculations require a complete topology, which can overload the capacity of small nodes in a large network. Area routing schemes (when destination names are structured corresponding to the network topology) allow nodes to reduce the size of routing tables, by recording only one entry for an entire region rather than one f...

In this paper we consider routing in random wireless-adhoc-networks (WANETs), where each node is equipped with a single antenna. Our analysis uses a proper model of the physical layer together with an abstraction of higher communication layers. We assume that the nodes are distributed according to a Poisson-point-process and consider routing schemes that select the next relay based on the geogr...

In this document we carry out a comparative analysis of the application of Fuzzy Logic Controllers (hereinafter FLCs), Fuzzy Temporal Rules-Based Controllers (hereinafter FTRCs), Temporal Fuzzy Logic Controllers (hereinafter TFLCs) and Faded Temporal fuzzy Logic Controllers (hereinafter FTFLCs), to improve the adaptive distributed routing. To obtain a good knowledge base the controllers were ev...

In this paper, we first describe some current and future applications of sensor networks. We present the conceptual framework of distributed routing strategies for wireless sensor networks. We show that under reasonable assumptions, this routing scheme guarantees ‘shortest path property’ which is quite desirable for sensor networks. We then discuss how this framework can be used to support dist...

MANET is a collection of wireless mobile nodes that can freely and dynamically self organize into arbitrary and temporary adhoc network topologies. The different features of Mobile Adhoc Network are Distributed operations, Multi-hop routing, Dynamic topology, Energy constrained operations etc. Routing protocols help nodes in MANET to communicate with each other. In Unipath routing protocols sin...

In this research paper, power aware distributed wireless sensor network architecture proposed by us (in the context of design of routing algorithm) is summarized. An approach to combined routing and fusion algorithm is discussed. Fuzzy logic based approach to wireless sensor fusion is discussed. The need for modeling sensor readings using fuzzy uncertainty is discussed. Novel overlap function f...