P. Sinha

ORCID: 0000-0003-4485-2072
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Mobile Ad Hoc Networks
  • Wireless Networks and Protocols
  • Energy Efficient Wireless Sensor Networks
  • Opportunistic and Delay-Tolerant Networks
  • Advanced Control Systems Optimization
  • Magnetic Bearings and Levitation Dynamics
  • Control Systems and Identification
  • Cooperative Communication and Network Coding
  • Stability and Control of Uncertain Systems
  • Sensor Technology and Measurement Systems
  • Advanced Wireless Network Optimization
  • Vehicular Ad Hoc Networks (VANETs)
  • Adaptive Control of Nonlinear Systems
  • Network Traffic and Congestion Control
  • Optimization and Search Problems
  • Indoor and Outdoor Localization Technologies
  • Magnetic and Electromagnetic Effects
  • Railway Systems and Energy Efficiency
  • Real-time simulation and control systems
  • Electric Motor Design and Analysis
  • Railway Engineering and Dynamics
  • Fault Detection and Control Systems
  • Iterative Learning Control Systems
  • Vibration Control and Rheological Fluids
  • Sensorless Control of Electric Motors

Raisoni Group of Institutions
2021

National Institute of Technology Durgapur
2015-2020

Amrita Vishwa Vidyapeetham
2017

Diamond Harbour Women's University
2015

Institute of Technology Management
2015

University of Reading
1990-2012

The Ohio State University
2005-2012

Auburn University
2006

University of Illinois Urbana-Champaign
1999-2003

University of Warwick
1979-1984

We present CEDAR, a core-extraction distributed ad hoc routing algorithm for quality-of-service (QoS) in network environments, CEDAR has three key components: (a) the establishment and maintenance of self-organizing infrastructure called core performing route computations; (b) propagation link-state high bandwidth stable links through increase/decrease waves; (c) QoS-route computation that is executed at nodes using only locally available state. The performance evaluations show robust...

10.1109/49.779926 article EN IEEE Journal on Selected Areas in Communications 1999-01-01

CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing infrastructure called core performing route computations, (b) propagation link-state stable high-bandwidth links through increase/decrease waves, (c) computation that executed at nodes using only locally available state. But preliminary performance evaluation shows robust adaptive reacts effectively to dynamics while still approximating...

10.1109/infcom.1999.749269 article EN 1999-01-01

Project ExScal (for extreme scale) fielded a 1000+ node wireless sensor network and 200+ peer-to-peer ad hoc of 802.11 devices in 13km by 300m remote area Florida, USA during December 2004. In comparison with previous deployments, the application is relatively complex its networks are largest ones either type to date. this paper, we overview key requirements ExScal, corresponding design hardware/software platform application, some results our experiments.

10.1109/rtcsa.2005.47 article EN 2006-10-11

In this paper, we present the MCEDAR (multicast core extraction distributed ad hoc routing) multicast routing algorithm for networks. is an extension to CEDAR architecture and provides robustness of mesh based protocols approximates efficiency tree forwarding protocols. It decouples control infrastructure from actual data infrastructure. The decoupling allows a very minimalistic low overhead while still enabling efficient forwarding.

10.1109/wcnc.1999.796950 article EN 2003-01-20

Several routing algorithms for mobile ad hoc networks (MANETs) have been proposed previously. With the exception of a few, these protocols (i) involve all nodes in route management process, (ii) rely on use broadcast relays computation, and (iii) are primarily reactive nature. Related work has shown that capacity utilization decreases significantly when or "broadcast storms" performed frequently. This effect is compounded network take part computation. We propose study an approach based...

10.1109/infcom.2001.916674 article EN 2002-11-13

In third-generation (3G) wireless data networks, providing service to low data-rate users is required for maintaining fairness, but at the cost of reducing cell's aggregate throughput. this paper, we propose unified cellular and ad hoc network (UCAN) architecture enhancing cell throughput while fairness. UCAN, a mobile client has both 3G interface IEEE 802.11 -based peer-to-peer links. The base station forwards packets destination clients with poor channel quality proxy better quality. then...

10.1109/tmc.2007.1035 article EN IEEE Transactions on Mobile Computing 2007-08-07

We present Sprinkler, a reliable data dissemination service for wireless embedded devices which are constrained in energy, processing speed, and memory. Sprinkler embeds virtual grid over the network whereby it can locally compute connected dominating set of to avoid redundant transmissions, transmission schedule collisions. transmits O(1) times optimum number packets latency; its time complexity is O(1). Thus, suitable resource-constrained devices. evaluate performance terms packet...

10.1109/rtss.2005.37 article EN 2006-10-04

Tracking of movements such as that people, animals, vehicles, or phenomena fire, can be achieved by deploying a wireless sensor network. So far only prototype systems have been deployed and hence the issue scale has not become critical. Real-life deployments, however, will at large achieving this prohibitively expensive if we require every point in region to covered (i.e., full coverage), case deployments. In paper therefore propose new model coverage, called trap scales well with deployment...

10.1109/infcom.2009.5061915 article EN 2009-04-01

Vehicular Internet access via open WLAN points (APs) has been demonstrated to be a feasible solution provide opportunistic data service moving vehicles. Using an in situ deployment, however, such does not worst-case performance guarantees due unpredictable intermittent connectivity. On the other hand, that tries cover every point entire road network with APs (full coverage) is very practical prohibitive deployment and operational cost. In this paper, we introduce new notion of coverage for...

10.1109/infcom.2009.5062241 article EN 2009-04-01

Sleep-wake scheduling is an effective mechanism to prolong the lifetime of energy-constrained wireless sensor networks. However, it incurs additional delay for packet delivery when each node needs wait its next-hop relay wake up, which could be unacceptable delay-sensitive applications. Prior work in literature has proposed reduce this using anycast, where opportunistically selects first neighboring that wakes up among multiple candidate nodes. In paper, we study joint control problem how...

10.1109/infocom.2008.132 article EN 2008-04-01

In the context of IEEE 802.11b network testbeds, we examine differences between unicast and broadcast link properties, show inherent difficulties in precisely estimating properties via those beacons even if make length transmission rate be same as data packets. To circumvent estimation, propose to estimate directly traffic itself without using periodic beacons. this end, design a data-driven routing protocol Learn-on-the-Fly (LOF). LOF chooses routes based on ETX/ETT-type metrics, but...

10.1109/tmc.2008.155 article EN IEEE Transactions on Mobile Computing 2008-11-06

Femtocell-based architectures have the potential to position cellular service providers compete head-on with WiFi market. However, significant interference can happen due unplanned deployments. Current use of hard partitioning approaches for resource allocation, and lack guidelines configuring femtocells, makes it difficult obtain performance gains over traditional networks. In this paper, we study dynamic OFDMA subchannel assignment problem while jointly considering power association...

10.1109/tmc.2012.157 article EN IEEE Transactions on Mobile Computing 2012-07-19

In the context of IEEE 802.11b network testbeds, we examine differences between unicast and broadcast link properties, show inherent difficulties in precisely estimating properties via those beacons even if make length transmission rate be same as data packets. To circumvent estimation, propose to estimate directly traffic itself without using periodic beacons. this end, design a data-driven routing protocol Learn on Fly (LOF). LOF estimates quality based traffic, it chooses routes by way...

10.1109/infocom.2006.221 article EN 2006-01-01

A generalized theory of noninteracting (decoupling) control by state feedback is presented so that decoupling linear and nonlinear systems can be studied within the same framework.

10.1109/tac.1977.1101529 article EN IEEE Transactions on Automatic Control 1977-06-01

ABSTRACT Epilepsy affects 1% of the population, with up to one-third patients being medication-resistant. Surgery is only curative treatment, yet over surgical fail achieve seizure freedom due lack a reliable epileptogenic zone (EZ) biomarker. We introduced and validated mini-seizures, frequent hypersynchronization events at EZ hubs that mirror network dynamics, as novel interictal EEG Using dynamical networks-based model, we analyzed short intracranial from 159 across two institutions. Our...

10.1101/2025.01.31.25321482 preprint EN cc-by-nc-nd medRxiv (Cold Spring Harbor Laboratory) 2025-02-02

Ad-hoc networks consist of peer-to-peer communicating nodes that are highly mobile. As such, an ad-hoc network lacks infrastructure and the topology changes dynamically. The task routing data from a source to destination in such is challenging. Several protocols have been proposed for wireless networks. Most these protocols, however, pre-suppose presence bi-directional links between network. In reality may heterogeneous with different power capabilities hence, transmission ranges. When this...

10.1109/wcnc.2000.904825 article EN 2002-11-11

High speed operation of conventional rail vehicles is limited by a number dynamic problems including ride quality, curve negotiation, and hunting. Active control investigated as technique for improving vehicle performance at high speeds. An automatic controller specified configuration structure defined based on the physics wheel-rail interaction dynamics which allow decomposition constraints into selected frequency bands methodology selecting parameters presented. Two case studies are...

10.1115/1.3426378 article EN Journal of Dynamic Systems Measurement and Control 1978-12-01

Computing and maintaining network structures for efficient data aggregation incurs high overhead dynamic events where the set of nodes sensing an event changes with time. Moreover, structured approaches are sensitive to waiting time that is used by wait packets from their children before forwarding packet sink. Although structureless can address these issues, performance does not scale well size. We propose tree on DAG (ToD), a semistructured approach uses implicitly constructed structure...

10.1109/tmc.2008.55 article EN IEEE Transactions on Mobile Computing 2008-08-04

We focus on self-contention: contention between packets of the same transport layer connection along path from source to destination. observe that self-contention plays an important role in degrading TCP performance multi-hop wireless networks and use popular IEEE 802.11 MAC protocol exacerbates self-contention. propose study two MAC-layer approaches alleviate The first approach, called quick-exchange (QE), is designed with intent reducing effects inter-flow (e.g. traveling opposite...

10.1109/mahss.2004.1392160 article EN 2005-02-22

With the increased commercial deployment of wireless networks, issue service differentiation among flows in a wireless/wireline network is becoming important. While many wireline solutions for depend on end to-end rate control upon packet loss, this approach does not work well networks because losses do necessarily indicate congestion domain. In related work, we presented WTCP, reliable transport protocol that designed to operate efficiently and fairly over wide area networks. The algorithm...

10.1109/momuc.1999.819492 article EN 2003-01-22
Coming Soon ...