The Experts below are selected from a list of 2835 Experts worldwide ranked by ideXlab platform

Nadeem Javaid - One of the best experts on this subject based on the ideXlab platform.

  • Towards Void Hole Alleviation by Exploiting the Energy Efficient Path and by Providing the Interference-Free Proactive Routing Protocols in IoT Enabled Underwater WSNs.
    Sensors, 2019
    Co-Authors: Muhammad Awais, Nadeem Javaid, Umar Qasim, Amjad Rehman, Musaed Alhussein, Khursheed Aurangzeb
    Abstract:

    Nowadays, the Internet of Things enabled Underwater Wireless Sensor Network (IoT-UWSN) is suffering from serious performance restrictions, i.e., high End to End (E2E) delay, low energy efficiency, low data reliability, etc. The necessity of efficient, reliable, collision and interference-free communication has become a challenging task for the researchers. However, the minimum Energy Consumption (EC) and low E2E delay increase the performance of the IoT-UWSN. Therefore, in the current work, two Proactive Routing protocols are presented, namely: Bellman–Ford Shortest Path-based Routing (BF-SPR-Three) and Energy-efficient Path-based Void hole and Interference-free Routing (EP-VIR-Three). Then we formalized the aforementioned problems to accomplish the reliable data transmission in Underwater Wireless Sensor Network (UWSN). The main objectives of this paper include minimum EC, interference-free transmission, void hole avoidance and high Packet Delivery Ratio (PDR). Furthermore, the algorithms for the proposed Routing protocols are presented. Feasible regions using linear programming are also computed for optimal EC and to enhance the network lifespan. Comparative analysis is also performed with state-of-the-art Proactive Routing protocols. In the end, extensive simulations have been performed to authenticate the performance of the proposed Routing protocols. Results and discussion disclose that the proposed Routing protocols outperformed the counterparts significantly.

  • Region Aware Proactive Routing Approaches Exploiting Energy Efficient Paths for Void Hole Avoidance in Underwater WSNs
    IEEE Access, 2019
    Co-Authors: Zahoor Ali Khan, Muhammad Awais, Turki Ali Alghamdi, Adia Khalid, Aisha Fatima, Mariam Akbar, Nadeem Javaid
    Abstract:

    Nowadays, constrained battery life expectancy is an important issue for reliable data delivery in an Underwater Wireless Sensor Network (UWSN). Conventional transmission methodologies increase the transmission overhead, i.e., the collision of packets, which influence the data transmission. Replacement of the sensors' battery in brutal underwater environment is a difficult task. Therefore, to maintain a strategic distance from the unexpected failure of the network and to increase the life expectancy of the network, energy efficient Routing protocols are required. At this end, in this paper, a Proactive Routing protocol with three different network types is proposed to solve the aforementioned issues. The proposed protocol adaptively changes its communication strategy depending on the type of the network, i.e., dense network, partially dense network and sparse network. This adaptive strategy helps the Routing protocols to continue their transmission by avoiding the void holes. In the proposed protocol named Proactive Routing Approach with Energy efficient Path Selection (PA-EPS-Case I), vertical inter-transmission layering concept is introduced (using shortest and fastest path) in the dense and partially dense region. In addition, cluster formation concept is also appended to make transmission successful in the sparse regions. The Packet Delivery Ratio (PDR) is improved by the proposed protocol with minimum End to End (E2E) delay and packet drop ratio. Scalability of the proposed Routing protocols is also analyzed by varying the number of nodes from 100-500. A comparative analysis is performed with two cutting edge Routing protocols namely: Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) and Cluster-based WDFAD-DBR (C-DBR). Simulation results demonstrate that proposed protocol achieved 12.64% higher PDR with 20% decrease in E2E delay than C-DBR. Furthermore, the proposed Routing protocol outperformed C-DBR in terms of packet drop ratio up to 14.29% with an increase of EC up to 30%.

  • Evaluating Wireless Proactive Routing Protocols under Mobility and Scalability Constraints.
    arXiv: Networking and Internet Architecture, 2013
    Co-Authors: Nadeem Javaid, Zahoor Ali Khan, R. D. Khan, Manzoor Ilahi, Liaqat Ali, Umar Qasim
    Abstract:

    Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different Routing protocols are used to facilitate users demand(s). To practically examine the constraints of respective LP_models over different Routing techniques, we select three Proactive Routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.

  • Wireless Proactive Routing Protocols under Mobility and Scalability Constraints
    2013
    Co-Authors: Nadeem Javaid, Zahoor Ali Khan, R. D. Khan, Manzoor Ilahi, Liaqat Ali, Umar Qasim
    Abstract:

    Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different Routing protocols are used to facilitate users demand(s). To practically examine the constraints of respective LP_models over different Routing techniques, we select three Proactive Routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.

  • Routing load of route calculation and route maintenance in wireless Proactive Routing protocols
    Broadband and Wireless Computing Communication and Applications, 2012
    Co-Authors: Danish Mahmood, Nadeem Javaid, Umar Qasim, Zahoor Ali Khan
    Abstract:

    This paper presents mathematical framework and study of Proactive Routing Protocols. The performance analysis of three major Proactive Routing protocols: Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR) are under consideration in this work. Taking these Routing protocols into account, we enhance existing framework. In the next step we further discuss and produce analytical framework by considering variations in different network and protocol parameters. Finally, experiments are performed regarding above mentioned Routing protocols followed with detailed comparison and analysis of different environments.

Zahoor Ali Khan - One of the best experts on this subject based on the ideXlab platform.

  • Region Aware Proactive Routing Approaches Exploiting Energy Efficient Paths for Void Hole Avoidance in Underwater WSNs
    IEEE Access, 2019
    Co-Authors: Zahoor Ali Khan, Muhammad Awais, Turki Ali Alghamdi, Adia Khalid, Aisha Fatima, Mariam Akbar, Nadeem Javaid
    Abstract:

    Nowadays, constrained battery life expectancy is an important issue for reliable data delivery in an Underwater Wireless Sensor Network (UWSN). Conventional transmission methodologies increase the transmission overhead, i.e., the collision of packets, which influence the data transmission. Replacement of the sensors' battery in brutal underwater environment is a difficult task. Therefore, to maintain a strategic distance from the unexpected failure of the network and to increase the life expectancy of the network, energy efficient Routing protocols are required. At this end, in this paper, a Proactive Routing protocol with three different network types is proposed to solve the aforementioned issues. The proposed protocol adaptively changes its communication strategy depending on the type of the network, i.e., dense network, partially dense network and sparse network. This adaptive strategy helps the Routing protocols to continue their transmission by avoiding the void holes. In the proposed protocol named Proactive Routing Approach with Energy efficient Path Selection (PA-EPS-Case I), vertical inter-transmission layering concept is introduced (using shortest and fastest path) in the dense and partially dense region. In addition, cluster formation concept is also appended to make transmission successful in the sparse regions. The Packet Delivery Ratio (PDR) is improved by the proposed protocol with minimum End to End (E2E) delay and packet drop ratio. Scalability of the proposed Routing protocols is also analyzed by varying the number of nodes from 100-500. A comparative analysis is performed with two cutting edge Routing protocols namely: Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) and Cluster-based WDFAD-DBR (C-DBR). Simulation results demonstrate that proposed protocol achieved 12.64% higher PDR with 20% decrease in E2E delay than C-DBR. Furthermore, the proposed Routing protocol outperformed C-DBR in terms of packet drop ratio up to 14.29% with an increase of EC up to 30%.

  • Evaluating Wireless Proactive Routing Protocols under Mobility and Scalability Constraints.
    arXiv: Networking and Internet Architecture, 2013
    Co-Authors: Nadeem Javaid, Zahoor Ali Khan, R. D. Khan, Manzoor Ilahi, Liaqat Ali, Umar Qasim
    Abstract:

    Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different Routing protocols are used to facilitate users demand(s). To practically examine the constraints of respective LP_models over different Routing techniques, we select three Proactive Routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.

  • Wireless Proactive Routing Protocols under Mobility and Scalability Constraints
    2013
    Co-Authors: Nadeem Javaid, Zahoor Ali Khan, R. D. Khan, Manzoor Ilahi, Liaqat Ali, Umar Qasim
    Abstract:

    Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different Routing protocols are used to facilitate users demand(s). To practically examine the constraints of respective LP_models over different Routing techniques, we select three Proactive Routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.

  • Routing load of route calculation and route maintenance in wireless Proactive Routing protocols
    Broadband and Wireless Computing Communication and Applications, 2012
    Co-Authors: Danish Mahmood, Nadeem Javaid, Umar Qasim, Zahoor Ali Khan
    Abstract:

    This paper presents mathematical framework and study of Proactive Routing Protocols. The performance analysis of three major Proactive Routing protocols: Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR) are under consideration in this work. Taking these Routing protocols into account, we enhance existing framework. In the next step we further discuss and produce analytical framework by considering variations in different network and protocol parameters. Finally, experiments are performed regarding above mentioned Routing protocols followed with detailed comparison and analysis of different environments.

  • BWCCA - Routing Load of Route Calculation and Route Maintenance in Wireless Proactive Routing Protocols
    2012 Seventh International Conference on Broadband Wireless Computing Communication and Applications, 2012
    Co-Authors: Danish Mahmood, Nadeem Javaid, Umar Qasim, Zahoor Ali Khan
    Abstract:

    This paper presents mathematical framework and study of Proactive Routing Protocols. The performance analysis of three major Proactive Routing protocols: Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR) are under consideration in this work. Taking these Routing protocols into account, we enhance existing framework. In the next step we further discuss and produce analytical framework by considering variations in different network and protocol parameters. Finally, experiments are performed regarding above mentioned Routing protocols followed with detailed comparison and analysis of different environments.

Umar Qasim - One of the best experts on this subject based on the ideXlab platform.

  • Towards Void Hole Alleviation by Exploiting the Energy Efficient Path and by Providing the Interference-Free Proactive Routing Protocols in IoT Enabled Underwater WSNs.
    Sensors, 2019
    Co-Authors: Muhammad Awais, Nadeem Javaid, Umar Qasim, Amjad Rehman, Musaed Alhussein, Khursheed Aurangzeb
    Abstract:

    Nowadays, the Internet of Things enabled Underwater Wireless Sensor Network (IoT-UWSN) is suffering from serious performance restrictions, i.e., high End to End (E2E) delay, low energy efficiency, low data reliability, etc. The necessity of efficient, reliable, collision and interference-free communication has become a challenging task for the researchers. However, the minimum Energy Consumption (EC) and low E2E delay increase the performance of the IoT-UWSN. Therefore, in the current work, two Proactive Routing protocols are presented, namely: Bellman–Ford Shortest Path-based Routing (BF-SPR-Three) and Energy-efficient Path-based Void hole and Interference-free Routing (EP-VIR-Three). Then we formalized the aforementioned problems to accomplish the reliable data transmission in Underwater Wireless Sensor Network (UWSN). The main objectives of this paper include minimum EC, interference-free transmission, void hole avoidance and high Packet Delivery Ratio (PDR). Furthermore, the algorithms for the proposed Routing protocols are presented. Feasible regions using linear programming are also computed for optimal EC and to enhance the network lifespan. Comparative analysis is also performed with state-of-the-art Proactive Routing protocols. In the end, extensive simulations have been performed to authenticate the performance of the proposed Routing protocols. Results and discussion disclose that the proposed Routing protocols outperformed the counterparts significantly.

  • Evaluating Wireless Proactive Routing Protocols under Mobility and Scalability Constraints.
    arXiv: Networking and Internet Architecture, 2013
    Co-Authors: Nadeem Javaid, Zahoor Ali Khan, R. D. Khan, Manzoor Ilahi, Liaqat Ali, Umar Qasim
    Abstract:

    Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different Routing protocols are used to facilitate users demand(s). To practically examine the constraints of respective LP_models over different Routing techniques, we select three Proactive Routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.

  • Wireless Proactive Routing Protocols under Mobility and Scalability Constraints
    2013
    Co-Authors: Nadeem Javaid, Zahoor Ali Khan, R. D. Khan, Manzoor Ilahi, Liaqat Ali, Umar Qasim
    Abstract:

    Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different Routing protocols are used to facilitate users demand(s). To practically examine the constraints of respective LP_models over different Routing techniques, we select three Proactive Routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.

  • Routing load of route calculation and route maintenance in wireless Proactive Routing protocols
    Broadband and Wireless Computing Communication and Applications, 2012
    Co-Authors: Danish Mahmood, Nadeem Javaid, Umar Qasim, Zahoor Ali Khan
    Abstract:

    This paper presents mathematical framework and study of Proactive Routing Protocols. The performance analysis of three major Proactive Routing protocols: Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR) are under consideration in this work. Taking these Routing protocols into account, we enhance existing framework. In the next step we further discuss and produce analytical framework by considering variations in different network and protocol parameters. Finally, experiments are performed regarding above mentioned Routing protocols followed with detailed comparison and analysis of different environments.

  • BWCCA - Routing Load of Route Calculation and Route Maintenance in Wireless Proactive Routing Protocols
    2012 Seventh International Conference on Broadband Wireless Computing Communication and Applications, 2012
    Co-Authors: Danish Mahmood, Nadeem Javaid, Umar Qasim, Zahoor Ali Khan
    Abstract:

    This paper presents mathematical framework and study of Proactive Routing Protocols. The performance analysis of three major Proactive Routing protocols: Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR) are under consideration in this work. Taking these Routing protocols into account, we enhance existing framework. In the next step we further discuss and produce analytical framework by considering variations in different network and protocol parameters. Finally, experiments are performed regarding above mentioned Routing protocols followed with detailed comparison and analysis of different environments.

Abdelfettah Belghith - One of the best experts on this subject based on the ideXlab platform.

  • SARP: A dynamically readjustable period size Proactive Routing protocol for MANETs
    Journal of Computer and System Sciences, 2015
    Co-Authors: Mohamed Amine Abid, Abdelfettah Belghith, Khalil Drira
    Abstract:

    The aim of a Routing protocol is to compute routes between every couple of nodes. When the topology evolves over time, Routing decisions should be constantly reconsidered to ensure continuous valid Routing. Conventional Proactive Routing protocols periodically re-compute their Routing-tables. However, due to their inherent nature based on shortest-paths, they select longer links (victims of rapid breakages as nodes move). Increasing the updates' frequency certainly allows a better tracking of the topology changes; however, it induces higher signaling overhead. An adequate trade-off between the period size and the control overhead should be found. In this paper, we propose a new mechanism that keeps sensing the mobility-level to properly-adjust the Routing period size. It relies on a distributed algorithm collecting the network cartography to self-regulate the Routing period size. Simulation results show that our proposal (SARP) correctly tracks topology changes and properly adjusts the current period size leading to better performances.

  • Cartography and Stability to Enhance and Self Regulate Proactive Routing in MANETs
    Geographic Information Systems, 2013
    Co-Authors: Mohamed Amine Abid, Abdelfettah Belghith
    Abstract:

    In this chapter, the authors propose a novel Proactive Routing protocol where Routing advertisement frequency is self regulated locally at and by each node depending on its mobility level. The proposal relays on an asynchronous distributed cartography gathering algorithm and a link stability criterion. The cartography of the network is kept constantly valid in time and for all applied speeds. Each node senses its own dynamics and locally chooses an appropriate Routing advertisement period size. As such stationary nodes generate little signaling traffic while fast moving nodes prefer small Routing periods to mitigate the effect of their mobility.

  • Adaptive Probabilistic Proactive Routing for Dense MANETs
    Journal of Computer Networks and Communications, 2012
    Co-Authors: Abdelfettah Belghith, Mohamed Amine Abid, Adel Ben Mnaouer
    Abstract:

    Conventional Proactive Routing protocols, due to their inherent nature based on shortest paths, select longer links which are amenable to rapid breakages as nodes move around. In this paper, we propose a novel adaptive probabilistic approach to handle Routing information in dense mobile ad hoc networks in a way to improve the Proactive Routing pertinence as a function of network dynamics. We first propose a new Proactive Routing framework based on probabilistic decisions and a generic model to compute the existence probabilities of nodes and links. Then, we present a distributed algorithm to collect the cartography of the network. This cartography is used to instantiate the existence probabilities. Conducted simulations show that our proposal yields substantially better Routing validity. Nonetheless, it amounts to much longer routes. We proposed then a bounding technique to adapt and overcome this side effect and defined two probabilistic Proactive Routing variants. Conducted simulations show that our proposed bounded probabilistic Proactive Routing schemes outperform conventional Routing protocols and yield up to 66 percent increase in throughput.

  • autonomic self tunable Proactive Routing in mobile ad hoc networks
    Wireless and Mobile Computing Networking and Communications, 2009
    Co-Authors: Abdelfettah Belghith, Mohamed Amine Abid
    Abstract:

    Proactive Routing in MANETs induces high signaling overhead. Increasing the Routing period size, while it reduces such an overhead, prevents to correctly track frequent changes in the topology and impacts the validity of Routing as time goes farther from the start of the Routing period. Routes' validity plays a central leveraging mission to enhance network performances as forwarding through incorrect routes not only results in traffic wondering inside the network without ever being able to be delivered to their ultimate destinations but also over consumes valuable network resources. In this paper, we propose an autonomic self tuning approach to dynamically gauge the size of the Routing period in a way to properly calibrate between the amount of signaling overhead and the Routing validity to yield better performances. First, we propose a distributed algorithm to collect the network cartography. We then study the validity of this cartography as a function of time and mobility. The validity of the cartography is then used to dynamically and locally self regulate the Routing period size in a way to calibrate the signaling overhead and the Routing pertinence. Simulation results show that our proposed scheme not only is capable of correctly tracking changes in network dynamics but also outperforms conventional Proactive algorithms by doubling the network throughput at moderate to high workloads.

  • WiMob - Suitability Analysis of Probabilistic Proactive Routing for Dynamic Multi-hop Ad Hoc Networks
    2009 IEEE International Conference on Wireless and Mobile Computing Networking and Communications, 2009
    Co-Authors: Abdelfettah Belghith, Adel Ben Mnaouer, Mohamed Amine Abid
    Abstract:

    We first propose a new Proactive Routing framework based on probabilistic decisions and a generic model to compute the existence probabilities of nodes and links. Then, we present a distributed algorithm to collect the cartography of the network. This cartography is used to instantiate the existence probabilities. Conducted simulations show that our proposal yields substantially better Routing validity. Nonetheless, it amounts to much longer routes. We proposed then a bounding technique to overcome this side effect and defined two probabilistic Proactive Routing variants. Conducted simulations show that our proposed bounded probabilistic Proactive Routing schemes outperform conventional Routing protocols and yield up to 66 percent increase in throughput.

Mohamed Amine Abid - One of the best experts on this subject based on the ideXlab platform.

  • SARP: A dynamically readjustable period size Proactive Routing protocol for MANETs
    Journal of Computer and System Sciences, 2015
    Co-Authors: Mohamed Amine Abid, Abdelfettah Belghith, Khalil Drira
    Abstract:

    The aim of a Routing protocol is to compute routes between every couple of nodes. When the topology evolves over time, Routing decisions should be constantly reconsidered to ensure continuous valid Routing. Conventional Proactive Routing protocols periodically re-compute their Routing-tables. However, due to their inherent nature based on shortest-paths, they select longer links (victims of rapid breakages as nodes move). Increasing the updates' frequency certainly allows a better tracking of the topology changes; however, it induces higher signaling overhead. An adequate trade-off between the period size and the control overhead should be found. In this paper, we propose a new mechanism that keeps sensing the mobility-level to properly-adjust the Routing period size. It relies on a distributed algorithm collecting the network cartography to self-regulate the Routing period size. Simulation results show that our proposal (SARP) correctly tracks topology changes and properly adjusts the current period size leading to better performances.

  • Cartography and Stability to Enhance and Self Regulate Proactive Routing in MANETs
    Geographic Information Systems, 2013
    Co-Authors: Mohamed Amine Abid, Abdelfettah Belghith
    Abstract:

    In this chapter, the authors propose a novel Proactive Routing protocol where Routing advertisement frequency is self regulated locally at and by each node depending on its mobility level. The proposal relays on an asynchronous distributed cartography gathering algorithm and a link stability criterion. The cartography of the network is kept constantly valid in time and for all applied speeds. Each node senses its own dynamics and locally chooses an appropriate Routing advertisement period size. As such stationary nodes generate little signaling traffic while fast moving nodes prefer small Routing periods to mitigate the effect of their mobility.

  • Adaptive Probabilistic Proactive Routing for Dense MANETs
    Journal of Computer Networks and Communications, 2012
    Co-Authors: Abdelfettah Belghith, Mohamed Amine Abid, Adel Ben Mnaouer
    Abstract:

    Conventional Proactive Routing protocols, due to their inherent nature based on shortest paths, select longer links which are amenable to rapid breakages as nodes move around. In this paper, we propose a novel adaptive probabilistic approach to handle Routing information in dense mobile ad hoc networks in a way to improve the Proactive Routing pertinence as a function of network dynamics. We first propose a new Proactive Routing framework based on probabilistic decisions and a generic model to compute the existence probabilities of nodes and links. Then, we present a distributed algorithm to collect the cartography of the network. This cartography is used to instantiate the existence probabilities. Conducted simulations show that our proposal yields substantially better Routing validity. Nonetheless, it amounts to much longer routes. We proposed then a bounding technique to adapt and overcome this side effect and defined two probabilistic Proactive Routing variants. Conducted simulations show that our proposed bounded probabilistic Proactive Routing schemes outperform conventional Routing protocols and yield up to 66 percent increase in throughput.

  • autonomic self tunable Proactive Routing in mobile ad hoc networks
    Wireless and Mobile Computing Networking and Communications, 2009
    Co-Authors: Abdelfettah Belghith, Mohamed Amine Abid
    Abstract:

    Proactive Routing in MANETs induces high signaling overhead. Increasing the Routing period size, while it reduces such an overhead, prevents to correctly track frequent changes in the topology and impacts the validity of Routing as time goes farther from the start of the Routing period. Routes' validity plays a central leveraging mission to enhance network performances as forwarding through incorrect routes not only results in traffic wondering inside the network without ever being able to be delivered to their ultimate destinations but also over consumes valuable network resources. In this paper, we propose an autonomic self tuning approach to dynamically gauge the size of the Routing period in a way to properly calibrate between the amount of signaling overhead and the Routing validity to yield better performances. First, we propose a distributed algorithm to collect the network cartography. We then study the validity of this cartography as a function of time and mobility. The validity of the cartography is then used to dynamically and locally self regulate the Routing period size in a way to calibrate the signaling overhead and the Routing pertinence. Simulation results show that our proposed scheme not only is capable of correctly tracking changes in network dynamics but also outperforms conventional Proactive algorithms by doubling the network throughput at moderate to high workloads.

  • WiMob - Suitability Analysis of Probabilistic Proactive Routing for Dynamic Multi-hop Ad Hoc Networks
    2009 IEEE International Conference on Wireless and Mobile Computing Networking and Communications, 2009
    Co-Authors: Abdelfettah Belghith, Adel Ben Mnaouer, Mohamed Amine Abid
    Abstract:

    We first propose a new Proactive Routing framework based on probabilistic decisions and a generic model to compute the existence probabilities of nodes and links. Then, we present a distributed algorithm to collect the cartography of the network. This cartography is used to instantiate the existence probabilities. Conducted simulations show that our proposal yields substantially better Routing validity. Nonetheless, it amounts to much longer routes. We proposed then a bounding technique to overcome this side effect and defined two probabilistic Proactive Routing variants. Conducted simulations show that our proposed bounded probabilistic Proactive Routing schemes outperform conventional Routing protocols and yield up to 66 percent increase in throughput.