A Theory in Optimization of Ad-hoc Routing Algorithms

In this paper optimization of routing in ad-hoc networks is surveyed and a new method for reducing the complexity of routing algorithms is suggested. Using binary matrices for each node in the network and updating it once the routing is done, helps nodes to stop repeating the routing protocols in each data transfer. The algorithm suggested can reduce the complexity of routing to the least amount possible.




References:
[1] I. Stojmenovic, "Position-Based Routing in Ad Hoc Networks", IEEE
Communications Magazine, pp. 2-3, July 2002.
[2] L. Barriere, P. Fraingniaud and L. Narayanan, "Robust Position-Based
Routing in Wireless Ad Hoc Networks with Unstable Transmission
Ranges", Rome, Italy 2001 ACM, p.19.
[3] L. Zhou and Z. J. Haas, "Securing Ad Hoc Networks", IEEE network,
special issue on network security, p.1, November/December, 1999.
[4] S. P. Kon and R. V. Boppana, "On Reducing Packet Latencies in Ad
Hoc Networks", The University of Texas at San Antonio, WCNC 2000.
[5] Y. Hu, A. Perrig and D. B. Johnson, "Rushing Attacks and Defense in
Wireless Ad Hoc Network Routing Protocols", WiSe 2003, San Diego,
California, USA Copyright September 2003 ACM. p.1.
[6] A. Bruce McDonaldk and Y. Taieb Znatiy, "A Path Availability Model
for Wireless Ad-Hoc Networks", Proc. IEEE WCNC-99, p.1.
[7] S. Buchegger and J. Le Boudec, "Cooperative Routing in Mobile Adhoc
Networks: Current Efforts against Malice and Selfishness",
Proceedings of Mobile Internet Workshop, Informatik 2002, Dortmund,
Germany, October 2002, p.2.
[8] S. Rupp and W. Fu, "Routing Mechanisms in Ad-Hoc Networks", Oral
Presentation, July 2003.
[9] Tian He, John A Stakovic, Chenyang Lu and Tarek Abdelzaher,
"SPEED: A Stateless Protocol for Realtime Communication in Sensor
Networks", Department of Computer Science, University of Virginia,
Dec 2002. p.9.
[10] T.H. Cormen, C.E. Leiserson and R.L. Rivest, "Introduc-tion to
Algorithms", MIT Press, 1990.
[11] J. Leguay, T. Ur Friedman and S. Fdida, "CONNECTIVITY AWARE
ROUTING IN AD-HOC NETWORKS", funded in part by Thales
Communications and LIP6 through Euronetlab, in part by E-Next, and
in part by the ANRT (Association Nationale de la Recherche
Technique) through the CIFRE, 2004.
[12] L. Butty'an and J. Hubaux, "Report on a Working Session on Security
in Wireless Ad Hoc Networks", Mobile Computing and
Communications Review, Vol. 6, No. 4, p.6.
[13] S. J. Philip, "Routing in Mobile Ad hoc Networks", university at
Buffalo, New York. Fall 2004.
[14] Y. B. Ko and N. H. Vaidya, "Location-Aided Routing (LAR) in mobile
ad hoc networks", Wireless Networks 6 (2000), supported in part by
Texas Advanced Technology Program and National Science
Foundation, J.C. Baltzer AG, Science Publishers. p. 307.
[15] D. B. Johnson and D. A. Maltz, "Dynamic Source Routing in Ad Hoc
Wireless Networks", Mobile Computing, edited by Tomasz Imielinski
and Hank Korth, Kluwer Academic Publishers, 1996.
[16] J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu and J. Jetcheva, "A
Performance Comparison of Multi-Hop Wireless Ad Hoc Network
Routing Protocols", in Proceedings of Fourth Annual ACM/IEEE
International Conference on Mobile Computing and Networking
(MobiCom'98), October, 1998, Dallas, Texas, USA. Copyright 1998
ACM. P.2.
[17] N. Milanovic, M. Malek A. Davidson and V. Milutinovic, "Routing and
Security in Mobile Ad Hoc Networks", the IEEE Computer Society,
February 2004.
[18] J. Wu and F. Dai, "BROADCASTING IN AD HOC NETWORKS
BASED ON SELF-PRUNING", International Journal of Foundations of
Computer Science World Scientific Publishing Company, supported in
part by NSF, 2003, pp.2-4.
[19] P. Papadimitratos and Z. J. Haas, "Secure Routing for Mobile Ad hoc
Networks", In Proceedings of the SCS Communication Networks and
Distributed Systems Modeling and Simulation Conference (CNDS
2002), San Antonio, TX, January 2002. p.3.
[20] M. Gerla, X. Hong and G. Pei, "Landmark Routing for Large Ad Hoc
Wireless Networks", In Proceeding of IEEE GLOBECOM 2000, San
Francisco, CA, Nov. 2000.
[21] K. Wu and J. Harms, "QoS Support in Mobile Ad Hoc Networks",
Crossing Boundaries - an interdisciplinary journal Vol.1, No.1 - Fall
2001. p.99.
[22] E. Natsheh, S. Khatun and A. Jantan, "A Model of Route Lifetime
Optimization with Linguistic Knowledge in Wireless Ad-hoc
Networks," Mathware & Soft Computing 16 (2006), pp. 23-24.
[23] C. Venkatesh, N. Yadaiah and A.M. Natarajan, "Dynamic source
routing protocol using fuzzy logic concepts for ad hoc networks,"
Academic Open Internet Journal, www.acadjournal.com, Volume 15,
2005.
[24] Yi-an Huang, " Anomaly Detection for Wireless Ad-Hoc Routing
Protocols," A thesis submitted to the Graduate Faculty of North
Carolina State University in partial fulfillment of the requirements for
the Degree of Master of Science, 2001, p. 30.
[25] Hongju Cheng, Xiaohua Jia, and Hai Liu, "Access Scheduling on the
Control Channels in TDMA Wireless Mesh Networks," ICCSA 2007,
LNCS 4706, Part II, pp. 247-248, 2007.
[26] Mustapha GUEZOURI and Abdelaziz OUAMRI, "Optimizing Routes
Quality and Scattering in the AODV Routing Protocol," JCS&T Vol. 7
No. 3, October 2007, pp. 209-211.
[27] Chao Gui and Prasant Mohapatra, "SHORT: Self-Healing and
Optimizing Routing Techniques for Mobile Ad Hoc Networks,"
MobiHoc-03, June 2003, Annapolis, Maryland-USA, Copyright 2003
ACM, p.279.
[28] N. H. Vaidya, "Mobile Ad Hoc Networks: Routing, MAC and Transport
Issues", University of Illinois at Urbana-Champaign, 2001.