#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1992

2017

- This year (4)
- Last 5 years (37)
- Last 10 years (65)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Rajiv Misra, Chittaranjan A. Mandal
- IEEE Transactions on Mobile Computing
- 2009

Wireless ad hoc and sensor networks (WSNs) often require a connected dominating set (CDS) as the underlying virtual backbone for efficient routing. Nodes in a CDS have extra computation and communication load for their role as dominator, subjecting them to an early exhaustion of their battery. A simple mechanism to address this problem is to switch from one… (More)

- Anant V. Nimkar, Chittaranjan A. Mandal, Chris Reade
- 2009 IEEE International Conference on Internet…
- 2009

Telecommunication companies believe that the video-on-demand market will expand heavily in the near future. The service providers are interested in the deployment of video-on-demand (VoD) systems with large numbers of videos. As the number of videos and customers increases at a VoD system, two problems are faced. The first problem is the manual video… (More)

- Vinay Vishwakarma, Chittaranjan A. Mandal, Shamik Sural
- PReMI
- 2007

In this paper, we present an approach for human fall detection, which has an important application in the field of safety and security. The proposed approach consists of two part: object detection and fall model. We use an adaptive background subtraction method to detect moving object and mark it with minimum-bounding box. Fall model uses a set of extracted… (More)

- Rajiv Misra, Chittaranjan A. Mandal
- IEEE Transactions on Parallel and Distributed…
- 2010

A minimum connected dominating set (MCDS) is used as virtual backbone for efficient routing and broadcasting in ad hoc sensor networks. The minimum CDS problem is NP-complete even in unit disk graphs. Many heuristics-based distributed approximation algorithms for MCDS problems are reported and the best known performance ratio has (4.8 + 1n 5). We propose a… (More)

- Ariyam Das, Chittaranjan A. Mandal, Chris Reade, Manish Aasawat
- 2011 IEEE Wireless Communications and Networking…
- 2011

A minimum connected dominating set (MCDS) offers an optimized way of sending messages in wireless networks. However, constructing a MCDS is a NP-complete problem. Many heuristics based approximation algorithms for MCDS problems have been previously reported. In this paper, we propose a new degree-based multiple leaders initiated greedy approximation… (More)

- Chittaranjan A. Mandal, P. P. Chakrabarti, Sujoy Ghose
- IEEE Trans. VLSI Syst.
- 2000

We present here a technique for allocation and binding for data path synthesis (DPS) using a Genetic Algorithm (GA) approach. This GA uses an unconventional crossover mechanism relying on a force directed data path binding completion algorithm. The data path is synthesized using some supplied design parameters. A bus-based interconnection scheme, use of… (More)

- Chandan Karfa, Dipankar Sarkar, Chittaranjan A. Mandal, P. Kumar
- IEEE Transactions on Computer-Aided Design of…
- 2008

A formal method for checking equivalence between a given behavioral specification prior to scheduling and the one produced by the scheduler is described. Finite state machine with data path (FSMD) models have been used to represent both the behaviors. The method consists of introducing cutpoints in one FSMD, visualizing its computations as concatenation of… (More)

This paper describes a formal method for checking the equivalence between the finite state machine with data path (FSMD) model of the high-level behavioural specification and the FSMD model of the behaviour transformed by the scheduler. The method consists in introducing cutpoints in one FSMD, visualizing its computations as concatenation of paths from… (More)

- Chandan Karfa, Chittaranjan A. Mandal, Dipankar Sarkar
- ACM Trans. Design Autom. Electr. Syst.
- 2012

A formal verification method for checking correctness of code motion techniques is presented in this article. Finite State Machine with Datapath (FSMD) models have been used to represent the input and the output behaviors of each synthesis step. The method introduces cutpoints in one FSMD, visualizes its computations as concatenation of paths from cutpoints… (More)