An Enhanced Lightweight Proactive Source Routing Protocol using BFS and DFS for MANET

An Enhanced Light-weight Proactive Source Routing Protocol using BFS and DFS for MANET

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)
© 2014 by IJETT Journal
Volume-15 Number-5
Year of Publication : 2014
Authors : Rashmi Dewangan , Prof. Somesh Kumar Dewangan
  10.14445/22315381/IJETT-V15P250

Citation 

Rashmi Dewangan , Prof. Somesh Kumar Dewangan. "An Enhanced Light-weight Proactive Source Routing Protocol using BFS and DFS for MANET", International Journal of Engineering Trends and Technology (IJETT), V15(5),261-267 Sep 2014. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract

MANET is a self organized and self configurable network without existing infrastructure. It consists of several mobile wireless nodes. A routing protocol provides an efficient route between mobile nodes within the network. The discovery and maintenance of route should consume minimum overhead and bandwidth. In this paper, we introduce a novel Proactive Source Routing protocol that has a very small communication overhead. The proposed work is an efficient and improved light-weight proactive source routing protocol for MANETs that utilizes two common searching algorithms, called breadth first search (BFS) and depth first search (DFS) to discover the route. In such method, every node of the wireless network contains a neighbour table. Such table contains each node and its neighbours with distance between them. Therefore, each node has a full topology of the wireless network which is useful to discover the route. Periodic information exchange is used to update such table. We analyze the solution of routing in MANET and evaluate its performance using Network Simulator-2 (NS-2) under different network parameters.

References

[1] Z. Wang, Y. Chen, and C. Li, “CORMAN: a Novel Cooperative Opportunistic Routing Scheme in Mobile Ad Hoc Networks,” IEEE Journal on Selected Areas In Communications, Vol. 30, No. 2, February 2012, pp 289-296.
[2] Z. Wang, C. Li, and Y. Chen, “PSR: Proactive Source Routing in Mobile Ad Hoc Networks,” in Proceedings of the 2011 IEEE Conference on Global Telecommunications (GLOBECOM), Houston, TX USA, December 2011.
[3] Z. Wang, Y. Chen, and C. Li, “A New Loop-Free Proactive Source Routing Scheme for Opportunistic Data Forwarding in Wireless Networks,” IEEE Communications in 2012.
[4] Z. Wang, Y. Chen, and C. Li, “PSR: A Light-Weight Proactive Source Routing Protocol for Mobile Ad Hoc Networks,” in IEEE Transactions on Vehicular Technology, Vol. 63, No. 2, February 2014.
[5] Z. Wang, C. Li, and Y. Chen, “Local Cooperative Retransmission in Opportunistic Data Forwarding,” in 2012 IEEE International Conference on Communications (ICC).
[6] I. Chlamtac, M. Conti, and J.-N. Liu, “Mobile Ad hoc Networking: Imperatives and Challenges,” Ad Hoc Networks, vol. 1, no. 1, pp. 13–64, July 2003.
[7] R. Rajaraman, “Topology control and routing in ad hoc networks: A survey,” SIGACT News, vol. 33, pp. 60–73, June 2002.
[8] C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Computer Communication Review, pp. 234–244, October 1994.
[9] T. Clausen and P. Jacquet, “Optimized Link State Routing Protocol (OLSR),” RFC 3626, October 2003. [Online]. Available: http://www.ietf.org/rfc/rfc3626.txt
[10] D. B. Johnson, Y.-C. Hu, and D. A. Maltz, “On The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4,” RFC 4728, February 2007. [Online]. Available: http://www.ietf.org/rfc/rfc4728.txt
[11] C. E. Perkins and E. M. Royer, “Ad hoc On-Demand Distance Vector (AODV) Routing,” RFC 3561, July 2003. [Online]. Available: http://www.ietf.org/rfc/rfc3561.txt
[12] T. M. Cover and A. A. E. Gamal, “Capacity Theorems for the Relay Channel,” IEEE Transactions on Information Theory, vol. 25, no. 5, pp. 572–584, September 1979.
[13] A. Nosratinia, T. E. Hunter, and A. Hedayat, “Cooperative Communication in Wireless Networks,” IEEE Communications Magazine, vol. 42, no. 10, pp. 74–80, October 2004.
[14] S. Biswas and R. Morris, “ExOR: Opportunistic Multi-Hop Routing for Wireless Networks,” in Proceedings of ACM Conference of the Special Interest Group on Data Communication (SIGCOMM), Philadelphia, PA, USA, August 2005, pp. 133–144.
[15] P. Larsson, “Selection Diversity Forwarding in a Multihop Packet Radio Network With Fading Channel and Capture,” ACM Mobile Computing and Communications Review, vol. 5, no. 4, pp. 47–54, October 2001.
[16] E. Rozner, J. Seshadri, Y. Mehta, and L. Qiu, “Simple Opportunistic Routing Protocol for Wireless Mesh Networks,” in Proceedings of the 2nd IEEE Workshop on Wireless Mesh Networks (WiMesh), Sep. 2006, pp. 48–54.
[17] M. Kurth, A. Zubow, and J.-P. Redlich, “Cooperative Opportunistic Routing Using Transmit Diversity in Wireless Mesh Networks,” in Proceedings of the 27th IEEE International Conference on Computer Communication (INFOCOM), Apr. 2008, pp. 1310–1318.
[18] M. Naghshvar and T. Javidi, “Opportunistic Routing with Congestion Diversity in Wireless Multi-hop Networks,” in Proceedings of the 29th IEEE International Conference on Computer Communication (INFOCOM). Piscataway, NJ, USA: IEEE Press, 2010, pp. 496–500.
[19] K. Zeng, Z. Yang, and W. Lou, “Opportunistic Routing in Multi-Radio Multi-Channel Multi-Hop Wireless Networks,” in Proceedings of the 29th IEEE International Conference on Computer Communication (INFOCOM). Piscataway, NJ, USA: IEEE Press, 2010, pp. 476–480.
[20] S. Yang, F. Zhong, C. K. Yeo, B. S. Lee, and J. Boleng, “Position Based Opportunistic Routing for Robust Data Delivery in MANETs,” in Proceedings of the 2009 IEEE Conference on Global Telecommunications (GLOBECOM), Honolulu, Hawaii, USA, December 2009, pp. 1325–1330.
[21] Z. Zhong and S. Nelakuditit, “On the Efficacy of Opportunistic Routing,” in Proceedings of the 4th IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), Jun. 2007, pp. 441–450.
[22] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading Structure for Randomness in Wireless Opportunistic Routing,” in Proceedings of ACM Conference of the Special Interest Group on Data Communication (SIGCOMM), Kyoto, Japan, August 2007, pp. 169–180.
[23] D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris, “A High-Throughput Path Metric for Multi-Hop Wireless Routing,” in Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MobiCom), San Diego, CA, USA, 2003, pp. 134–146.
[24] J. Ma, Q. Zhang, C. Qian, and L. M. Ni, “Energy-Efficient Opportunistic Topology Control in Wireless Sensor Networks,” in Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking (MobiOpp). New York, NY, USA: ACM, 2007, pp. 33–38.
[25] I. Leontiadis and C. Mascolo, “GeOpps: Geographical Opportunistic Routing for Vehicular Networks,” in Proceedings of the IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM), Helsinki, Finland, June 2007, pp. 1–6.
[26] B. Radunovi?, C. Gkantsidis, P. Key, and P. Rodriguez, “An Optimization Framework for Opportunistic Multipath Routing in Wireless Mesh Networks,” in Proceedings of the 27th IEEE International Conference on Computer Communication (INFOCOM), Apr. 2008, pp. 2252–2260.
[27] D. Koutsonikolas, C.-C. Wang, and Y. C. Hu, “CCACK: Efficient Network Coding Based Opportunistic Routing through Cumulative Coded Acknowledgments,” in Proceedings of the 29th IEEE International Conference on Computer Communication (INFOCOM). Piscataway, NJ, USA: IEEE Press, 2010, pp. 2919–2927.
[28] R. C. Shah, S. Wietholter, A.Wolisz, and J. M. Rabaey, “When does Opportunistic Routing Make Sense?” in Proceedings of the 3rd Annual IEEE International Conference on Pervasive Computing and Communications (PerCom), Mar. 2005, pp. 350–356.
[29] J. Kim and S. Bohacek, “A Comparison of Opportunistic and Deterministic Forwarding in Mobile Multihop Wireless Networks,” in Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking (MobiOpp). New York, NY, USA: ACM, 2007, pp. 9–16.
[30] K. Zeng, W. Lou, and H. Zhai, “On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks,” in Proceedings of the 27th IEEE International Conference on Computer Communication (INFOCOM), Apr. 2008, pp. 816–824.
[31] L. Cerda-Alabern, V. Pla, and A. Darehshoorzadeh, “On the Performance Modeling of Opportunistic Routing,” in Proceedings of the 2nd International Workshop on Mobile Opportunistic Networking (MobiOpp). New York, NY, USA: ACM, 2010, pp. 15–21.
[32] M.-H. Lu, P. Steenkiste, and T. Chen, “Video Transmission over Wireless Multihop Networks Using Opportunistic Routing,” in Proceedings of the 16th IEEE International Packet Video Workshop (PV), Nov. 2007, pp. 52–61.
[33] F. Wu, T. Chen, S. Zhong, L. E. Li, and Y. R. Yang, “Incentive-Compatible Opportunistic Routing for Wireless Networks,” in Proceedings of the 14th ACM International Conference on Mobile Computing and Networking (MobiCom). New York, NY, USA: ACM, 2008, pp. 303–314.
[34] J. J. Garcia-Luna-Aceves and S. Murthy, “A Path-Finding Algorithm for Loop-Free Routing,” IEEE/ACM Transactions on Networking, vol. 5, pp. 148–160, February 1997.
[35] J. Behrens and J. J. Garcia-Luna-Aceves, “Distributed, Scalable Routing based on Link-State Vectors,” in Proceedings of ACM SIGCOMM, 1994, pp. 136–147.
[36] K. Levchenko, G. M. Voelker, R. Paturi, and S. Savage, “XL: An Efficient Network Routing Algorithm,” in Proceedings of ACM SIGCOMM, 2008, pp. 15–26.
[37] S. Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” Mobile Networks and Applications, vol. 1, no. 2, pp. 183–197, October 1996.
[38] J. J. Garcia-Luna-Aceves and M. Spohn, “Source-Tree Routing in Wireless Networks,” in Proceedings of the 7th Annual International Conference on Network Protocols (ICNP’99), Toronto, Canada, October 1999, pp. 273–282.
[39] X. Yu, “Distributed Cache Updating for the Dynamic Source Routing Protocol,” IEEE Transactions on Mobile Computing, vol. 5, no. 6, pp. 609–626, June 2006.
[40] Y.-C. Hu and D. B. Johnson, “Implicit Source Routes for On-Demand Ad Hoc Network Routing,” in Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’01), Long Beach, CA, USA, October 2001, pp. 1–10.
[41] B. Hu and H. Gharavi, “DSR-Based Directional Routing Protocol for Ad Hoc Networks,” in Proceedings of the 2007 IEEE Conference on Global Telecommunications (GLOBECOM), Washington D.C., DC USA, November 2007, pp. 4936–4940.

Keywords
MANET, NS-2, Routing protocols, BFS, DFS, PSR, DSDV, AODV, OLSR, DSR.