BLR: beacon-less routing algorithm for mobile ad hoc networks

Heissenbüttel, Marc; Braun, Torsten; Bernoulli, Thomas; Wälchli, Markus

doi:10.1016/j.comcom.2004.01.012

Cited by 279 publications

(241 citation statements)

References 41 publications

Supporting

Mentioning

228

Contrasting

Order By: Relevance

“…Reflecting such problems, there have been many studies about VANET routing protocols. [1][2][3][4][5][6][7][8][9][10][11][12] Most VANET routing algorithms are either topology-based or geography-based. Due to its simplicity, geography-based routing has been proved to be more suited for VANET.…”

Section: Vanetmentioning

confidence: 99%

See 1 more Smart Citation

A new application-layer overlay platform for better connected vehicles

Jang¹,

Ahn

Han

2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

To support smart and converged services for autonomous vehicles, reliable vehicular ad hoc networks play important roles. To achieve this goal, this article proposes an application-layer overlay platform for hyper-connected vehicular ad hoc networks. By effectively exploiting redundancy of communication among vehicles and infrastructures on the road, this article aims to provide reliable communications among vehicles with high performance. Furthermore, the proposed approach is built at the application layer, and hence, it is compatible with existing routing protocols. Also, it minimizes communication and computation overheads. To verify the proposed scheme, we evaluate performance of the proposed approach compared with existing routing protocols.

show abstract

Section: Vanetmentioning

confidence: 99%

“…[1][2][3][4][5][6][7][8][9][10][11] However, all of these previous studies either rely on static information in advance (e.g. street map and bus routes) or they use very complex algorithms for route decision with a large amount of overheads.…”

Section: Introductionmentioning

confidence: 99%

A new application-layer overlay platform for better connected vehicles

Jang¹,

Ahn

Han

2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Planar graph based obstacle avoidance techniques, [1], [10], [8], [5], are used since they were proved to guarantee delivery if a path exists. In the initial stage, these strategies use greedy.…”

Section: State Of the Art And Comparisonmentioning

confidence: 99%

Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks

Moraru

Leone

Nikoletseas

et al. 2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on the routing performance. When the size of the communication voids is increased, they might not scale well with respect to the quality of paths, measured in terms of hop count and path length. This paper introduces a routing algorithm with early obstacle detection and avoidance. The routing decisions are based on path optimality evaluation, made at the node level, gradually over time. We implement our algorithm and evaluate different aspects: message delivery performance, topology control overhead and algorithm convergence time. The simulation findings demonstrate that our algorithm manages to improve significantly and quite fast the path quality while keeping the computational complexity and message overhead low. The algorithm is fully distributed, and uses only limited local network knowledge.

show abstract

“…Due to mobility, collected neighbor information can quickly get outdated which in turn can lead to packet drops. Sending and receiving beacon messages consumes energy and disturbs sleeping cycles, which is not desirable for devices with strict limitations in energy consumption [9].…”

Section: Introductionmentioning

confidence: 99%

“…Instead, all suitable neighbors of the forwarding node participate in the next hop selection process and the forwarding decision is based on the actual topology at the time a packet is forwarded. The existing beaconless routing protocols [3,7,9,14] do not guarantee the delivery of the packet and also either broadcast the data packet [9] or have too many messages involved or duplicate messages [7]. We describe here a beaconless position based routing protocol which guarantees delivery in connected networks, assuming an ideal MAC layer, without collisions, and unit disk graph model without obstacles.…”

Section: Introductionmentioning

confidence: 99%

Beaconless Position Based Routing with Guaranteed Delivery for Wireless Ad-Hoc and Sensor Networks

et al. 2006

View full text Add to dashboard Cite

Abstract. Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.

show abstract

BLR: beacon-less routing algorithm for mobile ad hoc networks

Cited by 279 publications

References 41 publications

A new application-layer overlay platform for better connected vehicles

A new application-layer overlay platform for better connected vehicles

Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks

Beaconless Position Based Routing with Guaranteed Delivery for Wireless Ad-Hoc and Sensor Networks

Contact Info

Product

Resources

About