News & Updation
A MATHEMATICAL MODELLING FOR EFFECTIVE MOBILE AGENT ITINERARY USING FARTHEST NODE FIRST, NEXT NEARER NODE ALGORITHM
Prapulla S. B.*, Shrishah S., Shobha G., Thanuja T. C. and Prakash R.
Due to the rising exploitation of Wireless Sensor Networks (WSN) for boosting all major traditional application domains and enabling brand new application domains, applications based on WSNs have gained lot of attention. Design techniques, and frameworks have been built and made accessible to aid high-level development of WSN applications. Despite the abundance of ideas, more study should be focused on energy efficient techniques as WSNs are built with limited bandwidth and inconsistent connections. The Sensor Nodes(SN) in a WSN are densely packed, resulting in a large number of SN across the sensing zone that can perceive a geographic spot. To reduce sensor data collection, transmission costs and extend sensor battery life, Mobile Agents (MA) and its itinerary planning algorithm are proposed for collecting sensor data. Many approaches have been offered to address the issue of MA itinerary, but majority of these methodologies ignore the cut nodes. This study presents a dynamic itinerary planning using algorithm Farthest Node First, Next Nearer Node, which considers signal strength rather than physical distance. Cut nodes are not included in the itinerary since they do not emit electromagnetic radiation. Clusters arise when SNs are more and the cluster head selection is computed mathematically. Simulation was used to assess the mobile agent's migration from base station to sensor nodes and back to the base station. SN were simulated as points in a two-dimensional coordinate space. The outcomes of simulations of static-static, static-dynamic, and dynamic-dynamic scenarios are discussed.[Full Text Article]