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

James Edwards 0002

dblp:12/8665-2 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · none

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

Computer networks · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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
Internet of things and sensor networks · 70% Wireless networking · 30%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network
in-network processing
0.112012
Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multihop Wireless Networks · IEEE Trans. Mob. Comput. 2012
Wireless networking › wireless mesh network
multihop wireless network
0.112012
Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multihop Wireless Networks · IEEE Trans. Mob. Comput. 2012
Internet of things and sensor networks
wireless sensor network
0.112012
Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multihop Wireless Networks · IEEE Trans. Mob. Comput. 2012
Internet of things and sensor networks › query processing
operator placement
0.012012
Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multihop Wireless Networks · IEEE Trans. Mob. Comput. 2012

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

utility-based closed-loop control · 0.1distributed optimization · 0.1
YearPublicationVenuePosition
2017 Resource Allocation for Pragmatically-Assisted Quality of Information-Aware Networking
abstract
In this work, we present a framework for handling multiple, simultaneous, natural language queries, in a resource constrained environment, using Quality of Information (QoI). Incoming queries are first parsed into response graphs, tree-like structures designed to formalize a system's understanding of user intent, via a pragmatics toolkit. The system then uses a combination of QoI-awareness, adaptive intent determination, and packing algorithms to maximize the QoI realized by the system. We employ two different methods of evaluation, a one-shot model and an iterative, time-staged model. Under the one-shot model, packed jobs are answered and the rest discarded, and we aim to maximize the total realized QoI. Under the staged model, the system repeatedly packs and offers answers until all jobs are complete; here we aim to maximize time-weighted QoI and minimize completion time. We evaluate the performance of different instantiations of our system through thousands of procedurally-generated simulations.
James Edwards 0002, Rebecca J. Passonneau, Taylor Cassidy, Thomas La Porta
ICCCN1
2014 Quality of information-aware mobile applications
James Edwards 0002, Ahmed Bahjat, Yurong Jiang, Trevor Cook, Thomas La Porta
Pervasive Mob. Comput.1
2012 Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multihop Wireless Networks
abstract
In-network Processing, involving operations such as filtering, compression, and fusion is a technique widely used in wireless sensor and ad hoc networks for reducing the communication overhead. In many tactical stream-oriented applications, especially in military scenarios, both link bandwidth and node energy are critically constrained resources. For such applications, in-network processing itself imposes nonnegligible computing cost. In this work, we have developed a unified, utility-based closed-loop control framework that permits distributed convergence to both 1) the optimal level of compression performed by a forwarding node on streams, and 2) the best set of nodes where the operators of the stream processing graph should be deployed. We also show how the generalized model can be adapted to more realistic cases, where the in-network operator may be varied only in discrete steps, and where a fusion operation cannot be fractionally distributed across multiple nodes. Finally, we provide a real-time implementation of the protocol on an 802.11b network with a video application and show that the performance of the network is improved significantly in terms of the packet loss, node lifetime, and quality of video received.
Sharanya Eswaran, James Edwards 0002, Archan Misra, Thomas La Porta
IEEE Trans. Mob. Comput.2