Hussein Al-Bahadili | Petra University (original) (raw)
Papers by Hussein Al-Bahadili
Steganography is the art of hiding confidential information (secret) within any media file (cover... more Steganography is the art of hiding confidential information (secret) within any media file (cover media) to
produce an amalgamated secret-cover media called stego media, so that the secret cannot be recognized or
recovered by unauthorized recipients. Many steganalysis techniques have been developed enabling
recognition of the existence of secrets within stego media and recovering it. Therefore, it is necessary to
develop more secure steganography algorithms. This paper presents a detailed description of a new secure
Block Permutation Image Steganography (BPIS) algorithm. The algorithm converts the secret message to a
binary sequence, divides the binary sequence into blocks, permutes the block using a key-based randomly
generated permutation, concatenates the permuted blocks forming a permuted binary sequence, and then
utilizes the Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image
file. The algorithm performance is investigated through performing a number of experiments, and for each
experiment the PSNR (Peak Signal-to-Noise Ratio) between the stego and cover images is calculated. The
results show that the algorithm provides high image quality, and invisibility, and most importantly higher
security as secret cannot be recovered without knowing the permutation, which has a complexity of O(N!),
where N is the length of the permutation.
International Journal of Computers and Applications, 2010
ABSTRACT In this paper we proposed and evaluated the performance of a new bit-level text compress... more ABSTRACT In this paper we proposed and evaluated the performance of a new bit-level text compression scheme that is based on the Hamming codes based data compression (HCDC) algorithm. The scheme consists of six steps some of which are repetitively applied to achieve higher compression ratio. The repetition loops continue until inflation detected and the accumulated compression ratio is the multiplication of the compression ratios of the individual loops, therefore, we refer to the new scheme as HCDC(k), where k refers to the number of repetition loops. To enhance the compression power of the HCDC(k) scheme, a new adaptive encoding format was proposed in which a character is encoded to binary according to its probability. This method of encoding reduces the binary sequence entropy so that it grants higher compression ratio. A number of text files from standard corpora were compressed and the obtained results demonstrated that the proposed scheme has higher compression power than many widely used compression algorithms and it has a competitive performance with respect to state-of-the-art programs.
International Journal of Soft Computing
International Journal on Cryptography and Information Security, 2013
Steganography is the art of hiding confidential information (secret) within any media file (cover... more Steganography is the art of hiding confidential information (secret) within any media file (cover media) to produce an amalgamated secret-cover media called stego media, so that the secret cannot be recognized or recovered by unauthorized recipients. Many steganalysis techniques have been developed enabling recognition of the existence of secrets within stego media and recovering it. Therefore, it is necessary to develop more secure steganography algorithms. This paper presents a detailed description of a new secure Block Permutation Image Steganography (BPIS) algorithm. The algorithm converts the secret message to a binary sequence, divides the binary sequence into blocks, permutes the block using a key-based randomly generated permutation, concatenates the permuted blocks forming a permuted binary sequence, and then utilizes the Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file. The algorithm performance is investigated through performing a number of experiments, and for each experiment the PSNR (Peak Signal-to-Noise Ratio) between the stego and cover images is calculated. The results show that the algorithm provides high image quality, and invisibility, and most importantly higher security as secret cannot be recovered without knowing the permutation, which has a complexity of O(N!), where N is the length of the permutation.
Advancements and Discoveries, 2012
Page 1. 346 Copyright © 2012, IGI Global. Copying or distributing in print or electronic forms wi... more Page 1. 346 Copyright © 2012, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. Chapter 21 Hussein Al-Bahadili The Arab Academy for Banking and Financial Sciences, Jordan ...
Handbook of Research on Threat Detection and Countermeasures in Network Security, 2015
Wireless ad hoc networks are susceptible to attacks by malicious nodes that could easily bring do... more Wireless ad hoc networks are susceptible to attacks by malicious nodes that could easily bring down the whole network. Therefore, it is important to have a reliable mechanism for detecting and isolating malicious nodes before they can do any harm to the network. Trust-based routing protocols are one possible mechanism as they locate trusted routes dynamically to conform to network environment. However, such algorithms require reliable and effective trust determination algorithm. This chapter presents a detail description and evaluation of the trust determination algorithm, namely, the Neighbor-Weight Trust Determination (NWTD) algorithm. The performance of the algorithm is evaluated through simulation using the Mobile Ad hoc Network (MANET) simulator (MANSim). The simulation results demonstrated the effectiveness and reliability of the algorithm in isolating any maliciously behaving node(s) in a timely manner.
2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT), 2011
Abstract The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined to... more Abstract The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called (LAR-1P)[1]. Simulation results in [1] demonstrated that, on network ...
International Journal on Cloud Computing: Services and Architecture, 2013
Journal of Computer Science
Problem statement: The introduction of Information Technology (IT) to government institutions in ... more Problem statement: The introduction of Information Technology (IT) to government institutions in developing countries bears a great deal of risk of failure. The lack of qualified personnel, lack of financial support and the lack of planning and proper justification are just few of the causes of projects failure. Study presented in this study focused on the justification issue of IT projects through the application of Cost Benefit Analysis (CBA) as part of a comprehensive Economic Efficiency Analysis (EEA) of IT Projects, thus providing management with a decision making tool which highlights existing and future problems and reduces the risk of failure. Approach: Cost-Benefit Analysis (CBA) based on Economic Efficiency Analysis (EEA) was performed on selected IT projects from ministries and key institutions in the government of Jordan using a well established approach employed by the Federal Government of Germany (KBSt approach). The approach was then modified and refined to suit the ...
2013 1st International Conference & Exhibition on the Applications of Information Technology to Renewable Energy Processes and Systems, 2013
ABSTRACT A photovoltaic (PV) solar panels exhibit non-linear current-voltage characteristics, and... more ABSTRACT A photovoltaic (PV) solar panels exhibit non-linear current-voltage characteristics, and according to the maximum power transform (MPT) theory, it can produce maximum power at only one particular operating point (OP), namely, when the source impedance matches with the load impedance, a match which cannot be guaranteed spontaneously. Furthermore, the maximum power point (MPP) changes with temperature and light intensity variations. Therefore, different algorithms have been developed for maximum power point tracking (MPPT) based on offline and online methods. Evaluating the performance of these algorithms for various PV systems operating under highly dynamic environments are essentials to ensure a reliable, efficient, cost-effective, and high performance systems. One possible approach for system evaluation is to use computer simulation. This paper addresses the use of MATLAB software as a simulation tool for evaluating the performance of MPPT for PV systems.
International Journal of Mobile Learning and Organisation, 2011
There has been an enormous increase in the use of mobile learning (m-learning) systems in many fi... more There has been an enormous increase in the use of mobile learning (m-learning) systems in many fields due to the tremendous advancement in information and communication technologies. Although, there are many frameworks that have been developed for identifying and categorising the different components of m-learning systems, most of them have some limitations, drawbacks, and no support for quantitative assessment for the success factors (global weights) of the system criteria. In this paper, a new scalable hierarchal framework is developed, which identifies and categorises all components that may affect the development and deployments of costeffective m-learning. Furthermore, due to the hierarchal structure of the framework, any of the analytic hierarchy process techniques can be used to quantitatively estimate the success factors of the system criteria. In order to demonstrate the benefits and flexibility of the new framework, we develop an interactive software tool for computing success factors of the different system criteria. The tool is referred to as SFacts, and it is used to compute success factors for different sets of preferences.
International Journal of Interactive Mobile Technologies (iJIM), 2011
in this paper, we propose a unified and interactive mobile learning (M-Learning) model to help wi... more in this paper, we propose a unified and interactive mobile learning (M-Learning) model to help with expanding and spreading education in the Arab Homeland countries. The model utilizes a new competitive spot beam satellite communication technology, which enables efficient channel allocation, where communication channels can be allocated to specific and precise areas. The proposed model is referred to as the interactive Arab education satellite (IAESat).The communication satellite can efficiently and effectively cover the entire Arab Homeland and reaches a wide area and mobile users that cannot be reached otherwise. The model implements existing interactivity components to enhance the learning process and meet international standards in education. Index Terms-E-Learning, M-Learning, interactive learning, education satellite, spot beam communication.
International journal of Computer Networks & Communications, 2011
Page 1. International Journal of Computer Networks & Communications (IJCNC) Vol.3, No.4, ... more Page 1. International Journal of Computer Networks & Communications (IJCNC) Vol.3, No.4, July 2011 DOI : 10.5121/ijcnc.2011.3406 72 INVESTIGATING THE EFFECT OF NOISE-LEVEL ON PROBABILISTIC BROADCAST IN NOISY MANETS ...
International journal of Computer Networks & Communications, 2011
... enhance their performance. Bolena and Camp [9] and Vyas and Mahgoub [18] combined location in... more ... enhance their performance. Bolena and Camp [9] and Vyas and Mahgoub [18] combined location information and mobility feedback and pattern to create new routing protocol to reduce routing overheads. The results showed ...
nguyendangbinh.org
This paper introduces a new method to enhance the performance of the Standard Data Encryption Sta... more This paper introduces a new method to enhance the performance of the Standard Data Encryption Standard (DES), or any permutation dependent encryption algorithms, by increasing the brute-force attack time complexity by a factor of 64!. The new algorithm is referred to as Enhanced DES (EDES). This is done by replacing the predefined initial permutations (IP) and its inverse (IP -1 ) that are used in the standard DES design with key-based permutations. The new permutations are derived using the Key-Based Random Permutation (KBRP) method. These permutations are derived by using the same cipher key that is used in the standard DES. Therefore, these permutations will not be fixed and can be considered as pseudorandom permutations. The performance of the new EDES algorithm is examined in term of the features of the generated ciphertext and processing time.
This paper presents a description and performance evaluation of a threshold secret sharing (TSS) ... more This paper presents a description and performance evaluation of a threshold secret sharing (TSS) node authentication scheme in noisy mobile ad hoc networks (MANETs). The scheme can be used effectively in selfsecuring MANETs suffering from high packet-loss due to presence of noise and node mobility. In order to evaluate the performance of the TSS scheme in noisy MANETs, a number of simulations were carried-out to investigate the variation of the authentication success ratio against the threshold secret share for various node densities, node speeds, and noise-levels. Simulation results demonstrated that, for certain threshold secret share, presence of noise inflicts significant reduction in the authentication success ratio, while node mobility inflicts no or insignificant effect. The outcomes of these simulations are so important to facilitate efficient network security management.
American Journal of Applied Sciences
This study presents a new efficient password-based strong key derivation algorithm usingthe key b... more This study presents a new efficient password-based strong key derivation algorithm usingthe key based random permutation the KBRP method. The algorithm consists of five steps, the firstthree steps are similar to those formed the KBRP method. The last two steps are added to derive a keyand to ensure that the derived key has all the characteristics of a strong key. In order to demonstrate theefficiency of the algorithm, a number of keys are derived using various passwords of different contentand length. The features of the derived keys show a good agreement with all characteristics of strongkeys. In addition, they are compared with features of keys generated using the WLAN strong keygenerator v2.2 by Warewolf Labs.
Use and Analysis, 2012
... pages 41-61). Alexander Garcia D. (Alexander Garcia D.Universidad Autonoma de Occidente, Colo... more ... pages 41-61). Alexander Garcia D. (Alexander Garcia D.Universidad Autonoma de Occidente, Colombia), Lina Escobar P. (Lina Escobar P ... 8. Simulation of a Dynamic-Noise-Dependent Probabilistic Algorithm in MANETs (pages 158-177). Hussein Al-Bahadili (Petra University ...
International Journal of Business Data Communications and Networking, 2000
Abstract In mobile ad hoc networks (MANETs), broadcasting is widely used in route discovery and o... more Abstract In mobile ad hoc networks (MANETs), broadcasting is widely used in route discovery and other network services. The most widely used broadcasting algorithm is simple flooding, which aggravates a high number of redundant packet retransmissions, ...
Wireless communication channels in mobile ad hoc network (MANETs) suffer from high packet-loss du... more Wireless communication channels in mobile ad hoc network (MANETs) suffer from high packet-loss due to presence of noise. This paper presents a detail description of a simulation model that can be used to evaluate the performance of probabilistic broadcast for flooding in noisy environment. In this model, the noise-level is represented by a generic name, probability of reception (p c) (0≤ p c ≤1), where p c =1 for noiseless and p c <1 for noisy. The effect of noise is determined randomly by generating a random number (0≤<1); if ≤p c means the packet is successfully delivered to the receiving node, otherwise, unsuccessful delivery occurs. The proposed model is implemented on a MANET simulator, namely, MANSim. In order to investigate the effect of noise on the performance of probabilistic broadcast in noisy MANETs, four scenarios were simulated. The main conclusions of these scenarios are: The performance of probabilistic broadcast decreases with decreasing p c . The percenta...
Steganography is the art of hiding confidential information (secret) within any media file (cover... more Steganography is the art of hiding confidential information (secret) within any media file (cover media) to
produce an amalgamated secret-cover media called stego media, so that the secret cannot be recognized or
recovered by unauthorized recipients. Many steganalysis techniques have been developed enabling
recognition of the existence of secrets within stego media and recovering it. Therefore, it is necessary to
develop more secure steganography algorithms. This paper presents a detailed description of a new secure
Block Permutation Image Steganography (BPIS) algorithm. The algorithm converts the secret message to a
binary sequence, divides the binary sequence into blocks, permutes the block using a key-based randomly
generated permutation, concatenates the permuted blocks forming a permuted binary sequence, and then
utilizes the Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image
file. The algorithm performance is investigated through performing a number of experiments, and for each
experiment the PSNR (Peak Signal-to-Noise Ratio) between the stego and cover images is calculated. The
results show that the algorithm provides high image quality, and invisibility, and most importantly higher
security as secret cannot be recovered without knowing the permutation, which has a complexity of O(N!),
where N is the length of the permutation.
International Journal of Computers and Applications, 2010
ABSTRACT In this paper we proposed and evaluated the performance of a new bit-level text compress... more ABSTRACT In this paper we proposed and evaluated the performance of a new bit-level text compression scheme that is based on the Hamming codes based data compression (HCDC) algorithm. The scheme consists of six steps some of which are repetitively applied to achieve higher compression ratio. The repetition loops continue until inflation detected and the accumulated compression ratio is the multiplication of the compression ratios of the individual loops, therefore, we refer to the new scheme as HCDC(k), where k refers to the number of repetition loops. To enhance the compression power of the HCDC(k) scheme, a new adaptive encoding format was proposed in which a character is encoded to binary according to its probability. This method of encoding reduces the binary sequence entropy so that it grants higher compression ratio. A number of text files from standard corpora were compressed and the obtained results demonstrated that the proposed scheme has higher compression power than many widely used compression algorithms and it has a competitive performance with respect to state-of-the-art programs.
International Journal of Soft Computing
International Journal on Cryptography and Information Security, 2013
Steganography is the art of hiding confidential information (secret) within any media file (cover... more Steganography is the art of hiding confidential information (secret) within any media file (cover media) to produce an amalgamated secret-cover media called stego media, so that the secret cannot be recognized or recovered by unauthorized recipients. Many steganalysis techniques have been developed enabling recognition of the existence of secrets within stego media and recovering it. Therefore, it is necessary to develop more secure steganography algorithms. This paper presents a detailed description of a new secure Block Permutation Image Steganography (BPIS) algorithm. The algorithm converts the secret message to a binary sequence, divides the binary sequence into blocks, permutes the block using a key-based randomly generated permutation, concatenates the permuted blocks forming a permuted binary sequence, and then utilizes the Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file. The algorithm performance is investigated through performing a number of experiments, and for each experiment the PSNR (Peak Signal-to-Noise Ratio) between the stego and cover images is calculated. The results show that the algorithm provides high image quality, and invisibility, and most importantly higher security as secret cannot be recovered without knowing the permutation, which has a complexity of O(N!), where N is the length of the permutation.
Advancements and Discoveries, 2012
Page 1. 346 Copyright © 2012, IGI Global. Copying or distributing in print or electronic forms wi... more Page 1. 346 Copyright © 2012, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. Chapter 21 Hussein Al-Bahadili The Arab Academy for Banking and Financial Sciences, Jordan ...
Handbook of Research on Threat Detection and Countermeasures in Network Security, 2015
Wireless ad hoc networks are susceptible to attacks by malicious nodes that could easily bring do... more Wireless ad hoc networks are susceptible to attacks by malicious nodes that could easily bring down the whole network. Therefore, it is important to have a reliable mechanism for detecting and isolating malicious nodes before they can do any harm to the network. Trust-based routing protocols are one possible mechanism as they locate trusted routes dynamically to conform to network environment. However, such algorithms require reliable and effective trust determination algorithm. This chapter presents a detail description and evaluation of the trust determination algorithm, namely, the Neighbor-Weight Trust Determination (NWTD) algorithm. The performance of the algorithm is evaluated through simulation using the Mobile Ad hoc Network (MANET) simulator (MANSim). The simulation results demonstrated the effectiveness and reliability of the algorithm in isolating any maliciously behaving node(s) in a timely manner.
2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT), 2011
Abstract The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined to... more Abstract The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called (LAR-1P)[1]. Simulation results in [1] demonstrated that, on network ...
International Journal on Cloud Computing: Services and Architecture, 2013
Journal of Computer Science
Problem statement: The introduction of Information Technology (IT) to government institutions in ... more Problem statement: The introduction of Information Technology (IT) to government institutions in developing countries bears a great deal of risk of failure. The lack of qualified personnel, lack of financial support and the lack of planning and proper justification are just few of the causes of projects failure. Study presented in this study focused on the justification issue of IT projects through the application of Cost Benefit Analysis (CBA) as part of a comprehensive Economic Efficiency Analysis (EEA) of IT Projects, thus providing management with a decision making tool which highlights existing and future problems and reduces the risk of failure. Approach: Cost-Benefit Analysis (CBA) based on Economic Efficiency Analysis (EEA) was performed on selected IT projects from ministries and key institutions in the government of Jordan using a well established approach employed by the Federal Government of Germany (KBSt approach). The approach was then modified and refined to suit the ...
2013 1st International Conference & Exhibition on the Applications of Information Technology to Renewable Energy Processes and Systems, 2013
ABSTRACT A photovoltaic (PV) solar panels exhibit non-linear current-voltage characteristics, and... more ABSTRACT A photovoltaic (PV) solar panels exhibit non-linear current-voltage characteristics, and according to the maximum power transform (MPT) theory, it can produce maximum power at only one particular operating point (OP), namely, when the source impedance matches with the load impedance, a match which cannot be guaranteed spontaneously. Furthermore, the maximum power point (MPP) changes with temperature and light intensity variations. Therefore, different algorithms have been developed for maximum power point tracking (MPPT) based on offline and online methods. Evaluating the performance of these algorithms for various PV systems operating under highly dynamic environments are essentials to ensure a reliable, efficient, cost-effective, and high performance systems. One possible approach for system evaluation is to use computer simulation. This paper addresses the use of MATLAB software as a simulation tool for evaluating the performance of MPPT for PV systems.
International Journal of Mobile Learning and Organisation, 2011
There has been an enormous increase in the use of mobile learning (m-learning) systems in many fi... more There has been an enormous increase in the use of mobile learning (m-learning) systems in many fields due to the tremendous advancement in information and communication technologies. Although, there are many frameworks that have been developed for identifying and categorising the different components of m-learning systems, most of them have some limitations, drawbacks, and no support for quantitative assessment for the success factors (global weights) of the system criteria. In this paper, a new scalable hierarchal framework is developed, which identifies and categorises all components that may affect the development and deployments of costeffective m-learning. Furthermore, due to the hierarchal structure of the framework, any of the analytic hierarchy process techniques can be used to quantitatively estimate the success factors of the system criteria. In order to demonstrate the benefits and flexibility of the new framework, we develop an interactive software tool for computing success factors of the different system criteria. The tool is referred to as SFacts, and it is used to compute success factors for different sets of preferences.
International Journal of Interactive Mobile Technologies (iJIM), 2011
in this paper, we propose a unified and interactive mobile learning (M-Learning) model to help wi... more in this paper, we propose a unified and interactive mobile learning (M-Learning) model to help with expanding and spreading education in the Arab Homeland countries. The model utilizes a new competitive spot beam satellite communication technology, which enables efficient channel allocation, where communication channels can be allocated to specific and precise areas. The proposed model is referred to as the interactive Arab education satellite (IAESat).The communication satellite can efficiently and effectively cover the entire Arab Homeland and reaches a wide area and mobile users that cannot be reached otherwise. The model implements existing interactivity components to enhance the learning process and meet international standards in education. Index Terms-E-Learning, M-Learning, interactive learning, education satellite, spot beam communication.
International journal of Computer Networks & Communications, 2011
Page 1. International Journal of Computer Networks & Communications (IJCNC) Vol.3, No.4, ... more Page 1. International Journal of Computer Networks & Communications (IJCNC) Vol.3, No.4, July 2011 DOI : 10.5121/ijcnc.2011.3406 72 INVESTIGATING THE EFFECT OF NOISE-LEVEL ON PROBABILISTIC BROADCAST IN NOISY MANETS ...
International journal of Computer Networks & Communications, 2011
... enhance their performance. Bolena and Camp [9] and Vyas and Mahgoub [18] combined location in... more ... enhance their performance. Bolena and Camp [9] and Vyas and Mahgoub [18] combined location information and mobility feedback and pattern to create new routing protocol to reduce routing overheads. The results showed ...
nguyendangbinh.org
This paper introduces a new method to enhance the performance of the Standard Data Encryption Sta... more This paper introduces a new method to enhance the performance of the Standard Data Encryption Standard (DES), or any permutation dependent encryption algorithms, by increasing the brute-force attack time complexity by a factor of 64!. The new algorithm is referred to as Enhanced DES (EDES). This is done by replacing the predefined initial permutations (IP) and its inverse (IP -1 ) that are used in the standard DES design with key-based permutations. The new permutations are derived using the Key-Based Random Permutation (KBRP) method. These permutations are derived by using the same cipher key that is used in the standard DES. Therefore, these permutations will not be fixed and can be considered as pseudorandom permutations. The performance of the new EDES algorithm is examined in term of the features of the generated ciphertext and processing time.
This paper presents a description and performance evaluation of a threshold secret sharing (TSS) ... more This paper presents a description and performance evaluation of a threshold secret sharing (TSS) node authentication scheme in noisy mobile ad hoc networks (MANETs). The scheme can be used effectively in selfsecuring MANETs suffering from high packet-loss due to presence of noise and node mobility. In order to evaluate the performance of the TSS scheme in noisy MANETs, a number of simulations were carried-out to investigate the variation of the authentication success ratio against the threshold secret share for various node densities, node speeds, and noise-levels. Simulation results demonstrated that, for certain threshold secret share, presence of noise inflicts significant reduction in the authentication success ratio, while node mobility inflicts no or insignificant effect. The outcomes of these simulations are so important to facilitate efficient network security management.
American Journal of Applied Sciences
This study presents a new efficient password-based strong key derivation algorithm usingthe key b... more This study presents a new efficient password-based strong key derivation algorithm usingthe key based random permutation the KBRP method. The algorithm consists of five steps, the firstthree steps are similar to those formed the KBRP method. The last two steps are added to derive a keyand to ensure that the derived key has all the characteristics of a strong key. In order to demonstrate theefficiency of the algorithm, a number of keys are derived using various passwords of different contentand length. The features of the derived keys show a good agreement with all characteristics of strongkeys. In addition, they are compared with features of keys generated using the WLAN strong keygenerator v2.2 by Warewolf Labs.
Use and Analysis, 2012
... pages 41-61). Alexander Garcia D. (Alexander Garcia D.Universidad Autonoma de Occidente, Colo... more ... pages 41-61). Alexander Garcia D. (Alexander Garcia D.Universidad Autonoma de Occidente, Colombia), Lina Escobar P. (Lina Escobar P ... 8. Simulation of a Dynamic-Noise-Dependent Probabilistic Algorithm in MANETs (pages 158-177). Hussein Al-Bahadili (Petra University ...
International Journal of Business Data Communications and Networking, 2000
Abstract In mobile ad hoc networks (MANETs), broadcasting is widely used in route discovery and o... more Abstract In mobile ad hoc networks (MANETs), broadcasting is widely used in route discovery and other network services. The most widely used broadcasting algorithm is simple flooding, which aggravates a high number of redundant packet retransmissions, ...
Wireless communication channels in mobile ad hoc network (MANETs) suffer from high packet-loss du... more Wireless communication channels in mobile ad hoc network (MANETs) suffer from high packet-loss due to presence of noise. This paper presents a detail description of a simulation model that can be used to evaluate the performance of probabilistic broadcast for flooding in noisy environment. In this model, the noise-level is represented by a generic name, probability of reception (p c) (0≤ p c ≤1), where p c =1 for noiseless and p c <1 for noisy. The effect of noise is determined randomly by generating a random number (0≤<1); if ≤p c means the packet is successfully delivered to the receiving node, otherwise, unsuccessful delivery occurs. The proposed model is implemented on a MANET simulator, namely, MANSim. In order to investigate the effect of noise on the performance of probabilistic broadcast in noisy MANETs, four scenarios were simulated. The main conclusions of these scenarios are: The performance of probabilistic broadcast decreases with decreasing p c . The percenta...