The paper proposes a novel distributed service discovery method for the pervasive computing environment. The method is based on the concept of small world, policy-based advertiseme...
Abstract. Sensor relocation protocols can be employed as fault tolerance approach to offset the coverage loss caused by node failures. We introduce a novel localized structure, in...
The access scheduling on the control channels in TDMA wireless mesh networks is studied in this paper. The problem is to assign time-slots for each node in the network to access th...
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
Measurement studies on the Internet topology show that connectivities of nodes exhibit power–law attribute, but it is apparent that only the degree distribution does not determin...
Responding to misbehavior in ad-hoc and sensor networks is difficult. We propose new techniques for deciding when to remove nodes in a decentralized manner. Rather than blackballin...
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
— Beamforming antennas have been shown to improve spatial reuse in wireless networks. Protocols that aim to exploit beamforming antennas have leveraged benefits from directional...
— In this paper we study two-hop cooperative diversity relaying in random wireless networks. In contrast to most work on cooperative diversity relaying where the relay node posit...
—We consider surveillance applications in which sensors are deployed in large numbers to improve coverage fidelity. Previous research has studied how to select active sensor cov...