A Study of Routing Protocol for Topology Configuration ... - IEEE Xplore

2009 International Conference on Electrical Engineering and Informatics 5-7 August 2009, Selangor, Malaysia

A Study of Routing Protocol for Topology Configuration Management in Mobile Ad Hoc Network Zahian Ismail1, Rosilah Hassan2, Ahmed Patel3, Rozilawati Razali4 Computer Science Department, Universiti Kebangsaan Malaysia 43600 UKM Bangi Selangor, Malaysia 1

3

{ zahianismail, whinchat}@gmail.com 2 4 { rosilah, rozila}@ftsm.ukm.my

Abstract— Managing today’s increasingly complex networks requires extra information, knowledge and autonomic training. Network is being used in various areas and it requires a tool to manage it. Configuration management is one of the functional areas of network management that monitor network and system configuration information so that the effects on network operation of various items like versions of hardware and software elements and routing tables can be tracked and managed. In configuration, topology management issues are even more important in the context of mobile ad hoc networks (MANETs). In this review paper, we focus on three routing protocols and discussed it in related works. Then we compare these three protocols and derive at our new hybrid protocol for MANETs. Keywords— Configuration management, topology management, routing algorithm, MANETs.

I. INTRODUCTION Nowadays, there are very high demands for networks since the all forms of business and non-business deploy networks, for example, the Internet. Networks are critically used by military, rescue team, hospital as well as corporate. Ironically, with the increase demands for network connections, there is an equal or higher demand for better management in network, and this demand will always increasing. There are many types of network and one of them is Mobile Ad Hoc Networks (MANETs). This type of network can change location and do the configuration itself. The nodes move randomly and communicate with nodes within transaction range directly. MANETs connect to other various networks through wireless connection because it is mobile. MANETs do not require fixed network infrastructure due to their wireless nature and can be deployed as multi-hop packet networks rapidly with low expense. Some MANETs are restricted to a local area of wireless devices, while others may be connected to the Internet [1]. The characteristics of MANETs [2] can be viewed in Table 1. The selection of the three protocols based on MANETs characteristic itself. The details of the protocols will be discussed in the next section.

TABLE I CHARACTERISTIC OF MANETS

Characteristic Dynamic topologies

Bandwidthconstrained, variable capacity links Energy-constrained operation Limited physical security

Descriptions Nodes are free to move, change randomly and rapidly. Used both bidirectional and unidirectional links. Wireless links have lower capacity than hardwired counterparts. Throughput much less than a radio's maximum transmission rate. Nodes in MANETs rely on batteries or other exhaustible means for their energy. Generally more prone to physical security threats than are fixed-cable nets.

Networks have to be managed and the same goes to MANETs. In network management, there are five functional areas defines by International Organization for Standardization (ISO). There are Fault Management, Configuration Management, Account Management, Performance Management and Security Management [3]. MANET’s characteristics are more about configuration so configuration management will be the chosen functional area to be discussed in this paper. Configuration management is a collection of processes and tools that promote network consistency, track network change, and provide up to date network documentation and visibility [4]. Configuration management involves the monitoring and controlling of the conventional operations in an open system or network [5]. It enables the network personnel to generate, observe and modify operational parameters and condition that control the connection operation mode. Configuration management involves definition, collection, observation, control and use of configuration data which includes the information about the required resources for the system management. It can provide the data that can be used for different purposes such as inventories, network design, configuration planning, extension planning, network configuration system operation, operator support and many more.

978-1-4244-4913-2/09/$25.00 ©2009 IEEE NW-01 412

We want to narrow down configuration management to topology management. Topology is an element in configuration management. Network topology is the arrangement or mapping of the elements in a network, especially the physical and logical interconnections between nodes [6]. The mapping of the data flow between the nodes in the network determines the logical topology of the network. The physical and logical topologies might be identical in any particular network but sometimes they also may be different. The topology of an ad hoc network plays an important role in the control algorithm performance and has been effectively applied in ad hoc networks to support routing protocols. Topology management is to ensure that the various network connectivity parameters are managed so as to ensure that the parameter values are within certain bounds [7]. Issues considered in designing MANETs are routing, security, power consumption and QoS [2]. Among these issues, Ramakrisnan and Shanmugavel [8] in their paper stated routing is the most fundamental yet challenging problem for MANETs because it must deal with limitation such as high power consumption, low bandwidth, high error rates and unpredictable movement of nodes. Routing is a standard that controls the way nodes decide to route packets between computing devices in ad hoc networks. In ad hoc network, nodes have to configure their networks topology. A new node may announce its presence and they should listen for the neighbour announcements. Each node learns about nodes nearby and how to reach them. Routing protocol term specifically refers to one operating at layer three of Open System Interconnection/Reference Model (OSI/RM) [9] which disperse topology information among routers. Network layer performs network routing functions. Routers operate at this layer by sending data throughout the extended network and making the internet possible. Figure 1 summarizes network management in MANET’s environment. There are three elements in configuration management and each element related to each other. The element is standard, documentation and validates and audit. First, we set the standards for configuration and descriptors. Standard configuration applies to protocol and media configurations, as well as global configuration commands. Descriptors are interface commands used to describe an interface. We recommend creating standard configurations for each classification, such as router, switch and routing topology. Documenting the network and changes that have occurred in the network can help us for troubleshooting and manage network tool device lists. Finally, validate and audit use the indicators to identify consistency issues and improve overall configuration management. There are a lot of routing protocol in ad hoc network; proactive (table driven) protocol [10], reactive (on demand) protocol [10], adaptive (situation-aware) protocol [11] [12], hybrid protocol [12], hierarchical (cluster) protocol [13] [14] and geographical protocol [15] [16]. We choose three protocols from above to derive a new hybrid protocol which can overcome the constraints in each stand alone protocols. These protocols have been chosen based on Manet’s characteristics as shown in Table 1.

Fig. 1 Network Management in Manet’s environment

Adaptive routing protocol can adapted to dynamic topology of MANETs and have better bandwidth utilization. Furthermore, with the special technique apply to this routing protocol can increase the throughput. Geographical routing protocol reduces power consumption with the search of shortest path and provides the security since it can choose the save target nodes to transfer the data. Hierarchical routing protocol will provide the stability especially in high density nodes. The hybrid protocol can use the benefits of these three protocols. The rest of this paper is organized as follows: Section 2 generally discussed about the three routing protocols which are adaptive routing protocol, hierarchical routing protocol and geographical routing protocol. Section 3 discussed about previous related works which have been done by other researchers. We will discuss our research direction and future work in section 4. Finally there will be conclusion in section 5. II. THE PROTOCOLS Routing in MANETs is different from routing in simple internet. In internet, fixed routing scheme is possible. MANETs use dynamic routing which means it has to use special routing protocol for the routers to exchange routing information [17]. In the subsection below we will generally describe the behaviour of the three routing protocols and the advantages. A. Adaptive Routing Protocol Adaptive routing protocol has the ability to select a new communications path to get around heavy traffic or a node or circuit failure [18]. Emergence of low-bandwidth ad-hoc mobile networks requires routing algorithms that can distribute data traffic across multiple paths and quickly adapt to changing conditions [19]. This protocol have several advantages including better bandwidth utilization, bounding delay variation, minimizing delay, and improved fault

413

tolerance. Adaptive routing should work w well even with high variance routing metrics. B. Hierarchical Routing Protocol Hierarchical routing protocol is an old concept in networking from 1970s which dating baack. This protocol originally designed for fixed networks but with some suitable h networks. This alteration, it has been implemented in ad hoc protocol is also known as cluster protocol which w organizes the o nodes. With this network as a hierarchy of nested clusters of type of protocols the choice of proactive an nd reactive routing depends on the hierarchic level where a node resides. The routing is initially established with some proactively prospected routes and then serves thhe demand from additionally activated nodes through reactive flooding on the lower levels. It is stable because each levvel is independent. Any changes in higher level will not affectt lower level but if there are improvements in one level other level will improve too. clusters

Fig. 2 Hierarchical Routing Protocool [20]

C. Geographical Routing Protocol This type of protocols acknowledges the influence of physical distances and distribution of nodes to areaas as significant to network performance. A recent approach too designing simple protocols that keep overhead small is to exp ploit the underlying geometry and geography of the ad hoc network locations. Each node only maintains informattion about their "neighbourhood", which is the set of nodess that the node can directly reach. Using positioning informatioon, the source node greedily passes a given packet to a neighboour that is closest to the destination; if greedy forwarding is im mpossible, and then the packet is forwarded along a perimeteer of the region to reach the destination. Using geographical information makes it possible to select the truly shortestt path because it communicates their location through the network, so that other nodes can determine the shortest path..

Fig. 3 Geographical R Routing Protocol [21]

III. RELATE ED WORK This paper focuses on routinng protocols in ad hoc network. Previous work on routing prottocol in ad hoc networks has been based on various assumpttions such as node density. We will focus in three protocols w which have been discussed by other researchers. There aree adaptive routing protocol, hierarchical routing protocoll and geographical routing protocol. Finally we will discusss and introduce our solution to overcome the constraints of the stated protocols. Cong Liu and Jie Wie [111] in their paper introduced adaptive routing protocol, which is the first routing scheme that is adaptive to network density as well as to mobility patterns. The goal of the ap pproach is to be adaptive to different network densities annd different mobility models. Two nodes transfer message within their communication range. During the process, thhe sender replicates messages while retaining a copy. Each message has TTL (Time-ToLive) that specifies timeout forr the messages to be dropped. When the message is delivered, both sender and receivers hold a complete copy of the messsage. The advantage of this ment and does not require approach is easy to implem configuration. Sangho Park andd Daeyeon Park [12] introduced another approach for adaptiive routing, Adaptive Core Multicast Routing Protocol ((ACMRP). A core builds a multicast mesh on demand annd sources share the multicast mesh. ACMRP maintains overrheads of managing multicast routes and delivering packets reegardless of nodes mobility and group size. ACMRP achieves efficiency, scalability, and effectiveness. P.Yang, K. C. Yow and N. Sukumar [13] introduced hierarchical structures to proviide scalable solutions in many large networking systems. They extend the existing schemes to help built more distributed annd stable hierarchical structures by propose a distributed partitio on algorithm. It will soften the critical nodes and make the different d levels in hierarchies more independent compared with w the traditional hierarchical algorithm. However, Elizabeeth M. Belding-Royer [14] introduced different approach in her paper. She introduced two solutions in hierarchical roouting to make sure it will be more scalable. The first solution n is by using Adaptive Routing

414

using Clusters (ARC) which creates a one-level clustered hierarchy on network nodes. But there is problem when the size of networks grow (to thousands or tens of thousands of nodes) so she introduced another approach that is Adaptive Routing using Cluster Hierarchies (ARCH). ARCH build upon ARC to create a multi-level hierarchy that is dynamically able to adjust its depth in response to the condition changing in networks. Fabian Kuhn, Roger Wattenhofer and Aaron Zollinger [15] introduced algorithmic approach to geographical routing. This approach combines greedy forwarding and face routing. Face routing find the shortest path connecting the source and the destination. Greedy forwarding help algorithm becomes efficient in average-case networks. Xioli Ma, Min-Te Sun, Gang Zhao and Xiangqian Liu [16] in their paper introduces path pruning algorithm. This approach is simple and effectively reduces the number of hops for route discovered by existing geographical routing protocol to enhance delivery rate. It has low implementation complexity but improved routing performances and delivery rate when applied to geographical routing. Huaizhi Li and Mukesh Singhal [10] in their paper introduced Anchor Based Routing Protocol (ABRP) which is a hybrid protocol that combines table based (proactive) routing protocol with geographic routing protocol. The protocol consist of three parts; location based clustering protocol, intra-cell routing protocol and inter-cell routing protocol. The network maintains two kinds of routing tables that are inter-cell routing table and intra-cell routing table. ABRP has higher packet delivery ratio, lower overhead and lower end-to-end delay. IV. RESEARCH DIRECTION AND FUTURE WORK From the review above, we can summarize that the following aspects of work need of R&D to be perform. The study of the previous routing protocol shows several important gaps which need to be treated. The researchers used a standalone protocol which limits the performance of the system. Each protocol has their advantages and disadvantages. If they only applied one protocol, the protocols only focus to fulfil certain criteria and ignore other criteria. For example, the goal of AROD [11] is to be adaptive to network densities but how about power consumption? That’s why we try to derive one hybrid protocol which tries to fulfil the criteria in routing protocol. Given these problem, in our forthcoming work, we endeavour to achieve three distinct objectives: 1. To analyze routing protocol. 2. To implement the best routing protocol to the system. 3. To test the system and provide configuration documentation for the system. In order to derive the best routing protocol, we have analysed and identified several key characteristics for each routing as shown in Table 2 below.

TABLE II CHARACTERISTIC OF ROUTING PROTOCOL

Protocol

Adaptive

Hierarchical Geographical

Hb (proposed protocol)

Structure

F

H

F

F

Loop Free

Y

Y

Y

Y

Distributed

Y

Y

Y

Y

Qos Support Multicast

N

P area

N

Y

Y

P area

Y

Y

Security

N

N

Y

Y

Scalability

N

Y

N

Y

N

Y

N

Y

↑ node ↑ speed

↓cluster/ hierarchy ↑ speed

-

A

Stability Speed

Yes-Y No-N

Flat-F Adaptive-A

Hierarchical-H Proactive-P

Hybrid-Hb

We want to use a flat structure because it will increase the throughput. Loop free will reduce the time taken to transmit the data from node to node and QoS support increases the service quality. Multicast will use the efficient strategy to deliver the message over. Geographical routing protocol provides security since it can choose the target node. Hierarchical routing protocol has high scalability and stability as been discussed before. Data transfer speed is adaptive to the nodes density. Here, based on these three routing protocols, we want to introduce hybrid routing protocol which have the implementation of adaptive, hierarchical and geographical routing protocol. We choose six quantitative criteria and five qualitative criteria to be considered in order to determine that the protocol proposed is the best protocol. We choose these criteria because we want to test it to the hybrid protocol and to see whether this new protocol can cater for all the criteria which we derived for QoS as follows: 1. Quantitative Criteria: i. Network Density – when number of nodes ↑ routes selected ↑ and connectivity ↑. ii. Message Generating Rate – nodes stability help generate ↑ messages. iii. Energy constraint operation – shortest path reduce the energy consumption. iv. Throughput – flat structure deliver ↑ amount of data. v. Delay – adaptation to nodes density minimizing the delay. vi. Speed – distance of the neighbour nodes and density influence the speed.

415

2.

Qualitative Criteria: i. Reliability of data transmissiion to prevent the data from lost and corrupted. ii. Efficiency of power consumpttion to optimize the energy used. iii. Mobility of the nodes mobiliity to increase the throughput. iv. Scalability for node densiity in messaging overhead. v. Stability for nodes in lowerr level to enhance nodes in higher level. protocol. The Table 3 below shows the criteria for each e he criteria stated by new hybrid protocols aims to achieve all th each protocol. TABLE III CRITERIA OF ROUTING PROTO OCOL

Protocol Adaptive

Quantitative - ↑ Node density adaptation - ↓ Delay -↑ Throughput - ↑ Message Generating Rate

Hierarchical Geographical

- ↓ Energy constraint operation - ↑Speed

Qualitative -Reliability -Efficiency - Mobility - Scalability - Efficiency - Scalability -Stability - Efficiency - Mobility

Figure 4 below shows the new hybridd protocol that we want to propose. This diagram is thee combination of hierarchical and geographical diagram. E Each node grouped into cluster and we will search the shorteest path among the cluster. With the addition of adaptive rouuting protocol, this new protocol cans still working in high denssity nodes.

clusters

V. CONC CLUSIONS Topology management is to ensure that the various network connectivity parameterrs are managed so as to ensure within certain bounds. Routing that the parameter values are w protocols approached here arre the important elements in topology configuration mannagement. This paper has introduced the idea of combining three routing protocol: adaptive, hierarchical and geeographical. Adaptive routing protocol is easy to implement because it can adapt with the density of nodes. Hierarchiccal routing protocol has the stability because every level iin hierarchies is independent. Enhancement of stability in levvel one can also gain stability improvement at higher levels, supposedly without affecting low level performance. Geograaphical routing protocol helps the node to find the shortest path p and select the save target node. The combination of these three protocols into a new hybrid protocol for MANETs iss expected to be more versatile, robust and easy to implement with better performance and lower operation cost. ACKNOWLLEDGMENT This research is funded by Un niversiti Kebangsaan Malaysia (UKM) Research Projects callled GUP under code number UKM-GUP-NBT-08-29-116. T The research group known as Network Manaagement Group (http://www.ftsm.ukm.my/netw work). Any opinions, findings mendations expressed in this and conclusions or recomm material are those of the authorss. REFEREENCES [1] [2]

[3]

[4] shortest path

[5] [6] [7]

[8] Fig. 4 Proposed Hybrid Routing Prootocol [9]

(2005) The tech term compuuter dictionary. [Online]. Available: http://www.techterms.com/definiition/manet. S. Corson and J. Macker. “Moobile Ad hoc Networking (MANET): Performance Issues and Evaluation Routing Protocol Considerations,”text in ACM P Portal 1999 1-12 January 1999, Available: http://portal.acm.org/ccitation.cfm?id=RFC2501. Network Management: Best Prractices White Paper, Document ID: 15114, 2007. Available: http://www.cisco.com/applicatio on/pdf/paws/15114/NMS_bestpractices .pdf, updated: Jul 11, 2007. Configuration Management: Beest Practices White Paper, Document ID: 15111, 2007. Available: http://www.cisco.com/application n/pdf/paws/15111/configmgmt.pdf, updated: Mar 05, 2007. N. Jailani, “A Fault Managementt System Based on OSI Standards,” M. Sc thesis, Dublin Ireland 1995. (2009) Network Topologies. [On nline]. Available: http://itvoir.com/portal/resourcess/Network-Topologies/NetworkTopologies.asp. S T. Srinidhi, G. Sridhar, and V. Sridhar, “Topology Management in Ad Hoc Mobile Wireless Networks,,” in Proc. Work-in-Progress Session of 24th IEEE Real-Time System ms Symposium (RTSS ’03), pp. 29–32, Cancun, Mexico, December 2003 3. M. Ramakrisnan and S. Shanmu ugavel, “New Approaches to Routing Techniques of MANET Node for Optimal Network Performance,” IJCSNS International Journal of Computer Science And Network Security, Vol. 8 No. 11, Novembber 2008. P. Simoneau. “The OSI Model: Understanding the Seven Layers of Computer Networks,” Expert Reference Series of White Paper. nowledge.com. Available: http://images.globalkn

416

[10]

[11]

[12] [13] [14] [15]

H. Li and M. Singhal, “A Scalable Routing Protocol for Ad Hoc Networks,” Proceedings of the 39th Annual Hawaii International Conference on System Sciences, Volume 09 Page: 225.1, Hawaii, January 2006. C. Liu and J. Wu, “Adaptive Routing in Dynamic Ad Hoc Networks,” proceedings of IEEE Wireless Communications and Networking Conference (WCNC) 2008, Page(s):2603 – 2608 Las Vegas, USA, March 31 2008-April 3 2008. S. Park and D. Park, “Adaptive Core Multicast Routing Protocol,” Wireless Networks 10, 53–60, 2003 Kluwer Academic Publishers, manufactured in The Netherlands, 2004. P.Yang, K. C. Yow and N. Sukumar, “A Hierarchical Routing Protocol Providing Stability and Distribution for MANET,” Journal of ICICSPCM 2003, Singapore, 15-18 December 2003. E. M. Belding-Royer, “Multi-Level Hierarchiesfor Scalable Ad Hoc Routing,” Wireless Networks 9, 461-478, 2003 Kluwer Academic Publishers, manufactured in the Netherland, 2004. F. Kuhn, R. Wattenhofer and A. Zollinger, “An Algorithmic Approach to NetGeographic Routing in Ad Hoc and Sensor Networks,” in

[16]

[17] [18] [19] [20] [21]

IEEE/ACM Journal of Transactions Onworking, Vol. 16 No. 1, February 2008. X. Ma, M.T Sun, G. Zhao and X. Liu, “An Efficient Path Pruning Algorithm for Geographical Routing in Wireless Networks,” in IEEE journal of Transactions on Vehicular Technology, Vol. 57, No. 4, July 2008. W. Stalling, Data and Computer Communications, Chapter in book, Chp19 614-615, Pearson Education, Inc.New Jersey, 2007. (2009) Encyclopedia Term. [Online]. Available: http://www.pcmag.com/encyclopedia_term/0,2542,t=adaptive+routing &i=37507,00.asp#. L. Smith and M. Thirunavukkarasu. (2005) Computing System Research Lab homepage on Routing Algorithms. [Online]. Available: http://www.csrl.cs.vt.edu/routing.html. (2009) Clustering/hierarchical routing protocols. [Online]. Available: http://www.linuxonly.nl/docs/1/4_Clustering_hierarchical_routing_pro tocols.html. E. Ermel (2009) Location and Geographical Routing Protocols in Mobile Wireless Mesh Networks. [Online]. Available: http://www-phare.lip6.fr/~ermel/.

417