Recent advances in wireless sensor networks have led to many new routing protocols specifically designed for sensor networks. Almost all of these routing protocols considered energy efficiency as the ultimate objectiv...
详细信息
ISBN:
(纸本)0769519210
Recent advances in wireless sensor networks have led to many new routing protocols specifically designed for sensor networks. Almost all of these routing protocols considered energy efficiency as the ultimate objective in order to maximize the whole network lifetime. However, the introduction of video and imaging sensors has posed additional challenges. Transmission of video and imaging data requires both energy and QoS aware routing in order to ensure efficient usage of the sensors and effective access to the gathered measurements. In this paper, we propose an energy-aware QoS routing protocol, which can also run efficiently with best-effort traffic. The protocol finds a least-cost, delay-constrained path for real-time data in terms of link cost that captures nodes' energy reserve, transmission energy, error rate and other communication parameters. Moreover, throughput for non-real-time data is maximized by adjusting the service rate for both real-time and non-real-time data at sensor nodes. Simulation results have demonstrated the effectiveness of our approach.
In sensor networks, it is crucial to design and employ energy-efficient communication protocols, since nodes are battery-powered and thus their lifetimes are limited. This paper studies data dissemination in two-tiere...
详细信息
The current sensor networks are assumed to be designed for specific applications, having strongly coupled data communication protocols. The future sensor networks are envisioned as comprising heterogeneous devices ass...
详细信息
In this paper we present PEAS, a robust energy-conserving protocol that can build long-lived, resilient sensor networks using a very large number of small sensors with short battery lifetime. PEAS extends the network ...
详细信息
In this paper we present PEAS, a robust energy-conserving protocol that can build long-lived, resilient sensor networks using a very large number of small sensors with short battery lifetime. PEAS extends the network lifetime by maintaining a necessary set of working nodes and turning off redundant ones. PEAS operations are based on individual node's observation of the local environment and do not require any node to maintain per neighbor node state. PEAS performance possesses a high degree of robustness in the presence of both node power depletions and unexpected failures. Our simulations and analysis show that PEAS can maintain an adequate working node density in the face of up to 38% node failures, and it can maintain roughly a constant overhead level under various deployment conditions ranging from sparse to very dense node deployment by using less than 1% of total energy consumption. As a result, PEAS can extend a sensor network's functioning time in linear proportion to the deployed sensor population.
Connectivity based node clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. This paper desc...
详细信息
ISBN:
(纸本)0769520235
Connectivity based node clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. This paper describes a Connectivity-based distributed Node Clustering scheme (CDC). This scheme presents a scalable and an efficient solution for discovering connectivity based clusters in peer networks. In contrast to centralized graph clustering algorithms, the CDC scheme is completely decentralized and it only assumes the knowledge of neighbor nodes, instead of requiring a global knowledge of the network (graph) to be available. An important feature of the CDC scheme is its ability to cluster the entire network automatically or to discover clusters around a given set of nodes. We provide experimental evaluations of the CDC scheme, addressing its effectiveness in discovering good quality clusters. Our experiments show that utilizing message-based connectivity structure can considerably reduce the messaging cost, and provide better utilization of resources, which in turn improves the quality of service of the applications executing over decentralized peer-to-peer networks.
We have proposed Smart sensor Networks (S-Nets) as an architecture and set of distributed algorithms to extract, interpret and exploit networked sensor devices. Heretofore, the development of this approach has been do...
详细信息
We have proposed Smart sensor Networks (S-Nets) as an architecture and set of distributed algorithms to extract, interpret and exploit networked sensor devices. Heretofore, the development of this approach has been done in simulation. In this paper, we describe two complementary implementations of S-Nets: (1) on a set of Berkeley motes comprised of low-power 8-bit, 128Kb memory processors, communication devices and sensors, and (2) on a set of JStamps having 32-bit controllers, 2Mb of memory and native execution Java hardware.
Numerous applications rest on sensor networks. Managing such networks in an efficient manner involves solving complex distributedcomputing problems, that problems are magnified in ad hoc sensor networks, where a limi...
详细信息
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionality, or configuration to enact or optimiz...
详细信息
sensor networks, that consist of potentially several thousands of nodes each with sensing (heat, sound, light, magnetism, etc.) and wireless communication capabilities, provide great opportunities for monitoring spati...
详细信息
ISBN:
(纸本)0769520235
sensor networks, that consist of potentially several thousands of nodes each with sensing (heat, sound, light, magnetism, etc.) and wireless communication capabilities, provide great opportunities for monitoring spatial information about a region of interest. Although spatial query execution has been studied extensively in the context of database systems (e.g., indexing technologies), these solutions are not directly applicable in the context of sensor networks due to the decentralized nature of the sensor networks and the limited computational power and energy scarcity of individual sensor nodes. In this paper, we present a peer-to-peer indexing structure, namely peer-tree, in order to address the problem of energy- and time-efficient execution of spatial queries (such as nearest-neighbor queries) in sensor networks. Loosely speaking, our peer-tree structure can be interpreted as a peer-to-peer version of the centralized R-tree index structure. Using the peer-tree as a building block, we present a peer-to-peer query processing model where a query can be posed in any node of the network without the need of a central server. For achieving minimal energy consumption and minimal response time, our query processing model ensures that only the relevant nodes for the correct execution of a query are involved in the query execution.
In this paper we consider multi-agent stochastic optimization and control problems, with partial information. The agent can operate in a distributed land asynchronous fashion. We investigate new problems that arise ou...
详细信息
ISBN:
(纸本)078037939X
In this paper we consider multi-agent stochastic optimization and control problems, with partial information. The agent can operate in a distributed land asynchronous fashion. We investigate new problems that arise out of the interaction between observations and control actions by the agent. We show that new non-classical and non-commutative probability models are needed in order to properly formulate such problems. The models we develop here are inspired by models developed for dynamical physics problems. We establish a series of fundamental results for the trade-off between information and control patterns in distributed stochastic control, detection and estimation.
暂无评论