JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.

ORG

89

Implementation of Core Based Tree Protocols for Mobile Adhoc Networks

Rahul Malhotra, Karandeep Singh
Abstract Data communication and networking is the fastest growing technology in the modern era. The emergence of various network communication technologies has paved the way for various researchers to explore this field due to the need of the common man as well as the industry. Different network routing protocols have been developed to ensure reliability, communication speed, better transfer rates and security of the network. This paper implements the Core based routing protocol for adhoc networks. A core-based tree has a single node or router, known as the core of the tree, from which branches emanate. These branches are made up of non-core routers, which form a shortest path between a member-hosts directly attached router, and the core. The different parameters of the network namely bandwidth, delay, traffic sent, traffic received and traffic dropped, network load and routing tables are analyzed for the better understanding of the network utilization. Index Terms Bandwidth, Core Based Tree Protocol, Delay, Mobile Adhoc Networks, Performance.

1 INTRODUCTION
HE fast growing use of information and communication technologies has resulted in bridging the gap between the different areas of the world and the world is witnessing a change in the use of resources around it. As the world has become a global village, most of the countries are reaping the benefit of economies of scale, that is, the commodities which are in abundance at one place are being transferred to other places where there is a need for those commodities. This has resulted in use of communication technologies for order processing, delivery and for the smooth functioning of the whole supply chain. The need of this communication technology has attracted the various researchers to put a step forward to increase the efficiency of these networks. The different concerned issues include reliability, communication speed, better transfer rates, security etc.

for most efficient and robust network designing. The parameters or attributes for comparison of different scenarios are selected after the creation of network model. Physical and logical attributes can be varied either for complete network or individual devices connected to it. The networks can be tested for different conditions by isolating some network part or by deactivating crucial network links. The simulation time can be adjusted for better understanding of parameters behavior and for desired performance of the network.

3 SIMULATION OF CORE BASED TREE USING OPNET

Core-based tree (CBT) architecture or centre-based forwarding trees were first described by Wall used a single centre-based forwarding tree to investigate low-delay broadcasting and selective-broadcasting. In the core 2 NETWORK SIMULATOR OPNET based tree architecture it was noted that to minimize the Optimized network engineering tool OPNET modeler is delay for each broadcast if we use just one tree is not the commercial network simulator tool that works on possible, but it may be able to do fairly well, and the simpseudo random number generator (PRNG) algorithm for plicity of the scheme may well make up for the fact that it carrying out simulations. The tool provides a graphical is no longer optimal. A core-based tree then, involves user interface (GUI) and works on Windows and UNIX having a single node, in our case a router (with additional platforms. It supports three levels of modeling viz. routers for robustness), known as the core of the tree, process level for analyzing different networking objects, from which branches emanate. These branches are made node level that helps to connect objects to form a commu- up of other routers, so-called non-core routers, which nicating device, network level to build network of com- form a shortest path between a member-hosts directly municating devices and project level that beholds differ- attached router, and the core, A router at the end of a ent scenarios of same network and helps comparing them branch shall be known as a leaf router on the tree. Unlike Walls trees, the core need not be topologically centred4 between the nodes on the tree, since multicasts vary in Rahul Malhotra is with the Department of Electronics and Communication nature, and correspondingly, so can the form of a coreEngineering, Bhai Maha Singh College of Engineering, Muktsar, Punjab, based tree. The key architectural features which drive the India. CBT approach Scaling, Unicast routing separation and Karandeep Singh is with the Department of Microelectronics, Bhai Maha Singh College of Engineering, Muktsar, Punjab, India. Core Selection In this work, OPNET is used to develop core based tree protocol and to analyze its performance in terms of

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

90

Ethernet Delay, Ethernet Load, Ethernet traffic received at different nodes. The Traffic received with respect to traffic sent and traffic dropped is also analyzed for routers incorporated in core based tree protocol. Further, Routing tables and its successive additions are also analyzed for different routers available in the network using OPNET. The utilization of Ethernet channel factor for different routers in the network for inbound and outbound traffic was also analyzed. The above parameters were also tested by increasing the network load in terms of nodes.
Fig. 4. shows the Traffic Received for the different nodes of network1.

Fig. 1. shows Network1 for CBT.

In the Scenario, PC1 is connected to Router1, PC2 is connected to Router2, PC3 is connected to Router3 and PC4 is connected to Router4. Router1 is connected to PC1. Router2 is connected to Router1 and Router3 and Router3 is connected to Router4.

Fig. 5. shows the comparison of Traffic sent, Traffic received and traffic dropped for router1 of network1.

Fig. 6. shows the comparison of Traffic sent, Traffic received and traffic dropped for router2 of network1.

Fig. 2. shows the Ethernet load for different nodes of the network1.

Fig. 7. shows the comparison of Traffic sent, Traffic received and traffic dropped for router3 of network1. Fig. 3. shows the Ethernet delay for different nodes of the network1.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617 http://sites.google.com/site/journalofcomputing/

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

91

Fig. 8. shows the comparison of Traffic sent, Traffic received and traffic dropped for router4 of network1.

Fig. 12. shows the comparison of Inbound and outbound utilization of Ethernet channel for router1 of network1.

Fig. 13. shows the comparison of Inbound and outbound utilization of Ethernet channel for router2 of network1. Fig. 9. shows the total number of updates for the routing table for different routers in the network1.

Fig. 10. shows the size of routing table for different routers in the network1.

Fig. 14. shows the comparison of Inbound and outbound utilization of Ethernet channel for router3 of network1.

Fig. 11. shows the number of route additions in routing table for different routers in the network 1.

Fig. 15. shows the comparison of Inbound and outbound utilization of Ethernet channel for router4 of network1.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617 http://sites.google.com/site/journalofcomputing/

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

92

Fig. 16. shows the the Network2 of CBT. Fig. 20. shows the comparison of Traffic sent, Traffic received and traffic dropped for router1 of network2.

Fig. 17. shows the Ethernet load in bits/sec for different nodes of the network2. Fig. 21. shows the comparison of Traffic sent, Traffic received and traffic dropped for router2 of network2.

Fig. 18. shows the Ethernet Delay in bits/sec for different nodes of the network2.

Fig. 22. shows the comparison of Traffic sent, received and dropped for router3 of network2.

Fig. 19. shows the Ethernet traffic received in bits/sec for different nodes of the network2.

Fig. 23. shows the comparison of Traffic sent, received and dropped by router4 of network2.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617 http://sites.google.com/site/journalofcomputing/

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

93

Fig. 24. shows the total number of updates for the routing table for different routers in the network2.

Fig. 28. shows the comparison of Ethernet traffic received for PC2 of network1 and network2.

Fig. 25. shows the size of routing table for different routers in the network2.

Fig. 29. shows the comparison of Traffic sent for router2 of network1 and network2.

The Figures 26 to 34 show the Comparative Analysis of network1 and network2 for the different parameters comparing the results for each common node of both the networks.

Fig. 30. shows the comparison of Traffic received for router2 of network1 and network2.

Fig. 26. shows the comparison of Ethernet delay for PC2 of network1 and network2.

Fig. 31. shows the comparison of Traffic dropped for router2 of network1 and network2. Fig. 27. shows the comparison of Ethernet Load for PC2 of network1 and network2.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617 http://sites.google.com/site/journalofcomputing/

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

94

Fig. 32. shows the comparison of Total number of updates of routing table for router2 of network1 and network2.

Fig. 33. shows the comparison of Inbound utilization of Ethernet channel for router2 of network1 and network2.

Fig. 34. shows the comparison of outbound utilization of Ethernet channel for router2 of network1 and network2.

4 RESULTS AND ANALYSIS

In this work, the two different networks namely network1 and network2 have been designed. In the network1 (Scenario1), PC1 is connected to Router1, PC2 is connected to Router2, PC3 is connected to Router3 and PC4 is connected to Router4. Router1 is connected to PC1. Router2 is connected to Router1 and Router3 and Router3 is connected to Router4. The different parameters of these networks viz. Ethernet Delay, Ethernet Load, Ethernet traffic received at different nodes have been compared. The Traffic received with respect to traffic sent and traffic dropped is also analyzed for routers incorporated in core based tree protocol. Further, Routing table parameters

viz. number of updates, size of routing table and successive additions of routes were also analyzed for different routers available in the network using OPNET. The utilization of Ethernet channel factor for different routers in the network for inbound and outbound traffic was also analyzed. The above parameters were also tested by increasing the network load in terms of nodes for network2. The comparison of the network1 and network2 shows that the Ethernet delay for different nodes in the network 2 is more than network1 due to the increase in number of nodes of the network. Similarly Ethernet load for different nodes in the network is also compared which shows that, the network load at start of the simulation process was more in network1 as compared to network2 but in the process the network load for network2 increases for some time and again reduces due to sharing of network load by increased number of nodes in network2. Similarly, as the number of nodes in network2 is increased the amount of traffic received by the node also increases in comparison with network1, because of increase in the number of transmitting and receiving nodes. The comparison of Traffic sent through different routers in the network1 and network2 shows that the traffic sent in the network2 is more than network1, which is due to the increase in number of transmitting and receiving nodes in the network2. The comparison of Traffic received by different routers in the network1 and network2 shows that the traffic received for the network2 is more than network1, which is also due to the increase in number of transmitting and receiving nodes in the network2. The comparison of Traffic dropped through different routers in the network1 and network2 shows that the traffic dropped by routers in the network1 is considerably more as compared with network2, which shows that due to less number of receiving nodes in the network, large portion of network bandwidth remains unutilized in network1 as compared to network2. The comparison of total number of updates for routing table for network1 and network2 shows that the number of updates for network2 were more as compared to network1, which again shows that when the number connected nodes in the network is increased, the network traffic parameters enhance. The comparison of inbound and outbound utilization of Ethernet channel for both the networks shows that when the number connected nodes in the network is increased, the utilization of bandwidth for the network is increased..

4 CONCLUSIONS
The performance of core based tree protocol for mobile adhoc network is analyzed in terms of bandwidth utilization in the network using network Simulator OPNET. The different network performance parameters viz. network delay, network load, network traffic received, inbound and outbound traffic through switch, IP traffic sent and received of the designed core based tree protocol have been analyzed. It has been observed from the results that

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617 http://sites.google.com/site/journalofcomputing/

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

95

when network load is increased, the network bandwidth is utilized in a appropriate manner due to the increase in number of packets. Further, when the nodes are increased according to the capacity of the network medium, the rate of transfer in the network starts decreasing, that is the delay, network load and traffic in the networks tend to increase.

[14]

[15]

REFERENCES
[1] Weijia Jia, Wei Zhao, Dong Xuan, Gaochao Xu (1999), An efficient fault-tolerant multicast routing protocol with core-based tree techniques, IEEE Transactions on Parallel and Distributed Systems, Vol. 10, Issue 10, pp.984 1000. Dong Xiang, Ye Zhang (2011), Cost-Effective Power-Aware Core Testing in NoCs Based on a New Unicast-Based Multicast Scheme, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 30, Issue 1, pp.135 147. Abhishek Ghose, Jens Grossklags, John Chuang (2003), Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks, Springer Lecture Notes in computer science on Mobile Data Management, Vol. 2574 , pp. 45-62. Amit Jardosh, Elizabeth M. Belding-Royer, Kevin C. Almerothm, Subhash Suri (2003), Towards realistic mobility models for mobile ad hoc networks, Proceedings of the 9th annual international conference on Mobile computing and networking, Pages 217 - 229. Anand Srinivas, Eytan Modiano (2003), Minimum energy disjoint path routing in wireless ad-hoc networks, Proceedings of the 9th annual international conference on Mobile computing and networking, pp. 122 - 133. Andre Oliveira , Zhili Sun , Philippe Boutry , Diego Gimenez , Antonio Pietrabissa , Katja Juros (2011), Internetworking and wireless ad hoc networks for emergency and disaster relief services, International Journal of Satellite Communications Policy and Management, Vol.1, pp. 1 14. Chakrabarti, S, Mishra, A (2001), QoS issues in ad hoc wireless networks, IEEE Communications Magazine, vol. 39, Issue 2, pp 142 148. Drago Niculescu, Badri Nath (2003), DV Based Positioning in Ad Hoc Networks Informatik University journal of Telecommunication Systems,Vol. 22, pp.1-4, 267-280. Ergen M, Puri A (2002), MEWLANA-mobile IP enriched wireless local area network architecture, Proceedings of Vehicular Technology, vol.4, pp. 2449-2453. Estrin D,Girod L, Pottie G, Srivastava M.(2001), instrumenting the world with wireless sensor networks, Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, vol.4, pp. 2033 2036. Felegyhazi M, Hubaux J.P., Buttyan L (2006), Nash equilibria of packet forwarding strategies in wireless ad hoc networks, IEEE Transactions on Mobile Computing, vol. 5, Issue 5, pp. 463 476. Haykin, S (2005), Cognitive radio: brain-empowered wireless communications, IEEE Journal on Selected Areas in Communications, vol. 23, Issue 2, pp. 201 220. Jahangir khan, Nazir Shah Khattak and Hamid Jan (2011), A step of Mobile Ad-Hoc on-demand Routing Protocols towards

[16]

[17]

[2]

[18]

[3]

[19]

[4]

[20]

[5]

[21]

[6]

[22]

[23]

[7]

[24]

[8]

[9]

[25]

[10]

[26]

[11]

[27]

4G Cellular networks in International Journal of Computer Applications, Number 6, Article 4 pp:2024. Jang-won Lee, Mung Chiang, A. Robert Calderbank (2006), Jointly optimal congestion and contention control in wireless ad hoc, IEEE journal of Communication , vol.10, pp. 216218. Jing Deng, Richard Han, Shivakant Mishra (2006), INSENS: Intrusion-tolerant routing for wireless sensor networks, journal of Computer Communications, Vol. 29, Issue 2, pp. 216-230. Joseph P Macker, M. Scott Corson (1998), Mobile ad hoc networking and the IETF, Newsletter of ACM Special Interest Group on Management of Data, vol.2, Issue 1, pp. 9 - 14. Kawadia, V, Kumar, P.R (2005),Principles and protocols for power control in wireless ad hoc networks, IEEE Journal on Selected Areas in Communications, Vol. 23 Issue 1, pp. 76 - 88. Khushboo Tripathi, Manjusha Pandey, Shekhar Verma (2011), Comparison of reactive and proactive routing protocols for different mobility conditions, Proceedings of International Conference on Communication, Computing & Security, pp. 156-161. Lei Wang, Lianfang Zhang, Yantai Shu, Miao Dong (2000), Multipath source routing in wireless ad hoc networks, IEEE Conference on Electrical and Computer Engineering, vol.1, pp 479 483. Leslie D. Fife, Le Gruenwald (2003), Research issues for data communication in mobile ad-hoc network database systems, Newsletter of ACM Special Interest Group on Management of Data Vol. 32 Issue 2, pp. 42 47. Matthias Grossglauser, David N. C. Tse (2002), Mobility increases the capacity of ad hoc wireless networks IEEE/ACM Transactions on networking , vol.10, Issue 4, pp. 477 486. Mauve, M., Widmer, A, Hartenstein, H. (2001), A survey on position-based routing in mobile ad hoc networks , IEEE journal of Network, vol. 15, issue 6, pp 30 39. Mian, A.N., Baldoni, R., Beraldi, R. (2009), A Survey of Service Discovery Protocols in Multihop Mobile Ad Hoc Networks, IEEE journal of Pervasive Computing, Vol. 8, Issue. 1, PP. 66 74. Mike Just, Evangelos Kranakis, Tao Wan (2003), Resisting Malicious Packet Dropping in Wireless Ad Hoc Networks, Springer Lecture Notes in Computer Science on Ad-Hoc, Mobile, and Wireless Networks , Vol. 2865, pp.151-163. Mishra, A., Nadkarni, K., Patcha A., (2004), Intrusion detection in wireless ad hoc networks in Wireless Communications, IEEE Journal of Wireless Communications, vol.11, Issue 1, pp. 48 60. Ruay-Shiung Chang, Wei-Yeh Chen, Yean-Fu Wen (2003), Hybrid wireless network protocols, IEEE Transactions on Vehicular Technology, vol. 52, Issue 4, pp.1099 1109. Savarese, C Rabaey, J.M, Beutel J. (2001), Location in distributed ad-hoc wireless sensor networks, Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 4, pp 2037 2040.

[12]

[13]

2011 Journal of Computing Press, NY, USA, ISSN 21519617 http://sites.google.com/site/journalofcomputing/

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

96

Rahul Malhotra has received his Bachelor of Engineering Degree in Electronics & Communication Engineering from Baba Saheb Naik College of Engineering, Pusad under Amravati University, Amravati - India in 2001 and M.Tech degree in Electronics & Communication Engineering from Giani Zail Singh College of Engineering & Technology, Bathinda, India in 2008 and Ph.D in Electronics and Communication Engineering from Punjab Technical University, Jalandhar in 2011. He joined as a Lecturer in 2001 at Guru Gobind Singh College of Engineering & Technology, Talwandi Sabo, India. He joined as Assistant Professor in Adesh Institute of Engineering & Technology, Faridkot, India in 2008. Presently, He is working as Associate Professor at BMS College of Engineering, Muktsar. His area of interest includes Wireless Communication, Adhoc Networks, and Fuzzy Logic & Genetic Algorithms. He is a member of Indian Society for Technical Education, The Institution of Electronics & Telecommunication Engineers (India), Institution of Engineers (India)

Karandeep Singh obtained Bachelor of Engineering from Adesh Institute of Engienering & Technology, Faridkot (Punjab Technical University, Jalandhar) in Year 2009 and presently pursuing Master of Technology in Microelectronics from BMS College of Engineering, Muktsar. His areas of interest include Wireless networks, Micro-controller systems, Adhoc Networks and Micro-electronics etc.