Broadcast is a common operation used in Mobile Ad hoc Networks (MANETs) for many services, such a... more Broadcast is a common operation used in Mobile Ad hoc Networks (MANETs) for many services, such as, rout discovery and sending an information messages. The direct method to perform broadcast is simple flooding, which it can dramatically affect the performance of MANET. Recently, a probabilistic approach to flooding has been proposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to the collision, contention and duplicated messages. This paper proposed new probabilistic method to improve the performance of existing on-demand routing protocol by reduced the RREQ overhead during rout discovery operation. The simulation results show that the combination of AODV and a suitable probabilistic rout discovery can reduce the average end-to-end delay as well as overhead and still achieving low normalized routing load, comparing with AODV which used fixed probability and blind flooding.
In this paper, we investigate efficient strategies for supporting velocity aware probabilistic ro... more In this paper, we investigate efficient strategies for supporting velocity aware probabilistic route discovery in Mobile Ad hoc Networks (MANETs). MANETs usually use broadcast mechanisms to discover routes between nodes by flooding the network with RREQ packets. Usually, the routes of the high mobility nodes have frequent breakages which result in re-discovering the same routes frequently. Hence, uncontrolled RREQ packets can cause more channel contention and increase packets collision rate. This is well-known as the broadcast storm problem where different probabilistic solutions have been suggested to mitigate its side effect. To the best of our knowledge, this study is the first that considers the velocity vector probabilistic route discover in MANETs. Precisely, this study proposes a new Velocity Aware-Probabilistic (VAP) route discovery model, which can exclude unstable nodes while constructing routes between the source and its destination. Our simulation experiments confirm tha...
In VANETs, there are many applications that use broadcast communication as a fundamental operatio... more In VANETs, there are many applications that use broadcast communication as a fundamental operational tool, in disseminating information of interest to other road users under the umbrella of both safety and entertainment applications. Recently, the probabilistic broadcasting scheme is suggested as an efficient broadcast approach. Although a number of probabilistic schemes found in the literature, they still suffer from a high level of rebroadcast redundancy, which often leads to the Broadcast Storm Problem (BSP). Thus, in this paper a new efficient probabilistic broadcast scheme is developed, to target both achieving a high delivery ratio and reducing broadcast redundancy. Using simulation experiment, we compared the performance of the proposed scheme against the recent well known probabilistic schemes and our results confirm the superiority of our scheme over existing schemes in terms of key performance metrics, namely Reachability (RE) and Saved Rebroadcast (SR).
Mobile ad hoc networks (MANETs) have been gaining tremendous attention owing to the advances in w... more Mobile ad hoc networks (MANETs) have been gaining tremendous attention owing to the advances in wireless technologies accompanied by many applications and implementations. However, there are still a number of issues in MANETs which require further investigations and efficient solutions. Out of these issues, broadcasting in MANETs has been a major problem for both industry and the research community. The broadcast communication is usually required to disseminate a message to all the nodes of a network. This operation is highly required in MANETs to distribute necessary information and ensure efficient control and coordination over the network nodes. However, broadcasting in MANETs is usually susceptible to several challenging communication issues, including, flooding, packets contentions and collisions, i.e., these problems all together are called the Broadcast Storm Problem (BSP). Despite a number of suggested solutions for BSP, the probabilistic scheme is considered the most promising solution due to its simplicity and suitability for MANETs. Under the umbrella of this scheme, many dynamic probabilistic broadcasting algorithms have been proposed in the literature to solve the BSP. However, most of them are not suitable for many applications including those real life scenarios as there are many limitations such as the probability of rebroadcasting operation and thresholds rebroadcasting permission, which is caused by collecting local neighbourhoods' connectivity by broadcasting HELLO packets.
High performance group communication, such as broadcast, requires matching efficient broadcast al... more High performance group communication, such as broadcast, requires matching efficient broadcast algorithms to effective route discovery approach. Broadcast communication in MANETs is essential for a wide range of important applications. Nevertheless, existing broadcast schemes in MANETs suffer in terms of several issues such as rebroadcast redundancy and collisions. Consequently, this degrades the communication quality especially when dealing with high bandwidth applications. Thus, this paper adopts a new strategy that presents a new distributed route discovery (DRD) scheme to handle the broadcast operation efficiently by reducing the number of the broadcast redundancy request (RREQ) packets and the number of collision and contentions. We examined the performance of the proposed scheme DRD in MANETs; in terms of RREQ rebroadcast number and RREQ collision number. Our experiments confirm the superiority of the proposed scheme over its counterparts in different communication constraints. Kew-Words: Broadcast, Probabilistic route discovery and Network global and local Density.
Broadcast is a fundamental operation used in Mobile Ad hoc NETworks (MANETs) for many services, s... more Broadcast is a fundamental operation used in Mobile Ad hoc NETworks (MANETs) for many services, such as route discovery and sending information messages. The direct method to perform broadcast is a simple flooding, which can decrease the performance of MANET. Recently, a probabilistic approach to flooding has been proposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to the collision, contention and duplicated messages. This paper presents the Smart Probabilistic Broadcasting (SPB) as a new probabilistic method to improve the performance of existing on-demand routing protocols by reducing the RREQ overhead during the rout discovery operation. The simulation results show that the combination of AODV and a suitable probabilistic rout discovery can reduce the average end-to-end delay as well as overhead, while achieving low normalized routing load, compared to AODV that uses fixed probability and blind flooding. Simulation experiments have been conducted to examine our proposed scheme. The results show that SPB outperforms its counterparts and opens up a promising framework towards optimal probabilistic broadcasting.
Broadcast is a common operation used in Mobile Ad hoc Networks (MANETs) for many services, such a... more Broadcast is a common operation used in Mobile Ad hoc Networks (MANETs) for many services, such as, rout discovery and sending an information messages. The direct method to perform broadcast is simple flooding, which it can dramatically affect the performance of MANET. Recently, a probabilistic approach to flooding has been proposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to the collision, contention and duplicated messages. This paper proposed new probabilistic method to improve the performance of existing on-demand routing protocol by reduced the RREQ overhead during rout discovery operation. The simulation results show that the combination of AODV and a suitable probabilistic rout discovery can reduce the average end-to-end delay as well as overhead and still achieving low normalized routing load, comparing with AODV which used fixed probability and blind flooding.
In this paper, we investigate efficient strategies for supporting velocity aware probabilistic ro... more In this paper, we investigate efficient strategies for supporting velocity aware probabilistic route discovery in Mobile Ad hoc Networks (MANETs). MANETs usually use broadcast mechanisms to discover routes between nodes by flooding the network with RREQ packets. Usually, the routes of the high mobility nodes have frequent breakages which result in re-discovering the same routes frequently. Hence, uncontrolled RREQ packets can cause more channel contention and increase packets collision rate. This is well-known as the broadcast storm problem where different probabilistic solutions have been suggested to mitigate its side effect. To the best of our knowledge, this study is the first that considers the velocity vector probabilistic route discover in MANETs. Precisely, this study proposes a new Velocity Aware-Probabilistic (VAP) route discovery model, which can exclude unstable nodes while constructing routes between the source and its destination. Our simulation experiments confirm tha...
In VANETs, there are many applications that use broadcast communication as a fundamental operatio... more In VANETs, there are many applications that use broadcast communication as a fundamental operational tool, in disseminating information of interest to other road users under the umbrella of both safety and entertainment applications. Recently, the probabilistic broadcasting scheme is suggested as an efficient broadcast approach. Although a number of probabilistic schemes found in the literature, they still suffer from a high level of rebroadcast redundancy, which often leads to the Broadcast Storm Problem (BSP). Thus, in this paper a new efficient probabilistic broadcast scheme is developed, to target both achieving a high delivery ratio and reducing broadcast redundancy. Using simulation experiment, we compared the performance of the proposed scheme against the recent well known probabilistic schemes and our results confirm the superiority of our scheme over existing schemes in terms of key performance metrics, namely Reachability (RE) and Saved Rebroadcast (SR).
Mobile ad hoc networks (MANETs) have been gaining tremendous attention owing to the advances in w... more Mobile ad hoc networks (MANETs) have been gaining tremendous attention owing to the advances in wireless technologies accompanied by many applications and implementations. However, there are still a number of issues in MANETs which require further investigations and efficient solutions. Out of these issues, broadcasting in MANETs has been a major problem for both industry and the research community. The broadcast communication is usually required to disseminate a message to all the nodes of a network. This operation is highly required in MANETs to distribute necessary information and ensure efficient control and coordination over the network nodes. However, broadcasting in MANETs is usually susceptible to several challenging communication issues, including, flooding, packets contentions and collisions, i.e., these problems all together are called the Broadcast Storm Problem (BSP). Despite a number of suggested solutions for BSP, the probabilistic scheme is considered the most promising solution due to its simplicity and suitability for MANETs. Under the umbrella of this scheme, many dynamic probabilistic broadcasting algorithms have been proposed in the literature to solve the BSP. However, most of them are not suitable for many applications including those real life scenarios as there are many limitations such as the probability of rebroadcasting operation and thresholds rebroadcasting permission, which is caused by collecting local neighbourhoods' connectivity by broadcasting HELLO packets.
High performance group communication, such as broadcast, requires matching efficient broadcast al... more High performance group communication, such as broadcast, requires matching efficient broadcast algorithms to effective route discovery approach. Broadcast communication in MANETs is essential for a wide range of important applications. Nevertheless, existing broadcast schemes in MANETs suffer in terms of several issues such as rebroadcast redundancy and collisions. Consequently, this degrades the communication quality especially when dealing with high bandwidth applications. Thus, this paper adopts a new strategy that presents a new distributed route discovery (DRD) scheme to handle the broadcast operation efficiently by reducing the number of the broadcast redundancy request (RREQ) packets and the number of collision and contentions. We examined the performance of the proposed scheme DRD in MANETs; in terms of RREQ rebroadcast number and RREQ collision number. Our experiments confirm the superiority of the proposed scheme over its counterparts in different communication constraints. Kew-Words: Broadcast, Probabilistic route discovery and Network global and local Density.
Broadcast is a fundamental operation used in Mobile Ad hoc NETworks (MANETs) for many services, s... more Broadcast is a fundamental operation used in Mobile Ad hoc NETworks (MANETs) for many services, such as route discovery and sending information messages. The direct method to perform broadcast is a simple flooding, which can decrease the performance of MANET. Recently, a probabilistic approach to flooding has been proposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to the collision, contention and duplicated messages. This paper presents the Smart Probabilistic Broadcasting (SPB) as a new probabilistic method to improve the performance of existing on-demand routing protocols by reducing the RREQ overhead during the rout discovery operation. The simulation results show that the combination of AODV and a suitable probabilistic rout discovery can reduce the average end-to-end delay as well as overhead, while achieving low normalized routing load, compared to AODV that uses fixed probability and blind flooding. Simulation experiments have been conducted to examine our proposed scheme. The results show that SPB outperforms its counterparts and opens up a promising framework towards optimal probabilistic broadcasting.
Uploads
Papers by Mustafa Khalaf