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.

Kirill Mechitov

dblp:39/4391 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0003-4321-4415ORCID · corroborated

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

Computer networks · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 2Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 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
Internet of things and sensor networks · 86% Physical-layer communications · 14%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network
target tracking
0.122005
On target tracking with binary proximity sensors · IPSN 2005
Cooperative tracking with binary-detection sensor networks · SenSys 2003
Internet of things and sensor networks › wireless sensor network › target tracking
binary proximity sensor tracking
0.112005
On target tracking with binary proximity sensors · IPSN 2005
Physical-layer communications › signal detection › hypothesis testing
binary detection
0.012003
Cooperative tracking with binary-detection sensor networks · SenSys 2003
Internet of things and sensor networks › wireless sensor network › target tracking
cooperative tracking
0.012003
Cooperative tracking with binary-detection sensor networks · SenSys 2003
Internet of things and sensor networks › wireless sensor network › target tracking
sensor network tracking
0.012003
Cooperative tracking with binary-detection sensor networks · SenSys 2003
Internet of things and sensor networks › wireless sensor network
sensor deployment
0.012005
On target tracking with binary proximity sensors · IPSN 2005
Performance modeling and evaluation
simulation
0.012003
Cooperative tracking with binary-detection sensor networks · SenSys 2003

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

statistical estimation · 0.1approximation techniques · 0.1simulation · 0.1line fitting · 0.1
YearPublicationVenuePosition
2018 Modeling and analyzing real-time wireless sensor and actuator networks using actors and model checking
Ehsan Khamespanah, Marjan Sirjani, Kirill Mechitov, Gul A. Agha
Int. J. Softw. Tools Technol. Transf.3
2016 Schedulability Analysis of Distributed Real-Time Sensor Network Applications Using Actor-Based Model Checking
Ehsan Khamespanah, Kirill Mechitov, Marjan Sirjani, Gul A. Agha
SPIN2
2014 Towards a Flexible Fine-Grained Access Control System for Modern Cloud Applications
abstract
The fast growth of cloud applications highlights the requirement of appropriate security controls to restrict access to shared resources limited to authorized users. Existing authorization systems are not primarily designed for cloud environments and do not provide the required flexibility, adaptability, elasticity, scalability, or fine-grainedness of cloud applications. This paper outlines an ongoing effort in development of a flexible fine-grained access control system for modern cloud-based applications. Modern cloud applications are distinctive in that the required authorization rules are defined by the organizations owning data and resources, before the application logic can be developed by their programmers. Although this simplifies cloud application development and provides flexibility and adaptability to potential future policy changes, it highlights the need for an adaptive flexible authorization system.
Reza Shiftehfar, Kirill Mechitov, Gul A. Agha
IEEE CLOUD2
2012 The time-keeping anomaly of energy-saving sensors: Manifestation, solution, and a structural monitoring case study
abstract
Saving energy is one of the principal challenges in wireless sensor networks. Dynamic voltage and frequency scaling (DVFS) is often used to reduce energy consumption in systems where sleep is not an option. We show that changing the CPU frequency introduces sudden changes in clock behavior, thereby affecting the time-keeping functionality. This anomalous phenomenon is observed in different sensor platforms and causes a loss of time synchronization among nodes that is unacceptable to applications such as structural health monitoring that require tightly synchronized clocks over extended periods. The paper provides experimental measurements of the clock value shift anomaly in three widely used wireless sensor platforms and its impact on clock synchronization costs. A general framework balancing the need to save energy against the need to keep clocks synchronized is developed. Our system is implemented and evaluated on a network of sensors deployed on a truss bridge and running a high-fidelity structural health monitoring application. Experimental measurements confirm the efficacy of the solution in saving energy while maintaining an acceptable level of synchronization.
Paria Moinzadeh, Kirill Mechitov, Reza Shiftehfar, Tarek F. Abdelzaher, Gul A. Agha, B. F. Spencer Jr.
SECON2
2010 Resilient localization for sensor networks in outdoor environments
abstract
The process of determining the physical locations of nodes in a wireless sensor network is known as localization . Self-localization is critical for large-scale sensor networks, because manual or assisted localization is often impractical due to time requirements, economic constraints, or inherent limitations of the deployment scenarios. We propose scalable solutions for reliably localizing wireless sensor networks in environments conducive to several types of ranging errors. We follow a hybrid hardware-software approach for acoustic ranging or radio interferometry to acquire internode distance measurements, and a resilient self-localization algorithm to compute the node location estimates. The acoustic ranging method improves on previous work, extending the practical measurement range up to 35 m in grassy outdoor environments, achieving a distance-invariant median measurement error of about 1% (33 cm). The localization algorithm is based on least-squares scaling with soft constraints. Empirical evaluation using ranging results obtained from sensor network field experiments and simulations confirms that our approach is more resilient than multidimensional scaling (MDS) algorithms against large-magnitude ranging errors and sparse range measurements: conditions that are common in large-scale outdoor sensor network deployments.
YoungMin Kwon, Kirill Mechitov, Sameer Sundresh, WooYoung Kim, Gul A. Agha
ACM Trans. Sens. Networks2
2005 Resilient Localization for Sensor Networks in Outdoor Environments
abstract
The process of computing the physical locations of nodes in a wireless sensor network is known as localization. Self-localization is critical for large-scale sensor networks because manual or assisted localization is often impractical due to time requirements, economic constraints or inherent limitations of deployment scenarios. We have developed a service for reliably localizing wireless sensor networks in environments conducive to ranging errors by using a custom hardware-software solution for acoustic ranging and a family of self-localization algorithms. The ranging solution improves on previous work, extending the practical measurement range threefold (20-30m) while maintaining a distance-invariant median measurement error of about 1% of maximum range (33cm). The localization scheme is based on least squares scaling with soft constraints. Evaluation using ranging results obtained from sensor network field experiments shows that the localization scheme is resilient against large-magnitude ranging errors and sparse range measurements, both of which are common in large-scale outdoor sensor network deployments.
YoungMin Kwon, Kirill Mechitov, Sameer Sundresh, WooYoung Kim, Gul A. Agha
ICDCS2
2005 On target tracking with binary proximity sensors
abstract
We consider the use of binary proximity sensors for tracking targets. Such sensors provide only 1-bit information regarding a target's presence or absence in their vicinity, albeit with less than 100% reliability. A novel tracking method employing such binary sensors is proposed and its performance in different deployment scenarios evaluated. For a given target, the method utilizes the sensor outputs to estimate individual positions in the path of the target in the near past and finds the line which best fits the path points. This line is then used to estimate the target's current position. A performance study has been conducted through comprehensive simulation using parameters collected from a prototype deployment consisting of wireless micro-sensors with binary acoustic detectors.
WooYoung Kim, Kirill Mechitov, Jeung-Yoon Choi, Soo Kyung Ham
IPSN2
2003 Cooperative tracking with binary-detection sensor networks
abstract
We present a novel method for tracking the movement of people or vehicles in open outdoor environments using sensor networks. Unlike other sensor network-based methods, which depend on determining distance to the target or the angle of arrival of the signal, our cooperative tracking approach requires only that a sensor be able to determine if an object is somewhere within the maximum detection range of the sensor. We propose cooperative tracking as a method for tracking moving objects and extrapolating their paths in the short term. By combining data from neighboring sensors, this approach enables tracking with a resolution higher than that of the individual sensors being used. We employ statistical estimation and approximation techniques to further increase the tracking precision, and to enable the system to exploit the tradeoff between accuracy and timeliness of the results. We analyze the behavior of the cooperative tracking algorithm through simulation, focusing on the effects of approximation techniques on the quality of estimates achieved. This work focuses on acoustic tracking, however the presented methodology is applicable to any sensing modality where the sensing range is relatively uniform.
Kirill Mechitov, Sameer Sundresh, YoungMin Kwon, Gul A. Agha
SenSys1