• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.296-300
• /
• 2007

유비쿼터스 환경의 센서 노드들은 데이터 전달을 위해 무선 통신을 수행한다. 또한 노드들의 위치정보를 활용하면 통신 경로선택에 큰 이점을 가지게 된다. 그래서 이동성을 갖춘 센서 노드 위치를 정확히 측정하기 위해 별도의 GPS, 초음파 센서 등을 부착한다. 그러나 센서 네트워크는 제한된 전력 사용과 낮은 비용 유지가 요구된다. 또한 기존의 애드혹 기반의 위치측정과 전체 망의 생존성을 고려해야 하는 센서 네트워크간의 상황이 적용 모델의 변수로서 작용한다. 본 논문에서는 컴퓨팅 자원이 부족한 센서 네트워크에서 다음의 조건을 만족하는 위치측정 방법을 제안한다. 첫째 빈번하게 이동하는 센서 노드의 이동성을 고려한다. 둘째 위치측정을 위한 별도의 장비를 추가하지 않는다. 셋째 노드의 송신출력 분석에 기반하여 상대적인 위치를 검출한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.965-968
• /
• 2000

통합설계에서 제약사항을 만족하는 최적의 시스템을 구현하기 위해 시스템을 기술하는 각 부분을 하드웨어부와 소프트웨어부로 나누어 매핑의 권역을 찾는 분할은 중요한 문제이다. 기존의 분할 알고리즘들[1]은 파티션과 스케줄링을 2단계로 분리하여 분할 단계의 결과를 스케줄링하는 과정에 의해 진행되었다. 이러한 작업과정은 스케줄링 결과 스케줄이 불가능한 경우 시스템을 재설계 해야하는 문제점을 가진다. 본 논문에서는 분할 단계에서 스케줄링을 함께 고려하는 낮은 복잡도의 알고리즘을 제안한다. FDS를 응용한 기존 논문[4]이 고려하지 못한 자원제약에 의한 힘값 변이를 고려할 수 있도록 하였고 알고리즘 복잡도를 개선하기 위하여 종속성 제약 조건에 의해 받는 다른 노드의 힘값 계산 방법을 수정하였다. 수정된 계산 방법에서는 특정 노드와 경쟁 노드들의 제어구간별 상대적 스케줄 요구값의 크기에 의해 분할 대상 노드를 선택하게 된다. 제안된 논문의 실험결과는 시스템 제약시간을 만족하면서 구현비용을 저하시키고 알고리즘 실행시간 측면에서 효과적임을 보인다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1190-1194
• /
• 2007

In sensor network, the importance of transporting data with reliability is growing gradually to support communications. Data flow from sink to nodes needs reliability for the control or management, that is very sensitive and intolerable, however relatively, data flow from nodes to sink is tolerable. In this paper, with emphasis of the data flow from sink to nodes, we proposed the mechanism that establishes confidence interval for transport. Establishing confidence interval herby-hop, not end to end, if errors happen or there's missing data, this mechanism recovers them with selective acknowledgement using fixed window. In addition, this mechanism supports franc congestion control depending on the buffer condition. Through the simulation, we showed that this mechanism has an excellent performance for error recovery in sensor network.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.55-65
• /
• 2010

We present a method for increasing network lifetime without link failure due to lack of battery capacity of nodes in wireless ad-hoc networks with low mobility. In general, a node with larger remaining battery capacity represents the one with lesser traffic load. Thus, a modified AODV routing protocol is proposed to determine a possible route by considering a remaining battery capacity of a node. Besides, the total energy consumption of all nodes increase rapidly due to the huge amount of control packets which should be flooded into the network. To reduce such control packets efficiently, a source node can store information about alternative routes to the destination node into its routing table. When a link failure happens, the source node should retrieve the route first with the largest amount of the total remaining battery capacity from its table entries before initiating the route rediscovery process. To do so, the possibility of generating unnecessary AODV control packets should be reduced. The method proposed in this paper increases the network lifetime by 40% at most compared with the legacy AODV and MMBCR.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.304-305
• /
• 2019

Wireless sensor networks are used in various applications due to the flexibility of network. In particular, the energy harvesting wireless sensor network (EH-WSN) has been introduced to solve the power limitation problem, and the application range of the sensor network is further expanded. In order to transmit the sensed data to the destination node, the MAC protocol considering the power of the nodes has been studied. The power situation and the urgency of the data are important elements of data transmission, and a medium access control protocol that comprehensively considers data urgency and power of nodes is required. In this paper, we propose a medium access control protocol which can select relay nodes according to power situation and urgency of data.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.377-386
• /
• 2003

This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.237-244
• /
• 2009

The congestion in wireless sensor network increases the ratio of data loss and causes the delay of data. The existing congestion protocols for wireless sensor network reduces the amount of transmission by control the sampling frequency of the sensor nodes related to the congestion when the congestion has occurred and was detected. However, the control method of sampling frequency is not applicable on the situation which is sensitive to the temporal data loss. In the paper, we propose a new congestion control, ACT - Adaptive Congestion conTrol. The ACT monitors the network traffic with the queue usage and detects the congestion based on the multi level threshold of queue usage. Given network congestion, the ACT increases the efficiency of network by adaptive flow control method which adjusts the frequency of packet transmission and guarantees the fairness of packet transmission between nodes. Furthermore, ACT increases the quality of data by using the variable compression method. Through experiment, we show that ACT increases the network efficiency and guarantees the fairness to sensor nodes compared with existing method.

• Journal of the KSME
• /
• v.53 no.11
• /
• pp.39-43
• /
• 2013

IT융합 적용을 위하여 컴퓨터 또는 현장 데이터 취득 유닛과 각 센서노드 간의 데이터 통신망이 필요하고 또한 중앙 제어기와 데이터 전송이 필요하다. 이러한 IT융합 데이터 통신망 구축에는 유선통신이 전송 효율측면에서 안정적이기 때문에 선호된다. 그러나 불가피하게 무선이 필요할 때 IT현장에서 주로 선택되는 무선통신망의 종류별로 특성과 장단점을 비교 분석하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.205-212
• /
• 2003

Because a wireless ad hoc network does not have fixed infrastructure, a call admission control approach researched in a wireless network is not feasible to this network. In this paper, we propose call admission control scheme to support this problem and the burst handoff traffic due to group mobility in a wireless ad hoc network. This scheme is an adaptive guard channel scheme which adapt the number of guard channels in each MBS(mobile base station) according to the current estimate of the potential handoff call rate derived from the number of ongoing calls within the coverage area of an MBS that initiate group handoff in a wireless ad hoc network. Our simulation studies are performed for comparisons of the proposed scheme with the other channel allocation schemes. Simulation results show that the proposed scheme efficiently reduces handoff call blocking probability in wireless ad hoc networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.337-340
• /
• 2003

다층 퍼셉트론(Multi-Layer Perceptron, MLP) 구조를 이용한 비선형 적합은 실제문제에 매우 다양하게 적용되고 있다. 이때 일반화된 MLP 구조의 적합을 위해서는 은닉노드의 개수 초기 가중값 그리고 학습 회수와 같은 구조인자들을 함께 고려해야 한다. 만약 구조인자들이 부적절하게 선택되었다면 일반화된 MLP 구조의 적합효율이 매우 저하될 수 있다. 그러므로 MLP 구조에 영향을 주는 인자들의 영향을 살펴보는 것은 중요한 문제다. 이 논문에서는 제어상자(controller box)를 통한 학습결과와 더불어 MLP 구조를 일반화할 때 영향을 줄 수 있는 구조인자(factor)들의 실증분석과 이들의 상대효과를 살펴본다.