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

Ryan Boder

dblp:76/6746 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2005
—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
Routing and switching · 70% Internet of things and sensor networks · 23% Network performance modeling · 7%

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

TopicWeightPapersLastEvidence papers
Routing and switching
geographic routing
0.112005
Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks · INFOCOM 2005
Routing and switching › multipath routing
multipath forwarding
0.112005
Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks · INFOCOM 2005
Routing and switching
qos routing
0.112005
Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks · INFOCOM 2005
Internet of things and sensor networks
wireless sensor network
0.112005
Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks · INFOCOM 2005

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

probabilistic forwarding · 0.1localized geographic forwarding · 0.1
YearPublicationVenuePosition
2005 Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks
abstract
In this paper, we present a novel packet delivery mechanism called multi-path and multi-speed routing protocol (MMSPEED) for probabilistic QoS guarantee in wireless sensor networks. The QoS provisioning is performed in two quality domains, namely, timeliness and reliability. Multiple QoS levels are provided in the timeliness domain by guaranteeing multiple packet delivery speed options. In the reliability domain, various reliability requirements are supported by probabilistic multipath forwarding. All these for QoS provisioning are realized in a localized way without global network information by employing localized geographic packet forwarding augmented with dynamic compensation, which compensates the local decision inaccuracy as a packet travels towards its destination. This way, MMSPEED can guarantee end-to-end requirements in a localized way, which is desirable for scalability and adaptability to large scale dynamic sensor networks. Simulation results show that MMSPEED provides QoS differentiation in both reliability and timeliness domains and, as a result, significantly improves the effective capacity of a sensor network in terms of number of flows that meet both reliability and timeliness requirements.
Emad A. Felemban, Chang-Gun Lee, Eylem Ekici, Ryan Boder, Serdar Vural
INFOCOM4
2005 Real-Time Guarantee of Aperiodic Packets in Single-Hop Ad Hoc Wireless Networks
abstract
Building real-time applications on 802.11 wireless networks is challenging because the medium access protocol is distributed and nodes contend for the channel nondeterministically. So far all attempts at providing real-time services in 802.11 require restrictive traffic assumptions such as periodicity. In this paper we describe distributed admission control, a modification to 802.11 that, when used with distributed prioritization, provides real-time guarantees for aperiodic packets. We show that barring external errors such as interference on the channel or incorrect priority scheduling this protocol guarantees deadlines will be met.
Ryan Boder, Chang-Gun Lee
RTCSA1