IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37
DOI: 10.1109/infcom.2003.1208678
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative packet caching and shortest multipath routing in mobile ad hoc networks

Abstract: A mobile ad hoc network is an autonomous system of infrastructureless, multihop wireless mobile nodes. Reactive routing protocols perform well in such an environment due to their ability to cope quickly against topological changes. In this paper, we propose a new routing protocol called Caching and Multipath (CHAMP) Routing Protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route breakdowns. Simulation results reveal that by using a five-packet … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
80
0

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 112 publications
(80 citation statements)
references
References 31 publications
0
80
0
Order By: Relevance
“…For energy efficiency, it may be desirable to use not only a single path between a source and a destination but to explore multiple paths. The traditional multiple routing schemes [11][12][13] have also been considered in mobile ad-hoc networks. Determining the optimized path between source and destination nodes under several constrains is a very important key in many routing protocols.…”
Section: Routing Protocols For Mobile Ad-hoc Networkmentioning
confidence: 99%
“…For energy efficiency, it may be desirable to use not only a single path between a source and a destination but to explore multiple paths. The traditional multiple routing schemes [11][12][13] have also been considered in mobile ad-hoc networks. Determining the optimized path between source and destination nodes under several constrains is a very important key in many routing protocols.…”
Section: Routing Protocols For Mobile Ad-hoc Networkmentioning
confidence: 99%
“…RELATED WORK Wireless networks is an active research area and many wireless routing protocols and scheduling policies have been proposed ( [10], [20], [19], [16], [9], [13], [12], [14], [24], [23], [27], [7], [28]). Most of these routing protocols preselect a minimum cost single path or multiple alternate paths and use the preselected static path(s) to forward data packets.…”
Section: Impact Of Node Failurementioning
confidence: 99%
“…Most multi-hop wireless routing protocols are adopted from wired network routing protocols which use conventional graph theory to pre-select minimum cost paths. ( [19], [10], [20], [16], [12], [24], [13], [14], [9]) In these protocols, wireless links are represented by edges and a path is denoted by a sequence of edges. However, unlike wired networks, wireless communication is broadcast in nature.…”
Section: Introductionmentioning
confidence: 99%
“…A number of studies have been conducted to reduce the Web traffic and overall network congestion by deploying various caching schemes in the wired Internet [5], [6]. Caching schemes such as [7], [8] are some of the techniques proposed for the wireless counterpart. However, to the best of our knowledge there has been no work on caching based techniques to improve the performance of network mobility such as the one we propose in this paper.…”
Section: Background and Related Workmentioning
confidence: 99%