全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Search Algorithms for Routing Adaptation (SARA): From Tabu Search Foundations (1994) to Statistically-Assisted and Energy-Aware Intelligence for Ad Hoc and Ubiquitous Computing

DOI: 10.4236/ijcns.2026.198008, PP. 113-127

Keywords: Statistically Assisted Routing Algorithms, Search Algorithms for Routing Adaptation, Tabu Search, Simple Ant Routing Algorithm, EASARA, D* Lite, RTD*, Reproducibility, Acronym Overload

Full-Text   Cite this paper   Add to My Lib

Abstract:

Context: The acronym SARA has been used for at least four independent routing-related concepts, leading to conflation in manuscripts that present Tabu-based routing (1994) and Statistically Assisted Routing (2008) as a single lineage. Objective: This paper 1) distinguishes two SARA definitions with documented evidence, 2) identifies where SARA is only acronym overlap, 3) provides verified references for all claims, 4) corrects figure caption vs plotted-point inconsistencies and unsupported statistical claims, and 5) supplies a complete reproducibility specification satisfying IJCNS requirements. Methods: Distinction of Tabu-SARA (Search Algorithms for Routing Adaptation, 1994 claim, tabu list, tenure, aspiration) vs Rossi-SARA (Statistically Assisted Routing Algorithms, Rossi, Zorzi, Rao, Wireless Networks 14: 55-70, 2008) vs EASARA (Energy Aware Simple Ant Routing Algorithm, Jabbar et al. 2015) vs Simple Ant SARA (MANET). Full reproducibility spec: ns-3.36, YansWifiPhy LogDistance + LogNormal σ4dB, AdhocWifiMac GeRaF 4 regions, BasicEnergySource 2J, 500 × 500 uniform placement ≥ 95% connectivity, 10% independent duty-cycle, N-1 CBR, 300 s duration, 6 densities × 10 seeds = 300 runs, static ConstantPosition, metrics with CI and t-test. Results: Corrected visual estimates 50 nodes EASARA ~215 SARA ~174 MFR ~112 (not 220/180/120); 200 nodes MFR ~90 SARA ~156 Tabu ~162 EASARA ~200 (not 95/155). Corrected rising curves offline optimal 1.00 → 1.05, SARA 1.11 → 1.20, MFR 1.28 → 1.38 (not flat 1.10× within 10% at all distances, 14.3% over at 10 hops). Tabu parameters tenure 7 - 12, aspiration 5%, loop reduction 73%, hybrid +8% audited as DESIGN CHOICE/HYPOTHESIS. Conclusion: No citation chain Tabu-SARA → Rossi-SARA. Acronym identity is coincidental reuse. Contribution is distinction with verified references, corrected figures/tables, full statistical reproducibility spec, and novel synthesis proposal labeled as new hypothesis.

References

[1]  Rossi, M., Zorzi, M. and Rao, R.R. (2006) Statistically Assisted Routing Algorithms (SARA) for Hop Count Based Forwarding in Wireless Sensor Networks. Wireless Networks, 14, 55-70.
https://doi.org/10.1007/s11276-006-7791-8
[2]  Johnson, D.B. and Maltz, D.A. (1996) Dynamic Source Routing in ad Hoc Wireless Networks. In: Imielinski, T. and Korth, H.F., Eds., Mobile Computing, 153-181.
[3]  Perkins, C.E., Belding-Royer, E.M. and Das, S.R. (1999) Ad-Hoc On-Demand Distance Vector Routing. Second IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, 25-26 February 1999, 90-100.
[4]  AlMahmeed, A.S. (1994) SARA Adaptive Routing Using Tabu Search. Ph.D. Thesis, University of Strathclyde, Glasgow.
[5]  Rossi, M., Zorzi, M. and Rao, R.R. (2008) Statistically Assisted Routing Algorithms (SARA) for Hop Count Based Forwarding in Wireless Sensor Networks. Wireless Networks, 14, 55-70.
http://www.dei.unipd.it/~rossi/papers/RossiWirelessNets2008.pdf
[6]  Jabbar, S., Iram, R., Imran, M., Ahmad, A., Paul, A., Minhas, A.A., et al. (2015) Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks. Mathematical Problems in Engineering, 2015, Article ID: 194532.
https://doi.org/10.1155/2015/194532
[7]  Glover, F. (1986) Future Paths for Integer Programming and Links to Artificial Intelligence. Computers & Operations Research, 13, 533-549.
https://doi.org/10.1016/0305-0548(86)90048-1
[8]  Zorzi, M. and Rao, R.R. (2003) Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance. IEEE Transactions on Mobile Computing, 2, 349-365.
https://doi.org/10.1109/tmc.2003.1255650
[9]  Koenig, S., Likhachev, M. and Lite, D. (2002) Proceedings of the AAAI Conference on Artificial Intelligence, Edmonton, 476-483.
[10]  Bond, D., Widger, N., Ruml, W. and Sun, X. (2010) Real-Time Search in Dynamic Worlds. Proceedings of the International Symposium on Combinatorial Search, 1, 16-22.
https://doi.org/10.1609/socs.v1i1.18174
[11]  Kleinrock, L. and Silvester, J.A. (1978) Optimum Transmission Radii for Packet Radio Networks, or Why Six Is a Magic Number. Proceedings of the IEEE National Telecommunications Conference, 4, 1-4.
[12]  Li, X., Lee, J., et al. (2024) Comprehensive Comparative Study of State-of-the-Art Path-Planning. Applied Sciences, 15, 148.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133