Given a wireless mobile ad hoc network (MANET), we present a self-stabilizing optimal local routing (SOLR) algorithm. Our claim of optimality is based on the minimum distance. The optimal routing is done with respect ...
详细信息
Given a wireless mobile ad hoc network (MANET), we present a self-stabilizing optimal local routing (SOLR) algorithm. Our claim of optimality is based on the minimum distance. The optimal routing is done with respect to the t closest nodes (called t-set). The locality is maintained with respect to the t-set, not with the direct neighbors. The algorithm is transparent to what the distance means: can be either the real distance, or the number of hops. The value of t is application dependent, and is decided in advance. t is n (where n is the upper bound on the maximum number of nodes in the network) when each node needs to know the shortest paths to all other nodes. t is less than n when nodes need to know the network only partially. A self-stabilizing system has the ability to automatically recover to normal behavior in case of transient faults, without a centralized control. Each node can start in some arbitrary state and with no knowledge of the network architecture, but still eventually computes a correct routing table for the t-closest nodes (t-set). The space complexity per node of SOLR, is O((t+/spl delta/)log(n)) bits (where /spl delta/ is the node degree) with a total of O(n(t+/spl Delta/)log(n)) bits (where /spl Delta/ is the maximum node degree) for the whole network. The stabilization time of the SOLR, algorithm is O(d+c) time units (where d is the network diameter and c is a large constant depending on some local computation). SOLR, can easily work for optimal on-demand routing by considering the set of nodes for which the shortest paths are desired instead of the t closest nodes. Also, it can be extended to a global routing protocol by using features specific to other protocols (e.g., hierarchical routing, cluster routing, interval routing, etc.).
distributedsensor networks are quickly gaining recognition as viable embedded computing platforms. Current techniques for programming sensor networks are cumbersome, inflexible, and low-level. This paper introduces E...
详细信息
ISBN:
(纸本)0769520863
distributedsensor networks are quickly gaining recognition as viable embedded computing platforms. Current techniques for programming sensor networks are cumbersome, inflexible, and low-level. This paper introduces EnviroTrack, an object-based distributed middleware system that raises the level of programming abstraction by providing a convenient and powerful interface to the application developer geared towards tracking the physical environment. EnviroTrack is novel in its seamless integration of objects that live in physical time and space into the computational environment of the application. Performance results demonstrate the ability of the middleware to track realistic targets.
sensors are typically deployed to gather data about the physical world and its artifacts for a variety of purposes that range from environment monitoring, control, to data analysis. Since sensors are resource constrai...
详细信息
ISBN:
(纸本)0769520863
sensors are typically deployed to gather data about the physical world and its artifacts for a variety of purposes that range from environment monitoring, control, to data analysis. Since sensors are resource constrained, often sensor data is collected into a sensor database that resides at (more powerful) servers. A natural tradeoff exists between the sensor resources (bandwidth, energy) consumed and the quality of data collected at the server Blindly transmitting sensor updates at a fixed periodicity to the server results in a suboptimal solution due to the differences in stability of sensor values and due to the varying application needs that impose different quality requirements across sensors. This paper proposes adaptive data collection mechanisms for sensor environments that adjusts to these variations while at the same time optimizing the energy consumption of sensors. Our experimental results show significant energy savings compared to the naive approach to data collection.
We propose a scalable key management scheme for sensor networks consisting of a large-scale random deployment of commodity sensor nodes that are anonymous. The proposed scheme relies on a location-based virtual networ...
详细信息
ISBN:
(纸本)0769520871
We propose a scalable key management scheme for sensor networks consisting of a large-scale random deployment of commodity sensor nodes that are anonymous. The proposed scheme relies on a location-based virtual network infrastructure and is built upon a combinatorial formulation of the group key management problem. Primary features of our scheme include autonomously computing group keys, and dynamically computing, using a simple hash function, the mapping of nodes to group keys. The scheme scales well in the size of the network and supports dynamic setup and management of arbitrary structures of secure group communications in large-scale wireless sensor network.
Wireless sensor Networks are edging closer to widespread feasibility with recent research showing promising results in developing and adapting new mechanisms to suit their environment. Secure communication between the...
详细信息
ISBN:
(纸本)0780383966
Wireless sensor Networks are edging closer to widespread feasibility with recent research showing promising results in developing and adapting new mechanisms to suit their environment. Secure communication between these distributed wireless devices is a desired characteristic, especially in scenarios where these sensors will be used for military and other mission-critical operations. This paper highlights some of the research challenges for extending secure communications over these resource-limited devices and points out why current protocols do not scale well in this unique application realm. A new key setup protocol (SEKEN) is proposed that neatly fits into the requirements of these device types. The performance of SEKEN is then analyzed against some other possible key setup mechanisms. Our initial results confirm that it performs better under most of the conditions anticipaied for general wireless sensor networks.
In wireless sensor networks, localization is one of the key issues in many applications, where a number of wireless sensor devices are used, for instance, to locate one or more (moving) targets. Typical examples are p...
详细信息
ISBN:
(纸本)0769520871
In wireless sensor networks, localization is one of the key issues in many applications, where a number of wireless sensor devices are used, for instance, to locate one or more (moving) targets. Typical examples are pursuer/invader applications, where the wireless devices are spread over an area and have to collectively determine the position of an invader based on sensor information available on the devices. This paper presents practical results concerning two of the key issues in the deployment of localization services in wireless sensor networks: the selection of appropriate sensors for collecting the data used in the localization algorithms and localization algorithm itself We tire showing some practical results concerning both issues and compare some of the algorithms we have used in our experiments.
The expectations for sensor networks are growing. One of the most important issues in sensor networks is to evaluate the fault tolerance and built technology to improve it, because sensor nodes are prone to fail and h...
详细信息
ISBN:
(纸本)0769520871
The expectations for sensor networks are growing. One of the most important issues in sensor networks is to evaluate the fault tolerance and built technology to improve it, because sensor nodes are prone to fail and have limited power capacity. So far research on the fault tolerance has focused on battery exhaustion. Since placement affects whether there are nodes that can sense and routes to the base station, placement of sensor nodes is also important. However, there has been little research on the placement of sensor nodes and all of it is based on deterministic placement, which is not realistic when many sensor nodes are placed in a large area. In such a situation, stochastic placement is needed. Therefore, this paper evaluates the tolerance against both random failure and battery exhaustion from the viewpoint of stochastic node placement.
sensors networks are often constrained by limited power and limited communication range. If a sensor receives two messages simultaneously then they collide and both messages become incomprehensible. In this paper we p...
详细信息
ISBN:
(纸本)0769520871
sensors networks are often constrained by limited power and limited communication range. If a sensor receives two messages simultaneously then they collide and both messages become incomprehensible. In this paper we present a simple time division multiple access (TDMA) algorithm for assigning time slots to sensors and show that it provides a significant reduction in the number of collisions incurred during communication. We present TDMA algorithms customized for different communication patterns, namely, broadcast, convergecast and local gossip, that occur commonly in sensor networks. Our algorithms are self-stabilizing, i.e., TDMA is restored even if the system reaches an arbitrary state where the sensors are corrupted or improperly initialized.
The NEESgrid project is revolutionizing the way earthquake engineering (EE) researchers collaborate to plan, perform, share and publish research even while being geographically separated. The proposed demonstration is...
详细信息
ISBN:
(纸本)0780321754
The NEESgrid project is revolutionizing the way earthquake engineering (EE) researchers collaborate to plan, perform, share and publish research even while being geographically separated. The proposed demonstration is in complement to the NEESgrid paper titled "distributed Hybrid Earthquake Engineering Experiments: Experiences with a Ground-Shaking Grid Application" also presented at this conference. It showcases some of NEESgrid's features and capabilities in the area of distributed hybrid experiments, as well as new features developed since the distributed hybrid experiment was conducted. These new features and capabilities are in the areas of simulation portal, electronic notebook, data modeling, and improved live streaming of near real time sensor and video data.
The proceedings contains 136 papers from the The 24th ieeeinternationalconference on distributedcomputingsystems Workshops. The topics discussed include: automatic group protocol for distributedsystems;a new medi...
详细信息
The proceedings contains 136 papers from the The 24th ieeeinternationalconference on distributedcomputingsystems Workshops. The topics discussed include: automatic group protocol for distributedsystems;a new media access control protocol for simple hop WDM networks;distributed index updating method for intranet information retrieval;an agent-based consumer recommendation mechanism;pocket SCORM;a general architecture for wireless sensor networks: first steps;log-structured storage for efficient weakly-connected replication and autonomous and proactive adjustment of update allowance in autonomous decentralized database system.
暂无评论