Computational self-awareness as design approach for visual sensor nodes

Author(s):  
Zakarya Guettatfi ◽  
Philipp Hubner ◽  
Marco Platzner ◽  
Bernhard Rinner
2013 ◽  
Vol 303-306 ◽  
pp. 187-190
Author(s):  
Lei You ◽  
Xin Su ◽  
Yu Tong Han

Wireless visual sensor network (WVSN) is emerging with many potential applications. The lifetime of a WVSN is seriously dependent on the energy shored in the battery of its sensor nodes as well as the adopted compression and resource allocation scheme. In this paper, we use the energy harvesting to provide almost perpetual operation of the networks and compressed-sensing-based encoding to decrease the power consumption of acquiring visual information at the front-end sensors. We propose a dynamic algorithm to jointly allocate power for both compressive-sensing-based visual information acquisition and data transmission, as well as the available bandwidth under energy harvesting and stability constraints. A virtual energy queue is introduced to control the resource allocation and the measurement rate in each time slot. The algorithm can guarantee the stability of the visual data queues in all sensors and achieve near-optimal performance.


2021 ◽  
Vol 29 (11) ◽  
pp. 2714-2723
Author(s):  
Xing WANG ◽  
◽  
Mei-zhen WANG ◽  
Xue-jun LIU ◽  
◽  
...  

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 45110-45122 ◽  
Author(s):  
Radhika Kamath ◽  
Mamatha Balachandra ◽  
Srikanth Prabhu

Sensors ◽  
2020 ◽  
Vol 20 (20) ◽  
pp. 5882
Author(s):  
Sitong Sun ◽  
Wen Yang ◽  
Wilson Wang

Seatbelt state monitoring is important in intercity buses for passenger safety. This paper discusses the issues and challenges in power-saving design of radio frequency identification (RFID) sensor networks in bus seatbelt monitoring. A new design approach is proposed in this work for low-power layout and parameter setting in RFID sensor nodes in hardware and software design. A one-to-many pairing registration method is suggested between the concentrator and the seat nodes. Unlike using extra computer software to write seat identification (ID) into an integrated circuit (IC) card, the node ID in this project can be stored into the concentrator directly, which can reduce intermediate operations and reduce development costs. The effectiveness of the proposed low-power design approach is verified by some experimental tests.


2012 ◽  
Vol 3 (2) ◽  
pp. 58-71 ◽  
Author(s):  
Muhammad Imran ◽  
Khursheed Khursheed ◽  
Abdul Waheed Malik ◽  
Naeem Ahmad ◽  
Mattias O’Nils ◽  
...  

Wireless Vision Sensor Networks (WVSNs) is an emerging field which consists of a number of Visual Sensor Nodes (VSNs). Compared to traditional sensor networks, WVSNs operates on two dimensional data, which requires high bandwidth and high energy consumption. In order to minimize the energy consumption, the focus is on finding energy efficient and programmable architectures for the VSN by partitioning the vision tasks among hardware (FPGA), software (Micro-controller) and locality (sensor node or server). The energy consumption, cost and design time of different processing strategies is analyzed for the implementation of VSN. Moreover, the processing energy and communication energy consumption of VSN is investigated in order to maximize the lifetime. Results show that by introducing a reconfigurable platform such as FPGA with small static power consumption and by transmitting the compressed images after pixel based tasks from the VSN results in longer battery lifetime for the VSN.


2017 ◽  
Vol 13 (2) ◽  
pp. 155014771769417 ◽  
Author(s):  
Zhili Zhou ◽  
QM Jonathan Wu ◽  
Fang Huang ◽  
Xingming Sun

Currently, a huge amount of visual data such as digital images and videos have been collected by visual sensor nodes, that is, camera nodes, and distributed on visual sensor networks. Among the visual data, there are a lot of near-duplicate images, which cause a serious waste of limited storage, computing, and transmission resources of visual sensor networks and a negative impact on users’ experience. Thus, near-duplicate image elimination is urgently demanded. This article proposes a fast and accurate near-duplicate elimination approach for visual sensor networks. First, a coarse-to-fine clustering method based on a combination of global feature and local feature is proposed to cluster near-duplicate images. Then in each near-duplicate group, we adopt PageRank algorithm to analyze the contextual relevance among images to select and reserve seed image and remove the others. The experimental results prove that the proposed approach achieves better performances in the aspects of both efficiency and accuracy compared with the state-of-the-art approaches.


Computers ◽  
2021 ◽  
Vol 10 (8) ◽  
pp. 93
Author(s):  
Eyassu Dilla Diratie ◽  
Durga Prasad Sharma ◽  
Khaldoun Al Agha

Wireless Multimedia Sensor Networks (WMSNs) based on IEEE 802.11 mesh networks are effective and suitable solutions for video surveillance systems in detecting intrusions in selected monitored areas. The IEEE 802.11-based WMSNs offer high bit rate video transmissions but are challenged by energy inefficiency issues and concerns. To resolve the energy inefficiency challenges, the salient research studies proposed a hybrid architecture. This newly evolved architecture is based on the integration of IEEE 802.11-based mesh WMSNs along with the LoRa network to form an autonomous and high bitrate, energy-efficient video surveillance system. This paper proposes an energy-aware and Quality of Service (QoS) routing mechanism for mesh-connected visual sensor nodes in a hybrid Internet of Things (IoT) network. The routing algorithm allows routing a set of video streams with guaranteed bandwidth and limited delay using as few visual sensor nodes as possible in the network. The remaining idle visual sensor nodes can be turned off completely, and thus it can significantly minimize the overall energy consumption of the network. The proposed algorithm is numerically simulated, and the results show that the proposed approach can help in saving a significant amount of energy consumption while guaranteeing bandwidth and limited delay.


Sensors ◽  
2018 ◽  
Vol 18 (8) ◽  
pp. 2629 ◽  
Author(s):  
Thiago Jesus ◽  
Paulo Portugal ◽  
Francisco Vasques ◽  
Daniel Costa

Wireless sensor networks have been considered as an effective solution to a wide range of applications due to their prominent characteristics concerning information retrieving and distributed processing. When visual information can be also retrieved by sensor nodes, applications acquire a more comprehensive perception of monitored environments, fostering the creation of wireless visual sensor networks. As such networks are being more often considered for critical monitoring and control applications, usually related to catastrophic situation prevention, security enhancement and crises management, fault tolerance becomes a major expected service for visual sensor networks. A way to address this issue is to evaluate the system dependability through quantitative attributes (e.g., reliability and availability), which require a proper modeling strategy to describe the system behavior. That way, in this paper, we propose a methodology to model and evaluate the dependability of wireless visual sensor networks using Fault Tree Analysis and Markov Chains. The proposed modeling strategy considers hardware, battery, link and coverage failures, besides considering routing protocols on the network communication behavior. The methodology is automated by a framework developed and integrated with the SHARPE (Symbolic Hierarchical Automated Reliability and Performance Evaluator) tool. The achieved results show that this methodology is useful to compare different network implementations and the corresponding dependability, enabling the uncovering of potentially weak points in the network behavior.


Sensors ◽  
2019 ◽  
Vol 19 (19) ◽  
pp. 4106 ◽  
Author(s):  
Yonghua Xiong ◽  
Jing Li ◽  
Manjie Lu

Coverage and network lifetime are two fundamental research issues in visual sensor networks. In some surveillance scenarios, there are some critical locations that demand to be monitored within a designated period. However, with limited sensor nodes resources, it may not be possible to meet both coverage and network lifetime requirements. Therefore, in order to satisfy the network lifetime constraint, sometimes the coverage needs to be traded for network lifetime. In this paper, we study how to schedule sensor nodes to maximize the spatial-temporal coverage of the critical locations under the constraint of network lifetime. First, we analyze the sensor node scheduling problem for the spatial-temporal coverage of the critical locations and establish a mathematical model of the node scheduling. Next, by analyzing the characteristics of the model, we propose a Two-phase Spatial-temporal Coverage-enhancing Method (TSCM). In phase one, a Particle Swarm Optimization (PSO) algorithm is employed to organize the directions of sensor nodes to maximize the number of covered critical locations. In the second phase, we apply a Genetic Algorithm (GA) to get the optimal working time sequence of each sensor node. New coding and decoding strategies are devised to make GA suitable for this scheduling problem. Finally, simulations are conducted and the results show that TSCM has better performance than other approaches.


Sign in / Sign up

Export Citation Format

Share Document