2009
DOI: 10.1109/mcom.2009.5181897
|View full text |Cite
|
Sign up to set email alerts
|

Beacon-less geographic routing made practical: challenges, design guidelines, and protocols

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
53
0
1

Year Published

2011
2011
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 81 publications
(54 citation statements)
references
References 9 publications
0
53
0
1
Order By: Relevance
“…Connectionless routing solutions introduce protocols which they do not need to maintain the communication connections and the neighborhood information [45,46,47]. A notable geo-graphical routing protocol for this group is Contention-Based Forwarding (CBF) [48] and Guaranteed Delivery Beaconless Forwarding Scheme (GDBF).…”
Section: Connectionless Geographical Routing Protocolsmentioning
confidence: 99%
“…Connectionless routing solutions introduce protocols which they do not need to maintain the communication connections and the neighborhood information [45,46,47]. A notable geo-graphical routing protocol for this group is Contention-Based Forwarding (CBF) [48] and Guaranteed Delivery Beaconless Forwarding Scheme (GDBF).…”
Section: Connectionless Geographical Routing Protocolsmentioning
confidence: 99%
“…Two nodes that are within transmission range of each other are called one hop neighbours. Multihop ad-hoc networks [1] [3] are ones in which the source node route the packets to destination node more than one hop away via intermediate nodes. Disaster management operations and battalion of soldiers are the example of applications of such cooperative ad-hoc wireless networks.…”
Section: Related Workmentioning
confidence: 99%
“…Since these beacons can create severe problems in real deployments due to the highly dynamic and error-prone nature of wireless links, it uses Beacon-less geographic routing protocol (BLGR) [3]. Based on location knowledge and contention based selection processes [15] [16], the proposed protocol, aims at providing an efficient, distributed approach to select next hops and optimal operates properly with varying densities of nodes.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations