Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Includes bibliographical references (leaves 132-133). Also available on the Internet.

Thesis (M.S.)--Rutgers University, 2007. / "Graduate Program in Electrical and Computer Engineering." Includes bibliographical references (p. 55-56).

Thesis (M.Sc.)--York University, 2004. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 138-145). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ99280

Thesis (M.S.)--Rochester Institute of Technology, 2007. / Typescript. Includes bibliographical references (leaves 50-51).

Multicasting is preferred over multiple unicasts from the viewpoint of better utilization of one of the most important network resources, namely network bandwidth. Multicasting can be done in two different ways: source based tree approach and shared tree approach. This research focuses on improving bandwidth utilization of source based multicast routing protocols and also provides core selection approaches for shared tree multicasting. In this work, we have defined new concepts called pseudo diameter and super pseudo diameter by using the routing information present in Distance Vector Routing (DVR) tables. Pseudo diameter relates to the physical locations of routers and is used to control the flow of packets along the broadcast tree. Super pseudo diameter relates to the physical location of group members and is used to control the flow of packets along the multicast tree. This location aspect of routers and group members have been incorporated into the existing broadcast and multicast protocols to achieve a much improved bandwidth utilization compared to the existing approaches. These concepts have also been used in developing both static and group based core selection approaches. Pseudo diameter used in static core selection approach, and super pseudo diameter used in group based core selection approach, generates secondary and tertiary cores along with primary core to achieve fault tolerance. Besides DVR, the other widely used unicast routing protocol is the Link State Routing protocol (LSR). We have shown that a similar concept to pseudo diameter called sub diameter can be used on networks using LSR tables to achieve better bandwidth utilization in source based multicasting and in selecting a core for shared tree multicasting.

The ability to detect and prevent a network from DDoS attack and to ensure the high quality infrastructure is a back bone of today’s network security issues. In this thesis, we have successfully validated an algorithm using OmNet++ Ver. 4.0 simulation to show how a DDoS attack can be detected and how the nodes can be protected from such an attack using GOSSIP protocol.

In distributed systems it is often useful to ensure that messages sent between processes in a group are received by all group members. This thesis presents Reliable Non-Ordered Multicast Protocol (RNOMP). We argue that it achieves reliable multicast between processes in groups that processes can leave and join arbitrarily. The protocol has been implemented on top of a group membership simulation which allows evaluation of the performance of the protocol while varying packet loss and the frequency at which processes leaves and joins groups. After analyzing how the protocol handles certain situations we conclude that our protocol achieves reliability and performs well within certain parameter values.

Dans cette thèse, nous étudions plusieurs scénarios de communication pour les futurs réseaux sans fil. Plus particulièrement, cette thèse porte son attention sur comment la communication directe entre équipements mobiles (D2D) peut améliorer les performances des technologies existantes dans les systèmes sans fil. Le premier scénario étudié durant cette thèse est celui de la communication par multidiffusion d’un message commun entre un émetteur et plusieurs récepteurs. Il peut être illustré par le streaming vidéo, les messages d’alerte à destination de la police ou des pompiers ou des ambulanciers. Le second scénario étudié est celui d’une transmission à contraintes critiques en latence et en fiabilité. Ce dernier est illustré par son implication primordiale dans les futures technologies telles que les voitures connectées, avec pour but d’éviter des accidents, ou bien les machines connectées pour améliorer les services hospitaliers tels que la télé-chirurgie entre autres. Le dernier scénario étudié est celui de la localisation d’un groupe d’équipement dans un réseau densément peuplé tel qu’on peut trouver dans le contexte des objets connectés en masse. En général les objets communiquent entre eux à un niveau local et sont intéressés par des services communs et locaux. Plus concrètement, dans cette thèse, nous montrons les bienfaits de la communication D2D dans les trois scénarios précédents. Dans le cas du premier scénario de multidiffusion, contrairement à la tendance habituelle d’avoir un taux de transmission qui diminue en fonction du nombre d’équipements mobiles (en particulier, car l’équipement émetteur doit adapter sa transmission à l’équipement récepteur en plus mauvaise condition), en ajoutant la communication D2D, on observe que ce même taux de transmission augmente en fonction du nombre d’équipements mobiles présents. Dans le deuxième scénario où la communication est soumise à des contraintes de fiabilité et de latence exigeantes, nous déduisons une politique de retransmission optimale et proposons une autre politique semi-optimale qui est beaucoup moins gourmande en temps et qui a prouvé son optimalité dans plusieurs cas pratiques. Enfin dans le dernier scénario, nous proposons une méthode de localisation d’équipements mobile et l’étudions dans plusieurs environnements (avec et sans visibilité directe dans les cas intra-muros et extérieurs). L’identification de ces zones est ensuite utilisée pour créer de petites cellules virtuelles adaptatives aux situations changeantes et non prédictibles, dans le but de réduire les coûts liés aux infrastructures actuelles. / This thesis studies D2D communication in realistic and challenging scenarios for future wireless systems. In particular, the thesis focuses on how may D2D communication help other technologies to enhance their performance. The first wireless scenario is the one of multicasting, used for example in video streaming or common alert message transmission for police, firefighters or ambulances. The second wireless scenario is the critical one of URLLC expected to be used to avoid cars crashes in the upcoming V2X context, and also when connecting machines together in environments like connected hospitals, airports, factories (industry 4.0), and last but not least in e-health context in order to enhance medical tele-surgery. The last wireless scenario is the one of UE group localization in the context of massive IoT, where devices are interacting with each other and are mostly confined in local groups, needing local services. In the multicast channel scenario, where a transmitter wishes to convey a common message to many receivers, it is known that the multicast rate decrease as the number of UEs increases. This vanishing behavior changes drastically when enabling the receivers to cooperate with each other via D2D. Indeed, the multicast rate increases with high probability when the number of receivers increases. This chapter also analyzes the outage rate of the proposed scheme in the same setting. Extensions regarding firstly resource utilization and secondly considering the use of HARQ are also analyzed. Next chapter addresses one of the major challenges for future networks, named URLLC. Specifically, the chapter studies the problem of HARQ with delayed feedback, where the transmitter is informed after some delay on whether or not his transmission was successful. The goal is to minimize the expected number of retransmissions subject to a reliability constraint within a delay budget. This problem is studied at two levels: (i) a single transmitter faced with a stochastic i.i.d. noisy environment and (ii) a group of transmitters whom shares a collision channel. Then the chapter that follows provides a cooperative UE mapping method that is highly accurate. Four different channel models are studied in this chapter: LOS and NLOS for indoor and outdoor environments. The results show significant improvement compared to already existing methods. Identifying the dense local areas in real time and informing the network allows the Base Station (BS) to increase the capacity through highly directive beams, and therefore, avoids the deployment cost of new infrastructure.

With rapid expansion of interest in multimedia and distributed computing applications across the Internet increases importance of optimized delivery of group traffic. According to current situation the best practice to achieve this goal is multicasting. This masters thesis summarizes multicasting methods and facts. Also it draws conclusions from practical application of presented information on commercial project.

Handoff is a call handling mechanism that is invoked when a mobile node moves from one cell to another. Such movement may lead to degradation in performance for wireless networks as a result of packet losses. A promising technique proposed in this thesis is to apply multicasting techniques aided by mobility prediction in order to improve handoff performance. In this thesis, we present a method that uses a Grey model for mobility prediction and a fuzzy logic controller that has been fine-tuned using evolutionary algorithms in order to improve prediction accuracy. We also compare the self-tuning algorithm with two evolutionary algorithms in terms of accuracy and their convergence times. Our proposed method takes into account signal strengths from the base stations and predicts the signal strength of the next candidate base station in order to provide improved handover performance. The primary decision for mobility prediction is the accurate prediction of signal strengths obtained from the base stations and remove any unwanted errors in the prediction using suitable optimisation techniques. Furthermore, the model includes the procedures of fine-tuning the predicted data using fuzzy parameters. We also propose suitable multicasting algorithms to minimise the reservation of overall network resource requirements during handoff with the mobility prediction information. To be able to efficiently solve the problem, the situation is modelled using a multicast tree that is defined to maintain connectivity with the mobile node, whilst ensuring bandwidth guarantees and a minimum hop-count. In this approach, we have tried to solve the problem by balancing two objectives through putting a weight on each of two costs. We provide a detailed description of an algorithm to implement join and prune mechanisms, which will help to build an optimal multicast tree with QoS requirements during handoff as well as incorporating dynamic changes in the positions of mobile nodes. An analysis of how mobility prediction helps in the selection of potential Access Routers (AR) with QoS requirements - which affects the multicast group size and bandwidth cost of the multicast tree -- is presented. The proposed technique tries to minimise the number of multicast tree join and prune operations. Our results show that the expected size of the multicast group increases linearly with an increase in the number of selected destination AR's for multicast during handoff. We observe that the expected number of joins and prunes from the multicast tree increases with group size. A special simulation model was developed to demonstrate both homogeneous and heterogeneous handoff which is an emerging requirement for fourth generation mobile networks. The model incorporates our mobility prediction model for heterogeneous handoff between the Wireless LAN and a cellular network. The results presented in this thesis for mobility prediction, multicasting techniques and heterogeneous handoff include proposed algorithms and models which aid in the understanding, analysing and reducing of overheads during handoff.