• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.791-795
• /
• 2006

하이브리드 센서 네트워크에서 static sensor node들이 초기 배치된 후, coverage-hole을 결정하여, hole을 커버할 mobile sensor node들의 필요한 수 및 위치를 결정하고 배치하는 연구는 상당한 수준에 이르렀다. 그러나 mobile sensor node들을 호출하고 배치하는데 너무 많은 에너지를 소모하고 있다. 본 논문에서는 coverage-hole에서 mobile sensor node들을 호출하기 전에 mobile sensor node들을 최대한 coverage-hole에 가깝게 배치하여, 호출하는데 소요되는 에너지를 획기적으로 절감하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.37-46
• /
• 2007

In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.

• JOURNAL OF ELECTRICAL WORLD
• /
• no.12 s.84
• /
• pp.30-32
• /
• 1983

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.8
• /
• pp.385-393
• /
• 2008

The best coverage problem is finding a path whose worst distance to the sensor-set is the best among all paths. Instead, if the user stays close to its nearest two sensors, then the stability of the wireless connection may be guaranteed. So we consider the problem of finding a second best coverage path; given the sensor set U, a starting point s and a target point t, find a path whose worst distance to the second closest sensor is minimized. This paper presents an O(n logn) -time algorithm to find such a path. We also give experimental evidence showing that the connection to the sensor-set along a second best coverage path is more stable than that along the best coverage path.

• The Journal of the Korea Contents Association
• /
• v.16 no.12
• /
• pp.539-550
• /
• 2016

The news coverage of Sewol Ferry catastrophe has reprimanded from numbers of people because of false reports and mediamorphosis such as distorted news. Thus, the purpose of this study is to examine the news coverage of television news programs about the Sewol Ferry catastrophe. Specifically, this study was conducted to figure out problems with the disaster news reports of several broadcasting stations such as, KBS, MBC, SBS and JTBC. Furthermore, the study also explores about how they reported without following the rules of disaster news coverage and policy of disaster news coverage by content analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5301-5323
• /
• 2017

Small cell deployment offers a low-cost solution for the boosted traffic demand in heterogeneous cellular networks (HCNs). Besides improved spatial spectrum efficiency and energy efficiency, future HCNs are also featured with the trend of network architecture convergence and feasibility for flexible mobile applications. To achieve these goals, dual connectivity (DC) is playing a more and more important role to support control/user-plane splitting, which enables maintaining fixed control channel connections for reliability. In this paper, we develop a tractable framework for the downlink SINR analysis of DC assisted HCN. Based on stochastic geometry model, the data-control joint coverage probabilities under multi-frequency and single-frequency tiering are derived, which involve quick integrals and admit simple closed-forms in special cases. Monte Carlo simulations confirm the accuracy of the expressions. It is observed that the increase in mobility robustness of DC is at the price of control channel SINR degradation. This degradation severely worsens the joint coverage performance under single-frequency tiering, proving multi-frequency tiering a more feasible networking scheme to utilize the advantage of DC effectively. Moreover, the joint coverage probability can be maximized by adjusting the density ratio of small cell and macro cell eNBs under multi-frequency tiering, though changing cell association bias has little impact on the level of the maximal coverage performance.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.202-208
• /
• 2014

Wireless network information services allow end systems to discover heterogeneous networks and spectrum available for secondary use at or near their current location, helping them to cope with increasing traffic and finite spectrum resources. We propose a unified architecture that allows end systems to find nearby base stations that are using either licensed, shared or unlicensed spectrum across multiple network operators. Our study evaluates the performance and scalability of spatial databases storing base station coverage area geometries. The measurement results indicate that the current spatial databases perform well even when the number of coverage areas is very large. A single logical spatial database would likely be able to satisfy the query load for a large national cellular network. We also observe that coarse geographic divisions can significantly improve query performance.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.429-432
• /
• 2003

In this paper, a novel neural network approach is proposed for cleaning robot to complete coverage path planning with obstacle avoidance in stationary and dynamic environments. The dynamics of each neuron in the topologically organized neural network is characterized by a shunting equation derived from Hodgkin and Huxley's membrane equation. There are only local lateral connections among neurons. The robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot location without any prior knowledge of the dynamic environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.902-905
• /
• 2010

지형의 상태를 정확히 알 수 없는 타겟 지역에 모바일 센서 네트워크를 구축하는 것은 타겟 지역에 필요한 센서 노드의 수, 유지되어야 할 connectivity, 센서 노드들에 의해 타겟 지역이 coverage 되는 비율을 예측 할 수 없기 때문에 그 효율성을 가늠하기가 어렵다. 본 논문에서 설계한 MSNS(Mobile Sensor Network Simulator)는 GML 문서를 통해 실제 지도상의 개체를 가시화 하고 Map Object의 장애물 여부를 설정하여 타겟 지역을 구성한다. 이를 기반으로 MSNS는 센서 노드의 수와 connectivity degree 그리고 센서 노드들의 센싱/통신/초음파 범위를 입력 받아 센서 노드의 현재 위치 정보, connectivity, 센싱 coverage를 가시화 하여 타겟 지역에 얼마나 많은 노드들이 필요한지 유추할 수 있다.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.856-866
• /
• 2015

A heterogeneous network (HetNet) is a network topology composed by deploying multiple HetNets under the coverage of macro cells (MCs). It can improve network throughput, extend cell coverage, and offload network traffic; for example, the network traffic of a 5G mobile communications network. A HetNet involves a mix of radio technologies and various cell types working together seamlessly. In a HetNet, coordination between MCs and small cells (SCs) has a positive impact on the performance of the networks contained within, and consequently on the overall user experience. Therefore, to improve user-perceived service quality, HetNets require high-efficiency network protocols and enhanced radio technologies. In this paper, we introduce a 5G HetNet comprised of MCs and both fixed and mobile SCs (mSCs). The featured mSCs can be mounted on a car, bus, or train and have different characteristics to fixed SCs (fSCs). In this paper, we address the technical challenges related to mSCs. In addition, we analyze the network performance under two HetNet scenarios-MCs and fSCs, and MCs and mSCs.