The applications of wireless sensor networks became more usable in daily life. In spite of many proposed techniques and methods, energy efficient routing in WSN is still an open issue. In this paper we made an attempt to give one of the solution for this problem in vehicle tracking system based on the vehicle sensor nodes. We studied many existing works, were failed in handling location and energy efficient routing of vehicle tracking properly. We proposed an algorithm which handles clustering and location at time and improves the performance of the system. This algorithm uses the fundamentals of LEACH, CLAEER and mean shifted algorithm. We conducted a sequence of experiments and our algorithm EECLA (Clustering and Localization Techniques to Improve Energy Efficient Routing in Wireless Sensor Networks) has given better results than the existed one with more accuracy.

In Mobile Adhoc Network (MANET) nodes are communicating each other with the help of routing protocol. In Adhoc networks, a node having high mobility, with that node’s moving randomly from node to node. For observing the movement mobility, we are studying different forms of mobility. These models can deploy the mobility of the network condition, including the various parameters such as the size of the network, traffic models of data, throughput and the PDR (Packet Delivery Ratio) are used as performance Parameters. We are investigating the RWP (Random Waypoint) and GM (Gauss-Markov) mobility model to express efficiency of Adhoc routing protocol by using the OMNET++ simulator .The result of the simulator shows that the mobility has more influence upon MANET protocol with the increasing node density. Here, we evaluated RWP and GM mobility model with AODV protocol. The study of these models illustrates dissimilar outcomes related inputs with the increasing performance of the pause time rises among the speed and number of nodes.

No abstract

The most important purpose of implementing to share secure knowledge in encrypted kind in network is to extend the safety of personal networks and its databases and to additionally give remotely infrastructure less secure services globally.  In the current system approach ECC elliptic curve cryptography is being used to deal with the security issue in wireless sensor network. Thus the system still get a long packet transfer time, which can be further become a disadvantage while dealing with large data packet. Thus the system further and study require reducing the computation transfer time in between the packet. A proposed hyper elliptic curve mechanism for the cryptography can be used to opt out the best performance over the data packet transfer. In this scenario HECC algorithm is utilized and hence the result outcome shows the efficiency of the algorithm.

It is well known that WSN is one of the leading techniques in granting pervasive computing for various applications regarding health sector and communication sector. However, the raising of issues in WSN is still a burden cause because of certain renowned terms like energy consumption and network lifetime extension. Clustering is a major contribution in any network and moreover Cluster Head selection is also a vital role since it is additively responsible in sending data to the base station, which means that Cluster Head directly makes its communication with base station. Day by day, the researches in cluster head selection get increased, but the requirements are not yet fulfilled. This paper proposes a energy efficient cluster head selection algorithm for maximizing the WSN lifetime. This paper develops a hybrid optimization process termed Group Search Ant Lion with Levy Flight (GAL-LF) for selecting the Cluster head in WSN. The proposed model is compared to the conventional models such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Group Search Optimization (GSO), Ant Lion Optimization (ALO) and Cuckoo Search (CS). The outcome of the simulation result shows the superiority of the proposed model by prolonging the lifetime of the network.