Mobile ad-hoc networks (MANETs) are a form of wireless networks which do not require a base station for providing network connectivity. Mobile ad-hoc networks have many characteristics which distinguish them from other wireless networks which make routing in such networks a challenging task. Cluster based routing is one of the routing schemes for MANETs in which various clusters of mobile nodes...

Many applications that consist of streams of data are inherently distributed. Since input stream rates and other system parameters such as the amount of available computing resources can fluctuate significantly, a stream query plan must be able to adapt to these changes. Routing tuples between operators of a distributed stream query plan is used in several data stream management systems as an a...

The aim of this work is to deene a paradigm which supports the routing of demands across distinct network domains. The distributed nature of this problem (the network resources are spatially distributed and distinct domains can be heterogeneous environments) and the constraints imposed by the environment suggest the use of distributed problem solving methodologies and multi-agent technology. In...

The aim of this work is to deene a paradigm which supports the routing of service demands across distinct network domains. The distributed nature of this problem (i.e., network resources are spatially distributed, and distinct domains can contain heterogeneous components), and the constraints imposed by the environment suggest the use of distributed problem solving techniques and multi-agent te...

The increase of complexity and dynamics leads to new challenges in transport logistics networks. Current routing algorithms of central control are pushed to their limits in handling these new challenges. This leads to the development of an autonomously controlled routing protocol, the Distributed Logistics Routing Protocol (DLRP), which allows a better handling of the new requirements. Within t...

We give near optimal bufferless routing algorithms for leveled networks. N packets with preselected paths are given, and once injected, the packets may not be buffered while in transit to their destination. For the preselected paths, the dilation D is the maximum path length, and the congestion C is the maximum number of times an edge is used. We give two bufferless routing algorithms for level...

The rapid development of networking technologies has made it possible to construct a distributed database that involves a huge number of sites. Query processing in such a large-scaled system poses serious challenges beyond the scope of traditional distributed algorithms. In this paper, we propose a new algorithm BRANCA for performing top-k retrieval in these environments. Integrating two orthog...

Distributed Sensor Networks (DSN) consists of distributed nodes having the capability of sensing, computation and wireless communications. Routing, power management and data dissemination protocols have been specifically designed for DSN, where energy consumption is an essential design issues for routing. Maximizing the lifetime of the sensor nodes, it is preferable to distribute the energy dis...

Routing algorithms, from communication cost reduction to network dynamics In order to respond to routing queries, the entities of the network, nammed routers, require to have a knowledge concerning the topology of the network, this knowledge is called routing table. The network is modeled by a graph in which nodes represent routers and edges represent communication links between nodes. This the...

heretofore several position-based routing protocols have been developed for mobile ad hoc networks. many of these protocols assume that a location service is available which provides location information on the nodes in the network.our solutions decrease location update without loss of query success rate or throughput and even increase those.simulation results show that our methods are effectiv...