• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.901-920
• /
• 2015

Wireless Sensor Networks (WSNs) are widely used in geographically isolated applications like military border area monitoring, battle field surveillance, forest fire detection systems, etc. Uninterrupted power supply is not possible in isolated locations and hence sensor nodes live on their own battery power. Localization of sensor nodes in isolated locations is important to identify the location of event for further actions. Existing localization algorithms consume more energy at sensor nodes for computation and communication thereby reduce the lifetime of entire WSNs. Existing approaches also suffer with less localization coverage and localization accuracy. The objective of the proposed work is to increase the lifetime of WSNs while increasing the localization coverage and localization accuracy. A novel intelligent unmanned aerial vehicle anchor node (IUAN) is proposed to reduce the communication cost at sensor nodes during localization. Further, the localization computation cost is reduced at each sensor node by the proposed intelligent arc selection (IAS) algorithm. IUANs construct the location-distance messages (LDMs) for sensor nodes deployed in isolated locations and reach the Control Station (CS). Further, the CS aggregates the LDMs from different IUANs and computes the position of sensor nodes using IAS algorithm. The life time of WSN is analyzed in this paper to prove the efficiency of the proposed localization approach. The proposed localization approach considerably extends the lifetime of WSNs, localization coverage and localization accuracy in isolated environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권11호
• /
• pp.3544-3564
• /
• 2022

With the development of the NB-IoT (Narrow band Internet of Things) and smart cities, coupled with the emergence of smart smoke sensors, new requirements and issues have been introduced to study on the deployment of sensors in large spaces. Previous research mainly focuses on the optimization of wireless sensors in some monitoring environments, including three-dimensional terrain or underwater space. There are relatively few studies on the optimization deployment problem of smart smoke sensors, and leaving large spaces with obstacles such as libraries out of consideration. This paper mainly studies the deployment issue of smart smoke sensors in large spaces by considering the fire probability of fire areas and the obstacles in a monitoring area. To cope with the problems of coverage blind areas and coverage redundancy when sensors are deployed randomly in large spaces, we proposed an optimized deployment strategy of smart smoke sensors based on the PSO (Particle Swarm Optimization) algorithm. The deployment problem is transformed into a multi-objective optimization problem with many constraints of fire probability and barriers, while minimizing the deployment cost and maximizing the coverage accuracy. In this regard, we describe the structure model in large space and a coverage model firstly, then a mathematical model containing two objective functions is established. Finally, a deployment strategy based on PSO algorithm is designed, and the performance of the deployment strategy is verified by a number of simulation experiments. The obtained experimental and numerical results demonstrates that our proposed strategy can obtain better performance than uniform deployment strategies in terms of all the objectives concerned, further demonstrates the effectiveness of our strategy. Additionally, the strategy we proposed also provides theoretical guidance and a practical basis for fire emergency management and other departments to better deploy smart smoke sensors in a large space.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 D
• /
• pp.2840-2842
• /
• 2000

This paper describes sensor-based occupancy grid map construction method through complete coverage navigation algorithm in unknown environment. In this paper, we use the updated Baysian model for probabilistic grid map. For map construction, complete coverage navigation method in which mobile robot can navigate complete field through as short path as possible in unknown environment, is used. The computer simulations result show that map construction method using complete coverage algorithm is efficient.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2005년도 하계학술대회
• /
• pp.349-357
• /
• 2005

In this paper, a new clustering algorithm using the Guaranteed Minimum Coverage (GMC) is proposed. In the new protocol, an appropriate distribution of clusterheads is accomplished by guaranteeing a stochastic coverage at each clusterhead(CH)s. Using this protocol, the communication cost from clusterheads to their member nodes and the load variance in each clusterheads are reduced. Therefore, the network lifetime can be extended and the fair energy consumption for all CHs can be achieved

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제22권2호
• /
• pp.101-106
• /
• 2016

셀룰러 시스템을 기반으로 하는 펨토셀 네트워크는 실내 환경에서 대용량 데이터 전송을 위한 기술로 주목 받고 있다. 본 연구에서는 다수의 펨토 기지국을 배치하여 서비스를 제공하는 실내 환경에서 커버리지 문제와 데이터 전송 부하 문제를 동시에 고려하는 기지국의 파워 조절 분산 방법을 제안한다. 사용자의 데이터 사용량은 시간과 장소에 따라 지속적으로 변화하기 때문에 기지국의 데이터 전송 부하를 효과적으로 분배하는 동적 파워 조절 방법이 요구된다. 또한, 대규모 시설에 설치되어 있는 펨토셀 네트워크 시스템을 효율적으로 운영하기 위해서는 기지국의 파워 조절을 위한 분산 알고리즘이 필요하다. 본 논문에서는 기지국 사이의 데이터 전송 부하를 효과적으로 분배하는 분산 알고리즘을 제시한다. 또한, 일부 기지국에서 발행한 장애를 대응하는 방법과 새로운 기지국을 추가하는 방법을 제시한다. 모의 실험을 통해서 제안한 알고리즘의 성능을 시험하였다.

• 한국통신학회논문지
• /
• 제39B권10호
• /
• pp.708-714
• /
• 2014

무선 센서 네트워크는 일반적으로 에너지를 위해 배터리에 의존하는 밀집되게 배치된 센서 노드들로 구성된다. 이와 같이 여러 개로 밀집되게 배치된 센서 노드들은 에너지 낭비 및 센서 데이터의 높은 중복 전송을 야기한다. 상기 전원 관련 제약 및 높은 중복성과 같은 양자 문제는 센서 노드들 간의 적절한 노드 활동 스케줄링에 의해 해결될 수 있다. 본 논문에서는 우수한 커버리지 성능 보장 및 노드들 간 에너지 절약과 네트워크 수명의 연장을 위한 셀룰러 오토마타 (CA) 기반의 노드 스케줄링 알고리즘이 제안된다. 또한 CA 프레임워크에 기반하여 노드 스케줄링 알고리즘의 새로운 수학적 모델을 제안한다. 제안한 알고리즘은 스케줄링 결정을 위해 노드 내 지역 환경 조건의 변경 및 인접 노드들의 상태 정보를 이용한다. 본 논문은 제안한 방식을 적용한 시스템의 동작을 분석하고 시뮬레이션 결과를 통해 제안한 알고리즘이 센싱 커버리지 품질을 유지하면서 유의한 에너지 절약을 갖춘 에너지 균형을 보장함을 확인하였다.

• 로봇학회논문지
• /
• 제2권4호
• /
• pp.304-309
• /
• 2007

This paper describes an efficient path generation method for area coverage. Its applications include robots for de-mining, cleaning, painting, and so on. Our method is basically based on a divide and conquer strategy. We developed a novel cell decomposition algorithm that divides a given area into several cells. Each cell is covered by a robot motion that requires minimum time to cover the cell. Using this method, completeness and time efficiency of coverage are easily achieved. For the completeness of coverage in dynamic environments, we also propose a path following method that makes the robot cover missed areas as a result of the presence of unknown obstacles. The effectiveness of the method is verified using computer simulations.

• 제어로봇시스템학회논문지
• /
• 제11권9호
• /
• pp.789-794
• /
• 2005

This paper describes an algorithm for minimal turning complete coverage Path planning for cleaning robots. This algorithm divides the whole cleaning area by cellular decomposition, and then provides the path planning among the cells employing a flow network. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The minimal turning of the robots is directly related to the faster motion and energy saving. The proposed algorithm is compared with previous approaches in simulation and the result shows the validity of the algorithm.

• 전자공학회논문지A
• /
• 제29A권8호
• /
• pp.99-109
• /
• 1992

First, the coupling faults of semiconductor memory are classified in detail. The chained coupling fault is introduced and defined, which results from sequential influencing of the coupling effects among memory cells, and its mapping relation is described. The linked coupling fault and its order are defined. Second, the deterministic “Algorithm GA” is proposed, which detects stuack-at faults, transition faults, address decoder faults, unlinked 2-coupling faults, and unlinked chained coupling faults. The time complexity and the fault coverage are improved in this algorithm. Third, it is proved that the march test of an address sequence can detect 97.796% of the linked 2-coupling faults with order 2. The deterministic “Algorithm NA” proposed can detect to the limit. The time complexity and the fault coverage are improved in this algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.3171-3191
• /
• 2016

Due to growing demand on wireless data traffic, a large number of different types of base stations (BSs) have been installed. However, space-time dependent wireless data traffic densities can result in a significant number of idle BSs, which implies the waste of power resources. To deal with this problem, we propose an active state control algorithm based on semi-Markov decision process (SMDP) for a heterogeneous network. A MDP in discrete time domain is formulated from continuous domain with some approximation. Suboptimal on-line learning algorithm with a random policy is proposed to solve the problem. We explicitly include coverage constraint so that active cells can provide the same signal to noise ratio (SNR) coverage with a targeted outage rate. Simulation results verify that the proposed algorithm properly controls the active state depending on traffic densities without increasing the number of handovers excessively while providing average user perceived rate (UPR) in a more power efficient way than a conventional algorithm.