Topology sense and graph-based TSG: efficient wireless ad hoc routing protocol for WANET

Abd Alrazak Tareq Rahem1, Mahamod Ismail1, Ihab Ahmed Najm1, Mohammed Balfaqih1
1Department of Electrical, Electronics and Systems Engineering, Faculty of Engineering and Built Environment, National University of Malaysia UKM, Kajang, Malaysia

Tóm tắt

Technologies such as wireless ad hoc have undergone rapid redesigning. The routing protocol plays an essential role in improving the performance of wireless networks. However, improving the routing efficiency of a WANET still faces two main challenging issues: the routing table size and routing protocol selection criteria from the source to destination. This paper propose an efficient routing protocol using the Graph theory. In reviewing previous work, so far no research has represented routing information by a Triangular Matrix Table (TMT). TMT is based on the graph theory to save the entire network topology in a small memory size. Due to node movement or shut down, all neighboring nodes can detect that, namely, topology sense. The proposed Topology Sense and Graph-base (TSG) protocol relies on the topology change only. Node can send update message to all nodes by a distributor-cast mechanism, thus guaranteeing that every node gets one updating message. This mechanism depends on the TMT and Spanning Tree algorithm. The simulation results show that the TSG performs better than the conventional routing protocols. As a consequence, the throughput, delay time, packet loss, and overhead message are significantly improved as verified by NS3.

Từ khóa


Tài liệu tham khảo

Dutta, T. (2015). Medical data compression and transmission in wireless ad hoc networks. IEEE Sensors Journal, 15(2), 778–786. Leu, S., & Chang, R.-S. (2011). Simple algorithm for solving broadcast storm in mobile ad hoc network. Communications IET, 5(16), 2356–2363. Benamar, N., Singh, K. D., Benamar, M., El Ouadghiri, D., & Bonnin, J.-M. (2014). Routing protocols in vehicular delay tolerant networks: a comprehensive survey. Computer Communications, 48, 141–158, 7 15. Bekmezci, İ., Sahingoz, O. K., & Temel, Ş. (2013). Flying ad-hoc networks (FANETs): A survey. Ad Hoc Networks, 11(3), 1254–1270, 5. Akkaya, K., & Younis, M. (2005). A survey on routing protocols for wireless sensor networks. Ad Hoc Networks, 3(3), 325–349, 5. Sergiou, C., Vassiliou, V., & Paphitis, A. (2014). Congestion control in wireless sensor networks through dynamic alternative path selection. Computer Networks, 75, 226–238. Boukerche, A., Turgut, B., Aydin, N., Ahmad, M. Z., Bölöni, L., & Turgut, D. (2011). Routing protocols in ad hoc networks: A survey. Computer Networks, 55(13), 3032–3080, 9 15. Qabajeh, M., Abdalla, A., Khalifa, O., & Qabajeh, L. (2015). A survey on scalable multicasting in mobile ad hoc networks. Wireless Personal Communications, 80(1), 369–393, 01. Reina, D. G., Toral, S. L., Johnson, P., & Barrero, F. (2015). A survey on probabilistic broadcast schemes for wireless ad hoc networks. Ad Hoc Networks, 25, 263–292. Rojas-Cessa, R., Kijkanjanarat, T., Wangchai, W., Patil, K., & Thirapittayatakul, N. (2015). Helix: IP lookup scheme based on helicoidal properties of binary trees. Computer Networks, 89, 78–89, 10 4. Amiri, S. M. S., Malazi, H. T., & Ahmadi, M. (2016). Memory efficient routing using bloom filters in large scale sensor networks. Wireless Personal Communications, 86(3), 1221–1240. Lee, H., & Nakao, A. (2015). Improving routing table lookup in software routers. Communications Letters, IEEE, 19(6), 957–960. Kuo, F. C., Chang, Y. K., & Su, C. C. (2014). A memory-efficient TCAM coprocessor for IPv4/IPv6 routing table update. IEEE Transactions on Computers, 63(9), 2110–2121. Hoang, L., & Prasanna, V. K. (2012). Scalable tree-based architectures for IPv4/v6 lookup using prefix partitioning. IEEE Transactions on Computers, 61(7), 1026–1039. Chang, R. C., & Lim, B. H. (2004). Efficient IP routing table VLSI design for multigigabit routers. IEEE Transactions on Circuits and Systems, 51(4), 700–708. Tian, D. X., Zhou, J. S., Wang, Y. P., Zhang, G. H., & Xia, H. Y. (2016). An adaptive vehicular epidemic routing method based on attractor selection model. Ad Hoc Networks, 36, 465–481. Basso, C., Shedivy, D. A., Verrilli, C. B., Walk, B. M., & Wind, D. (2014). Cached routing table management. Google Patents. Liu, L., Zhang, N., & Liu, Y. (2015). Topology control models and solutions for signal irregularity in mobile underwater wireless sensor networks. Journal of Network and Computer Applications, 51, 68–90, 5. Johnson, D., Hu, Y., & Maltz, D. (2007). The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4. RFC, 4728 Axler, S. (1996). Linear algebra done right (Vol. 169). Berlin: Springer-Verlag. Joshi, R. D., & Rege, P. P. (2012). Implementation and analytical modelling of modified optimised link state routing protocol for network lifetime improvement. Communications, IET, 6(10), 1270–1277. Fan, Y., & Yuliang, T. (2014). Cooperative clustering-based medium access control for broadcasting in vehicular ad-hoc networks. Communications, IET, 8(17), 3136–3144.