Export 105 results:
Sort by: Author Title Type [ Year  (Desc)]
Saroit, I. A., F. A. Amer, and I. A. Saroit, "Dynamic Three Stages Task Scheduling Algorithm on Cloud Computing", International Journal of Computer Science and Information Security, vol. 18, issue 6, 2020. naglaa_master_ijcsis_june_2020.pdf
Saroit, I. A., C. William, and S. M. Mohamed, Energy Efficient ant colony cloud offloading algorithm (EACO), , International Conference on Software and Information Engineering (ICSIE ’20),, 2020. energy_efficient_ant_colony_cloud_offloading_algorithm_eaco.pdf
Saroit, I. A., C. William, and S. M. Mohamed, Energy Efficient ant colony cloud offloading algorithm (EACO), , International Conference on Software and Information Engineering (ICSIE ’20),, 2020. energy_efficient_ant_colony_cloud_offloading_algorithm_eaco.pdf
Saroit, I. A., C. William, and S. M. Mohamed, Energy Efficient ant colony cloud offloading algorithm (EACO), , International Conference on Software and Information Engineering (ICSIE ’20),, 2020. energy_efficient_ant_colony_cloud_offloading_algorithm_eaco.pdf
Saroit, I. A., S. Abdzaher, M. Abdrabou, and A. Al-shami, "Performance Evaluation of Medium Access Control Protocols for Cognitive Radio Ad Hoc Networks", International Conference on Innovative Trends in Computer Engineering (ITCE), Aswan, Egypt, 19-21 February 2, 2019. shimaa_abdzaher-msc-itce-2-2019.pdf
Saroit, I. A., M. A. Kalil, H. Al-Mahdi, and H. Hammam, "A Buffering and Switching Scheme for Admission Control in Cognitive Radio Networks", IEEE Wireless Communications Letters, vol. 9, issue 3, 2017. paper_2017.pdf
Saroit, I. A., S. M. Mohamed, and H. S. Hamza, "Coverage in Mobile Wireless Sensor Networks (M-WSN): A Survey", Computer Communications, vol. 110, pp. 133-150, 2017. 22.pdf
Saroit, I. A., S. M. Mohamed, and H. S. Hamza, "On Improving Coverage and Connectivity in Mobile Wireless Sensor Networks", Adhoc & Sensor Wireless Networks, vol. 37, issue 1-4, pp. 165-195, 2017. 33.pdf
Saroit, I. A., Z. haddad, M. Mahmoud, and S. Taha, "Secure and Efficient Uniform Handover Scheme for LTE-A Networks", IEEE Communications and Networking Conference (WCNC), 4-6 April 2016. zaher_1.pdf
Saroit, I. A., E. E. Zakaria, and H. S. Hamza, "A Framework for Anonymous Communication in MANETs based on Access Control and Authenticated Key Agreement", 5th International Conference on Communications, Computation, Networks and Technologies (INNOV 2016), Rome, Italy., 21-25 August, 2016. ihab_1.pdf
Saroit, I. A., H. G. E. D. H. Ali, and A. M. Kotb, "Grouped tasks scheduling algorithm based on QoS in cloud computing network", Egyptian Informatics Journal, issue 3, 2016. hend.pdf
Saroit, I. A., A. Abdulkarem, M. Al-Matari, and A. M. Kotb, "New Data Clustering Algorithm (NDCA)", International Journal of Advanced Computer Science and Applications , vol. 7, issue 5, pp. 438-443, 2016. 44.pdf
Saroit, I. A., H. S. Hamza, and I. A. Saroit, "An Integrated Security Framework for Access Control and Address Auto-configuration for MANETS", WMNC 2015, 8th IFIP Wireless and Mobile Networking Conference, Minich, Germany, 5-7 October 2015. 2.pdf
Saroit, I. A., M. Mahmoud, S. Taha, and I. A. Saroit, "Secure and Privacy-Preserving AMI-Utility Communications via LTE-A Networks", IEEE 11th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), UAE, Abu Dhabi, 19-21 October 20, 2015. 1.pdf
Saroit, I. A., H. S. Hamza, and I. A. Saroit, "Harmony Search-based K-Coverage Enhancement in Wireless Sensor Networks", International Journal of Computer, Information, Systems and Control Engineering, vol. 9, issue 1, pp. 178 186, 2015. 3.pdf
Saroit, I. A., H. S. Hamza, and I. A. Saroit, "Improving Coverage and Connectivity in Mobile Sensor Networks Using Harmony Search", 12th International Symposium on in Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt , Hammamat, Tunisia, May, 2014. 7.pdf
Kassem, M. M., H. S. Hamza, and I. A. Saroit, "A Clock Skew Addressing Scheme for Internet of Things", IEEE 25th Annual International Symposium on Personal, Indoor and Mobile Radio Communications, Washington, U.S.A., 2 September, 2014. Abstract1.pdf

In this paper, we propose a new addressing scheme, namely, the Clock Skew Addressing (CLOSA) scheme, that allows for assigning a unique IPv6 addresses to each node in the Internet of Things (IoT) network. The CLOSA scheme eliminates the need for the inefficient techniques of duplicate address detection and allocation table validation used in most existing addressing schemes. CLOSA guarantees uniqueness by extracting the clock skew of each communication device and converting it into an IPv6 address. Simulation analysis confirms that the proposed scheme can provide significant reductions in communication overheads as compared to the well-known LEADS, SIPA, and DAD addressing schemes.

Sharawi, M., E. Emary, I. A. Saroit, and H. El-Mahdy, "Bat Swarm Algorithm for Wireless Sensor Networks Lifetime Optimization", International Journal of Science and Research (IJSR), vol. 3, issue 5, pp. 2319-7064, 2014. Abstract3.pdf

Challenges of wireless sensor networks under-optimization in field of research have been globally concerned. Generally, lifetime extension is still considered to be the most dominant challenge for WSNs. Clustering and routing protocols have been proposed as optimization solutions to extend WSNs lifetime. In this paper, we introduce a newly meta-heuristic population based soft computing algorithm as an optimization technique to extend the WSNs lifetime. The proposed technique applies the population-based metaheuristic bat swarm optimization algorithm. It optimizes the network as a nonlinear problem to select the optimum cluster head nodes across number of generations. The objective; fitness function, employed to minimize the intra-cluster compactness with minimum distance between nodes in same cluster. The proposed technique is simulated and applied into four different wireless sensor networks deployments and compared with the LEACH hierarchal clustering and routing protocol. Results show that this proposed technique outperforms the classical LEACH. It efficiently optimizes the selection of cluster head nodes that ensure optimum coverage and connectivity based on intra-cluster distances. This reduces the energy consumption on each node level and hence increases the lifetime for each node, causing a significant extension in the wireless sensor network lifetime. The comparison between the hard or crisp LEACH routing and the soft or elastic proposed routing technique boasts the performance even more. The paper introduces a performance numerical analysis with the metrics of number of packets sent to sink, number of dead nodes, sum of WSN energy and the
network lifetime.

Sharawi, M., I. A. Saroit, E. Emary, and H. El-Mahdy, "Flower Pollination Optimization Algorithm for Wireless Sensor Network Lifetime Global Optimization", International Journal of Soft Computing and Engineering (IJSCE), vol. 4, issue 3, pp. 54-59, 2014. Abstractc2289074314.pdf

As wireless sensor networks still struggling to extend
its lifetime, nodes` clustering and nomination, or selection of
cluster head node are proposed as solution. LEACH protocol is
one of the oldest remarkable clustering approaches that aim to
cluster the network`s nodes and randomly elects a cluster head
for each cluster. It selects cluster heads but it is not responsible
for proper clustering formation. In this paper we use the Flower
Pollination Optimization Algorithm (FPOA) to propose a WSN
energy aware clustering formation model based on the
intra-cluster distances. The objective is to achieve the global
optimization for WSN lifetime. Simulation results and
performance analysis show that applying flower pollination
optimization on WSNs clustering is more efficient. It is
effectively balance power utilization of each sensor node and
hence extends WSN lifetime comparatively with the classical
LEACH approach.

Saroit, I. A., I. A. Saroit, and W. M. Abdelwahab, "A Review of Network Coding and Multimedia Traffic over Wireless Networks within 2013", International Journal of Advanced Research in Computer and Communication Engineering, vol. 3, issue 7, pp. 7343-7350, 2014. 6.pdf
Hamid, S. A. A. E., H. S. Hamza, and I. A. Saroit, "Alleviating the Domino Effect in Wireless Sensor Networks", in Proceedings of The 38th IEEE Conference on Local Computer Networks (LCN 2013), Sydney, Australia, 2013. Abstractsara.pdf

In hierarchical-based routing in sensor networks, the concept of Cluster-Heads (CHs) is used to reduce routing complexity and improve performance. This happens as non-CH members send their sensed data to the CH, which then sends the aggregated signal to the BS either directly or by collaborating with other CHs. However, in this type of routing, the death of one CH during a round causes virtual death of all the nodes in its cluster. This cascades into other clusters and induces a series of identical effects, causing intensive virtual death of nodes which eventually leads to inefficient utilization of energy. We refer to this problem as the “Domino-Effect”, and propose a centralized energy-aware routing protocol, called Domino effect-Evasive Energy-efficient Hierarchical Routing Protocol (DEEHRP) to explicitly reduce this effect. DEEHRP is an extension to the Energy-efficient Hierarchical Routing Protocol (EHRP). Extensive simulation results confirm that DEEHRP outperforms the well-known Base-station Controlled Dynamic Clustering Protocol (BCDCP). In particular, it reduces energy consumption by up to 36% as compared to BCDCP. Furthermore, results show that DEEHRP succeeds in alleviating the domino-effect problem and curtailing its effect by up to 25.5% and 10.3%, over BCDCP and EHRP, respectively.

Amin, A. I., H. S.Hamza, and I. A. Saroit, "Harmony search based algorithm for dynamic shortest path problem in mobile ad hoc networks", Proceedings of The Third International Conference on Digital Information and Communication Technology and its Applications (DICTAP2013), 2013. Abstractcu_pdf.pdf

Recently, more and more attention is drawn to wireless communication especially Mobile Ad Hoc Networks (MANET) for the flexibility they provide. In MANETs mobile nodes make use of the infrastructure-less, decentralized structure to freely move without any restrictions. However, due to the limited battery life of the nodes, using the shortest path in communication is essential to conserve energy. Shortest Path (SP) problem in MANETs is a dynamic problem because of the unpredictable MANET environment and the continuously changing topology. Thus, trying to get the SP with at least two additive metrics is a NP-complete problem. In this paper, we propose a modified Harmony Search (HS) algorithm to rapidly find a high quality sub-optimal solution to the dynamic SP problem in MANETs. Our empirical results show that our modified HS can recover from topological changes and rapidly converge to good solutions before another topological change takes place.

Saroit, I. A., M. R. Mahmoud, and W. M. Abdelwahab, "Proposed Network Coding Solution for Multimedia Streaming over Wireless Networks", International Journal of Advanced Research in Computer and Communication Engineering, vol. 2, issue 7, pp. 2582-2588, 2013. 12.pdf
Saroit, I. A., I. A. Saroit, H. El-Mahdy, and Eid Emary, "Routing Wireless Sensor Networks based on Soft Computing Paradigms: Survey", International Journal on Soft Computing, Artificial Intelligence and Applications (IJSCAI), issue 4, 2013. 9.pdf
Khalifa, N. E. M., M. H. N. Taha, H. N. Elmahdy, and I. A. Saroit, "A Secure Energy Efficient Schema for Wireless Multimedia Sensor Networks", CiiT International Journal of Wireless Communication, vol. 5, issue 6, pp. 235-246, 2013. Abstract

Wireless Wireless Sensor Networks (WSNs) have become an important component in our daily lives. In near future, it will dominate the technology industry around the world. WSNs gain its importance due to the variety of vital applications it can participate in such as military, health care, agriculture, surveillance and monitoring natural phenomena applications.WSNs consist of small devices with limited energy and storage capabilities, called sensor nodes. The sensor nodes collect data from physical or environmental phenomena. They cooperatively pass the sensed data through the network to a certain location or sink node where the data can be collected and analyzed.Due to the unprotected nature of wireless communication channels and untrusted transmission medium of WSNs, it becomes vulnerable to many types of security attacks. The attackers ultimately seek to eavesdrop, steal confidential data, injecting false data or even jamming the whole network, so securing these networks becomes a must.In this paper, a proposed security schema for WSNs will be introduced. The proposed security schema will be appropriate for real time multimedia streaming. It will construct its security features within the application and transport layer as the information that the attackers seek ultimately exist within these layers.The proposed security schema consists of two security levels; the first level is encrypting the packet data using Advanced Encryption Standard (AES) while the second level is generating Message Authentication Code (MAC) using Cipher-based Message Authentication Code (CMAC). Both levels achieved the principles of WSNs security and they are (authentication, confidentiality, data integrity and availability).Performance comparisons between the proposed security schema and other security frameworks are presented. Finally, all the presented work in this research was developed and implemented using Network Simulator-2 (NS-2). According to our literature reviews, this research is one of the first researches that use NS-2 as a security simulator. As NS-2 does not support any security features before.