# Energy Efficient Routing in Wireless Sensor Networks: A Comprehensive Survey
## 4 Topology
### Mobile Agent Based
\begin{table}
\begin{tabular}{c c c c c c c} \hline \hline
**Protocol** & **Advantages** & **Disadvantages** & **Scalability** & **Mobility** & **Routing** & **Robustness** \\ \hline \multirow{3}{*}{GEAR [115]} & It balances energy & The periodic table & \multirow{3}{*}{Limited} & \multirow{3}{*}{The best route is used.} & \multirow{3}{*}{Good} \\  & ingestion and extends & exchanges increase & & & & \\  & network lifetime. & overhead. & & & & \\  & It efficiently routes & & & & \\  & messages and offers & It overloads low level & & & & \\  & void and obstacle & nodes. & & & & \\  & tolerance. & & & & & \\  & It has fault tolerance & It depends on the up & & & & \\  & & to date local neighbor & Limited & Good & The best route is & Good \\  & end latency. & & tables. & & & \\  & It has uniform energy & It does not work well & & & & \\  & dissipation & with mobile nodes. & Limited & Limited & The highest residual & Good \\  & It is easy to apply and & It suffers from the & & & & \\ GDSTR [119] & offers lower path & local dead end & Limited & None & The shortest route is & Good \\  & hop stretch. & problem. & & & & \\  & It has uniformity of & It wastes energy when & Limited & Low & The minimum energy & Good \\  & energy consumption. & & nodes are close. & & & \\  & It offers superior & It depends on the up & & & \\  & energy saving and & to date local neighbor & Good & Limited & The best route is used. & Good \\  & handles void. & tables. & & & & \\  & It manages low & It is stateless location & & & & The shortest route by & Good \\  & overhead of routing. & & based. & Good & Good & \\  & It has reduced end to & The reduced delay is & & Good & Good & \\  & & end delay. & & & & \\  & Fault tolerance is & The link maintenance & & & & \\  & attained. & & & & & \\  & Both link maintenance & High amount of edges & & & \\  & cost and number of & increases overhead. & & & & \\  & & & & & \\  & Network lifetime is & Nodes neither & & & The least cost route & \\  & extended. & aggregate nor merge & Good & Good & within the virtual grid & Low \\  & & data. & & & & \\  & & It suffers from the & & & & \\  & reduced. & energy hole problem. & & & & \\  & hole problem and & The GPS increases & & & & \\  & extends network & energy consumption. & Good & None & The optimal path by & Good \\  & lifetime. & & & & & \\  & It avoids the energy & & & & & \\  & hole problem and & GPS increases energy & & & & \\  & provides an extended & consumption. & & & & \\  & network lifetime. & & & & \\  & DEELIP & It has low latency & The nodes are static in & Good & Limited & The shortest route is & \\  & operation. & data gathering. & & & & \\  & & It works small end & It wastes network & Limited & Good & The minimum power & \\  & to end delay. & bandwidth. & Limited & Good & ingestion route is & Limited \\ \hline \hline \end{tabular}
\end{table} 
Table 10: Synopsis of Topology Protocols belonging to Location based subcategory. or IEMA adds a route optimization apart from \(S\) (1) selection. IEMF achieves not only great energy efficiency, but also high delivery ratio. However, the scalability of IEMF is limited. A synopsis of the characteristics of the aforementioned topology routing protocols belonging to mobile agent subcategory is presented in Table 11.