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

Vinodkrishnan Kulathumani

dblp:85/5463 · also Vinod Kulathumani · DBLP profile ↗
← Back
26ranked-venue papers
5as first author
1since 2021 · last 2024
0000-0001-8005-0603ORCID · corroborated

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

Computer networks · 12 · 2 first-authorSystems, architecture and hardware · 3 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Security and privacy · 1Theory of computation · 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
10 papers
Internet of things and sensor networks · 96% Wireless networking · 3% Cellular and mobile networks · 1%
Computer architecture, parallel and distributed computing, and storage systems
7 papers
Integrated circuit design · 33% Reconfigurable computing and FPGAs · 28% Embedded and real-time systems · 15%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
wireless sensor network
0.442013
Demo abstract: netamorph: field-programmable analog arrays for energy-efficient sensor networks · IPSN 2013
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Internet of things and sensor networks › wireless sensor network
analog signal processing
0.432013
Demo abstract: netamorph: field-programmable analog arrays for energy-efficient sensor networks · IPSN 2013
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Internet of things and sensor networks › wireless sensor network
in-network processing
0.432013
Demo abstract: netamorph: field-programmable analog arrays for energy-efficient sensor networks · IPSN 2013
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Integrated circuit design › analog and mixed-signal circuits › analog VLSI
field programmable analog array
0.422015
RAMP: accelerating wireless sensor hardware design with a reconfigurable analog/mixed-signal platform · IPSN 2015
Demo abstract: netamorph: field-programmable analog arrays for energy-efficient sensor networks · IPSN 2013
Internet of things and sensor networks
energy efficiency
0.332013
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Demo abstract: netamorph: field-programmable analog arrays for energy-efficient sensor networks · IPSN 2013
Internet of things and sensor networks › low-power wireless
wake-up detection
0.222010
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Hibernets: energy-efficient sensor networks using analog signal processing · IPSN 2010
Reconfigurable computing and FPGAs
dynamic reconfiguration
0.212013
Demo abstract: netamorph: field-programmable analog arrays for energy-efficient sensor networks · IPSN 2013
Embedded and real-time systems › wireless communication › wireless sensor networks
wireless sensor node
0.112010
Energy efficient sensor node implementations · FPGA 2010
Energy-efficient computing › low-power design
low-power sensing
0.112015
RAMP: accelerating wireless sensor hardware design with a reconfigurable analog/mixed-signal platform · IPSN 2015
Integrated circuit design › analog and mixed-signal circuits
mixed-signal circuit design
0.112015
RAMP: accelerating wireless sensor hardware design with a reconfigurable analog/mixed-signal platform · IPSN 2015
Internet of things and sensor networks › topology control
clustering
0.112006
A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks · IEEE Trans. Parallel Distributed Syst. 2006
Wireless networking
mobile ad hoc networks
0.112006
A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks · IEEE Trans. Parallel Distributed Syst. 2006
Internet of things and sensor networks › wireless sensor network
sensor network testbed
0.112006
Kansei: a testbed for sensing at scale · IPSN 2006
Internet of things and sensor networks
wireless sensor and actuator networks
0.112006
Differential games in large-scale sensor-actuator networks · IPSN 2006
Distributed systems
fault tolerance
0.112006
A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks · IEEE Trans. Parallel Distributed Syst. 2006
Performance modeling and evaluation › simulation › analog and hybrid computer simulation
hybrid simulation
0.112006
Kansei: a testbed for sensing at scale · IPSN 2006
Embedded and real-time systems
networked control systems
0.112006
Differential games in large-scale sensor-actuator networks · IPSN 2006
Distributed systems › fault tolerance
self-stabilization
0.112006
A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks · IEEE Trans. Parallel Distributed Syst. 2006
Performance modeling and evaluation
simulation
0.112006
Kansei: a testbed for sensing at scale · IPSN 2006
Internet of things and sensor networks › wireless sensor network › distributed sensing › networked sensing
distributed sensor networks
0.012010
Energy efficient sensor node implementations · FPGA 2010
Embedded and real-time systems › embedded system design
low-power embedded computing
0.012010
Energy efficient sensor node implementations · FPGA 2010
Cellular and mobile networks
scalable information dissemination
0.012006
Differential games in large-scale sensor-actuator networks · IPSN 2006

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

analog signal processing · 0.8reconfigurable integrated circuit · 0.4mixed-signal design · 0.4spectral analysis · 0.2analog front-end · 0.2FPGA implementation · 0.2DSP processing · 0.2optimal control · 0.1hybrid simulation · 0.1differential game theory · 0.1sensor data generation · 0.1
YearPublicationVenuePosition
2024 Large-scale Indoor Mapping with Failure Detection and Recovery in SLAM
abstract
This paper addresses the failure detection and recovery problem in visual-inertial based Simultaneous Localization and Mapping (SLAM) systems for large-scale indoor environments. Camera and Inertial Measurement Unit (IMU) are popular choices for SLAM in many robotics tasks (e.g., navigation) due to their complementary sensing capabilities and low cost. However, vision has inherent challenges even in well-lit scenes, including motion blur, lack of features, or even accidental camera blockage. These failures can cause drifts to accumulate over time and can severely impact the scalability of existing solutions to large areas. To address these issues, we propose an automatic map generation service with (i) a failure detection method based on visual feature tracking quality using a health tracker which identifies and discards faulty measurements and (ii) a continuous session merging approach in SLAM. Taken together, this allows us to handle erroneous data without any manual intervention, and allows us to scale to extremely large spaces. The proposed system has been validated on benchmark datasets. Also, experimental results on multiple custom large-scale grocery stores, each between 1700 m2to 3700 m2, and duration 60 to 80 minutes, are presented. Our approach shows the lowest error in all large-scale SLAM cases when compared with state-of-the-art visual-inertial SLAM packages, which often produce highly erroneous trajectories or lose track. Additionally, we provide dense 3D reconstruction with the presence of a depth camera by simply registering the point cloud from RGB-D image with respect to the SLAM generated trajectory – and the quality of the reconstruction illustrates the efficacy of our proposed method.
Sharmin Rahman, Robert DiPietro, Dharanish Kedarisetti, Vinodkrishnan Kulathumani
IROS4
2019 RoAdNet: A Multi-Resolution Transmission Strategy for Long Range Information Diffusion in VANETs
abstract
The focus of this paper is on designing a robust information dissemination protocol for Vehicular Ad-Hoc Networks (VANETs) that works across a broad range of application scenarios by dynamically adapting its parameters and transmission strategy to specific information requirements and traffic conditions. Applications of V2V communication can be broadly classified as safety, navigation and environmental efficiency. Safety applications require high frequency and high precision messages at short range (500m) within a single communication hop, navigation applications need low frequency and lower precision information at medium range (1500m/1 mile) and long range aggregate information (10000m/6 miles) can be used for enhancing environmental efficiency and routing. While network protocols for each of these applications have been individually studied, there is scope to study their behavior when they coexist in the network. It is important that the quality of one hop safety messages is not sacrificed when long range communication is introduced. RoAdNet enables long range information dissemination, while maintaining high data.
Priyashraba Misra, Vinodkrishnan Kulathumani
VTC Fall2
2018 Census: fast, scalable and robust data aggregation in MANETs
Vinodkrishnan Kulathumani, Anish Arora, Mukundan Sridharan, Ken Parker, Masahiro Nakagawa
Wirel. Networks1
2017 Novel WSN Hardware for Long Range Low Power Monitoring
abstract
Environmental monitoring applications often require 24/7 operation in harsh, low resource (e.g. power and communication) environments over a large scale area with ad-hoc deployment of sensors. Data processing at the sensor is required to minimize communication overhead. Such an application scenario presents opportunities for research in wireless sensor networks (WSN)s that are distinct from existing commercial off-the-shelf (COTS) solutions. We present a novel modular, highly flexible, hardware solution with a core feature of a System on a Chip (SoC) with add-ons such as memories, interfaces, and different transmission input/output I/O modalities. The system can manage, process, and transmit data directly within an ad-hoc self healing, self forming, mesh network over long distance (19 km between nodes in the current implementation) or as a stand-alone system. Hardware has been produced and the system has been validated in real-world deployments.
Janette Frigo, Hudson Ayers, Vinodkrishnan Kulathumani, Shawn Hinzey, Sanna Sevanto, Michael Priocou, Xiougang Yang, Kevin McCabe, Alexandra Saari, Kari Sentz
DCOSS3
2015 RAMP: accelerating wireless sensor hardware design with a reconfigurable analog/mixed-signal platform
abstract
To meet the demanding requirements in the growing area of wireless sensing applications, some sensing platforms have included low-power application-specific hardware to process the sensor data for compression and pre-classification of the relevant information. While this additional hardware can reduce the overall power consumption of the system, a unique hardware solution is required for each application. To diminish this burden, we will demonstrate a reconfigurable analog/mixed-signal sensing platform. At the hardware-level, this platform consists of a reconfigurable integrated circuit containing many commonly used circuit components that can be connected in any configuration to perform sensor interfacing and ultra-low-power signal processing. At the software level, this platform provides a framework for abstracting the underlying hardware. We will demonstrate how our platform allows a developer to create applications ranging from standard sensor interfacing techniques to more complicated intelligent pre-processing and wake-up detection, without the necessity of circuit-level expertise.
Brandon M. Kelly, Brandon Rumberg, David W. Graham, Vinodkrishnan Kulathumani, Spencer Clites, Alex Dilello, Mir Mohammad Navidi
IPSN4
2015 RAMP: accelerating wireless sensor hardware design with a reconfigurable analog/mixed-signal platform
abstract
The requirements of many wireless sensing applications approach, or even exceed, the limited hardware capabilities of energy-constrained sensing platforms. To achieve such demanding requirements, some sensing platforms have included low-power application-specific hardware---at the expense of generality---to pre-process the sensor data for reduction to only the relevant information. While this additional hardware can save power by reducing the activity of the microcontroller and radio, a unique hardware solution is required for each application, which presents an unrealistic burden in terms of design time, cost, and ease of integration. To diminish these burdens, we present a reconfigurable analog/mixed-signal sensing platform in this work. At the hardware-level, this platform consists of a reconfigurable integrated circuit containing many commonly used signal-processing blocks and circuit components that can be connected in any configuration. At the software level, this platform provides a framework for abstracting this underlying hardware. We demonstrate how to quickly develop new applications on this platform, ranging from standard sensor interfacing techniques to more complicated intelligent pre-processing and wake-up detection. We also demonstrate how to integrate this platform with commonly used wireless sensor nodes and embedded-system platforms.
Brandon Rumberg, David W. Graham, Spencer Clites, Brandon M. Kelly, Mir Mohammad Navidi, Alex Dilello, Vinodkrishnan Kulathumani
IPSN7
2013 Demo abstract: netamorph: field-programmable analog arrays for energy-efficient sensor networks
abstract
The limited power budgets of sensor networks necessitate some level of in-network pre-processing to reduce communication overhead. The low power consumption of analog signal processing (ASP) is well-suited for this task. However, the quick adoption of this technology has been restrained by the fact that ASP implementation requires a priori knowledge of the application space. Our solution to this challenge is to enable run-time reconfiguration through the use of a field-programmable analog array (FPAA). In the same way that reconfigurable digital systems allow system designers to change the infrastructure of digital blocks, an FPAA allows an application developer to change the infrastructure of, and even tune, ASP blocks without circuit-level expertise. We will demonstrate that an FPAA can be used to (1) facilitate the use of ASP to reduce power consumption, and to (2) allow run-time reconfigurability to maximize ASP impact.
Brandon Rumberg, Brandon M. Kelly, David W. Graham, Vinodkrishnan Kulathumani
IPSN4
2012 VCAST: An Infrastructure-Less Vehicular Traffic Information Service with Distance-Sensitive Precision
abstract
In this paper, we describe VCAST, an algorithm for obtaining individual vehicle location as well as aggregate traffic information over an infrastructure-less multi-hop wireless vehicular network. VCAST can be used to improve safety against collisions, inform about approaching emergency vehicles and lane merging vehicles (that may even be beyond a single hop communication range) and to enable dynamic routing and navigation techniques by providing aggregate traffic information in an extended neighborhood. To ensure scalability in forwarding information over multiple hops, we exploit a notion of distance sensitivity in information propagation, by which traffic information is propagated at a rate that decreases linearly with distance from the source. By doing so, traffic information can be obtained with a staleness, which is a measure of error in the traffic information, that is bounded by O(dh2) where dhis the communication hop distance from the source of the information. At the same time, the required communication rate per unit time at each node only depends on the radius of the region in terms of communication hops, and not on the vehicular density or the number of vehicles in the region. VCAST does not require any special hardware or modification to vehicular transmission standards; instead it can simply piggyback on basic Here I am communication for vehicular networks.
Vinodkrishnan Kulathumani, Yaser P. Fallah
VTC Fall1
2010 Energy efficient sensor node implementations
abstract
In this paper, we discuss a low power embedded sensor node architecture we are developing for distributed sensor network systems deployed in a natural environment. In particular, we examine the sensor node for energy efficient processing-at-the-sensor. We analyze the following modes of operation; event detection, data acquisition, and data processing using low power, high performance embedded technology such as specialized embedded DSP processors and low power FPGAs at the sensing node. We use compute intensive sensor node applications: an acoustic vehicle classifier (frequency domain analysis) and a video license plate identification application (learning algorithm). We report performance and energy for these applications and discuss the system architecture design trade offs.
Jan R. Frigo, Eric Y. Raby, Sean M. Brennan, Christophe Wolinski, Charles Wagner, François Charot, Edward Rosten, Vinodkrishnan Kulathumani
FPGA8
2010 Hibernets: energy-efficient sensor networks using analog signal processing
abstract
In-network processing is recommended for many sensor network applications to reduce communication and improve energy efficiency. However, constraints on memory, speed, and energy currently limit the processing capabilities within a sensor network. In this paper, we describe how ultra-low-power analog circuitry can be integrated with sensor nodes to create energy-efficient sensor networks. We present a custom analog front-end which performs spectral analysis at a fraction of the power used by a digital counterpart. We then show that the front-end can be combined with existing sensor nodes to (1) selectively wake up the mote based upon spectral content of the signal, thus increasing battery life without missing interesting events, and to (2) achieve low-power signal analysis using an analog spectral decomposition block, freeing up digital computation resources for higher-level analysis.
Brandon Rumberg, David W. Graham, Vinodkrishnan Kulathumani
IPSN3
2010 Hibernets: energy-efficient sensor networks using analog signal processing
abstract
In-network processing is recommended for many sensor network applications to reduce communication and improve energy efficiency. However, constraints on memory, speed, and energy currently limit the processing capabilities within a sensor network. By integrating ultra-low-power analog circuitry with sensor nodes, we can reduce the node's power consumption and extend the node's processing capacity. We present a custom analog front-end which performs spectral analysis at a fraction of the power used by a digital counterpart. This front-end has been combined with a TelosB mote to (1) selectively wake up the mote based upon spectral content of the signal, thus increasing battery life without missing interesting events, and to (2) achieve low-power signal analysis using an analog spectral decomposition block, freeing up digital computation resources for higher-level analysis.
Brandon Rumberg, David W. Graham, Vinodkrishnan Kulathumani
IPSN3
2009 Glance: A lightweight querying service for wireless sensor networks
Murat Demirbas, Anish Arora, Vinodkrishnan Kulathumani
Theor. Comput. Sci.3
2009 Trail: A distance-sensitive sensor network service for distributed object tracking
abstract
Distributed observation and control of mobile objects via static wireless sensors demands timely information in a distance-sensitive manner: Information about closer objects is required more often and more quickly than that of farther objects. In this article, we present a wireless sensor network protocol, Trail, that supports distance-sensitive tracking of mobile objects for in-network subscribers upon demand. Trail achieves a find time that is linear in the distance from a subscriber to an object, via a distributed data structure that is updated only locally when the object moves. Notably, Trail does not partition the network into a hierarchy of clusters and clusterheads, and as a result Trail has lower maintenance costs, is more locally fault tolerant, and it better utilizes the network in terms of load balancing and minimizing the size of the data structure needed for tracking. Moreover, Trail is reliable and energy efficient, despite the network dynamics that are typical of wireless sensor networks. Trail can be refined by tuning certain parameters, thereby yielding a family of protocols that are suited for different application settings such as rate of queries, rate of updates, and network size. We evaluate the performance of Trail by analysis, simulations in a 90 × 90 sensor network, and experiments on 105 Mica2 nodes in the context of a pursuer-evader control application.
Vinodkrishnan Kulathumani, Anish Arora, Mukundan Sridharan, Murat Demirbas
ACM Trans. Sens. Networks1
2007 Trail: A Distance Sensitive WSN Service for Distributed Object Tracking
Vinodkrishnan Kulathumani, Anish Arora, Murat Demirbas, Mukundan Sridharan
EWSN1
2007 Distance Sensitive Snapshots in Wireless Sensor Networks
Vinodkrishnan Kulathumani, Anish Arora
OPODIS1
2006 Differential games in large-scale sensor-actuator networks
abstract
Surveillance systems based on sensor network technology have been shown to successfully detect, classify and track targets of interest over a large area. State information collected via the sensor network also enables these systems to actuate mobile agents so as to achieve surveillance goals such as target capture and asset protection. But satisfying these goals is complicated by the fact that track information in a sensor network is routed to mobile agents through multi-hop communication links and is thus subject to delays and losses. In addition, as the sensor network is scaled in size, high throughput rates for all pursuers cannot be sustained at all times, which necessitates a network communication strategy that adapts to pursuer information requirements.In this paper, we concentrate on the formulation of optimal pursuit control strategies in the presence of network effects, assuming that target track information has been established locally in the sensor network. We adapt ideas from the theory of differential games to networked games --including ones involving non-periodic track updates, message losses and message delays-- to derive optimal strategies, bounds on the information requirements, and scaling properties of these bounds. Moreover, we present a specific network communication protocol which has the required scalable information characteristics and conclude with the results of experimental studies.
Hui Cao 0001, Emre Ertin, Vinodkrishnan Kulathumani, Mukundan Sridharan, Anish Arora
IPSN3
2006 Kansei: a testbed for sensing at scale
abstract
The Kansei testbed at the Ohio State University is designed to facilitate research on networked sensing applications at scale. Kansei embodies a unique combination of characteristics as a result of its design focus on sensing and scaling: (i) Heterogeneous hardware infrastructure with dedicated node resources for local computation, storage, data exfiltration and back-channel communication, to support complex experimentation, (ii) Time accurate hybrid simulation engine for simulating substantially larger arrays using testbed hardware resources, (iii) High fidelity sensor data generation and real-time data and event injection, (iv) Software components and associated job control language to support complex multi-tier experiments utilizing real hardware resources and data generation and simulation engines. In this paper, we present the elements of Kansei testbed architecture, including its hardware and software platforms as well as its hybrid simulation and sensor data generation engines.
Emre Ertin, Anish Arora, Rajiv Ramnath, Vinayak S. Naik, Sandip Bapat, Vinodkrishnan Kulathumani, Mukundan Sridharan, Hongwei Zhang 0001, Hui Cao 0001, Mikhail Nesterenko
IPSN6
2006 Glance: A Lightweight Querying Service for Wireless Sensor Networks
Murat Demirbas, Anish Arora, Vinodkrishnan Kulathumani
OPODIS3
2006 A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks
abstract
We present a fast, local clustering service, FLOC, that partitions a multihop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clusterhead such that all nodes within unit distance and some nodes within distance m of the clusterhead belong to the cluster. We show that, by asserting a stretch factor m ges 2, FLOC achieves locality of clustering and fault-local self-stabilization: the effects of cluster formation and faults/changes at any part of the network are contained within at most m + 1 units. Through simulations and experiments with actual deployments, we analyze the trade-offs between clustering time and the quality of clustering and suggest suitable parameters for FLOC to achieve a fast completion time without compromising the quality of the resulting clustering
Murat Demirbas, Anish Arora, Vineet Mittal, Vinodkrishnan Kulathumani
IEEE Trans. Parallel Distributed Syst.4
2005 Project ExScal (Short Abstract)
Anish Arora, Rajiv Ramnath, Prasun Sinha, Emre Ertin, Sandip Bapat, Vinayak S. Naik, Vinodkrishnan Kulathumani, Hongwei Zhang 0001, Mukundan Sridharan, Santosh Kumar 0001, Hui Cao 0001, Nick Seddon, Ted Herman, Nishank Trivedi, Mohamed G. Gouda, Young-ri Choi, Mikhail Nesterenko, Romil Shah, Sandeep S. Kulkarni, Mahesh Aramugam, Limin Wang 0012, David E. Culler, Prabal Dutta, Cory Sharp, Gilman Tolle, Mike Grimmer, Bill Ferriera, Ken Parker
DCOSS7
2005 Analyzing the Yield of ExScal, a Large-Scale Wireless Sensor Network Experiment
abstract
Recent experiments have taken steps towards realizing the vision of extremely large wireless sensor networks, the largest of these being ExScal, in which we deployed about 1200 nodes over a 1.3 km by 300 m open area. Such experiments remain especially challenging because of: (a) prior observations of failure of sensor network protocols to scale, due to network faults and their spatial and temporal variability, (b) complexity of protocol interaction, (c) lack of sufficient data about faults and variability, even at smaller scales, and (d) current inadequacy of simulation and analytical tools to predict sensor network protocol behavior. In this paper, we present detailed data about faults, both anticipated and unanticipated, in ExScal. We also evaluate the impact of these faults on ExScal as well as the design principles that enabled it to satisfy its application requirements despite these faults. We describe the important lessons learnt from the ExScal experiment and suggest services and tools as a further aid to future large scale network deployments.
Sandip Bapat, Vinodkrishnan Kulathumani, Anish Arora
ICNP2
2005 ExScal: Elements of an Extreme Scale Wireless Sensor Network
abstract
Project ExScal (for extreme scale) fielded a 1000+ node wireless sensor network and a 200+ node peer-to-peer ad hoc network of 802.11 devices in a 13km by 300m remote area in Florida, USA during December 2004. In comparison with previous deployments, the ExScal application is relatively complex and its networks are the largest ones of either type fielded to date. In this paper, we overview the key requirements of ExScal, the corresponding design of the hardware/software platform and application, and some results of our experiments.
Anish Arora, Rajiv Ramnath, Emre Ertin, Prasun Sinha, Sandip Bapat, Vinayak S. Naik, Vinodkrishnan Kulathumani, Hongwei Zhang 0001, Hui Cao 0001, Mukundan Sridharan, Santosh Kumar 0001, Nick Seddon, Ted Herman, Nishank Trivedi, Mikhail Nesterenko, Romil Shah, Sandeep S. Kulkarni, Mahesh Aramugam, Limin Wang 0012, Mohamed G. Gouda, Young-ri Choi, David E. Culler, Prabal Dutta, Cory Sharp, Gilman Tolle, Mike Grimmer, Bill Ferriera, Ken Parker
RTCSA7
2005 Reliable Estimation of Influence Fields for Classification and Tracking in Unreliable Sensor Networks
abstract
The influence field of an object, a commonly exploited feature in science and engineering applications, is the region where the object is detectable by a given sensing modality. Being spatially distributed, this feature allows us to tradeoff nodal computation with network communication. By the same token, not only is its calculation subject to nodal failures and false detections, but also to channel fading and channel contention. In this paper, we study how to accurately and efficiently estimate the influence fields of objects in such an unreliable setting and how this reliable estimation of influence fields can be used to classify and track different types of objects. We derive, for node and network fault models, the necessary nodal density for reliably estimating the influence fields so that objects can be classified and tracked. We present four algorithmic techniques: temporal aggregation, probabilistic reporting, temporal segregation and spatial reconstruction, to deal with cases where the effective network density differs from this minimum. We provide corroboration of our analysis through field experiments with Mica2 sensor nodes wherever appropriate. Finally, we demonstrate how these results and techniques were applied to achieve reliable and efficient classification and tracking in a fielded system of 90 Mica2 sensor nodes that we called "A Line In The Sand'.
Sandip Bapat, Vinodkrishnan Kulathumani, Anish Arora
SRDS2
2004 Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks
abstract
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sited clusters. Each cluster has a clusterhead such that all nodes within unit distance of the clusterhead belong to the cluster but no node beyond distance m from the clusterhead belongs to the cluster. By asserting m /spl ges/ 2, FLOC achieves locality: effects of cluster formation and faults/changes at any part of the network are contained within most m units. By taking unit distance to be the reliable communication radius and m to be the maximum communication radius, FLOC exploits the double-band nature of wireless radio-model and achieves clustering in constant time regardless of the network size. Through simulations and experiments with actual deployments, we analyze the tradeoffs between clustering time and the quality of clustering, and suggest suitable parameters for FLOC to achieve a fast completion time without compromising the quality of the resulting clustering.
Murat Demirbas, Anish Arora, Vineet Mittal, Vinodkrishnan Kulathumani
BROADNETS4
2004 A line in the sand: a wireless sensor network for target detection, classification, and tracking
Anish Arora, Prabal Dutta, Sandip Bapat, Vinodkrishnan Kulathumani, Hongwei Zhang 0001, Vinayak S. Naik, Vineet Mittal, Hui Cao 0001, Murat Demirbas, Mohamed G. Gouda, Young-ri Choi, Ted Herman, Sandeep S. Kulkarni, Umamaheswaran Arumugam, Mikhail Nesterenko, Adnan Vora, Mark Miyashita
Comput. Networks4
2001 IP over all-optical networks-issues
abstract
IP over optical is being envisioned as one of the most attractive architectures for the new Internet. There have been various proposals in IETF and other international standards organizations regarding the interaction of IP routers and optical core networks. This paper describes the architectural alternatives for the integration of IP and DWDM networks using Multiprotocol Lambda Switching (MPLambdaS). The paper also addresses the issues of routing, signaling, control and survivability in an all-optical network.
Arjan Durresi, Raj Jain, Nikhil Chandhok, Ramesh Jagannathan, Srinivasan Seetharaman, Vinodkrishnan Kulathumani
GLOBECOM6