Relevant bibliographies by topics / Hierarchical routing algorithms

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Hierarchical routing algorithms'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Hierarchical routing algorithms.'

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.

Journal articles on the topic "Hierarchical routing algorithms"

1

DATTA, AJOY K., JERRY L. DERBY, JAMES E. LAWRENCE, and SÉBASTIEN TIXEUIL. "STABILIZING HIERARCHICAL ROUTING." Journal of Interconnection Networks 01, no. 04 (December 2000): 283–302. http://dx.doi.org/10.1142/s0219265900000172.

Full text
Abstract:
Hierarchical routing provides a less expensive algorithm compared to the traditional all-pairs routing algorithms. We present an algorithm in this paper which benefits from the lower memory requirement, faster routing table lookup, and less costly broadcast exemplified by hierarchical routing, and yet maintains routing capability of all pairs of connected nodes even in the presence of faults, such as link/node failures and repairs, and corruption of program variables. Additionally, this algorithm solves the problem of cluster partitioning where nodes that are supposed to be in the same subset of the network, become isolated due to link or node failures. Being self-stabilizing, starting from an arbitrary state (with possibly corrupted routing tables), the protocol is guaranteed to reach a configuration with routing tables containing valid entries in a finite time. The protocol automatically updates the shortest paths in the face of dynamically changing link weights. The proposed protocol also dynamically allocates/deallocates storage for the routing information as the network size changes. The algorithm works on an arbitrary topology and under a distributed daemon model.
APA, Harvard, Vancouver, ISO, and other styles
2

Hachtel, G. D., and C. R. Morrison. "Linear complexity algorithms for hierarchical routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 8, no. 1 (1989): 64–80. http://dx.doi.org/10.1109/43.21820.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Du, Tao, Qing Bei Guo, Kun Zhang, and Kai Wang. "An Energy Aware Routing Algorithm for WSNs Based on Semi-Static Clustering." Applied Mechanics and Materials 752-753 (April 2015): 1413–18. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1413.

Full text
Abstract:
Energy efficiency is a key factor to improve WSNs’ performance, and hierarchical routing algorithms are fitter in large scale networks and have more reliability, so they are mostly used to improve the nodes’ energy efficiency now. In this paper, mainly existing hierarchical routing algorithms are introduced, and based on these researches, a new energy efficient hierarchical routing algorithm designed based on energy aware semi-static clustering method is proposed. In this algorithm named EASCA, the nodes’ residual energy and cost of communication would both be considered when clustering. And a special packet head is defined to update nodes’ energy information when transmitting message; to rotate cluster head automatically, a member management scheme is designed to complete this function; and a re-cluster mechanism is used to dynamic adjust the clusters to make sensor nodes organization more reasonable. At last, EASCA is compared with other typical hierarchical routing algorithms in a series of experiments, and the experiments’ result proves that EASCA has obviously improved WSNs’ energy efficiency.
APA, Harvard, Vancouver, ISO, and other styles
4

Keykhosravi, Davood, and Ali Hosseinalipour. "New Fault-Tolerant Hierarchical Routing Protocol for WSNs." Advanced Materials Research 433-440 (January 2012): 3223–29. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.3223.

Full text
Abstract:
Clustering in wireless sensor networks is one of the crucial methods for increasing of network lifetime. There are many algorithms for clustering. One of the cluster based algorithm in wireless sensor networks is LEACH algorithm. In this paper we proposed a new clustering method for increasing of network lifetime. In proposed method Clustering is done symmetrically and the best node with respect to remained energy and distance of other nodes in comparing with each that selected as a cluster head. Although in this protocol we didn’t use GPS but we could find geographical position nodes so easily. However, failures in higher level of hierarchy e.g. cluster-head cause more damage to the system because they also limit accessibility to the nodes that are under their supervision. In this paper we propose an efficient mechanism to recover sensors from a failed cluster. In this performance of the proposed algorithm via computer simulation was evaluated and compared with other clustering algorithms. The simulation results show the high performance of the proposed clustering algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Sang, Lei, and Duo Long. "Application of Ant Colony Algorithm to the Hierarchical Routing in Wireless Sensor Networks." Advanced Materials Research 989-994 (July 2014): 1833–36. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.1833.

Full text
Abstract:
Wireless sensor networks (WSN) have become a hot research topic in the field of computer science. Since WSNs are characterized by limited node energy, dynamic topological structure and data fusion, the design of WSN routing protocols is faced with new problems and challenges. In recent years, many new routing algorithms for wireless sensor networks have appeared, but they all have some shortcomings. This paper studies and analyzes these routing protocols, and in view of their shortcomings, proposes a WSN hierarchical routing protocol based on ant colony algorithm. And a simulation test is conducted on this improved routing protocol, and the simulation result proves that this algorithm basically achieves the design objectives of WSN routing algorithms.
APA, Harvard, Vancouver, ISO, and other styles
6

Saravanan, S., A. Jayanthiladevi, and M. Geetha. "Fuzzy-Ant Colony based Routing on Road Networks." APTIKOM Journal on Computer Science and Information Technologies 1, no. 1 (March 1, 2016): 33–40. http://dx.doi.org/10.11591/aptikom.j.csit.102.

Full text
Abstract:
Route selection is essential in everyday life. We have several algorithms for detecting efficient route on Large Road Networks. This paper introduces the hierarchical community, is presented. It splits large road networks into hierarchical structure. It introduces a multi parameter route selection system which employs Fuzzy Logic (FL) and ant’s behavior in nature is applied to the dynamic routing. The important rates of parameters such as path length and traffic are adjustable by the user. The purposes of the new hierarchical routing algorithm significantly reduce the search space. We develop a community-based hierarchical graph model that supports Dynamic, efficient route computation on large road networks.
APA, Harvard, Vancouver, ISO, and other styles
7

Saravanan, S., A. Jayanthiladevi, and M. Geetha. "Fuzzy-Ant Colony based Routing on Road Networks." APTIKOM Journal on Computer Science and Information Technologies 1, no. 1 (February 20, 2016): 33–40. http://dx.doi.org/10.34306/csit.v1i1.42.

Full text
Abstract:
Route selection is essential in everyday life. We have several algorithms for detecting efficient route on Large Road Networks. This paper introduces the hierarchical community, is presented. It splits large road networks into hierarchical structure. It introduces a multi parameter route selection system which employs Fuzzy Logic (FL) and ant’s behavior in nature is applied to the dynamic routing. The important rates of parameters such as path length and traffic are adjustable by the user. The purposes of the new hierarchical routing algorithm significantly reduce the search space. We develop a community-based hierarchical graph model that supports Dynamic, efficient route computation on large road networks.
APA, Harvard, Vancouver, ISO, and other styles
8

Roy, Sohini. "Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network." Foundations of Computing and Decision Sciences 40, no. 3 (September 1, 2015): 203–22. http://dx.doi.org/10.1515/fcds-2015-0013.

Full text
Abstract:
Abstract Wireless Sensor Network (WSN) has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS) aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC) algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC).
APA, Harvard, Vancouver, ISO, and other styles
9

Al-Sadoon, Maha, and Ahmed Jedidi. "A secure trust-based protocol for hierarchical routing in wireless sensor network." International Journal of Electrical and Computer Engineering (IJECE) 12, no. 4 (August 1, 2022): 3838. http://dx.doi.org/10.11591/ijece.v12i4.pp3838-3849.

Full text
Abstract:
<p><span>Wireless sensor networks (WSNs) became the backbone of the internet of things (IoT). IoT applications are vital and demand specific quality of service (QoS) requirements. In addition, security has become a primary concern to provide secure communication between wireless nodes, with additional challenges related to the node’s computational resources. Particular, the design of secure and resource efficient routing protocol is a critical issue in the current deployment of WSNs. Therefore, this paper proposes a novel secure-trust aware routing protocol (ST2A) that provides secure and reliable routing. The proposed protocol establishes communication routes based on calculated trust value in joint with a novel cluster head selection algorithm in the hierarchical routing process. The proposed trust-aware routing algorithm improves the routing security in WSN and optimizes many performance metrics related to WSNs unique characteristics. The results of simulation validate the feasibility of the proposed algorithm for enhancing the network lifetime up to 18% and data delivery by 17% as compared with some state-of-the-art routing algorithms.</span></p>
APA, Harvard, Vancouver, ISO, and other styles
10

Kalpana, M., R. Dhanalakshmi, and P. Parthiban. "Prolonging the Lifetime of Wireless Sensor Networks Interconnected to Fixed Network Using Hierarchical Energy Tree Based Routing Algorithm." Scientific World Journal 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/158420.

Full text
Abstract:
This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN). It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA) based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP). The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Hierarchical routing algorithms"

1

Porwal, Rupesh. "Adaptive Selective Flooding Qos Routing." Thesis, Indian Institute of Science, 2002. http://hdl.handle.net/2005/51.

Full text
Abstract:
The routing strategy used in today's Internet is best-effort service, where all data packets are treated equally. This type of service is not suited for applications such as video conferencing, and video on demand, that requires the availability of certain resources (such as bandwidth) to be guaranteed for them to function properly. The routing in this context, called Quality-of-Service (QoS) Routing, is the problem of finding suitable paths that meet the application's resource requirements. The majority of proposed QoS routing schemes operate by maintaining the global state of the network, and using this knowledge to compute the QoS route. However, all these schemes suffer from the inherent drawback of scalability, because of the need for each node to collect state information about the complete network. The other type of QoS routing schemes do not maintain network state information, but instead flood the network with QoS connection establishment requests. This type of scheme suffers from excessive message overhead during QoS connection establishment. In this thesis, we present a new QoS routing algorithm that is a combination of the above-mentioned two schemes (i.e., global state and flooding based). The algorithm aims at minimizing the message overhead associated with these two schemes and still maintaining the positive aspects of both of them. The basic idea of the algorithm is: to reach to a destination, the path(s) will always pass through a specific set of intermediate nodes. The algorithm discovers such intermediate nodes (limited by a hop count threshold value needed to reach there). When a QoS connection request arrives at a node, it selects the feasible path leading to the intermediate node for the requested destination. The QoS connection establishment message (or routing message) is forwarded along this path. When the message arrives at the intermediate node, the further path is decided through same logic. To decide the path that leads to the intermediate node, the algorithm maintains the link state related to these intermediate nodes, and link state updates are restricted only with regard to these intermediate nodes. Because of this restriction in link state updation, one has less message overhead, compared to the global state based routing scheme. Further, the algorithm tries to group these intermediate nodes in such a way that the routing message need be sent to only one of the grouped intermediate nodes, and still makes sure that all the possible paths are covered. Therefore, one has a reduced message overhead because of grouping.
APA, Harvard, Vancouver, ISO, and other styles
2

Mustafa, Elmabrook B. M. "Some new localized quality of service models and algorithms for communication networks : the development and evaluation of new localized quality of service routing algorithms and path selection methods for both flat and hierarchical communication networks." Thesis, University of Bradford, 2009. http://hdl.handle.net/10454/4288.

Full text
Abstract:
The Quality of Service (QoS) routing approach is gaining an increasing interest in the Internet community due to the new emerging Internet applications such as real-time multimedia applications. These applications require better levels of quality of services than those supported by best effort networks. Therefore providing such services is crucial to many real time and multimedia applications which have strict quality of service requirements regarding bandwidth and timeliness of delivery. QoS routing is a major component in any QoS architecture and thus has been studied extensively in the literature. Scalability is considered one of the major issues in designing efficient QoS routing algorithms due to the high cost of QoS routing both in terms of computational effort and communication overhead. Localized quality of service routing is a promising approach to overcome the scalability problem of the conventional quality of service routing approach. The localized quality of service approach eliminates the communication overhead because it does not need the global network state information. The main aim of this thesis is to contribute towards the localised routing area by proposing and developing some new models and algorithms. Toward this goal we make the following major contributions. First, a scalable and efficient QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated. Second, we have developed a path selection technique that can be used with existing localized QoS routing algorithms to enhance their scalability and performance. Third, a scalable and efficient hierarchical QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated.
APA, Harvard, Vancouver, ISO, and other styles
3

Alzahrani, Ahmed S. "Localized Quality of Service Routing Algorithms for Communication Networks. The Development and Performance Evaluation of Some New Localized Approaches to Providing Quality of Service Routing in Flat and Hierarchical Topologies for Computer Networks." Thesis, University of Bradford, 2009. http://hdl.handle.net/10454/4254.

Full text
Abstract:
Quality of Service (QoS) routing considered as one of the major components of the QoS framework in communication networks. The concept of QoS routing has emerged from the fact that routers direct traffic from source to destination, depending on data types, network constraints and requirements to achieve network performance efficiency. It has been introduced to administer, monitor and improve the performance of computer networks. Many QoS routing algorithms are used to maximize network performance by balancing traffic distributed over multiple paths. Its major components include bandwidth, delay, jitter, cost, and loss probability in order to measure the end users' requirements, optimize network resource usage and balance traffic load. The majority of existing QoS algorithms require the maintenance of the global network state information and use it to make routing decisions. The global QoS network state needs to be exchanged periodically among routers since the efficiency of a routing algorithm depends on the accuracy of link-state information. However, most of QoS routing algorithms suffer from scalability problems, because of the high communication overhead and the high computation effort associated with marinating and distributing the global state information to each node in the network. The goal of this thesis is to contribute to enhancing the scalability of QoS routing algorithms. Motivated by this, the thesis is focused on localized QoS routing that is proposed to achieve QoS guarantees and overcome the problems of using global network state information such as high communication overhead caused by frequent state information updates, inaccuracy of link-state information for large QoS state update intervals and the route oscillating due to the view of state information. Using such an approach, the source node makes its own routing decisions based on the information that is local to each node in the path. Localized QoS routing does not need the global network state to be exchanged among network nodes because it infers the network state and avoids all the problems associated with it, like high communication and processing overheads and oscillating behaviour. In localized QoS routing each source node is required to first determine a set of candidate paths to each possible destination. In this thesis we have developed localized QoS routing algorithms that select a path based on its quality to satisfy the connection requirements. In the first part of the thesis a localized routing algorithm has been developed that relies on the average residual bandwidth that each path can support to make routing decisions. In the second part of the thesis, we have developed a localized delay-based QoS routing (DBR) algorithm which relies on a delay constraint that each path satisfies to make routing decisions. We also modify credit-based routing (CBR) so that this uses delay instead of bandwidth. Finally, we have developed a localized QoS routing algorithm for routing in two levels of a hierarchal network and this relies on residual bandwidth to make routing decisions in a hierarchical network like the internet. We have compared the performance of the proposed localized routing algorithms with other localized and global QoS routing algorithms under different ranges of workloads, system parameters and network topologies. Simulation results have indicated that the proposed algorithms indeed outperform algorithms that use the basics of schemes that currently operate on the internet, even for a small update interval of link state. The proposed algorithms have also reduced the routing overhead significantly and utilize network resources efficiently.
APA, Harvard, Vancouver, ISO, and other styles
4

Nyamugure, Philimon. "Modification, development, application and computational experiments of some selected network, distribution and resource allocation models in operations research." Thesis, University of Limpopo, 2017. http://hdl.handle.net/10386/1930.

Full text
Abstract:
Thesis (Ph.D. (Statistics)) -- University of Limpopo, 2017
Operations Research (OR) is a scientific method for developing quantitatively well-grounded recommendations for decision making. While it is true that it uses a variety of mathematical techniques, OR has a much broader scope. It is in fact a systematic approach to solving problems, which uses one or more analytical tools in the process of analysis. Over the years, OR has evolved through different stages. This study is motivated by new real-world challenges needed for efficiency and innovation in line with the aims and objectives of OR – the science of better, as classified by the OR Society of the United Kingdom. New real-world challenges are encountered on a daily basis from problems arising in the fields of water, energy, agriculture, mining, tourism, IT development, natural phenomena, transport, climate change, economic and other societal requirements. To counter all these challenges, new techniques ought to be developed. The growth of global markets and the resulting increase in competition have highlighted the need for OR techniques to be improved. These developments, among other reasons, are an indication that new techniques are needed to improve the day-to-day running of organisations, regardless of size, type and location. The principal aim of this study is to modify and develop new OR techniques that can be used to solve emerging problems encountered in the areas of linear programming, integer programming, mixed integer programming, network routing and travelling salesman problems. Distribution models, resource allocation models, travelling salesman problem, general linear mixed integer ii programming and other network problems that occur in real life, have been modelled mathematically in this thesis. Most of these models belong to the NP-hard (non-deterministic polynomial) class of difficult problems. In other words, these types of problems cannot be solved in polynomial time (P). No general purpose algorithm for these problems is known. The thesis is divided into two major areas namely: (1) network models and (2) resource allocation and distribution models. Under network models, five new techniques have been developed: the minimum weight algorithm for a non-directed network, maximum reliability route in both non-directed and directed acyclic network, minimum spanning tree with index less than two, routing through 0k0 specified nodes, and a new heuristic to the travelling salesman problem. Under the resource allocation and distribution models section, four new models have been developed, and these are: a unified approach to solve transportation and assignment problems, a transportation branch and bound algorithm for the generalised assignment problem, a new hybrid search method over the extreme points for solving a large-scale LP model with non-negative coefficients, and a heuristic for a mixed integer program using the characteristic equation approach. In most of the nine approaches developed in the thesis, efforts were done to compare the effectiveness of the new approaches to existing techniques. Improvements in the new techniques in solving problems were noted. However, it was difficult to compare some of the new techniques to the existing ones because computational packages of the new techniques need to be developed first. This aspect will be subject matter of future research on developing these techniques further. It was concluded with strong evidence, that development of new OR techniques is a must if we are to encounter the emerging problems faced by the world today. Key words: NP-hard problem, Network models, Reliability, Heuristic, Largescale LP, Characteristic equation, Algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Alessi, Nicola. "Hierarchical Inter-Regional Routing Algorithm for Interplanetary Networks." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/17468/.

Full text
Abstract:
Le comunicazioni interplanetarie sono caratterizzate da lunghi ritardi, perdite elevate e connettività intermittente con frequenti interruzioni. Lo stack TCP/IP è inadatto nell'affrontare questo tipo di problemi. Mentre inizialmente l'unico scenario di riferimento erano le comunicazioni interplanetarie, negli anni successivi è nato il termine "Challenged Networks" per identificare le reti in cui i protocolli tradizionali falliscono. L'idea si evolve così in Delay/Disruption Tolerant Networking(DTN), con l'obiettivo di fornire una soluzione adatta alle challenged network. Tra i vari aspetti in cui le reti DTN differiscono dai protocolli TCP/IP abbiamo il modo in cui viene effettuato routing. L'attuale algoritmo di routing utilizzato proposto per le reti DTN è chiamato Contact Graph Routing(CGR). L'aspetto che contraddistingue il CGR dagli algoritmi di routing tradizionali è che esso costruisce una rotta di "contatti" (ovvero delle possibilità di comunicazione programmate), anzichè costruire un percorso di nodi. Questa caratteristica è efficace nell'ambito delle reti DTN, dove i contatti sono noti a priori. Nonostante il CGR sia molto efficiente, esso presenta dei problemi di scalabilità. Infatti, con l'aumentare del numero dei contatti, il suo tempo di esecuzione tende a crescere fino a degradare le prestazioni dell'intera rete. In questa tesi viene proposto un algoritmo di routing chiamato Hierarchical Inter-regional Routing (HIRR) che ha l'obiettivo di mitigare il problema di scalabilità del CGR dividendo i nodi della rete in diverse regioni amministrative, in cui l'utilizzo del CGR non risulta essere critico. Lo scopo principale di HIRR è quindi quello di cercare di trarre il massimo beneficio dal CGR, accettando un ragionevole compromesso fra ottimalità delle rotte e tempo di calcolo. Questa tesi è stata svolta al NASA Jet Propulsion Laboratory(JPL) situato a Pasadena in California, aderendo al Visiting Student Research Program (VSRP).
APA, Harvard, Vancouver, ISO, and other styles
6

Hai-Chau, Le, Hiroshi Hasegawa, and Kenichi Sato. "Hierarchical optical path network design algorithm that can best utilize WSS/WBSS based cross-connects." IEEE, 2009. http://hdl.handle.net/2237/14026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wu, Wenhao. "High-performance matrix multiplication hierarchical data structures, optimized kernel routines, and qualitative performance modeling /." Master's thesis, Mississippi State : Mississippi State University, 2003. http://library.msstate.edu/etd/show.asp?etd=etd-07092003-003633.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yagyu, Isao, Hiroshi Hasegawa, and Ken-ichi Sato. "An Efficient Hierarchical Optical Path Network Design Algorithm based on a Traffic Demand Expression in a Cartesian Product Space." IEEE, 2008. http://hdl.handle.net/2237/12078.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zini, Roger. "Placement, routage conjoints et hierarchiques de reseaux prediffuses." Paris 6, 1987. http://www.theses.fr/1987PA066116.

Full text
Abstract:
Cette these propose un algorithme original de construction hierarchique d'arbres de steiner ainsi qu'une technique d'estimation de longueur au fur et a mesure de cette construction. Deux algorithmes de partitionnement d'hypergraphes, de maniere gloutonne ou par recuit simule sans rejets, y sont exposes. Elle introduit enfin un concept de directions d'attraction permettant d'effectuer un placement routage de circuits vlsi, a implanter sur des reseaux prediffuses, sous forme de systeme regule par retroaction entre le placement, le routage et l'analyse temporelle, afin d'obtenir du circuit, par un placement-routage adequat, les performances temporelles souhaitees
APA, Harvard, Vancouver, ISO, and other styles
10

Wu, Guei-Jhuang, and 吳貴庄. "Shortest Path Routing Algorithm of Hierarchical Crossed Cube." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/62f75y.

Full text
Abstract:
碩士
國立東華大學
資訊工程學系
96
The Hypercube is a very famous topology. When hypercube is used as the topology of a multiprocessor system, it suffers from a practical limitation. Many other topologies improve some of the hypercube properties. Some varieties of Hypercube based hierarchical interconnection networks, such as Crossed Cube, were proposed. The Crossed Cube has lower diameter than hypercube. A Hierarchical Crossed Cube(HCC) network combines the hierarchical structure of hypercubes and Crossed Cubes and owns their advantages. This topology is suitable for the desing of massively parallel systems with thousands of processors. An interesting property of this network is the low node degree, which enhances the VLSI design and fabrication of the system. Other pleasing feature include logarithmic diameter, which imply easy and fast algorithms for communication. Moreover, the HCC is scalable that it can embed HCC’s of lower dimensions. Shortest path routing algorithms are essential for optimal routing control of data networks. In this paper, we give a shortest path routing algorithm of Hierarchical Crossed Cube.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Hierarchical routing algorithms"

1

Aggarwal, Aditya Kumar. Routing algorithms and architectures for hierarchical field programmable gate arrays. Ottawa: National Library of Canada, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Hierarchical routing algorithms"

1

Liu, Ziwei, Chuanbo Wei, Yang Ma, Hui Li, Xiaoguang Niu, and Lina Wang. "UCOR: An Unequally Clustering-Based Hierarchical Opportunistic Routing Protocol for WSNs." In Wireless Algorithms, Systems, and Applications, 175–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39701-1_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mousazadeh, Farhad, and Sayyed Majid Mazinani. "Hierarchical Routing in Large Wireless Sensor Networks Using a Combination of LPA * and Fuzzy Algorithms." In Lecture Notes in Electrical Engineering, 707–22. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8672-4_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Xu, Zhiyong, Yiming Hu, and Laxmi Bhuyan. "HIERAS: A DHT-Based Hierarchical P2P Routing Algorithm." In High-Performance Computing, 593–610. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2006. http://dx.doi.org/10.1002/0471732710.ch31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Zhenchao, Xin Jing, and Jing Wang. "A Novel Routing Algorithm Based on Ant Colony Optimization for Hierarchical Wireless Sensor Networks." In 2011 International Conference in Electrics, Communication and Automatic Control Proceedings, 825–31. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-8849-2_104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yazid, Yassine, Imad Ezzazi, Mounir Arioua, and Ahmed El Oualkadi. "Performance Analysis of Hierarchical Routing Protocols in Heterogenous WSNs." In Advances in Computer and Electrical Engineering, 237–58. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-0117-7.ch008.

Full text
Abstract:
Since the appearance of WSN, the energy efficiency has been widely considered as a critical issue due to the limited battery-powered nodes. In this regard, communication process is the most energy demanding in sensor nodes. Subsequently, using energy-aware routing protocols in order to decrease the communications costs as much as possible and increase the network lifetime is of paramount importance. In this chapter, we have mainly focused on the most recent-based clustered routing algorithms for heterogeneous WSNs, namely Selected Election Protocol (SEP), and Distributed Energy Efficient Clustering Protocol (DEEC). In addition, we have proposed an efficient clustered routing protocol based on Zonal SEP algorithm. Indeed, we have evaluated the performance of the proposed protocol according to different scenarios in order to guarantee the best distribution of heterogeneous nodes in the network. The results have shown that the proposed clustered routing approach outperforms the existed Z-SEP protocol in terms of energy efficiency and stability.
APA, Harvard, Vancouver, ISO, and other styles
6

Moh, Melody, Xuquan Lin, and Subhankar Dhar. "Energy-efficient Scalable Self-organizing Routing for Wireless Mobile Networks." In Wireless Technologies, 390–406. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-61350-101-6.ch208.

Full text
Abstract:
The instant deployment without relying on an existing infrastructure makes the mobile ad hoc networks (MANET) an attractive choice for many dynamic situations. An efficient MANET protocol may be applied to other important emerging wireless technologies such as wireless mesh and sensor networks. This chapter proposes a hierarchical routing scheme that is scalable, energy-efficient, and self-organizing. This chapter presents a new algorithm: the Dynamic Leader Set Generation (DLSG). This algorithm dynamically selects leader nodes based on traffic demand, locality, and residual energy level, and de-selects them based on residual energy. Therefore, energy consumption and traffic load are distributed throughout the network. The network also reorganizes itself surrounding the dynamically selected leader nodes. Time, space, and message complexities are formally analyzed; implementation issues are also addressed. Incorporating the IEEE 802.11 medium access control mechanism including the power saving mode, performance evaluation is carried out by simulating DLSG and four existing hierarchical routing algorithms. It shows that DLSG successfully extends network lifetime by 20-50% while achieves a comparable level of network performance.
APA, Harvard, Vancouver, ISO, and other styles
7

El Alami, Hassan, and Abdellah Najid. "EEA." In Sensor Technology, 735–52. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-2454-1.ch035.

Full text
Abstract:
The data communication task, in wireless sensor networks (WSNs), is a major issue of high energy consumption. A hierarchical design based on a clustering algorithm is one of the approaches to manage the data communication and save energy in WSNs. However, most of the previous approaches based on clustering algorithms have not considered the length of the data communication path, which is a direct relation to energy consumption in WSNs. In this article, a novel scheme of a clustering algorithm has been proposed for reducing the data communication distance in WSNs. Hierarchical routing protocols were implemented for homogeneous and heterogeneous networks. The results show that the proposed scheme is more efficient than other protocols.
APA, Harvard, Vancouver, ISO, and other styles
8

Alphonse, P. J. A., C. Sivaraj, and T. N. Janakiraman. "An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks." In Sensor Technology, 238–62. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-2454-1.ch012.

Full text
Abstract:
Efficient energy management is a key issue in battery equipped wireless sensor networks (WSNs). The cluster based routing in WSNs is a prominent approach for energy conservation of the network which provides a hierarchical data collection mechanism. In order to maximize the energy conservation of sensor nodes, this paper proposes an Energy-efficient Layered Clustering Algorithm (ELCA) for routing in wireless sensor networks. ELCA constructs two layers of clusters to reduce the transmission rate and to balance the energy consumption of sensors. As early energy depletion of clusterheads (CHs) is a major limitation in clustering, this algorithm provides local remedy for energy suffering CHs through efficient CH substitution scheme. The performance of the proposed algorithm is analysed through extensive simulation experiments and verified by compared results with existing clustering algorithms.
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Guoli, Shuang Hou, and Hans Arno Jacobsen. "Content-Based XML Data Dissemination." In Advanced Applications and Structures in XML Processing, 227–55. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-61520-727-5.ch011.

Full text
Abstract:
XML-based data dissemination networks are rapidly gaining momentum. In these networks XML content is routed from data producers to data consumers throughout an overlay network of content-based routers. Routing decisions are based on XPath expressions (XPEs) stored at each router. To enable efficient routing, while keeping the routing state small, we introduce advertisement-based routing algorithms for XML content, present a novel data structure for managing XPEs, especially apt for the hierarchical nature of XPEs and XML, and develop several optimizations for reducing the number of XPEs required to manage the routing state. The experimental evaluation shows that our algorithms and optimizations reduce the routing table size by up to 90%, improve the routing time by roughly 85%, and reduce overall network traffic by about 35%. Experiments running on PlanetLab show the scalability of our approach.
APA, Harvard, Vancouver, ISO, and other styles
10

Saltouros, Marios, Athanasios Vasilakos, Antonios Atlasis, and Witold Pedrycz. "QoS-Based Hierarchical Routing in ATM Networks Using Reinforcement Learning Algorithms." In Computational Intelligence in Telecommunications Networks, 263–86. CRC Press, 2000. http://dx.doi.org/10.1201/9781420040951.ch10.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hierarchical routing algorithms"

1

Luo, Pei, Shanguo Huang, Weihua Lian, Bin Li, and Wanyi Gu. "Novel Routing Algorithms for Hierarchical Architecture in ASON." In 2009 WASE International Conference on Information Engineering (ICIE). IEEE, 2009. http://dx.doi.org/10.1109/icie.2009.269.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kong, Lingbin, Lin Gou, Xingqin Jiao, Yaojun Qiao, and Yuefeng Ji. "Multicast routing algorithms in hierarchical intelligent optical networks." In Asia-Pacific Optical Communications, edited by Dominique Chiaroni, Wanyi Gu, Ken-ichi Kitayama, and Chang-Soo Park. SPIE, 2007. http://dx.doi.org/10.1117/12.742529.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Marin-Tordera, E. "Efficient routing algorithms for hierarchical optical transport networks." In 31st European Conference on Optical Communications (ECOC 2005). IEE, 2005. http://dx.doi.org/10.1049/cp:20050365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jadhav, Sunayana. "Hierarchical VSCH and Cluster-Tree Routing Algorithms for Energy Efficient WSNs." In 2021 International Conference on Intelligent Technologies (CONIT). IEEE, 2021. http://dx.doi.org/10.1109/conit51480.2021.9498556.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pei Luo, Shanguo Huang, Bin Li, Jie Zhang, and Wanyi Gu. "Adaptive routing and wavelength assignment algorithms for hierarchical architecture in ASON." In 2009 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC 2009). IEEE, 2009. http://dx.doi.org/10.1109/icnidc.2009.5360843.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hou, Weigang, Ruijia Li, Zhaolong Ning, and Zhikui Chen. "A Hierarchical Routing Algorithm for Satellite Networks Considering FSO Communication." In 2017 14th International Symposium on Pervasive Systems, Algorithms and Networks (ISPAN), 2017 11th International Conference on Frontiers of Computer Science and Technology (FCST), & 2017 Third International Symposium of Creative Computing (ISCC). IEEE, 2017. http://dx.doi.org/10.1109/ispan-fcst-iscc.2017.106.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Holsmark, Rickard, and Shashi Kumar. "An Abstraction to Support Design of Deadlock-free Routing Algorithms for Large and Hierarchical NoCs." In 2011 IEEE 11th International Conference on Computer and Information Technology (CIT). IEEE, 2011. http://dx.doi.org/10.1109/cit.2011.32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Arai, Jun, and Yamin Li. "Fault-Tolerant Routing Algorithms for Hierarchical Dual-Nets with Limited and Arbitrary Number of Faulty Nodes." In 2014 Second International Symposium on Computing and Networking (CANDAR). IEEE, 2014. http://dx.doi.org/10.1109/candar.2014.88.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Panful, Benjamin, and Xie Zhibin. "A Study of Energy Efficiency in Wireless Sensor Networks." In 28th iSTEAMS Multidisciplinary Research Conference AIUWA The Gambia. Society for Multidisciplinary and Advanced Research Techniques - Creative Research Publishers, 2021. http://dx.doi.org/10.22624/aims/isteams-2021/v28n3p9.

Full text
Abstract:
The wireless sensor networks (WSNs) field is one of the emerging and fast-growing fields in the scientific world. This has brought about the development of low-cost, and multifunctional sensor nodes for easy and secure dissemination of information. Nonetheless, the problem of sensor nodes running out of energy quickly has been an issue. Many energyefficient routing algorithms have been proposed to solve this problem and preserve the longevity of the network. Most of the recent papers have shown so many protocols mainly designed to minimize energy consumption in the network but there are some limitations with regards to the area of operation and the optimization decisions. This paper proposes an Energy Efficiency Hierarchical Routing Technique (EEHRT) which is based on LEACH protocol to extend the lifespan of a WSN. In this work, the proposed Energy Efficient Hierarchical Routing Technique selects cluster heads based on the prediction of transmission energy through the shortest distance to the base station. Our approach rotates the role of Cluster Heads (CHs), and optimizes the CH selection by the prediction of energy transmission in every round and aggregating data before transmission to the BS. The important features which include member nodes formation and rotation, cluster head selection and rotation, and cluster optimization of our proposed hierarchical routing technique in transmitting data to the base station are analyzed and emphasized. Keywords: Wireless Sensor Network, Base Station, Member Node, Clustering, LEACH, Hierarchy Proceedings Reference Format Benjamin Panful & Xie Zhibin (2021): Rural Women’s Access to Land and its Implications for Empowerment in Nigeria: The Case of Ilorin East Local Government Area, Kwara State, Nigeria. Proceedings of the 28th iSTEAMS Intertertiary Multidisciplinary Conference. American International University West Africa, The Gambia. Series 28, Vol 3 October 2021. Pp 105-120 www.isteams.net/gambia2021. DOI - https://doi.org/
APA, Harvard, Vancouver, ISO, and other styles
10

Ali Adem, Mohammed. "Energy Optimization of Wireless Sensor Network Using Neuro-Fuzzy Algorithms." In LatinX in AI at Neural Information Processing Systems Conference 2019. Journal of LatinX in AI Research, 2019. http://dx.doi.org/10.52591/lxai2019120814.

Full text
Abstract:
Wireless sensor network (WSN) is one of the recent technologies in communication and engineering world to assist various civilian and military applications. They are deployed remotely in sever environment which doesn’t have an infrastructure. Energy is a limited resource that needs efficient management to work without any failure. Energy efficient clustering of WSN is the ultimate mechanism to conserve energy for longtime. The major objective of this research is to efficiently consume energy based on the Neuro-Fuzzy approach particularly adaptive Neuro fuzzy inference system (ANFIS). The significance of this study is to examine the challenges of energy efficient algorithms and the network lifetime on WSN so that they can assist several applications. Clustering is one of the hierarchical based routing protocols, which manage the communication between sensor nodes and sink via Cluster Head (CH), CH is responsible to send and receive information from multiple sensor nodes and multiple base stations (BS). There are various algorithms that can efficiently select appropriate CH and localize the membership of cluster with fuzzy logic classification parameters to minimize periodic clustering which consumes more energy and we have applied neural network learning algorithm to learn various patterns based on the fuzzy rules and measured how much energy has saved from random clustering. Finally, we have compared to our Neuro-Fuzzy logic and consequently demonstrated that our Neuro-Fuzzy model outperforms than random model.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Hierarchical routing algorithms' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography