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

Lubo Song

dblp:72/4829 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 3 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author

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 · 70% Network performance modeling · 30%

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

TopicWeightPapersLastEvidence papers
Network performance modeling
concurrent communication
0.112007
Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2007
Wireless networking
medium access control
0.112007
Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2007
Wireless networking
mobile ad hoc networks
0.112007
Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2007

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

simulation · 0.1ns-2 · 0.1
YearPublicationVenuePosition
2009 Minimizing spatial and time reservation with Collision-Aware DCF in mobile ad hoc networks
Lubo Song, Chansu Yu
Ad Hoc Networks1
2007 Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks
abstract
Carrier-sense medium access control (MAC) protocols such as the IEEE 802.11 distributed coordination function (DCF) avoid collisions by holding up pending packet transmission requests when a carrier signal is observed above a certain threshold. However, this often results in unnecessarily conservative communication, thus making it difficult to maximize the utilization of the spatial spectral resource. This paper shows that a higher aggregate throughput can be achieved by allowing more concurrent communications and adjusting the communication distance on the fly, which needs provisions for the following two areas. On the one hand, carrier sense-based MAC protocols do not allow aggressive communication attempts when they are within the carrier senseable area. On the other hand, the communication distance is generally neither short nor adjustable because multihop routing protocols strive for providing minimum hop paths. This paper proposes a new MAC algorithm, called multiple access with salvation army (MASA), which adopts less sensitive carrier sensing to promote more concurrent communications and adjusts the communication distance adaptively via "packet salvaging" at the MAC layer. Extensive simulation based on the ns-2 has shown MASA to outperform the DCF, particularly in terms of packet delay. We also discuss the implementation of MASA based on the DCF specification
Chansu Yu, Kang G. Shin, Lubo Song
IEEE Trans. Mob. Comput.3
2006 Improving Spatial Reuse with Collision-Aware DCF in Mobile Ad Hoc Networks
abstract
According to the carrier sensing mechanism adopted by distributed coordination function (DCF) in IEEE 802.11 standard, a node defers its communication if it senses the medium busy. However, this deferment might block more concurrent communications than necessary. In addition, in DCF, the time duration of deferment is not delivered to all potential interferers, particularly those in the distance. This paper proposes collision-aware DCF (CAD) that efficiently utilizes the available channel resource along both the spatial and time dimensions. Basically, CAD embeds the spatial and time reservation requirements in the PHY header, which is transmitted at the lower data rate, so that a larger group of potential interferers become aware of the ongoing communication and thus avoid collisions. Extensive simulation based on the ns-2 has shown that CAD offers as much as 21% higher packet delivery rate and 91 % lower packet delay than DCF with the CBR (constant bit rate) traffic
Lubo Song, Chansu Yu
ICPP1
2005 Link-layer salvaging for making routing progress in mobile ad hoc networks
abstract
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the spatial spectral resource available for exposed terminals. This paper proposes a new MAC algorithm, called Multiple Access with Salvation Army (MASA), which adopts less sensitive carrier sensing to promote more spatial reuse of the channel. However, this may result in a higher collision probability. MASA alleviates this problem by adaptively adjusting the communication distance via "packet salvaging" at the MAC layer. Extensive simulation based on the ns-2 has shown MASA to offer as much as 25% higher packet delivery rate and 27% higher throughput than the DCF with the CBR (constant bit rate) and TCP traffic, respectively. In particular, a significant reduction in packet delay, 86% and 70% lower packet delay with the CBR and TCP traffic, makes MASA suitable for delay-sensitive applications. For practicality, we discuss the implementation of MASA based on the DCF specification.
Chansu Yu, Kang G. Shin, Lubo Song
MobiHoc3