PAPER Support of Efficient Route Discovery in Mobile Ad Hoc Access Networks

Size: px
Start display at page:

Download "PAPER Support of Efficient Route Discovery in Mobile Ad Hoc Access Networks"

Transcription

1 1252 PAPER Support of Efficient Route Discovery in Mobile Ad Hoc Access Networks Chun-Yen HSU a), Student Member, Jean-Lien C. WU, and Shun-Te WANG, Nonmembers SUMMARY The Public Wireless Local Area Network (PWLAN) is an emerging service for wireless access to the Internet. However, the service coverage of the PWLAN is limited by the deployment of access points (APs) because only those who stay near the AP can access the PWLAN. A feasible way of extending the service coverage of a PWLAN is to deploy mobile ad hoc access networks (MAHANs) so that users who are not in an AP s radio coverage area can send their packets to the AP in a multihop manner. However, in a MAHAN, mobile nodes that intend to access the Internet have to discover routes to the AP first, which may result in considerable bandwidth cost. In this paper, we propose the Appointed BrOadcast (ABO) method to reduce the cost of route discovery in MAHANs. Using the ABO method can achieve this goal on the basis of packet overhearing. Functions that are necessary for network and data link layers to employ the ABO method are also discussed. Simulation results show that using the ABO method can significantly reduce the cost on route discoveries. Due to the widespread use of legacy IEEE nodes, the problem of how ABO-enhanced and legacy IEEE nodes can coexist in a MAHAN is also discussed. key words: mobile ad hoc access network (MAHAN), public wireless local area network (PWLAN), IEEE , routing, packet overhearing, Internet 1. Introduction With the evolution of wireless devices as well as wireless technologies, accessing the Internet via laptops or PDAs instead of desktop computers as we use today is expected to be an everyday occurrence in the future. The public wireless local area network (PWLAN), which enables user to access the Internet via WLANs ubiquitously or at least at some hotspots such as airports, stations, libraries or museums, emerges with this trend [1] [4]. However, the service coverage of a PWLAN is limited by the deployment of access points (APs), i.e., only users that stay near an AP can connect to the AP directly. In order to extend the service coverage of PWLANs, the mobile ad hoc access network (MAHAN), as shown in Fig. 1, can be a feasible solution because of the following two reasons. The first one is that there is no need of infrastructures. In a MAHAN, each node acts as an end point as well as a router for other nodes. Those who are not in the radio coverage of the AP can rely on their Manuscript received May 18, Manuscript revised October 5, The author is with the Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C. The authors are with the Department of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C. a) yen@nlhyper.et.ntust.edu.tw DOI: /ietcom/e89 b Fig. 1 The mobile ad hoc access network. (MAHAN) neighbors to forward packets to the AP in a multihop manner. The second one is that using the MAHAN can mitigate the effect of dead spot. This is valuable especially for the urban environment where the shadowing effect could be a problem. The MAHAN is a special case of mobile ad hoc networks (MANETs) [5] that has two characteristics: There is a hot node (i.e., the AP) that all traffics flow through it. This hot node is fixed and has no energy consumption concerns. While many routing protocols for MANETs also work in MAHANs, they can be further optimized [6] [12]. Because of the node mobility, route failures may occur abruptly and frequently, therefore routing protocols must be adaptive. However, the limited radio bandwidth as well as the imperfect channel quality dictate the amount of routing information exchanged and make routing in MAHANs a laborious work. Routing protocols for such a dynamic network environment can be either proactive or reactive according to the maintenance strategy of routing tables. A detailed description and comparison between proactive and reactive routing protocols can be found in [13]. In this paper, reactive routing is considered. A typical reactive routing protocol is described as follows. When a packet arrives at the network layer of a source node that has no valid route information to the destination, a route request (RREQ) message will be broadcasted. Having received the RREQ message, either the destination node or an intermediate node that has valid route information to the destination can reply a route reply (RREP) message to the source node using unicast. When the source node receives the RREP message, it can begin to forward packets along the discovered route. If the route fails because of link failures, the upstream node of the failed link will initiate a route error (RERR) messageto notify the source node. The forwarding of RERR message can be either broadcast if it is used to notify multiple nodes, or uni- Copyright c 2006 The Institute of Electronics, Information and Communication Engineers

2 HSU et al.: SUPPORT OF EFFICIENT ROUTE DISCOVERY IN MOBILE AD HOC ACCESS NETWORKS 1253 cast otherwise. In this paper, we propose the Appointed BrOadcast (ABO) method to minimize the route discovery cost. The ABO method achieves this goal on the basis of packet overhearing. Details of the ABO method are provided in Sect. 3. Because of the widespread use of legacy IEEE nodes [14], the coexistence situation of both ABO-enhanced nodes and legacy IEEE nodes in a MAHAN is also discussed. The rest of this paper is organized as follows. Section 2 provides the concepts of packet overhearing in IEEE MAC protocol. The proposed ABO method and its performance evaluation are provided in Sects. 3 and 4, respectively. Finally we conclude this paper in Sect Packet Overhearing in IEEE MAC Protocol A route discovery process is necessary in ad hoc networks but it may involve large amount of control messages (i.e., the RREQ and consequent RREP messages) and thus introduce considerable amount of overhead. To reduce the overhead on route discovery, one approach is to allow nodes to overhear packets sent by their neighboring nodes. Routing information may be obtained in advance by analyzing the overheard packets and hence the frequency of route discoveries is reduced. It has been shown in the literature that packet overhearing can significantly reduce the number of control messages produced for route discovery [15], [16]. In the Adhoc On-demand Distance Vector with Backup Routes routing protocol (AODV-BR) [17], backup routes are used to recover from route failures. By overhearing packets, backup routes can be constructed in the process of route discovery without producing extra control messages. Packet overhearing is helpful to reduce route discovery cost, however, in current IEEE MAC design, frames that are not targeted to the node will be discarded. If a node needs to receive packets that are not targeted to it, it is essential to set the node s network interface into promiscuous mode. In this mode, the MAC address filtering function that discards frames not targeted to the node is disabled. The drawback of using promiscuous mode is that, once it is set, all frames that can be correctly received will be passed to the upper layer and the node may eventually be drowned by overheard packets. We propose the ABO method as an alternative to achieve packet overhearing. The concept of the ABO method is that, packet overhearing should be performed in a controlled manner, in other words, the network layer should be able to actively select critical packets that need to be disseminated to neighbors. In this way, nodes only overhear critical packets, and then the load on processing overheard packets is reduced while the benefit of packet overhearing is retained. 3. The Proposed ABO Method In the ABO method, a special type of frame called the ABO frame, which is a modified IEEE data frame and can Fig. 2 The IEEE frame format in ad hoc mode. Fig. 3 The ABO frame structure. coexist with legacy IEEE data frames, is introduced. The ABO method takes advantage of the ABO frames to achieve packet overhearing. At the MAC layer, the packets that need to be disseminated to neighbors are carried by the ABO frame. Necessary functions in the logic link control as well as network layers in order to obtain maximum benefit available from the ABO method are also described in the following subsections. 3.1 MAC Layer Design The IEEE data frame structure in ad hoc mode is shown in Fig. 2, where the duration field is used to update the network allocation vector (NAV), address 1 holds the address of the receiver, address 2 holds the address of the transmitter and address 3 holds the basic service set identification (BSSID) of the network [14]. An ABO frame, as shown in Fig. 3, is transmitted in the way of IEEE MAC layer broadcast. However, broadcast frames in IEEE MAC design are acknowledge-free and thus unreliable. To keep the transmission to the target node reliable, the target node s MAC address is recorded in the intended receiver address (IRA) appended in the frame body. Upon receiving an ABO frame, the node whose MAC address matches the IRA will reply an ACK frame to the sender. The ABO frame, as depicted in Fig. 3, therefore has the following differences compared to legacy IEEE data frame: 1. The IRA field is appended at the end of the frame body. 2. Address 1 holds the broadcast address. 3. The duration field contains the short interframe space (SIFS) time plus the ACK frame transmission time. Note that a legacy IEEE broadcast frame has a zero value in the duration field. Hence, when a node receives a frame, it can check whether the frame is an ABO frame or not. The node examines if the address 1 field holds a broadcast address and whether the duration field contains a nonzero value. If all positive, the frame is recognized as an ABO frame, otherwise it is recognized as a legacy IEEE frame. Figure 4 depicts the corresponding processes when an IEEE node or an ABO-enhanced node receives a data frame. When an ABO-enhanced node receives a data frame, the node first checks the address 1 and the duration fields to

3 1254 Fig. 4 Processing of received data frames. see if it is an ABO frame. If true, the following steps will be triggered, otherwise, the received frame is processed in the legacy way. Step 1: Check if the IRA field matches its own MAC address, if true, prepare the ACK frame and transmit after a SIFS time period. Step 2: Trim the IRA field. Step 3: Send the MSDU to the upper layer. In generating an ABO frame, the IRA field must be included in the frame check sequence (FCS) calculation to prevent the receiving node from mistaking the ABO frame as a frame error. Similarly, if encryption is needed, the IRA field is treated as a part of the plaintext. In the IEEE MAC design, two functions are prohibited, namely, fragmentation and the RTS/CTS transaction, for broadcast frames. The transmissions of ABO frames also obey these rules. The no-fragment rule avoids the potential problem that an overhearing node fails to receive all fragments and then requests for the lost ones. This rule is convenient because in most systems, the maximum transmission unit (MTU) is set to be 1500 bytes, which is smaller than the frame body length limitation of 2312 bytes in the IEEE standard. The no- RTS/CTS rule potentially increases the probability of collisions, so a short ABO frame is preferred. 3.2 Logical Link Control and Network Layers The ABO method gives routing protocols the flexibility to selectively disseminate packets to neighbors. Packets that are to be disseminated to neighbors are carried by the ABO frame. This can be done by sending these packets via a specific service access point (SAP) to the logical link control (LLC) layer and then to the MAC layer as shown in Fig. 5. The way to select packets that are to be disseminated to neighbors could be a strategy. Routing protocol can determine the critical messages to be disseminated to neighboring nodes based on its own routing metrics and strategies. For example, in AODV-BR [17], nodes just need to overhear the Fig. 5 Protocol stack of the ABO method. RREP messages, so only RREP messages are transmitted using the ABO method while other packets are transmitted with original processes. On receiving an overheard packet, a node should first extract the routing information embedded in the packet and then discard the packet. According to the send/receive operations particularly in the ABO method, the network layer will be enhanced in two aspects in advance to take advantage of the ABO method. The first one is the awareness of the specific ABO SAP described above. The second one is that, because the next hop address in the overheard packet will not match the current node s address, the routing protocol must be able to extract the routing information embedded in the packet rather than just trigger an error and then discard it. Some routing protocols, such as the Dynamic Source Routing (DSR) [18], can handle the overheard packets and benefit from it. Other protocols, e.g., AODV [19], however, are not designed to handle overheard packets and thus enhancement is required. In most protocol designs, the network layer, LLC functions and network interface card drivers are implemented using software, so they can be enhanced easily.

4 HSU et al.: SUPPORT OF EFFICIENT ROUTE DISCOVERY IN MOBILE AD HOC ACCESS NETWORKS The Reply Storm Problem Many routing protocols allow intermediate nodes that have valid route information to the destination node to reply RREP messages upon receiving the RREQ message in order to reduce the number of broadcast RREQ messages. However, if the number of intermediate nodes that have a valid route to the destination node is large, a considerable number of RREP messages will be sent. Because all the RREP messages are sent to the source node, congestion may occur at or near the source node and hence the reply storm problem occurs [18], [20]. The reply storm problem may appear in MAHANs because all nodes have the same destination node (i.e., the AP) rather than peer-to-peer communications as in MANETs. The reply storm problem can be even worse if all RREP messages are transmitted using the ABO method because more nodes have route information to the AP. Besides, since RREP messages are carried by the ABO frame, which can be received by all the neighboring nodes, a large number of RREP messages can introduce considerable processing load to the network layer. Therefore, schemes to eliminate the reply storm problem are desired. Two schemes can be employed at the network layer to eliminate the reply storm problem. The first one is the ABO frame prohibition (AFP) scheme, which reduces the frequency on using the ABO frame. If an intermediate node has learned a new route, it is allowed to transmit an RREP message using the ABO frame for once to disseminate the new route information. Otherwise, the use of ABO frame is prohibited. The second one is that, similar to [18], when an intermediate node decides to send a RREP message to the source node, the RREP message will be deferred for a time period of DRREP before sending. During the deferring period, if the node receives a RREP message heading to the same source node, the node will discard the RREP message it prepares. DRREP can be determined according to the routing protocol s major concern. For example, in the Load-Balanced Ad hoc Routing (LBAR) [21], trafficloadis the major concern, so the deferring delay can be determined according to the load along the route. In routing protocols such as ADOV and DSR, route length is the major concern. It is intuitive to assign a smaller DRREP for more preferable routes. In this way, transmission of RREP messages for minor route will have larger deferring delay and is more likely to be discarded. 3.4 Coexistence with Legacy IEEE Nodes Because of the widespread use of the IEEE devices, the coexistence of both the ABO-enhanced and legacy IEEE nodes in one MAHAN must be considered. In the ABO method, the ABO frame has the same frame control values as that in IEEE frame, so upon receiving an ABO frame, a legacy IEEE node will take it as a normal broadcast frame. In this case, the IRA field will not be trimmed and will be passed to the upper layer as part of the Fig. 6 Handling of the legacy IEEE and ABO frames. frame body. This is safe because the IRA field will be simply trimmed by the packet length verification at the network layer [22], thus the higher layer transactions is prevented from error. How legacy IEEE and ABO-enhanced nodes handle their respective frames are depicted in Fig. 6, where the dotted lines between the NSDU and NPDU implies that they are present only at the source node and the destination node. Note that legacy IEEE nodes transmit standard IEEE frames only, thus the higher the proportion of ABO-enhanced nodes in a network, the better the dissemination efficiency. In case an ABO-enhanced node transmits an ABO frame to a legacy IEEE node, no IEEE ACK will be returned even if the ABO frame is received correctly. In this case, the transmitter will time out and take it as a transmission error, then enter the retransmission phase. However, the transmitter will eventually receive no ACK frame from the legacy IEEE node even in retransmissions. This issue is solved as follows. If an ABO frame experiences a transmission error, the subsequent retransmissions of this frame should use the legacy IEEE frame. In this way, the desired information is disseminated to neighbor nodes in the transmission of the ABO frame while the subsequent retransmissions ensure reliable transmissions to the target node. The ABO method solves the coexistence problem at the cost of more MAC layer transmissions. Because larger proportion of ABO-enhanced nodes implies more efficient route information dissemination, the additional MAC layer load can be compensated by the reduction of control messages. The simulation results on the coexistence scenario presented in the following section will verify this point. 4. Simulation Study In this section, we evaluate the performance of the ABO method using simulation. 4.1 Simulation Model In the simulation, we tested two typical routing protocols based on two different concepts: DSR [18] and AODV [19], and three different MAC protocols: legacy IEEE , ABO and promiscuous mode. DSR is a source routing protocol that the source node knows the complete hop-by-hop

5 1256 route to the destination node while AODV is a destinationoriented routing protocol that each node only knows the next hop to the destination node. In DSR, the route is specified by the source node in the packet header while in AODV, the destination node address is the only guidance to which the packet should be forwarded. Both the routing protocols are enhanced with functions described in Sects. 3.2 and 3.3 to employ the ABO method and to handle overheard packet properly. Note that the AFP scheme described in Sect. 3.3 is applicable to the ABO method but is ineffective to the other two MAC protocols. A variation of the ABO method by releasing the AFP scheme will have similar performance as the promiscuous mode because all control messages will be overheard by neighboring nodes. The only difference between using the AFP-released ABO method and using promiscuous mode is that nodes using promiscuous mode overhear data packet while nodes using the AFP-released ABO method do not. We employ the expending ring search mechanism, which is specified in both AODV and DSR, to reduce the number of RREQ messages in the network. Unicast control messages, including RREP and RERR messages, are selected to transmit using the ABO method. The deferring time DRREP is based on the following function proposed in [18]: D RREP = H (h 1 + r) where H is a small constant delay, h denotes the number of hops along the route being replied, and r is a random number uniformly distributed between 0 and 1. It is suggested that H is at least twice the maximum wireless link propagation delay [18]. We evaluated the effects of different H values as showninfig.8andfindthatwhenh is 10 ms, the control cost is the lowest. Similar simulation configurations are used as described in [12], where the channel bit rate is 2 Mb/s and the radio range is 250 meters. An AP is placed at the center of the simulation area where 50 mobile nodes are placed randomly. Three scenarios are studied: m 2, m 2 and m 2. We find that similar results can be drawn and here we only show the results using the first scenario. The data packet size is 512 bytes and the inter-arrival time of packets is 0.4 second. The simulation time is 900 seconds. The random waypoint model [23] is used for the mobility model. Each mobile node is independent and no group movement is presented. Mobile nodes are stationary (i.e., no mobility is presented) for a period of time t pause at the beginning of simulation. t pause is exponentially distributed with a mean pause time. Larger mean pause time means more stationary nodes and lower topology-changing rate. When t pause times out, the node will move to a randomly selected new location with a moving speed uniformly distributed with a range of (0, 20) m/s. When the node reaches the new location, it picks a new t pause value and remains stationary before t pause times out. The pause time ranges from 0 to 900 seconds. Note that a zero pause time implies that mobile nodes are always moving and the network topology is highly dynamic, while pause time of 900 seconds implies that all nodes are stationary during simulation. For fair comparisons, the mobility and traffic patterns are the same among the compared protocols. The presented simulation results come from a mean of 50 runs. 4.2 Performance Comparisons Table 1 summarizes performance metrics that are used for comparisons. Since the AP is assumed to have no energy concerns, the cost spent by the AP to send or receive packets and frames is not included in the simulation results. In this way, we emphasize on the costs incurred in mobile nodes. Power consumption in memory access is not considered since it is insignificant compared with that of CPU operations and wireless transmissions [24]. We use the model developed in [25] to measure the CPU time required at the network layer. Pradhan and Chiueh [25] investigated CPU time required for four packet lengths: 100, 192, 500 and 1000 bytes. We supplement the CPU time required for other packet lengths by linear regression as depicted in Fig. 7. The model developed by Feeney [16], where the corresponding parameters are given in Table 2, is used to measure the en- Table 1 The IEEE frame format in ad hoc mode. Performance metrics Description Normalized network The number of control packets (i.e., the layer control cost RREQ, RREP and RERR packets, but not data packets) sent or received at the network layer per data packet delivered to the AP. Network layer cost The total number of packets (including data and network layer control packets) sent and received at the network layer. MAC layer cost The number of frames (including data and MAC layer control frames) sent and received at the MAC layer. Normalized CPU time Required CPU time at the network layer per data packet delivered to the AP. Normalized energy consumption data packet delivered to the AP. Energy consumed at the MAC layer per Packet delivery ratio The number of data packets received by the AP to the number of packets generated by all traffic sources. Average end-to-end data packet delay Fig. 7 The average end-to-end delay of data packets. CPU time required with respect to packet length.

6 HSU et al.: SUPPORT OF EFFICIENT ROUTE DISCOVERY IN MOBILE AD HOC ACCESS NETWORKS 1257 Table 2 Parameters for energy consumption computation [16]. Parameter Description Value b tranctl Fixed energy consumption on 120 mw s transmitting a control frames. b recvctl Fixed energy consumption on 29 mw s receiving a control frames. b tran Fixed energy consumption on 246 mw s transmitting a data frame. m tran Incremental energy consumption 1.89 mw s/byte on transmitting a data frame. b recv Fixed energy consumption on 56.1 mw s receiving a data frame. m recv Incremental energy consumption mw s/byte on receiving a data frame. b discard Fixed energy consumption on 97.2 mw s discarding a frame. m discard Incremental energy consumption mw s/byte on discarding a frame. b recv prom Fixed energy consumption on 136 mw s receiving a data frame in promiscuous mode. m recv prom Incremental energy consumption on receiving a data frame in promiscuous mode mw s/byte Fig. 8 Different deferring delay. (pause time=300 s, CBR sources=25, MAC=ABO) ergy consumption at the MAC layer : At the transmitter, b tranctl + b recvctl + m tran size + b tran + b recvctl. At the destination node of the data frame, b recvctl + b tranctl + m recv size + b recv + b tranctl. At non-destination node that discards the frame, b discardctl + n T n D b discardctl + (m discard size + b discard ) + b discardctl. n T n D At non-destination node that operating in promiscuous mode, b discardctl + n T n D b discardctl + (m recv prom size + b recv prom ) + b discardctl, n T n D where T and D denote respectively the set of neighboring node of the transmitting and destination nodes. Figure 8 shows the normalized network layer control cost using different H values. H=0 implies that nodes do not defer before replying RREP message back to the source node. An underestimated H value cannot prevent the network from the reply storm problem. On the contrary, an overestimated H value may result in that the source node route discovery times out, and then route discovery is initiated again, which introduces more number of control messages. It is interesting that AODV and DSR have similar performance while they are different in routing concepts. The power of DSR is that nodes can learn routes to other Fig. 9 Packet delivery ratio. (pause time=300 s) Fig. 10 Average end-to-end data packet delay. (pause time=300 s) nodes from the packet header for future use. This is useful in peer-to-peer communications scenes [16]. However, in MAHANs, all source nodes aim at the same destination node, i.e., the AP, learning routes to nodes other than the AP does not bring extra benefit. In the following, only the result of AODV is presented. The tags , ABO and Prom in Figs. 9 to 16 indicate the corresponding results of using legacy IEEE The measurement of power consumption is based on an assumption that an ABO-enhanced network interface card consumes equivalent power compared with a legacy one.

7 1258 MAC, the ABO method and promiscuous mode, respectively. The delivery ratio and end-to-end delay subject to different number of CBR sources are depicted in Figs. 9 and 10, respectively. Promiscuous mode can achieve the highest performance in terms of delivery ratio and end-to-end delay because that it consumes the least bandwidth on routing control, thus more bandwidth is left for data transmissions and consequently the performance is improved. Using the ABO method can also achieve remarkable performance im- provement compared with that of legacy IEEE MAC. However, using the ABO method does not give as much improvement as that of using promiscuous mode because the AFP scheme causes the efficiency degradation on disseminating route information. Similar results can be observed when using different pause time as shown in Figs. 11 and 12, respectively. Figure 13 compares the number of control and data packets sent and received using the three MAC proto- Fig. 11 Packet delivery ratio. (CBR sources=25) Fig. 12 Average end-to-end data packet delay. (CBR sources=25) Fig. 13 Network layer costs. (CBR sources=25)

8 HSU et al.: SUPPORT OF EFFICIENT ROUTE DISCOVERY IN MOBILE AD HOC ACCESS NETWORKS 1259 cols. Note that even when all nodes are stationary (pause time=900 s), a small amount of RERR messages are issued. This is because, sometimes, the MAC layer transmits a frame but receives no ACK because of collisions. The MAC layer will retry until an ACK is received or the retry limit is reached. If the latter occurs, the MAC layer will signal the network layer that the wireless link is not available. The network layer then recognizes this as a route failure and initiates an RERR message to the corresponding source nodes. In Fig. 13(a), compared to legacy IEEE MAC, using the ABO method can significantly reduce the number of control packets. Using promiscuous mode can obtain even more improvements. As shown in Fig. 13(b), using promiscuous mode results in a large number of control packets arrived at the network layer since the MAC layer does not filter out frames. On the contrary, the network layer receives the least number of control packets when the ABO method is employed, because when the ABO method is used, only those packets that are carried by ABO frames (unicast RREP and RERR messages in this case) can be overheard by the network layer. Note that the AFP scheme limits the frequency on using the ABO frame, so when the ABO method is used, the number of control packets arrived at the network layer is less than that when promiscuous mode is used. On the other hand, compared with legacy IEEE MAC, the ABO method issues 50% less control packets as shown in Fig. 13(a). The reduction of control packets can compensate the increased number of received control packets caused by the use of the ABO frames. The number of control packets arrived at the network layer of the ABO method is less than that of the legacy IEEE MAC. On the number of data packets sent/received at the network layer, although using promiscuous mode results in the least cost on sending data packets as shown in Fig. 13(c), a large number of data packets are received at the network layer about 20 times as many as that of using the legacy IEEE MAC and the ABO method as depicted in Fig. 13(d). This is inevitable because using promiscuous mode, the MAC layer receives data frames and passes all of them to the upper layer without filtering. The result indicates that nodes using promiscuous mode have to spend much more computation power to deal with the overheard packets, as shown in Fig. 14. Figure 15 depicts the simulation results on the number of frames transmitted/received at the MAC layer. The number of frames transmitted is directly related to the number of packets sent at the network layer, and the number of frames received is directly related to the number of frames transmitted. Because promiscuous mode has the least number of control packets issued, it introduces the least number of frames transmitted/received at the MAC layer. However, less number of transmitted/received frames does not always imply lower energy consumption. It is reported that, for a typical wireless LAN card such as the Lucent WaveLAN IEEE PC card, receiving a frame is more expensive than discarding it because the network interface card can enter a reduced energy consumption mode during the frame transmission that will be discarded by the node [16]. The normalized energy consumption of the three MAC protocols is depicted in Fig. 16, where energy consumption is further classified according to 1) overheard frames in promiscuous mode (Overhear), 2) accepted frames that received by the node and then the MSDU is sent to the upper layer (Accept) and 3) discarded frames that are received and then discarded Fig. 14 Normalized CPU time. Fig. 15 MAC layer costs. (CBR sources=25)

9 1260 by the node (Discard). In promiscuous mode, data frames are not discarded and thus more energy is consumed compared with the other two MAC protocols. Figures 17 to 21 show the simulation results of a MA- HAN that consists of both ABO-enhanced and legacy IEEE nodes. The pause time is 300 seconds and the number of CBR sources is 25. CBR sources are evenly distributed among all mobile nodes. At the network layer, performance metrics including packet delivery ratio, endto-end delay, number of control/data packets sent/received and CPU time have better improvement when more ABOenhanced nodes are present, as shown in Figs. 17 to 19. Note that the MAC layer cost as well as the energy consumption show a minor improvement when 20% of mobile nodes are ABO-enhanced, as shown in Figs. 20 and 21, because that the ABO method solves the coexistence problem at the Fig. 16 Normalized energy consumption. (CBR sources=25) Fig. 17 Delivery ratio and delay. (coexist, pause time=300 s, CBR sources=25) Fig. 18 Network layer costs. (coexist, pause time=300 s, CBR sources=25)

10 HSU et al.: SUPPORT OF EFFICIENT ROUTE DISCOVERY IN MOBILE AD HOC ACCESS NETWORKS 1261 cost of introducing more MAC layer transmissions. The reduction of network layer control packets can compensate the increased MAC layer load, however, when the proportion of ABO-enhanced nodes is small, the compensation effect is not obvious. As a result, the improvement on MAC layer cost is minor. For larger proportion of ABO-enhanced nodes, the effect of MAC layer cost compensation is more apparent. 5. Conclusion Reactive routing protocols typically rely on broadcast-based route discovery messages (i.e., RREQ) to discover routes. When the network is highly dynamic, route failures would occur frequently and introduce considerable costs on routing control. Packet overhearing can help reduce the number of control packets and leave more bandwidth for data transmissions. Promiscuous mode is generally used to achieve packet overhearing. In promiscuous mode, the MAC layer transfers all received packets to the upper layer without filtering. Although it can achieve the highest delivery ratio and the lowest end-to-end delay while producing minimal number of control messages, using promiscuous mode will make the network interface card always in active mode and results in large amount of packets arrived at the network layer. Thus the node is forced to consume more energy and take more CPU time on processing overheard packets. Consider that wireless devices are usually equipped with lower level CPU and are powered by batteries, using promiscuous mode may cause disinclined performance degradation at the system level. In this paper, we propose the ABO method as an alternative to achieve packet overhearing. In the ABO method, packet overhearing is performed in a controlled manner that routing protocols can determine which packet to be disseminated to neighbors. The determination of disseminated packets is dependent on the routing protocol s strategy. We have shown that system and network performance, including CPU time, energy consumption, packet delivery ratio and end-to-end delay, can be significantly improved when only the route reply (RREP) and route error (RERR) messages are disseminated using the ABO method. Besides, considering the widespread used legacy IEEE standard, the coexistence problem of the ABO-enhanced and legacy IEEE nodes is also discussed. A solution to the coexistence problem is provided and evaluated in this paper. Acknowledgments The authors acknowledge the very useful feedback provided during discussions with the members of Computer Network Laboratory, NTUST. This work was supported by National Science Council under Contract Nos. NSC E and NSC E Fig. 19 Normalized CPU time. (coexist, pause time=300 s, CBR sources=25) Fig. 21 Normalized energy consumption. (coexist, pause time=300 s, 25 CBR sources) Fig. 20 MAC layer costs. (coexist, pause time=300 s, 25 CBR sources)

11 1262 References [1] A. Acharya, C. Bisdikian, A. Misra, and Y.-B. Ko, ts-pwlan: A value-add system for providing tiered wireless services in public hot-spots, Proc. IEEE ICC 2003, vol.1, pp , Anchorage, Alaska, USA, May [2] pa.shtml [3] hotspots.htm [4] en.shtml [5] Mobile Ad-hoc Networks (manet) Charter, charters/manet-charter.html [6] H. Li and D. Yu, Comparison of ad hoc and centralized multihop routing, Proc. WPMC 2002, vol.2, pp , Honolulu, Hawaii, Oct [7] Y. Sun and E.M. Belding-Royer, Application-oriented routing in hybrid wireless networks, Proc. IEEE ICC 2003, vol.1, pp , Anchorage, Alaska, USA, May [8] M. Benzaid, P. Minet, K.A. Agha, C. Adjih, and G. Allard, Integration of mobile-ip and OLSR for a universal mobility, Wireless Networks, vol.10, no.4, pp , July [9] S.H. Bae, S. Lee, and M. Gerla, Unicast performance analysis of extended ODMRP in a wired-to-wireless ad-hoc network testbed, Proc. IEEE MILCOM 2002, vol.2, pp , Anaheim, California, USA, Oct [10] P.E. Engelstad, A. Tonnesen, A. Hafslund, and G. Egeland, Internet connectivity for multi-homed proactive ad hoc networks, Proc. IEEE ICC 2004, pp , Paris, France, June [11] Y.-C. Tseng, C.-C. Shen, and W.-T. Chen, Integrating mobile IP with ad hoc networks, Computer, vol.36, no.5, pp.48 55, May [12] J.-H. Song, V.W.S. Wong, and V.C.M. Leung, Efficient on-demand routing for mobile ad hoc wireless access networks, IEEE J. Sel. Areas Commun., vol.22, no.7, pp , Sept [13] M. Abolhasan, T. Wysocki, and E. Dutkiewicz, A review of routing protocols for mobile ad hoc networks, Ad Hoc Networks, vol.2, no.1, pp.1 22, Jan [14] IEEE local and metropolitan area networks: Wireless LAN medium access control (MAC) and physical (PHY) specifications, ISO/IEC : 1999(E). [15] T. Camp, J. Boleng, B. Williams, L. Wilcox, and W. Navidi, Performance comparison of two location based routing protocols, Proc. IEEE INFOCOM 2002, vol.3, pp , New York, USA, June [16] L.M. Feeney, An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks, Mobile Networks and Applications, vol.6, no.3, pp , June [17] S.-J. Lee and M. Gerla, AODV-BR: Backup routing in ad hoc networks, Proc. IEEE WCNC 2000, vol.3, pp , Chicago, USA, Sept [18] IETF draft, 10.txt [19] IETF RFC 3561, [20] M.K. Marina and S.R. Das, Impact of caching and MAC overheads on routing performance in ad hoc networks, Comput. Commun., vol.27, no.3, pp , Feb [21] H. Hassanein and A. Zhou, Routing with load balancing in wireless ad hoc networks, Proc. ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems 2001, pp.89 96, Rome, Italy, July [22] G.R. Wright and W.R. Stevens, TCP/IP Illustrated, Volume II: The Implementation, p.216, Addison Wesley, [23] D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, Mobile Comput., pp , Kluwer Academic Publishers, Boston, USA, [24] J.R. Lorch and A.J. Smith, Software strategies for portable computer energy management, IEEE Pers. Commun., vol.5, no.3, pp.60 73, June [25] P. Pradhan and T.-C. Chiueh, Real-time performance guarantees over wired/wireless LANs, Proc. IEEE RTAS 1998, pp.29 38, Denver, Colorado, USA, June Chun-Yen Hsu received the B.S. and M.S. degrees from National Taiwan Ocean University in 1997 and 1999, respectively. He is working toward the Ph.D. degree in the Department of Computer Science and Information Engineering at the National Taiwan University of Science and Technology. His research interests include ad hoc networks, wireless LAN and wireless MAN. Jean-Lien C. Wu received the BSEE from National Taiwan University, Taiwan, in 1970, and the Ph.D. degree in EE from Cornell University, Ithaca, NY, in From 1978 to 1984, she was Member of the Technical Staff, Bell Laboratories, Holmdel, NJ. Since 1984, she has been a professor in the Electronic Engineering Department, National Taiwan Univ. of Science and Technology (NTUST), Taipei, Taiwan. She was Head of the department from 1987 to 1990, Dean of the College of Electrical and Computer Engineering from 1998 to 2001 and Dean of the Academic Affairs from 2003 to She is currently Vice President of the university. Dr. Wu is the coordinator of the Communication Engineering Program of the Engineering and Applied Sciences Dept. of the National Science Council (NSC), Taiwan. She is also a member of the advisory board of the Science and Technology Advisory Office of the Ministry of Education, Taiwan. Her current research interests are in wireless networks, broadband Internet, and mobile multimedia networks. Dr. Wu is a member of the IEEE communication society. She is also a member of the Chinese Institute of Engineerings society and the Chinese Institute of Electrical Engineerings society. Shun-Te Wang received his B.E. degree in mechanical engineering from National Taiwan University of Science and Technology, Taipei, Taiwan, in He received the M.S. degree in engineering science from National Cheng Kung University, Tainan, Taiwan, in He has been a software engineer at Institute of Information Science, Academia Sinica, Taiwan, since September Currently he is working toward a Ph.D. in the Department of Electronic Engineering at National Taiwan University of Science and Technology. His main areas of interest include pervasive computing, sensor networks, ad hoc networks, wireless networks, mobile computing, communication protocols, component software, software warehouse, authoring system, and Java collaborative computing.

Appointed BrOadcast (ABO): Reducing Routing Overhead in. IEEE Mobile Ad Hoc Networks

Appointed BrOadcast (ABO): Reducing Routing Overhead in. IEEE Mobile Ad Hoc Networks Appointed BrOadcast (ABO): Reducing Routing Overhead in IEEE 802.11 Mobile Ad Hoc Networks Chun-Yen Hsu and Shun-Te Wang Computer Network Lab., Department of Electronic Engineering National Taiwan University

More information

Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks

Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent Wong and Victor Leung Department of Electrical and Computer Engineering The University of British Columbia 56

More information

Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks

Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent W. S. Wong and Victor C. M. Leung Department of Electrical and Computer Engineering The University of British

More information

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET 2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar

More information

AODV-PA: AODV with Path Accumulation

AODV-PA: AODV with Path Accumulation -PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications

More information

ANewRoutingProtocolinAdHocNetworks with Unidirectional Links

ANewRoutingProtocolinAdHocNetworks with Unidirectional Links ANewRoutingProtocolinAdHocNetworks with Unidirectional Links Deepesh Man Shrestha and Young-Bae Ko Graduate School of Information & Communication, Ajou University, South Korea {deepesh, youngko}@ajou.ac.kr

More information

Impact of Node Velocity and Density on Probabilistic Flooding and its Effectiveness in MANET

Impact of Node Velocity and Density on Probabilistic Flooding and its Effectiveness in MANET Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 12, December 2014,

More information

A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS

A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Journal homepage: www.mjret.in ISSN:2348-6953 A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Ms. Amruta Kodole 1, Prof. P. M. Agarkar 2 Computer Engineering Dr. D. Y. Patil School Of Engineering

More information

Performance evaluation of reactive and proactive routing protocol in IEEE ad hoc network

Performance evaluation of reactive and proactive routing protocol in IEEE ad hoc network Author manuscript, published in "ITCom 6 - next generation and sensor networks, Boston : United States (26)" DOI :.7/2.68625 Performance evaluation of reactive and proactive routing protocol in IEEE 82.

More information

Power aware Multi-path Routing Protocol for MANETS

Power aware Multi-path Routing Protocol for MANETS Power aware Multi-path Routing Protocol for MANETS Shruthi P Murali 1,Joby John 2 1 (ECE Dept, SNGCE, India) 2 (ECE Dept, SNGCE, India) Abstract: Mobile Adhoc Network consists of a large number of mobile

More information

Performance Comparison of MANETs Routing Protocols for Dense and Sparse Topology

Performance Comparison of MANETs Routing Protocols for Dense and Sparse Topology 2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Performance Comparison of MANETs Routing Protocols for Dense and Sparse

More information

ESAR: An Energy Saving Ad Hoc Routing Algorithm for MANET

ESAR: An Energy Saving Ad Hoc Routing Algorithm for MANET : An Energy Saving Ad Hoc Routing Algorithm for MANET Utkarsh 1, Mukesh Mishra 2 and Suchismita Chinara 3 Department of Computer Science and Engineering, National Institute of Technology Rourkela, Rourkela,

More information

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer

More information

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path

More information

Throughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network

Throughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network Throughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network Dr.S.Senthil Kumar,Assistant Professor, Dept of Electrical and Electronics Engineering, Government College of Engineering, Salem,India

More information

LECTURE 9. Ad hoc Networks and Routing

LECTURE 9. Ad hoc Networks and Routing 1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links

More information

A Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks

A Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks A Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks Radhu.R.Nair #1 T. K Parani *2 # Student, M.E Communication Systems engineering, Anna University DSCE Coimbatore, India *Assistant professor,

More information

A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE

A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE Journal of Engineering Science and Technology Vol. 4, No. 2 (2009) 132-141 School of Engineering, Taylor s University College A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE 802.11 AND IEEE

More information

ENERGY EFFICIENT MULTIPATH ROUTING FOR MOBILE AD HOC NETWORKS

ENERGY EFFICIENT MULTIPATH ROUTING FOR MOBILE AD HOC NETWORKS ENERGY EFFICIENT MULTIPATH ROUTING FOR MOBILE AD HOC NETWORKS May Cho Aye and Aye Moe Aung Faculty of Information and Communication Technology, University of Technology (Yatanarpon Cyber City), Pyin Oo

More information

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala. Mobile Ad Hoc Networks: Routing TOPIC 8 UCS-805 MOBILE COMPUTING Jan-May,2011 ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala Email-alakroy.nerist@gmail.com Mobile Ad Hoc Networks (MANET) Introduction

More information

Performance Evaluation of MANET through NS2 Simulation

Performance Evaluation of MANET through NS2 Simulation International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 1 (2014), pp. 25-30 International Research Publication House http://www.irphouse.com Performance Evaluation

More information

PERFORMANCE EVALUATION OF DSR USING A NOVEL APPROACH

PERFORMANCE EVALUATION OF DSR USING A NOVEL APPROACH PERFORMANCE EVALUATION OF DSR USING A NOVEL APPROACH 1. Prof.S.P. Setti 2. Narasimha Raju K 3. Naresh Kumar K CS&SE Dept., CS&SE Dept., CS&SE Dept., AU College of Engineering, AU College of Engineering,

More information

Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1

Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Oxford University Press 2007. All rights reserved. 1 Ad-hoc networks deployment For routing, target detection,

More information

Figure 1: Ad-Hoc routing protocols.

Figure 1: Ad-Hoc routing protocols. Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks Sukhchandan Lally and Ljiljana Trajković Simon Fraser University Vancouver, British Columbia Canada E-mail: {lally, ljilja}@sfu.ca

More information

1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol 1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol Vahid Zangeneh i and Shahriar Mohammadi ii * ABSTRACT In recent years, routing has been the most focused area in ad hoc networks

More information

Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks

Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks 1 Ravindra.E, 2 Pooja Agraharkar Asst Prof, Dept. of Electronics & Communication Engg, Mtech Student, Dept. of Electronics & Communication

More information

A Neighbor Coverage Based Probabilistic Rebroadcast Reducing Routing Overhead in MANETs

A Neighbor Coverage Based Probabilistic Rebroadcast Reducing Routing Overhead in MANETs A Neighbor Coverage Based Probabilistic Rebroadcast Reducing Routing Overhead in MANETs Ankita G. Rathi #1, Mrs. J. H. Patil #2, Mr. S. A. Hashmi #3 # Computer Science-Information Technology Department,

More information

IN a mobile ad hoc network, nodes move arbitrarily.

IN a mobile ad hoc network, nodes move arbitrarily. IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 5, NO. 6, JUNE 2006 609 Distributed Cache Updating for the Dynamic Source Routing Protocol Xin Yu Abstract On-demand routing protocols use route caches to make

More information

Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario

Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario K.Gautham 1, Nagajothi A 2 Student, Computer Science and Engineering,

More information

IMPACT OF MOBILITY SPEED ON PROACTIVE AND REACTIVE ROUTING PROTOCOLS IN MOBILE ADHOC NETWORKS

IMPACT OF MOBILITY SPEED ON PROACTIVE AND REACTIVE ROUTING PROTOCOLS IN MOBILE ADHOC NETWORKS IMPACT OF MOBILITY SPEED ON PROACTIVE AND REACTIVE ROUTING PROTOCOLS IN MOBILE ADHOC NETWORKS E. Gnanamanoharan and R. Bensraj Department of Electrical Engineering, Annamalai University, Tamil Nadu, India

More information

A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks

A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks P.Madhan Mohan #, J.James Johnson #, K.Murugan $ and V.Ramachandran % # Under Graduate Student $ Senior

More information

Reducing Routing Overhead For Multimedia Traffic in Manet Using Rebroadcast Probability

Reducing Routing Overhead For Multimedia Traffic in Manet Using Rebroadcast Probability Reducing Routing Overhead For Multimedia Traffic in Manet Using Rebroadcast Probability Sivakumar.P, Sivaranjani.R, Srilakshmi.G, Subashini.R Abstract: Mobile ad hoc networks (MANET) have been proposed

More information

The Performance Evaluation of AODV & DSR (On-Demand. emand- Driven) Routing Protocols using QualNet 5.0 Simulator

The Performance Evaluation of AODV & DSR (On-Demand. emand- Driven) Routing Protocols using QualNet 5.0 Simulator IJCSN International Journal of Computer Science and Network, Vol 2, Issue 2, April 2013 29 The Performance Evaluation of AODV & DSR (On-Demand ( emand- Driven) Routing Protocols using QualNet 5.0 Simulator

More information

An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks

An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks Tejomayee Nath #1 & Suneeta Mohanty *2 # School of Computer Engineering, KIIT University Bhubaneswar,, India Abstract

More information

Beacon Update for Greedy Perimeter Stateless Routing Protocol in MANETs

Beacon Update for Greedy Perimeter Stateless Routing Protocol in MANETs Beacon Update for Greedy erimeter Stateless Routing rotocol in MANETs Abstract Dhanarasan 1, Gopi S 2 1 M.E/CSE Muthayammal Engineering College, getdhanarasan@gmail.com 2 Assistant rofessor / IT Muthayammal

More information

Relative Performance Analysis of Reactive (on-demand-driven) Routing Protocols

Relative Performance Analysis of Reactive (on-demand-driven) Routing Protocols Relative Performance Analysis of Reactive (on-demand-driven) Routing Protocols Mukesh Kumar Garg, Dr. Ela Kumar Abstract A Mobile Ad Hoc Network (MANET) is a group of wireless mobile computers (or nodes);

More information

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol V.S.Chaudhari 1, Prof.P.N.Matte 2, Prof. V.P.Bhope 3 Department of E&TC, Raisoni College of Engineering, Ahmednagar Abstract:-

More information

PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS

PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS AMANDEEP University College of Engineering, Punjabi University Patiala, Punjab, India amandeep8848@gmail.com GURMEET KAUR University College of Engineering,

More information

Dynamic AODV Backup Routing in Dense Mobile Ad-Hoc Networks *

Dynamic AODV Backup Routing in Dense Mobile Ad-Hoc Networks * Dynamic AODV Backup Routing in Dense Mobile Ad-Hoc Networks * Wen-Tsuen Chen and Wei-Ting Lee Department of Computer Science, National Tsing Hua University, Hsin-Chu, Taiwan 300, ROC Tel:+886-3-5742896

More information

Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks

Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,

More information

ROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS

ROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS ROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS Ganga S 1, Binu Chandran R 2 1, 2 Mohandas College Of Engineering And Technology Abstract: Wireless Ad-Hoc Network is a collection of wireless mobile

More information

A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS

A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS M. Sanabani 1, R. Alsaqour 2 and S. Kurkushi 1 1 Faculty of Computer Science and Information Systems, Thamar University, Thamar, Republic of Yemen

More information

Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks

Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks Salmu K.P 1, Chinchu James 2 1,2 Department of Computer Science, IIET, Nellikuzhi Abstract- ZigBee is a worldwide standard for wireless

More information

Secure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks

Secure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks Journal of Computer Science 7 (12): 1813-1818, 2011 ISSN 1549-3636 2011 Science Publications Secure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks 1 M.Rajesh Babu and 2 S.Selvan 1 Department

More information

Mobile Communications. Ad-hoc and Mesh Networks

Mobile Communications. Ad-hoc and Mesh Networks Ad-hoc+mesh-net 1 Mobile Communications Ad-hoc and Mesh Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Ad-hoc+mesh-net 2 What is an ad-hoc network? What are differences between

More information

A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks

A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 12, Issue 6 (Jul. - Aug. 2013), PP 01-09 A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile

More information

Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS

Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS , pp.479-486 http://dx.doi.org/1.14257/astl.217.147.67 Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS G Parimala 1, B Suvarna 2, N Rajeswari 3 and Venkatesulu Dondeti 4 VFSTR University,

More information

Routing Protocols in MANET: Comparative Study

Routing Protocols in MANET: Comparative Study Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119

More information

Low Overhead Geometric On-demand Routing Protocol for Mobile Ad Hoc Networks

Low Overhead Geometric On-demand Routing Protocol for Mobile Ad Hoc Networks Low Overhead Geometric On-demand Routing Protocol for Mobile Ad Hoc Networks Chang Su, Lili Zheng, Xiaohai Si, Fengjun Shang Institute of Computer Science & Technology Chongqing University of Posts and

More information

Performance Evaluation of Failed Link Detection in Mobile Ad Hoc Networks

Performance Evaluation of Failed Link Detection in Mobile Ad Hoc Networks Performance Evaluation of Failed Link Detection in Mobile Ad Hoc Networks Dimitri Marandin Chair for Telecommunications, Electrical Engineering Department Technical University of Dresden, Dresden, Germany

More information

Performance Analysis of Three Routing Protocols for Varying MANET Size

Performance Analysis of Three Routing Protocols for Varying MANET Size Proceedings of the International MultiConference of Engineers and Computer Scientists 8 Vol II IMECS 8, 9- March, 8, Hong Kong Performance Analysis of Three Routing Protocols for Varying MANET Size N Vetrivelan,

More information

Performance Evaluation of Active Route Time-Out parameter in Ad-hoc On Demand Distance Vector (AODV)

Performance Evaluation of Active Route Time-Out parameter in Ad-hoc On Demand Distance Vector (AODV) Performance Evaluation of Active Route Time-Out parameter in Ad-hoc On Demand Distance Vector (AODV) WADHAH AL-MANDHARI, KOICHI GYODA 2, NOBUO NAKAJIMA Department of Human Communications The University

More information

Enhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1

Enhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1 Enhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1 Shiv Mehra and Chansu Yu Department of Electrical and Computer Engineering Cleveland State University E-mail: {s.mehra,c.yu91}@csuohio.edu

More information

[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY NOVEL REVIEW OF MANET ROUTING PROTOCOLS Nippun Kamboj*, Dr. Munishwar Rai Department of Computer Applications Maharishi Markandeshwar

More information

Recent Researches in Communications, Information Science and Education

Recent Researches in Communications, Information Science and Education AODV Based Multi-path Local Repairing Scheme for Mobile Ad Hoc Networks Eman Shaaban, PhD Computer Systems Dept. Faculty of computer and information science Ain-Shams university, Cairo, Egypt Eman.shaaban@cis.asu.edu.eg

More information

The Effects of Route Information Initialization on Two On-demand Routing Algorithms for wireless Ad Hoc Networks *

The Effects of Route Information Initialization on Two On-demand Routing Algorithms for wireless Ad Hoc Networks * The Effects of Route Information Initialization on Two On-demand Routing Algorithms for wireless Ad Hoc Networks * Chunyue Liu Dept. of Computer Science, Graduate Center of City University of New York

More information

Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols

Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols www.ijcsi.org 551 Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols Kashif Ibrahim Qazi Javed Ahmed Abdul Qudoos Mirza Aamir Mehmood Department of Computer Science, Balochistan

More information

2013, IJARCSSE All Rights Reserved Page 85

2013, IJARCSSE All Rights Reserved Page 85 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 Overview of

More information

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network ShriRam College of Engineering & Management 1 A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network M.Ramaiya Rohit Gupta Rachit Jain Head,Dept. Computer Science Dept. Computer

More information

COMPARATIVE ANALYSIS AND STUDY OF DIFFERENT QOS PARAMETERS OF WIRELESS AD-HOC NETWORK

COMPARATIVE ANALYSIS AND STUDY OF DIFFERENT QOS PARAMETERS OF WIRELESS AD-HOC NETWORK COMPARATIVE ANALYSIS AND STUDY OF DIFFERENT QOS PARAMETERS OF WIRELESS AD-HOC NETWORK Nalin Gahlaut 1, Jaya sharma 2, Pankaj Kumar 3, Kaushal Kumar 4 1 Doctoral Candidate, Uttarakhand Technical University,

More information

Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through OLSR & AODV

Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through OLSR & AODV MIT International Journal of Electrical and Instrumentation Engineering, Vol. 3, No. 2, August 2013, pp. 57 61 57 Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through

More information

Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network

Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network Journal of Computer Science 7 (5): 678-682, 2011 ISSN 1549-3636 2011 Science Publications Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network 1 V. Balaji and 2 V. Duraisamy

More information

Performance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point Mobility Model

Performance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point Mobility Model American Journal of Applied Sciences 5 (6): 659-664, 2008 ISSN 1546-9239 2008 Science Publications Performance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point

More information

BEAM: Broadcast Engagement ACK Mechanism to Support Reliable Broadcast Transmission in IEEE Wireless Ad Hoc Networks

BEAM: Broadcast Engagement ACK Mechanism to Support Reliable Broadcast Transmission in IEEE Wireless Ad Hoc Networks : Broadcast Engagement ACK Mechanism to Support Reliable Broadcast Transmission in IEEE 2.11 Wireless Ad Hoc Networks Jenhui Chen and Muwen Huang Department of Computer Science and Information Engineering,

More information

Performance Analysis of Wireless Mobile ad Hoc Network with Varying Transmission Power

Performance Analysis of Wireless Mobile ad Hoc Network with Varying Transmission Power , pp.1-6 http://dx.doi.org/10.14257/ijsacs.2015.3.1.01 Performance Analysis of Wireless Mobile ad Hoc Network with Varying Transmission Power Surabhi Shrivastava, Laxmi Shrivastava and Sarita Singh Bhadauria

More information

A FORWARDING CACHE VLAN PROTOCOL (FCVP) IN WIRELESS NETWORKS

A FORWARDING CACHE VLAN PROTOCOL (FCVP) IN WIRELESS NETWORKS A FORWARDING CACHE VLAN PROTOCOL (FCVP) IN WIRELESS NETWORKS Tzu-Chiang Chiang,, Ching-Hung Yeh, Yueh-Min Huang and Fenglien Lee Department of Engineering Science, National Cheng-Kung University, Taiwan,

More information

Performance Evaluation of Various Routing Protocols in MANET

Performance Evaluation of Various Routing Protocols in MANET 208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri

More information

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5. Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management

More information

Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s

Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations

More information

A Highly Effective and Efficient Route Discovery & Maintenance in DSR

A Highly Effective and Efficient Route Discovery & Maintenance in DSR A Highly Effective and Efficient Route Discovery & Maintenance in DSR Shiva Prakash 1, Rajeev Kumar 2, Brijesh Nayak 3, Manindar Kumar Yadav 4 Department of Computer Science and Engineering, Madan Mohan

More information

Poonam kori et al. / International Journal on Computer Science and Engineering (IJCSE)

Poonam kori et al. / International Journal on Computer Science and Engineering (IJCSE) An Effect of Route Caching Scheme in DSR for Vehicular Adhoc Networks Poonam kori, Dr. Sanjeev Sharma School Of Information Technology, RGPV BHOPAL, INDIA E-mail: Poonam.kori@gmail.com Abstract - Routing

More information

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Kalyan Kalepu, Shiv Mehra and Chansu Yu, Department of Electrical and Computer Engineering Cleveland State University 2121

More information

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver 1 A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois

More information

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks 2014 IJSRSET Volume i Issue i Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Science Zone-based Proactive Source Routing Protocol for Ad-hoc Networks Dr.Sangheethaa.S 1, Dr. Arun Korath

More information

QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing

QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing Vida Lashkari. O., Mehdi Dehghan Abstract Ad hoc networking will become a major technology for wireless connectivity beside the multimedia necessity

More information

Efficient On-Demand Routing Protocols to Optimize Network Coverage in Wireless Sensor Networks

Efficient On-Demand Routing Protocols to Optimize Network Coverage in Wireless Sensor Networks IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.7, July 2008 277 Efficient On-Demand Routing Protocols to Optimize Network Coverage in Wireless Sensor Networks * Mohammed

More information

G.Narasa Reddy, 2 A.Avanthi, 3 R.Prasanth Reddy 1

G.Narasa Reddy, 2 A.Avanthi, 3 R.Prasanth Reddy 1 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Enhancing DSR Protocol Performance in Mobile Ad Hoc Networks

More information

Simulation and Performance Analysis of Throughput and Delay on Varying Time and Number of Nodes in MANET

Simulation and Performance Analysis of Throughput and Delay on Varying Time and Number of Nodes in MANET International Journal of Recent Research and Review, Vol. VII, Issue 2, June 2014 ISSN 2277 8322 Simulation and Performance Analysis of and on Varying and Number of Nodes in MANET Arun Jain 1, Ramesh Bharti

More information

Battery Power Management Routing Considering Participation Duration for Mobile Ad Hoc Networks

Battery Power Management Routing Considering Participation Duration for Mobile Ad Hoc Networks Battery Power Management Routing Considering Participation Duration for Mobile Ad Hoc Networks Masaru Yoshimachi and Yoshifumi Manabe movement of the devices. Thus the routing protocols for MANET need

More information

The Impact of the Number of Nodes, Speed of Nodes, Speed of Network and the Network Space to the Number of Nodes keeps Alive

The Impact of the Number of Nodes, Speed of Nodes, Speed of Network and the Network Space to the Number of Nodes keeps Alive Available online at www.globalilluminators.org GlobalIlluminators Full Paper Proceeding GTAR-2014, Vol. 1, 463--469 FULL PAPER PROCEEDING Multidisciplinary Studies ISBN: 978-969-9948-30-5 GTAR-14 The Impact

More information

Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model

Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Deepak Agrawal, Brajesh Patel Department of CSE Shri Ram Institute of Technology Jabalpur,

More information

Performance Enhancement of Reactive on Demand Routing Protocol in Wireless Ad Hoc Network

Performance Enhancement of Reactive on Demand Routing Protocol in Wireless Ad Hoc Network Performance Enhancement of Reactive on Demand Routing Protocol in Wireless Ad Hoc Network V. P. Patil, K.T.Patil, A. R. Kharade & D. D.Gote Smt. Indira Gandhi College of Engineering, New Mumbai, India

More information

A Performance Comparison of MDSDV with AODV and DSDV Routing Protocols

A Performance Comparison of MDSDV with AODV and DSDV Routing Protocols A Performance Comparison of MDSDV with AODV and DSDV Routing Protocols A. Etorban Peter J.B King Phil Trinder etorban@macs.hw.ac.uk pjbk@macs.hw.ac.uk P.W.Trinder@hw.ac.uk School of Mathematical and Computer

More information

Empirical Study of Mobility effect on IEEE MAC protocol for Mobile Ad- Hoc Networks

Empirical Study of Mobility effect on IEEE MAC protocol for Mobile Ad- Hoc Networks Empirical Study of Mobility effect on IEEE 802.11 MAC protocol for Mobile Ad- Hoc Networks Mojtaba Razfar and Jane Dong mrazfar, jdong2@calstatela.edu Department of Electrical and computer Engineering

More information

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols Performance Comparison of Ad Hoc Routing Protocols over IEEE 82.11 DCF and TDMA MAC Layer Protocols Govind. P. Gupta Computer Science Department R.K.G.I.T, Ghaziabad (India) er_gpgupta@yahoo.com A. K.

More information

A New Energy-Aware Routing Protocol for. Improving Path Stability in Ad-hoc Networks

A New Energy-Aware Routing Protocol for. Improving Path Stability in Ad-hoc Networks Contemporary Engineering Sciences, Vol. 8, 2015, no. 19, 859-864 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ces.2015.57207 A New Energy-Aware Routing Protocol for Improving Path Stability

More information

Dynamic Deferred Acknowledgment Mechanism for Improving the Performance of TCP in Multi-Hop Wireless Networks

Dynamic Deferred Acknowledgment Mechanism for Improving the Performance of TCP in Multi-Hop Wireless Networks Dynamic Deferred Acknowledgment Mechanism for Improving the Performance of TCP in Multi-Hop Wireless Networks Dodda Sunitha Dr.A.Nagaraju Dr. G.Narsimha Assistant Professor of IT Dept. Central University

More information

Chapter 7 CONCLUSION

Chapter 7 CONCLUSION 97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in

More information

Impact of Hello Interval on Performance of AODV Protocol

Impact of Hello Interval on Performance of AODV Protocol Impact of Hello Interval on Performance of AODV Nisha Bhanushali Priyanka Thakkar Prasanna Shete ABSTRACT The multi-hop ad hoc networks are self organizing networks with dynamic topology. The reactive

More information

Investigating MAC-layer Schemes to Promote Doze Mode in based WLANs

Investigating MAC-layer Schemes to Promote Doze Mode in based WLANs Investigating MAC-layer Schemes to Promote Doze Mode in 802.11-based WLANs V. Baiamonte and C.-F. Chiasserini CERCOM - Dipartimento di Elettronica Politecnico di Torino Torino, Italy Email: baiamonte,chiasserini

More information

Evaluation of Routing Protocols for Mobile Ad hoc Networks

Evaluation of Routing Protocols for Mobile Ad hoc Networks International Journal of Soft Computing and Engineering (IJSCE) Evaluation of Routing Protocols for Mobile Ad hoc Networks Abstract Mobile Ad hoc network is a self-configuring infrastructure less network

More information

A Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks

A Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks A Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks Gunyoung Koh, Duyoung Oh 1 and Heekyoung Woo 2 1 School of Electrical Engineering and Computer Science Seoul National University,

More information

Performance Analysis of Aodv Protocol under Black Hole Attack

Performance Analysis of Aodv Protocol under Black Hole Attack International Journal of Scientific & Engineering Research Volume 2, Issue 8,August-2011 1 Performance Analysis of Aodv Protocol under Black Hole Attack Monika Roopak, Dr. Bvr Reddy ABSTRACT- Mobile Ad-hoc

More information

Anil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput.

Anil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput. Volume 6, Issue 7, July 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Analysis

More information

Performance Analysis and Enhancement of Routing Protocol in Manet

Performance Analysis and Enhancement of Routing Protocol in Manet Vol.2, Issue.2, Mar-Apr 2012 pp-323-328 ISSN: 2249-6645 Performance Analysis and Enhancement of Routing Protocol in Manet Jaya Jacob*, V.Seethalakshmi** *II MECS, Sri Shakthi Institute of Engineering and

More information

Wireless Networking & Mobile Computing

Wireless Networking & Mobile Computing Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Network Layer: Ad Hoc Routing Tamer Nadeem Dept. of Computer Science The OSI Communication Model Page 2 Spring 2012 CS 752/852 - Wireless

More information

Proposal of autonomous transmission timing control scheme for collision avoidance in ad hoc multicasting

Proposal of autonomous transmission timing control scheme for collision avoidance in ad hoc multicasting Proposal of autonomous transmission timing control scheme for collision avoidance in ad hoc multicasting Katsuhiro Naito, Yasunori Fukuda, Kazuo Mori, and Hideo Kobayashi Department of Electrical and Electronic

More information

Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes

Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes Sudheer Kumar 1, Akhilesh Yadav 2 Department of Computer Science and Engineering Kanpur Institute of Technology, Kanpur sudheerkr21@gmail.co

More information

An Enhanced Secured Dynamic Source Routing Protocol for MANETS

An Enhanced Secured Dynamic Source Routing Protocol for MANETS International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume X, Issue-4, September 2011 An Enhanced Secured Dynamic Source Routing Protocol for MANETS G.Lavanya, A. Ebenezer

More information

Simulation Based Performance Analysis of Routing Protocols Using Random Waypoint Mobility Model in Mobile Ad Hoc Network

Simulation Based Performance Analysis of Routing Protocols Using Random Waypoint Mobility Model in Mobile Ad Hoc Network Global Journal of Computer Science and Technology Volume 11 Issue 1 Version 1.0 February 2011 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online

More information