Inderscience is a global company, a dynamic leading independent journal publisher disseminates the latest research across the broad fields of science, engineering and technology; management, public and business administration; environment, ecological economics and sustainable development; computing, ICT and internet/web services, and related areas.

Inderscience is a global company, a dynamic leading independent journal publisher disseminates the latest research across the broad fields of science, engineering and technology; management, public and business administration; environment, ecological economics and sustainable development; computing, ICT and internet/web services, and related areas.

The access control mechanism is a necessary security primitive for deploying a new node within the resource-constrained WSN. In literature, new node access control schemes have been proposed for WSN, focusing on efficiency and security strength. However, less attention is given to the functional specification of scalability and independence from time synchronisation. In this paper, an ECC-based new node access control is presented. Besides being computationally effective and secure, the scheme is scalable and doesn't have time synchronisation issues. The proposed scheme's security strength and correctness have been proven using BAN logic and the Random Oracle Model. Simulations on AVISPA and Scyther tools have been performed for automatic security verification of the proposed method. The proposed scheme has also been programmed on TinyOS to perform simulation on the TOSSIM simulator and test-bed implementation on MicaZ motes.

Security issues of wireless sensor nodes for classifying sensory data and its accuracy needed to prevent wastage of sensor resources. The limitation occurs due to processing of small-scale samples in training or data imbalance, which occurs due to nodal density. In this context, pre-processing of sensor data to overcome scheduling attacks considered with two algorithms is proposed. The first is 'Time Stamp Reordering for Scheduling Attack' (TSRSA) and the second is 'Energy Efficiency based Routing using Simulated Annealing' (EERSA). The former is susceptible to scheduling attacks, whereas the later alleviate this by using simulated annealing. EERSA method provides optimal moves as data traverses using energy bound values, time-bound transitions using propagation delay and offset values. The simulation of both developed protocols measured and compared for misalignment ratio and consolidated residual energy.

An ad-hoc network comprises a set of wireless nodes with no pre-defined infrastructure. The most well-known attribute of a wireless network is dynamic. They also have inadequate channel strength, security belief issues and functioning with narrowed battery power. This study explores the capabilities of working with different attacks like a vampire attack. This attack is forever hindrance to the networks by reducing the node's bandwidth and energy. In addition, the protocol detects a replica attack that can capture the neighbour's address and act as a genuine. These two attacks can spoil the entire system activities and use network abilities. The proposed Secure Neuro-fuzzy Based Trusted Neighbour Selection and Attackers Detection in Multipath Ad-Hoc Network (SNTAM) protocol focused to eliminate these attackers from the network to form the communication path by an optimised way of neuro-fuzzy techniques. The results show that SNTAM gives effective results in securing the network in all the parameters and attributes especially packet delivery ratio (PDR) which is almost 100% and residual energy of nodes which is more than compared protocol. Furthermore, SNTAM protocol can avoid sampled malicious nodes effectively.