A triangular matrix routing table representation for efficient routing in MANET

To improve the routing efficiency of a MANET, two issues need to be investigated: routing table size and path selection from source to destination. Given that routing performance depends on routing table size, which is determined by the number of nodes, a detailed table representation is required. In this study, we propose a triangular routing table representation to improve routing performance. By using a low triangular matrix, routing information can be transferred between nodes more efficiently by using a smaller memory size than the memory size used by conventional routing tables. The proposed routing representation is validated by simulating 25 MANET nodes that are generated randomly by shortest path selection. The simulation shows that the proposed approach significantly reduces the memory size in transfer routing information. Besides, it is proved through using 255 nodes that they require only 3.95 KB of memory size, which does not monopolize the throughput of a network.

[1]  Yezid Donoso,et al.  Multi-Objective Optimization in Computer Networks Using Metaheuristics , 2007 .

[2]  Srinivas Aluru,et al.  Scalable, memory efficient, high-speed IP lookup algorithms , 2005, IEEE/ACM Transactions on Networking.

[3]  Robert Chen-Hao Chang,et al.  Efficient IP routing table VLSI design for multigigabit routers , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[4]  Nian-Feng Tzeng,et al.  Concise Lookup Tables for IPv4 and IPv6 Longest Prefix Matching in Scalable Routers , 2012, IEEE/ACM Transactions on Networking.

[5]  Azzedine Boukerche,et al.  Routing protocols in ad hoc networks: A survey , 2011, Comput. Networks.

[6]  B.M. Ali,et al.  Existing MANET routing protocols and metrics used towards the efficiency and reliability- an overview , 2007, 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications.

[7]  Mahamod Ismail,et al.  Comparative Study of Variant Position-based VANET Routing Protocols , 2013 .

[8]  Gang Lu,et al.  S-AODV: Sink Routing Table over AODV Routing Protocol for 6LoWPAN , 2010, 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing.

[9]  S. Axler.  Linear Algebra Done Right , 1995, Undergraduate Texts in Mathematics.

[10]  H. Jonathan Chao,et al.  FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps , 2010, 2010 Proceedings IEEE INFOCOM.

[11]  Zhipeng Liu,et al.  A Routing Protocol Based on Adjacency Matrix in Ad Hoc Mobile Networks , 2008, 2008 International Conference on Advanced Language Processing and Web Information Technology.

[12]  Chonggun Kim,et al.  A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks , 2007, ICESS.

[13]  Hirozumi Yamaguchi,et al.  Message from Program Co-chairs , 2003, PADS.

[14]  Viktor K. Prasanna,et al.  Scalable Tree-Based Architectures for IPv4/v6 Lookup Using Prefix Partitioning , 2012, IEEE Transactions on Computers.