Abstract Ad-hoc networking is a concept in computer communications, which means that users wanting to communicate with each other form a temporary network, without any form of centralized administration. Each node participating in the network acts both as host and a router and must therefore be willing to forward packets for other nodes.In a multi-hop wireless packet network, a packet traverses more than one wireless link in traveling from its source to its destination. Such wireless networks have received considerable attention recently in the context of ad hoc networks. Ad-Hoc networks are self-organizing multi-hop wireless networks where not all links along the path of a packet can be activated simultaneously. Hence the performance of a higher level mechanism, such as congestion window or Transport Layer protocol (TCP) will depend crucially on how the links are scheduled for transmission. In multiple access networks, such as the IEEE802.11 wireless LAN, the scheduling of transmissions is done by the medium access control (MAC) protocol. This transmission scheduling is completely unaware of the needs of the TCP congestion window protocol. This thesis is concerned with the poor interaction between the TCP adaptive window protocol, the IEEE 802.11 MAC protocol, and the IEEE 802.11 Ad-Hoc routing protocol. Our thesis follow on the work done by the researchers K. Nahm and C. Kuo in the paper entitled “TCP over 802.11 Multihop networks issues and Performance Enhancement” [1]. Our contributions are two-fold. First we have repeated and confirmed the simulation results reported by K.Nahm and C.Kuo using NS-2 network simulator. Second we have introduced a simple modification in the 802.11 DSR routing protocol which reduces the unnecessary VI reroutings triggered by MAC packet collisions and enforces the TCP to enter the fast retransmit / fast recovery phase to quickly recover the packet loses. This modification has been simulated using NS-2 network simulator and from the results we have found that it provides a substantial improvement in TCP performance in the situations that we have considered in the simulation models
يحي الشارف المبروك (2009)

Technology is all around us and it’s changing rapidly, expanding Internet access has had huge impacts on everyday lives as people do everything on their phones and computers. The widespread growth in the use of digital computers, have an increasing need to be able to communicate with machines in a simpler manner. One of the main tasks that can simplify communication with machines is speech recognition. In this work, we introduce the Arabic speech commands database that contains six Arabic control order words and Arabic spoken digits. The created database is used to analyze and compare the recognition accuracy and performance of three recognition techniques which are, Wavelet Time Scattering feature extraction with Support Vector Machine (SVM) classifier, Wavelet Time Scattering feature extraction with Long Short-Term Memory (LSTM) classifier, and Mel-Frequency Cepstrum Coefficients (MFCC) feature extraction with K-Nearest Neighbor (KNN) classifier. Finally, the experimental results show that the most accurate prediction of the database commands was 98.1250% given by Wavelet Time Scattering feature extraction and LSTM classifier and the fastest training time for the database was 144 minutes given by MFCC and KNN classifier. arabic 5 English 42
Osama A. Alkishriwo, Lina Tarek Benamer(12-2020)

Abstract The number of mobile service users has been tremendously increased during the last few years, and the types of mobile services are developed from pure voice to data and multimedia services, such as audio/video streaming, e-mail, file transfer, and web browsing. These services have quite different requirements for their quality. 3G WCDMA cellular mobile networks answer this growing demand for these wireless data services. Then it needs to provide a huge capacity and wide area of coverage with acceptable quality of service. Capacity and coverage in WCDMA networks planning are the important issues because they are dependent of each other and related to the services data rate. In this thesis the capacity and coverage of mixed rate services are derived and analyzed. The uplink Capacity Coverage Product (CCP) of mixed rate services is developed by two methods, and three scenarios are assumed. The first method is the exact solution and the second method is the approximate solution. Math lap computer programs are used to get results and curves. Then some parameters affecting the mixed rate CCP are studied and a comparison between the two methods is also performed.The application of CCP in dimensioning and planning of a single service and mixed rate services WCDMA network is presented. A comparison with the conventional planning method is performed.
علي صالح منصور (2008)