Search For:

Displaying 1-50 out of 180 total
Centralized and Clustered k-Coverage Protocols for Wireless Sensor Networks
Found in: IEEE Transactions on Computers
By Habib M. Ammari,Sajal K. Das
Issue Date:January 2012
pp. 118-133
Sensing coverage is an essential functionality of wireless sensor networks (WSNs). However, it is also well known that coverage alone in WSNs is not sufficient, and hence network connectivity should also be considered for the correct operation of WSNs. In ...
 
A Study of k-Coverage and Measures of Connectivity in 3D Wireless Sensor Networks
Found in: IEEE Transactions on Computers
By Habib M. Ammari, Sajal K. Das
Issue Date:February 2010
pp. 243-257
In a wireless sensor network (WSN), connectivity enables the sensors to communicate with each other, while sensing coverage reflects the quality of surveillance. Although the majority of studies on coverage and connectivity in WSNs consider 2D space, 3D se...
 
EBRP: Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Fengyuan Ren,Jiao Zhang,Tao He,Chuang Lin,Sajal K. Das
Issue Date:December 2011
pp. 2108-2125
Energy is an extremely critical resource for battery-powered wireless sensor networks (WSN), thus making energy-efficient protocol design a key challenging problem. Most of the existing energy-efficient routing protocols always forward packets along the mi...
 
Message from the workshop chairs
Found in: A World of Wireless, Mobile and Multimedia Networks, International Symposium on
By Sajal K. Das,Guevara Noubir,Refik Molva,Gene Tsudik, Nan Zhang
Issue Date:June 2011
pp. 1-4
As the organizing committee, it is our pleasure to present the proceedings of the 2nd IEEE International Workshop on Data Security and PrivAcy in wireless Networks (D-SPAN), held on June 20, 2011, in Lucca, Italy. The goal of this one-day workshop, organiz...
   
Location Aware Resource Management in Smart Homes
Found in: Pervasive Computing and Communications, IEEE International Conference on
By Abhishek Roy, Soumya K. Das Bhaumik, Amiya Bhattacharya, Kalyan Basu, Diane J. Cook, Sajal K. Das
Issue Date:March 2003
pp. 481
The rapid advances in a wide range of wireless access technologies along with the efficient use of smart spaces have already set the stage for development of smart homes. Context-awareness is perhaps the most salient feature in these intelligent computing ...
 
A Trust-Based Framework for Fault-Tolerant Data Aggregation in Wireless Multimedia Sensor Networks
Found in: IEEE Transactions on Dependable and Secure Computing
By Yan Sun,Hong Luo,Sajal K. Das
Issue Date:November 2012
pp. 785-797
For wireless multimedia sensor networks (WMSNs) deployed in noisy and unattended environments, it is necessary to establish a comprehensive framework that protects the accuracy of the gathered multimedia information. In this paper, we jointly consider data...
 
ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation in Wireless Sensor Networks Using Sequential Hypothesis Testing
Found in: IEEE Transactions on Dependable and Secure Computing
By Jun-Won Ho,Matthew Wright,Sajal K. Das
Issue Date:July 2012
pp. 494-510
Due to the unattended nature of wireless sensor networks, an adversary can physically capture and compromise sensor nodes and then mount a variety of attacks with the compromised nodes. To minimize the damage incurred by the compromised nodes, the system s...
 
An Energy-Efficient Markov Chain-Based Randomized Duty Cycling Scheme for Wireless Sensor Networks
Found in: Distributed Computing Systems, International Conference on
By Giacomo Ghidini, Sajal K. Das
Issue Date:June 2011
pp. 67-76
To extend the life time of a wireless sensor network, sensor nodes usually switch between dormant and active states according to a duty cycling scheme. In randomized schemes, sensors use only partial or no information about their neighbors, and rely on ran...
 
Preserving Relation Privacy in Online Social Network Data
Found in: IEEE Internet Computing
By Na Li, Nan Zhang, Sajal K. Das
Issue Date:May 2011
pp. 35-42
<p>Online social networks routinely publish data of interest to third parties, but in so doing often reveal relationships, such as a friendship or contractual association, that an attacker can exploit. This systematic look at existing privacy-preserv...
 
Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem
Found in: IEEE Transactions on Computers
By Habib M. Ammari, Sajal K. Das
Issue Date:October 2008
pp. 1423-1434
Abstract: While sensing coverage reflects the surveillance quality provided by a wireless sensor network (WSN), network connectivity enables data gathered by sensors to reach a central node, called the sink. Given an initially uncovered field and as more a...
 
Adaptive Resource Management for Multimedia Applications in Wireless Networks
Found in: A World of Wireless, Mobile and Multimedia Networks, International Symposium on
By Nilanjan Banerjee, Kalyan Basu, Sajal K. Das
Issue Date:June 2005
pp. 250-257
Flow and admission control algorithms have been proposed for efficient resource utilization in wireless networks with scarce and randomly varying resource availability. Transport and lower layer control protocols administer generic control behavior, ignori...
 
A Fair QoS Multicast Routing Scheme for IP/DWDM Optical Internet
Found in: Distributed Computing Systems Workshops, International Conference on
By Xingwei Wang, Cong Liu, Jianye Cui, Min Huang, Sajal K. Das
Issue Date:June 2005
pp. 624-629
Quality of Service (QoS) and multicast are essential capabilities in IP/DWDM optical Internet. In this paper, a fair QoS multicast routing scheme for IP/DWDM optical Internet is proposed, in which the QoS requirement is denoted by the range to support the ...
 
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
Found in: Parallel and Distributed Processing Symposium, International
By Soumya Sanyal, Sajal K. Das
Issue Date:April 2005
pp. 64b
We develop in this paper a new heuristic for mapping a set of heterogeneous interacting tasks of a parallel application onto a heterogeneous computing platform. The problem is well known in literature to be an NP-Hard problem. However, we propose a complet...
 
Update Propagation through Replica Chain in Decentralized and Unstructured P2P Systems
Found in: Peer-to-Peer Computing, IEEE International Conference on
By Zhijun Wang, Sajal K. Das, Mohan Kumar, Huaping Shen
Issue Date:August 2004
pp. 64-71
In this paper, we propose a novel algorithm, called update propagation through replica chain (UPTReC), to maintain file consistency in decentralized and unstructured peer-to-peer (P2P) systems. In UPTReC, each file has a logical replica chain composed of a...
 
Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multidimensional Files
Found in: IEEE Transactions on Parallel and Distributed Systems
By Sajal K. Das, Cristina M. Pinotti
Issue Date:December 2002
pp. 1211-1219
<p><b>Abstract</b>—A <it>multidimensional file</it> is one whose data are characterized by several attributes, each specified in a given domain. A <it>partial match query</it> on a multidimensional file extracts al...
 
Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems
Found in: Parallel and Distributed Processing Symposium, International
By Vincenzo Auletta, Sajal K. Das, Amelia De Vivo
Issue Date:April 2001
pp. 10035b
In this paper we study strategies for mapping complete tree data structures, that are accessed by fixed templates, onto parallel memory systems. These mappings are evaluated with respect to the following three differ entcriteria: (i) the number of memory c...
 
A Strictly-Optimal Strategy to Access Multi-Dimensional Data on Parallel Disk Systems
Found in: Parallel Processing, International Conference on
By Sajal K. Das, M. Cristina Pinotti
Issue Date:September 1999
pp. 120
The disk allocation problem addresses the issue of how to distribute large files among several disks so as to maximize the concurrent disk accesses in response to partial match queries. In the past this problem has been studied for binary as well as for p-...
 
Self-Stabilizing Algorithms in DAG Structured Networks
Found in: Parallel Architectures, Algorithms, and Networks, International Symposium on
By Sajal K. Das, Ajoy K. Datta, Sebastien Tixeuil
Issue Date:June 1999
pp. 190
This paper describes a parameterized protocol applicable to directed acyclic graph (DAG) topologies. The function parameter of the protocol is instantiated twice to design two protocols: (i) The topological sorting of the successor list at every node, and ...
 
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes
Found in: IEEE Transactions on Parallel and Distributed Systems
By Sajal K. Das, M. Cristina Pinotti, Falguni Sarkar
Issue Date:June 1996
pp. 555-564
<p><b>Abstract</b>—In this paper, we efficiently map a priority queue on the hypercube architecture in a load balanced manner, with no additional communication overhead, and present optimal parallel algorithms for performing insert and de...
 
Folded Petersen Cube Networks: New Competitors for the Hypercubes
Found in: IEEE Transactions on Parallel and Distributed Systems
By Sabine Öhring, Sajal K. Das
Issue Date:February 1996
pp. 151-168
<p><b>Abstract</b>—We introduce and analyze a new interconnection topology, called the <it>k</it>-dimensional <it>folded Petersen</it> (<it>FP</it><sub><it>k</it></sub>) network,...
 
A Unified Approach to Construct Search Trees in Parallel
Found in: Parallel Processing, International Conference on
By Sajal K. Das, Kwang Bae Min
Issue Date:August 1994
pp. 222-226
We present a unified parallel algorithm for constructing various search trees. The tree construction is based on a unified scheme, called bottom-level balancing, which constructs a height balanced search tree having a uniform distribution of keys. The algo...
 
An Information Entropy Approach for Sleep Scheduling in Densely-Deployed Sensor Networks
Found in: 2013 Ninth International Conference on Mobile Ad-hoc and Sensor Networks (MSN)
By Ruiyun Yu,Xingwei Wang,Sajal K. Das
Issue Date:December 2013
pp. 181-186
Wireless sensor networks are usually densely deployed, and it is quite common for sensors to gather and transmit redundant information, which results in unnecessary energy consumption. Sleep scheduling is quite helpful for reducing overall energy consumpti...
 
Modeling Node Compromise Spread in Wireless Sensor Networks Using Epidemic Theory
Found in: A World of Wireless, Mobile and Multimedia Networks, International Symposium on
By Pradip De, Yonghe Liu, Sajal K. Das
Issue Date:June 2006
pp. 237-243
Motivated by recent surfacing viruses that can spread over the air interfaces, in this paper, we investigate the potential disastrous threat of node compromise spreading in wireless sensor networks. Originating from a single infected node, we assume such a...
 
Privacy Preserving Query Answering in Peer Data Management Systems
Found in: 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops (ICDCSW)
By Azade Nazi, Donggang Liu,Sajal K. Das
Issue Date:July 2013
pp. 64-69
Peer Data Management Systems (PDMS) provide data sharing between heterogeneous databases using peer-to- peer schema mapping, where intermediate peers are used to translate the queries as well as the query results. However, such translation leaks not only t...
 
Performance Optimization of VoIP Calls over Wireless Links Using H.323 Protocol
Found in: IEEE Transactions on Computers
By Sajal K. Das, Enoch Lee, Kalyan Basu, Sanjoy K. Sen
Issue Date:June 2003
pp. 742-752
<p><b>Abstract</b>—Intelligent mobile terminals (or users) of next generation wireless networks are expected to initiate voice over IP (VoIP) calls using session set-up protocols like H.323 or SIP (session initiation protocol). To guarant...
 
Mobility in IPv6: Whether and How to Hierarchize the Network?
Found in: IEEE Transactions on Parallel and Distributed Systems
By Shengling Wang,Yong Cui,Sajal K. Das,Wei Li,Jianping Wu
Issue Date:October 2011
pp. 1722-1729
Mobile IPv6 (MIPv6) offers a basic solution to support mobility in IPv6 networks. Although Hierarchical MIPv6 (HMIPv6) has been designed to enhance the performance of MIPv6 by hierarchizing the network, it does not always outperform MIPv6. In fact, two sol...
 
ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation in Sensor Networks Using Sequential Analysis
Found in: Reliable Distributed Systems, IEEE Symposium on
By Jun-Won Ho, Matthew Wright, Sajal K. Das
Issue Date:September 2009
pp. 217-223
Due to the unattended nature of wireless sensor networks, an adversary can physically capture and compromise sensor nodes and then mount a variety of attacks with these compromised nodes. To minimize the damage incurred by compromised nodes, the system sho...
 
Routing Correlated Data with Fusion Cost in Wireless Sensor Networks
Found in: IEEE Transactions on Mobile Computing
By Hong Luo, Yonghe Liu, Sajal K. Das
Issue Date:November 2006
pp. 1620-1632
In this paper, we propose a routing algorithm called Minimum Fusion Steiner Tree (MFST) for energy efficient data gathering with aggregation (fusion) in wireless sensor networks. Different from existing schemes, MFST not only optimizes over the data transm...
 
Intrusion Detection in Sensor Networks: A Non-Cooperative Game Approach
Found in: Network Computing and Applications, IEEE International Symposium on
By Afrand Agah, Sajal K. Das, Kalyan Basu, Mehran Asadi
Issue Date:September 2004
pp. 343-346
Insufficiency of memory and battery power of sensors makes the security of sensor networks a hard task to do. This insufficiency also makes applying the existing methods of securing other type of networks on the sensor networks unsuitable. We propose a gam...
 
O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube Multicomputers
Found in: Parallel Processing Symposium, International
By Sajal K. Das, M. Cristina Pinotti
Issue Date:April 1997
pp. 507
We present an efficient mapping of a min-max-pair heap of size N on a hypercube multicomputer of p processors in such a way the load on each processor's local memory is balanced and no additional communication overhead is incurred for implementation of the...
 
The Folded Petersen Network : A New Communication-Efficient Multiprocessor Topology
Found in: Parallel Processing, International Conference on
By Sabine Ohring, Sajal K. Das
Issue Date:August 1993
pp. 311-314
We introduce and analyze a new interconnection topology, called the n-dimensional folded Petersen network (FP_n), which is constructed by iteratively applying the cartesian product operation on the well-known Petersen graph itself. The FPn topology provide...
 
Performance of wireless sensor topologies inspired by E. coli genetic networks
Found in: Pervasive Computing and Communications Workshops, IEEE International Conference on
By Bhanu K. Kamapantula,Ahmed Abdelzaher,Preetam Ghosh,Michael Mayo,Ed Perkins,Sajal K Das
Issue Date:March 2012
pp. 302-307
Wireless Sensor Networks (WSNs) form a critical component in modern computing applications; given their size, ability to process and communicate information, and to sense stimuli, they are a promising part of The Internet of Things. However, they are also ...
 
In-Silico Effects of Mg2+ Diffusion Rates on Stochastic Event Based Simulation of the PhoPQ System
Found in: Bioinformatics, Systems Biology and Intelligent Computing, International Joint Conference on
By Preetam Ghosh,Kalyan Basu,Sajal K. Das,Chaoyang Zhang
Issue Date:August 2009
pp. 405-411
The challenge today is to develop a modeling and simulation paradigm that integrates structural, molecular and genetic data for a quantitative understanding of physiology and behavior of biological processes at multiple scales. This paradigm requires techn...
 
Two Phase Scheduling Algorithm for Maximizing the Number of Satisfied Users in Multi-Rate Wireless Systems
Found in: A World of Wireless, Mobile and Multimedia Networks, International Symposium on
By Sourav Pal, Preetam Ghosh, Amin R. Mazloom, Sumantra R. Kundu, Sajal K. Das
Issue Date:June 2007
pp. 1-9
Opportunistic scheduling algorithms are effective in exploiting channel variations and maximizing system throughput in multi-rate wireless networks. However, most scheduling algorithms ignore the per-user quality of service (QoS) requirements and try to al...
 
Analysis of Randomized Congestion Control in DSDV Routing
Found in: Modeling, Analysis, and Simulation of Computer Systems, International Symposium on
By Azzedine Boukerche, Alessandro Fabbri, Sajal K. Das
Issue Date:September 2000
pp. 65
In this paper, we consider a randomized version of the Destination-Sequenced Distance Vector (DSDV) routing protocol for ad hoc networks, called R-DSDV. We are concerned with the capabilities of R-DSDV with respect to distributed congestion control. We pre...
 
Traffic-Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Fengyuan Ren, Tao He, Sajal K. Das, Chuang Lin
Issue Date:September 2011
pp. 1585-1599
The congestion problem in Wireless Sensor Networks (WSNs) is quite different from that in traditional networks. Most current congestion control algorithms try to alleviate the congestion by reducing the rate at which the source nodes inject packets into th...
 
Fast Detection of Mobile Replica Node Attacks in Wireless Sensor Networks Using Sequential Hypothesis Testing
Found in: IEEE Transactions on Mobile Computing
By Jun-Won Ho, Matthew Wright, Sajal K. Das
Issue Date:June 2011
pp. 767-782
Due to the unattended nature of wireless sensor networks, an adversary can capture and compromise sensor nodes, make replicas of them, and then mount a variety of attacks with these replicas. These replica node attacks are dangerous because they allow the ...
 
Avoiding Energy Holes in Wireless Sensor Networks with Nonuniform Node Distribution
Found in: IEEE Transactions on Parallel and Distributed Systems
By Xiaobing Wu, Guihai Chen, Sajal K. Das
Issue Date:May 2008
pp. 710-720
In this paper, we investigate the theoretical aspects of the nonuniform node distribution strategy used to mitigate the energy hole problem in wireless sensor networks (WSNs). We conclude that in a circular multihop sensor network (modeled as concentric co...
 
A Game Theory-Based Pricing Strategy to Support Single/Multiclass Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems
Found in: IEEE Transactions on Parallel and Distributed Systems
By Preetam Ghosh, Kalyan Basu, Sajal K. Das
Issue Date:March 2007
pp. 289-306
<p><b>Abstract</b>—Today's distributed computing systems incorporate different types of nodes with varied bandwidth constraints which should be considered while designing cost-optimal job allocation schemes for better system performance. ...
 
FastFlow: A Framework for Accurate Characterization of Network Traffic
Found in: Distributed Computing Systems, International Conference on
By Sumantra R. Kundu, Bodhisatwa Chakravarty, Kalyan Basu, Sajal K. Das
Issue Date:July 2006
pp. 6
This paper proposes a new measurement architecture and associated traffic estimation algorithm called FastFlow that uses the heavy-tailed nature of Internet traffic in order to distinguish packets belonging to short lived flows (SLFs) and long lived flows ...
 
Designing and Modeling Smart Environments (Invited Paper)
Found in: A World of Wireless, Mobile and Multimedia Networks, International Symposium on
By Sajal K. Das, Diane J. Cook
Issue Date:June 2006
pp. 490-494
This paper summarizes our experience in designing and modeling single habitant and multiple inhabitant smart environments based on learning and prediction based paradigm.
 
FraNtiC: A Fractal Geometric Framework for Mesh-Based Wireless Access Networks
Found in: Distributed Computing Systems, International Conference on
By Samik Ghosh, Kalyan Basu, Sajal K. Das
Issue Date:June 2005
pp. 481-490
The design of the access networks of next generation broadband wireless systems requires special attention in the light of changing network characteristics. In this paper, we present a mesh-based distributed radio access network (RAN) framework for future ...
 
A Scalable Asynchronous Cache Consistency Scheme (SACCS) for Mobile Environments
Found in: IEEE Transactions on Parallel and Distributed Systems
By Zhijun Wang, Sajal K. Das, Hao Che, Mohan Kumar
Issue Date:November 2004
pp. 983-995
<p><b>Abstract</b>—In the literature, there exit two types of cache consistency maintenance algorithms for mobile computing environments: stateless and stateful. In a <it>stateless</it> approach, the server is unaware of the c...
 
Resource-Optimized Quality-Assured Ambiguous Context Mediation Framework in Pervasive Environments
Found in: IEEE Transactions on Mobile Computing
By Nirmalya Roy,Sajal K. Das,Christine Julien
Issue Date:February 2012
pp. 218-229
Pervasive computing applications often involve sensor-rich networking environments that capture various types of user contexts such as locations, activities, vital signs, and so on. Such context information is useful in a variety of applications, for examp...
 
Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks
Found in: IEEE Transactions on Mobile Computing
By Shuai Gao, Hongke Zhang, Sajal K. Das
Issue Date:April 2011
pp. 592-608
Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. However, due to the path constraint, a mobile sink with constant speed has limited communication time to collect data from the ...
 
Enhancing Availability of Grid Computational Services to Ubiquitous Computing Applications
Found in: IEEE Transactions on Parallel and Distributed Systems
By Nirmalya Roy, Sajal K. Das
Issue Date:July 2009
pp. 953-967
The Grid is an integrated infrastructure that can play the dual roles of a coordinated resource consumer as well as a donator in distributed computing environments. The enormous growth in the use of mobile and embedded devices in ubiquitous computing envir...
 
Distributed Algorithm for En Route Aggregation Decision in Wireless Sensor Networks
Found in: IEEE Transactions on Mobile Computing
By Hong Luo, Yonghe Liu, Sajal K. Das
Issue Date:January 2009
pp. 1-13
In sensor networks, enroute aggregation decision regarding where and when aggregation shall be performed along the routes has been explicitly or implicitly studied extensively. However, existing solutions have omitted one key dimension in the optimization ...
 
An Architectural Framework for Accurate Characterization of Network Traffic
Found in: IEEE Transactions on Parallel and Distributed Systems
By Sumantra R. Kundu, Sourav Pal, Kalyan Basu, Sajal K. Das
Issue Date:January 2009
pp. 111-123
In networks carrying large volume of traffic, accurate traffic characterization is necessary for understanding the dynamics and patterns of network resource usage. Previous approaches to flow characterization are based on random sampling of the packets (e....
 
Channel State Estimation and Scheduling Algorithms for Multi-Rate Wireless Systems
Found in: Local Computer Networks, Annual IEEE Conference on
By Sourav Pal, Sumantra Kundu, Amin R. Mazloom, Sajal K. Das
Issue Date:October 2007
pp. 471-478
Emerging multi-rate wireless systems both cellular (cdma2000, High Data Rate (HDR)) and Wi-Fi like systems demand that the currently used channel estimation and scheduling techniques be revisited. Not only the channel estimation, prediction algorithms, and...
 
Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization
Found in: IEEE Transactions on Mobile Computing
By Abhishek Roy, Archan Misra, Sajal K. Das
Issue Date:December 2007
pp. 1426-1440
In this paper we propose two information-theoretic techniques for efficiently trading off the location update and paging costs associated with mobility management in wireless cellular networks. Previous approaches attempt to always accurately convey a mobi...
 
 1  2 Next >>