A sensor network is one of the most adaptive research area that requires the optimization in term of energy effectiveness, load balancing etc. The sensor network is defined under the particular localization architecture and having the challenges in terms of load minimization, energy loss reduction, security etc. One of such common and most adaptive research problem is routing. In this paper, op...

Several analytical models of fully-adaptive routing have recently been proposed for wormhole-routed k-ary ncubes under the uniform traffic pattern. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns, such as hot spots. As a result, most studies have resorted to simulation when evaluating the performance merits of adaptive routing. ...

This paper presents an analytical evaluation of the performance of adaptive wormhole routing in a two-dimensional torus. Our analysis focuses on minimal and fully adaptive wormhole routing that allows a message to use any shortest path between source and destination. A validation of the analysis through simulation is presented to demonstrate the accuracy of the obtained results. Finally, we rem...

Unstructured peer-to-peer systems rely on strategies and data structures (Routing Indices) for the routing of requests in the network. For those requests corresponding to information retrieval queries, the emphasis can be either put on the effectiveness of the routing by privileging the relevance of the documents retrieved, or on the efficiency of the routing by privileging the response time. W...

In this paper we survey the purpose of the RASTER routing protocol and study its input on a P2P network’s security. Routing in P2P-systems using adaptive distributed hash tables (DHT) poses di↵erent challenges than routing in traditional deterministic DHT-based P2P systems. Routing algorithms designed for deterministic DHTs do not always find those shortest paths in adaptive networks. The routi...

This paper proposes a general scheme for deadlock recovery based adaptive wormhole routing by considering a minimal set of additional buffers called recovery buffers. This scheme is then applied to deadlock recovery. When deadlock occurs in adaptive wormhole routing, the scheme routes the deadlocked message through a special recovery network, constructed from a sub set of the available network ...

Routing in wireless sensor networks is a demanding task. This demand has led to a number of routing protocols which efficiently utilize the limited resources available at the sensor nodes. All these protocols typically find the minimum energy path. In this paper we take a view that, always using the minimum energy path deprives the nodes energy quickly and the time taken to determine an alterna...

Of the many router designs, most can be classified as either oblivious or adaptive, depending on whether the path selection is statically determined based on the network topology, or whether dynamic information about congestion, priorities, or faults is considered. Adaptive algorithms can be broken down into two broad categories as well: minimal or non-minimal. Minimal adaptive algorithms allow...

Corresponding Author: Amal Alharbi Department of Computer Science, College of Information Sciences, King Saud University, Riyadh, Saudi Arabia Email: [email protected] Abstract: Mobile Ad hoc Networks (MANET) are self-organized networks that are characterized by dynamic topologies in time and space. This creates an instable environment, where classical routing approaches cannot achieve hig...

This paper introduces an adaptive routing approach based on buffer status and distance in a mesh overlay network: Thermal Field is used for considering buffer stage and distance is applied to select routing policy. The path selection process considers the Thermal Field as a metaphor for the buffer usage based on probability in order to avoid message loss by overloaded peers or delay because of ...