• 제목/요약/키워드: greedy channel routing

검색결과 4건 처리시간 0.018초

디테일드 라우팅 유전자 알고리즘의 설계와 구현 (Design and Implementation of a Genetic Algorithm for Detailed Routing)

  • 송호정;송기용
    • 융합신호처리학회논문지
    • /
    • 제3권3호
    • /
    • pp.63-69
    • /
    • 2002
  • 디테일드 라우팅은 VLSI 설계 과정중의 하나로, 글로벌 라우팅을 수행한 후 각 라우팅 영역에 할당된 네트들을 트랙에 할당하여 구체적인 네트들의 위치를 결정하는 문제이며, 디테일드 라우팅에서 최적의 해를 얻기 위해 left-edge 알고리즘, dogleg 알고리즘, greedy 채널 라우팅 알고리즘등이 이용된다 본 논문에서는 디테일드 라우팅 문제에 대하여 유전자 알고리즘(genetic algorithm; GA)을 이용한 해 공간 탐색(solution space search) 방식을 제안하였으며, 제안한 방식을 greedy 채널 라우팅 알고리즘과 비교, 분석하였다.

  • PDF

차량 통신 환경에서GeoRouting 프로토콜 성능 분석 (Performance Analysis of GeoRouting Protocol in Vehicle Communication Environment)

  • 안성찬;이주영;정재일
    • 전기전자학회논문지
    • /
    • 제18권3호
    • /
    • pp.427-434
    • /
    • 2014
  • 차량 통신 환경의 멀티 홉 라우팅은 차량의 이동성, 도로 특성, 차량 분포에 따라 네트워크 토폴로지 및 라우팅 경로의 심한 변동 때문에 지속적으로 유지하기 어렵다. 차량 안전 서비스 유지를 위해 유럽 통신 표준(ETSI: European Telecommunication Standard Institute)을 기반으로 하여 GeoNetworking을 구현하였다. GeoNetworking은 유니캐스트와 브로드캐스트로 데이터를 전달하는 방식이 있다. 본 논문에서는 QualNet 네트워크 시뮬레이터를 이용하여 GeoNetworking에 대한 패킷 전달율과 종단 간 지연 등의 성능 지표를 비교하였다. 이전 연구[5]는 GeoUnicast의 성능만을 평가했다. 본 연구에서는 GeoBroadcast에 대한 연구도 추가적으로 수행하였고, GeoUnicast의 CBF(Contention based Forwarding)와 GeoBroadcast의 Greedy 전달 알고리즘을 비교하여 GeoNetworking에 대한 알고리즘 성능 평가를 진행하였다.

Energy-efficient Routing in MIMO-based Mobile Ad hoc Networks with Multiplexing and Diversity Gains

  • Shen, Hu;Lv, Shaohe;Wang, Xiaodong;Zhou, Xingming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권2호
    • /
    • pp.700-713
    • /
    • 2015
  • It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%.

OBPF: Opportunistic Beaconless Packet Forwarding Strategy for Vehicular Ad Hoc Networks

  • Qureshi, Kashif Naseer;Abdullah, Abdul Hanan;Lloret, Jaime;Altameem, Ayman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.2144-2165
    • /
    • 2016
  • In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.