• Journal of Information Technology Applications and Management
• /
• 제12권4호
• /
• pp.13-24
• /
• 2005

The sensor network is a key component of the ubiquitous computing system which is expected to be widely utilized in logistics control, environment/disaster control, medical/health-care services, digital home and other applications. Nodes in the sensor network are small-sized and exposed to adverse environments. They are demanded to perform their missions with very limited power supply only. Also the sensor network is composed of much more nodes than the wireless ad hoc networks are. In case that some nodes consume up their power capacity, the network topology should change, and rerouting/retransmission is necessitated. Communication protocols studied for conventional wireless networks or ad hoc networks are not suited for the sensor network resultantly. Schemes should be devised to control the efficient usage of node power in the sensor network. This paper proposes a medium access protocol to enhance the efficiency of energy consumption in the sensor network node. Its performance is analyzed by simulation.

• Journal of Information Processing Systems
• /
• 제6권3호
• /
• pp.295-306
• /
• 2010

Network lifetime is a critical issue in Wireless Sensor Networks (WSNs). In which, a large number of sensor nodes communicate together to perform a predetermined sensing task. In such networks, the network life time depends mainly on the lifetime of the sensor nodes constituting the network. Therefore, it is essential to balance the energy consumption among all sensor nodes to ensure the network connectivity. In this paper, we propose an energy-efficient data routing protocol for wireless sensor networks. Contrary to the protocol proposed in [6], that always selects the path with minimum hop count to the base station, our proposed routing protocol may choose a longer path that will provide better distribution of the energy consumption among the sensor nodes. Simulation results indicate clearly that compared to the routing protocol proposed in [6], our proposed protocol evenly distributes the energy consumption among the network nodes thus maximizing the network life time.

• 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)
• /
• 제8권3호
• /
• pp.911-923
• /
• 2014

Ad hoc cognitive radio wireless sensor networks allow secondary wireless sensor nodes to recognize spectrum opportunities and transmit data. Most existing protocols proposed for ad hoc cognitive radio wireless sensor networks require a dedicated common control channel. Allocating one channel just for control packet exchange is a waste of resources for channel-constrained networks. There are very few protocols that do not rely on a common control channel and that exchange channel-negotiation control packets during a pre-allocated time on the data channels. This, however, can require a substantial amount of time to access the channel when an incumbent is present on the channel, where the nodes are intended to negotiate for the data channel. This study examined channel access delay on cognitive radio wireless sensor networks that have no dedicated common control channel.

• 융합보안논문지
• /
• 제8권1호
• /
• pp.91-100
• /
• 2008

The previous works in sensor networks security have focused on the aspect of confidentiality, authentication and integrity based on cryptographic primitives. There has been no prior work to assess the survivability in systematic way. Accordingly, this paper presents a survivability model of wireless sensor networks using software rejuvenation for dual adaptive cluster head. The survivability model has state transition to reflect status of real wireless sensor networks. In this paper, we only focus on a survivability model which is capable of describing cluster head compromise in the networks and able to switch over the redundant cluster head in order to increase the survivability of that cluster. Second, this paper presents how to enhance the survivability of sensor networks using software rejuvenation methodology for dual cluster head in wireless sensor network. We model and analyze each cluster as a stochastic process based on Semi Markov Process (SMP) and Discrete Time Markov Chain (DTMC). The proof of example scenarios and numerical analysis shows the feasibility of our approach.

• Smart Structures and Systems
• /
• 제6권3호
• /
• pp.263-275
• /
• 2010

In the last decade, wireless sensor networks have emerged as a promising technology that could accelerate progress in the field of structural monitoring. The main advantages of wireless sensor networks compared to conventional monitoring technologies are fast deployment, small interference with the surroundings, self-organization, flexibility and scalability. These features could enable mass application of monitoring systems, even on smaller structures. However, since wireless sensor network nodes are battery powered and data communication is the most energy consuming task, transferring all the acquired raw data through the network would dramatically limit system lifetime. Hence, data reduction has to be achieved at the node level in order to meet the system lifetime requirements of real life applications. The objective of this paper is to discuss some general aspects of data processing and management in monitoring systems based on wireless sensor networks, to present a prototype monitoring system for civil engineering structures, and to illustrate long-term field test results.

• 전기전자학회논문지
• /
• 제13권1호
• /
• pp.71-76
• /
• 2009

As one of the most important requirements for wireless sensor networks, prolonging network lifetime can be realized by minimizing energy consumption in cluster heads as well as sensor nodes. While most of the previous researches have focused on the energy of sensor nodes, we devote our attention to cluster heads because they are most dominant source of power consumption in the cluster-based sensor networks. Therefore, we seek to minimize energy consumption by minimizing the maximum(MINMAX) energy dissipation at each cluster heads. This work requires energy-efficient clustering of the sensor nodes while satisfying given energy constraints. In this paper, we present a constraint satisfaction modeling of cluster-based routing in a heterogeneous sensor networks because mixed integer programming cannot provide solutions to this MINMAX problem. Computational experiments show that substantial energy savings can be obtained with the MINMAX algorithm in comparison with a minimum total energy(MTE) strategy.

• Journal of Information Processing Systems
• /
• 제14권2호
• /
• pp.396-417
• /
• 2018

GR-tree and query aggregation techniques have been proposed for spatial query processing in conventional spatial query processing for wireless sensor networks. Although these spatial query processing techniques consider spatial query optimization, time query optimization is not taken into consideration. The index reorganization cost and communication cost for the parent sensor nodes increase the energy consumption that is required to ensure the most efficient operation in the wireless sensor node. This paper proposes itinerary-based R-tree (IR-tree) for more efficient spatial-temporal query processing in wireless sensor networks. This paper analyzes the performance of previous studies and IR-tree, which are the conventional spatial query processing techniques, with regard to the accuracy, energy consumption, and query processing time of the query results using the wireless sensor data with Uniform, Gauss, and Skew distributions. This paper proves the superiority of the proposed IR-tree-based space-time indexing.

• 대한임베디드공학회논문지
• /
• 제15권5호
• /
• pp.243-249
• /
• 2020

Event detection in wireless sensor networks is a key requirement in many applications. Acoustic sensors are one of the most frequently used sensors for event detection in sensor networks, but they are sensitive and difficult to handle because they vary greatly depending on the environment and target characteristics of the sensor field. In this paper, we propose a learning-based improvement of CFAR algorithm for increasing node-level event detection performance in acoustic sensor networks, and verify the effectiveness of the designed algorithm by comparing and evaluating the event detection performance with other algorithms. Our experimental results demonstrate the superiority of the proposed algorithm by increasing the detection accuracy by more than 45.16% by significantly reducing false positives by 7.97 times while slightly increasing the false negative compared to the existing algorithm.