Готові списки джерел за темами / Multi-hop routing protocol

Добірка наукової літератури з теми "Multi-hop routing protocol"

Автор: Grafiati
Опубліковано: 26 серпня 2022
Оновлено: 18 вересня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Multi-hop routing protocol".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Зміст

  1. Статті в журналах
  2. Дисертації
  3. Частини книг
  4. Тези доповідей конференцій
  5. Звіти організацій

Статті в журналах з теми "Multi-hop routing protocol":

1

Yin, Min, Quan Yu, and Yao Tang. "Military multi-hop routing protocol." Journal of Electronics (China) 23, no. 3 (May 2006): 444–48. http://dx.doi.org/10.1007/s11767-005-0190-y.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Chen, Zhansheng, and Hong Shen. "A grid-based reliable multi-hop routing protocol for energy-efficient wireless sensor networks." International Journal of Distributed Sensor Networks 14, no. 3 (March 2018): 155014771876596. http://dx.doi.org/10.1177/1550147718765962.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Due to the limited energy and the non-equivalence of wireless sensor network nodes, it is imperative to reduce and rationally use the energy consumption of the nodes to prolong the network lifetime. Clustering routing algorithm can address the problem efficiently. In this article, a grid-based reliable multi-hop routing approach for wireless sensor networks is proposed. In order to minimize and balance the energy consumption, our proposed protocol, grid-based reliable multi-hop routing protocol, optimizes the cluster head election process by combining individual ability which consists of node’s residual energy and node’s location, and local cognition which can balance energy consumption among clusters via a consultative mechanism based on cluster head’s lifetime expectancy, while considering data forwarding delay and reliable transmission of data. Simulation results show that grid-based reliable multi-hop routing protocol has improved stability period as compared to other protocols. Meanwhile, grid-based reliable multi-hop routing protocol has better performance in energy efficiency, data forwarding delay, and reliable transmission of data.
3

Peng, Ya Li, Peng Yu, and Hong Yin. "The Efficient and Reliable Routing Protocol of Bus Mobility Vehicle Network." Applied Mechanics and Materials 587-589 (July 2014): 2072–75. http://dx.doi.org/10.4028/www.scientific.net/amm.587-589.2072.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
As an important part of the urban vehicle network, Bus Mobility Vehicle Network provides supports for a wide range of urban-vehicle communication network due to cyclical movement feature. However, the high-speed mobility brings great challenges to Bus Vehicle Network routing protocols. The paper aims Bus Mobility Vehicle Network with the characteristics of cyclical movement, and put forward to Single & Multi hop Routing (SMHR) routing protocol program. Link Survival Mode will be established in Single-hop to select encounter nodes as forwarding candidate set. Discrete Stochastic Dynamic Programming Delay Probability Model will be established in Multi-hop using the historical data of bus cyclical movement. The two model ensure the submitted data reliable in single-hop, and probability of successfully submitted to the target vehicle through multi-hop data within a limited delay. According to the simulation test, SMHR protocol has a higher successful rate of data transmission and lower submitted delays.
4

Guo, Xin, and Fei Qi Deng. "An Uniform Cluster-Based Routing Protocol for Wireless Sensor Networks." Advanced Materials Research 433-440 (January 2012): 3608–13. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.3608.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
The purpose of routing protocol is to achieve efficient data collection by making use of the limited resource in wireless sensor networks, which prolongs the lifetime of networks. Energy efficiency of the single hop or multi-hop communication mode is researched taking the uneven energy consumption caused by solely single hop or multi-hop mode into account. A hybrid communication mode in which nodes alternate between single hop and multi-hop mode with certain time proposed based on even cluster protocol. The simulation result verifies that hybrid mode provides the better energy efficiency as well as evener energy dissipation.
5

Ateya, Abdelhamied A., Ammar Muthanna, Irina Gudkova, Yuliya Gaidamaka, and Abeer D. Algarni. "Latency and energy-efficient multi-hop routing protocol for unmanned aerial vehicle networks." International Journal of Distributed Sensor Networks 15, no. 8 (August 2019): 155014771986639. http://dx.doi.org/10.1177/1550147719866392.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Unmanned aerial vehicle is one of the main announced use cases of 5G/IMT2020, which is expected to have various applications in many fields. These devices have limited capabilities in terms of energy and processing. Due to the complex structure of unmanned aerial vehicle networks and the high mobility constraints, design of efficient routing protocol, for supporting such network, is a challenge. Thus, efficient routing of data among unmanned aerial vehicles between source and destination is an important issue in designing unmanned aerial vehicle networks. Proactive routing protocols are one of the main categories of routing protocols developed for mobile ad hoc networks and vehicular ad hoc networks. Optimized link state routing protocol is one of the most common proactive routing protocols that has been modified to support unmanned aerial vehicle networks, considering high mobility feature of the network. In this work, we propose a latency and energy-efficient proactive routing protocol for dense unmanned aerial vehicle networks, with high-density devices, based on optimized link state routing protocol algorithm, referred to as multi-objective optimized link state routing protocol. The proposed routing protocol is topology aware and can be used for low-latency and high-mobility applications. The proposed multi-objective optimized link state routing protocol routing algorithm considers all modified versions of optimized link state routing protocol and introduces a novel method for selecting multipoint relay nodes that considers the traffic load on the communication channel and the load on each unmanned aerial vehicle node. Moreover, the proposed algorithm considers the communication link stability and the energy constraints. The system is simulated over a reliable environment for various scenarios, and it is compared to the original optimized link state routing protocol and its modified versions. Simulation results indicate that the proposed protocol achieves higher efficiency in terms of latency, energy, and reliability.
6

Al-mahdi, Hassan, and Yasser Fouad. "Design and analysis of routing protocol for cognitive radio ad hoc networks in Heterogeneous Environment." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 1 (February 1, 2019): 341. http://dx.doi.org/10.11591/ijece.v9i1.pp341-351.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
7

Peng, Ya Li, Hong Yin, and Peng Yu. "The Research of Bus VANET Protocol on Signal Attenuation and Delay Probability of Multi-Hop Forwarding." Advanced Materials Research 1030-1032 (September 2014): 1841–45. http://dx.doi.org/10.4028/www.scientific.net/amr.1030-1032.1841.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Aims to the routing protocol of Bus Vehicle Network with the characteristics of cyclical movement, we put forward to the Signal-Single & Multi hop Routing (SSMHR) routing protocol, which can solve the problem of the signal attenuation on urban environment and uncertain next hop forwarding on multi-hop. Link Survival Mode considering the signal attenuation will be established in Single-hop to select encounter nodes as forwarding candidate set. Discrete Stochastic Dynamic Programming Delay Probability Model will be established in Multi-hop using the historical data of bus cyclical movement. The two models ensure the submitted data reliable in single-hop, and probability of successfully submitted to the target vehicle through multi-hop within a limited delay. According to the simulation test, SSMHR protocol has a higher successful rate of data transmission and lower submitted delays.
8

Tahir, Sabeen, Ghadah Abdullah Aldabbagh, Sheikh Tahir Bakhsh, and Abass Md Said. "Hybrid Congestion Sharing and Route Repairing Protocol for Bluetooth Networks." WSEAS TRANSACTIONS ON COMPUTERS 20 (April 27, 2021): 49–55. http://dx.doi.org/10.37394/23205.2021.20.6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Bluetooth is a widespread wireless technology standard for limited wireless networks that permits Bluetooth devices to create a one-hop (piconet) or multi-hop (scatternet) network. During data transmission, a large number of links passing through a single master or bridge device may create congestion problems in a Bluetooth network. Therefore, routing in a multi-hop dynamic Bluetooth network, where a number of routing masters and routing bridges exist, sometimes create technical problems in a scatternet. Mobility and failure of routing devices disconnects the routing links and link reconstruction process consumes more resources that eventually decrease the performance. In this paper, Hybrid Congestion Sharing and Route Repairing protocol for Bluetooth networks” (HCSRR) is proposed. The objective of this paper is to provide an efficient technique for scatternet congestion avoidance and route maintenance. The proposed protocol is implemented and compared with most relevant protocols. From simulation results, it is observed that the HCSRR outperforms the existing protocols.
9

Jin, Rencheng, Xiaolei Fan, and Ting Sun. "Centralized Multi-Hop Routing Based on Multi-Start Minimum Spanning Forest Algorithm in the Wireless Sensor Networks." Sensors 21, no. 5 (March 4, 2021): 1775. http://dx.doi.org/10.3390/s21051775.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Wireless sensor networks (WSNs) are widely applied in environmental monitoring, target tracking, military, and industrial fields. However, the battery energy of sensor nodes in WSNs is limited, which limits its development. Previous studies have shown that clustering protocols and multi-hop communication are beneficial to reduce nodes energy consumption. The multi-hop protocol based on low energy adaptive clustering hierarchy (LEACH) has been proven to significantly reduce energy dissipation. However, LEACH-based multi-hop protocols generally have the problem of unbalanced energy dissipation and data conflicts. In this paper, we propose a centralized multi-hop routing based on multi-start minimum spanning forest (LEACH-CMF) to optimize LEACH. In order to realize multi-hop communication, we introduced a multi-start minimum spanning tree algorithm to select relay nodes with the minimum relay cost and generate appropriate multi-hop paths. To avoid data collision in multi-hop communication and make nodes including the cluster heads sleep as much as possible in the non-working state, we design a bottom-up continuous time slot allocation method to improve the time division multiple access (TDMA) cycle. We performed simulation in NS2. The simulation results show that the network lifetime is approximately doubled compared to LEACH and centralized low energy adaptive clustering hierarchy (LEACH-C). The simulation results show that the proposed protocol can effectively balance the energy dissipation of nodes and prolong network lifetime.
10

Cengiz, Korhan, and Tamer Dag. "Energy Aware Multi-Hop Routing Protocol for WSNs." IEEE Access 6 (2018): 2622–33. http://dx.doi.org/10.1109/access.2017.2784542.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел
Також вас можуть зацікавити розширені добірки на тему "Multi-hop routing protocol" для конкретних типів джерел:
Статті в журналах Дисертації

Дисертації з теми "Multi-hop routing protocol":

1

Chen, Quanjun Computer Science &amp Engineering Faculty of Engineering UNSW. "Analysis and application of hop count in multi-hop wireless ad-hoc networks." Awarded By:University of New South Wales. Computer Science & Engineering, 2009. http://handle.unsw.edu.au/1959.4/44769.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Hop count, i.e., the number of wireless hops a packet has to go through to reach the destination, is a fundamental metric in multi-hop wireless ad-hoc networks. Network performance, such as throughput, end-to-end delay, energy consumption, and so on, depends critically on hop count. Previous work on modeling hop count is limited in making unrealistic simplifying assumptions either at the physical or network, or both layers of the communication protocol stack. A key contribution of this thesis is to present an analytical model to derive the probability distribution of hop count under realistic assumptions at both physical and network layers. Specifically, the model considers a log-normal shadowing radio propagation capable of accommodating the random signal fading observed in most wireless communication environments, and the widely used geographic routing at the network layer. Validation of the model is achieved by a comprehensive set of simulation experiments including a trace driven simulation of a real-word vehicular ad-hoc network. The model reveals that the presence of randomness in radio propagation reduces the required number of hops to reach a given destination significantly. To demonstrate the utility of the proposed hop count model, the thesis proposes three new applications which address some of the key challenges in multi-hop wireless networks. The first application derives the per-node packet forwarding load in multi-hop wireless sensor networks and reveals that the nodes in the vicinity of the base station has a significantly less forwarding load than previously thought under simplifying radio propagation and routing assumptions. The second application demonstrates that using hop count as a measure of distance traveled by a data packet, geocasting can be achieved in multi-hop wireless networks in situations when some of the network nodes do not have access to reliable location information. Finally, the proposed hop count model is used to evaluate the performance of the third application which demonstrates that the overhead of geographic routing can be reduced significantly by embracing a position update philosophy which adapts to the mobility and communication patterns of the underlying ad-hoc network.
2

He, Chengxuan. "Performance evaluation of multicast routing protocol in WiMAX multi-hop relay environment." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27591.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Multicast/Broadcast Service (MBS) in WiMAX refers to the ability of the WiMAX network to provide flexible and efficient mechanisms to send common content to multiple users who are sharing radio resources. WiMAX multi-hop relay technology is a key enabler to expand WiMAX infrastructure to eliminate blind spots in coverage and to enhance user throughput with a lower capital expenditure and operational expenditure. To support MBS in a WiMAX multi-hop relay network, one must consider several design issues such as the dynamic relay topology discovery in response to the mobility of the relay station, the dynamic group membership management, the service activation due to join/leave operations of MBS users, the radio resource allocation and the connection management to support these dynamic behaviors. This thesis studies and develops a WiMAX relay architecture, its relay protocol and the optimal multicast algorithms to solve the above issues. To resolve the above-mentioned issues, we have created a model for our multi-hop WiMAX relay architectures. This model incorporates an inter-layer protocol design that would allow the IP layer to use its IGMP/PIM snooping capability together with WiMAX MAC layer relay protocols. Among the MBS server, the WiMAX BS (Base Station) and the MS (Mobile Station), we adopted existing IETF protocols (including IGMP and PIM) to implement some common multicast procedures at the networks layer in order to provision MBS service. To support dynamic formation of a relay network topology, we have proposed and implemented a BS-oriented source-routing protocol to automatically discover the relay path. Finally, we have implemented our MBS in an OPNET simulator, and verified their operations. We have also evaluated the performance of the video and voice applications in WiMAX relay networks under different network sizes, and discussed their performances. The performance results demonstrate the Point to Multi-Point characteristic of WiMAX.
3

Lee, Young-Jun. "Routing and Efficient Evaluation Techniques for Multi-hop Mobile Wireless Networks." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7455.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
In this dissertation, routing protocols, load-balancing protocols, and efficient evaluation techniques for multi-hop mobile wireless networks are explored. With the advancements made in wireless communication and computer technologies, a new type of mobile wireless network, known as a mobile ad hoc network (MANET), has drawn constant attention. In recent years, several routing protocols for MANETs have been proposed. However, there still remains the need for mechanisms for better scalability support with respect to network size, traffic volume, and mobility. To address this issue, a new method for multi-hop routing in MANETs called Dynamic NIx-Vector Routing (DNVR) is proposed. DNVR has several distinct features compared to other existing on-demand routing protocols, which lead to more stable routes and better scalability. Currently, ad hoc routing protocols lack load-balancing capabilities. Therefore they often fail to provide good service quality, especially in the presence of a large volume of network traffic since the network load concentrates on some nodes, resulting in a highly congested environment. To address this issue, a novel load-balancing technique for ad hoc on-demand routing protocols is proposed. The new method is simple but very effective in achieving load balance and congestion alleviation. In addition, it operates in a completely distributed fashion. To evaluate and verify wireless network protocols effectively, especially to test their scalability properties, scalable and efficient network simulation methods are required. Usually simulation of such large-scale wireless networks needs a long execution time and requires a large amount of computing resources such as powerful CPUs and memory. Traditionally, to cope with this problem, parallel network simulation techniques with parallel computing capabilities have been considered. This dissertation explores a different type of method, which is efficient and can be achieved with a sequential simulation, as well as a parallel and distributed technique for large-scale mobile wireless networks.
4

Mortada, Mohamad Rida. "Multi-hop routing for cognitive radio sensor network." Thesis, Brest, École nationale supérieure de techniques avancées Bretagne, 2021. http://www.theses.fr/2021ENTA0010.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Le réseau de capteurs sans fil (WSN) se compose d'un grand nombre de minuscules dispositifs appelés nœuds, et ces nœuds sont généralement limités en puissance et ils sont déployés de manière aléatoire dans une zone géographique à des fins de surveillance. En raison du grand nombre de nœuds dans le WSN, leur demande en ressources de fréquence devient un véritable défi en raison de la rareté du spectre. La radio cognitive (CR) a été introduite pour améliorer l'efficacité spectrale. La CR classe les utilisateurs entre l'utilisateur principal (PU) qui détient une licence sur une bande passante du spectre et l'utilisateur secondaire (SU), c'est-à-dire un utilisateur opportuniste. L'intégration de CR dans WSN se traduit par un réseau de capteurs radio cognitifs (CRSN). Dans le CRSN, les nœuds se comportent comme des SU. Cependant, l'adoption du CRSN peut être confrontée à plusieurs défis. En effet, les nœuds du réseau peuvent arrêter de transmettre pour éviter toute interférence nuisible pour PU. De plus, la contrainte de consommation d'énergie doit être respectée. D'autres fonctionnalités peuvent être affectées par l'adoption du CRSN, telles que le processus de regroupement et l'agrégation de données dans le réseau, en particulier dans un CRSN basé sur un routage multi-sauts. Dans ce manuscrit, nous abordons les défis du CRSN à différents niveaux. Premièrement, le regroupement des nœuds améliore l'efficacité du réseau. En pratique, le regroupement des nœuds du réseau permet d'économiser de l'énergie lors de la transmission des données. Ainsi, nous étudions le nombre optimal de clusters dans le réseau en fonction de la consommation d'énergie lors de la transmission de données et de la détection du spectre pour prolonger la durée de vie du réseau. Ensuite, nous présentons LIBRO, un nouveau protocole de routage multi-sauts montant basé sur les informations de localisation géographique. LIBRO assure la livraison de paquets de données rectifiés dans des réseaux denses sans connaissance de la topologie ou des nœuds de chemin. Enfin, nous avons utilisé LIBRO et la technique de récupération d'énergie pour prolonger la durée de vie du CRSN. Ainsi, en résolvant un problème d'optimisation joignant la probabilité de collision, la consommation d'énergie, le délai de livraison des paquets et le taux de livraison des paquets, les paramètres appropriés sont trouvés. [Google traduction]
The Wireless Sensor Network (WSN) consists of a large number of tiny devices called nodes, and these nodes are generally limited in power and they are randomly deployed in a geographical area for monitoring purpose. Because of the large number of nodes in the WSN, their demand on the frequency resources becomes a real challenge due to the spectrum scarcity. Cognitive Radio (CR) was introduced to enhance the spectral efficiency. The CR classifies users into the Primary User (PU) that holds a license over a spectrum bandwidth, and the Secondary User (SU), i.e., an opportunistic user. The integration of CR into WSN results in a cognitive radio sensor network (CRSN). In CRSN, the nodes behave as SUs. However,the adoption of CRSN may face several challenges. Indeed, network nodes may stop transmitting to avoid any harmful interference for PU. In addition, energy consumption constraint should be respected. Other features may be impacted by the adoption of CRSN, such as the clustering process and the in-network data aggregation, especially in a multi-hop routing based CRSN. In this manuscript, we tackle the challenges of the CRSN from different levels. Firstly, clustering nodes enhances network efficiency. In practice, grouping the network nodes saves energy during data transmission. Thus, we investigate the optimal number of clusters in the network based on energy consumption during data transmission and spectrum sensing to extend network lifespan. Then, we present LIBRO, a new uplink multi-hop routing protocol based on the geographical location information. LIBRO ensures delivery of rectified data packets in dense networks without knowledge of topology or path nodes. Finally, we used LIBRO and the energy harvesting technique to extend the CRSN's lifespan. Thus, by solving an optimization problem jointing the collision probability, energy consumption, packet delivery delay and packet delivery ratio, the appropriate parameters are found
5

Bonifácio, Tatiana Giorgenon. "Implementação de um protocolo mesh multi-hop baseado em algoritmo de roteamento geográfico para redes de sensores sem fio." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/18/18153/tde-04032011-150720/.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
As tecnologias de redes sem fio passaram a atender não só às aplicações corporativas mais sofisticadas como também àquelas envolvendo desde o rastreamento de animais, monitoramento de estruturas e automação industrial até o gerenciamento de utilidades urbanas. Este projeto de pesquisa aborda o desenvolvimento de um protocolo de rede mesh multi-hop segundo a especificação IEEE 802.15.4, com o uso de coordenadas geográficas de cada nó para o roteamento de dados em aplicações de iluminação pública. Para o desenvolvimento do protocolo de rede, é considerada a biblioteca de rotinas de interface de rede denominada Simple MAC (SMAC). Tal biblioteca pode ser utilizada para a elaboração do protocolo de roteamento geográfico destinado à rede mesh multi-hop. Paralelamente, propõe-se a descrição de um método a ser adotado para a inserção do protocolo de roteamento geográfico no SMAC. Os códigos, desenvolvidos em linguagem de programação C, são portados para a plataforma de desenvolvimento dos nós de comunicação de um toolkit específico e submetidos a ensaios experimentais. Os resultados englobam a geração de conhecimento teórico e prático a respeito das redes de sensores sem fio, bem como o desenvolvimento de um software aberto para este tipo de rede. As propriedades de auto-organização da rede, robustez e baixa latência são comprovadas nos ensaios experimentais.
The technologies of wireless networks have to serve not only the most sophisticated business applications but also those that involve the tracking of animals, monitoring of structures, industrial automation and the management of urban utilities. This research project addresses the development of a protocol for multi-hop mesh network according to IEEE 802.15.4, with the use of geographical coordinates of each node for routing data in applications such as street lighting. In order to develop the network protocol, the routines library of the network interface, called Simple MAC (SMAC), is considered. This library can be used for establishing the geographic routing protocol destined for the multi-hop mesh network. In parallel it is proposed to describe a method to be adopted for the inclusion of geographic routing protocol in SMAC. The codes, developed in C programming language, are ported to the development platform of communication nodes of a specific toolkit and subjected to experimental tests. The results include the generation of theoretical and practical knowledge regarding the wireless sensor networks, as well as the development of open software for this type of network. The properties of self-organization of the network, robustness and low latency are proven in experimental tests.
6

Zubow, Anatolij. "Kooperatives Forwarding in drahtlosen Maschennetzen." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2009. http://dx.doi.org/10.18452/15957.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
In der vorliegenden Arbeit werden praktische Protokolle für spontane drahtlose Multi-Hop Maschennetze vorgestellt, diese betrachten das drahtlose System ganzheitlich und berücksichtigen damit die Besonderheiten des drahtlosen Mediums, wie Fading, Interferenz sowie starke Signaldämpfung aufgrund von Entfernung bzw. Hindernissen. Interferenz ist eine Hauptursache für Paketverlust, Durchsatz und Latenz können durch die gleichzeitige Verwendung mehrerer interferenzfreier Kanäle verbessert werden. In Sensor- bzw. Community-Netzen kommt preiswerte und energiesparende Hardware zum Einsatz, die Verwendung zusätzlicher Antennen bzw. Radios ist deshalb nicht möglich. Andererseits werden aber zukünftige drahtlose Netze eine 100-mal höhere Knotendichte, verglichen mit heutigen Netzen, zeigen. Durch die Ausnutzung der im System inhärent vorliegenden Ressource Nutzer (Multi-User Diversität) werden durch Kooperation virtuelle Multi-Antennen und Multi-Radiosysteme aufgebaut. Aufgrund des großen Abstands zwischen den Knoten erreicht man erstens eine hohe räumliche Diversität und zweitens lassen sich damit auch negative Effekte, wie Interferenz zwischen benachbarten Kanälen, minimieren. Es werden Algorithmen sowohl für die Mediumzugriff- als auch die Routing-Schicht vorgestellt. Da keine spezielle physikalische Schicht notwendig ist, kann IEEE 802.11 verwendet werden. Schließlich kann auch auf die bereits heute verfügbare IEEE 802.11 Hardware, die nur eine Kanalumschaltzeit im Millisekundenbereich erlaubt, zurückgegriffen werden. Die zwei vorgestellten Protokolle eignen sich für Umgebungen mit hoher bzw. geringer Interferenz durch fremde WiFi-Netze. Bezüglich Durchsatz werden moderne Protokolle, wie DSR auf Basis von IEEE 802.11 und ETX-Metrik, um ein Vielfaches übertroffen, außerdem ist die Latenz klein und das TCP/IP-Protokoll kann unverändert verwendet werden.
In this work practical protocols are introduced for spontaneous wireless multi-hop mesh networks which contemplate the wireless system integrally and therefore take into account particular features of the wireless medium, like fading, interference as well as strong signal attenuation due to distance or obstacles. Interference is one of the main causes for packet loss. Throughput and latency can be improved by the simultaneous use of several non-interfering channels. In sensor or community networks inexpensive and energy-saving hardware is used. Additional antennas or radios are impossible therefore; on the other hand future wireless networks will show a 100 times higher node density in comparison with today''s networks, however. By the usage of the resource user (multi-user diversity), that is inherently present in the system virtual multi-antennas and multi-radio systems can be built up by cooperation. Firstly, a high spatial diversity can be achieved due to the large distance between the nodes and secondly, negative effects like interference can be minimized between neighboring channels. Algorithms are introduced both for medium access and routing layer. Since a special physical layer is not required IEEE 802.11 can be used. These days already available 802.11 hardware, which allows a channel switching time in milliseconds, is finally usable. The two protocols introduced here are suitable for environments with a high or low interference caused by foreign WiFi networks. Regarding their performance modern protocols like DSR based on 802.11 and ETX metric are surpassed by far. Moreover, the latency is small and the TCP/IP protocol can be used in its unchanged form.
7

Rajendran, Rajapandiyan. "The Evaluation of GeoNetworking Forwarding in Vehicular Ad-Hoc Networks." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-23982.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
In Intelligent Transportation Systems (ITS), disseminating warning messages in a timely and efficient way through wireless short-range communications can save many lives and reduce traffic congestion. A geographical broadcast protocol provides data delivery to specified geographical areas, using multi-hop communications if needed. Among the main challenges for such protocols are forwarder selection and the reduction of the number of hops required to reach and cover the destination area.  In this thesis we propose an efficient geographical broadcast protocol called Preferred and Contention Based Forwarding (PCBF) and evaluate it through simulations. PCBF uses a combination of contention-based forwarding and selecting preferred forwarders also found in other protocols like Emergency Message Dissemination for Vehicular Environments (EMDV). Since the preferred forwarder is allowed to immediately forward the packet (evading contention among other potential forwarders), this approach reduces end-to-end delays. Notable extensions of PCBF compared to EMDV are the use of direct negative acknowledgements in case of unnecessary rebroadcasts and the use of forwarders outside the target region.  Our simulation results show that the PCBF protocol outperforms selected other protocols in terms of end-to-end delay, re-broadcast overhead and reliability in both sparse and dense networks.
8

Kondareddy, Yogesh Reddy Agrawal Prathima. "MAC and routing protocols for multi-hop cognitive radio networks." Auburn, Ala, 2008. http://repo.lib.auburn.edu/EtdRoot/2008/SUMMER/Electrical_and_Computer_Engineering/Thesis/Kondareddy_Yogesh_18.pdf.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Djahel, Soufiene. "Secure routing and medium access protocols in wireless multi-hop networks." Thesis, Lille 1, 2010. http://www.theses.fr/2010LIL10094/document.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Récemment, les comportements malveillants dans les réseaux sans fil multi-sauts ont attiré l’attention de la communauté scientifique. La prolifération rapide du nombre de dispositifs sans fil ainsi que la diversification des applications basées sur ces réseaux ont grandement contribué à l’amélioration de la qualité de vie ainsi que la modernisation de la société. Cependant, la nécessité de sécuri ser ces réseaux et de garantir la robustesse de leurs services est devenue une préoccupation majeure. En effet, les caractéristiques spécifiques de ces réseaux, telles que l’absence d’infrastructure et l’absence d’une entité centrale de confiance, font que les réponses à leurs problèmes de sécurité sont tout à fait différentes de celles des réseaux filaires. De plus, le manque de confiance entre les nœuds rend ces problèmes encore plus critiques. L’objectif de cette thèse vise à contribuer au renforcement de la sécurité dans les réseaux sans fil multi-sauts. Elle se focalise sur l’étude des comportements malveillants au niveau des couches MAC et réseau. Nous nous intéressons au développement de nouvelles solutions pour faire face à l’attaque du trou noir ”Black hole” dans le contexte du protocole OLSR, ainsi qu’analyser le comportement des nœuds cupides ”Greedy” au niveau de la couche MAC, dans toutes ses versions.Une attaque de trou noir peut être menée suivant deux scénarios. Le premier scénario consiste à lancer l’attaque, exclusivement, au niveau de la couche réseau. Le second scénario consiste en une attaque multi-couches. Dans le cadre de cette thèse, nous analysons l’impact de ces deux types d’attaques et proposons des contre-mesures appropriées. Au niveau de la couche MAC, nous étudions particulièrement le comportement cupide adaptatif dans le cadre des réseaux sans fil maillés et nous proposons une solution originale baptisée, FLSAC, afin de prévenir ce type de menace. Dans le cadre des réseaux mobiles ad hoc (MANETs), nous définissons un nouveau modèle de comportement des nœuds cupides. Nous développons aussi un nouvel algorithme de backoff, dont l’avantage principal est d’assurer une détection rapide des nœuds cupides non conformes aux spécifications du protocole IEEE802.11. Cet algorithme offre un mécanisme de réaction qui incite un nœud cupide à se comporter correctement en lui donnant la chance de se repentir après détection
While the rapid proliferation of mobile devices along with the tremendous growth of various applications using wireless multi-hop networks have significantly facilitate our human life, securing and ensuring high quality services of these networks are still a primary concern. In particular, anomalous protocol operation in wireless multi-hop networks has recently received considerable attention in the research community. These relevant security issues are fundamentally different from those of wireline networks due to the special characteristics of wireless multi-hop networks, such as the limited energy resources and the lack of centralized control. These issues are extremely hard to cope with due to the absence of trust relationships between the nodes.To enhance security in wireless multi-hop networks, this dissertation addresses both MAC and routing layers misbehaviors issues, with main focuses on thwarting black hole attack in proactive routing protocols like OLSR, and greedy behavior in IEEE 802.11 MAC protocol. Our contributions are briefly summarized as follows. As for black hole attack, we analyze two types of attack scenarios: one is launched at routing layer, and the other is cross layer. We then provide comprehensive analysis on the consequences of this attack and propose effective countermeasures. As for MAC layer misbehavior, we particularly study the adaptive greedy behavior in the context of Wireless Mesh Networks (WMNs) and propose FLSAC (Fuzzy Logic based scheme to Struggle against Adaptive Cheaters) to cope with it. A new characterization of the greedy behavior in Mobile Ad Hoc Networks (MANETs) is also introduced. Finally, we design a new backoff scheme to quickly detect the greedy nodes that do not comply with IEEE 802.11 MAC protocol, together with a reaction scheme that encourages the greedy nodes to become honest rather than punishing them
10

Guercin, Sergio Rolando. "Performance Evaluation of Opportunistic Routing Protocols for Multi-hop Wireless Networks." Thesis, Université d'Ottawa / University of Ottawa, 2019. http://hdl.handle.net/10393/38904.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Nowadays, Opportunistic Routing (OR) is widely considered to be the most important paradigm for Multi-hop wireless networks (MWNs). It exploits the broadcast nature of wireless medium to propagate information from one point to another within the network. In OR scheme, when a node has new information to share, it rst needs to set its forwarding list which include the IDs and/or any relevant information to its best suited neighboring nodes. This operation is supported by the use of appropriate metrics. Then, it executes a coordination algorithm allowing transmission reliability and high throughput among the next-hop forwarders. In this paper, we provide a comprehensive guide to understand the characteristics and challenges faced in the area of opportunistic routing protocols in MWNs. Moreover, since the planet we live on is largely covered by water, OR protocols have gained much attention during the last decade in real-time aquatic applications, such as oil/chemical spill monitoring, ocean resource management, anti-submarine missions and so on. One of the major problems in Underwater Wireless Sensor Network (UWSNs) is determining an e cient and reliable routing methodology between the source node and the destination node. Therefore, designing e cient and robust routing protocols for UWSNs became an attractive topic for researchers. This paper seeks to address in detail the key factors of underwater sensor network. Furthermore, it calls into question 5 state-of-the-art routing protocols proposed for UWSN: The Depth-Based Routing protocol (DBR), the Energy-E cient Depth-Based Routing protocol (EEDBR), the Hydraulic-pressure-based anycast routing protocol (Hydrocast), the Geographic and opportunistic routing protocol with Depth Adjustment for mobile underwater sensor networks (GEDAR), and the Void- Aware Pressure Routing for underwater sensor networks (VAPR). Finally, it covers the performance of those protocol through the use of the R programming language.
Більше джерел

Частини книг з теми "Multi-hop routing protocol":

1

Aghera, Kausa, Hiral Pambhar, and Naren Tada. "MMR-LEACH: Multi-tier Multi-hop Routing in LEACH Protocol." In Advances in Intelligent Systems and Computing, 205–14. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-2750-5_22.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Raza, Saima, Waleej Haider, Nouman M. Durrani, Nadeem Kafi Khan, and Mohammad Asad Abbasi. "Trust Based Energy Preserving Routing Protocol in Multi-hop WSN." In Networked Systems, 518–23. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26850-7_42.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Hou, Yating, Feng Xu, Mingming Su, and Kaibo Yu. "A Pre-partition Based Uneven Clustering Multi-hop Routing Protocol." In Cloud Computing and Security, 373–84. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68505-2_32.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Panwala, Vaidehi, Saumya Hegde, and Mohit P. Tahiliani. "AMul: Adaptive Multicast Routing Protocol for Multi-hop Wireless Networks." In Communications in Computer and Information Science, 389–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22786-8_48.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Mathew, Melvin, G. Shine Let, and G. Josemin Bala. "Modified AODV Routing Protocol for Multi-hop Cognitive Radio Ad Hoc Networks." In Advances in Intelligent Systems and Computing, 89–97. New Delhi: Springer India, 2014. http://dx.doi.org/10.1007/978-81-322-2126-5_11.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Xu, Juan, Rong Zhang, and Zhiyu Wang. "An Energy Efficient Multi-hop Routing Protocol for Terahertz Wireless Nanosensor Networks." In Wireless Algorithms, Systems, and Applications, 367–76. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42836-9_33.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Mudundi, Sudha, and Hesham Ali. "A Robust Scalable Cluster-Based Multi-hop Routing Protocol for Wireless Sensor Networks." In Parallel and Distributed Processing and Applications, 895–907. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74742-0_79.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Sherin, B., M. Senthil Vadivu, and A. Ayub Khan. "Attribute Table-Based Multipath Routing Protocol to Improve Network Lifetime in Multi-hop WSN." In Proceedings of International Conference on Artificial Intelligence, Smart Grid and Smart City Applications, 531–39. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-24051-6_51.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Zguira, Yosra, Hervé Rivano, and Aref Meddeb. "A Comparative Evaluation of the Performance of the Multi-hop IoB-DTN Routing Protocol." In Ad-hoc, Mobile, and Wireless Networks, 175–87. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00247-3_17.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Jagadeesh, S., and I. Muthulakshmi. "Hybrid Metaheuristic Algorithm-Based Clustering with Multi-Hop Routing Protocol for Wireless Sensor Networks." In Proceedings of Data Analytics and Management, 843–55. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-6285-0_65.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Multi-hop routing protocol":

1

Sharma, Sandeep, and Sapna Choudhary. "Heterogeneous multi-hop LEACH routing protocol." In 2014 International Conference on Green Computing Communication and Electrical Engineering (ICGCCEE). IEEE, 2014. http://dx.doi.org/10.1109/icgccee.2014.6922249.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Viswanathan, V., and P. Arumugam. "Smart packet: Energy efficient multi-hop routing protocol." In 2014 International Conference on Embedded Systems (ICES). IEEE, 2014. http://dx.doi.org/10.1109/embeddedsys.2014.6953102.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Yuan, Shuang, Muqing Wu, and Yan Zhen. "Multi-Stream Opportunistic Routing Protocol for Multi-Hop Wireless Networks." In 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2009. http://dx.doi.org/10.1109/wicom.2009.5302409.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Rasheed, Tinku, Usman Javaid, Moez Jerbi, and Khaldoun Al Agha. "Scalable Multi-hop Ad Hoc Routing Using Modified OLSR Routing Protocol." In 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications. IEEE, 2007. http://dx.doi.org/10.1109/pimrc.2007.4394079.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Fukuyama, J. "A Probabilistic Protocol for Multi-Hop Routing in VANETs." In 2009 IEEE International Conference on Communications Workshops. IEEE, 2009. http://dx.doi.org/10.1109/iccw.2009.5208064.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Arshad, Muhammad, Mohamad Yahya Aalsalem, and Farhan Ahmed Siddqui. "Multi-hop routing protocol for Mobile Wireless Sensor Networks." In 2013 World Congress on Computer and Information Technology (WCCIT). IEEE, 2013. http://dx.doi.org/10.1109/wccit.2013.6618712.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Morrison, Daniel W., and Riaan Wolhuter. "Multi-hop routing protocol for an intelligent transport application." In AFRICON 2007. IEEE, 2007. http://dx.doi.org/10.1109/afrcon.2007.4401592.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

WangBo, HuangChuanhe, YangWenzhong, and WangTong. "Trust opportunistic routing protocol in multi-hop wireless networks." In 2010 IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS). IEEE, 2010. http://dx.doi.org/10.1109/wcins.2010.5541842.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Zang, Chunhua, and Cheng Tao. "A Multi-Hop Cluster Based Routing Protocol for MANET." In 2009 First International Conference on Information Science and Engineering. IEEE, 2009. http://dx.doi.org/10.1109/icise.2009.75.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Zhang, Licui, and Dan Wang Yongshi Sun. "Research on Cluster-Based Routing Protocol with Multi-hop." In 2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control (IMCCC). IEEE, 2013. http://dx.doi.org/10.1109/imccc.2013.351.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Multi-hop routing protocol":

1

Camarillo, G., and A. Keranen. Host Identity Protocol (HIP) Multi-Hop Routing Extension. RFC Editor, October 2010. http://dx.doi.org/10.17487/rfc6028.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

До бібліографії