To see the other types of publications on this topic, follow the link: Ad Hoc Networking Protocols.
Dissertations / Theses on the topic 'Ad Hoc Networking Protocols'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Ad Hoc Networking Protocols.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Lee, Kok Thong. "Performance analysis of Mobile Ad Hoc Networking routing protocols /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Dec%5FLee%5Kok.pdf.
Full text
2
Thong, Lee Kok. "Performance analysis of mobile ad hoc networking routing protocols." Thesis, Monterey, California. Naval Postgraduate School, 2004. http://hdl.handle.net/10945/1225.
Full textAbstract:
Approved for public release, distribution is unlimited<br>This thesis presents a simulation and performance evaluation analysis of the various routing protocols that have been proposed for the Mobile Ad Hoc Network (MANET) environment using the Network Simulator-2 (NS-2) tool. Many routing protocols have been proposed by the academic communities for possible practical implementation of a MANET in military, governmental and commercial environments. Four (4) such routing protocols were chosen for analysis and evaluation: Ad Hoc On-demand Distance Vector routing (AODV), Dynamic Source Routing (DSR), Destination-Sequenced Distance Vector routing (DSDV) and Optimized Link State Routing (OLSR). NS-2 is developed and maintained by the University of Southern California's Information Sciences Institute (ISI). Leveraging on NS-2's simulation capabilities, the key performance indicators of the routing protocols were analyzed such as data network throughput, routing overhead generation, data delivery delay as well as energy efficiency or optimization. The last metric is explored, especially due to its relevance to the mobile environment. Energy is a scare commodity in a mobile ad hoc environment. Any routing software that attempts to minimize energy usage will prolong the livelihood of the devices used in the battlefield. Three important mobility models are considered, namely, Random Waypoint, Manhattan Grid, and Reference Point Group Mobility. The application of these three models will enhance the realism of simulation to actual real life mobility in an urban or military setup scenario. The performance of the routing protocols in varied node density, mobility speed as well as loading conditions have been studied. The results of the simulation will provide invaluable insights to the performance of the selected routing protocols. This can serve as a deciding factor for the U.S. Department of Defense (DoD) in their selection of the most suitable routing protocols tailored to their specific needs.<br>Civilian, Defence Science Technology Agency, Singapore
3
Spinden, David, Jeffrey Jasper, and Kurt Kosbar. "Comparison of Wireless Ad-Hoc Sensor Networks." International Foundation for Telemetering, 2004. http://hdl.handle.net/10150/605786.
Full textAbstract:
International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California<br>There are a number of telemetry applications where it would be helpful to have networks of sensors that could autonomously discover their connectivity, and dynamically reconfigure themselves during use. A number of research groups have developed wireless ad-hoc sensor network systems. This paper reviews the state-of-the-art in wireless ad-hoc networks, examining the features, assumptions, limitations and unique attributes of some of the more popular solutions to this problem.
4
Hinton, Danielle A. (Danielle Ayodele) 1978. "Protocols for multi-antenna ad-hoc wireless networking in interference environments." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62416.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 231-242).<br>A fundamental question for the design of future wireless networks concerns the nature of spectrum management and the protocols that govern use of the spectrum. In the oligopoly model, spectrum is owned and centrally managed, and the protocols tend to reflect this centralized nature. In the common's model, spectrum is a public good, and protocols must support ad hoc communication. This work presents the design, tradeoffs and parameter optimization for a new protocol (Simultaneous Transmissions in Interference (STI-MAC)) for ad hoc wireless networks. The key idea behind the STI-MAC protocol is 'channel stuffing,' that is, allowing network nodes to more efficiently use spatial, time and frequency degrees of freedom. This is achieved in three key ways. First, 'channel stuffing' is achieved through multiple antennas that are used at the receiver to mitigate interference using Minimum-Mean-Squared-Error (MMSE) receivers, allowing network nodes to transmit simultaneously in interference limited environments. The protocol also supports the use of multiple transmit antennas to beamform to the target receiver. Secondly, 'channel stuffing' is achieved through the use of a control channel that is orthogonal in time to the data channel, where nodes contend in order to participate on the data channel. And thirdly, 'channel stuffing' is achieved through a protest scheme that prevents data channel overloading. The STI-MAC protocol is analyzed via Monte-Carlo simulations in which transmitter nodes are uniformly distributed in a plane, each at a fixed distance from their target receiver; and as a function of network parameters including the number of transmit and receive antennas, the distance between a transmitter-receiver pair (link-length), the average number of transmitters whose received signal is stronger at a given receiver than its target transmitter (link-rank), number of transmitter-receiver pairs, the distribution on the requested rate, the offered load, and the transmit scheme. The STI-MAC protocol is benchmarked relative to simulations of the 802.11(n) (Wi-Fi) protocol. The key results of this work show a 3X gain in throughput relative to 802.11(n) in typical multi-antenna wireless networks that have 20 transmitter-receiver pairs, a link-length of 10 meters, four receive antennas and a single transmit antenna. We also show a reduction in delay by a factor of two when the networks are heavily loaded. We find that the link-rank is a key parameter affecting STIMAC gains over Wi-Fi. In simulations of networks with 40 transmit-receiver pairs, link-rank of three, a link-length of 10 meters, and eight transmit and receive antennas in which the transmitter beamforms to its target receiver in its strongest target channel mode, we find gains in throughput of at least 5X over the 802.11(n) protocol.<br>by Danielle A. Hinton.<br>Ph.D.
5
Mehendale, Hrushikesh Sanjay. "Lifenet: a flexible ad hoc networking solution for transient environments." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42781.
Full textAbstract:
In the wake of major disasters, the failure of existing communications infrastructure and the subsequent lack of an effective communication solution results in increased risks, inefficiencies, damage and casualties. Currently available options such as satellite communication are expensive and have limited functionality. A robust communication solution should be affordable, easy to deploy, require little infrastructure, consume little power and facilitate Internet access. Researchers
have long proposed the use of ad hoc wireless networks for such scenarios. However such networks have so far failed to create any impact, primarily because they are unable to handle network transience and have usability constraints such as static topologies and dependence on specific platforms.
LifeNet is a WiFi-based ad hoc data communication solution designed for use in highly transient environments. After presenting the motivation, design principles and key insights from prior literature, the dissertation introduces a new
routing metric called Reachability and a new routing protocol based on it, called Flexible Routing. Roughly speaking, reachability measures the end-to-end multi-path probability that a packet transmitted by a source reaches its final
destination. Using experimental results, it is shown that even with high transience, the reachability metric - (1) accurately captures the effects of transience (2) provides a compact and eventually consistent global network view at
individual nodes, (3) is easy to calculate and maintain and (4) captures availability. Flexible Routing trades throughput for availability and fault-tolerance and ensures successful packet delivery under varying degrees of transience.
With the intent of deploying LifeNet on field we have been continuously interacting with field partners, one of which is Tata Institute of Social Sciences India. We have refined LifeNet iteratively refined base on their feedback.
I conclude the thesis with lessons learned from our field trips so far and deployment plans for the near future.
6
Kaba, James, and Paul Hashfield. "AD HOC NETWORKING OVERVIEW AND APPLICATION TO A BATTLEFIELD SENSORS SYSTEM." International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/606673.
Full textAbstract:
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada<br>Ad hoc networking protocols enable the formation of self-organizing networks with automatic selfhealing operation in dynamic environments. There are a number of existing or planned ad hoc implementations and a body of research on protocols and performance. Ad Hoc technologies promise significant impact in future communications architectures. This paper presents a general overview of ad hoc networking and presents specific examples, including a recent implementation of a prototype ad hoc networked sensor system. The protocols used have unique characteristics derived by tailoring particular protocols to the specific application requirements. The potential relevance of ad hoc networking to possible telemetry applications is discussed.
7
Chowdhury, Kaushik Roy. "Communication protocols for wireless cognitive radio ad-hoc networks." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29757.
Full textAbstract:
Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Akyildiz, Ian; Committee Member: Ingram, Mary Ann; Committee Member: Blough, Douglas; Committee Member: Dovrolis, Konstantinos; Committee Member: Li, Ye. Part of the SMARTech Electronic Thesis and Dissertation Collection.
8
Nordström, Erik. "Challenged Networking : An Experimental Study of new Protocols and Architectures." Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-9002.
Full textAbstract:
With the growth of Internet, the underlying protocols are increasingly challenged by new technologies and applications. The original Internet protocols were, however, not designed for wireless communication, mobility, long disconnection times, and varying bandwidths. In this thesis, we study challenged networking, and how well old and new protocols operate under such constraints. Our study is experimental. We build network testbeds and measure the performance of alternative protocols and architectures. We develop novel methodologies for repeatable experiments that combine emulations, simulations and real world experiments. Based on our results we suggest modifications to existing protocols, and we also develop a new network architecture that matches the constraints of a challenged network, in our case, an opportunistic network. One of our most important contributions is an Ad hoc Protocol Evaluation (APE) testbed. It has been successfully used worldwide. The key to its success is that it significantly lowers the barrier to repeatable experiments involving wireless and mobile computing devices. Using APE, we present side-by-side performance comparisons of IETF MANET routing protocols. A somewhat surprising result is that some ad hoc routing protocols perform a factor 10 worse in the testbed than predicted by a common simulation tool (ns-2). We find that this discrepancy is mainly related to the protocols’ sensing abilities, e.g., how accurately they can infer their neighborhood in a real radio environment. We propose and implement improvements to these protocols based on the results. Our novel network architecture Haggle is another important contribution. It is based on content addressing and searching. Mobile devices in opportunistic networks exchange content whenever they detect each other. We suggest that the exchange should be based on interests and searches, rather than on destination names and addresses. We argue that content binding should be done late in challenged networks, something which our search approach supports well.
9
Lundgren, Henrik. "Implementation and Experimental Evaluation of Wireless Ad hoc Routing Protocols." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4806.
Full text
10
Zhai, Hongqiang. "Cross-layer design of networking protocols in wireless local area networks and mobile ad hoc networks." [Gainesville, Fla.] : University of Florida, 2006. http://purl.fcla.edu/fcla/etd/UFE0015668.
Full text
11
El, Moutia Abdallah. "Energy-aware Ad Hoc on-demand distance vector routing protocol and optimizing the blocking problem induced in wireless Ad Hoc networks." FIU Digital Commons, 2004. http://digitalcommons.fiu.edu/etd/3124.
Full textAbstract:
The purpose of this thesis was to investigate some of the issues related to routing and medium access control protocol in ad hoc networks. In routing protocol, the goal is to tackle the power consumption problem and to present a case for using new cost energy-aware metric for Ad Hoc On-Demand Distance Vector (AODV). The idea of the new cost metric is to be able to avoid routes with a low energy capacity. By using this approach, high efficiency in energy consumption can be achieved in Ad-Hoc networks.
The second goal of this thesis was to investigate the blocking problem induced by Request-to-Send/Clear-to-Send (RTS/CTS) mechanism in detail and provide a solution to overcome that problem. To do so, a new parameter is proposed by which the Medium Access control (MAC) protocol will decide when to switch between RTS/CTS mechanism (the 4-way-handshaking) and the Basic Access method (the 2-way-handshaking) in order to reduce the effect of the blocking problem in Ad Hoc networks.
12
Lewis, Michael P. "TelosRFID : an ad-hoc wireless networking capable multi-protocol RFID reader system /." Online version of thesis, 2009. http://hdl.handle.net/1850/10754.
Full text
13
Klos, Lawrence. "Reliable Multicast in Mobile Ad Hoc Wireless Networks." ScholarWorks@UNO, 2009. http://scholarworks.uno.edu/td/1101.
Full textAbstract:
A mobile wireless ad hoc network (MANET) consists of a group of mobile nodes communicating wirelessly with no fixed infrastructure. Each node acts as source or receiver, and all play a role in path discovery and packet routing. MANETs are growing in popularity due to multiple usage models, ease of deployment and recent advances in hardware with which to implement them. MANETs are a natural environment for multicasting, or group communication, where one source transmits data packets through the network to multiple receivers. Proposed applications for MANET group communication ranges from personal network apps, impromptu small scale business meetings and gatherings, to conference, academic or sports complex presentations for large crowds reflect the wide range of conditions such a protocol must handle. Other applications such as covert military operations, search and rescue, disaster recovery and emergency response operations reflect the "mission critical" nature of many ad hoc applications. Reliable data delivery is important for all categories, but vital for this last one. It is a feature that a MANET group communication protocol must provide. Routing protocols for MANETs are challenged with establishing and maintaining data routes through the network in the face of mobility, bandwidth constraints and power limitations. Multicast communication presents additional challenges to protocols. In this dissertation we study reliability in multicast MANET routing protocols. Several on-demand multicast protocols are discussed and their performance compared. Then a new reliability protocol, R-ODMRP is presented that runs on top of ODMRP, a well documented "best effort" protocol with high reliability. This protocol is evaluated against ODMRP in a standard network simulator, ns-2. Next, reliable multicast MANET protocols are discussed and compared. We then present a second new protocol, Reyes, also a reliable on-demand multicast communication protocol. Reyes is implemented in the ns-2 simulator and compared against the current standards for reliability, flooding and ODMRP. R-ODMRP is used as a comparison point as well. Performance results are comprehensively described for latency, bandwidth and reliable data delivery. The simulations show Reyes to greatly outperform the other protocols in terms of reliability, while also outperforming R-ODMRP in terms of latency and bandwidth overhead.
14
Lacks, Daniel Jonathan. "MODELING, DESIGN AND EVALUATION OF NETWORKING SYSTEMS AND PROTOCOLS THROUGH SIMULATION." Doctoral diss., University of Central Florida, 2007. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3792.
Full textAbstract:
Computer modeling and simulation is a practical way to design and test a system without actually having to build it. Simulation has many benefits which apply to many different domains: it reduces costs creating different prototypes for mechanical engineers, increases the safety of chemical engineers exposed to dangerous chemicals, speeds up the time to model physical reactions, and trains soldiers to prepare for battle. The motivation behind this work is to build a common software framework that can be used to create new networking simulators on top of an HLA-based federation for distributed simulation. The goals are to model and simulate networking architectures and protocols by developing a common underlying simulation infrastructure and to reduce the time a developer has to learn the semantics of message passing and time management to free more time for experimentation and data collection and reporting. This is accomplished by evolving the simulation engine through three different applications that model three different types of network protocols. Computer networking is a good candidate for simulation because of the Internet's rapid growth that has spawned off the need for new protocols and algorithms and the desire for a common infrastructure to model these protocols and algorithms. One simulation, the 3DInterconnect simulator, simulates data transmitting through a hardware k-array n-cube network interconnect. Performance results show that k-array n-cube topologies can sustain higher traffic load than the currently used interconnects. The second simulator, Cluster Leader Logic Algorithm Simulator, simulates an ad-hoc wireless routing protocol that uses a data distribution methodology based on the GPS-QHRA routing protocol. CLL algorithm can realize a maximum of 45% power savings and maximum 25% reduced queuing delay compared to GPS-QHRA. The third simulator simulates a grid resource discovery protocol for helping Virtual Organizations to find resource on a grid network to compute or store data on. Results show that worst-case 99.43% of the discovery messages are able to find a resource provider to use for computation. The simulation engine was then built to perform basic HLA operations. Results show successful HLA functions including creating, joining, and resigning from a federation, time management, and event publication and subscription.<br>Ph.D.<br>School of Electrical Engineering and Computer Science<br>Engineering and Computer Science<br>Computer Engineering PhD
15
Holliday, Peter Joshua Information Technology & Electrical Engineering Australian Defence Force Academy UNSW. "NOMAD - A Hybrid Mobile Ad Hoc and Disruption Tolerant Routing Protocol for Tactical Military Networks." Awarded by:University of New South Wales - Australian Defence Force Academy. Information Technology & Electrical Engineering, 2009. http://handle.unsw.edu.au/1959.4/43724.
Full textAbstract:
There has been much research in recent years within the general field of mobile ad hoc networks (MANET) with many proposals submitted to the IETF for consideration. Delay or Disruption Tolerant Networking (DTN) is a relatively new field for routing, concerned with networks that experience long transmission delay or periods of disruption. Military forces around the globe have applied one or the other networking paradigms with varying degrees of success to their own problems of mobility at the lower tactical level (Brigade and below). The fundamental reason for this limited success is that many of the desired tactical scenarios at this level require a network that is not exclusively ad hoc or exclusively disrupted, but rather a network that dynamically adapts to a variety of mobility situations ranging from relatively stable, almost enterprise like, to completely disrupted. Synchronous MANET protocols have limited disruption tolerance at layer 3, and DTN routing protocols, which are further up the network stack, implement hop by hop asynchronous protocols that are unable to take advantage of prolonged network stability. The primary contribution of this thesis is NOMAD, a new hybrid routing protocol for military mobile ad hoc and disrupted networks. NOMAD is unique in that it operates as a proactive synchronous link state MANET protocol when the network is connected, but is able to seamlessly transition into asynchronous DTN mode when required. The results outlined in this thesis indicate that the hybrid NOMAD protocol provides a substantial improvement over standard synchronous MANET protocols. This thesis also makes a significant contribution with respect to synthetic mobility model generation. Mobility models are essential for the correct evaluation of any routing protocol. A mobility modelling tool called SWarMM (Synthetic Warfare Mobility Modelling) was also developed as part of this thesis. SWarMM provides an agent based simulation tool for generating credible synthetic mobility models for use with the discrete network simulation tools, such as OPNET and NS2.
16
Adnane, Hassiba Asmaa. "La confiance dans le routage Ad hoc : étude du protocole OLSR." Phd thesis, Université Rennes 1, 2008. http://tel.archives-ouvertes.fr/tel-00354194.
Full textAbstract:
La notion de confiance, quoique implicite, est toujours présente dans le fonctionnement des protocoles, en particulier, entre les entités qui participent aux opérations de routage. <br />Dans notre travail, nous nous sommes intéressés à la gestion de la confiance (trust management) comme une solution de sécurité pour le protocole OLSR (Optimized Link State Routing Protocol). Cette approche s'adapte particulièrement à la nature mobile, ad-hoc, distribuée et auto-organisée des réseaux ad-hoc. De plus, la gestion explicite de la confiance permet aux entités de raisonner avec et à propos de la confiance, les rendant ainsi plus robustes pour la prise de décisions concernant les autres entités.<br />Nous commençons par une analyse du fonctionnement du protocole OLSR sous l'optique de la confiance. Ensuite, nous proposons un raisonnement basé sur la confiance pour permettre à chaque noeud d'évaluer le comportement des autres noeuds, de détecter les comportements malveillants, et donc de pouvoir décider de faire confiance ou non. Enfin, nous proposons une solution de prévention et des contremesures pour résoudre le cas d'une incohérence et contrer les comportements malveillants. Ces solutions ne nécessitent que peu de modifications sur le protocole OLSR et peuvent être étendues selon le type d'attaque et les besoins des utilisateurs.
17
Raffo, Daniele. "Schémas de sécurité pour le protocole OLSR pour les réseaux ad hoc." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2005. http://tel.archives-ouvertes.fr/tel-00010678.
Full textAbstract:
Cette thèse examine les problématiques de sécurité liées à la protection du routage dans les réseaux ad hoc (MANETs). La thèse classifie les différentes attaques qui peuvent être portées et examine en détail le cas du protocole OLSR (Optimized Link State Routing). Une architecture de sécurisation basée sur l'ajout d'une signature numérique est étudiée et proposée. D'autres contre-mesures plus élaborées sont également présentées. Ces dernières incluent: la réutilisation d'informations topologiques précédentes pour valider l'état de lien actuel, l'évaluation de la véridicité des messages par analyse croisée avec la position géographique d'un noeud, et la détection des comportements suspects à l'intérieur du réseau par le contrôle de cohérence des flux ou l'écoute passif. La thèse analyse aussi les problèmes pratiques liées à la choix de l'algorithme de signature et la distributions des clés cryptographiques, et propose aussi des parades même en présence de noeuds compromis.
18
Groenevelt, Robin. "Modèles stochastiques pour les réseaux ad hoc mobiles." Phd thesis, Université de Nice Sophia-Antipolis, 2005. http://tel.archives-ouvertes.fr/tel-00274901.
Full textAbstract:
Dans la première partie de cette thèse nous étudions la mobilité et le temps de transfert d'un message dans les réseaux ad hoc mobiles. Nous obtenons, pour plusieurs modèles de mobilité, la loi stationnaire de la position des noeuds, la distribution du temps nécessaire avant que deux noeuds puissent (à nouveau) communiquer, et le temps durant lequel deux noeuds sont dans leur voisinage mutuel. Nous déduisons de ces résultats des formules pour le temps de transfert d'un message en utilisant d'autres noeuds dans le réseau comme relais. Ces calculs sont effectués pour plusieurs modèles de mobilité et pour deux types de protocoles de routage.La deuxième partie de cette thèse traite d'un système à " Polling " qui consiste en deux files d'attente servies par un serveur. Après avoir servi une file d'attente, le serveur a besoin d'un temps de commutation pour passer d'une file à l'autre, et commencer à servir les clients. Les temps de commutation peuvent être corrélés. Nous obtenons l'expression de plusieurs mesures de performance, notamment le temps d'attente moyen et la taille moyenne de la file d'attente. Grâce à ces expressions, nous comparons deux disciplines de service et au travers d'exemples nous montrons que la corrélation des temps de commutation peut augmenter significativement le temps d'attente moyen et la taille des files d'attente. Cela indique que la corrélation ne peut pas être ignorée et qu'elle a des implications importantes pour des systèmes de communication dans lesquels un canal de communication commun est partagé entre plusieurs utilisateurs et où le temps entre des transferts de données consécutifs est corrélé (par exemple dans les réseaux ad hoc).Dans la troisième et dernière partie nous étudions deux files d'attente en série avec des coûts pour chaque client dans le système. La fonction de valeur est calculée pour le coût moyen quand il n'y a pas d'entrée des clients. Celle-ci peut être utilisée pour l'optimisation des systèmes en série ou pour le calcul complet de la fonction de valeur.
19
Theoleyre, Fabrice. "Une auto-organisation et ses applications dans les réseaux ad hoc et hybrides." Phd thesis, INSA de Lyon, 2006. http://tel.archives-ouvertes.fr/tel-00126131.
Full textAbstract:
Un réseau ad hoc est un réseau sans-fil spontané de terminaux mobiles. S'il est connecté à Internet, il constitue un réseau hybride. Dans cette thèse, nous nous sommes intéressés à la création d'une couche d'auto-organisation, pré-requis selon nous à une utilisation efficace du réseau. L'ensemble des contributions présentées ici expliquent comment structurer un réseau ad hoc et mettent en exergue l'utilité d'une telle organisation. <br /><br />Nous avons proposé une auto-organisation formant plusieurs niveaux de hiérarchie et facilitant la diffusion d'information. Les algorithmes ont été intiment liés pour une maintenance optimisée. Cette structure a été validée à l'aide de simulations, analytiquement et dans un environnement radio réel. Des propriétés de robustesse, de persistance, d'auto-stabilisation et de passage à l'échelle ont notamment été mises en exergue. Cette auto-organisation ne constituant aucunement une fin en soi, nous avons également proposé des protocoles de routage et de localisation s'appuyant sur la structure virtuelle, s'inspirant largement des protocoles actuels tout en améliorant leur passage à l'échelle et performances.
20
Marcille, Sébastien. "Allocation de Ressources pour les Réseaux Ad Hoc Mobiles basés sur les Protocoles HARQ." Phd thesis, Telecom ParisTech, 2013. http://tel.archives-ouvertes.fr/tel-00939963.
Full textAbstract:
Cette thèse porte sur l'allocation de ressources dans les réseaux mobiles ad hoc basés sur les protocoles ARQ Hybrides (HARQ), qui offrent une souplesse de déploiement rapide pour des communications à court terme dans le cadre d'applications militaires ou de futurs réseaux intelligents. L'OFDMA (Orthogonal Frequency Division Multiple Access) est considérée en particulier, en tant que solution prometteuse dans les standards de communication sans fil les plus récents. Bien qu'une coordination centralisée des communications soit rendue possible grâce à une organisation en clusters, il est toutefois difficile de remonter au coordinateur des informations fiables sur l'état du canal en vertu de la latence due à l'organisation de ce réseau. Ainsi les performances des liens seront renforcées par des mécanismes de retransmission HARQ, qui permettent de gérer les variations rapides du canal. L'objectif principal de cette thèse est l'allocation des ressources OFDMA dans les réseaux mobiles ad hoc basés sur les protocoles HARQ, en utilisant uniquement les statistiques à long terme du canal. Pour répondre à un besoin industriel, des schémas de modulation et de codage pratiques seront considérés en lieu et place des outils de capacité hérités de la théorie de l'information. En particulier, nous concevons et analysons de nouveaux algorithmes qui optimisent l'attribution de puissance, de largeur de bande, d'ordre de modulation et de rendement de codage, pour les mécanismes HARQ insérés dans le schéma multi-utilisateurs proposé. En raison de la présence de protocoles HARQ dans le réseau, une partie de la thèse est dédiée à l'étude des performances de l'HARQ que nous étendons à de nouveaux contextes.
21
Johnson, David Lloyd. "Performance analysis of mesh networks in indoor and outdoor wireless testbeds." Diss., Pretoria : [s.n.], 2008. http://upetd.up.ac.za/thesis/available/etd-01232009-170259/.
Full text
22
Chanet, J. P. "Algorithme de routage coopératif à qualité de service pour des réseaux ad hoc agri-environnementaux." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2007. http://tel.archives-ouvertes.fr/tel-00343131.
Full textAbstract:
Avoir une agriculture garantissant ses bonnes pratiques et ainsi, contribuer à la protection de l'environnement est un enjeu majeur du développement durable du monde rural. Pour cela, il faut être à même de surveiller les milieux et d'enregistrer les interventions liées à l'agriculture. Cette surveillance nécessite de collecter de plus en plus de données spatio-temporelles pour alimenter des systèmes d'information agri-environnementaux capables de construire des indicateurs permettant de prendre des décisions, d'assurer des contrôles... Cette collecte de données ne peut être performante que si elle est réalisée de manière automatique au travers de réseaux informatiques. Ainsi, dans le cadre de ces travaux, le concept de réseaux agri-environnementaux est présenté. Les caractéristiques et les contraintes liées à ces réseaux montrent que seuls les réseaux sans fil de type ad hoc peuvent être mis en oeuvre pour répondre aux besoins. Un état de l'art des réseaux ad hoc et des protocoles de routages associés montre que la création d'un nouveau protocole de routage coopératif est nécessaire afin de satisfaire les besoins des réseaux agri-environnementaux. Ce protocole de routage coopératif est la principale contribution de ces travaux. Vient ensuite la question de Qualité de Service dans ce type de réseaux sans fil qui est très importante, notamment dans un contexte de surveillance de l'environnement. Au sein du protocole de routage proposé, la Qualité de Service est abordée suivant plusieurs principes : estimation de la bande passante, augmentation de la connectivité du réseau... La Qualité de Service dans les réseaux agri-environnementaux est donc un autre point important de ces travaux de thèse. La mise en oeuvre de ces principes est illustrée au travers de différents exemples de réseaux agri-environnementaux. Cet aspect est abordé de manière globale par la mise en oeuvre de modules originaux tant sur le plan matériel que logiciel. Les solutions proposée permettent le déploiement de capteurs, fixes ou mobiles, à même de surveiller l'environnement et ainsi, de mieux comprendre les actions de l'homme sur celui-ci.
23
Ingelrest, François. "Protocoles localisés de diffusion et économie d'énergie dans les réseaux ad hoc et de capteurs." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2006. http://tel.archives-ouvertes.fr/tel-00113869.
Full textAbstract:
Un réseau ad hoc sans fil est composé d'un ensemble décentralisé d'objets mobiles et auto-organisés. Un tel réseau ne repose sur aucune infrastructure, et est donc complètement autonome et dynamique. Selon ces hypothèses, tout ensemble d'objets équipés d'interfaces de communication adéquates peut spontanément former un tel réseau. Puisque des communications sans fil sont utilisées, seuls les objets suffisamment proches les uns des autres peuvent communiquer ensemble. Les communications de longue portée doivent donc être effectuées via un mécanisme multi-sauts : cela veut simplement dire que les objets intermédiaires doivent faire suivre les messages jusqu'au destinataire.<br /><br />Les réseaux de capteurs sont similaires aux réseaux ad hoc, car ils sont également décentralisés et autonomes. Un capteur est un petit appareil capable de surveiller son environnement. Des cas typiques d'utilisation peuvent être la surveillance de zones militaires (détection de mouvements) ou de forêts (détection d'incendie).<br /><br />Parmi les problèmes communs à ces deux types de réseaux se trouve la diffusion. Dans une telle communication, un message est envoyé depuis un objet donné vers tous les autres du réseau. Les applications de ce processus sont nombreuses : découverte de routes, synchronisation... Comme les objets mobiles utilisent une batterie, il est nécessaire que la diffusion soit la plus économe possible d'un point de vue énergétique. Cela est généralement obtenu en réduisant la quantité de relais nécessaires, ou en limitant la puissance d'émission à chaque relais.<br /><br />Le but de mon travail était d'étudier la diffusion dans les réseaux ad hoc et de capteurs, afin de mettre en lumière les caractéristiques et les défauts des mécanismes existants, puis d'en proposer de nouveaux, plus efficaces. Dans tous ces travaux, nous avons toujours voulu rester dans le domaine des solutions 'réalistes' : beaucoup des précédentes études utilisaient en effet des mécanismes centralisés, où une connaissance globale du réseau est nécessaire pour effectuer la diffusion. Nous nous sommes concentrés sur des solutions fiables et localisés, c'est-à-dire n'utilisant que des informations sur le voisinage de chaque noeud. Ce type de mécanisme permet également un passage à l'échelle simplifié, car la quantité d'informations nécessaire ne varie pas avec la taille du réseau. Nos études montrent de plus que ces solutions peuvent être aussi efficaces que les méthodes centralisées.<br /><br />Puisque l'ajustement de portée est un mécanisme très important dans la conservation de l'énergie, nous avons proposé une méthode de diffusion originale, basée sur le concept de portée optimale de communication. Cette dernière est calculée de manière théorique grâce au modèle énergétique considéré, et représente le meilleur compromis entre l'énergie dépensée à chaque noeud et le nombre de relais nécessaires. Nous avons ainsi proposé deux protocoles différents basés sur ce concept, chacun étant plus spécifiquement adapté soit aux réseaux ad hoc (TR-LBOP), soit aux réseaux de capteurs (TR-DS).<br /><br />Afin de réduire encore plus la consommation énergétique, nous avons étudié le fameux protocole centralisé nommé BIP. Son efficacité est due au fait qu'il considère la couverture obtenue par une seule émission omnidirectionnelle, au lieu de considérer chaque lien séparément. Nous avons proposé une solution localisée basée sur BIP, afin de construire incrémentalement une structure de diffusion. Nous avons montré de manière expérimentale que les résultats ainsi obtenus sont très proches de ceux fournis par BIP, notamment dans les réseaux de forte densité, tout en n'utilisant que des informations locales à chaque noeud.<br /><br />Nous avons finalement considéré la suppression d'une hypothèse forte, largement répandue dans la communauté des réseaux ad hoc et de capteurs : l'utilisation d'un graphe du disque unitaire. Ce dernier définit la zone de communication d'un noeud comme étant un cercle parfait. Nous avons remplacé cette hypothèse par une autre plus réaliste afin d'en étudier les conséquences sur un protocole connu, le protocole de diffusion par relais multipoints (MPR). Nous avons montré que ce dernier ne fournit plus de résultats suffisants dans un tel environnement. Nous avons également proposé quelques modifications afin d'obtenir à nouveau de bons résultats.
24
Karapetsas, Konstantinos. "Building a simulation toolkit for wireless mesh clusters and evaluating the suitability of different families of ad hoc protocols for the Tactical Network Topology." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://handle.dtic.mil/100.2/ADA432399.
Full textAbstract:
Thesis (M.S. in Information Technology Management and M.S. in Computer Science)--Naval Postgraduate School, March 2005.<br>Thesis Advisor(s): Alexander Bordetsky, Gilbert M. Lundy. Includes bibliographical references (p. 69-75). Also available online.
25
Vannier, Rémi. "Profiterole : un protocole de partage équitable de la bande passante dans les réseaux ad hoc." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2009. http://tel.archives-ouvertes.fr/tel-00965326.
Full textAbstract:
On considère souvent IEEE 802.11 comme la technologie sous-jacente aux réseaux sans fil multisauts. Pourtant, dans de tels réseaux, 802.11 s'avère inefficace et/ou inéquitable dans de nombreuses situations. Cette thèse décrit un algorithme d'allocation dynamique et distribuée de débit permettant de garantir un partage équitable de la bande passante entre flux, tout en assurant une utilisation efficace du réseau. De plus, cette thèse propose une nouvelle méthode d'évaluation de l'efficacité d'un protocole en prenant en compte l'expérience utilisateur.
26
Herberg, Ulrich. "Réseaux Ad Hoc : Performance, Dimensionnement, Gestion Automatisée et Intégration dans l'Internet." Phd thesis, Ecole Polytechnique X, 2011. http://pastel.archives-ouvertes.fr/pastel-00598156.
Full textAbstract:
Le présent rapport fournit plusieurs extensions des protocoles de réseau ad hoc et leurs évaluations, qui permettent d'augmenter la performance, de dimensionner la taille des réseaux et d'intégrer les réseaux ad hoc dans l'Internet : Premièrement, ce rapport présente plusieurs outils de logiciel qui permettent d'étudier des protocoles de routage sans modifications, implémentés en Java, dans le simulator de réseaux NS2. Deuxièmement, ce rapport fournit une discussion architecturale des réseaux ad hoc, qui explique les problèmes de la configuration automatique des adresses IP (nommé autoconfiguration) des routeurs ad hoc. Ensuite, le rapport présente un modèle architectural pour des réseaux ad hoc qui est compatible avec l'Internet. Un protocole d'autoconfiguration, basé sur le modèle architectural proposé, est spécifié, et ses propriétés sont formellement vérifiées au moyen de Model Checking. Troisièmement, plusieurs extensions du protocole de routage des réseaux ad hoc OLSRv2 sont présentées : La performance du protocole est augmentée d'ordre de grandeur en utilisant un algorithme dynamique pour calculer les plus courts chemins. Une autre optimisation proposée est un framework basé sur SNMP pour gérer et contrôler des objets liés à la performance sur des routeurs tournant OLSRv2. Une extension d'OLSRv2 est présentée dans laquelle des paquets sont retransmis ultérieurement lorsque les destinations sont indisponibles temporairement, au lieu de les rejeter. Cette extension mène à un taux de remis considérablement plus élevé que OLSRv2 par défaut dans certains scenarios. Ce rapport présente alors une analyse des menaces de sécurité pour OLSRv2, suivie par la spécification d'un mécanisme de contrôle d'accès pour OLSRv2, qui empêche nombre de ces attaques. Quatrièmement, ce rapport explore le dimensionnement des réseaux de capteurs sans fil, et évalue un protocole de routage des réseaux de capteurs, nommé RPL, spécifié par l'IETF en 2011. En outre, étant donné que RPL ne contient pas de mécanisme de broadcast efficace, plusieurs mécanismes de broadcast optimisés dans RPL sont présentés et comparés.
27
Chrisment, Isabelle. "Maîtrise de la dynamique dans l'Internet -- de l'adaptation des protocoles à la sécurité des services --." Habilitation à diriger des recherches, Université Henri Poincaré - Nancy I, 2005. http://tel.archives-ouvertes.fr/tel-00010870.
Full textAbstract:
De nouveaux modèles d'organisation de réseaux et de routage ainsi que de nouveaux services apparaissent face à une dynamique de plus en plus croissante au niveau de l'Internet : services multicast, services pair à pair, réseaux ad hoc et réseaux de capteurs. Ceci s'explique en partie par la convergence du monde fixe et du monde mobile, du monde des télécommunications et du monde IP. L'ensemble des contributions présentées dans ce mémoire met en évidence comment nous avons pris en compte l'aspect dynamique offert par les réseaux et les services rencontrés actuellement dans l'Internet. Nous nous sommes orientés vers la gestion de ces réseaux dynamiques avec une focalisation sur un axe crucial pour leur développement, celui de la sécurité. Dans une première partie, nous étudions comment nous pouvons adapter les protocoles aux besoins des applications tant au niveau transport que réseau. Nous montrons comment nos travaux relatifs à ALF (Application Layer Framing) nous ont conduits à nous intéresser au paradigme des réseaux actifs et plus <br />particulièrement à leur gestion. La deuxième partie est concentrée autour d'un service de gestion spécifique ; celui de la sécurité dans le contexte de la communication de groupe. L'environnement multicast représente un excellent domaine d'application grâce à son aspect dynamique : tout membre peut quitter ou joindre le groupe à tout moment. Ce qui implique des renouvellements de clés fréquents et pose des problèmes de passage à l'échelle. Nos travaux ont abouti à la définition de protocoles de distribution de clés adaptés à la communication de groupe. Avec le déploiement des réseaux sans fil, le besoin de créer et d'interconnecter des réseaux autonomes et spontanés, appelés aussi réseaux ad hoc, va en augmentant. Le support du multicast dans ce type de réseau est important notamment pour des applications militaires ou des opérations de sécurité civile qui requièrent des communications de groupe pour l'échange d'informations confidentielles. Ces applications sont très sensibles et demandent un niveau de sécurité relativement élevé. Dans ce <br />contexte, nous présentons comment nous avons adapté nos protocoles de distribution de clés de groupe ‡ l'environnement ad hoc. Nous proposons aussi une nouvelle approche de gestion de clés dans les réseaux MANETs (Mobile Ad hoc NETworks) pour des applications spécifiques de diffusion de flux multimédia de 1 vers n séquentiel.
28
Kaisser, Florent. "Communications dans les réseaux fortement dynamiques." Phd thesis, Université Paris Sud - Paris XI, 2010. http://tel.archives-ouvertes.fr/tel-00512021.
Full textAbstract:
Les réseaux de véhicules sont une technologie émergente intégrant les dernières techniques de communication. Sans infrastructure, le réseau est un réseau dit ad hoc, un protocole de routage doit donc être utilisé pour assurer les communications inter-véhiculaires. Nous appelons ce type de réseau, un réseau ad hoc de véhicules. Nos travaux s'articulent autour de deux axes : le passage à l'échelle et la gestion de la mobilité dans un contexte autoroutier. Pour cela, nous avons proposé une extension du protocole de routage ad hoc DSR pour les réseaux ad hoc hybride (comportant une infrastructure fixe). Des simulations à l'aide de JiST/SWANS ont montré une amélioration des performances en terme de passage à l'échelle, connectivité et capacité du réseau. Nous avons également établi un modèle analytique pour comparer le passage à l'échelle de deux classes de protocoles de routage : réactif et géographique. Nous concluons que l'utilisation d'un protocole géographique et ses optimisations améliore de manière significative le passage à l'échelle. Enfin, nous proposons un algorithme répartie de formation de convois de véhicules afin d'améliorer la gestion de la mobilité dans un contexte de réseau ad hoc hybride de véhicules sur autoroute. Nous avons évalué cet algorithme à l'aide de simulations et conclu à une bonne qualité de formation des convois.
29
Thurston, Michael J. "A pragmatic view of MANET performance evaluation and design of a prototype MAC level routing algorithm." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0108103-122903.
Full text
30
Sabir, Essaid. "Conception de Protocoles de la Couche MAC et Modélisation des Réseaux Hétérogènes de Nouvelle Génération." Phd thesis, Université d'Avignon, 2010. http://tel.archives-ouvertes.fr/tel-00538837.
Full textAbstract:
Ce manuscrit est centré sur la conception, l'amélioration et l'évaluation des protocoles des couches RESEAU, MAC et PHY. En particulier, nous nous focalisons sur la conception de nouveaux protocoles distribués pour une utilisation optimale/améliorée des ressources radio disponibles. Par ailleurs, nous caractérisons les performances des réseaux ad hoc à accès aléatoire au canal en utilisant des paramètres de plusieurs couches avec aptitude de transfert d'information (data forwarding). La majeure partie de nos analyses se base sur le concept d'interaction entre les couches OSI (cross-layer). En effet, cette nouvelle et attractive approche est devenue en peu de temps omniprésente dans le domaine de recherche et développement et dans le domaine industriel. Les métriques de performances qui nous intéressent sont la stabilité des files d'attentes de transfert, le débit, le délai et la consommation d'énergie. Principalement, la compréhension de l'interaction entre les couches MAC/PHY et routage du standard IEEE 802.11e DCF/EDCF, d'une part, et l'interaction entre noeuds en terme d'interférences, d'autre part, constituent le coeur central de notre travail.
31
Amadou, Ibrahim. "Protocoles de routage sans connaissance de voisinage pour réseaux radio multi-sauts." Phd thesis, INSA de Lyon, 2012. http://tel.archives-ouvertes.fr/tel-00763865.
Full textAbstract:
L'efficacité énergétique constitue l'objectif clef pour la conception des protocoles de communication pour des réseaux de capteurs radio multi-sauts. Beaucoup d'efforts ont été réalisés à différents niveaux de la pile protocolaire à travers des algorithmes d'agrégation spatiale et temporelle des données, des protocoles de routage efficaces en énergie, et des couches d'accès au médium avec des mécanismes d'ordonnancement permettant de mettre la radio en état d'endormissement afin d'économiser l'énergie. Pour autant, ces protocoles utilisent de façon importante des paquets de contrôle et de découverte du voisinage qui sont coûteux en énergie. En outre, cela se fait très souvent sans aucune interaction entre les différentes couches de la pile. Ces travaux de thèse s'intéressent donc particulièrement à la problématique de l'énergie des réseaux de capteurs à travers des protocoles de routage et d'accès au médium. Les contributions de cette thèse se résument de la manière suivante : Nous nous sommes tout d'abord intéressés à la problématique de l'énergie au niveau routage. Dans cette partie, les contributions se subdivisent en deux parties. Dans un premier temps, nous avons proposé une analyse théorique de la consommation d'énergie des protocoles de routage des réseaux radio multi-sauts d'appréhender au mieux les avantages et les inconvénients des uns et des autres en présence des modèles de trafic variables, un diamètre du réseau variable également et un modèle radio qui permet de modéliser les erreurs de réception des paquets. À l'issue de cette première étude, nous sommes parvenus à la conclusion que pour être économe en énergie, un protocole de routage doit avoir des approches similaires à celle des protocoles de routage géographique sans message hello. Puis, dans un second temps, nous introduisons une étude de l'influence des stratégies de relayage dans un voisinage à 1 saut sur les métriques de performance comme le taux de livraison, le nombre de messages dupliqués et la consommation d'énergie. Cette étude est suivie par une première proposition de protocole de routage géographique sans message hello (Pizza-Forwarding (PF)) exploitant des zones de relayage optimisées et sans aucune hypothèse sur les propriétés du canal radio. Dans le but de réduire considérablement la consommation de PF, nous proposons de le combiner avec une adaptation d'un protocole MAC asynchrone efficace en énergie à travers une approche transversale. La combinaison de ces deux approches montre un gain significatif en terme d'économie d'énergie avec des très bon taux de livraison et cela quels que soient les scénarios et la nature de la topologique.
32
Jun, Jangeun. "Networking in Wireless Ad Hoc Networks." NCSU, 2006. http://www.lib.ncsu.edu/theses/available/etd-08172006-150002/.
Full textAbstract:
In modern communication systems, wireless ad hoc networking has become an irreplaceable technology where communication infrastructure is insufficient or unavailable. An ad hoc network is a collection of self-organizing nodes that are rapidly deployable and adaptable to frequent topology changes. In this dissertation, the key problems related to the network layer (i.e., forwarding, routing, and network-layer topology control) are addressed. The problem of unfair forwarding in ad hoc nodes is identified and cross-layer solutions are proposed. Because a typical ad hoc node functions both as a router and a host, severe unfairness occurs between originated and forwarded packets which eventually leads to a serious starvation problem. The results show that, to restore the fairness and enhance the capacity efficiency, non-traditional queueing schemes are required where both the network and the MAC layers should be considered together. Routing is a critical protocol, which directly affects the scalability and reliability of wireless ad hoc networks. A good routing protocol for wireless ad hoc networks should overcome the dynamic nature of the topology arising from unreliable wireless links and node mobility. In ad hoc networks, it is very important to balance the route accuracy and overhead efficiency. A number of routing protocols have been proposed for wireless ad hoc networks, but it is well known that current routing protocols scale poorly with the number of nodes, the number of traffic flows, the intensity of mobility. The main objective of this dissertation is to provide efficient routing protocols for different types of wireless ad hoc networks including wireless mesh networks (WMNs), mobile ad hoc networks (MANETs), and wireless sensor networks (WSNs). Since each category has different assumptions and constraints, different solutions should be considered. WMNs and WSNs have low mobility and centralized (one-to-any) traffic patterns while MANETs have relatively high mobility and uniform (any-to-any) traffic patterns. WSNs are highly resource-constrained while WMNs are not. A new routing protocol specially designed for WMNs is proposed. Simulation experiments show that the protocol outperforms existing generic ad hoc routing protocols. This improvement is enabled by the essential characteristics of WMNs, and as a result, the protocol does not rely on bandwidth-greedy flooding mechanism. For MANET routing, an existing de facto the standard Internet intra-AS (autonomous system) routing protocol is extended to enhance the scalability in ad hoc environments. When extended for MANETs, Open Shortest Path First (OSPF) is expected to provide the benefits of maturity, interoperability, and scalability. The scalability extension is two-fold: the notions of distance effect and multiple areas are explored as extensions. Both approaches provide significant gain in scalability by efficiently reducing flooding overhead without compromising routing or forwarding performance. Finally, a new scalable and reliable sensor network routing is proposed. Since WSNs are the most resource-constrained type of ad hoc networks, the protocol should be very simple yet reliable. The proposed WSN routing protocol is designed to provide reliability (via multi-path redundancy), scalability (with efficiently contained flooding), and flexibility (source-tunable per-packet priority), which are achieved without adding protocol complexity or resource consumption. The protocol is implemented on real sensor motes and its performance is tested through outdoor sensor field deployments. The results show that the protocol outperforms even sophisticated link estimation based sensor network routing protocols.
33
Raghuveer, Madhusudhan. "Interoperability of ad-hoc routing protocols." Thesis, Wichita State University, 2008. http://hdl.handle.net/10057/2039.
Full textAbstract:
Mobile ad-hoc networks are fast emerging and play a very important role in the field of wireless communications. With the advantages of mobility and infrastructure less the applications of ad-hoc networks have increased drastically. There are different routing protocols specifically designed for ad-hoc networks. Some examples of these routing protocols are DSDV, DSR AODV and DSR. Each of the routing protocols proposed for ad-hoc networks has its own advantages. For example DSDV is best suited for small scale ad-hoc networks and the design principles are very simple and are not very efficient when there is mobility and the size of the network increases. AODV and DSR are on-demand routing protocols and are best suited for large networks and also when a lot of mobility is involved among the wireless nodes in the network. Thus it is not possible to define a single routing protocol that would best suite all ad-hoc networks. The selection of a routing protocol purely depends on the application and also the scalability of the network. Having said that there cannot be a single routing protocol for all kinds of ad-hoc network this thesis concentrates on the concept of having interoperability between ad-hoc routing protocols. This thesis proposes a methodology which involves defining a universal packet which would be understood by all routing protocols. The design of having interoperability between the ad-hoc routing protocol involves three phases namely Bootstrap Phase, Route Discovery Phase and Data Exchange Phase. The method involved does not propose any changes to the existing protocols but an addition of universal packet format which would be understood by all routing protocols. Having discussed the proposed methodology for having interoperability between ad-hoc routing protocols this thesis discuses a mathematical model to calculate the maximum time involved in the Bootstrap Phase and the Route Discovery phase. The simulation results show that not only the number of hops to the egress node play important role in the time determination in Bootstrap Phase but also the distance between the source and the egress node play a key factor in the time determination process.<br>Thesis Thesis [M.S.] - Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering
34
Raghuveer, Madhusudhan Pendse Ravindra. "Interoperability of ad-hoc routing protocols." A link to full text of this thesis in SOAR, 2008. http://hdl.handle.net/10057/2039.
Full text
35
Heurtefeux, Karel. "Protocoles Localisés pour Réseaux de Capteurs." Phd thesis, INSA de Lyon, 2009. http://tel.archives-ouvertes.fr/tel-00449801.
Full textAbstract:
Les réseaux de capteurs sont au cœur des efforts de recherche de la communauté internationale depuis plusieurs années. Les domaines d'applications sont variés allant du suivi médical à la traçabilité alimentaire en passant par le bâtiment intelligent ou le monitoring urbain (pollution, bruit, consommation électrique...). Pour que ces réseaux denses, composés de centaines voire de milliers d'entités contraintes en énergie, en puissance de calcul et en communication puissent fonctionner et s'adapter aux différentes applications, il est nécessaire, selon nous, de recourir à l'auto-organisation. L'auto-organisation est un processus duquel émerge une structure globale provenant seulement des multiples interactions locales, sans références à la globalité du réseau. De nombreuses études traitent de l'évaluation de performances des stratégies d'auto-organisation. Mais le réseau est toujours considéré comme entièrement déployé, statique. Nous montrons qu'une analyse plus fine est possible pour caractériser les différentes stratégies d'auto-organisation durant la vie d'un réseau de capteurs sans fil en prenant en compte la dynamique du réseau malgré l'immobilité physique des capteurs. On propose de mettre en évidence les différentes phases de la vie d'un réseau de capteurs et de caractériser un ensemble de protocoles d'auto-organisation sur ces différentes phases ; c'est-à-dire d'en déterminer les comportements. Nous ne concevons pas l'auto-organisation comme une fin en soi, elle doit servir à résoudre des problématiques. Après avoir démontré par une série d'expérimentations dans des environnements réels, l'inadaptation de la mesure du signal reçu (RSSI) pour résoudre le défi de la localisation dans les réseaux de capteurs, nous montrons qu'il est possible de concevoir un protocole d'auto-organisation dédié à la localisation du voisinage : le Protocole de Localisation Qualitative: QLoP. Ce protocole permet de déterminer une distance qualitative en se basant uniquement sur le voisinage à 1 et 2 sauts. Nous montrons dans cette thèse que QLoP possède à la fois de bonnes propriétés pour estimer la proximité d'un nœud mais s'adapte aussi parfaitement aux changements de topologie induite par le déploiement de nouveaux capteurs ou la disparition d'autres. Les propriétés de QLoP, démontrées précédemment permettent de construire une topologie logique, le Relative Neighborhood Graph (RNG), de façon efficace. Cette topologie permet de favoriser les liens les plus robustes et d'acheminer ainsi les paquets même dans un environnement très bruité. Enfin, nous montrons que le choix de la couche MAC ainsi que la topologie influent grandement sur les performances d'un réseau de capteurs. Nous proposerons une solution utilisant les propriétés de QLoP afin de définir une couche MAC appropriée.
36
Khabbazian, Majid. "Secure and efficient wireless ad hoc networking." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/2847.
Full textAbstract:
Wireless ad hoc networks have been emerged to support applications, in which it is required/desired to have wireless ommunications among a variety of devices without relying on any infrastructure or central managements. In ad hoc networks, wireless devices, simply called nodes, have limited transmission range. Therefore, each node can directly communicate with only those
within its transmission range and requires other nodes to act as routers in order
to communicate with out-of-range estinations. One of the fundamental
operations in ad hoc networks is broadcasting, where a node sends a message
to all other nodes in the network. This can be achieved through flooding, in which every node transmits the first copy of the received message. However, flooding can impose a large number of redundant transmissions, which
can result in significant waste of constrained resources such as bandwidth
and battery power. One of the contributions of this work is to propose efficient
broadcast algorithms which can significantly reduce the number of redundant transmissions. We also consider some of the security issues of ad hoc networks. In particular, we carefully analyze the effect of the wormhole
attack, which is one of the most severe threats against ad hoc networks. We also propose a countermeasure, which is an improvement over the existing timing-based solutions against the wormhole attack. Finally, in the last chapter, we propose novel point compression techniques which can be used in Elliptic Curve Cryptography (ECC). ECC can provide the same level of
security as other public key cryptosystems (such as RSA) with substantially smaller key sizes. Smaller keys can result in smaller system parameters, bandwidth savings, faster implementations and lower power consumption.
These advantages make ECC interesting for ad hoc networks with restricted devices.
37
Holland, Gavin Douglas. "Adaptive protocols for mobile ad hoc networks." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1445.
Full textAbstract:
Recent advances in low-power technologies have resulted in the proliferation of
inexpensive handheld mobile computing devices. Soon, just like the Internet empow-
ered a whole new world of applications for personal computers, the development and
deployment of robust ubiquitous wireless networks will enable many new and exciting
futuristic applications. Certain to be an important part of this future is a class of
networks known as "mobile ad hoc networks." Mobile ad hoc networks (or simply
"ad hoc networks") are local-area networks formed "on the spot" between collocated
wireless devices. These devices self-organize by sharing information with their neigh-
bors to establish communication pathways whenever and wherever they are. For ad
hoc networks to succeed, however, new protocols must be developed that are capable
of adapting to their dynamic nature.
In this dissertation, we present a number of adaptive protocols that are designed
for this purpose. We investigate new link layer mechanisms that dynamically monitor
and adapt to changes in link quality, including a protocol that uses common control
messages to form a tight feedback control loop for adaptation of the link data rate
to best match the channel conditions perceived by the receiver. We also investigate
routing protocols that adapt route selection according to network characteristics. In
particular, we present two on-demand routing protocols that are designed to take
advantage of the presence of multirate links. We then investigate the performance of
TCP, showing how communication outages caused by link failures and routing delays
can be very detrimental to its performance. In response, we present a solution to this
problem that uses explicit feedback messages from the link layer about link failures to
adapt TCP's behavior. Finally, we show how link failures in heterogeneous networks
containing links with widely varying bandwidth and delay can cause repeated "modal"
changes in capacity that TCP is slow to detect. We then present a modifed version
of TCP that is capable of more rapidly detecting and adapting to these changes.
38
Davis, Carlton R. "Security protocols for mobile ad hoc networks." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=102970.
Full textAbstract:
Mobile ad hoc networks (MANETs) are generating much interest both in academia and the telecommunication industries. The principal attractions of MANETs are related to the ease with which they can be deployed due to their infrastructure-less and decentralized nature. For example, unlike other wireless networks, MANETs do not require centralized infrastructures such as base stations, and they are arguably more robust due to their avoidance of single point of failures. Interestingly, the attributes that make MANETs attractive as a network paradigm are the same phenomena that compound the challenge of designing adequate security schemes for these innovative networks.<br>One of the challenging security problems is the issue of certificate revocation in MANETs where there are no on-line access to trusted authorities. In wired network environments, when certificates are to be revoked, certificate authorities (CAs) add the information regarding the certificates in question to certificate revocation lists (CRLs) and post the CRLs on accessible repositories or distribute them to relevant entities. In purely ad hoc networks, there are typically no access to centralized repositories or trusted authorities; therefore the conventional method of certificate revocation is not applicable.<br>Another challenging MANET security problem is the issue of secure routing in the presence of selfish or adversarial entities which selectively drop packets they agreed to forward; and in so doing these selfish or adversarial entities can disrupt the network traffic and cause various communication problems.<br>In this thesis, we present two security protocols we developed for addressing the above-mentioned MANET security needs. The first protocol is a decentralized certificate revocation scheme which allows the nodes within a MANET to have full control over the process of certificate revocation. The scheme is fully contained and it does not rely on any input from centralized or external entities such as trusted CAs. The second protocol is a secure MANET routing scheme we named Robust Source Routing (RSR). In addition to providing data origin authentication services and integrity checks, RSR is able to mitigate against intelligent, colluding malicious agents which selectively drop or modify packets they are required to forward.
39
JAIN, NITIN. "MULTICHANNEL CSMA PROTOCOLS FOR AD HOC NETWORKS." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin995471534.
Full text
40
Halvorsen, Henrik. "InstantSocial : social networking in mobile ad-hoc environments." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9067.
Full textAbstract:
<p>This report covers the research, design and prototype implementation of a social application for mobile ad-hoc networks, InstantSocial. The main goals of this project has been to look at this exciting field and examine how the European scientific collaborative project MUSIC can be used to develop such an application. The project has been conducted using a Design Science approach. First the field of interest, existing similar applications and technology was examined to get a good view of the current state-of-the-art and choose a suitable prototype application. Then the design of the application was constructed, emphasizing the important features outlined in the project goals. Finally a prototype was developed and tested as a means to prove the correctness and applicability of the design. The results of the project was somewhat divided. Although the developed prototype had limited functionality, mostly because of the current limitations of the used framework, the tests that were performed where positive. Not all of the requirements of the system was successfully implemented, but this was due to limited time available or limitations in the currently available version of the framework rather than a shortage of the design. We conclude that the presented design and approach to context-adaptation is very plausible as a way in which the MUSIC project can be used to develop social application for mobile ad-hoc networks, but that much more work and testing is required before such an application can be fully realized.</p>
41
Li, Zhuoqun. "Resource-efficient strategies for mobile ad-hoc networking." Thesis, University of Plymouth, 2007. http://hdl.handle.net/10026.1/325.
Full textAbstract:
The ubiquity and widespread availability of wireless mobile devices with ever increasing inter-connectivity (e. g. by means of Bluetooth, WiFi or UWB) have led to new and emerging next generation mobile communication paradigms, such as the Mobile Ad-hoc NETworks (MANETs). MANETs are differentiated from traditional mobile systems by their unique properties, e. g. unpredictable nodal location, unstable topology and multi-hop packet relay. The success of on-going research in communications involving MANETs has encouraged their applications in areas with stringent performance requirements such as the e-healthcare, e. g. to connect them with existing systems to deliver e-healthcare services anytime anywhere. However, given that the capacity of mobile devices is restricted by their resource constraints (e. g. computing power, energy supply and bandwidth), a fundamental challenge in MANETs is how to realize the crucial performance/Quality of Service (QoS) expectations of communications in a network of high dynamism without overusing the limited resources. A variety of networking technologies (e. g. routing, mobility estimation and connectivity prediction) have been developed to overcome the topological instability and unpredictability and to enable communications in MANETs with satisfactory performance or QoS. However, these technologies often feature a high consumption of power and/or bandwidth, which makes them unsuitable for resource constrained handheld or embedded mobile devices. In particular, existing strategies of routing and mobility characterization are shown to achieve fairly good performance but at the expense of excessive traffic overhead or energy consumption. For instance, existing hybrid routing protocols in dense MANETs are based in two-dimensional organizations that produce heavy proactive traffic. In sparse MANETs, existing packet delivery strategy often replicates too many copies of a packet for a QoS target. In addition, existing tools for measuring nodal mobility are based on either the GPS or GPS-free positioning systems, which incur intensive communications/computations that are costly for battery-powered terminals. There is a need to develop economical networking strategies (in terms of resource utilization) in delivering the desired performance/soft QoS targets. The main goal of this project is to develop new networking strategies (in particular, for routing and mobility characterization) that are efficient in terms of resource consumptions while being effective in realizing performance expectations for communication services (e. g. in the scenario of e-healthcare emergency) with critical QoS requirements in resource-constrained MANETs. The main contributions of the thesis are threefold: (1) In order to tackle the inefficient bandwidth utilization of hybrid service/routing discovery in dense MANETs, a novel "track-based" scheme is developed. The scheme deploys a one-dimensional track-like structure for hybrid routing and service discovery. In comparison with existing hybrid routing/service discovery protocols that are based on two-dimensional structures, the track-based scheme is more efficient in terms of traffic overhead (e. g. about 60% less in low mobility scenarios as shown in Fig. 3.4). Due to the way "provocative tracks" are established, the scheme has also the capability to adapt to the network traffic and mobility for a better performance. (2) To minimize the resource utilization of packet delivery in sparse MANETs where wireless links are intermittently connected, a store-and-forward based scheme, "adaptive multicopy routing", was developed for packet delivery in sparse mobile ad-hoc networks. Instead of relying on the source to control the delivery overhead as in the conventional multi-copy protocols, the scheme allows each intermediate node to independently decide whether to forward a packet according to the soft QoS target and local network conditions. Therefore, the scheme can adapt to varying networking situations that cannot be anticipated in conventional source-defined strategies and deliver packets for a specific QoS targets using minimum traffic overhead. ii (3) The important issue of mobility measurement that imposes heavy communication/computation burdens on a mobile is addressed with a set of resource-efficient "GPS-free" soluti ons, which provide mobility characterization with minimal resource utilization for ranging and signalling by making use of the information of the time-varying ranges between neighbouring mobile nodes (or groups of mobile nodes). The range-based solutions for mobility characterization consist of a new mobility metric for network-wide performance measurement, two velocity estimators for approximating the inter-node relative speeds, and a new scheme for characterizing the nodal mobility. The new metric and its variants are capable of capturing the mobility of a network as well as predicting the performance. The velocity estimators are used to measure the speed and orientation of a mobile relative to its neighbours, given the presence of a departing node. Based on the velocity estimators, the new scheme for mobility characterization is capable of characterizing the mobility of a node that are associated with topological stability, i. e. the node's speeds, orientations relative to its neighbouring nodes and its past epoch time. iii
42
Huang, Yi-an. "Anomaly Detection for Wireless Ad-Hoc Routing Protocols." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20010706-024527.
Full textAbstract:
<p>HUANG, YI-AN. Anomaly Detection for Wireless Ad-Hoc Routing Protocols.(Under the direction of Wenke Lee.)<BR><BR>Mobile Ad-hoc networking (MANET) is an important emergingtechnology. As recent several security incidents remind us, noopen computer system is immune from intrusions. The routing protocolsin ad-hoc networks are key components yet vulnerable and presentspecial challenges to intrusion detection.<BR><BR>In this thesis, we propose an anomaly detection scheme for existingad-hoc routing protocols. Our approach relies on information from localrouting data and other reliable local sources. Our approach models thetemporal/sequential characteristics of observations and uses entropyanalysis for feature selection. Classification algorithms are used tocompute anomaly detection models. We present case studies on DSR andDSDV protocols using the ns-2 simulator. The overall results thusfar are very encouraging. We discuss how the available information from arouting protocol influences anomaly detection performance and attemptto provide guidelines on what features we need for anomaly detection.<BR><BR>Finally, we also discuss several challenging issues and propose ourfuture work.<P>
43
Masrub, Abdullah Ashur. "Cognitive MAC protocols for mobile ad-hoc networks." Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7621.
Full textAbstract:
The term of Cognitive Radio (CR) used to indicate that spectrum radio could be accessed dynamically and opportunistically by unlicensed users. In CR Networks, Interference between nodes, hidden terminal problem, and spectrum sensing errors are big issues to be widely discussed in the research field nowadays. To improve the performance of such kind of networks, this thesis proposes Cognitive Medium Access Control (MAC) protocols for Mobile Ad-Hoc Networks (MANETs). From the concept of CR, this thesis has been able to develop a cognitive MAC framework in which a cognitive process consisting of cognitive elements is considered, which can make efficient decisions to optimise the CR network. In this context, three different scenarios to maximize the secondary user's throughput have been proposed. We found that the throughput improvement depends on the transition probabilities. However, considering the past information state of the spectrum can dramatically increases the secondary user's throughput by up to 40%. Moreover, by increasing the number of channels, the throughput of the network can be improved about 25%. Furthermore, to study the impact of Physical (PHY) Layer errors on cognitive MAC layer in MANETs, in this thesis, a Sensing Error-Aware MAC protocols for MANETs has been proposed. The developed model has been able to improve the MAC layer performance under the challenge of sensing errors. In this context, the proposed model examined two sensing error probabilities: the false alarm probability and the missed detection probability. The simulation results have shown that both probabilities could be adapted to maintain the false alarm probability at certain values to achieve good results. Finally, in this thesis, a cooperative sensing scheme with interference mitigation for Cognitive Wireless Mesh Networks (CogMesh) has been proposed. Moreover, a prioritybased traffic scenario to analyze the problem of packet delay and a novel technique for dynamic channel allocation in CogMesh is presented. Considering each channel in the system as a sub-server, the average delay of the users' packets is reduced and the cooperative sensing scenario dramatically increases the network throughput 50% more as the number of arrival rate is increased.
44
Srinivasan, Vikram. "Energy efficient protocols for wireless ad hoc networks /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2003. http://wwwlib.umi.com/cr/ucsd/fullcit?p3091327.
Full text
45
Wang, Kang. "Energy-efficient protocols for wireless ad hoc networks /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2004. http://wwwlib.umi.com/cr/ucsd/fullcit?p3144325.
Full text
46
Abdelshafy, Abdallah Mohamed Ahmed. "Securing routing protocols in mobile ad hoc networks." Thesis, Heriot-Watt University, 2016. http://hdl.handle.net/10399/3206.
Full textAbstract:
A Mobile Ad Hoc Network (MANET) is more prone to security threats than other wired and wireless networks because of the distributed nature of the network. Conventional MANET routing protocols assume that all nodes cooperate without maliciously disrupting the operation of the protocol and do not provide defence against attackers. Blackhole and flooding attacks have a dramatic negative impact while grayhole and selfish attacks have a little negative impact on the performance of MANET routing protocols. Malicious nodes or misbehaviour actions detection in the network is an important task to maintain the proper routing protocol operation. Current solutions cannot guarantee the true classification of nodes because the cooperative nature of the MANETs which leads to false exclusions of innocent nodes and/or good classification of malicious nodes. The thesis introduces a new concept of Self- Protocol Trustiness (SPT) to discover malicious nodes with a very high trustiness ratio of a node classification. Designing and implementing new mechanisms that can resist flooding and blackhole attacks which have high negative impacts on the performance of these reactive protocols is the main objective of the thesis. The design of these mechanisms is based on SPT concept to ensure the high trustiness ratio of node classification. In addition, they neither incorporate the use of cryptographic algorithms nor depend on routing packet formats which make these solutions robust and reliable, and simplify their implementations in different MANET reactive protocols. Anti-Flooding (AF) mechanism is designed to resist flooding attacks which relies on locally applied timers and thresholds to classify nodes as malicious. Although AF mechanism succeeded in discovering malicious nodes within a small time, it has a number of thresholds that enable attacker to subvert the algorithm and cannot guarantee that the excluded nodes are genuine malicious nodes which was the motivation to develop this algorithm. On the other hand, Flooding Attack Resisting Mechanism (FARM) is designed to close the security gaps and overcome the drawbacks of AF mechanism. It succeeded in detecting and excluding more than 80% of flooding nodes within the simulation time with a very high trustiness ratio. Anti-Blackhole (AB) mechanism is designed to resist blackhole attacks and relies on a single threshold. The algorithm guarantees 100% exclusion of blackhole nodes and does not exclude any innocent node that may forward a reply packet. Although AB mechanism succeeded in discovering malicious nodes within a small time, the only suggested threshold enables an attacker to subvert the algorithm which was the motivation to develop it. On the other hand, Blackhole Resisting Mechanism (BRM) has the main advantages of AB mechanism while it is designed to close the security gaps and overcome the drawbacks of AB mechanism. It succeeded in detecting and excluding the vast majority of blackhole nodes within the simulation time.
47
Al, Hanbali Ahmad. "Evaluation des peformances des reseaux sans-fil mobiles." Phd thesis, Université de Nice Sophia-Antipolis, 2006. http://tel.archives-ouvertes.fr/tel-00327868.
Full textAbstract:
Cette thèse s'intéresse à l'impact de la mobilité sur les performances des réseaux ad hoc mobiles (MANETs en anglais). Elle comporte deux parties. La première partie de la thèse dresse un état de l'art du protocole TCP dans MANETs. La principale conclusion est que la mobilité dégrade les performances de TCP, à cause de problèmes de routage et de partitions du réseau qu'elle occasionne. Partant de ce constat, nous proposons et analysons dans la deuxième partie de la thèse des schémas de transmission qui s'appuient sur la mobilité. Plus précisément, chaque noeud peut servir de relais en l'absence de route directe entre la source et la destination. Nous nous sommes tout d'abord intéressés aux performances des noeuds relais (débit et taille moyenne des files) en utilisant le formalisme des files d'attente.<br />Un des résultats principaux est que le débit des noeuds relais est minimisé quand les noeuds bougent selon des modèles de mouvements aléatoires qui ont une distribution stationnaire uniforme de position. Pour optimiser les performances du protocole de relais à deux sauts, particulièrement le délai de transmission, nous avons ensuite étudié le cas où un paquet peut avoir plusieurs copies dans le réseau, sous l'hypothèse où ces copies ont des durées de vie limitées. Les performances (délai, énergie consommée) ont été obtenu en utilisant le formalisme des chaînes de Markov absorbantes, ainsi que des modèles fluides. Nous avons appliqué nos résultats pour optimiser la consommation d'énergie en présence de contraintes sur les délais.
48
Varmus, Pavol. "Analýza vehicular ad hoc sítě." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-400927.
Full textAbstract:
This diploma thesis aims to study VANET (vehicular ad hoc network), to describe the theory of this networks and describe attributes of these networks and to set the starting point for practical part. Thesis includes VANETs possibilities, its signal transportation and description of routing protocols. Another goal was to familiarize program NS-3 and set up simulation models in its interface. The main output of the practical part is program which simulates vehicle movement in Brno city and set the communication module which is adapted to fulfill the most realistic transmission capabilities. Practical part is divided to two parts. The goal of the first one was to simulate basic communication in theorized unrealistic scenario and the second part was the more realistic scenario. Overall, throughout the practical part was tested a variety of attributes, such as mobility models, standards, routing protocols and other parameters that provided diversity in final results. All the results, which consisted of summary of basic transmission capabilities and reclassification of the applicability of those technologies in real world, are discussed in the summary of the simulations output.
49
Sundaresan, Karthikeyan. "Network Protocols for Ad-Hoc Networks with Smart Antennas." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14122.
Full textAbstract:
Multi-hop wireless networks or ad-hoc networks
face several limiting characteristics that make it difficult to support a multitude of applications. It is in this context that we find smart antennas to find significant applications in these networks, owing to their ability to alleviate most
of these limitations. The focus of my research is thus to investigate the use of smart antennas in ad-hoc networks and hence efficiently design network protocols that best leverage their capabilities in communication. There are two parts to the proposed objective of designing efficient network protocols that pertain to the nature of the smart antenna network considered, namely, homogeneous and heterogeneous smart antenna networks.
Unlike heterogeneous smart antenna networks, where different devices in the network employ different antenna technologies, homogeneous smart antenna networks consist of devices employing the same antenna technology. Further, in homogeneous smart antenna networks, different antenna technologies operating in different strategies tend to perform the best in different network architectures, conditions and application requirements. This
motivates the need for developing a {em unified} framework for designing efficient communication (medium access control and routing) protocols for homogeneous smart antenna networks in general. With the objective of designing such a unified framework, we start by designing efficient MAC and routing protocols for the most sophisticated of the smart antenna technologies, namely multiple-input multiple-output (MIMO) links. The capabilities of MIMO links form a super-set of those possible with other antenna technologies. Hence, the insights gained from the design of
communication protocols for MIMO links are then used to develop unified MAC and routing frameworks for smart antennas in general.
For heterogeneous smart antenna networks, we develop theoretical performance bounds by studying the impact of increasing degree of heterogeneity on network throughput performance. Given that the
antenna technologies are already unified in the network, unified solutions are not required. However, we do develop efficient MAC and routing protocols to best leverage the available heterogeneous capabilities present in the network. We also design efficient cooperation strategies that will further help the communication protocols in exploiting the available heterogeneous capabilities in the network to the best possible extent.
50
Ding, Jin. "Communication protocols for wireless ad-hoc and sensor networks." Online access for everyone, 2006. http://www.dissertations.wsu.edu/Dissertations/Spring2006/j%5Fding%5F050306.pdf.
Full text