• Journal of Preventive Medicine and Public Health
• /
• 제39권4호
• /
• pp.302-308
• /
• 2006

Objectives: This study aims to examine if a garbage dumping site has real and negative influence on the quality of life (QOL) for the nearby residents. The net effects of the residential distance from the garbage dumping site and from the garbage truck route were investigated for five domains of the QOL. Methods: Two hundred fifty seven Shin-dong Myeon residents, Chun-cheon Si, participated in a self-administrated survey. The Shin-dong Myeon garbage dumping site began operating in 1996. ANCOV A with generalized linear models and multiple regression analysis were performed. Results: Descriptive analyses show that a residence nearby a garbage dumping site is negatively associated with the physical and environmental domains of the QOL. The residential distance from the garbage truck route does not exert any significant effect on various domains of QOL, except for the environmental domain. On the multivariate analysis, the residents living near the garbage dumping site tended to have a significantly negative QOL in the physical and environmental domains. However, the distance from the garbage truck route did not show a significant nor substantial effect on the QOL. The demographic and socioeconomic control variables are associated with a number of the QOL domains, and their patterns are consistent with the general expectations. Conclusions: The results indicated that a garbage dumping site is considered to be an environmental hazard among the nearby residents according to the lower scores on the physical and environmental domains of the QOL. The findings from this study provide comprehensive understanding on the residents' QOL, and they may help politicians and policy makers make decisions for appropriate interventions.

• 정보처리학회 논문지
• /
• 제13권6호
• /
• pp.269-277
• /
• 2024

최신 IT 기술의 발달로 자율주행 자동차의 운행이 현실화되고 있으며, 이를 위해 경로 탐색은 필수적이다. 일반적으로 경로 탐색에서는 이동거리를 최소화하는 최단거리 경로와 이동 시간을 최소화하는 최단시간 경로가 제시된다. 그러나 이러한 경로의 품질은 도로망의 그래프 위상적 특성에 따라 달라진다. 도로망의 연결구조가 합리적이지 않으면 라우팅 알고리즘의 성능 개선에 한계가 있다. 실제 운전자들은 회전 횟수, 주변 환경, 교통체증, 도로 품질 등의 심리적 요소를 고려하며, 특히 회전이 적은 경로를 선호한다. 본 논문에서는 도로망 특성을 평가할 때 최단거리와 최단시간 경로뿐 아니라 회전이 가장 적은 경로를 찾는 단순 경로 알고리즘을 제시한다. 이를 통해 국내외 20개 주요 대도시 도로망의 연결 특성을 비교 평가하고, 도로망의 강점과 약점을 파악하여 효율적이고 안전한 경로 탐색 알고리즘을 개발할 수 있다. 제안된 단순 경로 알고리즘을 활용하여 각 도시의 도로망 특성을 비교 평가함으로써 도로망의 품질과 경로 탐색의 효율성을 종합적으로 검토한다.

• 방송공학회논문지
• /
• 제24권5호
• /
• pp.849-858
• /
• 2019

최근 컴퓨터 그래픽 기술과 영상 처리 기술의 발달로 현실의 공간 및 물체 정보를 3차원 데이터로 표현하는 포인트 클라우드 기술에 관한 관심이 증대되고 있다. 특히, 포인트 클라우드 기술은 공간 정보를 정밀하게 제공할 수 있어 AR (Augmented Reality)/VR (Virtual Reality), 자율 주행 자동차 분야 등 높은 관심을 받고 있다. 그러나 기존의 2차원 영상보다 많은 데이터가 필요로 되는 3차원 포인트 클라우드 콘텐츠를 사용자에게 서비스하기 위해서는 다양한 기술 개발이 요구된다. 이러한 문제점을 해결하기 위해 국제 표준화 기구인 MPEG (Moving Picture Experts Group)에서는 효율적인 압축 및 전송 방안에 대해 논의를 진행 중이다. 본 논문에서는 기존의 MPEG-DASH (Dynamic Adaptive Streaming over HTTP)-SRD (Spatial Relationship Description) 기술의 확장을 통해 3차원 포인트 클라우드 콘텐츠의 영역 분할 전송 방안을 제안하고, 네트워크 상황뿐 아니라 사용자의 요구에 따라 선택적으로 품질 파라미터를 결정할 수 있도록 MPEG-DASH 표준에서 정의한 시그널링 메시지에 품질 파라미터를 추가로 정의한다. 또한, ROUTE (Real time Object delivery Over Unidirectional Transport)/DASH 기반 이종망 환경의 검증플랫폼을 설계하고, 결과를 통해 제안한 기술의 타당성을 확인한다.

• 대한환경공학회지
• /
• 제31권3호
• /
• pp.223-231
• /
• 2009

환경친화적인 도로노선대 선정을 위하여 공간분석기능을 활용한 GIS 기반 환경성평가 기법을 개발하고 실제 사례노선을 통하여 검증해 보고자 하였다. 도로건설 사업으로 인해 환경훼손을 가져오는 요인에 관한 분석을 바탕으로 영향범주를 구체화 시킨 후, 이에 관한 다양한 등급화 사례 및 법적 규제에 관한 문헌조사를 수행하였다. 공간 분석을 위한 정량화 모델로는 AHP를 선택하였다. 환경성 평가항목으로는 지형지질, 동식물, 토양생태, 수질, 대기질, 소음진동, 토지이용, 위락경관의 8개 항목을 선정하고 그에 따른 세부지표를 구성하여 이를 3등급 체계로 구분하였다. 가중치 산정을 위해 쌍대비교에 의한 설문수행 결과 동식물 1등급의 가중치가 0.191로 가장 높게 산출되었다. 위 방법을 사례지역에 대하여 검증한 결과 가장 환경친화적인 도로노선대를 생성할 수 있었다.

• 환경영향평가
• /
• 제22권6호
• /
• pp.739-744
• /
• 2013

Recently, railroad construction becomes an alternative considering environmental merits such as mass transportation, safety, economy and energy efficiency. Also railroad can have 3 to 4 times better in economy compared to road construction. However, long line and unavoidable sensitive areas hinders railroad construction often resulted in ecosystem degradation. This paper reviewed 27 cases of EIS submitted during 2003-2006 and reviewed major issues on Animal-Plants and Landscape. Noise-Vibration (13.5%), Water Quality (13.5%), Wastes (10.8%) appeared to be most frequent factors to supplement. Route selection in the railroad is the most sensitive issues so that public participation and hearing should be involved in the early stage of the process and social and cultural factors also must be considered to make a final decision on the railroad route location and selection.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2004년도 춘계 종합학술대회 논문집
• /
• pp.351-356
• /
• 2004

경로 최적화를 기본으로 한 Mobile IPv6의 바인딩 갱신은 자주 이동하는 노드에 의해 시그널링 트래픽 증가를 초래한다. 이를 보완하기 위해 MAP(Mobile Anchor Point)를 두어 매크로 이동성과 마이크로 이동성의 지역적 이동성을 고려한 계층적 Mobile IPv6가 제안되었다. 그러나 계층적 Mobile IPv6는 패킷 전송에 있어서 MAP를 항상 거쳐야 하므로 MAP의 패킷 집중현상이 발생하고 경로 최적화를 보장하지 못한다. 이에 본 연구에서는 이동 노드의 이동성을 고려한 경로 개선을 수행하여 MAP로의 패킷 집중현상의 완화특성을 해석한다.

• Journal of Communications and Networks
• /
• 제12권1호
• /
• pp.67-73
• /
• 2010

Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

• ETRI Journal
• /
• 제27권6호
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Journal of Information Technology Applications and Management
• /
• 제9권4호
• /
• pp.13-34
• /
• 2002

This paper considers a postal transportation planning problem in the transportation network of the form of hub and spoke Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. The tabu search uses the best-admissible strategy, BA, and the first-best-admissible strategy, FBA. The algorithm was tested on problems consisting of 11, 16 and 21 mail sorting centers including one exchange center. Solutions of the problems consisting of 11 mail sorting centers including one exchange center were compared with optimal solutions On average, solutions using BA strategy were within 0.287% of the optimum and solutions using FBA strategy were within 0.508% of the optimum. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is very good.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.