Accepted Papers

  • HaarWavelet based Distributed Predictive Target Tracking algorithm for wireless sensor networks
    Mahsa Ghasembaglou, Abolfazl Toroghi haghighat, Qazvin Islamic Azad University, Iran.
    ABSTRACT
    Target tracking is a typical and important application of wireless sensor networks (WSNs). In the consideration of scalability and energy efficiency for target tracking in large scale WSNs, it has been employed as an effective solution by organizing the WSNs into clusters. However, tracking a moving target in cluster-based WSNs suffers many problems e.g. energy consumption and need to use complex predictive tracking. In this paper, we propose a novel scheme, called Haar wavelet-based target tracking (HWDPT). We proposed an efficient prediction algorithm for mobile targets tracking based on Haar Wavelet transform. Also, we integrated on-demand dynamic clustering into a cluster-based WSN for effective target tracking. The simulation results validate that the proposed HWDPT protocol performs better in terms of track failed ratio, energy waste ratio and algorithm complexity, respectively.
  • A New Approach for the Detection of Black hole nodes in AODV based Mobile ad-hoc Networks
    Nisha P John and Anand Pavithran, MES College of Engineering, India.
    ABSTRACT
    An ad-hoc network is a collection of mobile nodes that dynamically form a temporary network and are infrastructure less.Networks are protected using many firewalls and encryption softwares. But many of them are not sufficient and effective due to its limited power and mobility. So protecting the mobile ad-hoc network from malicious attacks is very important and challenging issue. In this paper we address the problem of packet forwarding misbehavior and propose a mechanism to detect and remove the black attack using check messages. Also, we simulate the Ad hoc on Demand Vector Routing Protocol (AODV) under blackhole attack by considering different performance metric.
  • An Unidirectional Client Based Proxy Selection Approach for Secure data Transfer
    Suni s1 and Krishna Nallaperumal2, 1SHM Engineering college and 2Manonmaniam Sundaranar University, India.
    ABSTRACT
    The goal of the proposed project is to implement the unidirectional proxy re-encryption schemes with chosenciphertext security in the customary model. This model provides secure data transfer using proxy re-encryption method, without sacrificing other security features, such as collusion resistance.Proxy re-encryption realizes delegation of decryption rights, enabling a proxy holding a e-encryption key to change a ciphertext originally wished-for Alice into an encryption of the same message for Bob. Thus the security of delegates against malicious delegates and proxies is the main objective in the aim of unidirectional approach. This work present new re-encryption schemes that realize a stronger perception of security and reveal the worth of proxy re-encryption as a method of adding client based proxy selection approach for secure data transfer. However the alliance of the proxy and the delegatee can recover the delegator's private key. This is a serious flaw, since a user's private key should be strictly not exposed in any situation. In this work, present a method solving this problem, based on construction. Here this paper further extends the scheme to deal with several drawbacks natural in almost all existing proxy reencryption schemes.
  • The design and implementation of a DTN naming system
    Lishui Chen1,2, Songyang Wang3, and Changjiang Yan1,2, 1The 54th Research Institute of China Electronics Technology Group Corporation, 2Science and Technology on Information Transmission and Dissemination in Communication and 3Beihang University, China.
    ABSTRACT
    This paper presents the design and implementation of the naming system (NS), a resource discovery and service location system for Delay/ Disruption-Tolerant Networking (DTN). First discuss the architecture of NS mainly including Name Knowledge Base, Name Dissemination, Name Resolution and Name-based Routing. In the design and implementation of NS, we introduce the simple ame-specifiers to describe name, the name-tree for name storage and the efficient predicate-based routing algorithm. Future work is finally discussed for completing NS and providing APIs for abundant applications.