Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Roger Pack

dblp:31/6413 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 50% Routing and switching · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking
medium access control
0.112007
To Repair or Not To Repair: Helping Ad-hoc Routing Protocols to Distinguish Mobility from Congestion · INFOCOM 2007
Wireless networking
mobile ad hoc networks
0.112007
To Repair or Not To Repair: Helping Ad-hoc Routing Protocols to Distinguish Mobility from Congestion · INFOCOM 2007
Routing and switching › ad hoc network routing
route repair
0.112007
To Repair or Not To Repair: Helping Ad-hoc Routing Protocols to Distinguish Mobility from Congestion · INFOCOM 2007
Routing and switching
routing protocol
0.112007
To Repair or Not To Repair: Helping Ad-hoc Routing Protocols to Distinguish Mobility from Congestion · INFOCOM 2007

Methods — techniques the papers use, named apart from their topics

mobility detection algorithm · 0.1
YearPublicationVenuePosition
2007 To Repair or Not To Repair: Helping Ad-hoc Routing Protocols to Distinguish Mobility from Congestion
abstract
In this paper we consider the problem of distinguishing whether frame loss at the MAC layer has occurred due to mobility or congestion. Most ad hoc routing protocols make the faulty assumption that all frame loss means the destination node has moved, resulting in significant overhead as they initiate the repair of routes that have not been broken. We design a mobility detection algorithm, MDA, that properly detects the cause of a lost frame, then coordinates with the routing protocol so that it reacts properly. This approach dramatically reduces routing protocol overhead and significantly increases application throughput. We use a simulation study to demonstrate the effectiveness of MDA and to determine the proper setting for MDA parameters.
Manoj Pandey, Roger Pack, Lei Wang 0033, Qiuyi Duan, Daniel Zappala
INFOCOM2