Aisha Hassan Abdalla Hashim

Vision-Based Lane Detection for Autonomous Artificial Intelligent Vehicles

Intelligent vehicles are one of the enlightening ideas that will shape our future by providing enhanced safety and improved mobility. Apparently, among the complex and challenging tasks of future road vehicles is road lane detection or road boundaries detection. However, lane detection is a challenging task because of the varying road conditions that one can encounter while driving. In this paper, a vision-based lane detection approach capable of reaching real time operation with robustness to lighting change and shadows is presented. The system acquires the front view using a camera mounted on the vehicle. A developed preprocessing phase including a grayscale conversion, noise removal, edge detection with automatic thresholding, lines extraction using Hough transform, lines or boundaries of the road fitted by hyperbolas are simulated. The proposed lane detection system can be applied on both painted and unpainted road as well as curved and straight road in different weather conditions. This approach was tested and the experimental results show that the proposed scheme was robust and fast enough for real time requirements. Eventually, a critical overview of the methods were discussed, their potential for future deployment were assist.

Gateway placement optimisation problem for mobile multicast design in Wireless Mesh Networks

The provision for addressing multiple destinations in group multimedia application delivery over Wireless Mesh Networks (WMN) can be achieved efficiently via multicasting while considering the mobility of Mesh Clients (MC). One of the prominent components of WMN is the Internet Gateway (IGW) which provides wired bridge connection between the backbone network and the Internet. In addition, its cost is significant therefore its placement is one of the main determinants of the overall performance and deployment cost of WMN. This current work explores IGW placement or deployment optimisation for the purpose of incorporation of multicasting and mobility management. Thus, the main focus in this work centres on investigating IGW placement optimisation with the intent of extracting the design issues to answer questions on the appropriateness of the problem formulation and modeling techniques for the optimisation problem. Furthermore, the paper develops the sketch of modeling and formulation of IGW placement problem with the objective of optimising IGW placement while cost of multicast tree and mobility are optimised. This formulation is different from existing works which considers only geographic positioning, load-balancing and interference-based placement. This novel formulation will serve as the basis for IGW placement and selection algorithm to address IGW deployment problem in a mobile multicast WMN architecture.

Route optimization scenario of a new scheme based on nested mobile network

With the rapid growth of wireless technologies and increasing number of mobile digital devices, mobility has been an important element on the Internet. NEMO Basic Support, designed by the Internet Engineering Task Force (IETF) to provide network mobility, is not efficient to offer low latency handoff in the case of nested mobile networks because it produces a long transfer delay and excessively large packet sizes due to non-optimal routes and multiple encapsulations. This paper presents a route optimization scenario for nested mobile network using hierarchical structure with Binding Update Tree (BUT). This scheme should reduce packet overhead, handoff latency, packet transmission delay, and achieve optimal routing.

Big Data Analysis Solutions Using MapReduce Framework

Recently, data that generated from variety of sources with massive volumes, high rates, and different data structure, data with these characteristics is called Big Data. Big Data processing and analyzing is a challenge for the current systems because they were designed without Big Data requirements in mind and most of them were built on centralized architecture, which is not suitable for Big Data processing because it results on high processing cost and low processing performance and quality. MapReduce framework was built as a parallel distributed programming model to process such large-scale datasets effectively and efficiently. This paper presents six successful Big Data software analysis solutions implemented on MapReduce framework, describing their datasets structures and how they were implemented, so that it can guide and help other researchers in their own Big Data solutions.

A new method for generating cryptographically strong sequences of pseudo random bits for stream cipher

The increasing privacy risks associated with the recent growth of multimedia streaming applications raised a big industry demand for secure and efficient stream cipher. The fact that stream ciphers do not expand messages, and tolerant to biterrors, make it highly desirable for many communication applications. During the last one and half decade several cryptosystems have been put forward, many of them have been more or less attacked. In one of the stages of stream ciphers development, it is required to design a cryptographically strong pseudo random bit generator (PRBG). In this paper a new method for generating secure sequences of pseudo random Bits for stream cipher using random map is presented, detailed statistical results of the generated bit sequences is showed, and finally a comparison with a true random sequence results is done.

Position-based QoS multicast routing protocol for mobile Ad Hoc networks

Recently, the necessity of applications where many users have to interact in a close manner over mobile Ad-Hoc networks gains high popularity. Multicast communication is essential in this type of applications to reduce the overhead of group communication. For group-oriented multimedia applications Quality of Service (QoS) provision is a basic requirement, which makes an efficient QoS multicast routing protocol a very important issue. This paper proposes a location-based QoS multicast routing protocol via cooperation between Network and MAC layers. Along with this protocol, a location and group membership management scheme has been proposed. Unlike some of multicast routing protocols, the proposed approach limits maintaining the network topology to certain nodes to reduce control overhead and reduce bandwidth consumption. Our proposed protocol is scalable for large area networks with large multicast members regardless of the network density. Also, it achieves a significant reduction in processing overhead compared to flat QoS algorithms.

ABC-PSO for vertical handover in heterogeneous wireless networks

Cloud computing is currently emerging quickly as a client-server technology structure and, currently, providing distributed service applications. However, given the availability of a diverse range of wireless access technologies, people expect continuous connection to the most suitable technology that matches price affordability and performance goals. Among the main challenges of modern communication is the accessibility to wireless networks using mobile devices, with a high service quality (QoS) based on preferences of the users. Past literatures contain several heuristic approaches that use simplified rules to look for the best network that is available. Nevertheless, attributes of mobile devices need algorithms that are quick and effective in order to select best available network near real-time. This study proposes a hybrid intelligent handover decision algorithm primarily founded on two main heuristic algorithms: Artificial Bee Colony or ABC as well as Particle Swarm Optimization or PSO named ABC-PSO to select best wireless network during vertical handover process. The ABC-PSO algorithm has been optimized to achieve small cost function that are powered using the IEEE 802.21 standard taking into account different available wireless networks, the application requirements and the user preferences to improve QoS. Numerical results demonstrate that the ABC-PSO algorithm compared to the related work has lower cost and delay, higher available bandwidth and less number of handover.

CDR analysis using Big Data technology

Call Detail Records (CDR) is a valuable source of information; it opens new opportunities for telecom industry and maximize its revenues as well as it helps the community to raise its standard of living in many different ways. However, we need to analyze CDRs in order to extract its big value. But CDRs has a huge volume, variety of data and high data rate, while current telecom systems are designed without these issues in mind. CDRs can be seen as Big Data source, and hence, it is applicable to use Big Data technologies (storage, processing and analysis) in CDR analytics. There are considerable research efforts to address the CDR analysis challenges. This paper presents the use of Big Data technology in CDR analysis by giving some CDR analytics based application examples, highlighting their architecture, the utilized Big Data tools and techniques, and the CDR use case scenarios.

Quality of Service Multicast Routing Protocol for Large Scale MANETs

Mobile Ad hoc NETworks (MANETs) are collection of mobile nodes communicate in a multi-hop manner without relaying on any infrastructure or central administration. Multimedia and group-oriented applications over MANETs gain high popularity, which makes providing Quality of Services (QoS) a key requirement. This work proposed a new efficient approach which aims to find paths between the source and all the multicast group members using paths that meet the bandwidth and delay requirements. Unlike some of multicast routing protocols, the proposed approach has limited maintaining the network topology to certain nodes to reduce communication overhead and provide scalability. The proposed protocol partitioned the network into equal size hexagonal cells and a leader and backup leader are elected inside each cell. The location information provided by GPS receivers are used at route discovery and route maintenance. This protocol allows multicast group members to join/leave the held session dynamically. The proposed protocol is scalable for large area networks with large multicast members. Also, it achieves a significant reduction in processing overhead than non hierarchical algorithms.

Optimized routing algorithm for mobile multicast source in wireless mesh networks

Mobility considerations in multicast algorithm design usually focus issues of mobile receivers while few researches emphasize on mobile multicast sources issues. However, mobility of source is a critical issue causing global tree disruption. Furthermore, major research challenges in the delivery of group applications over Wireless Mesh Networks (WMN) comprise delivery of large volume data, incurring large bandwidth and delay. This is in addition to multicast source mobility issues and interfering nature of scarce wireless resources. Mobile multicast scenarios emerge in group-based distribution of information such as obtains in the health sector, disaster recovery operation, remote bus, train control and video surveillance. The mobile multicast problem in this paper is formulated as a bandwidth and delay constrained minimum tree cost problem which is proved to be computationally intensive. Thus this paper proposes a Differential Evolution based optimized mobile multicast routing algorithm for the shared tree architecture. The proposed algorithm is implemented using MATLAB and the evaluation considers analytic and simulation techniques for convergence, scalability and multicast tree stability under source movement. Simulation results show that the proposed algorithm converges and outperforms a source based tree algorithm.