Implementation of Hybrid Ad-Hoc Routing Protocol S. Swapna Kumar

Department of Computer Science & Engineering Sahrdaya College of Engineering & Technology,

Trichur, Kerala sswapnakumar@aol.com

Dr. M. Nanda Kumar, Dr. Sheeba V.S Department of Electrical Engineering, Department of

Electronics & Communication Engineering, Government Engineering College, Trichur, Sreekrishnapuram, Kerala

mnkumar.tcr@gmail.com sheebavs@gmail.com

Abstract: -- The goal of this application is to implement a hybrid ad-hoc routing protocol, using the 802.11 wireless protocols. Our implementation enables communication between several wireless stations, on a dynamic network without using any infrastructure, i.e. using peer-to-peer mode, rather than Access Points. Two distant units can communicate even when there is no direct connection between them. We have implemented the Direct Sequence Distance Vector (DSDV) algorithm, which is a pro-active table driven algorithm in Wireless Network. The routing in each station is executed according to local routing table. The tables are continually maintained and updated. We developed the application in Java, which has inherent support for network operations. Thus, it is platform independent, and can run with various OS and wireless cards. In order to demonstrate the operation of the algorithm we wrote a Unicode Short Message Text (USMT) application that uses the routing protocol services as a sub-layer. The USMT application enables sending of text messages from any unit to any other unit in the network. It also graphically presents the local routing tables information.

Keywords: AODV, DSDV, MANET, Wireless Ad-hoc Network, Test-bed for Ad-hoc implementation

I. INTRODUCTION Simulation is an important tool in the development of MANET as well as in certain dynamic applications of wireless sensor networks; it provides an excellent environment to experiment and verify routing protocol correctness. However, simulation does not guarantee that the protocol works in practice, because simulators contain assumptions and simplified models that may not actually reflect real network operation. After a protocol is thoroughly tested in simulation, an implementation is the logical next step. A working implementation is necessary to validate that the routing protocol specification performs under real conditions. Otherwise, assumptions made by the protocol design cannot be verified as correct. Additionally, an implementation can be used to perform test bed and field tests. Eventually it can be used in a deployed system. Creating a working implementation of an ad-hoc routing protocol is non-trivial and more difficult than developing a simulation. In simulation, the developer controls the whole system, which is in effect only a single component. An implementation, on the other hand, needs to interoperate with a large, complex system. Some components of this system are the operating system, sockets, and network interfaces. Additional implementation

problems surface because current operating systems are not built to support ad-hoc routing protocols. A number of required events are unsupported; support for these events must be added. Because these events encompass many system components, the components and their interactions must also be explored. For these reasons it takes significantly more effort to create an ad hoc routing protocol implementation than a simulation

II. PROBLEM STATEMENT To date, the majority of ad-hoc routing protocol research

has been done using simulation only. One of the most motivating reasons to use simulation is the difficulty of creating a real implementation. In a simulator, the code is contained within a single logical component, which is clearly defined and accessible. On the other hand, creating an implementation requires use of a system with many components, including many that have little or no documentation. The implementation developer must understand not only the routing protocol, but all the system components and their complex interactions. Further, since ad hoc routing protocols are significantly different from traditional routing protocols, a new set of features must be introduced to support the routing protocol. In this paper we describe the event triggers required for AODV operation [1], the design possibilities and the decisions for our Ad hoc On-demand Distance Vector (AODV) routing protocol implementation, AODV-DSDV. This paper is meant to aid researchers in developing their own on-demand ad hoc routing protocols and assist users in determining the implementation design that best fits their needs.

III. MOTIVATION Till date, the majority of ad-hoc routing protocol research has been done using simulation only. One of the most motivating reasons to use simulation is the difficulty of creating a real implementation. In a simulator, the code is contained within a single logical component, which is clearly defined and accessible. On the other hand, creating an implementation requires use of a system with many components, including many that have little or no documentation. The implementation developer must understand not only the routing protocol, but all the system components and their

2010 International Conference on Advances in Recent Technologies in Communication and Computing

978-0-7695-4201-0/10 $26.00 © 2010 IEEE

DOI 10.1109/ARTCom.2010.14

151

complex interactions. Further, since ad-hoc routing protocols are significantly different from traditional routing protocols, a new set of features must be introduced to support the routing protocol.

IV. AIM The goal of this application is a real-time implementation of an ad-hoc routing protocol, using the 802.11 wireless protocols. Our implementation enables communication between several wireless stations or hops, on a dynamic network without using any infrastructure, i.e. using peer-to-peer mode, rather than Access Points. Two distant units can communicate even when there is no direct connection between them. The application is planned to implement two potential algorithms: • Direct Sequence Distance Vector (DSDV) algorithm,

which is a pro-active table driven algorithm. The routing in each station is executed according to local routing table. The tables are continually maintained and updated.

• Ad-hoc on demand Distance Vector (AODV) algorithm, which is a reactive algorithm, which operates only then there is demand from upper layer to send data.

We chose to write the application in Java, which has inherent support for network operations. Thus, it is platform independent, and can run with various OS and wireless cards.

V. TECHNICAL CHALLENGE Developing a working implementation of an ad-hoc routing protocol is non-trivial and more difficult than developing a simulation. In simulation, the developer controls the whole system, which is in effect only a single component. An implementation, on the other hand, needs to interoperate with a large, complex system. Some components of this system are the operating system, sockets, and network interfaces. Additional implementation problems surface because current operating systems are not built to support ad-hoc routing protocols. A number of required events are unsupported; support for these events must be added. Because these events encompass many system components, the components and their interactions must also be explored. For these reasons it takes significantly more effort to create an ad-hoc routing protocol implementation than a simulation.

VI. PROPOSED SYSTEM The prototype design we are researching on is a windows application which runs on the wireless ad-hoc network. The application is planned to implement two potential algorithms: Direct Sequence Distance Vector (DSDV) algorithm, which is a pro-active table driven algorithm. The routing in each station is executed according to local routing table. The tables are continually maintained and updated. Ad-hoc on demand Distance Vector (AODV) algorithm as done in [1], which is a reactive algorithm, which operates only when there is demand

from upper layer to send data. We chose to write the application in Java, which has inherent support for network operations. Thus, it is platform independent, and can run with various OS and wireless cards [2]. Other functionalities of the application work includes auto configuration of hops for Middleware, Remote Hop Drive Mapping and host adding, File sharing with FTP [3] with statistical transfer ratio and time detection, Transfer of Unicode Short Message Text to the destination hop, Strategic data analysis of Hop sequence, metric sequence number, lifetime, type, Detecting configuration with respect to header information, size of data packets, buffer size when reading file.

VII. APPLICATION ARCHITECTURE: The architecture of the application work is shown as below in Figure 1.

Figure 1 Overall Architecture-I

VIII. EXPERIMENTAL TEST BED The application work as planned is designed on Java platform with a requirement of normal windows XP professional version. The hardware requirement specification for the experimental real time test bed is Pentium 4 Processor with min of 2 GB RAM just like [4]. For the set up purpose, the experiment will be conducted in wireless infrastructure using particular Net Gear product of WLAN card in each node system. The application is installed in almost 20 computers for analyze. The protocol implementation was developed on the windows. The application work is developed in Net Beans IDE and Java Swing is probably the most advanced toolkit. It has a rich set of widgets. From basic widgets like Buttons, Labels, Scrollbars to advanced widgets like Trees and Tables. Swing is written in 100% java. Swing is a part of JFC, Java Foundation Classes. Following are the test result for the file transfer that is observed during the hop sequence in ad-hoc network scenario. Here three nodes in ad-hoc mode created and the file transfer in different size transmitted for the analysis. CPU performance, shown in Figure 2 represents the CPU performance during the transfer at

152

the varying node movement at two conditions. It has been observed that under the wireless network link speed of 11 Mbps having utilization of 0.03% the CPU usage percentage increase during the loading and simultaneous full duplex transfer mode.

Figure 2 CPU performance

We measured the overall system throughput and the result for different size of files. In the Throughput vs. time, shown in

Figure 3 Throughput vs. time

Figure 4 System Architecture-II

The overall architecture is modified to the system architecture is shown in Fig 4. The message transfer with the IP address & nodes hop is clearly defined for optimum performance.

IX. CONCLUSION There are a number of application areas for ad-hoc networks. Personal Area Networks (PANs) are formed between various mobile (and immobile) devices mainly in an ad-hoc manner, e.g. for creating a home network. They can remain an autonomous network, interconnecting various devices, at home, for example, but PANs will become more meaningful when connected to a larger network. In this case, PANs can be seen as an extension of the telecom network or Internet. Closely related to this is the concept of ubiquitous / pervasive computing where people, noticeable or transparently will be in close and dynamic interaction with devices in their surroundings.

• Sensor networks can be used for environmental monitoring. They can be used to collect various types of data, e.g. temperature, humidity, and vibration. Applications are the measurement of ground humidity for agriculture, forecast of earthquakes, or monitoring the progress of bushfires.

• Ad-hoc networks formed by users near a hotspot could extend that hotspot’s coverage. Hotspot coverage is often limited in densely built areas. Their extension would enable other users to get access even if they are not in direct reach.

• Automotive networks are widely discussed currently. Cars should be enabled to talk to the road, to traffic lights, and to each other, forming ad-hoc networks of various sizes. The network will provide the drivers with information about road conditions, congestions, and accident-ahead warnings, helping to optimize traffic flow.

• Last but not least, military applications should be mentioned. They exploit the ability of ad-hoc networks to work in situations where there is no pre-installed infrastructure available, as in combat areas. Rescue operations in remote areas would also be facilitated.

In summary, ad-hoc networks have the potential to become a serious part of tomorrows 4G communications networks. They can open up new business opportunities for network operators and service providers. However, there are still a lot of technical challenges that need to be solved in order to guarantee a certain service quality and to enable charging of service usage

X. FUTURE WORK

Ad-hoc networking is rather a hot concept in the field of computer communication. This means that there is much research going on many issues that remains to be solved. Due to limited time, we have focused on routing protocols.

153

However, there are issues that could be subjected to the future analysis. • More routing protocols like, for instance like TORA,

ZRP, CBRP. • Measurement of computing complexity. • Some sort of analysis whether many small control

messages are more costly to send in terms of resources than fewer large control messages.

• Quality of Service (QoS): Quality of Service (QoS) in an ad-hoc network is related to what the networks actually will be used for.

• Connecting ad-hoc networks to the internet through the access point to just add the access point as default in the routing tables. This would mean that the nodes without a route to a certain destination would be routed to the internet.

• Mobile IP: Integration of mobile IP into the ad-hoc networks.

• Addressing of host: The method to address host in an ad-hoc network. To study if one network is partitioned in two separate networks or two ad-hoc networks are merged into one new ad-hoc network.

REFERENCE

[1] Minseok Oh, An Adaptive Routing Algorithm for Wireless Mesh Networks, Wavelet Analysis and Pattern Recognition, ICWAPR'08. International Conference on Publication Date: 30-31 Aug. 2008 [2] Yan Gao, Danyan Luo, Decheng Zuo, Xiaozong Yang, Research on Routing Protocol of Wireless Ad Hoc Network Based on Wearable Computers, International Symposium on Computer Science and Computational Technology, 2008 [3] Charles E perkin, Pravin Bhagwat, Highly dynamic destination-sequenced distance vector routing for mobile computers,ACM 1994 [4] Sang Ho Bae, Sung-Ju Lee, and Mario Gerla, Multicast Protocol Implementation and Validation in an Ad hoc Network Testbed, Intel and the Defense Advanced Research Projects Agency (DARPA), 2008 [5] C. Gomez, P. Salvatella, O. Alonso, J. Paradells, Adapting AODV for IEEE 802.15.4 Mesh Sensor Networks: Theoretical Discussion and Performance Evaluation in a Real Environment in the Proceedings of the International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'06), 2006 [6] Daming Feng & Yanqin Zhu An Improved AODV Routing Protocol Based on Remaining Power and Fame in the International Conference on Electronic Computer Technology, 2009 [7] A. Nagaraju,, S. Ramachandram,, B. Eswar, "Performance of Dominating and Adaptive Partial Dominating Sets in AODV Routing protocol for MANETs" in Journal of Emerging Technologies in Web Intelligence, Vol 2, No 2 (2010), 80-85, May 2010 [8] Pei Tingrui, Zeng Wenli, Zhang Zhaoxiao, Peng Tao, "An Improved Hierarchical AODV Routing Protocol for Hybrid Wireless Mesh Network" in International Conference on Networks Security, Wireless Communications and Trusted Computing, ISBN: 978-0-7695-3610-1, 2009. [9] Yu-D00 Kimi, IL-Young Moon, Sung-Joon Cho, "A Comparison of improved AODV routing protocol based on IEEE 802.11 AND IEEE 802.15.4", Journal of Engineering Science and Technology, Vol. 4, No. 2 (2009) 132 - 141, 2009. [10] C. Perkins; E. Belding-Royer, and S. Das."Ad hoc on-demand distance vector (AODV) routing", IETF RFC3561, 2003.

154