• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.205-207
• /
• 2012

무선 센서 네트워크에서 에너지 효율적인 네트워크 구성을 위해 데이터를 수집하는 싱크 노드에 이동성을 적용시킨 모바일 싱크를 이용한 데이터 수집 기법이 활발하게 연구되고 있다. 하지만 최근 모바일 싱크를 적용한 데이터 수집 기법에서는 무선 센서 노드들의 에너지 소모를 분산시켜 네트워크의 수명은 증가시켰지만 고정적인 경로를 기반으로 하여 이벤트 데이터의 신속한 수집이 불가능하거나 이동성을 갖는 모바일 싱크로의 동적 라우팅 패스의 빈번한 설정으로 인해 최적화된 에너지 효율을 제공하지 못한다. 본 논문에서는 이와 같은 문제점을 해결하기 위해 모바일 싱크 기반의 무선 센서 네트워크 환경에서 에너지 효율성을 고려하여 이벤트 데이터를 우선 수집하는 데이터 수집 기법을 제안한다. 제안하는 기법은 특정 이벤트가 발생할 경우, 모바일 싱크의 이동성을 이용하여 특정 이벤트 데이터를 빠르게 수집하며 일반적인 모니터링 데이터의 압축과 전송 주기를 변경함으로써 전반적인 QoS를 향상시킨다. 성능평가 결과, 제안하는 기법은 기존 기법에 비해 이벤트 데이터에 대한 응답시간이 평균 57% 감소하였고, 네트워크의 수명이 평균 19% 증가하였다.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.833-852
• /
• 2019

In real time applications, due to their effective cost and small size, wireless networks play an important role in receiving particular data and transmitting it to a base station for analysis, a process that can be easily deployed. Due to various internal and external factors, networks can change dynamically, which impacts the localisation of nodes, delays, routing mechanisms, geographical coverage, cross-layer design, the quality of links, fault detection, and quality of service, among others. Conventional methods were programmed, for static networks which made it difficult for networks to respond dynamically. Here, machine learning strategies can be applied for dynamic networks effecting self-learning and developing tools to react quickly and efficiently, with less human intervention and reprogramming. In this paper, we present a wireless networks survey based on different machine learning algorithms and network lifetime parameters, and include the advantages and drawbacks of such a system. Furthermore, we present learning algorithms and techniques for congestion, synchronisation, energy harvesting, and for scheduling mobile sinks. Finally, we present a statistical evaluation of the survey, the motive for choosing specific techniques to deal with wireless network problems, and a brief discussion on the challenges inherent in this area of research.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.667-670
• /
• 2008

센서노드는 무선 센서네트워크를 통해서 감지한 정보를 싱크에게 전송한다. 최근 휴대 무선장비의 이용률 증가로 센서네트워크에서 데이터를 수집하는 싱크를 휴대 무선장비로 대체하여 이동성을 보장하는 연구가 활발히 진행된다. 즉, 싱크가 이동성을 가짐으로써 센서노드가 감지한 정보를 전달하는 방법이 중요한 문제로 부각되고 있다. 따라서 모바일 싱크의 위치를 효율적으로 알리고, 다중 소스노드에서 다중 싱크로 정보를 전달하는 것이 필요하다. 특히, 고정된 싱크에서 사용하던 데이터 전송경로는 모바일 싱크 환경에서 더 이상 효율적이지 못하다. 본 논문에서는 소스노드의 위치정보를 제공하기 위한 서버로서 8방향 앵커시스템(Eight-Direction Anchor system: EDA)을 제안한다. EDA는 센서네트워크의 가장자리에 위치한 센서노드의 편중된 에너지 소모를 막고, 전체 센서노드를 균형적으로 사용함으로써 균등한 에너지 소모를 보장한다. 또한, 모바일 싱크가 소스노드로부터 데이터를 연속적으로 받기위해서 위치기반 최단거리 전송(Location-based Shortest Relay: LSR) 프로토콜을 제안한다. LSR은 소스노드에서 싱크로의 우회하는 경로를 막고, 최소 지연경로를 통하여 연속적인 데이터 전송을 보장한다. 실험결과를 통해서 제안 프로토콜은 효율적인 위치서비스의 제공뿐만 아니라, 다중 소스와 다중 모바일 싱크 환경에서 평균 데이터 전송 비용절감 효과를 얻을 수 있음을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.12
• /
• pp.301-312
• /
• 2018

In industrial wireless sensor networks, the continuous object detection such as fire or toxic gas detection is one of major applications. A continuous object occurs at a specific point and then diffuses over a wide area. Therefore, many studies have focused on accurately detecting a continuous object and delivering data to a static sink with an energy-efficient way. Recently, some applications such as fire suppression require mobile sinks to provide real-time response. However, the sink mobility support in continuous object detection brings challenging issues. The existing approaches supporting sink mobility are designed for individual object detection, so they establish one-to-one communication between a source and a mobile sink for location update. But these approaches are not appropriate for a continuous object detection since a mobile sink should establish one-to-many communication with all sources. The one-to-many communication increases energy consumption and thus shortens the network lifetime. In this paper, we propose the origin-centric communication scheme to support sink mobility in a continuous object detection. Simulation results verify that the proposed scheme surpasses all the other work in terms of energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1359-1370
• /
• 2009

In wireless sensor networks, data dissemination is based on data-centric routing that well matches the publish/subscribe communication paradigm. The publish/subscribe paradigm requires decoupling properties: space, time, and synchronization decoupling. For large-scale applications, the three decoupling properties provide scalability and robust communication. However, existing data dissemination schemes for wireless sensor networks do not achieve full decoupling. Therefore, we propose a novel data dissemination scheme that fully accomplishes the three decoupling, called ARBIETER. ARBITER constructs an independent network structure as a logical software bus. Information interworking between publishers and subscribers is indirectly and asynchronously performed via the network structure. ARBITER also manages storage and mapping of queries and data on the structure because of supporting different time connection of publishers and subscribers. Our simulation proves ARBITER show better performance in terms of scalability, network robustness, data responsibility, mobility support, and energy efficiency.

• The Journal of the Korea Contents Association
• /
• v.19 no.7
• /
• pp.192-198
• /
• 2019

We propose an emergency rescue support communication system to quickly rescue passenger ships, such as large cruise ships, when a ship sinks or a disaster such as a fire occurs. A beacon is installed in the inside of the vessel, and the position and the status of the passenger are detected in real time through the Bluetooth communication in the mobile terminal carried by the passenger and transmitted to the server. When an emergency occurs, the server sends information on the passenger to the rescue agency, informs the passenger of the emergency, and guides evacuation. As a result of simulations using the designed system, it was confirmed that the server immediately notifies all terminals when an emergency occurred in more than half of the area. This system, which detects the accident in real time and notifies all terminals in the vessel, unlike the existing system that notifies the position of the accident vessel or simply the position of the passenger in the vessel, will be helpful for the rapid evacuation and rescue of the passenger.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.7
• /
• pp.12-19
• /
• 2020

The clustered heterogeneous wireless sensor network is comprised of sensor nodes and cluster heads, which are hierarchically organized for different objectives. In the network, we should especially take care of managing node resources to enhance network performance based on memory and battery capacity constraints. For instances, if some interesting events occur frequently in the vicinity of particular sensor nodes, those nodes might receive massive amounts of data. Data congestion can happen due to a memory bottleneck or link disconnection at cluster heads because the remaining memory space is filled with those data. In this paper, we utilize drones as mobile sinks to resolve data congestion and model the network, sensor nodes, and cluster heads. We also design a cost function and a congestion indicator to calculate the degree of congestion. Then we propose a data congestion map index and a data congestion mapping scheme to deploy drones at optimal points. Using control variable, we explore the relationship between the degree of congestion and the number of drones to be deployed, as well as the number of drones that must be below a certain degree of congestion and within communication range. Furthermore, we show that our algorithm outperforms previous work by a minimum of 20% in terms of memory overflow.