Relevant bibliographies by topics / Hierarchy routing

Academic literature on the topic 'Hierarchy routing'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 January 2023

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

Select a source type:

Contents

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

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 "Hierarchy routing"

1

Tsuchiya, P. F. "The landmark hierarchy: a new hierarchy for routing in very large networks." ACM SIGCOMM Computer Communication Review 18, no. 4 (August 1988): 35–42. http://dx.doi.org/10.1145/52325.52329.

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

SONG, Chun-yan, Hua-zhong ZHANG, and Xiu-yang ZHANG. "Clustering hierarchy tree routing algorithm based on LEACH." Journal of Computer Applications 28, no. 10 (September 30, 2009): 2594–96. http://dx.doi.org/10.3724/sp.j.1087.2008.02594.

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

Tao, Yong, and Xiao-fang Wang. "Adaptive clustering hierarchy routing for delay tolerant network." Journal of Central South University 19, no. 6 (June 2012): 1577–82. http://dx.doi.org/10.1007/s11771-012-1179-y.

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

Yin, Xiangyuan, Zhihao Ling, and Liping Guan. "Low Energy Adaptive Routing Hierarchy Based on Differential Evolution." International Journal on Smart Sensing and Intelligent Systems 6, no. 2 (2013): 523–47. http://dx.doi.org/10.21307/ijssis-2017-553.

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

Alaettinoglu, C., and A. U. Shankar. "The viewserver hierarchy for interdomain routing: protocols and evaluation." IEEE Journal on Selected Areas in Communications 13, no. 8 (1995): 1396–410. http://dx.doi.org/10.1109/49.464711.

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

Balaji, M., S. Santhanakrishnan, and S. N. Dinesh. "An Application of Analytic Hierarchy Process in Vehicle Routing Problem." Periodica Polytechnica Transportation Engineering 47, no. 3 (March 26, 2018): 196–205. http://dx.doi.org/10.3311/pptr.10701.

Full text
Abstract:
Vehicle Routing Problem (VRP) facilitates on finding a set of trips, one for each vehicle and to deliver known quantities of goods from a single depot to a set of geographically dispersed customers. This paper proposes an effective hybrid approach that combines customer prioritization with the Clarke and Wright's savings algorithm to solve the capacitated vehicle routing problem. In this model, in addition to traditional objective of resolving vehicle routing problem, the customer satisfaction have been taken into account. Initially, all the customers have been clustered with the help of Clarke and Wright's saving algorithm and later the customers have been prioritized on assigning optimal route using Analytic Hierarchy Process (AHP) as a Multi Criteria Decision Making (MCDM) tool. The highlight of this research is to diminish the total transportation cost without violating the vehicle capacity and ultimately improve the customer satisfaction.
APA, Harvard, Vancouver, ISO, and other styles
7

Azizi, Ridha. "Consumption of Energy and Routing Protocols in Wireless Sensor Network." Network Protocols and Algorithms 8, no. 3 (December 31, 2016): 76. http://dx.doi.org/10.5296/npa.v8i3.10257.

Full text
Abstract:
Extend the life of a wireless sensor network (WSN) is a fundamental challenge, as they have a limited supply. Multiple protocols and approaches have been proposed to minimize power consumption. Routing protocols and especially the hierarchical approach is one of the techniques used to minimize energy consumption and to improve the duration of network life. In this paper we propose a new approach to transfer and select the CH (Cluster Head). ART-LEACH (Advanced Routing Transfer- Low-Energy Adaptive Clustering Hierarchy) is a self-organizing protocol based on clustering. Our approach is to use energy more evenly the selected nodes as CH. We evaluated the performance of LEACH (Low-Energy Adaptive Clustering Hierarchy) and IB-LEACH (Improved and Balanced Low Energy Adaptive Clustering Hierarchy) protocol with the proposed new approach using MATLAB as a simulation tool. The simulation results showed that our proposal provides a reduction in energy consumption and increase the duration of network life.
APA, Harvard, Vancouver, ISO, and other styles
8

Es-sabery, Fatima, Hicham Ouchitachen, and Abdellatif Hair. "Energy Optimization of Routing Protocols in Wireless Sensor Networks." International Journal of Informatics and Communication Technology (IJ-ICT) 6, no. 2 (August 1, 2017): 76. http://dx.doi.org/10.11591/ijict.v6i2.pp76-85.

Full text
Abstract:
The hierarchical routing of data in WSNs is a specific class of routing protocols it encompasses solutions that take a restructuring of the physical network in a logical hierarchy system for the optimization of the consum-ption of energy. Several hierarchical routing solutions proposed, namely: the protocol LEACH (Low Energy Adaptive Clustering Hierarchy) consist of dividing the network in distributed clusters at one pop in order of faster data delivery and PEGASIS protocol (Power-Efficient Gathering in Sensor Information Systems) which uses the principle of constructing a chain’s sensor node. Our contribution consists of a hierarchical routing protocol, which is the minimization of the energy consumption by reducing the transmission distance of data and reducing the data delivery time. Our solution combines the two hierarchical routing approaches: chain based approach and the cluster based approach. Our approach allows for multi-hop communications, intra- and intercluster, and a collaborative aggregation of data in each Cluster, and a collaborative aggregation of data at each sensor node<strong>.</strong>
APA, Harvard, Vancouver, ISO, and other styles
9

Patidar, Harshit Prakash, and Neetu Sharma. "Adaptive Approach of DSR and OLSR Routing Protocols Using Optimal Probabilistic Logical Key Hierarchy in MANET." Bonfring International Journal of Networking Technologies and Applications 03, no. 02 (June 30, 2016): 13–20. http://dx.doi.org/10.9756/bijnta.8131.

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

LI, Ling, Lin WANG, Fei-ge ZHANG, and Xiao-zhe WANG. "Lower energy adaptive clustering hierarchy routing protocol for wireless sensor network." Journal of Computer Applications 32, no. 10 (May 22, 2013): 2700–2703. http://dx.doi.org/10.3724/sp.j.1087.2012.02700.

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

Dissertations / Theses on the topic "Hierarchy routing"

1

Dai, Zhibin. "Routability prediction for Field Programmable Gate Arrays with a routing hierarchy." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ56315.pdf.

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

Park, Won Bae. "Routing algorithms for Clos networks in SONET/SDH digital cross-connect systems." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/13837.

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

Durrett, Bret W. "Use of cross-connect clusters to optimize routing in STM-64-based SDH optical network systems." [Denver, Colo.] : Regis University, 2005. http://165.236.235.140/lib/BDurrett2005.pdf.

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

Xu, Sanlin, and SanlinXu@yahoo com. "Mobility Metrics for Routing in MANETs." The Australian National University. Faculty of Engineering and Information Technology, 2007. http://thesis.anu.edu.au./public/adt-ANU20070621.212401.

Full text
Abstract:
A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. Unlike previous research, where the mobility metrics were mostly studied by simulations, we derive the analytical expressions of mobility metrics, including link persistence, link duration, link availability, link residual time, link change rate and their path equivalents. We also show relationships between the different metrics, where they exist. Such exact expressions constitute precise mathematical relationships between network connectivity and node mobility. ¶ We further validate our analysis framework in Random Walk Mobility model (RWMM). Regarding constant or random variable node velocity, we construct the transition matrix of Markov Chain Model through the analysis of the PDF of node separation after one epoch. In addition, we present intuitive and simple expressions for the link residual time and link duration, for the RWMM, which relate them directly to the ratio between transmission range and node speed. We also illustrate the relationship between link change rate and link duration. Finally, simulation results for all mentioned mobility metrics are reported which match well the proposed analytical framework. ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. When on-demand routing employed, stale route cache information and frequent new-route discovery in processes in MANETs generate considerable routing delay and overhead. This thesis proposes a practical route caching strategy to minimize routing delay and/or overhead by setting route cache timeout to a mobility metric, the expected path residual time. The strategy is independent of network traffic load and adapts to various non-identical link duration distributions, so it is feasible to implement in a real-time route caching scheme. Calculated results show that the routing delay achieved by the route caching scheme is only marginally more than the theoretically determined minimum. Simulation in NS-2 demonstrates that the end-to-end delay from DSR routing can be remarkably reduced by our caching scheme. By using overhead analysis model, we demonstrate that the minimum routing overhead can be achieved by increasing timeout to around twice the expected path residual time, without significant increase in routing delay. ¶ Apart from route cache, this thesis also addresses link cache strategy which has the potential to utilize route information more efficiently than a route cache scheme. Unlike some previous link cache schemes delete links at some fixed time after they enter the cache, we proposes using either the expected path duration or the link residual time as the link cache timeout. Simulation results in NS-2 show that both of the proposed link caching schemes can improve network performance in the DSR by reducing dropped data packets, latency and routing overhead, with the link residual time scheme out-performing the path duration scheme. ¶ To deal with large-scale MANETs, this thesis presents an adaptive k-hop clustering algorithm (AdpKHop), which selects clusterhead (CH) by our CH selection metrics. The proposed CH selection criteria enable that the chosen CHs are closer to the cluster centroid and more stable than other cluster members with respect to node mobility. By using merging threshold which is based on the CH selection metric, 1-hop clusters can merge to k-hop clusters, where the size of each k-hop cluster adapts to the node mobility of the chosen CH. Moreover, we propose a routing overhead analysis model for k-hop clustering algorithm, which is determined by a range of network parameters, such as link change rate (related to node mobility), node degree and cluster density. Through the overhead analysis, we show that an optimal k-hop cluster density does exist, which is independent of node mobility. Therefore, the corresponding optimal cluster merging threshold can be employed to efficiently organise k-hop clusters to achieve minimum routing overhead, which is highly desirable in large-scale networks. ¶ The work presented in this thesis provides a sound basis for future research on mobility analysis for mobile ad hoc networks, in aspects such as mobility metrics, caching strategies and k-hop clustering routing protocols.
APA, Harvard, Vancouver, ISO, and other styles
5

Nateghi, Bahman. "Une methode orientee edif pour la conception des vlsi, et realisation de son systeme de cao." Paris 6, 1988. http://www.theses.fr/1988PA066435.

Full text
Abstract:
Ce memoire traite de la conception assistee par ordinateur dans le domaine des circuits electroniques a haut niveau d'integration, en presentant une methode de conception pour ces circuits, et la chaine d'outils logiciels adaptes a cette methode. La premiere partie critique deux methodologies de conception typiques dans ce domaine. La seconde partie decrit les differentes phases de la methodologie s'inscrivant dans le cadre de la norme edif. La troisieme partie presente plusieurs outils de cao developpes au cours de l'etude, a savoir: une chaine complete d'edition; une chaine complete de verification; un routeur de canal; un routeur global; des post-processeurs de traduction et de visualisation
APA, Harvard, Vancouver, ISO, and other styles
6

Sun, Jiankai. "Directed Graph Analysis: Algorithms and Applications." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1565797455907422.

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

Kšica, Martin. "Struktury budoucích směrovacích tabulek pro IPv6." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237276.

Full text
Abstract:
This thesis is focused on structure of future IPv6 routing tables. It contains basic information about IPv6 addresses , description of hierarchy address allocation, multihoming , strategy of IPv4/IPv6 address allocation, statistics of structure properties at routing tables and forecast of future space for address IPv6 protocol. Other part of this thesis is implementation of IPv6 address generator which generates addresses according given configuration. This thesis simultaneously includes investigation of strategy IPv6 address allocation at region of RIPE NCC organization.
APA, Harvard, Vancouver, ISO, and other styles
8

Suryanarayan, Renuka. "U.S. Elite Newspapers' Pre- and Post-tsunami Coverage, 2003-2006: A Case Study of Sri Lanka." Ohio : Ohio University, 2008. http://www.ohiolink.edu/etd/view.cgi?ohiou1213978333.

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

Löfberg, Oskar, and August Krajewski. "The Round : An Observational Study of Ward 4 at Norrtälje Hospital." Thesis, KTH, Skolan för industriell teknik och management (ITM), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231899.

Full text
Abstract:
Healthcare is generally characterized by deep traditions, old working methods, and clear hierarchies. A central part of medical wards is the so-called “round”. During the round, physicians and nurses visit the patients and decide on further action. The round is a central process at wards and affect the rest of the working day, both for physicians and nurses. In this study, the round process was observed at Ward 4 at Norrtälje Hospital. The staff at Ward 4 experienced high-stress levels and this was related to an ineffective round according to a prestudy conducted by Clinical Innovation Fellowships. The project aimed at producing a new optimized round routine that would reduce the high-stress levels. The study was conducted through observations, dialogue with staff, interviews, surveys, comparative observations at other wards at Norrtälje Hospital and other hospitals as well as theoretical studies. The main difficulties discovered in our study with the round process at Norrtälje Hospital were that (i) information was communicated dual, (ii) the round process was too time-consuming, (iii) late decision-making, (iv) inefficient role for nurses and the (v) priority of work. The study resulted in a recommendation of a new round routine in which we have taken the staff’s interests into account as well as literature and research within the field of how developing healthcare processes. Our target was to increase communication and collaboration between physicians and nurses and furthermore exploiting human resources in the best possible way. Our main recommendation was to introduce a seated pre-round prior to commencing the daily round routine and to introduce a reconciliation meeting afterwards.
Sjukvård är generellt sett präglat av inrotade traditioner, gamla arbetsmetoder och tydliga hierarkier. En central del på medicinska avdelningar är den så kallade ronden. Under ronden besöker läkare och sköterskor patienterna och beslutar om vidare åtgärder. Arbetet under ronden påverkar sedan resten av arbetsdagen, både för läkare och sköterskor, eftersom den är en väldigt central del av arbetsdagen på en medicinavdelning. I denna studien så undersöktes rondprocessen på avdelning 4 på Norrtälje Sjukhus. Bakgrunden till detta var att personalen präglats av höga stressnivåer och att det varit ett resultat av en ineffektiv rond. Detta framkom från en förstudie utförd av Clinical Innovation Fellowships. Vår studie syftade i att producera en ny effektivare rondrutin som i sin tur skulle minska stressen hos personalen. Detta genomfördes med hjälp av observationer, dialog med personal, intervjuer, enkätundersökningar, jämförande observationer på andra avdelningar och andra sjukhus, och teoristudier. Dom största problemen som upptäcktes i vår studie var att (i) information kommuniceras dubbelt, (ii) ronden tog för lång tid, (iii) att beslut inte fattas tillräckligt fort, (iv) sköterskans roll under ronden och (v) prioritering av patienter. Studien resulterade i ett förslag till en ny rondrutin som strävar efter att öka kommunikation och samarbete mellan läkare och sköterskor, och samtidigt utnyttja personalresurser på ett optimalt sätt. Vår främsta rekommendation var att införa en sittrond före gåronden och avsluta med ett avstämningsmöte.
APA, Harvard, Vancouver, ISO, and other styles
10

Hsu, Wei-Sheng, and 徐偉昇. "Energy-Efficient Geographic RPL Routing Based on Analytic Hierarchy Process." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/99567493643003935197.

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

Books on the topic "Hierarchy routing"

1

Rural road hierarchy and lorry routeing. Edinburgh: Scottish Office and COSLA, 1997.

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

Burns, Tom, and Mike Firn. Research and development. Edited by Tom Burns and Mike Firn. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780198754237.003.0029.

Full text
Abstract:
This chapter covers the spectrum of routine monitoring, audit, service evaluation, and formal research. Routine monitoring is an essential task for all mental health professionals, and techniques to make it more palatable are explored, including using routine data for clinical supervision and monitoring team targets. Regular audit is described as an essential tool for logical service development and quality improvement. In the discussion of research, the importance of choosing the correct methodology and of paying attention to detail are stressed. In community psychiatry, sampling bias, regression to the mean, and the Hawthorne effect pose important risks. The hierarchy of research methods is outlined with randomized controlled trials (RCTs) at the top, preferably with either single- or double-blinding. Careful statistics and systematic reviews support evidence-based practice. In addition to experimental quantitative trials, there is a place for cohort and case control trials, as well as for qualitative trials to generate hypotheses.
APA, Harvard, Vancouver, ISO, and other styles
3

Chacón, Jennifer M., and Susan Bibler Coutin. Racialization through Enforcement. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198814887.003.0011.

Full text
Abstract:
Immigration law and enforcement choices have enhanced the salience of Latino racial identity in the United States. Yet, to date, courts and administrative agencies have proven remarkably reluctant to confront head on the role of race in immigration enforcement practices. Courts improperly conflate legal nationality and ‘national origin’, thereby cloaking in legality impermissible profiling based on national origin. Courts also maintain the primacy of purported security concerns over the equal protection concerns raised by racial profiling in routine immigration enforcement activities. This, in turn, promotes racially motivated policing practices, reifying both racial distinctions and racial discrimination. Drawing on textual analysis of judicial decisions as well as on interviews with immigrants and immigrant justice organization staff in California, this chapter illustrates how courts contribute to racialized immigration enforcement practices, and explores how those practices affect individual immigrants’ articulation of racial identity and their perceptions of race and racial hierarchy in their communities.
APA, Harvard, Vancouver, ISO, and other styles
4

Godreau, Isar P. Unfolkloric Slavery. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252038907.003.0004.

Full text
Abstract:
This chapter traces the history of plantation slavery and sugar cane in Ponce. Before emancipation, libertos performed tasks related to the processing of sugar in the mills. From the point of view of hacendados, libertos were the most knowledgeable labor force and the most familiar with daily routines of sugar production. That placed them at a high position in the hierarchy of labor. As the sugarcane industry became more mechanized, the knowledge and skills of libertos became more indispensable. Consequently, after the abolition of slavery in 1873, hacendados adopted various methods to try to keep libertos working for them. One strategy consisted of offering libertos small plots of land on the grounds of the hacienda. Libertos could farm and grow animals for their family's subsistence in these plots. The ownership of land, albeit small, also gave libertos some degree of autonomy.
APA, Harvard, Vancouver, ISO, and other styles
5

Termeer, Catrien, Arwin van Buuren, Art Dewulf, Dave Huitema, Heleen Mees, Sander Meijerink, and Marleen van Rijswick. Governance Arrangements for Adaptation to Climate Change. Oxford University Press, 2017. http://dx.doi.org/10.1093/acrefore/9780190228620.013.600.

Full text
Abstract:
Adaptation to climate change is not only a technical issue; above all, it is a matter of governance. Governance is more than government and includes the totality of interactions in which public as well as private actors participate, aiming to solve societal problems. Adaptation governance poses some specific, demanding challenges, such as the context of institutional fragmentation, as climate change involves almost all policy domains and governance levels; the persistent uncertainties about the nature and scale of risks and proposed solutions; and the need to make short-term policies based on long-term projections. Furthermore, adaptation is an emerging policy field with, at least for the time being, only weakly defined ambitions, responsibilities, procedures, routines, and solutions. Many scholars have already shown that complex problems, such as adaptation to climate change, cannot be solved in a straightforward way with actions taken by a hierarchic or monocentric form of governance. This raises the question of how to develop governance arrangements that contribute to realizing adaptation options and increasing the adaptive capacity of society. A series of seven basic elements have to be addressed in designing climate adaptation governance arrangements: the framing of the problem, the level(s) at which to act, the alignment across sectoral boundaries, the timing of the policies, the selection of policy instruments, the organization of the science-policy interface, and the most appropriate form of leadership. For each of these elements, this chapter suggests some tentative design principles. In addition to effectiveness and legitimacy, resilience is an important criterion for evaluating these arrangements. The development of governance arrangements is always context- and time-specific, and constrained by the formal and informal rules of existing institutions.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Hierarchy routing"

1

Zhang, Xiao-Ming, Yi-Jie Wang, and ZhouJun Li. "Research of Routing Algorithm in Hierarchy-Adaptive P2P Systems." In Parallel and Distributed Processing and Applications, 728–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74742-0_65.

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

Wang, Ying-Hong, Hung-Jen Mao, Chih-Hsiao Tsai, and Chih-Chieh Chuang. "HMRP: Hierarchy-Based Multipath Routing Protocol for Wireless Sensor Networks." In Embedded and Ubiquitous Computing – EUC 2005 Workshops, 452–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11596042_47.

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

Ashok Kumar, A. R., S. V. Rao, Diganta Goswami, and Ganesh Sahukari. "DCell-IP: DCell Emboldened with IP Address Hierarchy for Efficient Routing." In Advances in Intelligent Systems and Computing, 739–46. New Delhi: Springer India, 2013. http://dx.doi.org/10.1007/978-81-322-0740-5_88.

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

Rai, Ashok Kumar, and A. K. Daniel. "An Energy-Efficient Routing Protocol Using Threshold Hierarchy for Heterogeneous Wireless Sensor Network." In Intelligent Data Communication Technologies and Internet of Things, 553–70. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-9509-7_45.

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

Patidar, Harshit Prakash, and Neetu Sharma. "Adaptive Approach of AODV and DSDV Routing Protocols Using Optimal Probabilistic Logical Key Hierarchy in MANET." In Advances in Intelligent Systems and Computing, 715–31. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-0135-2_69.

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

Haque, Enamul, and Norihiko Yoshida. "Clustering in Wireless Sensor Networks." In Internet and Distributed Computing Advancements, 197–211. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0161-1.ch008.

Full text
Abstract:
Applications of Wireless Sensor Networks (WSN) have been expanded from industrial operation to daily common use. With the pace of development, a good number of state-of-the-art routing protocols have been proposed for WSN. Among many of these protocols, hierarchical or cluster-based protocol technique is adopted from the wired network because of its scalability, better manageability, and implicit energy efficiency. In this chapter, the authors have surveyed Low Energy Adaptive Clustering Hierarchy, Power-Efficient Gathering in Sensor Information Systems, Adaptive Periodic Threshold-Sensitive Energy Efficient Sensor Network, and Hybrid Energy-Efficient Distributed Routing Protocols. These protocols exhibit notable characteristics and advantages compared to their contemporaries. Again, context aware computing and applications have been greatly emphasized in recent articles by renowned technologists. This approach is considered as a momentous technology that will change the way of interaction with information devices. Accordingly, context aware clustering technique carries a great deal of importance among WSN routing protocols. Therefore, the authors have investigated noteworthy context aware routing protocols such as: Context Adaptive Clustering, Data-Aware Clustering Hierarchy, Context-Aware Clustering Hierarchy, and Context-Aware Multilayer Hierarchical Protocol. Their investigation and analysis of these protocols has been included in this chapter with useful remarks. Context awareness is considered an integral part of Body Sensor Networks (BSN), which is one kind of WSN. Thus, the authors have also discussed issues related to context aware techniques used in BSN.
APA, Harvard, Vancouver, ISO, and other styles
7

Weisser, Marc-Antoine, Joanna Tomasik, and Dominique Barth. "Exploiting the Inter-Domain Hierarchy for the QoS Network Management." In Intelligent Quality of Service Technologies and Network Management, 239–55. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-61520-791-6.ch013.

Full text
Abstract:
The Internet is an interconnection of multiple networks called domains. Inter-domain routing is ensured by BGP which preserves each domain’s independence and announces routes arbitrarily chosen by domains. BGP messages carry no information concerning quality parameters of announced routes. The authors’ goal is to provide domains with information regarding the congestion state of other domains without any changes in BGP. A domain, which is aware of heavily congested domains, can choose a bypass instead of a route exhibiting possible problems with QoS satisfaction. They propose a mechanism which sends alert messages in order to notify domains about the congestion state of other domains. The major difficulty consists in avoiding flooding the Internet with signaling messages. The authors’ solution limits the number of alerts by taking advantage of the hierarchical structure of the Internet set by P2C and P2P relationships. Their algorithm is distributed and heuristic because it is a solution to an NP-complete and inapproximable problem. They prove these properties by reducing the Steiner problem in directed acyclic graphs to our problem of alert diffusion. The simulations show that our mechanism significantly diminishes the number of unavailable domains and routes compared to those obtained with BGP routing and with a theoretical centralized mechanism.
APA, Harvard, Vancouver, ISO, and other styles
8

Sarella, Venkata Ramana, Deshai Nakka, Sekhar B. V. D. S., Krishna Rao Sala, and Sameer Chakravarthy V. V. S. S. "An Experimental Analysis of Modified EEECARP." In Advances in Library and Information Science, 318–36. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-1786-4.ch012.

Full text
Abstract:
Designing various energy-saving routing protocols for real-time internet of things (IoT) applications in modern secure wireless sensor networks (MS-WSN) is a tough task. Many hierarchical protocols for WSNs were not well scalable to large-scale IoT applications. Low energy adaptive two-level-CH clustering hierarchy (LEATCH) is an optimized technique reduces the energy-utilization of few cluster heads, but the LEATCH is not suitable for scalable and dynamic routing. For dynamic routing in MS-WSN, energy efficiency and event clustering adaptive routing protocol (EEECARP) with event-based dynamic clustering and relay communication by selecting intermediates nodes as relay-nodes is necessary. However, EEECARP cannot consider the hop-count, different magnitude ecological conditions, and energy wastage in cluster formation while collisions occur. So, the authors propose the modified EEECARP to address these issues for better dynamic event clustering adaptive routing to improve the lifetime of MS-WSNs. The experimental outcomes show that proposed protocol achieves better results than EEECARP and LEATCH.
APA, Harvard, Vancouver, ISO, and other styles
9

Acharya, Sasmita, and C. R. Tripathy. "A Fuzzy Knowledge Based Fault Tolerance Mechanism for Wireless Sensor Networks." In Sensor Technology, 679–97. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-2454-1.ch032.

Full text
Abstract:
Wireless Sensor Networks (WSNs) are the focus of considerable research for different applications. This paper proposes a Fuzzy Knowledge based Artificial Neural Network Routing (ANNR) fault tolerance mechanism for WSNs. The proposed method uses an exponential Bi-directional Associative Memory (eBAM) for the encoding and decoding of data packets and application of Intelligent Sleeping Mechanism (ISM) to conserve energy. A combination of fuzzy rules is used to identify the faulty nodes in the network. The Cluster Head (CH) acts as the data aggregator in the network. It applies the fuzzy knowledge based Node Appraisal Technique (NAT) in order to identify the faulty nodes in the network. The performance of the proposed ANNR is compared with that of Low-Energy Adaptive Clustering Hierarchy (LEACH), Dual Homed Routing (DHR) and Informer Homed Routing (IHR) through simulation.
APA, Harvard, Vancouver, ISO, and other styles
10

Zverovich, Vadim. "Emergency Response: Navigable Networks and Optimal Routing in Hazardous Indoor Environments." In Modern Applications of Graph Theory, 109–212. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198856740.003.0003.

Full text
Abstract:
The extreme importance of emergency response in complex buildings during natural and human-induced disasters has been widely acknowledged. This chapter studies algorithms for safest routes and balanced routes in buildings where an extreme event with many epicentres is occurring. In a balanced route, a trade-off between route length and hazard proximity is made. Another algorithm is proposed for finding the optimal indoor routes for search and rescue teams. This is based on a novel approach integrating the Analytic Hierarchy Process (AHP), the propagation of hazard and other techniques, and where three criteria are used: hazard proximity, distance/travel time, and route complexity. The important feature of the algorithm is its ability to generate an optimal route depending on the user’s needs. Finally, a novel automated construction of the Variable Density Network (VDN) for determining egress paths in dangerous environments is discussed.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hierarchy routing"

1

Zu-jue Chen and Xie-guang Ma. "Energy-balanced adaptive hierarchy routing protocol." In 2010 International Conference on Educational and Information Technology (ICEIT). IEEE, 2010. http://dx.doi.org/10.1109/iceit.2010.5607599.

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

Tsuchiya, P. F. "The landmark hierarchy: a new hierarchy for routing in very large networks." In Symposium proceedings. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/52324.52329.

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

Chang, Chin-Chih, Jason Cong, and Zhigang (David) Pan. "Physical hierarchy generation with routing congestion control." In the 2002 international symposium. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/505388.505399.

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

Chen, Jing, and Fengqi Yu. "A Uniformly Distributed Adaptive Clustering Hierarchy Routing Protocol." In 2007 IEEE International Conference on Integration Technology. IEEE, 2007. http://dx.doi.org/10.1109/icitechnology.2007.4290394.

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

Chapagain, Nawa Raj, Subrat Subedi, Neha Joshi, Bibek Rai, Binay Paudyal, Ashish Regmi, Rajiv Bishwokarma, Saroj Ghimire, and Komal Atreya. "TRANSMISSION LINE ROUTING USING GIS TOOLS OF SPATIAL SCIENCES." In The International Symposium on the Analytic Hierarchy Process. Creative Decisions Foundation, 2020. http://dx.doi.org/10.13033/isahp.y2020.067.

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

Kashyab, Indu, R. K. Rathy, and Diwaker Pandey. "A hierarchy based routing protocol for disaster recovery system." In 2014 International Conference on Optimization, Reliabilty, and Information Technology (ICROIT). IEEE, 2014. http://dx.doi.org/10.1109/icroit.2014.6798317.

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

Zhang, Cong, Huilin Jin, Jienan Chen, Jinkuan Zhu, and Jinting Luo. "A Hierarchy MCTS Algorithm for The Automated PCB Routing." In 2020 IEEE 16th International Conference on Control & Automation (ICCA). IEEE, 2020. http://dx.doi.org/10.1109/icca51439.2020.9264558.

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

Han, Lei, Lin Qiao, Can Lv, and Xuelu Yu. "Level Based Clustering Hierarchy Routing for Wireless Sensor Networks." In 2014 International Conference on Advanced ICT (ICAICTE-2014). Paris, France: Atlantis Press, 2014. http://dx.doi.org/10.2991/icaicte-14.2014.14.

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

Zhao, Liqiang, Zhi Yu, Jingwen Niu, Hailin Zhang, and Wei Ding. "A Hybrid Routing Protocol for Hierarchy Wireless Mesh Networks." In 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2010. http://dx.doi.org/10.1109/wicom.2010.5600953.

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

Mouzna, Joseph, Sandesh Uppoor, Mounir Boussedjra, and M. M. Manohara Pai. "Density aware routing using road hierarchy for vehicular networks." In 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics (SOLI). IEEE, 2009. http://dx.doi.org/10.1109/soli.2009.5203974.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Hierarchy routing' for particular source types:
Journal articles Dissertations / Theses
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