By combining the wavelet domain filtering and multi-sensor linear information fusion rule, we propose a new distributed and parallel algorithm for multi-sensor information fusion using the theory of wavelet domain mul...
详细信息
ISBN:
(纸本)9781424447541
By combining the wavelet domain filtering and multi-sensor linear information fusion rule, we propose a new distributed and parallel algorithm for multi-sensor information fusion using the theory of wavelet domain multi-scale analysis The proposed algorithm decomposes the single sensor's information into different scale, and then estimates the target state in different scale, then the local state estimates are transmitted to the fusion-center to get the optimal information fusion estimate The posterior Cramer-Rao lower bound (PCRLB) of the proposed algorithm is also given An example of radar tracking system with three sensors is provided to illuminate the effectiveness of the method
Energy conservation, coverage and connectivity are three critical application requirements in wireless sensor networks. Related researches have either concerned coverage, connectivity, and energy conservation separate...
详细信息
ISBN:
(纸本)9781424444465
Energy conservation, coverage and connectivity are three critical application requirements in wireless sensor networks. Related researches have either concerned coverage, connectivity, and energy conservation separately or required sensing/communication range restrictions. In this paper;we aim to maximize the network lifetime, while maintaining coverage and connectivity simultaneously, without any sensing or communication range restriction. We propose MDS-MCC problem and we prove it is NP-complete. We also present a heuristic algorithm to solve MDS-MCC. Furthermore, we study MDS-MCC problem under some special conditions and obtain some important theoretical results.
In this paper, we derive a theoretical model to calculate the available bandwidth of a path and study its upper and lower bounds with background traffic. We show that the clique constraint widely used to construct upp...
详细信息
ISBN:
(纸本)9781424444816
In this paper, we derive a theoretical model to calculate the available bandwidth of a path and study its upper and lower bounds with background traffic. We show that the clique constraint widely used to construct upper bounds does not hold any more when links are allowed to use different rates at different time. In our proposed model, traditional clique is coupled with rate vector to more properly characterize the conflicting relationships among links in wireless sensor networks where time-varying link adaption is used. Based on the model, we also investigate the problem of joint optimization of QoS routing and propose several routing metrics. The newly proposed conservative clique constraint performs the best among the studied metrics in estimating available bandwidth of flows with background traffic.
Latest research results in the areas of computer vision and embedded systems have made way for smart cameras. These cameras use a built-in computing unit to analyse images directly at the CCD sensor. Smart cameras can...
详细信息
ISBN:
(纸本)9781424444465
Latest research results in the areas of computer vision and embedded systems have made way for smart cameras. These cameras use a built-in computing unit to analyse images directly at the CCD sensor. Smart cameras can cooperate in order to analyse scenes from different perspectives and track objects autonomously. In large smart camera systems (also known as distributed vision networks), distributed algorithms are needed that allow for cooperation and self-organisation among cameras. This paper focuses on alarm management in distributed vision networks, in which security staff is equipped with mobile terminals. These terminals and cameras are connected via an adhoc network. We present a robust and lightweight algorithm that allows to notify guards quickly in case serious incidents have happened. This algorithm has been evaluated by simulation experiments and in a modestly sized real world testbed. Results show that the algorithm takes reasonable time to terminate (10s) in a network of 100 cameras.
Random walk is one of the widely used techniques for information discovery in unstructured networks like Ad hoc Wireless Networks (AWNs) and Wireless sensor Networks (WSNs). In a Random walk, instead of taking all ste...
详细信息
ISBN:
(纸本)9781424444465
Random walk is one of the widely used techniques for information discovery in unstructured networks like Ad hoc Wireless Networks (AWNs) and Wireless sensor Networks (WSNs). In a Random walk, instead of taking all steps uniform randomly, our idea is to modify Random walk to take some level biased steps to improve its energy efficiency and latency which are important design parameters in WSNs. The level of a node is defined as the minimum number of hops required for a packet to reach the sink node from that node. We propose two walk based search protocols viz., Several Short Random Walks (SSRW) search and Random Walk with Level Biased Jumps (RWLBJ) search, that use a combination of uniform random and level biased steps for energy efficient search in WSNs. The idea is that the biased steps in the proposed protocols decrease the correlation among visited sensor nodes which increases the node coverage of the protocols. We show by theoretical analysis that using biased steps in Random walks increases their efficiency in terms of energy consumption and latency of search. We also show by extensive simulations that SSRW and RWLBJ are better choices compared to that of pure Random walk in terms of the energy consumption and latency of search.
Building a "Straightforward" path in wireless ad hoc sensor networks (WASNs) not only avoids wasting energy in detours, but also incurs less interference in other transmissions when fewer nodes are involved ...
详细信息
ISBN:
(纸本)9781424444465
Building a "Straightforward" path in wireless ad hoc sensor networks (WASNs) not only avoids wasting energy in detours, but also incurs less interference in other transmissions when fewer nodes are involved in the transmission. This plays an important role in recent WASN applications that require a streaming service to deliver large amount of data. In this paper;we extend our early work on the straightforward path routing in WASNs in the presence of the "local minima". where the routing is blocked due to the lack of available forwarding successors. We bring some new insights of the safety information model for a forwarding routing that is limited in the request zone. A new routing is proposed to make a more intelligent decision in greedy advance and achieve more straightforward paths. The experimental results show substantial improvements of our approach compared with the best result known to date.
Localization is a crucial service for various applications in wireless sensor networks (WSNs). Although most researches assume stationary nodes, sensor mobility can enrich the application scenarios. Existing dynamic l...
详细信息
ISBN:
(纸本)9781424444816
Localization is a crucial service for various applications in wireless sensor networks (WSNs). Although most researches assume stationary nodes, sensor mobility can enrich the application scenarios. Existing dynamic localization approaches require high seed density or incur a large communication overhead. In order to address these problems, we propose an efficient rang free localization algorithm, EUL, which utilizes the relationship between neighboring nodes to estimate their possible location boundaries. Our algorithm not only allows all the nodes to remain static or move freely but also reduces the dependence or? seeds, which achieves a uniform energy distribution to address the excessive energy drain around seeds and lengthen the network lifetime. We have evaluated EUL together with other major dynamic localization approaches. Simulation results show that EUL outperforms existing approaches in terms of accuracy under many different mobility conditions.
Embedded wireless networks have largely focused on open-loop sensing and monitoring. To address actuation in closed-loop wireless control systems there is a strong need to re-think the communication architectures and ...
详细信息
ISBN:
(纸本)9781424444465
Embedded wireless networks have largely focused on open-loop sensing and monitoring. To address actuation in closed-loop wireless control systems there is a strong need to re-think the communication architectures and protocols for reliability, coordination and control. As the links, nodes and topology of wireless systems are inherently unreliable, such time-critical and safety-critical applications require programming abstractions where the tasks are assigned to the sensors, actuators and controllers as a single component rather than statically mapping a set of tasks to a specific physical node at design time. To this end, we introduce the Embedded Virtual Machine (EVM), a powerful and flexible programming abstraction where virtual components and their properties are maintained across node boundaries. In the context of process and discrete control, an EVM is the distributed runtime system that dynamically selects primary-backup sets of controllers to guarantee QoS given spatial and temporal constraints of the underlying wireless network. The EVM architecture defines explicit mechanisms for control, data and fault communication within the virtual component. EVM-based algorithms introduce new capabilities such as predictable outcomes and provably minimal graceful degradation during sensor/actuator failure, adaptation to mode changes and runtime optimization of resource consumption. Through the design of a natural gas process plant hardware-in-loop simulation we aim to demonstrate the preliminary capabilities of EVM-based wireless networks.
In a pervasive sensor system, application entities may use the available infrastructure resources such as sensing devices, actuators, wireless modules and gateways to accomplish various tasks. For example, a group of ...
详细信息
ISBN:
(纸本)9781424433032
In a pervasive sensor system, application entities may use the available infrastructure resources such as sensing devices, actuators, wireless modules and gateways to accomplish various tasks. For example, a group of humans/robots may use the infrastructure to track the current location of the group members. Many such tasks require a service which keeps track of the order of occurrence of events in the application. Existing algorithms for this problem have been designed for traditional distributedsystems using the layering paradigm where the algorithm is able to observe and intercept application messages. Pervasive applications, however, may not be structured as strictly layered systems. In this paper, we study the problem of event ordering in pervasive systems, and propose algorithms for detecting event ordering. Our first algorithm treats the entire network as a single graph, whereas the second algorithm operates in a hierarchical manner by subdividing the network into smaller groups. We present experimental evaluation of our algorithms using both simulation and deployment on a sensor testbed.
Recent years have witnessed the pilot deployments of audio or low-rate video wireless sensor networks for a class of mission-critical applications including search and rescue, security, surveillance, and disaster mana...
详细信息
ISBN:
(纸本)9781424444816
Recent years have witnessed the pilot deployments of audio or low-rate video wireless sensor networks for a class of mission-critical applications including search and rescue, security, surveillance, and disaster management. In this paper, we report the design and implementation of Quality-aware Voice Streaming (QVS) for wireless sensor networks. QVS is built upon SenEar, a new sensor hardware platform we developed for high-bandwidth wireless audio communication. QVS comprises several novel components, which include an empirical model for online voice quality, evaluation and control, dynamic voice compression/duplication adaptation for lossy wireless links, and distributed stream admission control that exploits network capacity for rate allocation. We have extensively tested QVS on a 20-node network deployment. Our experimental results show that QVS delivers satisfactory, voice quality under a range of realistic settings while achieving high network capacity utilization.
暂无评论