Cooperative Self-Scheduling Secure Routing Protocol for Efficient Communication in MANET

In wireless transmission, a Mobile Ad-hoc Network (MANET) contains many mobile nodes that can communicate without needing base stations. Due to the highly dynamic nature of wireless, MANETs face several issues, like malicious nodes making packet loss, high energy consumption, and security. Key challenges include efficient clustering and routing with optimal energy efficiency for Quality of Service (QoS) performance. To combat these issues, this novel presents Cooperative Self-Scheduling Secure Routing Protocol (CoS3RP) for efficient scheduling for proficient packet transmission in MANET. Initially, we used Elite Sparrow Search Algorithm (ESSA) for identifies the Cluster Head (CH) and form clusters. The Multipath Optimal Distance Selection (MODS) technique is used to find the multiple routes for data transmission. Afterward, the proposed CoS3RP transmits the packets based on each node authentication. The proposed method for evaluating and selecting efficient routing and data transfer paths is implemented using the Network simulator (NS2) tool, and the results are compared with other methods. Furthermore, the proposed well performs in routing performance, security, latency and throughput

Performance Analysis of Hierarchical Routing Protocols in Wireless Sensor Networks

This work focusses on analyzing the optimization strategies of routing protocols with respect to energy utilization of sensor nodes in Wireless Sensor Network (WSNs). Different routing mechanisms have been proposed to address energy optimization problem in sensor nodes. Clustering mechanism is one of the popular WSNs routing mechanisms. In this paper, we first address energy limitation constraints with respect to maximizing network life time using linear programming formulation technique. To check the efficiency of different clustering scheme against modeled constraints, we select four cluster based routing protocols; Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold Sensitive Energy Efficient sensor Network (TEEN), Stable Election Protocol (SEP), and Distributed Energy Efficient Clustering (DEEC). To validate our mathematical framework, we perform analytical simulations in MATLAB by choosing number of alive nodes, number of dead nodes, number of packets and number of CHs, as performance metrics.Comment: NGWMN with 7th IEEE International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA 2012), Victoria, Canada, 201

Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network

A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes a novel hybrid multipath routing algorithm with an efficient clustering technique. A node is selected as cluster head if it has high surplus energy, better transmission range and least mobility. The Energy Aware (EA) selection mechanism and the Maximal Nodal Surplus Energy estimation technique incorporated in this algorithm improves the energy performance during routing. Simulation results can show that the proposed clustering and routing algorithm can scale well in dynamic and energy deficient mobile sensor network.Comment: 9 pages, 4 figure

Small-world networks, distributed hash tables and the e-resource discovery problem

Resource discovery is one of the most important underpinning problems behind producing a scalable, robust and efficient global infrastructure for e-Science. A number of approaches to the resource discovery and management problem have been made in various computational grid environments and prototypes over the last decade. Computational resources and services in modern grid and cloud environments can be modelled as an overlay network superposed on the physical network structure of the Internet and World Wide Web. We discuss some of the main approaches to resource discovery in the context of the general properties of such an overlay network. We present some performance data and predicted properties based on algorithmic approaches such as distributed hash table resource discovery and management. We describe a prototype system and use its model to explore some of the known key graph aspects of the global resource overlay network - including small-world and scale-free properties