AKAshfaq Khokhar

Ashfaq Khokhar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ashfaq Khokhar has a total of 31 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Distributed In-Network Processing of k-MaxRS in Wireless Sensor Networks

    by Panitan Wonge-Ammat, Muhammed Mas-Ud Hussain, Goce Trajcevski, Besim Avci, Ashfaq Khokhar


  • Open Access

    Adaptive Hierarchical Data Aggregation using Compressive Sensing (A-HDACS) for Non-smooth Data Field

    by Xi Xu, Rashid Ansari, Ashfaq Khokhar

    Compressive Sensing (CS) has been applied successfully in a wide variety of applications in recent years, including photography, shortwave infrared cameras, optical system research, facial recognition, MRI, etc. In wireless sensor networks (WSNs), significant research work has been pursued to investigate the use of CS to reduce the amount of data communicated, particularly in data aggregation applications and thereby improving energy efficiency. However, most of the previous work in WSN has used CS under the assumption that data field is smooth with negligible white Gaussian noise. In these schemes signal sparsity is estimated globally based on the entire data field, which is then used to determine the CS parameters. In more realistic scenarios, where data field may have regional fluctuations or it is piecewise smooth, existing CS based data aggregation schemes yield poor compression efficiency. In order to take full advantage of CS in WSNs, we propose an Adaptive Hierarchical Data Aggregation using Compressive Sensing (A-HDACS) scheme. The proposed schemes dynamically chooses sparsity values based on signal variations in local regions. We prove that A-HDACS enables more sensor nodes to employ CS compared to the schemes that do not adapt to the changing field. The simulation results also demonstrate the improvement in energy efficiency as well as accurate signal recovery.

  • Open Access

    Energy Efficient Decentralized Detection Based on Bit-optimal Multi-hop Transmission in One-dimensional Wireless Sensor Networks

    by Yasaman Keshtkarjahromi, Rashid Ansari, Ashfaq Khokhar

    Existing information theoretic work in decentralized detection is largely focused on parallel configuration of Wireless Sensor Networks (WSNs), where an individual hard or soft decision is computed at each sensor node and then transmitted directly to the fusion node. Such an approach is not efficient for large networks, where communication structure is likely to comprise of multiple hops. On the other hand, decentralized detection problem investigated for multi-hop networks is mainly concerned with reducing number and/or size of messages by using compression and fusion of information at intermediate nodes. In this paper an energy efficient multi-hop configuration of WSNs is proposed to solve the detection problem in large networks with two objectives: maximizing network lifetime and minimizing probability of error in the fusion node. This optimization problem is considered under the constraint of total consumed energy. The two objectives mentioned are achieved simultaneously in the multi-hop configuration by exploring tradeoffs between different path lengths and number of bits allocated to each node for quantization. Simulation results show significant improvement in the proposed multi-hop configuration compared with the parallel configuration in terms of energy efficiency and detection accuracy for different size networks, especially in larger networks.

  • Open Access

    Power-efficient Hierarchical Data Aggregation using Compressive Sensing in WSN

    by Xi Xu, Rashid Ansari, Ashfaq Khokhar

    Compressive Sensing (CS) method is a burgeoning technique being applied to diverse areas including wireless sensor networks (WSNs). In WSNs, it has been studied in the context of data gathering and aggregation, particularly aimed at reducing data transmission cost and improving power efficiency. Existing CS based data gathering work in WSNs assume fixed and uniform compression threshold across the network, regard- less of the data field characteristics. In this paper, we present a novel data aggregation architecture model that combines a multi- resolution structure with compressed sensing. The compression thresholds vary over the aggregation hierarchy, reflecting the underlying data field. Compared with previous relevant work, the proposed model shows its significant energy saving from theoretical analysis. We have also implemented the proposed CS- based data aggregation framework on a SIDnet SWANS platform, discrete event simulator commonly used for WSN simulations. Our experiments show substantial energy savings, ranging from 37% to 77% for different nodes in the networking depending on the position of hierarchy.

  • Open Access

    Data Mining Nursing Care Plans of End-of-Life Patients: A Study to Improve Healthcare Decision Making

    by Fadi Almasalha, Dianhui Xu, Gail M. Keenan, Ashfaq Khokhar, Yingwei Yao, Yu-C. Chen, Andy Johnson, R. Ansari, Diana J. Wilkie

    PURPOSE:  To reveal hidden patterns and knowledge present in nursing care information documented with standardized nursing terminologies on end-of-life (EOL) hospitalized patients. METHOD:  596 episodes of care that included pain as a problem on a patient's care plan were examined using statistical and data mining tools. The data were extracted from the Hands-On Automated Nursing Data System database of nursing care plan episodes ( n = 40,747) coded with NANDA-I, Nursing Outcomes Classification, and Nursing Intervention Classification (NNN) terminologies. System episode data (episode = care plans updated at every hand-off on a patient while staying on a hospital unit) had been previously gathered in eight units located in four different healthcare facilities (total episodes = 40,747; EOL episodes = 1,425) over 2 years and anonymized prior to this analyses. RESULTS:  Results show multiple discoveries, including EOL patients with hospital stays (p < .005) to meet the pain relief goals compared with EOL patients with longer hospital stays. CONCLUSIONS:  The study demonstrates some major benefits of systematically integrating NNN into electronic health records.


  • Current State of Pain Care for Hospitalized Patients at End of Life

    by Yingwei Yao, Gail Keenan, Fadi Al-Masalha, Karen Dunn Lopez, Ashfaq Khokar, Andrew Johnson, Rashid Ansari, Diana J. Wilkie

    We report findings on the current state of pain care in hospitals for end-of-life (EOL) patients using longitudinal data from 8 diverse medical–surgical units located in 4 different Midwestern hospitals over 24 months. We identified 1425 EOL care episodes, 596 (41.3%) of which had a pain diagnosis. The percentage of EOL patients with pain varied significantly across units (P < .001) and was even lower (27.7%) for those with “acute confusion.” Additionally, 30% of EOL patients had severe or significant pain at death or discharge to hospice and only 42.7% actually met the expected pain-related outcome ratings. Pain often improved within 48 hours of admission (P < .005), the improvement, however, stagnated following this initial time period (P = .92). A sizable gap between pain science and clinical practice continues.


  • Open Access

    A Domain Decomposition Strategy for Alignment of Multiple Biological Sequences on Multiprocessor Platforms

    by Fahad Saeed, Ashfaq Khokhar

    Multiple Sequences Alignment (MSA) of biological sequences is a fundamental problem in computational biology due to its critical significance in wide ranging applications including haplotype reconstruction, sequence homology, phylogenetic analysis, and prediction of evolutionary origins. The MSA problem is considered NP-hard and known heuristics for the problem do not scale well with increasing number of sequences. On the other hand, with the advent of new breed of fast sequencing techniques it is now possible to generate thousands of sequences very quickly. For rapid sequence analysis, it is therefore desirable to develop fast MSA algorithms that scale well with the increase in the dataset size. In this paper, we present a novel domain decomposition based technique to solve the MSA problem on multiprocessing platforms. The domain decomposition based technique, in addition to yielding better quality, gives enormous advantage in terms of execution time and memory requirements. The proposed strategy allows to decrease the time complexity of any known heuristic of O(N)^x complexity by a factor of O(1/p)^x, where N is the number of sequences, x depends on the underlying heuristic approach, and p is the number of processing nodes. In particular, we propose a highly scalable algorithm, Sample-Align-D, for aligning biological sequences using Muscle system as the underlying heuristic. The proposed algorithm has been implemented on a cluster of workstations using MPI library. Experimental results for different problem sizes are analyzed in terms of quality of alignment, execution time and speed-up.

  • Open Access

    Sample-Align-D: A High Performance Multiple Sequence Alignment System using Phylogenetic Sampling and Domain Decomposition

    by Fahad Saeed, Ashfaq Khokhar

    Multiple Sequence Alignment (MSA) is one of the most computationally intensive tasks in Computational Biology. Existing best known solutions for multiple sequence alignment take several hours (in some cases days) of computation time to align, for example, 2000 homologous sequences of average length 300. Inspired by the Sample Sort approach in parallel processing, in this paper we propose a highly scalable multiprocessor solution for the MSA problem in phylogenetically diverse sequences. Our method employs an intelligent scheme to partition the set of sequences into smaller subsets using kmer count based similarity index, referred to as k-mer rank. Each subset is then independently aligned in parallel using any sequential approach. Further fine tuning of the local alignments is achieved using constraints derived from a global ancestor of the entire set. The proposed Sample-Align-D Algorithm has been implemented on a cluster of workstations using MPI message passing library. The accuracy of the proposed solution has been tested on standard benchmarks such as PREFAB. The accuracy of the alignment produced by our methods is comparable to that of well known sequential MSA techniques. We were able to align 2000 randomly selected sequences from the Methanosarcina acetivorans genome in less than 10 minutes using Sample-Align-D on a 16 node cluster, compared to over 23 hours on sequential MUSCLE system running on a single cluster node.

  • Optimizing distortion for real‐time data gathering in randomly deployed sensor networks

    by Xiaobo Zhang, Heping Wang, Farid Nait‐Abdesselam, Ashfaq Khokhar

    In several wireless sensor network applications, it is required to perform real‐time reconstruction of the data field being sensed by the network. This task is generally carried out at a central location, e.g. sink node, using a continuous data gathering phase and relying on the known correlation properties of the underlying data field. Estimating the overall spatial and temporal distortion in the reconstructed field is an important step toward deciding the number of sensors to be deployed and the data collection algorithm to be used. However, estimating distortion in arbitrary networks is a challenging task. Existing work has focused on regular network deployments such as one‐ and two‐dimensional girds. Such deployments are deemed infeasible in a realistic environment. In this paper, we consider one‐ and two‐dimensional random networks. For the analysis purposes, we assume that the nodes are randomly deployed following Poisson distribution. We determine the total distortion function given the correlation coefficients of the field while assuming a simple data gathering protocol. Based on this, we also determine the optimal number of nodes to be deployed in the field that will minimize distortion. Copyright © 2009 John Wiley & Sons, Ltd.