A modified Manhattan distance with application for localization algorithms in ad-hoc WSNs

Enhancing resilience in construction against infectious diseases using stochastic multi-agent approach

“…Referring to Fig. 3 , there are three potential tasks each agent may undertake at simulation each time step and its movement is specified accordingly: (1) if the agent works directly on the task in hand, it will be moved to its pre-specified crew location; (2) if the agent travels to the site warehouse, it will be moved toward the warehouse through the route with the shortest Manhathan distance [ 44 ]; and (3) if the agent takes personal time, it will be moved to one of its six neighbour cells randomly until the next simulation time step (see Fig. 3 ).…”

An Anchor Node Selection Scheme for Improving RSS-Based Localization in Wireless Sensor Network

“…The results show that the proposed strategy brings small calculation, fast convergence and positioning accuracy. Elgamel and Dandoush [30]…”

Improved Steiner Tree Scheme Applied to Wireless Sensor Networks for Path and Energy Optimization

“…Proficient information trade with minimal measure of energy loss is a significant prerequisite in the present territory of WSN technology [5] [6]. A few advancements, that merit referencing.…”

“…E is encompassed in VxV and G denotes the diagram. G is a coordinated diagram if E has a lot of requested combines and is undirected if the arrangement of edges is unordered sets.The Vertices, V= {1,2,3,4,5,6} and the Edges, E= {(1,2), (1,3), (1,5),(2,4),(3,4),(3,6),(4,6), (5,6)} Definition: A way is along these lines, characterized in a graph as a succession of vertices associated by the edges, in which the vertices don't happen on numerous occasions. This is represented by P. For example, for the precedent diagram appeared, the path is like {6, 5, 1, 2}.…”