An Efficient QoS Routing Protocol for Mobile Ad-Hoc Networks *

Size: px
Start display at page:

Download "An Efficient QoS Routing Protocol for Mobile Ad-Hoc Networks *"

Transcription

1 An Efficient QoS Routing Protocol for Mobile Ad-Hoc Networks * Inwhee Joe College of Information and Communications Hanyang University Seoul, Korea iwj oeshanyang.ac.kr Abstract. To satisfy the user requirements for continuous and realtime multimedia information, the concept of Quality of Service (QoS) has emerged as a main issue in mobile ad-hoc networks. QoS routing is to find a route according to the QoS requirements of the users. In this paper, we propose an efficient QoS routing protocol that is based on AODV over TDMA, one of the typical routing protocols for mobile ad-hoc networks, by making a bandwidth reservation for QoS guarantee. While the existing schemes calculate the maximum available bandwidth for each candidate path, our scheme is to check only if the bandwidth of a given path satisfies the end-to-end QoS requirement. Also, the key idea in the bandwidth reservation is to select carefully time slots without causing any conflicts in the wireless environment, thereby maximizing the bandwidth efficiency. In order to evaluate the performance of the proposed QoS routing protocol, some simulations are carried out in the ad-hoc environment. The simulation results show that the proposed protocol provides sufficiently low and stable delay performance regardless of the offered load. 1 Introduction In recent years, wireless mobile networks have become increasingly important for users of computing systems. There are currently two types of wireless mobile networks: Infrastructured network and Ad-hoc network. The first type refers to a network with any infrastructure by installing base stations in cellular networks or access points in wireless local area networks. On the other hand, the second type of wireless mobile networks does not rely on any fixed infrastructure. This may happen on conferences, rescue operations, or military actions in enemy terrain, i.e., when mobile users need to communicate to each other in situations and * This work was supported in part by grant No. IITA-2005-C from the ITRC Support Program of the Ministry of Information and Communication, and in part by grant No. FOl from the International Cooperative Research Program of the Korea Science and Engineering Foundation. Please use the following format when citing this chapter: Joe, I., Park, Y.J., 2006, in International Federation for Information Processing (IFIP), Volume 212, Ad- Hoc Networking, ed. AI Agha, K., (Boston: Springer), pp

2 18 Inwhee Joe and Yong Jin Park places with no infrastructure where rapid deployment of a network is required on a temporary basis. Mobile ad-hoc networks consist of mobile nodes (each node conceptually consisting of a router, a radio port and one or more host computers). To communicate with mobile nodes that are not within the transmission range, a routing protocol is required for each node. Recently, many routing protocols have been proposed for mobile ad-hoc networks. In general, they can be divided into two main categories: proactive and reactive protocols. In a proactive routing protocol, nodes periodically exchange routing information with other nodes to maintain all the routes on the network beforehand, while in a reactive approach each node attempts to discover a route on demand only when it has data to send. Although there is no single standard routing protocol yet, reactive routing protocols are known to perform better than proactive routing protocols in terms of lower overheads. Typical examples of reactive routing protocols include the dynamic source routing (DSR) protocol and the ad-hoc on-demand distance vector (AODV) routing protocol. Even if existing routing protocols are designed to cope well with the dynamic change of network topology, they are mainly concerned with best-effort data traffic. The problem of Quality-of-service (QoS) routing to support multimedia traffic over mobile ad-hoc networks is studied here. The goal of QoS routing is to find a route from a source to a destination that satisfies the end-to-end QoS requirements such as bandwidth and delay. Unlike traditional wireless networks, providing QoS is more difficult for mobile ad-hoc networks, because the network topology changes frequently and the end-to-end route is a multi-hop wireless path. QoS routing in mobile ad-hoc networks has recently started to receive increasing attention in the literature [3, 4, 5]. To find out a route to the destination, QoS routing normally calculates the maximum available bandwidth for each candidate route so that it can check if the bandwidth meets the end-to-end QoS requirement. In fact, the ability to provide QoS is heavily dependent on how the resources like bandwidth are managed at the MAC (Medium Access Control) layer, whether it is TDMA (Time Division Multiple Access) or CDMA (Code Division Multiple Access). In TDMA, calculating the maximum bandwidth for a given multi-hop route is proven to be NP-complete because of the interference problem [1]. Some use CDMA on top of TDMA to eliminate this problem by assigning a different code to each transmitter [1]. In this paper, we propose a novel QoS routing protocol with bandwidth reservation for mobile ad-hoc networks using TDMA. Our routing protocol is based on AODV [2] to find QoS routes on-demand only as needed. The remainder of this paper is organized as follows. After explaining the concept of bandwidth calculation, we propose our slot section algorithm to maximize the bandwidth efficiency in Section 2. In Section 3 we present a detailed description of the proposed QoS routing protocol. In Section 4 we address performance evaluation results from simulation using our own network simulator. Finally, we conclude the paper by highlighting our contribution.

3 Ad-Hoc Networking 19 2 Bandwidth Calculation In the packet-switched network, QoS is meaningful only for a flow of packets between the source and destination. So, it is assumed that the application is flow-based and requires constant bandwidth as the end-to-end QoS requirement to support multimedia traffic over mobile ad-hoc networks. Since bandwidth guarantee is one of the most critical requirements for multimedia traffic, we only consider bandwidth as the QoS here. In an attempt to satisfy the QoS requirement, the network must ensure that adequate network resources like bandwidth are available for the entire duration of a given flow. Therefore, QoS guarantees can be delivered only with appropriate resource reservation mechanisms. For each flow, QoS routing is the process of finding the route that meets the required bandwidth. In TDMA, the bandwidth is expressed in terms of time slots. To find a route with sufficient bandwidth, QoS routing normally calculates the maximum available bandwidth for each candidate route, and then make a reservation along the route if the bandwidth is large enough to meet the QoS requirement as a part of the process. In this case, both the hidden terminal and exposed terminal problems should be taken into account so that the interference can be avoided in the wireless environment. If a given route R provides a bandwidth of B time slots, it means that every link along the route has at least B available time slots, and these slots do not interfere with other transmissions. That is, the end-to-end bandwidth of a route is not determined just by the bandwidth of the bottleneck link, because mutual interference among available time slots of links should be considered in the wireless environment. Each transmission is organized in a frame that contains a fixed number of time slots, N. The entire network is synchronized on a frame and slot basis. The link bandwidth can be defined as the number of free time slots on the link from the sender to the receiver without any conflicts to other transmissions. It is different according to the link direction, because the conflicts are directional. Due to the hidden-terminal and exposed-terminal problems, the link bandwidth is affected only by transmission or reception activities of one-hop neighbor nodes from the sender and the receiver. The available link bandwidth from a sender S to a receiver R can be obtained in terms of free time slots by removing the following unavailable time slots from the total time slots N: - Time slots that are used already by a sender S or by a receiver R. - Time slots that are used to receive in one-hop neighbor nodes of a sender S. - Time slots that are used to send in one-hop neighbor nodes of a receiver R. For example, when a link bandwidth L is calculated, there are four possible cases around the sender and the receiver, as shown in Fig. 1. If a sender node S and a receiver node R are regarded as one super node, the scope of our interest is one-hop range of the super node, since the link bandwidth is affected only by transmission and reception activities of the one-hop neighbor nodes. On the sender's side, there are two cases whether time slots are used for transmission

4 20 Inwhee Joe and Yong Jin Park or reception. First, node A has only reception slots, and these slots cannot contribute to the link bandwidth L because of the hidden-terminal problem. Second, node B has only transmission slots, and these slots can contribute to the link bandwidth L because of the exposed-terminal problem. On the receiver's side, there are also two cases depending on the direction. Node C has only transmission slots, and these slots cannot be counted into the link bandwidth L because of the hidden-terminal problem. Finally, node D has only reception slots, and these slots can be counted into the link bandwidth L, because they don't interfere with the transmission from S to R. In summary, the link bandwidth L can be calculated by counting the number of remaining time slots in the total slots N, after removing the slots that are used by the sender S and receiver R, also used by their neighbor nodes A & C. A: Reception Slots 8: Transmission Slots 0: Reception Slots Fig. 1. Link Bandwidth Calculation The path bandwidth can be defined as the number of free time slots on the route from the source to the destination. If the destination is directly linked to the source, the path bandwidth is equivalent to the link bandwidth in this case. In general, a path consists of several links, and each link bandwidth can be obtained as describe above. However, the path bandwidth is not just determined by the minimum link bandwidth on the route because of the interference problem. Actually, finding the maximum path bandwidth for a given route is proven to be NP-complete in terms of global optimization. That is, it is very hard to find the optimal solution in the sense that the path bandwidth is maximized and at the same time there is no conflict between transmissions along the entire route. Instead of calculating the maximum path bandwidth, we propose only to check if the bandwidth of a given route satisfies the end-to-end QoS requirement. Once every link bandwidth on the route is calculated in terms of free time slots, then the next step is what slots to choose for the path bandwidth without any conflicts to each other. Due to the hidden-terminal and exposed-terminal problems, the link bandwidth is affected only by one-hop neighbor nodes of the

5 Ad-Hoc Networking 21 sender and the receiver. It means that for slot selection the path bandwidth should consider all the slots until the two-hop links with the sender and receiver in the center. For example, when slots are chosen for the path bandwidth from node X to Y, both its one-hop and two-hop links should be taken into account, as shown in Fig. 2. In this case, there are two one-hop links from node W to X and from node Y to Z. Also, there are two two-hop links from node S to W and from node Z to D. The difference between the left links and the right links around this link from node X to Y is that the left links already have their slots chosen according to the end-to-end QoS requirement. In particular, Fig. End-to-End QoS Requirement = 1 Time Slot Link Bandwidth: Av^lable Tlrne Slots 12.4> 11.5,6} jh'.?:f;?:., {1.6) {1.3.6} o o C) -O o o Slot Selection for Path Bandwidth of I Tme Slot Fig. 2. Slot Selection for Path Bandwidth 2 illustrates how slots are selected along the route as the path bandwidth for a given end-to-end QoS requirement (e.g., 1 time slot) from the source node S to the destination node D. For the first link starting from node S to W, slots are selected from its link bandwidth by avoiding the available slots of the one-hop link from W to X and the two-hop link from X to Y as much as possible. This way, the available path bandwidth is maximized in such that the problem of slot conflicts can be minimized. If there is no slot satisfying this condition, any slots will be chosen randomly (e.g., slot 2) among the available slots on the link. Once the slots are determined for the first link, then this process repeats for the next link from node W to X. However, in this case, there are two one-hop links with respect to the hnk from W to X: left link from S to W and right link from X to Y. The difference is that the left link has its slots already chosen to the path bandwidth, so only these slots (e.g., slot 2) will be avoided on slot selection instead of the entire link bandwidth (e.g., slots 2 & 4). After removing all the slots of the one-hop and two-hop links, the rest will be selected for this link (e.g., slot 5) as long as there are some left. This process repeats until it reaches the destination node D. If this path can provide enough bandwidth to meet the end-to-end QoS requirement, it is chosen as a QoS route. Our slot selection algorithm can be summarized briefly with a flow chart, as shown in Fig. 3.

6 22 Inwhee Joe and Yong Jin Park P = Link Bandwidth T» Temoorary Set Q = Required QoS List = Link Bandwidth - One-Hop Links - Two-Hop Links (Stop) Fig. 3. Slot Selection Algorithm

7 3 QoS Routing with Bandwidth Reservation 3.1 Hello Message Ad-Hoc Networking 23 Each node broadcasts a Hello message on a periodic basis to its one-hop neighbor nodes. The Hello message contains the time slot information extracted from the slot table of each node that maintains which time slots are used for transmission or reception, and which time slots are available. Also, the Hello message contains the time slot information of the one-hop neighbor nodes using the previous Hello messages received from the neighbor nodes. In the Hello message, the sequence number is used to identify which message is more up-to-date. In this way, each node collects the time slot information of all the neighbor nodes in its two-hop range using the periodic Hello messages. As a result, the link bandwidth can be calculated with such information for each link direction, as mentioned in Section 2. Fig. 4 shows the modified Hello message format. One part of the previous Reserved field in the original Hello message is renamed as the field of Time Frame Length to indicate the total number of time slots for each frame cycle. The Node Count field indicates the total number n of the one-hop neighbor nodes. For each node, the IP address, sequence number, and the time slot information are included in the Hello message. As mentioned earlier, the time slot information represents the current state of each time slot, i.e. which slots are in use for transmission or reception, and which slots are available. Soww IPMAwa* %&iimv %v*^tim?^att^t*r V^iklbie ttm^ KIM Mftfm»»l»» f>*i0iiar mitf W Mttnm A) M^»r tmik U> M<toit«^^ Fig. 4. Hello Message 3.2 Bandwidth Reservation To find a route to the destination, the source node initiates the route discovery procedure by broadcasting a route request (RREQ) message to its neighbor

8 24 Inwhee Joe and Yong Jin Park nodes like AODV. As the RREQ message proceeds hop by hop until the destination, each intermediate node appends the link bandwidth information to the RREQ message. The link bandwidth is a list of free time slots for each directional link and this information can be obtained using the periodic Hello messages. Once the RREQ message reaches the destination, the destination node extracts all the link bandwidth information between source and destination out of the RREQ message. With this, our slot selection algorithm is applied so that it attempts to choose time slots for each link along the path according to the end-to-end QoS requirement. If the algorithm cannot find the required number of available time slots from each link, the destination node generates no response because this particular route does not meet the end-to-end QoS requirement. Dt^itt.Klnit tp AM)M.< Snawr W AWiwa ^liuti^ S«^^U^t^ ^f^jlrib^t D>AfMbnmi yiili: 8«MW^ tn<mtmidiin NHatn>AiMi<m!.» mt IMi BasMdtk l^tamaito«u.. Fig. 5. Route Request Message Fig. 5 shows the modified RREQ message. In comparison with the original RREQ message, the modified portion is shaded. The R flag indicates whether the QoS guarantee is required or not, depending on the user requirement. The LEW Length field indicates the total number of time slots for each frame cycle. A directional link consists of two nodes, the transmitter node and the receiver node. The first link starts from the source node as a transmitter. Thus, for each link the IP address of the receiver node and the link bandwidth information are added to the last part of the RREQ message, as long as the R flag is set. This process continues on a hop by hop basis until the destination. Once the required number of free time slots can be chosen for each link along the route from source to destination, it means that this particular route can afford to satisfy the end-to-end QoS requirement. In this case, the destination node creates a route reply (RREP) message and puts the selected time slot information of each link in this message. Since each node receiving the RREQ message caches a route back to the source, the RREP message can be unicast from the destination along the path to the source just like AODV. Whenever the

9 Ad-Hoc Networking 25 RREP message is received, each relay node makes a bandwidth reservation using the selected time slot information of the message. In other words, as indicated in the selected time slot information of the RREP message, the corresponding time slots will be reserved for each node to support this particular flow. Finally, the source node begins to transmit data through the reserved path. Fig. 6 shows the modified RREP message. In comparison with the original RREP message, the modified portion is shaded. The same R flag is used here for QoS requirement. The Selected Slot Number field indicates the number of the time slots selected. The time slot information of each link is expressed in a form of the bit map: Selected Bitmap. This information represents which slots are selected as the path bandwidth for each link along the route from the source to the destination. 1 i"" i""r '! p I tmfusm! I - - i Fig. 6. Route Reply Message 4 Simulation The objective of simulation is to evaluate the performance of our QoS routing protocol with bandwidth reservation for mobile ad-hoc networks. Since the network simulator ns 2 does not support TDMA for mobile ad-hoc networks, we developed our own network simulator using C in order to validate the proposed protocol over TDMA. The voice stream is modeled as CBR (Constant Bit Rate) traffic with the coding rate of 8 Kbps, while the video stream is also modeled as CBR traffic with the coding rate of 32 Kbps. If each time slot supports 8 Kbps, 1 time slot is required for the voice traffic and 4 time slots are required for the video traffic as the end-to-end QoS requirements. The simulator places 20 mobile nodes in a random fashion in the area of 100 by 100 meters. The radius of the radio transmission range is assumed to be about 30 meters and the total number of time slots in each frame cycle is set to 20. Given simulation parameters above, we measure the QoS guarantee ratio and the delay performance as a function of the oflfered load.

10 26 Inwhee Joe and Yong Jin Park I.!i.i..:. Fig. 7. QoS Guarantee Ratio i I Viim D»i VoiBe'&ife m» Fig. 8. Delay Performance

11 Ad-Hoc Networking 27 Fig. 7 shows the QoS guarantee ratio as a function of the offered load. The QoS guarantee ratio represents the percentage of how much QoS guarantee is successful. As the offered load increases, the QoS guarantee ratio decreases. For the video traffic the curve drops dramatically, while it drops gradually in case of the voice traffic. Since more time slots are required for the video traffic, it explains the behavior of the video curve in terms of the QoS guarantee ratio as compared to the voice case. To support video traffic, four time slots are required for transmission and another four time slots are required for reception at the same time, thereby leading to eight time slots for each relay node. As a result, it is certain that the video curve drops rapidly with the increased offered load, in that the total number of time slots is only 20 for each frame cycle. On the other hand, Fig. 8 presents the delay performance as a function of the offered load. The delay performance is defined as the end-to-end delay measured at the application layer from the source to the destination. Regardless of the offered load, it is shown that the delay is sufficiently low and stable for both cases. It ensures that our proposed QoS routing protocol works correctly to make a bandwidth reservation with the slot selection algorithm according to the end-to-end QoS requirement. Obviously, the video traffic causes more delay than the voice traffic. If the offered load is 60% or higher, the QoS guarantee is actually hard to deliver, so measuring the delay is not so useful at all. In summary, the simulation results show that the delay performance is very stable and low enough to satisfy the end-to-end QoS requirement regardless of the offered load. 5 Conclusions In this paper, we have discussed the design and performance of a novel QoS routing protocol with bandwidth reservation for mobile ad-hoc networks. While the existing schemes calculate the maximum available bandwidth for each candidate path, our scheme is to check only if the bandwidth of a given path satisfies the end-to-end QoS requirement. In fact, finding the maximum path bandwidth for a given route is proven to be NP-complete in terms of global optimization. Instead of calculating the maximum path bandwidth, we propose only to check if the path bandwidth meets the end-to-end QoS requirement by applying our slot selection algorithm. The algorithm attempts to choose carefully time slots without causing any conflicts in the wireless environment, thereby maximizing the bandwidth efficiency. If it can find the required number of available time slots for each link along the path, it ensures that the path bandwidth meets the end-to-end QoS requirement. Also, We have presented simulation results using our own network simulator in order to evaluate the performance of the proposed QoS routing protocol in the ad-hoc environment. From our simulations, we have measured the QoS guarantee ratio and the delay performance as a function of the offered load. The simulation results show that the proposed protocol provides sufficiently low and stable delay performance regardless of the offered load.

12 28 Inwhee Joe and Yong Jin Park References 1. C.R. Lin and J. Liu, "QoS Routing in Ad Hoc Wireless Networlcs," IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8, pp , August C. Perkins, E. Belding-Royer, and S. Das, "Ad Hoc On-Demand Distance Vector (AODV) Routing," IETF RFC 3561, July W. Liao, Y. Tseng, and K. Shih, "A TDMA-based Bandwidth Reservation Protocol for QoS Routing in a Wireless Mobile Ad Hoc Network," Proceedings of IEEE International Conference on Communications, pp , April Q. Xue and A. Ganz, "Ad Hoc QoS On-Demand Routing in Mobile Ad Hoc Network," Journal of Parallel and Distributed Computing, Vol. 63, pp , February C. Zhu and M.S. Corson, "QoS Routing for Mobile Ad Hoc Networks," Proceedings of IEEE INFOCOM, pp , June I. Joe, "Reservation CSMA/CA for QoS Support in Mobile Ad Hoc Networks," Lecture Notes in Computer Science, Vol. 3842, pp , January I. Joe and S.G. Batsell, "MPR-based Hybrid Routing for Mobile Ad Hoc Networks," Proceedings of IEEE Conference on Local Computer Networks, pp. 7-12, November S. Chakrabarti and A. Mishra, "QoS Issues in Ad Hoc Wireless Networks," IEEE Communications Magazine, Vol. 39, pp , 2001.

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc (International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com

More information

Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols

Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols Purvi N. Ramanuj Department of Computer Engineering L.D. College of Engineering Ahmedabad Hiteishi M. Diwanji

More information

A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks

A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks T.Chandrasekhar 1, J.S.Chakravarthi 2, K.Sravya 3 Professor, Dept. of Electronics and Communication Engg., GIET Engg.

More information

SIMULATION STUDY OF BLACKHOLE ATTACK IN THE MOBILE AD HOC NETWORKS

SIMULATION STUDY OF BLACKHOLE ATTACK IN THE MOBILE AD HOC NETWORKS Journal of Engineering Science and Technology Vol. 4, No. 2 (2009) 243-250 School of Engineering, Taylor s University College SIMULATION STUDY OF BLACKHOLE ATTACK IN THE MOBILE AD HOC NETWORKS SHEENU SHARMA

More information

IJMIE Volume 2, Issue 7 ISSN: 2249-0558

IJMIE Volume 2, Issue 7 ISSN: 2249-0558 Evaluating Performance of Audio conferencing on Reactive Routing Protocols for MANET Alak Kumar Sarkar* Md. Ibrahim Abdullah* Md. Shamim Hossain* Ahsan-ul-Ambia* Abstract Mobile ad hoc network (MANET)

More information

A Link-state QoS Routing Protocol for Ad Hoc Networks

A Link-state QoS Routing Protocol for Ad Hoc Networks A Link-state QoS Routing Protocol for Ad Hoc Networks Anelise Munaretto 1 Hakim Badis 2 Khaldoun Al Agha 2 Guy Pujolle 1 1 LIP6 Laboratory, University of Paris VI, 8, rue du Capitaine Scott, 75015, Paris,

More information

NetworkPathDiscoveryMechanismforFailuresinMobileAdhocNetworks

NetworkPathDiscoveryMechanismforFailuresinMobileAdhocNetworks Global Journal of Computer Science and Technology: E Network, Web & Security Volume 14 Issue 3 Version 1.0 Year 2014 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals

More information

PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK

PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK http:// PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK Anjali Sahni 1, Ajay Kumar Yadav 2 1, 2 Department of Electronics and Communication Engineering, Mewar Institute,

More information

DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS

DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS K.V. Narayanaswamy 1, C.H. Subbarao 2 1 Professor, Head Division of TLL, MSRUAS, Bangalore, INDIA, 2 Associate

More information

COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK

COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 5 May, 2013 Page No. 1680-1684 COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK ABSTRACT: Mr.Upendra

More information

Performance Analysis of Load Balancing in MANET using On-demand Multipath Routing Protocol

Performance Analysis of Load Balancing in MANET using On-demand Multipath Routing Protocol ISSN: 2278 1323 All Rights Reserved 2014 IJARCET 2106 Performance Analysis of Load Balancing in MANET using On-demand Multipath Routing Protocol Monika Malik, Partibha Yadav, Ajay Dureja Abstract A collection

More information

Lecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol

Lecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem

More information

VoIP over MANET (VoMAN): QoS & Performance Analysis of Routing Protocols for Different Audio Codecs

VoIP over MANET (VoMAN): QoS & Performance Analysis of Routing Protocols for Different Audio Codecs VoIP over MANET (VoMAN): QoS & Performance Analysis of Routing Protocols for Different Audio Codecs Said El brak Mohammed Bouhorma Anouar A.Boudhir ABSTRACT Voice over IP (VoIP) has become a popular Internet

More information

Scenario based Performance Analysis of AODV and OLSR in Mobile Ad hoc Networks

Scenario based Performance Analysis of AODV and OLSR in Mobile Ad hoc Networks Scenario based Performance Analysis of AODV and OLSR in Mobile Ad hoc Networks Scenario based Performance Analysis of AODV and OLSR in Mobile Ad hoc Networks S. Gowrishankar, T.G. Basavaraju, M. Singh,

More information

Security Threats in Mobile Ad Hoc Networks

Security Threats in Mobile Ad Hoc Networks Security Threats in Mobile Ad Hoc Networks Hande Bakiler, Aysel Şafak Department of Electrical & Electronics Engineering Baskent University Ankara, Turkey 21020013@baskent.edu.tr, asafak@baskent.edu.tr

More information

Achieving Energy Efficiency in MANETs by Using Load Balancing Approach

Achieving Energy Efficiency in MANETs by Using Load Balancing Approach International Journal of Computer Networks and Communications Security VOL. 3, NO. 3, MARCH 2015, 88 94 Available online at: www.ijcncs.org E-ISSN 2308-9830 (Online) / ISSN 2410-0595 (Print) Achieving

More information

Optimization of AODV routing protocol in mobile ad-hoc network by introducing features of the protocol LBAR

Optimization of AODV routing protocol in mobile ad-hoc network by introducing features of the protocol LBAR Optimization of AODV routing protocol in mobile ad-hoc network by introducing features of the protocol LBAR GUIDOUM AMINA University of SIDI BEL ABBES Department of Electronics Communication Networks,

More information

ISSUES AND CHALLENGES OF QUALITY OF SERVICE IN MOBILE ADHOC NETWORK

ISSUES AND CHALLENGES OF QUALITY OF SERVICE IN MOBILE ADHOC NETWORK ISSUES AND CHALLENGES OF QUALITY OF SERVICE IN MOBILE ADHOC NETWORK Mukesh Kumar Student (Ph.D) Department of Computer Engineering The Technological Institute of Textile and Science, Bhiwani-127021, Haryana

More information

Load-balancing Approach for AOMDV in Ad-hoc Networks R. Vinod Kumar, Dr.R.S.D.Wahida Banu

Load-balancing Approach for AOMDV in Ad-hoc Networks R. Vinod Kumar, Dr.R.S.D.Wahida Banu Load-balancing Approach for AOMDV in Ad-hoc Networks R. Vinod Kumar, Dr.R.S.D.Wahida Banu AP/ECE HOD/ECE Sona College of Technology, GCE, Salem. Salem. ABSTRACT Routing protocol is a challenging issue

More information

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility

More information

Performance Analysis of QoS Multicast Routing in Mobile Ad Hoc Networks Using Directional Antennas

Performance Analysis of QoS Multicast Routing in Mobile Ad Hoc Networks Using Directional Antennas I.J.Computer Network and Information Security, 21, 2, 26-32 Published Online December 21 in MECS (http://www.mecs-press.org/) Performance Analysis of QoS Multicast Routing in Mobile Ad Hoc Networks Using

More information

Advanced Computer Networks

Advanced Computer Networks Introduction to Mobile Ad hoc Networks (MANETs) Advanced Computer Networks Outline Ad hoc networks Differences to other networks Applications Research areas Routing Other research areas Enabling Technologies

More information

Implementation Experience of a Prototype for Video Streaming over Wireless Mesh Networks

Implementation Experience of a Prototype for Video Streaming over Wireless Mesh Networks Implementation Experience of a Prototype for Video Streaming over Wireless Mesh Networks Yingnan Zhu Department of Computer Science University of Missouri-Columbia Columbia, MO 65201 Hang Liu, Mingquan

More information

Delay aware Reactive Routing Protocols for QoS in MANETs: a Review

Delay aware Reactive Routing Protocols for QoS in MANETs: a Review Delay aware Reactive Routing Protocols for QoS in MANETs: a Review Saad M. Adam*, Rosilah Hassan Network and Communication Technology Research Group, Faculty of Information Science and Technology, Universiti

More information

Keywords- manet, routing protocols, aodv, olsr, grp,data drop parameter.

Keywords- manet, routing protocols, aodv, olsr, grp,data drop parameter. Volume 5, Issue 3, March 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Evaluation of

More information

Position and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks

Position and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks Position and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks 1 Taifei Zhao, 2 Xizheng Ke, 3 Peilin Yang *1,Corresponding Author Department of Electronics Engineering, Xi an University of Technology,

More information

Security in Ad Hoc Network

Security in Ad Hoc Network Security in Ad Hoc Network Bingwen He Joakim Hägglund Qing Gu Abstract Security in wireless network is becoming more and more important while the using of mobile equipments such as cellular phones or laptops

More information

Simulation Analysis of Different Routing Protocols Using Directional Antenna in Qualnet 6.1

Simulation Analysis of Different Routing Protocols Using Directional Antenna in Qualnet 6.1 Simulation Analysis of Different Routing Protocols Using Directional Antenna in Qualnet 6.1 Ankit Jindal 1, Charanjeet Singh 2, Dharam Vir 3 PG Student [ECE], Dept. of ECE, DCR University of Science &

More information

Simulation of Internet Connectivity for Mobile Ad Hoc Networks in Network Simulator-2

Simulation of Internet Connectivity for Mobile Ad Hoc Networks in Network Simulator-2 Simulation of Internet Connectivity for Mobile Ad Hoc Networks in Network Simulator-2 Sulaiman Khalifa Yakhlef, Ismail Shrena, Nasaraldian Ambark Shashoa Azzaytuna University, Faculty of Engineering Tarhuna

More information

Study of Network Characteristics Incorporating Different Routing Protocols

Study of Network Characteristics Incorporating Different Routing Protocols Study of Network Characteristics Incorporating Different Routing Protocols Sumitpal Kaur #, Hardeep S Ryait *, Manpreet Kaur # # M. Tech Student, Department of Electronics and Comm. Engineering, Punjab

More information

LIST OF FIGURES. Figure No. Caption Page No.

LIST OF FIGURES. Figure No. Caption Page No. LIST OF FIGURES Figure No. Caption Page No. Figure 1.1 A Cellular Network.. 2 Figure 1.2 A Mobile Ad hoc Network... 2 Figure 1.3 Classifications of Threats. 10 Figure 1.4 Classification of Different QoS

More information

Performance Analysis of Spatial Reused Bandwidth Reservation in Ad Hoc Networks

Performance Analysis of Spatial Reused Bandwidth Reservation in Ad Hoc Networks I.J. Information Technology and Computer Science, 2,, 4-46 Published Online November 2 in MECS (http://www.mecs-press.org/) Performance Analysis of Spatial Reused Bandwidth Reservation in Ad Hoc Networks

More information

Quality of Service Routing in Mobile Ad Hoc Networks

Quality of Service Routing in Mobile Ad Hoc Networks RESOURCE MANAGEMENT IN WIRELESS NETWORKING M. Cardei, I. Cardei and D.-Z. Du (Eds.) pp. - c 2004 Kluwer Academic Publishers Quality of Service Routing in Mobile Ad Hoc Networks Imad Jawhar Department of

More information

CHAPTER 6. VOICE COMMUNICATION OVER HYBRID MANETs

CHAPTER 6. VOICE COMMUNICATION OVER HYBRID MANETs CHAPTER 6 VOICE COMMUNICATION OVER HYBRID MANETs Multimedia real-time session services such as voice and videoconferencing with Quality of Service support is challenging task on Mobile Ad hoc Network (MANETs).

More information

2. Related protocols. 1. Introduction

2. Related protocols. 1. Introduction Virtual Cellular Infrastructure For Mobile Ad hoc Network Muthu Chidambaranathan.P, Sundaresan S muthuc@nitt.edu Department of electronics and communication engineering National institute of technology,

More information

Performance Comparison of AODV, DSDV, DSR and TORA Routing Protocols in MANETs

Performance Comparison of AODV, DSDV, DSR and TORA Routing Protocols in MANETs International Research Journal of Applied and Basic Sciences. Vol., 3 (7), 1429-1436, 2012 Available online at http:// www. irjabs.com ISSN 2251-838X 2012 Performance Comparison of AODV, DSDV, DSR and

More information

Comprehensive Evaluation of AODV, DSR, GRP, OLSR and TORA Routing Protocols with varying number of nodes and traffic applications over MANETs

Comprehensive Evaluation of AODV, DSR, GRP, OLSR and TORA Routing Protocols with varying number of nodes and traffic applications over MANETs IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 9, Issue 3 (Mar. - Apr. 2013), PP 54-61 Comprehensive Evaluation of AODV, DSR, GRP, OLSR and TORA Routing Protocols

More information

Internet Connectivity for Ad hoc Mobile Networks

Internet Connectivity for Ad hoc Mobile Networks Internet Connectivity for Ad hoc Mobile Networks Yuan Sun Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara suny, ebelding @cs.ucsb.edu Charles E. Perkins

More information

PERFORMANCE ANALYSIS OF AODV, DSDV AND AOMDV USING WIMAX IN NS-2

PERFORMANCE ANALYSIS OF AODV, DSDV AND AOMDV USING WIMAX IN NS-2 International Journal of Computer Engineering & Technology (IJCET) Volume 7, Issue 1, Jan-Feb 2016, pp. 01-08, Article ID: IJCET_07_01_001 Available online at http://www.iaeme.com/ijcet/issues.asp?jtype=ijcet&vtype=7&itype=1

More information

PERFORMANCE ANALYSIS OF AODV, DSR AND ZRP ROUTING PROTOCOLS IN MANET USING DIRECTIONAL ANTENNA

PERFORMANCE ANALYSIS OF AODV, DSR AND ZRP ROUTING PROTOCOLS IN MANET USING DIRECTIONAL ANTENNA International Research Journal of Engineering and Technology (IRJET) e-issn: -00 Volume: 0 Issue: 0 Oct-01 www.irjet.net p-issn: -00 PERFORMANCE ANALYSIS OF AODV, DSR AND ZRP ROUTING PROTOCOLS IN MANET

More information

Security and Scalability of MANET Routing Protocols in Homogeneous & Heterogeneous Networks

Security and Scalability of MANET Routing Protocols in Homogeneous & Heterogeneous Networks Security and Scalability of MANET Routing Protocols in Homogeneous & Heterogeneous Networks T.V.P. Sundararajan 1, Karthik 2, A. Shanmugam 3 1. Assistant Professor, Bannari Amman Institute Of Technology,

More information

Formal Measure of the Effect of MANET size over the Performance of Various Routing Protocols

Formal Measure of the Effect of MANET size over the Performance of Various Routing Protocols Formal Measure of the Effect of MANET size over the Performance of Various Routing Protocols Er. Pooja Kamboj Research Scholar, CSE Department Guru Nanak Dev Engineering College, Ludhiana (Punjab) Er.

More information

Performance Evaluation of Aodv and Dsr Routing Protocols for Vbr Traffic for 150 Nodes in Manets

Performance Evaluation of Aodv and Dsr Routing Protocols for Vbr Traffic for 150 Nodes in Manets Performance Evaluation of Aodv and Dsr Routing Protocols for Vbr Traffic for 150 Nodes in Manets Gurpreet Singh, 1 Atinderpal Singh 2, 1, 2 Department of CSE & IT, BBSBEC, Fatehgarh Sahib, Punjab, India

More information

Cluster-based Multi-path Routing Algorithm for Multi-hop Wireless Network

Cluster-based Multi-path Routing Algorithm for Multi-hop Wireless Network International Journal of Future Generation Communication and Networking 67 Cluster-based Multi-path Routing Algorithm for Multi-hop Wireless Network Jie Zhang, Choong Kyo Jeong, Goo Yeon Lee, Hwa Jong

More information

Step by Step Procedural Comparison of DSR, AODV and DSDV Routing protocol

Step by Step Procedural Comparison of DSR, AODV and DSDV Routing protocol th International Conference on Computer Engineering and Technology (ICCET ) IPCSIT vol. () () IACSIT Press, Singapore Step by Step Procedural Comparison of DSR, AODV and DSDV Routing protocol Amith Khandakar

More information

Investigating the Performance of Routing Protocols Using Quantitative Metrics in Mobile Ad Hoc Networks

Investigating the Performance of Routing Protocols Using Quantitative Metrics in Mobile Ad Hoc Networks Investigating the Performance of Routing Protocols Using Quantitative Metrics in Mobile Ad Hoc Networks T. Jagadeepak 1, Dr. B. Prabhakara Rao 2, B. A. S. Roopa Devi 3 PG Student, Dept. of ECE, UCEK, JNTU,

More information

Intelligent Agents for Routing on Mobile Ad-Hoc Networks

Intelligent Agents for Routing on Mobile Ad-Hoc Networks Intelligent Agents for Routing on Mobile Ad-Hoc Networks Y. Zhou Dalhousie University yzhou@cs.dal.ca A. N. Zincir-Heywood Dalhousie University zincir@cs.dal.ca Abstract This paper introduces a new agent-based

More information

`PERFORMANCE COMPARISON OF ENERGY EFFICIENT AODV PROTOCOLS

`PERFORMANCE COMPARISON OF ENERGY EFFICIENT AODV PROTOCOLS `PERFORMANCE COMPARISON OF ENERGY EFFICIENT AODV PROTOCOLS Divya Sharma CSE Dept, ITM Guargoan divya@itmindia.edu Ashwani Kush Computer Dept, University College Kurukshetra University India akush@kuk.ac.in

More information

ADAPTIVE LINK TIMEOUT WITH ENERGY AWARE MECHANISM FOR ON-DEMAND ROUTING IN MANETS

ADAPTIVE LINK TIMEOUT WITH ENERGY AWARE MECHANISM FOR ON-DEMAND ROUTING IN MANETS ADAPTIVE LINK TIMEOUT WITH ENERGY AWARE MECHANISM FOR ON-DEMAND ROUTING IN MANETS M. Tamilarasi 1, T.G. Palanivelu 2, 1, 2 Department of ECE, Pondicherry Engineering College, Puducherry-605014. Email:

More information

Figure 1. The Example of ZigBee AODV Algorithm

Figure 1. The Example of ZigBee AODV Algorithm TELKOMNIKA Indonesian Journal of Electrical Engineering Vol.12, No.2, February 2014, pp. 1528 ~ 1535 DOI: http://dx.doi.org/10.11591/telkomnika.v12i2.3576 1528 Improving ZigBee AODV Mesh Routing Algorithm

More information

A Study of Internet Connectivity for Mobile Ad Hoc Networks in NS 2

A Study of Internet Connectivity for Mobile Ad Hoc Networks in NS 2 A Study of Internet Connectivity for Mobile Ad Hoc Networks in NS 2 Alex Ali Hamidian January 2003 Department of Communication Systems Lund Institute of Technology, Lund University Box 118 S-221 00 Lund

More information

An Extended AODV Protocol to Support Mobility in Hybrid Networks

An Extended AODV Protocol to Support Mobility in Hybrid Networks An Extended AODV Protocol to Support Mobility in Hybrid Networks Sèmiyou A. Adédjouma* Polytechnic School of Abomey-Calavi (EPAC) University of Abomey-Calavi (UAC) Cotonou, Benin *semiyou.adedjouma {at}

More information

CAODV: Routing in Mobile Ad-hoc Cognitive Radio Networks

CAODV: Routing in Mobile Ad-hoc Cognitive Radio Networks : Routing in Mobile Ad-hoc Cognitive Radio Networks Angela Sara Cacciapuoti, Cosimo Calcagno, Marcello Caleffi Department of Biomedical, Electronics and Telecommunications Engineering University of Naples

More information

Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization

Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization 1 Neha Ujala Tirkey, 2 Navendu Nitin, 3 Neelesh Agrawal, 4 Arvind Kumar Jaiswal 1 M. Tech student, 2&3 Assistant Professor,

More information

Adaptive Bandwidth Management and QoS Provisioning in Large Scale Ad Hoc Networks

Adaptive Bandwidth Management and QoS Provisioning in Large Scale Ad Hoc Networks Adaptive Bandwidth Management and QoS Provisioning in Large Scale Ad Hoc Networks Kaixin Xu, Ken Tang, Rajive Bagrodia Scalable Network Technologies, Inc. {xkx, ktang,rlb}@scalable-networks.com Mario Gerla

More information

Keywords: DSDV and AODV Protocol

Keywords: DSDV and AODV Protocol Volume 3, Issue 12, December 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Comparison

More information

Performance Comparison and Analysis of Three Gateway Discovery. Protocols of Internet Connectivity for Ad Hoc Networks

Performance Comparison and Analysis of Three Gateway Discovery. Protocols of Internet Connectivity for Ad Hoc Networks Jan. 2006, Volume 3, No.1 (Serial No.14) Journal of Communication and Computer, ISSN1548-7709, USA Performance Comparison and Analysis of Three Gateway Discovery Protocols of Internet Connectivity for

More information

A Workload-Based Adaptive Load-Balancing Technique for Mobile Ad Hoc Networks

A Workload-Based Adaptive Load-Balancing Technique for Mobile Ad Hoc Networks A Workload-Based Adaptive Load-Balancing Technique for Mobile Ad Hoc Networks Young J. Lee and George F. Riley School of Electrical & Computer Engineering Georgia Institute of Technology, Atlanta, GA 30332

More information

Quality of Service for MANETs connected to the Internet

Quality of Service for MANETs connected to the Internet Quality of Service for MANETs connected to the Internet Andreas J. Kassler 1, ChenShanShan 2 1 Karlstad University, Computer Science Department, Universitetgatan 2, 65188 Karlstad, Sweden, kassler@ieee.org

More information

An Analysis of the Optimum Node Density for Ad hoc Mobile Networks

An Analysis of the Optimum Node Density for Ad hoc Mobile Networks An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith y, and Louise E. Moser y Department of Computer Science y Department of Electrical and Computer

More information

Load Balancing and Resource Reservation in Mobile Ad-Hoc Networks 1

Load Balancing and Resource Reservation in Mobile Ad-Hoc Networks 1 Load Balancing and Resource Reservation in Mobile Ad-Hoc Networks 1 Gautam Chakrabarti Sandeep Kulkarni Department of Computer Science and Engineering Michigan State University Abstract To ensure uninterrupted

More information

Multi Channel, Multi Radio

Multi Channel, Multi Radio Multi Channel, Multi Radio Lecture Outline What is multi channel, multi radio Why use multi channel, multi radio? Design Issues in using multi channel, multi radio. Examples of protocols MMAC HMCP Link

More information

Performance Evaluation of The Split Transmission in Multihop Wireless Networks

Performance Evaluation of The Split Transmission in Multihop Wireless Networks Performance Evaluation of The Split Transmission in Multihop Wireless Networks Wanqing Tu and Vic Grout Centre for Applied Internet Research, School of Computing and Communications Technology, Glyndwr

More information

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK AN OVERVIEW OF MOBILE ADHOC NETWORK: INTRUSION DETECTION, TYPES OF ATTACKS AND

More information

other. A B AP wired network

other. A B AP wired network 1 Routing and Channel Assignment in Multi-Channel Multi-Hop Wireless Networks with Single-NIC Devices Jungmin So + Nitin H. Vaidya Department of Computer Science +, Department of Electrical and Computer

More information

Keywords MANET, omni directional antenna, directional antennas, QoS, Reactive routing protocols, AODV

Keywords MANET, omni directional antenna, directional antennas, QoS, Reactive routing protocols, AODV Volume 5, Issue 6, June 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Improvement of

More information

An Efficient AODV-Based Algorithm for Small Area MANETS

An Efficient AODV-Based Algorithm for Small Area MANETS An Efficient AODV-Based Algorithm for Small Area MANETS Jai Prakash Kumawat 1, Prakriti Trivedi 2 PG Student, Department of Computer Engineering & IT, Government Engineering College, Ajmer, India 1 Assistant

More information

Energy Efficiency of Load Balancing in MANET Routing Protocols

Energy Efficiency of Load Balancing in MANET Routing Protocols Energy Efficiency of Load Balancing in MANET Routing Protocols Sunsook Jung, Nisar Hundewale, Alex Zelikovsky Abstract This paper considers energy constrained routing protocols and workload balancing techniques

More information

A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network

A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-2 E-ISSN: 2347-2693 A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network

More information

Comparative Study of Performance Evaluation for Mobile Ad hoc networks using a proxy node

Comparative Study of Performance Evaluation for Mobile Ad hoc networks using a proxy node Comparative Study of Performance Evaluation for Mobile Ad hoc networks using a proxy node G. E. RIZOS georizos@teiep.gr D. C. VASILIADIS dvas@teiep.gr E. STERGIOU ster@teiep.gr Abstract: In this paper,

More information

A Distributed Slots Reservation Protocol for QoS Routing on TDMA-Based Mobile Ad Hoc Networks

A Distributed Slots Reservation Protocol for QoS Routing on TDMA-Based Mobile Ad Hoc Networks A Distributed Slots Reservation Protocol for QoS Routing on TDMABased Mobile Ad Hoc Networks KueiPing Shih, ChihYung Chang, YenDa Chen, and TsungHan Chuang Department of Computer Science and Information

More information

Security for Ad Hoc Networks. Hang Zhao

Security for Ad Hoc Networks. Hang Zhao Security for Ad Hoc Networks Hang Zhao 1 Ad Hoc Networks Ad hoc -- a Latin phrase which means "for this [purpose]". An autonomous system of mobile hosts connected by wireless links, often called Mobile

More information

Comparison of RIP, EIGRP, OSPF, IGRP Routing Protocols in Wireless Local Area Network (WLAN) By Using OPNET Simulator Tool - A Practical Approach

Comparison of RIP, EIGRP, OSPF, IGRP Routing Protocols in Wireless Local Area Network (WLAN) By Using OPNET Simulator Tool - A Practical Approach Comparison of RIP, EIGRP, OSPF, IGRP Routing Protocols in Wireless Local Area Network (WLAN) By Using OPNET Simulator Tool - A Practical Approach U. Dillibabau 1, Akshay 2, M. Lorate Shiny 3 UG Scholars,

More information

Towards a New Approach in Available Bandwidth Measures on Mobile Ad Hoc Networks

Towards a New Approach in Available Bandwidth Measures on Mobile Ad Hoc Networks Acta Polytechnica Hungarica Vol. 8, No. 4, 2011 Towards a New Approach in Available Bandwidth Measures on Mobile Ad Hoc Networks Redouane Belbachir, Zoulikha M. Mekkakia, Ali Kies Department of Data Processing,

More information

Micro Mobility and Internet Access Performance for TCP Connections in Ad hoc Networks

Micro Mobility and Internet Access Performance for TCP Connections in Ad hoc Networks Micro Mobility and Internet Access Performance for TCP Connections in Ad hoc Networks Anders Nilsson, Ali Hamidian, Ulf Körner Department of Communication Systems Lund University, Sweden Box118,221Lund

More information

Dynamic bandwidth allocation for QoS routing on TDMA-based mobile ad hoc networks

Dynamic bandwidth allocation for QoS routing on TDMA-based mobile ad hoc networks Computer Communications 29 (2006) 1316 1329 www.elsevier.com/locate/comcom Dynamic bandwidth allocation for QoS routing on TDMA-based mobile ad hoc networks Kuei-Ping Shih *, Chih-Yung Chang, Yen-Da Chen,

More information

International Journal of Wireless & Mobile Networks (IJWMN) Vol. 4, No. 2, April 2012

International Journal of Wireless & Mobile Networks (IJWMN) Vol. 4, No. 2, April 2012 PERFORMANCE EVALUATION OF DIFFERENT WIRELESS AD HOC ROUTING PROTOCOLS Niranjan Kumar Ray 1 and Ashok Kumar Turuk 2 Department of Computer Science and Engineering, National Institute of Technology Rourkela,

More information

TOPOLOGIES NETWORK SECURITY SERVICES

TOPOLOGIES NETWORK SECURITY SERVICES TOPOLOGIES NETWORK SECURITY SERVICES 1 R.DEEPA 1 Assitant Professor, Dept.of.Computer science, Raja s college of Tamil Studies & Sanskrit,Thiruvaiyaru ABSTRACT--In the paper propose about topology security

More information

Quality of Service Support in Mobile ad-hoc IP Networks *

Quality of Service Support in Mobile ad-hoc IP Networks * Quality of Service Support in Mobile ad-hoc IP Networks * Derya H. Cansever GTE Laboratories 40 Sylvan Road Waltham, MA 02454 Arnold M. Michelson GTE Government Systems 400 John Quincy Adams Road Taunton,

More information

PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS

PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS Reza Azizi Engineering Department, Bojnourd Branch, Islamic Azad University, Bojnourd, Iran reza.azizi@bojnourdiau.ac.ir

More information

PERFORMANCE BASED SECURE OPTIMIZED ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORK

PERFORMANCE BASED SECURE OPTIMIZED ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORK Volume 3, No. 4, April 2012 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info PERFORMANCE BASED SECURE OPTIMIZED ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORK

More information

Security Scheme for Distributed DoS in Mobile Ad Hoc Networks

Security Scheme for Distributed DoS in Mobile Ad Hoc Networks Security Scheme for Distributed DoS in Mobile Ad Hoc Networks Sugata Sanyal 1, Ajith Abraham 2, Dhaval Gada 3, Rajat Gogri 3, Punit Rathod 3, Zalak Dedhia 3 and Nirali Mody 3 1 School of Technology and

More information

Performance of Conferencing over MANET Routing Protocols

Performance of Conferencing over MANET Routing Protocols Performance of Conferencing over MANET Routing Protocols Md. Ibrahim Abdullah 1, M. Muntasir Rahman 2, Ahsan-ul-Ambia 3, Md. Zulfiker Mahmud 4 1,2,3 Computer Science and Engineering, Islamic University,

More information

Comparing the Performance of the Ad Hoc Network under Attacks on Different Routing Protocol

Comparing the Performance of the Ad Hoc Network under Attacks on Different Routing Protocol , pp. 195-208 http://dx.doi.org/10.14257/ijsia.2015.9.6.19 Comparing the Performance of the Ad Hoc Network under Attacks on Different Routing Protocol Haiyan Liu 1, * and Zhanlei Shang 2 Engineering Training

More information

Attenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction

Attenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction Wireless Physical Layer Q1. Is it possible to transmit a digital signal, e.g., coded as square wave as used inside a computer, using radio transmission without any loss? Why? It is not possible to transmit

More information

Path Selection Analysis in MPLS Network Based on QoS

Path Selection Analysis in MPLS Network Based on QoS Cumhuriyet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi (CFD), Cilt:36, No: 6 Özel Sayı (2015) ISSN: 1300-1949 Cumhuriyet University Faculty of Science Science Journal (CSJ), Vol. 36, No: 6 Special

More information

Gateway Load Balancing in Integrated Internet- MANET to Improve Network Performance

Gateway Load Balancing in Integrated Internet- MANET to Improve Network Performance Gateway Load Balancing in Integrated Internet- MANET to Improve Network Performance Ajay Kumar 1, Udai Shankar 2, Mahesh Kumar Tiwari 3 1 2 3 Department of Computer science & Engineering and Information

More information

QoS routing for mobile ad hoc networks

QoS routing for mobile ad hoc networks QoS routing for mobile ad hoc networks Chenxi Zhu and M. Scott Corson Flarion Technologies, Bedminster, New Jersey 07921 (czhu,corson@flarion.com) Abstract A Quality-of-Service (QoS) routing protocol is

More information

A Performance Comparison of Stability, Load-Balancing and Power-Aware Routing Protocols for Mobile Ad Hoc Networks

A Performance Comparison of Stability, Load-Balancing and Power-Aware Routing Protocols for Mobile Ad Hoc Networks A Performance Comparison of Stability, Load-Balancing and Power-Aware Routing Protocols for Mobile Ad Hoc Networks Natarajan Meghanathan 1 and Leslie C. Milton 2 1 Jackson State University, 1400 John Lynch

More information

Routing Analysis in Wireless Mesh Network with Bandwidth Allocation

Routing Analysis in Wireless Mesh Network with Bandwidth Allocation International Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249 8958, Volume-2, Issue-3, February 213 Routing Analysis in Wireless Mesh Network with Bandwidth Allocation T.S. Starlin, D.

More information

Routing with Load Balancing in Wireless Ad hoc Networks

Routing with Load Balancing in Wireless Ad hoc Networks Routing with Load Balancing in Wireless Ad hoc Networks Hossam Hassanein and Audrey Zhou Department of Computing and Information Science Queen's University Kingston, Ontario, Canada, K7L 3N6 {hossam, zhou}@cs.queensu.ca

More information

Suganya D. Computer Science and Engineering, Anna University SMK FOMRA Institute of Technology, Chennai, India Suganya2086@yahoo.

Suganya D. Computer Science and Engineering, Anna University SMK FOMRA Institute of Technology, Chennai, India Suganya2086@yahoo. gopalax -International Journal of Technology And Engineering System(IJTES): Jan March 2011- Vol.2.No.2. ) Most Efficient Multicast structure for Wireless Mesh Networks Suganya D Computer Science and Engineering,

More information

Ariadne A Secure On-Demand Routing Protocol for Ad-Hoc Networks

Ariadne A Secure On-Demand Routing Protocol for Ad-Hoc Networks Ariadne A Secure On-Demand Routing Protocol for Ad-Hoc Networks Authors: Yih-Chun Hu, Adrian Perrig, David B Johnson Presenter: Sameer Korrapati Date: 4/21/2003 Overview of presentation Introduction :

More information

Ad hoc On Demand Distance Vector (AODV) Routing Protocol

Ad hoc On Demand Distance Vector (AODV) Routing Protocol Ad hoc On Demand Distance Vector (AODV) Routing Protocol CS: 647 Advanced Topics in Wireless Networks Dr. Baruch Awerbuch & Dr. Amitabh Mishra Department of Computer Science Johns Hopkins 4-1 Reading Chapter

More information

Adaptive Multiple Metrics Routing Protocols for Heterogeneous Multi-Hop Wireless Networks

Adaptive Multiple Metrics Routing Protocols for Heterogeneous Multi-Hop Wireless Networks Adaptive Multiple Metrics Routing Protocols for Heterogeneous Multi-Hop Wireless Networks Lijuan Cao Kashif Sharif Yu Wang Teresa Dahlberg Department of Computer Science, University of North Carolina at

More information

EXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL

EXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL EXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL by Pedro Eduardo Villanueva-Pena, Thomas Kunz Carleton University January, 2006 This report examines mechanisms to gradually

More information

A Review of Secure Ad-hoc Routing

A Review of Secure Ad-hoc Routing www..org 30 A Review of Secure Ad-hoc Routing Tannu Arora 1, Deepika Arora 2 1 Computer Science, M.D.U/GIET, Sonipat, Haryana, India tannu.arora@gmail.com 2 Computer Science, C.D.L.U, Sirsa, Haryana, India

More information

Real-Time Traffic Support in Heterogeneous Mobile Networks

Real-Time Traffic Support in Heterogeneous Mobile Networks Real-Time Traffic Support in Heterogeneous Mobile Networks Yuan Sun Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara {suny, ebelding}@cs.ucsb.edu Xia Gao

More information

CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS

CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of

More information