Demo Data from EDBT 2026 / reviewers in the wild / expert
Sean Furman
dblp:192/9845
· DBLP profile ↗
4ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2
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 |
Optical networks · 28% Routing and switching · 28% Wireless networking · 28% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking
cross-layer optimization |
0.4 | 1 | 2019 | Design and Experimental Evaluation of a Cross-Layer Deadline-Based Joint Routing and Spectrum Allocation Algorithm · IEEE Trans. Mob. Comput. 2019 |
Routing and switching › qos routing
deadline-aware routing |
0.4 | 1 | 2019 | Design and Experimental Evaluation of a Cross-Layer Deadline-Based Joint Routing and Spectrum Allocation Algorithm · IEEE Trans. Mob. Comput. 2019 |
Optical networks › elastic optical networks
routing and spectrum assignment |
0.4 | 1 | 2019 | Design and Experimental Evaluation of a Cross-Layer Deadline-Based Joint Routing and Spectrum Allocation Algorithm · IEEE Trans. Mob. Comput. 2019 |
Network optimization and economics
resource allocation |
0.1 | 1 | 2019 | Design and Experimental Evaluation of a Cross-Layer Deadline-Based Joint Routing and Spectrum Allocation Algorithm · IEEE Trans. Mob. Comput. 2019 |
Network optimization and economics › resource allocation
spectrum allocation |
0.1 | 1 | 2019 | Design and Experimental Evaluation of a Cross-Layer Deadline-Based Joint Routing and Spectrum Allocation Algorithm · IEEE Trans. Mob. Comput. 2019 |
Methods — techniques the papers use, named apart from their topics
weighted virtual queue · 0.4distributed algorithm · 0.4cross-layer framework · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Machine Learning Subsystem for Autonomous Collision Avoidance on a small UAS with Embedded GPUabstractInterest in unmanned aerial system (UAS) powered solutions for 6G communication networks has grown immensely with the widespread availability of machine learning based autonomy modules and embedded graphical processing units (GPUs). While these technologies have revolutionized the possibilities of UAS solutions, designing an operable, robust autonomy framework for UAS remains a multi-faceted and difficult problem. In this work, we present our novel, modular framework for UAS autonomy, entitled MR-iFLY, and discuss how it may be extended to enable 6G swarm solutions. We begin by detailing the challenges associated with machine learning based UAS autonomy on resource constrained devices. Next, we describe in depth, how MR-iFLY’s novel depth estimation and collision avoidance technology meets these challenges. Lastly, we describe the various evaluation criteria we have used to measure performance, show how our optimized machine vision components provide up to 15X speedup over baseline models and present a flight demonstration video of MR-iFLY’s vision-based collision avoidance technology. We argue that these empirical results substantiate MR-iFLY as a candidate for use in reducing communication overhead between nodes in 6G communication swarms by providing standalone collision avoidance and navigation capabilities. Nicholas Polosky, Tyler Gwin, Sean Furman, Parth Barhanpurkar, Jithin Jagannath |
CCNC | 3 |
| 2019 | Energy Efficient Ad Hoc Networking Devices for Off-the-Grid Public Safety NetworksabstractIn this paper, we present the preliminary work towards providing a complete end-to-end solution that can connect survivors of a disaster with each other and public safety authorities using a completely self-sufficient ad hoc network. Accordingly, we develop a Heterogeneous Efficient Low Power Radio (HELPER) that acts as a WiFi (Wireless Fidelity) access point for end-users to connect using custom application. These HELPERs then coordinate with each other to form a LoRa based ad hoc network. The proposed solution will use a distributed optimized cross-layer routing algorithm that aims to maximize the network lifetime. This aspect is critical especially in energy-limited scenarios after a disaster. Some of the envisioned services include text and voice messages, live map updates, ability to send distress messages (like 911 calls) to authorities. HELPER network can also be used by authorities to remotely monitor the connectivity of the affected area, alert users of imminent dangers and share resource information. We intend to provide resources (code and instructions) that will enable the researchers of the community to set up a HELPER in a cost-effective (<; $ 150) manner using commercial off-the-self components and advance it further. Overall, we hope this technology will become instrumental in improving the efficiency and effectiveness of public safety activities. Jithin Jagannath, Sean Furman, Anu Jagannath, Andrew L. Drozd |
CCNC | 2 |
| 2019 | HELPER: Heterogeneous Efficient Low Power Radio for enabling ad hoc emergency public safety networks
Jithin Jagannath, Sean Furman, Anu Jagannath, Luther Ling, Andrew Burger, Andrew L. Drozd |
Ad Hoc Networks | 2 |
| 2019 | Design and Experimental Evaluation of a Cross-Layer Deadline-Based Joint Routing and Spectrum Allocation AlgorithmabstractThe design and implementation of a novel distributed deadline-based routing and spectrum allocation algorithm for tactical ad-hoc networks is reported in this article. Different traffic classes including text, voice, surveillance video, and threat alert among others need to be handled by these networks. Each of these traffic classes have different quality of service (QoS) based deadline requirements. Additionally, these networks are characterized by dynamic channel and traffic conditions that vary with time and location. Even under these conditions, it is critical to receive packets before the deadline expires to make rapid decisions in the battlefield. Therefore, a tactical ad-hoc network should be able to adapt to these requirements and maximize the number of packets delivered to the destination within the specified deadline. A distributed deadline-based routing and spectrum allocation algorithm is designed to maximize the utilization of the available resources and ensure delivery of packets within the deadline constraints. To this end, a weighted virtual queue (VQ) that is used to construct the network utility function is defined. Accordingly, the optimal session, next hop, transmit power, and frequency is determined by the distributed algorithm to ensure efficient utilization of the available resources. Hence, maximizing the delivery of packets to the intended destination within the specified deadline. The 49 node simulation shows up to 35 percent improvement in effective throughput and 26 percent improvement in reliability as compared to joint ROuting and Spectrum Allocation algorithm (ROSA), which does not adapt according to the deadline requirements of the data flowing through the network. As a secondary objective, this work advances the state of the art of the experimental cross-layer framework to address the challenges involved in having such cross-layer algorithms implemented on a testbed. The required flexibility to change the transmission parameters on-the-fly is provided by the proposed framework. The network is designed to enable the data exchange between neighbors using custom designed control packets (which might be different for different algorithms) since this information is critical for nodes to perform optimization. Cross-layer optimization is achieved by means of data management and control entities that enable information exchange between layers. The practicality of the proposed solution was proven by having the novel algorithm implemented on a five-node software defined radio testbed which leverages the proposed cross-layer framework. In contrast to ROSA, the proposed algorithm demonstrated up to 17 percent improvement in terms of throughput and reliability. The performance improvement achieved is expected to increase on a larger network deployment. Jithin Jagannath, Sean Furman, Tommaso Melodia, Andrew L. Drozd |
IEEE Trans. Mob. Comput. | 2 |