• Title/Summary/Keyword: Path Selection Algorithm

Search Result 169, Processing Time 0.022 seconds

A Research of LEACH Protocol improved Mobility and Connectivity on WSN using Feature of AOMDV and Vibration Sensor (AOMDV의 특성과 진동 센서를 적용한 이동성과 연결성이 개선된 WSN용 LEACH 프로토콜 연구)

  • Lee, Yang-Min;Won, Joon-We;Cha, Mi-Yang;Lee, Jae-Kee
    • The KIPS Transactions:PartC
    • /
    • v.18C no.3
    • /
    • pp.167-178
    • /
    • 2011
  • As the growth of ubiquitous services, various types of ad hoc networks have emerged. In particular, wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are widely known ad hoc networks, but there are also other kinds of wireless ad hoc networks in which the characteristics of the aforementioned two network types are mixed together. This paper proposes a variant of the Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol modified to be suitable in such a combined network environment. That is, the proposed routing protocol provides node detection and route discovery/maintenance in a network with a large number of mobile sensor nodes, while preserving node mobility, network connectivity, and energy efficiency. The proposed routing protocol is implemented with a multi-hop multi-path algorithm, a topology reconfiguration technique using node movement estimation and vibration sensors, and an efficient path selection and data transmission technique for a great many moving nodes. In the experiments, the performance of the proposed protocol is demonstrated by comparing it to the conventional LEACH protocol.

A study on the Application of Optimal Evacuation Route through Evacuation Simulation System in Case of Fire (화재발생 시 대피시뮬레이션 시스템을 통한 최적대피경로 적용에 관한 연구)

  • Kim, Daeill;Jeong, Juahn;Park, Sungchan;Go, Jooyeon;Yeom, Chunho
    • Journal of the Society of Disaster Information
    • /
    • v.16 no.1
    • /
    • pp.96-110
    • /
    • 2020
  • Recently, due to global warming, it is easily exposed to various disasters such as fire, flood, and earthquake. In particular, large-scale disasters have continuously been occurring in crowded areas such as traditional markets, facilities for the elderly and children, and public facilities where various people stay. Purpose: This study aims to detect a fire occurred in crowded facilities early in the event to analyze and provide an optimal evacuation route using big data and advanced technology. Method: The researchers propose a new algorithm through context-aware 3D object model technology and A* algorithm optimization and propose a scenario-based optimal evacuation route selection technique. Result: Using the HPA* E algorithm, the evacuation simulation in the event of a fire was reproduced as a 3D model and the optimal evacuation route and evacuation time were calculated for each scenario. Conclusion: It is expected to reduce fatalities and injuries through the evacuation induction technique that enables evacuation of the building in the shortest path by analyzing in real-time via fire detection sensors that detects the temperature, flame, and smoke.

Adaptive Beam Selection Method for Improvement of Spectral Efficiency in Millimeter-Wave MIMO (밀리미터파 대역의 다중입출력 안테나 시스템에서 스펙트럼 효율 향상을 위한 적응적 빔 선택 기법)

  • Kim, Jun-Ho;Byun, Youn-Shik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.890-895
    • /
    • 2016
  • As the wireless communication technique is developing rapidly, the use of smart devices is increasing. Due to gradually increasing data traffic, a new area, more than 6GHz of bandwidth to increase capacity of the network, has been studied. Millimeter Wave(MmWave) communications utilizes the bandwidth above 6GHz, which makes it possible to achieve one gigabit per second data rate. To overcome the path loss due to the smaller wavelength, the mass of the antenna arrangement is used. This paper presents an algorithm that maximizes the spectral efficiency of the system in the pre-coding process using a hybrid beamforming. Also it is suggested with the optimization of the number of beams that maximizes the spectral efficiency was maximized by the propose method.

One-Dimensional Radar Scattering Center for Target Recognition of Ground Target in W-Band Millimeter Wave Seeker Considering Missile Flight-Path Scenario (유도탄 조우 시나리오를 고려한 W-대역 밀리미터파 탐색기의 지상 표적 식별을 위한 1차원 산란점 추출에 관한 연구)

  • Park, Sungho;Kim, Jihyun;Woo, Seon-Keol;Kwon, Jun-Beom;Kim, Hong-Rak
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.28 no.12
    • /
    • pp.982-992
    • /
    • 2017
  • In this paper, we introduce a method of selection for the optimal transmission polarization of a W-band seeker through the extraction of the one-dimensional scattering center of a ground tank target. We calculated the surface scattering and edge scattering using the shooting and bouncing ray tracing method of the CST A-solver. Based on 4-channel RCS data, using the one-dimensional RELAX algorithm, which is a kind of spectral estimation technique, scattering centers of ground targets were extracted. According to the changes in the polarization state and look angle, we compared and analyzed the scattering center results. Through simulation, we verified that the scattering center results can be applied when feature vectors are used for target recognition.

A Joint Resource Allocation and Routing Scheme for the IEEE 802.16j Multi-hop Relay Networks (IEEE 802.16j 멀티홉 릴레이 네트워크를 위한 통합 자원 할당-라우팅 기법)

  • Lee, Kyung-Joo;Lee, Hyuk-Joon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.1
    • /
    • pp.82-91
    • /
    • 2009
  • Routing (or path selection) is one of the key issues of multi-hop relay networks such as the IEEE 802.16j. Moreover, the allocation of appropriate resource such as bandwidth should not only be made in accordance with the paths selected, but the utilization of radio resource of an entire cell should also be maximized. Due to this interdependency between the problems of resource allocation and routing, it is desired these two problems are addressed simultaneously. In this paper, we propose a joint resource allocation and routing scheme for an OFDMA-based multi-hop cellular system. This scheme uses a polynomial time heuristic algorithm called Multi-Dimensional Multi-choice Knapsack Problem (MMKP) in order to find an approximate solution maximizing the total downlink throughput. In the simulation results, we show that the proposed scheme finds a sub-optimal solution which is superior to a link quality-based routing scheme, but slightly worse than the optimal solution.

  • PDF

Slective Buffering Macro Handover Which Applies The F-SNOOP in Hierarchical structure (계층 구조에서 F-SNOOP을 적용한 선택적 버퍼링 매크로 핸드오버)

  • Ahn Chi-Hyun;Kim Dong-Hyun;Kim Hyoung-Chul;Ryou Hwang-Bin;Lee Dae-Young;Jun Kye-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.413-420
    • /
    • 2006
  • HMIPv6 is designed to reduce the signaling load to external network and improve handover speed of MN by including Mobility Anchor Point(MAP) in local handover. However in this case of macro handover, it's just used pervious MIPv6 handover algorithm. So, it occurs packet loss and transmission delay problem. In this paper, we propose the mechanism applying the HMIPv6 for Fast Handover to choose suitable to the condition buffering handover. The condition for the selection is result distance measurement between MN and CN, between MN and NAR. Furthermore, using F-SNOOP protocol, it is possible to improve wireless network performance. Wireless network has high Bit Error Rate(BER) characteristic because of path loss, fading, noise and interference. TCP regards such errors as congestion and starts congestion control. This congestion control makes packet transmission rate low. However, F-SNOOP improves TCP performance based on SNOOP and Freeze TCP that use Zero Window Advertisement(ZWA) message when handoff occurs in wireless network.

Highly-reliable Multi-path Protocol by MANET (MANET에 의한 신뢰성 높은 다중 경로 프로토콜)

  • Lee, Yang-Min;Lee, Jae-Kee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.352-362
    • /
    • 2008
  • In the mobile ad hoc network, network nodes are continuously capable of movement, but have battery limitations and these characteristics of MANET cause network link failure. Therefore, when performing ubiquitous services with the application of MANET, a technique is required to improve the packet transmission rates as to enable continuous packet transmission while flexibly adapting to topology changes caused by the mobility of nodes. In this paper, we are proposing PAOMDV(Possibility based AOMDV) and OLSR-ME(OLSR with Modified Energy Efficiency) which are mixed-type protocols to solve the problem for design a more efficient protocol. Especially by classifying mobile ad hoc networks as clusters, OLSR-ME protocol is implemented on communication within the clusters, while PAOMDV is used in protocols between clusters. In addition, a selection algorithm for forwarding nodes that responding packet relays in the case of increased hops was proposed for designing a more efficient protocol than existing protocols. We verified the performance of the proposed protocols through a comparative experiment with AODV, AOMDV, ZRP, and the existing protocols. We confirmed the results of the experiment revealed that the proposed protocol had the best packet transmission rate, the shortest delay between nodes, and showed better results in routing overhead.

A Mesh Router Placement Scheme for Minimizing Interference in Indoor Wireless Mesh Networks (실내 무선 메쉬 네트워크에서의 간섭 최소화를 위한 메쉬 라우터 배치 기법)

  • Lee, Sang-Hwan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.4
    • /
    • pp.421-426
    • /
    • 2010
  • Due to the ease of deployment and the extended coverage, wireless mesh networks (WMNs) are gaining popularity and research focus. For example, the routing protocols that enhance the throughput on the WMNs and the link quality measurement schemes are among the popular research topics. However, most of these works assume that the locations of the mesh routers are predetermined. Since the operators in an Indoor mesh network can determine the locations of the mesh routers by themselves, it is essential to the WMN performance for the mesh routers to be initially placed by considering the performance issues. In this paper, we propose a mesh router placement scheme based on genetic algorithms by considering the characteristics of WMNs such as interference and topology. There have been many related works that solve similar problems such as base station placement in cellular networks and gateway node selection in WMNs. However, none of them actually considers the interference to the mesh clients from non-associated mesh routers in determining the locations of the mesh routers. By simulations, we show that the proposed scheme improves the performance by 30-40% compared to the random selection scheme.

Reviews of Bus Transit Route Network Design Problem (버스 노선망 설계 문제(BTRNDP)의 고찰)

  • Han, Jong-Hak;Lee, Seung-Jae;Lim, Seong-Su;Kim, Jong-Hyung
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.3 s.81
    • /
    • pp.35-47
    • /
    • 2005
  • This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.