2003
DOI: 10.1007/978-3-540-39867-7_71
|View full text |Cite
|
Sign up to set email alerts
|

Towards Reliable Forwarding for Ad Hoc Networks

Abstract: Abstract. Ad hoc networking is a new paradigm of wireless communications for mobile nodes. Mobile ad hoc networks work properly only if the partecipating nodes cooperate to network protocols. Cooperative algorithms make the system vulnerable to user misbehavior as well as to malicious and selfish misbehavior. Nodes act selfishly to save battery power, by not cooperating to routing-forwarding functions. Lack of cooperation may severely degrade the performance of the ad hoc system. This paper presents a new appr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2003
2003
2010
2010

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 21 publications
(13 citation statements)
references
References 9 publications
(13 reference statements)
0
13
0
Order By: Relevance
“…When a node forwards a packet, it's reputation value increases by µ, while if it discards the packet, its value is decreased by s where s > µ. (3) Probability Route -Toward Reliable Forward: In this approach [15], a node is responsible not only for forwarding a packet, but it shall forward it on the route that maximizes its success probability. The framework based on reliability indices.…”
Section: Local Reputation Protocolsmentioning
confidence: 99%
“…When a node forwards a packet, it's reputation value increases by µ, while if it discards the packet, its value is decreased by s where s > µ. (3) Probability Route -Toward Reliable Forward: In this approach [15], a node is responsible not only for forwarding a packet, but it shall forward it on the route that maximizes its success probability. The framework based on reliability indices.…”
Section: Local Reputation Protocolsmentioning
confidence: 99%
“…This kind of feedbacks allows the detection of routes containing misbehaving nodes, but fails to detect these nodes. Conti et al [14] [15] propose another interesting end-to-end feedbacks based solution, that uses a cross-layer interaction between the network and the transport layers to decrease the overhead. To overcome the detection problem of end-to-end feedbacks, Kargl et al [16] propose iterative probing, that detects links containing misbehaving nodes but fails to detect the appropriate nodes.…”
Section: Current Solutionsmentioning
confidence: 99%
“…The primary consequence of this choice is that a node has a precise view of the 2-3 hops network around it, and each node has the knowledge of all the possible paths to a destination. These features help in implementing mechanisms of multi-path reliable forwarding [9], and of security/cooperation enforcing [10,11,12,13]. Considering a possibly large MobileMAN network, the 2-3 hops network knowledge mentioned above is not sufficient to route packets between far away nodes.…”
Section: Wi-fimentioning
confidence: 99%