GLR: A novel geographic routing scheme for large wireless ad hoc networks

Na, Jongkeun; Kim, Chong-kwon

doi:10.1016/j.comnet.2006.01.004

Cited by 36 publications

(20 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast, GLR [17] and ITGR [18] use a concept of landmarks, which are intermediate targets between the source node and the destination node. To find landmarks, GLR introduces two control packets, FLD and BLD.…”

Section: Geographic Routingmentioning

confidence: 99%

GLGR: Grid Landmark-based Geographic Routing for Ad-hoc Wireless Networks

Yamamoto

2018

Journal of Information Processing

View full text Add to dashboard Cite

Geographic routing is one of the most effective routing methods for ad-hoc wireless networks, and each node selects the forwarding node to the destination node by using position information of its neighbor nodes. However, it has a problem that forwarded packets may encounter the void area where no closer node to the destination is. In this paper, we propose a geographic routing method with landmarks between source and destination node, called GLGR (Grid Landmark-based Geographic Routing). To handle node mobility, our proposed method employs grid-based landmarks, not node-based landmarks used in the traditional methods. A grid is a divided region of communication area and its position is static. Therefore, landmarks can keep the appropriate position to forward data packets to the destination, especially in the case that the void is static. Also, to adaptively change the cache interval of landmark information, the node guesses whether the encountered void is static or dynamic by using the node habitability of grids. Network simulation results about packet arrival rate and end-to-end delay showed 30% better performance of our proposed method than the traditional methods in the best case, with suppressing control overhead.

show abstract

Section: Geographic Routingmentioning

confidence: 99%

GLGR: Grid Landmark-based Geographic Routing for Ad-hoc Wireless Networks

Yamamoto

2018

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

“…Several schemes [18], [19] that are based on face routing on planar graphs have been proposed to solve this problem. The main drawback of these solutions is that they may select long detouring paths [20]. When a packet reaches a concave node, recovery routing algorithms select a left or right detour path according to predefined rules.…”

Section: Handling Voidsmentioning

confidence: 99%

“…As a result, they may select long detouring paths. For example, the hop count of detouring paths constructed by FACE-2 [19] is, on the average, twice that of the shortest detouring path and with a much higher variance [20].…”

Section: Handling Voidsmentioning

confidence: 99%

Communication and Coordination in Wireless Sensor and Actor Networks

Melodia

Pompili

Güngör

et al. 2007

IEEE Trans. on Mobile Comput.

194

View full text Add to dashboard Cite

Abstract-In this paper, coordination and communication problems in Wireless Sensor and Actor Networks (WSANs) are jointly addressed in a unifying framework. A sensor-actor coordination model is proposed based on an event-driven partitioning paradigm. Sensors are partitioned into different sets, and each set is constituted by a data-delivery tree associated with a different actor. The optimal solution for the partitioning strategy is determined by mathematical programming, and a distributed solution is proposed. In addition, a new model for the actor-actor coordination problem is introduced. The actor coordination is formulated as a task assignment optimization problem for a class of coordination problems in which the area to be acted upon needs to be optimally split among different actors. An auction-based distributed solution of the problem is also presented. Performance evaluation shows how global network objectives, such as compliance with real-time constraints and minimum energy consumption, can be achieved in the proposed framework with simple interactions between sensors and actors that are suitable for large-scale networks of energyconstrained devices.

show abstract

“…As a result, they may select a long detour path even when there are much shorter paths in the other direction. This problem is known as the blind detouring problem [15]. On the side, these fallback routing protocols get away from the hole, when the data packet reaches the dead-end node.…”

Section: Introductionmentioning

confidence: 99%

“…But if we know the information of the hole in advance, we can select shorter paths by pre-bypassing the hole. This problem is named the triangular routing problem [15]. We will give a detailed description in section II.…”

Section: Introductionmentioning

confidence: 99%

Hole Reshaping Routing in Large-Scale Mobile Ad-Hoc Networks

Wang

et al. 2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-Mobile ad-hoc networks (MANETs) usually contain sparse or even empty regions called holes. The local optimum problem will occur when routing packets meet holes in the network. In this paper, we propose a novel hole-reshaping routing protocol (HRR) in large-scale MANETs. It effectively solves the hole problem by regularizing a hole with an ellipse, and then locally broadcasting the hole information away from the hole. Simulation results show that the proposed protocol guarantees finding a short routing path with a small routing delay, which is a prerequisite to achieve scalability in large-scale networks.

show abstract

GLR: A novel geographic routing scheme for large wireless ad hoc networks

Cited by 36 publications

References 20 publications

GLGR: Grid Landmark-based Geographic Routing for Ad-hoc Wireless Networks

GLGR: Grid Landmark-based Geographic Routing for Ad-hoc Wireless Networks

Communication and Coordination in Wireless Sensor and Actor Networks

Hole Reshaping Routing in Large-Scale Mobile Ad-Hoc Networks

Contact Info

Product

Resources

About