Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to just several days, or demands considera...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to just several days, or demands considerable maintenance efforts (e.g., in terms of battery substitution). A large portion of the energy of sensor applications is spent in node discovery as nodes need to periodically advertise their presence and be awake to discover other nodes for data exchange. the optimization of energy consumption, which is generally a hard task in fixed sensor networks, is even harder in mobile sensor networks, where the neighbouring nodes change over time. In this paper we propose an algorithm for energy efficient node discovery in sparsely connected mobile wireless sensor networks. the work takes advantage of the fact that nodes have temporal patterns of encounters and exploits these patterns to drive the duty cycling. Duty cycling is seen as a sampling process and is formulated as an optimization problem. We have used reinforcement learning techniques to detect and dynamically change the times at which a node should be awake as it is likely to encounter other nodes. We have evaluated our work using real human mobility traces, and the paper presents the performance of the protocol in this context.
the delay-tolerant mobile sensor network (DTMSN) distinguishes itself from conventional sensor networks by several unique characteristics, such as nodal mobility, sparse connectivity, delay tolerability, and fault tol...
详细信息
Biological research in agriculture needs a lot of specialised electronic sensors in order to fulfil different goals, like as: climate monitoring, soil and fruit assessment, control of insects and diseases, crop tracki...
详细信息
ISBN:
(纸本)9780769530994
Biological research in agriculture needs a lot of specialised electronic sensors in order to fulfil different goals, like as: climate monitoring, soil and fruit assessment, control of insects and diseases, crop tracking, and so on. that research must be supported by consistent biological models able to simulate diverse environmental conditions, in order to predict the right human actions before risky biological damage could be irreversible. In this paper, an experimental distributed network based on climatic an biological wireless sensors is described. this system provides real measurements in order to validate different biological models used for viticulture applications.
the problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vici...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
the problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces S-I and S-C and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating S-I and Se is identified using Neyman-Pearson criteria. thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. the average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. the optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.
In this research, we propose the dynamic scheduling in the sensor network. A system observes a production of electricity and the residual quantity of a battery, and changes the schedule of a system.
ISBN:
(纸本)9784907764319
In this research, we propose the dynamic scheduling in the sensor network. A system observes a production of electricity and the residual quantity of a battery, and changes the schedule of a system.
We present Chequery, a novel query processing framework that brings together model checking approaches and query processing techniques for sensor networks. In addition to its expressiveness, Chequery provides sound me...
详细信息
ISBN:
(纸本)9784907764319
We present Chequery, a novel query processing framework that brings together model checking approaches and query processing techniques for sensor networks. In addition to its expressiveness, Chequery provides sound mechanisms available to sensor networks' administrators for building their data management-oriented tasks.
the proceedings contain 48 papers. the topics discussed include: design of an analog-digital PI controller with gain scheduling for laser tracker systems;one modification of the cusum test for detection early structur...
ISBN:
(纸本)9789898111326
the proceedings contain 48 papers. the topics discussed include: design of an analog-digital PI controller with gain scheduling for laser tracker systems;one modification of the cusum test for detection early structural changes;recursive bias-compensating algorithm for identification of dynamical bilinear systems in the errors-in-variables framework;asymptotic theory of the reachable sets to linear periodic impulsive control systems;identification of multi-dimensional system based on a novel criterion;synthesis method of a PN controller using forbidden transitions sequences;path planning using discretized equilibrium paths;a framework for distributed and intelligent process control;model based design of networked embedded systems - a modeling approach using FlexRay as an example;and real-time systems safety control considering human machine interface;and sliding mode control - is it necessary sliding motion?.
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands ...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. In general, the problems we study are NP-hard even to approximate, and so we focus on heuristic algorithms that perform well in practice. In the static setting, we propose a greedy centralized solution and a more sophisticated solution that uses the Generalized Assignment Problem model and can be implemented in a distributed fashion. In the dynamic setting, we give heuristic algorithms in which available sensors propose to nearby missions as they arrive. We find that the overall performance can be significantly improved if available sensors sometimes refuse to offer utility to missions they could help based on the value of the mission, the sensor's remaining energy, and (if known) the remaining target lifetime of the network. Finally, we evaluate our solutions through simulations.
Data gathering is a common but critical operation in many applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering ...
详细信息
ISBN:
(纸本)9780769530994
Data gathering is a common but critical operation in many applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach in wireless sensor networks, which can increase scalability and lifetime. these networks require robust wireless communication protocols that are energy efficient and provide low latency. In this paper, we develop and analyze an efficient cooperative transmission protocol with robust clustering (RCCT) for sensor networks that considers a fault-tolerant and energy-efficient distributed clustering with minimum overhead. RCCT distributes energy load by energy-aware member selection for cooperative data transmission. Simulation results show a better performance of RCCT as compared to the conventional protocols.
Energy dissipation is focused in energy constraint communication systems such as in Wireless sensor networks, which depends on both channel conditions and communication protocols. Assuming in stop-and-wait ARQ (automa...
详细信息
ISBN:
(纸本)9781424421077
Energy dissipation is focused in energy constraint communication systems such as in Wireless sensor networks, which depends on both channel conditions and communication protocols. Assuming in stop-and-wait ARQ (automatic request for repeat) protocols on Rayleigh fading channel, in this paper, we derive eqs. (1) to (5) and then establish a model of transmission energy dissipation for per payload bit. By computer simulation, we obtain Fig. 1, Fig. 2 and Fig. 3. Results in these Figs. show that, for specified frame header length and frame error rates (FER), there exists the optimal frame length for the lowest energy dissipation and then this optimal frame length is determined If the payload length is equaled to the frame header length in bits. On the other hand, for given optimal frame lengths, there exist the optimal frame error rate for the lowest energy dissipation although it is approximately 0.65. Furthermore, boththe optimal frame length and the optimal frame error rate are not related to each other.
暂无评论