This paper designs and implements a tree-based routing algorithm that allows a user to gather aggregated information from individual sensor node's readings in a large-scale sensor network setting Obviously, the no...
详细信息
Maximizing the lifetime of wireless sensor networks under constrained resources is an interesting problem that has gained increasing attention. Most methods assume an ideal link layer model when increasing the lifetim...
详细信息
In this paper, we present the design and implementation of a sensor network system for monitoring the flow of traffic through temporary construction work zones. As opposed to long-term work zones which are common on h...
详细信息
ISBN:
(纸本)9783642020841
In this paper, we present the design and implementation of a sensor network system for monitoring the flow of traffic through temporary construction work zones. As opposed to long-term work zones which are common on highways, short-term or temporary work zones remain active for a few hours or a few days at most. As such, instrumenting temporary work zones with monitoring equipment similar to those used in long-term work zones is not practical. Yet, these temporary work zones present an important problem in terms of crashes occurring in and around them. Our design for a sensornet-based system for monitoring traffic is (a) inexpensive, (b) rapidly deployable, and (c) requires minimal maintenance. We report on our experiences in building this system, and with testing our system in live work zones in the Cleveland area.
Separately, context-aware sensing and networked sensing systems have been fast progressing research domains. The emergence of wireless sensor networks (WSN) has introduced a way of implementing a distributed self-orga...
详细信息
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The first class of problems involve assi...
详细信息
ISBN:
(纸本)9783642020841
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The first class of problems involve assigning radii to already-positioned sensors (being cheap). The second class of problems are motivated by the fact that the sensors may, because of practical difficulties, be positioned with only approximate accuracy (being flexible). This changes the character of some coverage problems that solve for optimal disk positions or disk sizes, ordinarily assuming the disks can be placed precisely in their chosen positions, and motivates new problems. Given a set of disk sensor locations, we show for most settings how to assign either (near-)optimal radius values or allowable amounts of placement error. Our primary results are 1) in the 1-d setting we give a faster dynamic programming algorithm for the (linear) sensor radius problem;and 2) we find a max-min fair set of radii for the 2-d continuous problems in polynomial time. We also give results for other settings, including fast approximation algorithms for the 1-d continuous case.
This paper presents a failure diagnosis algorithm for summarizing and generalizing patterns that lead to instances of anomalous behavior in sensor networks. Often multiple seemingly different event patterns lead to th...
详细信息
ISBN:
(纸本)9783642020841
This paper presents a failure diagnosis algorithm for summarizing and generalizing patterns that lead to instances of anomalous behavior in sensor networks. Often multiple seemingly different event patterns lead to the same type of failure manifestation. A hidden relationship exists, in those patterns, among event attributes that is somehow responsible for the failure. For example, in some system, a message might always get corrupted if the sender is more than two hops away from the receiver (which is a distance relationship) irrespective of the senderId and receiverId. To uncover such failure-causing relationships, we present a new symbolic pattern extraction technique that identifies and symbolically expresses relationships correlated with anomalous behavior. Symbolic pattern extraction is a new concept in sensor network debugging that is unique in its ability to generalize over patterns that involve different combinations of nodes or message exchanges by extracting their common relationship. As a proof of concept, we provide synthetic traffic scenarios where we show that applying symbolic pattern extraction can uncover more complex bug patterns that are crucial to the understanding of real causes of problems. We also use symbolic pattern extraction to diagnose a real bug and show that;it generates much fewer and more accurate patterns compared to previous approaches.
We consider a system consisting of a set of mobile sensors. They are disseminated in a region of interest and their mobility is controlled (as opposed to mobility imposed by the entity on which they are embedded). A r...
详细信息
ISBN:
(纸本)9783642020841
We consider a system consisting of a set of mobile sensors. They are disseminated in a region of interest and their mobility is controlled (as opposed to mobility imposed by the entity on which they are embedded). A routing protocol in this context enables any point of the region to be reached starting from any node, regardless of the initial sensor deployment. This operation involves message forwarding and/or sensor motion. In this paper we present GRASP, a GReedy stAteless Routing Protocol for mobile wireless sensor networks (WSN). GRASP is simple and independent from the underlying communication model, but still provides results close to the optimal, with respect to the self-deployment of sensors over a given region. It ensures that (i) routing is always possible in a mobile WSN irrespective of the number of sensors, and (ii) above a given number of sensors in a considered zone the protocol eventually enables the routing to no longer require sensors to move, which yields to self-deployment. With GRASP, sensors autonomously reach a stable full coverage following geometrical patterns. This requires only 1.5 times the optimal number of sensors to cover a region. A theoretical analysis of convergence proves these properties. Simulation results matching the analysis are also presented.
The proceedings contain 164 papers. The topics discussed include: on the design of a suitable hardware platform for protocol stack processing in LTE terminals;a region-based allocation approach for page-based scratch-...
ISBN:
(纸本)9780769538235
The proceedings contain 164 papers. The topics discussed include: on the design of a suitable hardware platform for protocol stack processing in LTE terminals;a region-based allocation approach for page-based scratch-pad memory in embedded systems;better than optimal: fast identification of custom instruction candidates;dynamic reconfigurable shaders with load balancing for embedded graphics processing;real time multiple object tracking using tracking matrix;visible and IR data fusion technique using the contourlet transform;a two-stage bootloader to support multi-application deployment and switching in wireless sensor networks;design of an RFID air protocol filtering technique;completely distributed low duty cycle communication for long-living sensor networks;implementation of rate control in distributed wireless multicast by neural network prediction;a middleware for controlling the execution of composite services;and reducing code size by graph coloring register allocation and assignment algorithm for mixed-width ISA processor.
Minimizing energy dissipation and maximizing network lifetime are among the central concerns when designing applications and protocols for wireless sensor networks In this paper we propose an energy-efficient clusteri...
详细信息
ISBN:
(纸本)9781424447541
Minimizing energy dissipation and maximizing network lifetime are among the central concerns when designing applications and protocols for wireless sensor networks In this paper we propose an energy-efficient clustering and routing scheme for wireless sensor networks (EECR) It mainly includes distributed nodes clustering, dynamic cluster head rotation and Inter-cluster routing selection In clustering stage, we Introduce an uneven clustering mechanism Cluster heads (CHs) which are closer to the base station (BS) have smaller cluster size than those farther from BS, thus they can preserve some energy for the purpose of Inter-cluster data forwarding For the dynamic cluster head rotation mechanism, the sensor nodes perform cluster head function in turn which balances energy consumption well among CHs What is more, we propose an energy-efficient multi-hop routing protocol executed by BS for inter-cluster communication Our strategy is making the most of BS's energy, so the node energy in the network is saved furthest Simulation results show that EECR clearly prolongs the network lifetime over some related routing protocols
In this paper, we study the code distribution problem in multi-application wireless sensor networks (MA-WSNs), i.e., sensor networks that can support multiple applications. While MA-WSNs have many advantages over trad...
详细信息
ISBN:
(纸本)9783642020841
In this paper, we study the code distribution problem in multi-application wireless sensor networks (MA-WSNs), i.e., sensor networks that can support multiple applications. While MA-WSNs have many advantages over traditional WSNs, they tend to require frequent code movements in the network, and thus here new challenges for designing energy efficient code dissemination protocols. We propose MCP, a stateful Multicast based Code redistribution Protocol for achieving energy efficiency. Each node in MCP maintains a small table to record the interesting information of known applications. The table enables sending out multicast-based code dissemination requests such that only a subset of neighboring sensors contribute to code dissemination. Compared to broadcasting based schemes, MCP greatly reduces signal collision and saves both the dissemination time and reduces the number of dissemination messages. Our experiments results show that MCP can reduce dissemination time by 25% and message overhead by 20% under various network settings.
暂无评论