Demo Data from EDBT 2026 / reviewers in the wild / expert
Xinxin Liu 0010
dblp:99/3477-10
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2007
0000-0003-2739-2334ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 1 first-authorSystems, architecture and hardware · 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
2 papers |
Routing and switching · 45% Wireless networking · 42% Internet of things and sensor networks · 13% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking
mobile ad hoc networks |
0.1 | 2 | 2007 | A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks · IEEE Trans. Parallel Distributed Syst. 2007 Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks · INFOCOM 2006 |
Routing and switching › routing protocol
flooding protocol |
0.1 | 1 | 2007 | A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks · IEEE Trans. Parallel Distributed Syst. 2007 |
Routing and switching › packet forwarding
forward node selection |
0.1 | 1 | 2007 | A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks · IEEE Trans. Parallel Distributed Syst. 2007 |
Routing and switching
routing protocol |
0.1 | 1 | 2007 | A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks · IEEE Trans. Parallel Distributed Syst. 2007 |
Wireless networking › broadcast
broadcast storm mitigation |
0.1 | 1 | 2006 | Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks · INFOCOM 2006 |
Internet of things and sensor networks › wireless sensor network › wireless sensor network routing
flooding |
0.1 | 1 | 2006 | Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks · INFOCOM 2006 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.11-hop neighbor information · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | A Location Aided Flooding Protocol for Wireless Ad Hoc Networks
Xinxin Liu 0010, Xiaohua Jia, Hai Liu 0001 |
MSN | 1 |
| 2007 | A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc NetworksabstractFlooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of messages, resource contention, and signal collision. This causes high protocol overhead and interference with the existing traffic in the networks. Some efficient flooding algorithms were proposed to avoid these problems. However, these algorithms either perform poorly in reducing redundant transmissions or require each node to maintain 2-hop (or more) neighbors information. In the paper, we study the sufficient and necessary condition of 100 percent deliverability for flooding schemes that are based on only 1-hop neighbors information. We further propose an efficient flooding algorithm that achieves the local optimality in two senses: 1) the number of forwarding nodes in each step is minimal and 2) the time complexity for computing forwarding nodes is the lowest, which is O(nlogn), where n is the number of neighbors of a node. Extensive simulations have been conducted and simulation results have shown the excellent performance of our algorithm Hai Liu 0001, Xiaohua Jia, Peng-Jun Wan, Xinxin Liu 0010, F. Frances Yao |
IEEE Trans. Parallel Distributed Syst. | 4 |
| 2006 | Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc NetworksabstractAbstract—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of messages, resource contention, and signal collision. This causes high protocol overhead and interference to the existing traffic in the networks. Some efficient flooding algorithms were proposed to avoid these problems. However, these algorithms either perform poorly in reducing redundant transmissions, or require each node to maintain 2-hop (or more) neighbors information. In the paper, we study the sufficient and necessary condition of 100% deliverability for flooding schemes that are based on only 1-hop neighbors information. We further propose an efficient flooding algorithm that achieves the local optimality in two senses: 1) the number of forwarding nodes in each step is the minimal; 2) the time complexity for computing forwarding nodes is the lowest, Hai Liu 0001, Peng-Jun Wan, Xiaohua Jia, Xinxin Liu 0010, F. Frances Yao |
INFOCOM | 4 |