Structured P2P (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of network nodes and the non-uniform and time-varying file popularity. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an elasti...

In this paper we study the problem of searching for a node or a piece of data in an ad hoc network using random packet forwarding. In particular, we examine three different methods. The first is a random direction forwarding scheme where the query packet is forwarded along a randomly chosen direction (following an approximate straight line) till it either hits the destination node (the target) ...

While sensor networks are going to be deployed in diverse application specific contexts, one unifying view is to treat them essentially as distributed databases. The simplest mechanism to obtain information from this kind of a database is to flood queries for named data within the network and obtain the relevant responses from sources. However, if the queries are a) complex, b) one-shot, and c)...

This paper presents performance comparison among ve strategies for mobile support. The major facilities that are required for a network protocol to support mobile hosts are location management and packet forwarding. Based on this observation, we consider ve basic strategies which use distinct methods to achieve these facilities and compare their performance. These ve strategies are Broadcast No...

This paper presents performance comparison among ve strategies for mobile support. The major facilities that are required for a network protocol to support mobile hosts are location management and packet forwarding. Based on this observation, we consider ve basic strategies which use distinct methods to achieve these facilities and compare their performance. These ve strategies are Broadcast No...

While sensor networks are going to be deployed in diverse application specific contexts, one unifying view is to treat them essentially as distributed databases. The simplest mechanism to obtain information from this kind of a database is to flood queries for named data within the network and obtain the relevant responses from sources. However, if the queries are (a) complex, (b) one-shot, and ...

In an object-based distributed computing system, the use of location-independent naming scheme can improve the system’s transparency, scalability, and reliability. Names need to be resolved prior to passing messages between objects. This paper presents an Adaptive RandoMised Structured search network termed ARMS that provides name resolution by forwarding a query through neighbouring nodes. ARM...

The main function of a wireless sensor network is to sense the outside environment and report the data to a processing center. Therefore, both sensing and communication roles should be considered for a sensor network. Except for the mobility aspect, sensor networks inherit almost all properties of ad hoc networks. Therefore, sensor nodes are supposed to report data to a common sink instead of s...