#### Filter Results:

- Full text PDF available (95)

#### Publication Year

1976

2017

- This year (4)
- Last 5 years (46)
- Last 10 years (76)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

We study the problem of assigning transmission ranges to the nodes of ad hoc wireless networks so that to minimize power consumption while ensuring network connectivity. We give (1) an exact branch and cut algorithm based on a new integer linear program formulation solving instances with up to 35-40 nodes in 1 hour; (2) a minimum spanning tree (MST) based… (More)

- Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alex Zelikovsky
- Wireless Networks
- 2006

In this paper we study the problem of assigning transmission ranges to the nodes of a static ad hoc wireless network so as to minimize the total power consumed under the constraint that enough power is provided to the nodes to ensure that the network is connected. We focus on the MIN-POWER SYMMETRIC CONNECTIVITY problem, in which the bidirectional links… (More)

- Narsingh Deo, Sushil K. Prasad
- The Journal of Supercomputing
- 1992

We describe a new parallel data structure, namely parallel heap, for exclusive-read exclusive-write parallel random access machines. To our knowledge, it is the first such data structure to efficiently implement a truly parallel priority queue based on a heap structure. Employing p processors, the parallel heap allows deletions of θ(p) highest priority… (More)

- Sushil K. Prasad, Almadena Yu. Chtchelkanova, +18 authors Jie Wu
- SIGCSE
- 2011

Parallelism pervades all aspects of modern computing, from in-home devices such as cell phones to large-scale supercomputers. Recognizing this - and motivated by the premise that every undergraduate student in a computer-related field should be prepared to cope with parallel computing - a working group sponsored by NSF and IEEE/TCPP, and interacting with… (More)

- Sushil K. Prasad, Akshaye Dhawan
- HiPC
- 2007

We present a new set of distributed algorithms for scheduling sensors to enhance the total lifetime of a wireless sensor network. These algorithms are based on constructing minimal cover sets each consisting of one or more sensors which can collectively cover the local targets. Some of the covers are heuristically better than others for a sensor trying to… (More)

- Yingshu Li, Longjiang Guo, Sushil K. Prasad
- 2010 IEEE 30th International Conference on…
- 2010

Data aggregation is an essential yet time-consuming task in wireless sensor networks (WSNs). This paper studies the well-known Minimum-Latency Aggregation Schedule (MLAS) problem and proposes an energy-efficient distributed scheduling algorithm named Clu-DDAS based on a novel cluster-based aggregation tree. Our approach differs from all the previous schemes… (More)

- Sushil K. Prasad, Sajal K. Das, Calvin Ching-Yuen Chen
- IEEE Trans. Parallel Distrib. Syst.
- 1994

We present four polylog-time parallel algorithms for matching parentheses on an exclusive-read and exclusive-write (EREW) parallel random-access machine (PRAM) model. These algorithms provide new insights into the parentheses-matching problem. The first algorithm has a time complexity of O( log’ n ) employing O( & ) processors for an input string containing… (More)

- Akshaye Dhawan, Sushil K. Prasad
- 2008 IEEE International Symposium on Parallel and…
- 2008

One of the key challenges in Wireless Sensor Networks (WSNs) is that of extending the lifetime of the network while meeting some coverage requirements. In this paper we present a distributed algorithmic framework to enable sensors to determine their sleep-sense cycles based on specific coverage goals. The framework is based on our earlier work on the target… (More)

- Anthony Sulistio, Uros Cibej, Sushil K. Prasad, Rajkumar Buyya
- IJPEDS
- 2009

In Grids, users may require assurance for completing their jobs on shared resources. Such guarantees can only be provided by reserving resources in advance. However, if many reservation requests arrive at a resource simultaneously, the overhead of providing such service due to adding, deleting, and searching, will be significant. An efficient data structure… (More)

- Dinesh Agarwal, Sushil K. Prasad
- 2013 IEEE International Symposium on Parallel…
- 2013

Windows Azure is an emerging cloud platform that provides application developers with APIs to write scientific and commercial applications. However, the steep learning curve to understand the unique architecture of the cloud platforms in general and continuously changing Azure APIs specifically, make it difficult for the application developers to write… (More)