Trilok Chand Aseri

PEC University of Technology, Chandigarh, Chandigarh, India

Are you Trilok Chand Aseri?

Claim your profile

Publications (31)14.93 Total impact

  • Neelam Goel · Shailendra Singh · Trilok Chand Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: A vast amount of sequence data has been generated due to advancements in DNA sequencing technology. This exponential increase requires new and efficient methods for the analysis of DNA sequence data. Predicting genes in this newly sequenced data is an important and essential step towards genome annotation. Genome annotation helps in determining function of these genes. Accurate splice site prediction in DNA sequences leads to correct gene structure prediction in eukaryotes and it requires effective modelling of regions surrounding these sites. A large number of methods for splice site prediction are available in literature but very few of them are suitable to be incorporated as gene prediction module because of their complexity. In this paper, a splice site prediction method based on second order markov model and support vector machine is developed. This method shows improvement over most of the existing splice site predictors in use today. The experimental results suggest that second order markov model is an effective pre-processing approach. This approach when combined with support vector machine provides better classification accuracy in predicting splice sites.
    No preview · Article · Dec 2015 · Procedia Computer Science
  • Manpreet Kour · Bhisham Sharma · Dr. Trilok C. Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: Congestion in wireless sensor networks can be controlled either by adjusting the data rate (traffic control), or by providing alternative path for the data packets (resource control). In this paper, we present an overview of resource-based congestion control protocols. Firstly, the basic aspects of congestion control in wireless sensor networks are described. Secondly, a detail of existing resource-based congestion control protocols is presented. Thirdly, the comparison of these protocols is shown on the basis of various parameters. Finally, the conclusion of the paper is provided.
    No preview · Article · May 2015
  • Shelly Garg · Bhisham Sharma · Dr. Trilok C. Aseri

    No preview · Article · Apr 2015 · International Journal of Scientific and Engineering Research
  • Trilok Chand Aseri · Deepak Bagai
    [Show abstract] [Hide abstract]
    ABSTRACT: ATM provides elaborate signaling support for dynamic establishment and release of switched virtual circuits. The information necessary for traffic contracting is exchanged between the user and the network through the signaling messages. ATM signaling standards exist for both point-to-point as well as point-to-multipoint signaling model. The tasks and procedures defined for setting-up an ATM connection are often very different concerning the relevant specifications of various working bodies (such as ITU-T or ATM-Forum) or certain vendors, although the basics for maintaining ATM connections are always principally the same. The reason for this situation is that the intentions of working bodies are different and each one of them follows specific strategies for certain scenarios (such as for point-to-point or point-to-multipoint). This comparative analysis of signaling systems and protocols for ATM networks identifies several important characteristics and relevant scenarios of selected approaches.
    No preview · Article · Mar 2015 · IETE Technical Review
  • Bhisham Sharma · Trilok C. Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks are formed by a large number of sensor nodes which are commonly known as motes. In the past few years, several reliable, congestion controlled and energy efficient transport layer protocols in wireless sensor networks have been developed and proposed in the literature. In this paper, we have presented a hybrid and dynamic reliable transport protocol which provides the mechanism to dynamically assign the timing parameters to the nodes as well as enhance the protocol performance by using a hybrid Acknowledgement/Negative Acknowledgement scheme. The performance of proposed protocol is tested under TinyOS Simulator varying different parameters and protocol settings and found that proposed protocol is able to program all the nodes when given proper pump/fetch ratios, is able to solve the booting sensor nodes problem by being able to wait till all the nodes finished booting and solves the all-packets-lost problem by acknowledging the receipt of its first packet delivered that is the inform message.
    No preview · Article · Feb 2015 · Computers & Electrical Engineering
  • Jasmeet Kaur · Trilok C. Aseri · Arvind Kakria

    No preview · Article · Mar 2014 · International Journal of Computer Applications
  • Nivit Gill · Shailendra Singh · Trilok C Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: Abstract Bioinformatics aids in the understanding of the biological processes of living beings and the genetic architecture of human diseases. The discovery of disease-related genes improves the diagnosis and therapy design for the disease. To save the cost and time involved in the experimental verification of the candidate genes, computational methods are employed for ranking the genes according to their likelihood of being associated with the disease. Only top-ranked genes are then verified experimentally. A variety of methods have been conceived by the researchers for the prioritization of the disease candidate genes, which differ in the data source being used or the scoring function used for ranking the genes. A review of various aspects of computational disease gene prioritization and its research issues is presented in this article. The aspects covered are gene prioritization process, data sources used, types of prioritization methods, and performance assessment methods. This article provides a brief overview and acts as a quick guide for disease gene prioritization.
    No preview · Article · Mar 2014 · Journal of computational biology: a journal of computational molecular cell biology
  • Arvind Kakria · Trilok Chand Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless Sensor Networks plays an important role in many applications like industrial automation, intrusion detection, surveillance, agriculture and so on [1]. Large numbers of nodes which are low cost are distributed in area of application which coordinates with each other. MAC protocols are divided in two following categories: Asynchronous, Synchronous, Frame based and Multichannel. Here in this paper evolution of various Synchronous MAC protocols is discussed.
    No preview · Conference Paper · Mar 2014
  • Padmavati · T.C. Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor network consists of various sensor nodes which sense the environment and forward the sensed data to the sink node. Routing in static wireless sensor network sensor nodes near the sink consume all its energy there by network partition occurs (hot-spot problem). To avoid hot-spot problem a routing in wireless sensor network using mobile sink can be used, where a sink node is provided mobility which gathers information from the sensor nodes using 1-hop communication there by reduces a hot-spot problem and increases network lifetime and decreases energy consumption. In this paper types of wireless sensor network are presented, various routing protocols in wireless sensor network using mobile sink is also presented. At the end of the paper a detailed comparison of surveyed routing protocols is also presented.
    No preview · Conference Paper · Mar 2014
  • Monika Sharma · Bhisham Sharma · Trilok C. Aseri

    No preview · Article · Feb 2014 · International Journal of Computer Applications
  • Neelam Goel · Shailendra Singh · Trilok Chand Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: The rapid growth of genomic sequence data for both human and non-human species has made analyzing these sequences especially predicting genes in them very important and is currently the focus of many research efforts. Beside its scientific interest in molecular biology and genomics community, gene prediction is of considerable importance in human health and medicine. A variety of gene prediction techniques have been developed for eukaryotes, over the past few years. This article reviews and analyzes the application of certain soft computing techniques in gene prediction. First, the problem of gene prediction and its challenges are described. These are followed by different soft computing techniques along with their application to gene prediction. In addition, a comparative analysis of different soft computing techniques for gene prediction is given. Finally some limitations of the current research activities and future research directions are provided.
    No preview · Article · Mar 2013 · Analytical Biochemistry
  • Source
    Neelam Goel · Shailendra Singh · Trilok Chand Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: In the past decade, various genomes have been sequenced in both plants and animals. The falling cost of genome sequencing manifests a great impact on the research community with respect to annotation of genomes. Genome annotation helps in understanding the biological functions of the sequences of these genomes. Gene prediction is one of the most important aspects of genome annotation and it is an open research problem in bioinformatics. A large number of techniques for gene prediction have been developed over the past few years. In this paper a theoretical review of soft computing techniques for gene prediction is presented. The problem of gene prediction, along with the issues involved in it, is first described. A brief description of soft computing techniques, before discussing their application to gene prediction, is then provided. In addition, a list of different soft computing techniques for gene prediction is compiled. Finally some limitations of the current research and future research directions are presented.
    Preview · Article · Mar 2013
  • Bhisham Sharma · Trilok C. Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: Design and implementation of wireless sensor Networks have gathered increased attention in recent years due to vast potential of sensor networks consisting of spatially distributed devices (motes) to cooperatively monitor physical or environmental conditions at different locations. Wireless sensor networks are built upon low cost nodes with limited battery (power), CPU clock (processing capacity), and memory modules (storage). Transport layer protocols applied to wireless sensor networks can handle the communications between the sink node and sensor nodes in upstream (sensor-to-sink) or downstream (sink-to-sensor) direction. In this paper, we present a comparative analysis of reliable and congestion aware transport layer protocols for wireless sensor networks and number of open issues that have to be carefully realized to make use of the wireless sensor networks more efficiently and to enhance their performance. We first list the characteristics of transport layer protocols. We then provide a summary of reliable and congestion aware transport layer protocols with their respective pros and cons and comparison of different protocols based on reliability, congestion control, and energy efficiency. Finally, we point out open research issues of transport layer protocols for wireless sensor networks, which need further attention to overcome the earlier mentioned challenges.
    No preview · Article · Dec 2012
  • Source
    Trilok C Aseri · Neha Singla
    [Show abstract] [Hide abstract]
    ABSTRACT: The need for security in communications is in fact not new. This need has existed in military communications for thousands of years. In this paper, we focus on network protocols that provide security services. Wireless sensor network is an emerging technology that shows applications both for public as well as military purposes. Monitoring is one of the main applications. A large amount of redundant data is generated by sensor nodes. This paper compares all the protocols which are designed for security of wireless sensor network on the basis of security services and propose an improved protocol that reduces communication overhead by removing data redundancy from the network. By using the message sequence number we can check whether it is old message or new message. If the message is old then no need to send that message thereby reducing overhead. It also integrates security by data freshness in the protocol.
    Preview · Article · Jul 2011 · International Journal of Computers, Communications & Control (IJCCC)
  • Chirag K. Rupani · Trilok C. Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) are a kind of communication networks having independent sensor nodes that form multi-hop ad hoc network to transfer data. In the past few years, various transport control protocols in wireless sensor networks (WSNs) have been developed and proposed in the literature. In this paper, we have analyzed pump slowly, fetch quickly (PSFQ) protocol and presented an improved transport layer protocol for wireless sensor networks. The improved protocol has been analyzed based on various factors such as average latency and average error tolerance and it is found that the proposed protocol is better than PSFQ in terms of these factors.
    No preview · Article · May 2011 · Computer Communications
  • Source
    R B Patel · Dilip Kumar · Trilok C Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: In recent years, energy efficiency and data gathering is a major concern in many applications of Wireless Sensor Networks (WSNs). One of the important issues in WSNs is how to save the energy consumption for prolonging the network lifetime. For this purpose, many novel innovative techniques are required to improve the energy efficiency and lifetime of the network. In this paper, we propose a novel Energy Efficient Clustering and Data Aggregation (EECDA) protocol for the heterogeneous WSNs which combines the ideas of energy efficient cluster based routing and data aggregation to achieve a better performance in terms of lifetime and stability. EECDA protocol includes a novel cluster head election technique and a path would be selected with max-imum sum of energy residues for data transmission instead of the path with minimum energy consumption. Simulation results show that EECDA balances the energy consumption and prolongs the network lifetime by a factor of 51%, 35% and 10% when compared with Low-Energy Adaptive Clustering Hierarchy (LEACH), Energy Efficient Hierarchical Clustering Algorithm (EEHCA) and Effective Data Gathering Algorithm (EDGA), respectively.
    Preview · Article · Apr 2011 · International Journal of Computers, Communications & Control (IJCCC)
  • Source
    Dilip Kumar · Trilok C. Aseri · R.B. Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Effective energy management in heterogeneous wireless sensor networks (WSNs) is a more challenging issue compared to homogeneous WSNs. Much of the existing research has often assumed homogeneous sensor nodes in the networks. The energy preservation schemes for the homogeneous WSNs do not perform efficiently when applied to heterogeneous WSNs. In this paper, we have presented an energy-efficient multi-hop communication routing (MCR) protocol in order to address the traditional problem of load balancing, lifetime, stability and energy efficiency in the WSNs. MCR protocol is based on dividing the network into dynamic clusters. The cluster-heads election is based on weighted probability. The cluster's nodes communicate with an elected cluster head node by using single hop communication approach, and then the cluster heads communicate the information to the base station via multi-hop communication approach. Performance studies indicate that MCR effectively solves the problem of load balancing across the network, extends the network lifetime, stability and is more energy efficient in comparison to multi-hop low-energy adaptive clustering hierarchy (M-LEACH) and multilayer energy efficient cluster head communication protocol (MEECHCP).
    Preview · Article · Jan 2011
  • Source
    Dilip Kumar · Trilok C Aseri · R B Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Due to environmental characteristics, limited power and processing capabilities of wireless sensor networks, it is essential to find new techniques that improve the flow of information in the network. The cluster head election among the sensor nodes is an effective technique in wireless sensor networks to increase the network efficiency, scalability and lifetime. In this paper, we have proposed and evaluated a distributed cluster head election scheme for heterogeneous sensor networks. The election of cluster heads is based on different weighted probability. The cluster's member nodes communicate with the elected cluster head and then cluster heads communicate the aggregated information to the base station via single hop communication. Adopting this approach, our simulation results demonstrate that the proposed scheme offers a much better performance than the existing protocols in terms of stability and network lifetime.
    Preview · Article · Sep 2010
  • Source
    Dilip Kumar · Ram Bahadur Patel · Trilok Chand Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: Research on Wireless Sensor Networks has often assumed homogeneous nodes. In reality, homogeneous nodes have different capabilities like different levels of initial energy and drain rate. This leads to the research on heterogeneous networks where two or more types of nodes are considered within the network and the more powerful sensor nodes act as cluster heads. In this paper, we have analyzed a heterogeneous network with three types of nodes having different initial energy levels. A single hop clustering topology has been assumed and analyzed the network performance in terms of lifetime. Simulation results show that the network lifetime is much better in proposed protocol than the existing protocols.
    Preview · Article · Aug 2010 · International Arab Journal of Information Technology
  • Source
    Kumar Dilip · Trilok. C Aseri · R. B Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Recent research on heterogeneous Wireless Sensor Networks (WSNs) has been studied and employed in many new applications viz., medical monitoring, automotive safety, agriculture precision and many more. In this paper, a novel energy efficient multihop communication protocol (EEMCP) for clustered heterogeneous WSNs has proposed to analyze the network lifetime and stability. EEMCP consider heterogeneous nodes with different initial energy levels and adopt multihop communication approach for data communication from cluster heads to the base station. Simulation results show that EEMCP extends the network lifetime and stability by balancing energy consumption of the network.
    Preview · Article · Jan 2010