• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권3호
• /
• pp.1287-1300
• /
• 2018

Target-tracking algorithm based on ad hoc camera sensor networks (ACSNs) utilizes the distributed observation capability of nodes to achieve accurate target tracking. A compressed sensing-based multiple-target tracking algorithm (CSMTTA) for ACSNs is proposed in this work based on the study of camera node observation projection model and compressed sensing model. The proposed algorithm includes reconfiguration of observed signals and evaluation of target locations. It reconfigures observed signals by solving the convex optimization of L1-norm least and forecasts node group to evaluate a target location by the motion features of the target. Simulation results show that CSMTTA can recover the subtracted observation information accurately under the condition of sparse sampling to a high target-tracking accuracy and accomplish the distributed tracking task of multiple mobile targets.

• 정보처리학회논문지D
• /
• 제13D권3호
• /
• pp.391-398
• /
• 2006

본 논문에서는 최근 많은 연구가 진행되고 있는 무선 센서 네트워크 분야에서 이동 센서 노드의 배치 알고리즘인 DSSA(Distributed Self Spreading Algorithm)와 TBDA(Tree Based Deployment Algorithm)을 모델링 하고, 이들 알고리즘의 안정성과 정확성을 널리 사용되고 있는 모델 검증 도구인 SPIN을 이용하여 검증한다. 그리고 두 알고리즘이 무선 센서 네트워크의 중요사항인 에너지 소비면에서 효율적으로 동작하는지 SPIN 검증 도구를 이용하여 비교분석하고, DSSA에서 발생하는 진동에 대한 보완점을 제시한다.

• ETRI Journal
• /
• 제42권3호
• /
• pp.341-350
• /
• 2020

In a wireless sensor network (WSN), the data transmission technique based on the cooperative multiple-input multiple-output (CMIMO) scheme reduces the energy consumption of sensor nodes quite effectively by utilizing the space-time block coding scheme. However, in networks with high node density, the scheme is ineffective due to the high degree of correlated data. Therefore, to enhance the energy efficiency in high node density WSNs, we implemented the distributed source coding (DSC) with the virtual multiple-input multiple-output (MIMO) data transmission technique in the WSNs. The DSC-MIMO first compresses redundant source data using the DSC and then sends it to a virtual MIMO link. The results reveal that, in the DSC-MIMO scheme, energy consumption is lower than that in the CMIMO technique; it is also lower in the DSC single-input single-output (SISO) scheme, compared to that in the SISO technique at various code rates, compression rates, and training overhead factors. The results also indicate that the energy consumption per bit is directly proportional to the velocity and training overhead factor in all the energy saving schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권12호
• /
• pp.4492-4507
• /
• 2021

In camera sensor networks (CSNs), in order to better identify the point, full-view problem requires capture any facing direction of target (point or intruder), and its coverage prediction and sensor density issues are more complicated. At present, a lot of research supposes that a large number of homogeneous camera sensors are randomly distributed in a bounded square monitoring region to obtain full-view rate which is close to 1. In this paper, we deduce the sensor density prediction model in heterogeneous deployed CSNs with arbitrary full-view rate. Aiming to reduce the influence of boundary effect, we introduce the concepts of expanded monitoring region and maximum detection area. Besides, in order to verify the performance of the proposed sensor density model, we carried out different scenarios in simulation experiments to verify the theoretical results. The simulation results indicate that the proposed model can effectively predict the sensor density with arbitrary full-view rate.

• ETRI Journal
• /
• 제39권2호
• /
• pp.222-233
• /
• 2017

Debugging in distributed environments, such as wireless sensor networks (WSNs), which consist of sensor nodes with limited resources, is an iterative and occasionally laborious process for programmers. In sensor networks, it is not easy to find unintended bugs that arise during development and deployment, and that are due to a lack of visibility into the nodes and a dearth of effective debugging tools. Most sensor network debugging tools are not provided with effective facilities such as real-time tracing, remote debugging, or a GUI environment. In this paper, we present a hybrid debugging framework (HDF) that works on WSNs. This framework supports query-based monitoring and real-time tracing on sensor nodes. The monitoring supports commands to manage/control the deployed nodes, and provides new debug commands. To do so, we devised a debugging device called a Docking Debug-Box (D2-Box), and two program agents. In addition, we provide a scalable node monitor to enable all deployed nodes for viewing. To transmit and collect their data or information reliably, all nodes are connected using a scalable node monitor applied through the Internet. Therefore, the suggested framework in theory does not increase the network traffic for debugging on WSNs, and the traffic complexity is nearly O(1).

• 제어로봇시스템학회논문지
• /
• 제18권8호
• /
• pp.780-786
• /
• 2012

Surveillance has become one of promising application areas of wireless sensor networks which allow for pervasive monitoring of concerned environmental phenomena by facilitating context awareness through sensor fusion. Existing systems that depend on a postmortem context analysis of sensor data on a centralized server expose several shortcomings, including a single point of failure, wasteful energy consumption due to unnecessary data transfer as well as deficiency of scalability. As an opposite direction, this paper proposes an energy-efficient distributed context-aware surveillance in which sensor nodes in the wireless sensor network collaborate with neighbors in a distributed manner to analyze and aware surrounding context. We design and implement multi-modal sensor stations for use as sensor nodes in our wireless sensor network implementing our distributed context awareness. This paper presents an initial experimental performance result of our proposed system. Results show that multi-modal sensor performance of our sensor station, a key enabling factor for distributed context awareness, is comparable to each independent sensor setting. They also show that its initial performance of context-awareness is satisfactory for a set of introductory surveillance scenarios in the current interim stage of our ongoing research.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.57-71
• /
• 2009

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.870-872
• /
• 2007

Sensor networks have been widely applied for data collection. Due to the energy limitation of the sensor nodes and the most energy consuming data transmission, we should allocate as much work as possible to the sensors, such as data compression and aggregation, to reduce data transmission and save energy. Querying extreme values is a general query type in wireless sensor networks. In this paper, we propose a novel querying method called Two-Level Filter (TLF) for querying extreme values in wireless sensor networks. We first divide the whole sensor network into domains using the Distributed Data Aggregation Model (DDAM). The sensor nodes report their data to the cluster heads using push method. The advantages of two-level filter lie in two aspects. When querying extreme values, the number of pull operations has the lower boundary. And the query results are less affected by the topology changes of the wireless sensor network. Through this method, the sensors preprocess the data to share the burden of the base station and it combines push and pull to be more energy efficient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• Journal of Communications and Networks
• /
• 제7권3호
• /
• pp.284-293
• /
• 2005

A critical issue in applications involving networks of wireless sensors is their ability to synchronize, and mitigate the fading propagation channel effects. Especially when distributed 'slave' sensors (nodes) reach-back to communicate with the 'master' sensor (gateway), low power cooperative schemes are well motivated. Viewing each node as an antenna element in a multi-input multi-output (MIMO) multi-antenna system, we design pilot patterns to estimate the multiple carrier frequency offsets (CFO), and the multiple channels corresponding to each node-gateway link. Our novel pilot scheme consists of non-zero pilot symbols along with zeros, which separate nodes in a time division multiple access (TDMA) fashion, and lead to low complexity schemes because CFO and channel estimators per node are decoupled. The resulting training algorithm is not only suitable for wireless sensor networks, but also for synchronization and channel estimation of single- and multi-carrier MIMO systems. We investigate the performance of our estimators analytically, and with simulations.