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

Anthony D. Wood

dblp:53/2947 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 4 · 2 first-authorSystems, architecture and hardware · 1Applied, interdisciplinary, general and emerging 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
5 papers
Internet of things and sensor networks · 78% Internet architecture and protocols · 17% Wireless networking · 5%
Theoretical computer science
1 paper
Coding theory · 100%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
wireless sensor network
0.122008
Rateless erasure codes for bulk transfer in asymmetric wireless sensor networks · SenSys 2008
AMSecure: secure link-layer communication in TinyOS for IEEE 802.15.4-based wireless sensor networks · SenSys 2006
Internet architecture and protocols
bulk data transfer
0.112008
Rateless erasure codes for bulk transfer in asymmetric wireless sensor networks · SenSys 2008
Coding theory › error-correcting codes
erasure coding
0.112008
Rateless erasure codes for bulk transfer in asymmetric wireless sensor networks · SenSys 2008
Coding theory › error-correcting codes
rateless codes
0.112008
Rateless erasure codes for bulk transfer in asymmetric wireless sensor networks · SenSys 2008
Internet of things and sensor networks
delay tolerant networks
0.112007
LUSTER: wireless sensor network for environmental research · SenSys 2007
Internet of things and sensor networks › environmental sensing
environmental sensor network
0.112007
LUSTER: wireless sensor network for environmental research · SenSys 2007
Cryptographic protocols and secure computation
key management
0.112006
AMSecure: secure link-layer communication in TinyOS for IEEE 802.15.4-based wireless sensor networks · SenSys 2006
Internet of things and sensor networks › wireless sensor network
sensor network middleware
0.012003
An Entity Maintenance and Connection Service for Sensor Networks · MobiSys 2003
Internet of things and sensor networks
sensor network security
0.012003
JAM: A Jammed-Area Mapping Service for Sensor Networks · RTSS 2003
Wireless networking
asymmetric communication
0.012008
Rateless erasure codes for bulk transfer in asymmetric wireless sensor networks · SenSys 2008
Distributed systems
fault tolerance
0.012007
LUSTER: wireless sensor network for environmental research · SenSys 2007
Operating systems › special-purpose operating system
embedded operating system
0.012006
AMSecure: secure link-layer communication in TinyOS for IEEE 802.15.4-based wireless sensor networks · SenSys 2006
Operating systems › special-purpose operating system › embedded operating system › sensor network operating system
TinyOS
0.012006
AMSecure: secure link-layer communication in TinyOS for IEEE 802.15.4-based wireless sensor networks · SenSys 2006
Distributed systems
distributed coordination
0.012003
An Entity Maintenance and Connection Service for Sensor Networks · MobiSys 2003

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

hierarchical architecture · 0.1deployment time validation · 0.1
YearPublicationVenuePosition
2009 Online Coding for Reliable Data Transfer in Lossy Wireless Sensor Networks
Anthony D. Wood, John A. Stankovic
DCOSS1
2008 SenQ: An Embedded Query System for Streaming Data in Heterogeneous Interactive Wireless Sensor Networks
Anthony D. Wood, Leo Selavo, John A. Stankovic
DCOSS1
2008 Rateless erasure codes for bulk transfer in asymmetric wireless sensor networks
abstract
No abstract available.
Anthony D. Wood, John A. Stankovic
SenSys1
2007 LUSTER: wireless sensor network for environmental research
abstract
Environmental wireless sensor network (EWSN) systems are deployed in potentially harsh and remote environments where inevitable node and communication failures must be tolerated. LUSTER---Light Under Shrub Thicket for Environmental Research---is a system that meets the challenges of EWSNs using a hierarchical architecture that includes distributed reliable storage, delay-tolerant networking, and deployment time validation techniques.
Leo Selavo, Anthony D. Wood, Qing Cao 0001, Tamim I. Sookoor, Hengchang Liu, Yafeng Wu, Woochul Kang, John A. Stankovic, Donald Young, John H. Porter
SenSys2
2006 AMSecure: secure link-layer communication in TinyOS for IEEE 802.15.4-based wireless sensor networks
abstract
No abstract available.
Anthony D. Wood, John A. Stankovic
SenSys1
2004 EnviroTrack: Towards an Environmental Computing Paradigm for Distributed Sensor Networks
abstract
Distributed sensor networks are quickly gaining recognition as viable embedded computing platforms. Current techniques for programming sensor networks are cumbersome, inflexible, and low-level. We introduce EnviroTrack, an object-based distributed middleware system that raises the level of programming abstraction by providing a convenient and powerful interface to the application developer geared towards tracking the physical environment. EnviroTrack is novel in its seamless integration of objects that live in physical time and space into the computational environment of the application. Performance results demonstrate the ability of the middleware to track realistic targets.
Tarek F. Abdelzaher, Brian M. Blum, Qing Cao 0001, David Evans 0001, Jemin George, Selvin George, Lin Gu 0001, Tian He 0001, Sudha Krishnamurthy, Liqian Luo, Sang Hyuk Son, John A. Stankovic, Radu Stoleru, Anthony D. Wood
ICDCS15
2003 An Entity Maintenance and Connection Service for Sensor Networks
abstract
In this paper, we present a middleware architecture for coordination services in sensor networks that facilitates interaction between groups of sensors which monitor different environmental events. It sits on top of the native routing infrastructure and exports the abstraction of mobile communication endpoints maintained at the locations of such events. A single logical destination is created and maintained for every environmental event of interest. Such destinations are uniquely labeled and can be used for communication by application-level algorithms for coordination and sensory data management between the different event locales. For example, they may facilitate coordination, in a distributed intrusion scenario, among nodes in the vicinity of the intruders.We evaluate our middleware architecture using GloMoSim, a wireless network simulator. Our results illustrate the success of our architecture in maintaining event-related communication endpoints. We provide an analysis of how architectural and network dependent parameters affect our performance. Additionally we provide a proof of concept implementation on a real sensor network testbed (Berkeley's MICA Motes).
Brian M. Blum, Prashant Nagaraddi, Anthony D. Wood, Tarek F. Abdelzaher, Sang Hyuk Son, John A. Stankovic
MobiSys3
2003 JAM: A Jammed-Area Mapping Service for Sensor Networks
abstract
Preventing denial-of-service attacks in wireless sensor networks is difficult primarily because of the limited resources available to network nodes and the ease with which attacks are perpetrated. Rather than jeopardize design requirements which call for simple, inexpensive, mass-producible devices, we propose a coping strategy that detects and maps jammed regions. We describe a mapping protocol for nodes that surround a jammer which allows network applications to reason about the region as an entity, rather than as a collection of broken links and congested nodes. This solution is enabled by a set of design principles: loose group semantics, eager eavesdropping, supremacy of local information, robustness to packet loss and failure, and early use of results. Performance results show that regions can be mapped in 1-5 seconds, fast enough for real-time response. With a moderately connected network, the protocol is robust to failure rates as high as 25 percent.
Anthony D. Wood, John A. Stankovic, Sang Hyuk Son
RTSS1