Browsing by Author "Basavaraju, T.G."

Filter results by typing the first few letters
Now showing 1 - 11 of 11
  • No Thumbnail Available
    Item
    CARED: Cautious Adaptive RED gateways for TCP/IP networks
    (2012) Tahiliani, M.P.; Shet, K.C.; Basavaraju, T.G.
    Random Early Detection (RED) is a widely deployed active queue management algorithm that improves the overall performance of the network in terms of throughput and delay. The effectiveness of RED algorithm, however, highly depends on appropriate setting of its parameters. Moreover, the performance of RED is quite sensitive to abrupt changes in the traffic load. In this paper, we propose a Cautious Adaptive Random Early Detection (CARED) algorithm that dynamically varies maximum drop probability based on the level of traffic load to improve the overall performance of the network. Based on extensive simulations conducted using Network Simulator-2 (ns-2), we show that CARED algorithm reduces the packet drop rate and achieves high throughput as compared to RED, Adaptive RED and Refined Adaptive RED. Unlike other RED based algorithms, CARED algorithm does not introduce new parameters to achieve performance gain and hence can be deployed without any additional complexity. © 2011 Elsevier Ltd. All rights reserved.
  • Thumbnail Image
    Item
    Congestion adaptive routing in wireless mesh networks
    (2010) Tiwari, A.K.; Basavaraju, T.G.; Chandavarkar, B.R.
    The main reason for packet loss in Wireless Mesh Networks (WMNs) is due to congestion. Presently, routing in WMNs is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control. The way in which the congestion is handled results in longer delay and more packet loss and requires significant overhead if a new route is needed. Hence, we propose a congestion adaptive routing protocol (CARP) for WMNs with such properties. Our ns-2 simulation results confirm that CARP can successfully achieve a high packet delivery ratio with lower routing overhead and latency in WMNs. �2010 IEEE.
  • No Thumbnail Available
    Item
    Congestion adaptive routing in wireless mesh networks
    (2010) Tiwari, A.K.; Basavaraju, T.G.; Chandavarkar, B.R.
    The main reason for packet loss in Wireless Mesh Networks (WMNs) is due to congestion. Presently, routing in WMNs is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control. The way in which the congestion is handled results in longer delay and more packet loss and requires significant overhead if a new route is needed. Hence, we propose a congestion adaptive routing protocol (CARP) for WMNs with such properties. Our ns-2 simulation results confirm that CARP can successfully achieve a high packet delivery ratio with lower routing overhead and latency in WMNs. ©2010 IEEE.
  • Thumbnail Image
    Item
    FARED: Fast adapting RED gateways for TCP/IP networks
    (2012) Tahiliani, M.P.; Shet, K.C.; Basavaraju, T.G.
    Random Early Detection (RED) is a widely deployed active queue management mechanism to improve the performance of the network in terms of throughput and packet drop rate. The effectiveness of RED, however, highly depends on appropriate setting of its parameters. In this paper, we propose a Fast Adapting Random Early Detection (FARED) algorithm which efficiently varies the maximum drop probability to improve the overall performance of the network. Based on extensive simulations, we show that FARED algorithm reduces the packet drop rate and achieves better throughput than Adaptive RED (ARED) and Refined Adaptive RED (Re-ARED). Moreover, FARED algorithm does not introduce new parameters to improve the performance and hence can be deployed without any additional complexity. � 2012 Springer-Verlag.
  • No Thumbnail Available
    Item
    FARED: Fast adapting RED gateways for TCP/IP networks
    (2012) Tahiliani, M.P.; Shet, K.C.; Basavaraju, T.G.
    Random Early Detection (RED) is a widely deployed active queue management mechanism to improve the performance of the network in terms of throughput and packet drop rate. The effectiveness of RED, however, highly depends on appropriate setting of its parameters. In this paper, we propose a Fast Adapting Random Early Detection (FARED) algorithm which efficiently varies the maximum drop probability to improve the overall performance of the network. Based on extensive simulations, we show that FARED algorithm reduces the packet drop rate and achieves better throughput than Adaptive RED (ARED) and Refined Adaptive RED (Re-ARED). Moreover, FARED algorithm does not introduce new parameters to improve the performance and hence can be deployed without any additional complexity. © 2012 Springer-Verlag.
  • Thumbnail Image
    Item
    Performance analysis of AODV, AODVUU, AOMDV and RAODV over IEEE 802.15.4 in wireless sensor networks
    (2009) Gowrishankar, S.; Sarkar, S.K.; Basavaraju, T.G.
    In this paper the focus is on the performance study of four routing protocols, namely AODV, AODVUU, RAODV and AOMDV. We call these protocols AODV family of protocols as all these protocols consider AODV as the base routing protocol upon which these protocols are improved. Even though AODV and AODVUU are not different protocols, we wanted to see if there is any improvement in using the AODVUU implementation for a sensor network environment. We have investigated whether a multiple path algorithm like AOMDV would result in more data delivery as compared to single path solutions like AODV in a sensor network. Also, the reverse route discovery mechanisms employed in RAODV is checked for a sensor network. There is a need to understand the versatile behavioral aspects of these routing protocols in a wireless sensor network with varying traffic loads and the number of sources. All these protocols are simulated using NS- 2 over IEEE 802.15.4. We also claim that our work is the first of its kind to study and compare the performance of all these four routing protocols from a sensor network point of view by extensively using various performance metrics like packet delivery ratio, average network delay, network throughput and normalized routing load. � 2009 IEEE.
  • No Thumbnail Available
    Item
    Performance analysis of AODV, AODVUU, AOMDV and RAODV over IEEE 802.15.4 in wireless sensor networks
    (2009) Gowrishankar, S.; Sarkar, S.K.; Basavaraju, T.G.
    In this paper the focus is on the performance study of four routing protocols, namely AODV, AODVUU, RAODV and AOMDV. We call these protocols AODV family of protocols as all these protocols consider AODV as the base routing protocol upon which these protocols are improved. Even though AODV and AODVUU are not different protocols, we wanted to see if there is any improvement in using the AODVUU implementation for a sensor network environment. We have investigated whether a multiple path algorithm like AOMDV would result in more data delivery as compared to single path solutions like AODV in a sensor network. Also, the reverse route discovery mechanisms employed in RAODV is checked for a sensor network. There is a need to understand the versatile behavioral aspects of these routing protocols in a wireless sensor network with varying traffic loads and the number of sources. All these protocols are simulated using NS- 2 over IEEE 802.15.4. We also claim that our work is the first of its kind to study and compare the performance of all these four routing protocols from a sensor network point of view by extensively using various performance metrics like packet delivery ratio, average network delay, network throughput and normalized routing load. © 2009 IEEE.
  • Thumbnail Image
    Item
    Performance evaluation of TCP variants over routing protocols in multi-hop wireless networks
    (2010) Tahiliani, M.P.; Shet, K.C.; Basavaraju, T.G.
    Wireless internet has become popular in recent years due to the tremendous growth in the number of mobile computing devices and high demand for continuous network connectivity regardless of physical locations. In this paper, we investigate the effects of routing protocols on the performance of Transmission Control Protocol (TCP) variants in multi-hop wireless networks. Through simulations we study the effects of Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR), Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) routing protocols on TCP Tahoe, TCP Reno, TCP Newreno, TCP with Selective Acknowledgment (SACK) option and TCP Vegas. The simulations are carried out for static as well as mobile nodes. The performance metric used is throughput. Another metric, expected throughput is used for the comparison of throughput when nodes are mobile. �2010 IEEE.
  • No Thumbnail Available
    Item
    Performance evaluation of TCP variants over routing protocols in multi-hop wireless networks
    (2010) Tahiliani, M.P.; Shet, K.C.; Basavaraju, T.G.
    Wireless internet has become popular in recent years due to the tremendous growth in the number of mobile computing devices and high demand for continuous network connectivity regardless of physical locations. In this paper, we investigate the effects of routing protocols on the performance of Transmission Control Protocol (TCP) variants in multi-hop wireless networks. Through simulations we study the effects of Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR), Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) routing protocols on TCP Tahoe, TCP Reno, TCP Newreno, TCP with Selective Acknowledgment (SACK) option and TCP Vegas. The simulations are carried out for static as well as mobile nodes. The performance metric used is throughput. Another metric, expected throughput is used for the comparison of throughput when nodes are mobile. ©2010 IEEE.
  • Thumbnail Image
    Item
    Simulation based performance comparison of community model, GFMM, RPGM, manhattan model and RWP-SS mobility models in MANET
    (2009) Gowrishankar, S.; Sarkar, S.K.; Basavaraju, T.G.
    A characteristic feature of ad hoc networks is the infrastructure less and seamless connectivity of the wireless mobile nodes. Mobility plays an important role in the connectivity of these nodes. In this paper a performance comparison of five important mobility models; Community Model, Group Force Mobility Model (GFMM), Reference Point Group Mobility (RPGM), Manhattan Mobility Model and Random Waypoint-Steady State (RWP-SS) Mobility Model has been analyzed. Community Model, GFMM and RPGM Mobility Models are pure group mobility models, while Manhattan Mobility Model can be considered as a pseudo Group Mobility Model. We have included RWP-SS to give a whole picture of how group mobility models stand against a random model like RWP-SS. From our analysis we deduce that group mobility models hold inherent advantage over mobility models like Random Waypoint models. Among the group mobility models, Community model has good performance when compared to other mobility models. Energy Consumption of these mobility models has also been analyzed. Various Metrics like Packet Delivery Ratio, Average Network Delay, Network Throughput, Routing Overhead and Number of Hops have been considered. The results obtained in our paper colligates with the theoretical results in [20]. We also claim that our work is the first to compare these five different mobility models together. � 2009 IEEE.
  • No Thumbnail Available
    Item
    Simulation based performance comparison of community model, GFMM, RPGM, manhattan model and RWP-SS mobility models in MANET
    (2009) Gowrishankar, S.; Sarkar, S.K.; Basavaraju, T.G.
    A characteristic feature of ad hoc networks is the infrastructure less and seamless connectivity of the wireless mobile nodes. Mobility plays an important role in the connectivity of these nodes. In this paper a performance comparison of five important mobility models; Community Model, Group Force Mobility Model (GFMM), Reference Point Group Mobility (RPGM), Manhattan Mobility Model and Random Waypoint-Steady State (RWP-SS) Mobility Model has been analyzed. Community Model, GFMM and RPGM Mobility Models are pure group mobility models, while Manhattan Mobility Model can be considered as a pseudo Group Mobility Model. We have included RWP-SS to give a whole picture of how group mobility models stand against a random model like RWP-SS. From our analysis we deduce that group mobility models hold inherent advantage over mobility models like Random Waypoint models. Among the group mobility models, Community model has good performance when compared to other mobility models. Energy Consumption of these mobility models has also been analyzed. Various Metrics like Packet Delivery Ratio, Average Network Delay, Network Throughput, Routing Overhead and Number of Hops have been considered. The results obtained in our paper colligates with the theoretical results in [20]. We also claim that our work is the first to compare these five different mobility models together. © 2009 IEEE.