• 대한임베디드공학회논문지
• /
• 제7권6호
• /
• pp.323-330
• /
• 2012

Wireless sensor networks need middleware system for efficiently managing the constrained resource and sensing data because they need different sensing data type and protocol to communicate with heterogeneous sensor networks. Thus this paper proposes data-centric sensor middleware for heterogeneous sensor networks. The proposed middleware have to support various query processing of user applications, high-level request of users, manage heterogeneous sensor systems and universal sensing data type for node and user application.

• ETRI Journal
• /
• 제30권5호
• /
• pp.696-706
• /
• 2008

With the increasing need for intelligent environment monitoring applications and the decreasing cost of manufacturing sensor devices, it is likely that a wide variety of sensor networks will be deployed in the near future. In this environment, the way to access heterogeneous sensor networks and the way to integrate various sensor data are very important. This paper proposes the common system for middleware of sensor networks (COSMOS), which provides integrated data processing over multiple heterogeneous sensor networks based on sensor network abstraction called the sensor network common interface. Specifically, this paper introduces the sensor network common interface which defines a standardized communication protocol and message formats used between the COSMOS and sensor networks.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.101-104
• /
• 2007

Efficient Query processing and optimization are critical for reducing network traffic and decreasing latency of query when accessing and manipulating sensor data of large-scale sensor networks. Currently it has been studied in sensor database projects. These works have mainly focused on in-network query processing for sensor networks and assumes homogeneous sensor networks, where each sensor network has same hardware and software configuration. In this paper, we present a framework for efficient query processing over heterogeneous sensor networks. Our proposed framework introduces query processing paradigm considering two heterogeneous characteristics of sensor networks: (1) data dissemination approach such as push, pull, and hybrid; (2) query processing capability of sensor networks if they may support in-network aggregation, spatial, periodic and conditional operators. Additionally, we propose multi-query optimization strategies supporting cross-translation between data acquisition query and data stream query to minimize total cost of multiple queries. It has been implemented in WSN middleware, COSMOS, developed by ETRI.

• Smart Structures and Systems
• /
• 제11권5호
• /
• pp.497-510
• /
• 2013

Quick, accurate damage monitoring is strongly required for damage assessment in the aftermath of a large natural disaster. Wireless sensor networks are promising technologies to acquire damage information in a citywide area. The wireless sensor networks, however, would be faced with difficulty to collect data in real-time and to expand the scalability of the networks. This paper discusses a scheme of network architecture to cove a whole city in multi-tier heterogeneous networks, which consist of wireless sensor networks, access networks and a backbone network. We first review previous studies for citywide damage monitoring, and then discuss the feature of multi-tier heterogeneous networks to cover a citywide area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1249-1272
• /
• 2016

In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

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

This paper presents a novel range-free localization algorithm based on quantum particle swarm optimization. The proposed algorithm is capable of estimating the distance between two non-neighboring sensors for multi-hop heterogeneous wireless sensor networks where all nodes' communication ranges are different. Firstly, we construct a new cumulative distribution function of expected hop progress for sensor nodes with different transmission capability. Then, the distance between any two nodes can be computed accurately and effectively by deriving the mathematical expectation of cumulative distribution function. Finally, quantum particle swarm optimization algorithm is used to improve the positioning accuracy. Simulation results show that the proposed algorithm is superior in the localization accuracy and efficiency when used in random and uniform placement of nodes for heterogeneous wireless sensor networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4856-4871
• /
• 2015

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권1호
• /
• pp.147-161
• /
• 2012

In recent years, machine-to-machine (M2M) communications are under rapid development to meet the fast-increasing requirements of multi-type wireless services and applications. In order to satisfy M2M communications requirements, heterogeneous networks convergence appears in many areas, i.e., mobile cellular networks (MCNs) and wireless sensor networks (WSNs) are evolving from heterogeneous to converged. In this paper, we introduce the system architecture and application requirement for converged MCN and WSN, where mobile terminals in MCN are acting as both sensor nodes and gateways for WSN. And then, we discuss the joint optimization of converged networks for M2M communications. Finally, we discuss the technical challenges in the converged process of MCN and WSN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1779-1798
• /
• 2018

Heterogeneous wireless sensor networks (HEWSN) is a kind of wireless sensor networks (WSN), each sensor may has different attributes, HEWSN has been widely used in many aspects. Due to sensors are deployed in unattended environments and its resource constrained feature, the design of security and efficiency balanced authentication scheme for HEWSN becomes a vital challenge. In this paper, we propose a secure and lightweight user authentication and key agreement scheme based on biometric for HEWSN. Firstly, fuzzy extractor is adopted to handle the user's biometric information. Secondly, we achieve mutual authentication and key agreement among three entities, which are user, gateway and cluster head in the four phases. Finally, formal security analysis shows that the proposed scheme defends against various security pitfalls. Additionally, comparison results with other surviving relevant schemes show that our scheme is more efficient in term of computational cost, communication cost and estimated time. Therefore, the proposed scheme is well suitable for practical application in HEWSN.