Maaly Awad Hassan | Islamic University of Gaza (original) (raw)
Uploads
Books by Maaly Awad Hassan
Papers by Maaly Awad Hassan
Signal & Image Processing : An International Journal, 2011
This paper presents a new effective method for image encryption which employs magnitude and phase... more This paper presents a new effective method for image encryption which employs magnitude and phase manipulation using Differential Evolution (DE) approach. The novelty of this work lies in deploying the concept of keyed discrete Fourier transform (DFT) followed by DE operations for encryption purpose. To this end, a secret key is shared between both encryption and decryption sides. Firstly two dimensional (2-D) keyed discrete Fourier transform is carried out on the original image to be encrypted. Secondly crossover is performed between two components of the encrypted image, which are selected based on Linear Feedback Shift Register (LFSR) index generator. Similarly, keyed mutation is performed on the real parts of a certain components selected based on LFSR index generator. The LFSR index generator initializes it seed with the shared secret key to ensure the security of the resulting indices. The process shuffles the positions of image pixels. A new image encryption scheme based on the DE approach is developed which is composed with a simple diffusion mechanism. The deciphering process is an invertible process using the same key. The resulting encrypted image is found to be fully distorted, resulting in increasing the robustness of the proposed work. The simulation results validate the proposed image encryption scheme.
International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2011
The interference imposes a significant negative impact on the performance of wireless networks. W... more The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. However, additional constraints to graph coloring scenarios that account for various networking conditions result in additional complexity to standard graph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.
There are still a lot of open questions in the field of MANETs and sensor networks. If a topology... more There are still a lot of open questions in the field of MANETs and sensor networks. If a topology incurs a large interference, either many communication signals sent by nodes will collide, or the network may experience a serious delay at delivering the data for some nodes, and even consume more energy. So, we reach to the conclusion that interference imposes a potential negative impact on the performance of wireless networks. In the last few years, researchers actively explored topology control approaches for such networks. The motivation of topology control (TC) is to maintain the connectivity of the network, reduce the node degree and thereby reduce the interference, and reduce power consumption in the sensor nodes. Some literatures have pointed out that a node can interfere with another node even if it is beyond its communication range. To improve the network performance, designing topology control algorithms with consideration of interference is imminent and necessary. Since, it leads to fewer collisions and packet retransmissions, which indirectly reduces the power consumption and extends the lifetime of the network. In this thesis, we propose a new interference-aware connected dominating set-based topology construction algorithm, namely, IACDS algorithm, a simple, distributed, interference-aware and energy-efficient topology construction mechanism that finds a sub-optimal Connected Dominating Set (CDS) to turn unnecessary nodes off while keeping the network connected and providing complete communication coverage with minimum interference. IACDS algorithm utilizes a weighted (distance-energy-interference)-based metric that permits the network operator to trade off the lengths of the branches (distance) for the robustness and durability of the topology (energy and interference).
Journal of Media and Communication Studies, May 31, 2011
Wireless mesh networks (WMNs) have became the focus of many researchers as a promising technology... more Wireless mesh networks (WMNs) have became the focus of many researchers as a promising technology for a broad range of applications due to their self-organizing, self-configuring and selfhealing capability, in addition to their low equipments and deployment cost. WMNs are not mobile ad hoc networks (MANETs); instead they can be considered as a superset of traditional mobile ad hoc networks (MANETS). WMNs may exist in the absence of a central infrastructure taking the form of a MANET. However on the other hand, they may exist as networks comprised of an infrastructure connecting extended ad hoc networks. One significant area of research within ad hoc networks is routing and in particular, the efficient thereof. Owing to the characteristics of WMNs, routing algorithms designed for ad hoc networks however may not always be applicable to WMNs. Moreover, traditional ad hoc routing protocols which disseminate routing information by flooding, a technique which requires a significant consumption of energy and bandwidth, cannot achieve optimal performance especially in hybrid WMNs. In this paper, we use a technique to reduce the cost of disseminating information in a power-constrained environment by limiting the cardinality of the subset of nodes which retransmit a packet. This technique can improve the performance of AODV in hybrid mesh networks.
There are still a lot of open questions in the field of mobile ad hoc networks (MANETs) and senso... more There are still a lot of open questions in the field of mobile ad hoc networks (MANETs) and sensor networks. If a topology incurs a large interference, either many communication signals sent by nodes will collide, or the network may experience a serious delay at delivering the data for some nodes, and even consume more energy. So, we reach the conclusion that interference imposes a potential negative impact on the performance of wireless networks. In the last few years, researchers actively explored topology control approaches for such networks. The motivation of topology control (TC) is to maintain the connectivity of the network, reduce the node degree and thereby reduce the interference, and reduce power consumption in the sensor nodes. Some literatures have pointed out that a node can interfere with another node even if it is beyond its communication range. To improve the network performance, designing topology control algorithms with consideration of interference is imminent and necessary. Since, it leads to fewer collisions and packet retransmissions, which indirectly reduces the power consumption and extends the lifetime of the network. In this paper, we propose a new interference-aware connected dominating set-based (IACDS) topology construction algorithm, namely, IACDS algorithm, a simple, distributed, interference-aware and energy-efficient topology construction mechanism that finds a sub-optimal connected dominating set (CDS) to turn unnecessary nodes off while keeping the network connected and providing complete communication coverage with minimum interference. IACDS algorithm utilizes a weighted distance-energy-interference-based metric that permits the network operator to trade off the lengths of the branches (distance) for the robustness and durability of the topology (energy and interference).
The interference imposes a significant negative impact on the performance of wireless networks. W... more The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. However, additional constraints to graph coloring scenarios that account for various networking conditions result in additional complexity to standard graph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.
This paper presents a new effective method for image encryption which employs magnitude and phase... more This paper presents a new effective method for image encryption which employs magnitude and phase manipulation using Differential Evolution (DE) approach. The novelty of this work lies in deploying the concept of keyed discrete Fourier transform (DFT) followed by DE operations for encryption purpose. To this end, a secret key is shared between both encryption and decryption sides. Firstly two dimensional (2-D) keyed discrete Fourier transform is carried out on the original image to be encrypted. Secondly crossover is performed between two components of the encrypted image, which are selected based on Linear Feedback Shift Register (LFSR) index generator. Similarly, keyed mutation is performed on the real parts of a certain components selected based on LFSR index generator. The LFSR index generator initializes it seed with the shared secret key to ensure the security of the resulting indices. The process shuffles the positions of image pixels. A new image encryption scheme based on the DE approach is developed which is composed with a simple diffusion mechanism. The deciphering process is an invertible process using the same key. The resulting encrypted image is found to be fully distorted, resulting in increasing the robustness of the proposed work. The simulation results validate the proposed image encryption scheme.
Signal & Image Processing : An International Journal, 2011
This paper presents a new effective method for image encryption which employs magnitude and phase... more This paper presents a new effective method for image encryption which employs magnitude and phase manipulation using Differential Evolution (DE) approach. The novelty of this work lies in deploying the concept of keyed discrete Fourier transform (DFT) followed by DE operations for encryption purpose. To this end, a secret key is shared between both encryption and decryption sides. Firstly two dimensional (2-D) keyed discrete Fourier transform is carried out on the original image to be encrypted. Secondly crossover is performed between two components of the encrypted image, which are selected based on Linear Feedback Shift Register (LFSR) index generator. Similarly, keyed mutation is performed on the real parts of a certain components selected based on LFSR index generator. The LFSR index generator initializes it seed with the shared secret key to ensure the security of the resulting indices. The process shuffles the positions of image pixels. A new image encryption scheme based on the DE approach is developed which is composed with a simple diffusion mechanism. The deciphering process is an invertible process using the same key. The resulting encrypted image is found to be fully distorted, resulting in increasing the robustness of the proposed work. The simulation results validate the proposed image encryption scheme.
International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2011
The interference imposes a significant negative impact on the performance of wireless networks. W... more The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. However, additional constraints to graph coloring scenarios that account for various networking conditions result in additional complexity to standard graph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.
There are still a lot of open questions in the field of MANETs and sensor networks. If a topology... more There are still a lot of open questions in the field of MANETs and sensor networks. If a topology incurs a large interference, either many communication signals sent by nodes will collide, or the network may experience a serious delay at delivering the data for some nodes, and even consume more energy. So, we reach to the conclusion that interference imposes a potential negative impact on the performance of wireless networks. In the last few years, researchers actively explored topology control approaches for such networks. The motivation of topology control (TC) is to maintain the connectivity of the network, reduce the node degree and thereby reduce the interference, and reduce power consumption in the sensor nodes. Some literatures have pointed out that a node can interfere with another node even if it is beyond its communication range. To improve the network performance, designing topology control algorithms with consideration of interference is imminent and necessary. Since, it leads to fewer collisions and packet retransmissions, which indirectly reduces the power consumption and extends the lifetime of the network. In this thesis, we propose a new interference-aware connected dominating set-based topology construction algorithm, namely, IACDS algorithm, a simple, distributed, interference-aware and energy-efficient topology construction mechanism that finds a sub-optimal Connected Dominating Set (CDS) to turn unnecessary nodes off while keeping the network connected and providing complete communication coverage with minimum interference. IACDS algorithm utilizes a weighted (distance-energy-interference)-based metric that permits the network operator to trade off the lengths of the branches (distance) for the robustness and durability of the topology (energy and interference).
Journal of Media and Communication Studies, May 31, 2011
Wireless mesh networks (WMNs) have became the focus of many researchers as a promising technology... more Wireless mesh networks (WMNs) have became the focus of many researchers as a promising technology for a broad range of applications due to their self-organizing, self-configuring and selfhealing capability, in addition to their low equipments and deployment cost. WMNs are not mobile ad hoc networks (MANETs); instead they can be considered as a superset of traditional mobile ad hoc networks (MANETS). WMNs may exist in the absence of a central infrastructure taking the form of a MANET. However on the other hand, they may exist as networks comprised of an infrastructure connecting extended ad hoc networks. One significant area of research within ad hoc networks is routing and in particular, the efficient thereof. Owing to the characteristics of WMNs, routing algorithms designed for ad hoc networks however may not always be applicable to WMNs. Moreover, traditional ad hoc routing protocols which disseminate routing information by flooding, a technique which requires a significant consumption of energy and bandwidth, cannot achieve optimal performance especially in hybrid WMNs. In this paper, we use a technique to reduce the cost of disseminating information in a power-constrained environment by limiting the cardinality of the subset of nodes which retransmit a packet. This technique can improve the performance of AODV in hybrid mesh networks.
There are still a lot of open questions in the field of mobile ad hoc networks (MANETs) and senso... more There are still a lot of open questions in the field of mobile ad hoc networks (MANETs) and sensor networks. If a topology incurs a large interference, either many communication signals sent by nodes will collide, or the network may experience a serious delay at delivering the data for some nodes, and even consume more energy. So, we reach the conclusion that interference imposes a potential negative impact on the performance of wireless networks. In the last few years, researchers actively explored topology control approaches for such networks. The motivation of topology control (TC) is to maintain the connectivity of the network, reduce the node degree and thereby reduce the interference, and reduce power consumption in the sensor nodes. Some literatures have pointed out that a node can interfere with another node even if it is beyond its communication range. To improve the network performance, designing topology control algorithms with consideration of interference is imminent and necessary. Since, it leads to fewer collisions and packet retransmissions, which indirectly reduces the power consumption and extends the lifetime of the network. In this paper, we propose a new interference-aware connected dominating set-based (IACDS) topology construction algorithm, namely, IACDS algorithm, a simple, distributed, interference-aware and energy-efficient topology construction mechanism that finds a sub-optimal connected dominating set (CDS) to turn unnecessary nodes off while keeping the network connected and providing complete communication coverage with minimum interference. IACDS algorithm utilizes a weighted distance-energy-interference-based metric that permits the network operator to trade off the lengths of the branches (distance) for the robustness and durability of the topology (energy and interference).
The interference imposes a significant negative impact on the performance of wireless networks. W... more The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. However, additional constraints to graph coloring scenarios that account for various networking conditions result in additional complexity to standard graph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.
This paper presents a new effective method for image encryption which employs magnitude and phase... more This paper presents a new effective method for image encryption which employs magnitude and phase manipulation using Differential Evolution (DE) approach. The novelty of this work lies in deploying the concept of keyed discrete Fourier transform (DFT) followed by DE operations for encryption purpose. To this end, a secret key is shared between both encryption and decryption sides. Firstly two dimensional (2-D) keyed discrete Fourier transform is carried out on the original image to be encrypted. Secondly crossover is performed between two components of the encrypted image, which are selected based on Linear Feedback Shift Register (LFSR) index generator. Similarly, keyed mutation is performed on the real parts of a certain components selected based on LFSR index generator. The LFSR index generator initializes it seed with the shared secret key to ensure the security of the resulting indices. The process shuffles the positions of image pixels. A new image encryption scheme based on the DE approach is developed which is composed with a simple diffusion mechanism. The deciphering process is an invertible process using the same key. The resulting encrypted image is found to be fully distorted, resulting in increasing the robustness of the proposed work. The simulation results validate the proposed image encryption scheme.