Proceedings of the 1st Annual International Conference on Mobile Computing and Networking - MobiCom '95 1995
DOI: 10.1145/215530.215560
|View full text |Cite
|
Sign up to set email alerts
|

A routing protocol for packet radio networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
56
0
1

Year Published

2003
2003
2006
2006

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 149 publications
(62 citation statements)
references
References 7 publications
0
56
0
1
Order By: Relevance
“…The WRP protocol [22] also guarantees loops freedom and it avoids temporary routing loops by using the predecessor information. However, WRP requires each node to maintain four routing tables.…”
Section: Wireless Routing Protocol (Wrp)mentioning
confidence: 99%
“…The WRP protocol [22] also guarantees loops freedom and it avoids temporary routing loops by using the predecessor information. However, WRP requires each node to maintain four routing tables.…”
Section: Wireless Routing Protocol (Wrp)mentioning
confidence: 99%
“…The update to L 1 (1,1) stops at L 1 (1,1), while the update to L 1 (3,1) continues to be unicast to L 2 (3,3), since a level-1 boundary crossing requires the next hierarchical leader L 2 (3,3) to be updated. Notice that the movement of another node D 2 terminates at L 1 (1,3), since the movement is local to the L 1 hierarchy managed by L 1 (1,3). Note that each step shown in the figure may consist of multiple physical transmissions of the update packet to reach the specified grid.…”
Section: Fig 2 Location Update In Hgridmentioning
confidence: 99%
“…Due to mobility, the network topology varies frequently, and end-to-end sessions are subject to link failures constantly. While many solutions have been proposed for routing in mobile ad hoc networks [1][2][3][4][5][6], few have considered the issue of scalability of such protocols in networks having node membership in the order of thousands, and spread over a large geographic area. A unique characteristic of ad hoc networks is that the limited bandwidth of the wireless channel is shared by signalling traffic as well as data, and the former is given a higher priority than data.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, proactive routings are more suitable for small scale MANETs with low node mobility and heavy traffic. DSDV [2], WRP [3], CGSR [4], and OLSR [5] are examples of this type of protocols. Reactive routing protocols, on the other hand, create and maintain routes only to meet current demands.…”
Section: Introductionmentioning
confidence: 99%