• Title/Summary/Keyword: Greedy forwarding

Search Result 42, Processing Time 0.014 seconds

Grid-based Location Service Spot scheme for optimized routing path on VANET (VANET 환경에서의 경로 최적화를 위한 그리드 기반 위치 정보 서비스 스팟 기법)

  • Kim, Jong-Hyun;Kim, Kee-Cheon;Jung, Woo-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.1
    • /
    • pp.76-90
    • /
    • 2010
  • Location Service is required in position-based routing for VANET to provide position information. We propose Grid-based Location service spot(GLSS) scheme for optimized routing path to improve accessibility and load balance in location service. Specific area is defined as Location service spot(LSS) on each grid in this scheme, and all nodes in the grid geocast its location update message and location request message to each LSS. Location request messages are flooded throughout LSSs, location reply messages establish optimized route from the source grid to the destination grid. We evaluated GLSS which establishes optimized route on the grid comparing GPSR in consideration of road condition and geographical features.

Direction-based Geographic Routing for Wireless Sensor Networks (센서 네트워크에서 장애물 극복을 위한 방향기반의 라우팅 기법)

  • Ko, Young-Il;Park, Chang-Sup;Son, In-Keun;Kim, Myoung-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.6
    • /
    • pp.438-450
    • /
    • 2006
  • Geographic routing protocols are very attractive choice for routing in wireless sensor networks because they have been shown to scale better than other alternatives. Under certain ideal conditions, geographic routing works correctly and efficiently. The most commonly used geographic routing protocols include greedy forwarding coupled with face routing. Existing face routing algorithms use planarization techniques that rely on the unit-graph assumption. In real world, many conditions violate the unit-graph assumption of network connectivity, such as location errors, communication voids and radio irregularity, cause failure in planarization and consequently face routing. In this paper, we propose the direction-based geographic routing, which enables energy efficient routing under realistic conditions without planarization techniques. Our proposed approach is for the case in which many sensors need to collect data and send it to a central node. Simulation results show that the protocol exhibits superior performances in terms of energy consumption, delivery success rate, and outperforms the compared protocols.