• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.123-134
• /
• 2008

In this paper, a routing algorithm for wireless sensor networks is proposed to improve the efficiency of energy consumption in sensor nodes. Each sensor node has the value called ‘Flooding Level’ obtained through the initial flooding from a sink node instead of sending beacon messages in multi-hop sensor field. This value can be used for guaranteeing the sensor nodes to connect with a sink node and determining the roles of cluster-head and cluster-gateway node efficiently and simply during the clustering. If different algorithms are added to our protocol, it will work better in the side of energyefficiency. This algorithm is evaluated through analysis and extensive simulations.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1598-1605
• /
• 1989

This paper describes an efficient global cell (module) placement strategy called HALO (Hierarchical Alternating Linear Ordering)which generates global 2-D placement of circuit modules by hierarchical application of linear ordering in alternating direction. We tried, in principle, to explain why HALO should perform better than other typical, somehat successful, analytical approaches such as min-cut, force-directed relaxation(FDR)or its likes. We have implemented HALO as a program for standard cell placement. Experimental results on two benchmark circuits, primary and primary 2 consisting of 752 and 2907 cells, respectively have shown a decrease of half-perimeter routing length by 7% and 24%, respectively compared to the best available results obtained so far. Total CPU time including the following detailed placement was less than half of the earlier work.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1597-1608
• /
• 2016

Recently, a number of solutions were proposed to address the challenges and issues of vehicular networks. Vehicular Cloud Computing (VCC) is one of the solutions. The vehicular cloud computing is a new hybrid technology that has a remarkable impact on traffic management and road safety by instantly using vehicular resources. In this paper, we study an important vehicular cloud service, content-based delivery, that allows future vehicular cloud applications to store, share and search data totally within the cloud. We design a VCC-based system architecture for efficient sharing of vehicular contents, and propose a Hierarchical Hybrid Content Delivery scheme using Bloom Filter (H2CDBF) for efficient vehicular content delivery in Vehicular Ad-hoc Networks (VANETs). The performance of the proposed H2CDBF is evaluated through an analytical model, and is compared to the proactive content discovery scheme, Bloom-Filter Routing (BFR).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3B
• /
• pp.143-152
• /
• 2007

In order to provide new value-added services such as a policy-based routing and the quality of services in next generation network, the Internet routers need to classify packets into flows for different treatments, and it is called a packet classification. Since the packet classification should be performed in wire-speed for every packet incoming in several hundred giga-bits per second, the packet classification becomes a bottleneck in the Internet routers. Therefore, high speed packet classification algorithms are required. In this paper, we propose an efficient packet classification architecture based on a hierarchical binary search fee. The proposed architecture hierarchically connects the binary search tree which does not have empty nodes, and hence the proposed architecture reduces the memory requirement and improves the search performance.

• Journal of Construction Engineering and Project Management
• /
• v.5 no.2
• /
• pp.44-52
• /
• 2015

Various approaches have been used in crack preparations and each of the approaches has advantages and disadvantages. Although the routing method has been widely used and seems to be the best approach among the approaches, it is not a complete solution for crack preparation. This paper compares and evaluates a pneumatic crack cleaning device (CCD) developed by Robotics and Intelligent Construction Automation group at Georgia Tech, over existing devices. Surveys were conducted to discover factors that affect the performance of crack/joint preparation work. Then, data for such information were collected via field tests for devices such as router, heat lancer, air blower and CCD. Performed field test results and follow-up interviews demonstrated that the utilization of CCD has potential to offer improvements in productivity, safety, and maintenance cost. An analytic hierarchical procedure (AHP) and economic analyses were conducted. The AHP analysis considered three factors including safety, quality and productivity while the economic analyses examined the alternatives in various ways. The results indicated that the CCD was ranked first and second for the AHP analysis and economic analysis, respectively. In conclusion, the field tests and results revealed that the utilization of CCD achieved satisfactorily in performance, quality, safety and control, and showed that it has high potential in crack cleaning practice.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.288-288
• /
• 2006

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.417-419
• /
• 1999

본 논문에서는 PNNI 망에서의 다계층 라우팅 알고리즘에 대해서 제안한다. PNNI규격은 ATM 사설망의 노드간 혹은 망간 접속 규격으로 ATM FORUM에서 규정되었으나, 동적 라우팅, 다양한 QOS 지원, Soft PVC 등 망의 상태에 유동적으로 대처하고 관리의 편리함 때문에 ATM 공중망에서의 PNNI 도입이 논의되고 있는 실정이다. 그러나, 현재까지 공중망에서 쓰여질 PNNI에 관한 라우팅 알고리듬과 정책에 대해서 언급은 많지 않은 편이다. 이에 공중망의 비교적 간단한 토폴로지와 정확한 서비스 제공이라는 특징에 부합하는 라우팅 알고리듬을 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.802-805
• /
• 2007

IP-USN은 U-city와 같이 대규모 혹은 모든 전자 장비에 IP기반의 서비스를 지원해줄 중요한 기술이다. IP-USN에서 IP의 할당과 무선 Ad-hoc 라우팅은 IP-USN의 핵심기술로 소형, 전력인 센서네트워크에서 중요고려 대상이다. 본 End 노드를 고려한 계층적 라우팅 프로토콜은 IP 할당 및 메모리를 최소화하는 주소할당 기법과 계층적 라우팅을 제안한다.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.943-953
• /
• 2013

By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.225-234
• /
• 2012

In Wireless Sensor Networks (WSNs) where deployed sensors are not stationary, the most important demand of is to design a cost effective and reliable network. This paper proposes an energy aware network construction and routing scheme, which is based on the hierarchical approach to distribute the task in some sensors in order to prolong the network lifetime. It aims to make even the energy consumption on constitute nodes. With the node hierarchy, the sink initiates the construction by electing gateway nodes in the network and the elected gateway nodes participate to form logical clusters by electing a cluster head in each cluster. Then, the cluster heads aggregate data from the sensing sensors and transmit the data to the sink through the gateway. Our simulation result illustrates that the proposed scheme provides a basement to reduce the source of energy dissipation in network construction, and as well as in data routing.