In this paper we introduce topology-based distributed hash tables (T-DHT) as an infrastructure for data-centric storage, information processing, and routing in ad hoc and sensor networks. T-DHTs do not rely on locatio...
详细信息
ISBN:
(纸本)0769523765
In this paper we introduce topology-based distributed hash tables (T-DHT) as an infrastructure for data-centric storage, information processing, and routing in ad hoc and sensor networks. T-DHTs do not rely on location information and work even in the Presence of voids in the network. Using a virtual coordinate system, we construct a distributed hash table which is strongly oriented to the underlying network topology. Thus, adjacent areas in the hash table commonly have a direct link in the network. Routing in the T-DHT guarantees reachability and introduces low hop-overhead compared with the shortest path.
In a pure sensor network thousands of sensors are distributed over a large area. sensor data is relayed from sensor node to node until it reaches the edge node, where it is then routed by wire to the host. In this pap...
详细信息
A ubiquitous computing environment entails numerous embedded devices with enough computational power. Such distributedcomputing resources can cooperate to create applications which support users' everyday lives. ...
详细信息
ISBN:
(纸本)0769523463
A ubiquitous computing environment entails numerous embedded devices with enough computational power. Such distributedcomputing resources can cooperate to create applications which support users' everyday lives. Such an environment requires robust middleware that can handle a large quantity of messages, such as event data or sensor data are occurred between devices. However the lack of middleware technologies with such functionalities has been making it difficult to create ubiquitous computing applications that we can depend on in their everyday life. In this paper we propose a novel middleware, named RT-Dragon, which can handle numerous messages with robustness. RT-Dragon can work effectively on systems both real-time and non-realtime runtime because of the mechanism of two level priority-based task processing. In this paper additionally, we evaluate the effectiveness of RT-Dragon on non-RT runtime.
A distributed algorithm for the multihop wireless sensor networks is proposed to construct a novel energy efficient tree topology. The topology is constructed, without taking location information of the sensor nodes a...
详细信息
This paper presents a two-level strategy for topology control in wireless sensor networks. The energy saving methods in most of the existing research work can be categorized into two types: active subnetwork and short...
详细信息
ISBN:
(纸本)0769522815
This paper presents a two-level strategy for topology control in wireless sensor networks. The energy saving methods in most of the existing research work can be categorized into two types: active subnetwork and short hops. The active subnetwork and short hops methods have different network conditions for them to perform well. We propose a two-level topology control strategy which integrates the above two methods to achieve further energy saving. The simulation results show that the two-level topology control strategy achieves better performance in terms of energy saving than both active subnetwork and short hops methods in networks with a wide range of node densities.
sensor network localization continues to be an important research challenge. The goal of localization is to assign geographic coordinates to each node in the sensor network. Localization schemes for sensor network sys...
详细信息
ISBN:
(纸本)3540264221
sensor network localization continues to be an important research challenge. The goal of localization is to assign geographic coordinates to each node in the sensor network. Localization schemes for sensor network systems should work with inexpensive off-the-shelf hardware, scale to large networks, and also achieve good accuracy in the presence of irregularities and obstacles in the deployment area. We present a novel approach for localization that can satisfy all of these desired properties. Recent developments in sensor network clustering algorithms have resulted in distributed algorithms that produce highly regular clusters. We propose to make use of this regularity to inform our localization algorithm. The main advantages of our approach are that our protocol requires only three randomly-placed nodes that know their geographic coordinates, and does not require any ranging or positioning equipment (i.e., no signal strength measurement, ultrasound ranging, or directional antennas are needed). So far, only the DV-Hop localization mechanism worked with the same assumptions [1]. We show that our proposed approach may outperform DV-Hop in certain scenarios, in particular when there exist large obstacles in the deployment field, or when the deployment area is free of obstacles but the number of anchors is limited.
Wireless sensor networks (WSNs) are important for a number of strategic applications. Target localization is an important task in WSNs. In this paper, a distributed and cooperative target localization algorithm in wir...
详细信息
Every physical event results in a natural information gradient in the proximity of the phenomenon. Moreover, many physical phenomena follow the diffusion laws. This natural information gradient can be used to design e...
详细信息
ISBN:
(纸本)3540264221
Every physical event results in a natural information gradient in the proximity of the phenomenon. Moreover, many physical phenomena follow the diffusion laws. This natural information gradient can be used to design efficient information-driven routing protocols for sensor networks. Information-driven routing protocols based on the natural information gradient, may be categorized into two major approaches: (i) the single-path approach and (ii) the multiple-path approach. In this paper, using a regular grid topology, we develop analytical models for the query success rate and the overhead of both approaches for ideal and lossy wireless link conditions. We validate our analytical models using simulations. Also, both the analytical and the simulation models are used to characterize each approach in terms of overhead, query success rate and increase in path length.
The proceedings contain 77 papers. The topics discussed include: distributed computation in the physical world;exploring the Energy-Latency Trade-Off for broadcasts in Energy-Saving sensor networks;the impossibility o...
详细信息
ISBN:
(纸本)0769523285
The proceedings contain 77 papers. The topics discussed include: distributed computation in the physical world;exploring the Energy-Latency Trade-Off for broadcasts in Energy-Saving sensor networks;the impossibility of boosting distributed service resilience;explicit combinatorial structures for cooperative distributed algorithms;efficient wait-free implementation of Multiword LL/SC variables;adaptive collaboration in peer-to-peer systems;on cooperative content distribution and the price of barter;non-cooperation in competitive P2P networks;systems support for pervasive query processing;supporting complex multi-dimensional Queries in P2P systems;optimal asynchronous garbage collection for RDT checkpointing protocols;application-driven coordination-free distributed checkpointing;flexible consistency for wide area peer replication;and adaptive counting networks.
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (possibly) very large number of clients. We...
详细信息
ISBN:
(纸本)3540264221
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (possibly) very large number of clients. We show that a variation of the problem can be solved using a local algorithm. Local algorithms are extremely useful in a sensor network scenario. This is because they allow the communication range of the sensor to be restricted to the minimum, they can operate in routerless networks, and they allow complex problems to be solved on the basis of very little information, gathered from nearby sensors. The local facility location algorithm we describe is entirely asynchronous, seamlessly supports failures and changes in the data during calculation, poses modest memory and computational requirements, and can provide an anytime solution which is guaranteed to converge to the exact same one that would be computed by a centralized algorithm given the entire data.
暂无评论