Relevant bibliographies by topics / Hierarchical routing (Computer network management)

Contents

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

Academic literature on the topic 'Hierarchical routing (Computer network management)'

Author: Grafiati
Published: 4 June 2021
Last updated: 4 February 2022

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 (Computer network management).'

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 (Computer network management)"

1

Moh, Melody, Rashmi Kukanur, Xuquan Lin, and Subhankar Dhar. "Energy-Efficient Self-Organizing Routing for Wireless Mobile Networks." International Journal of Business Data Communications and Networking 5, no. 4 (October 2009): 52–69. http://dx.doi.org/10.4018/jbdcn.2009091704.

Full text
Abstract:
The instant deployment without relying on an existing infrastructure makes mobile ad hoc networks (MANET) a striking 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 article proposes a hierarchical routing scheme that is scalable, energy efficient, and self-organizing. The new algorithm that is discussed in this article is 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 balanced throughout the network, and the network reorganizes itself around the dynamically selected leader nodes. Time, space, and message complexities are formally analyzed and implementation issues are also addressed. Incorporating the IEEE 802.11 medium access control mechanism and 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 to 50% while achieving a comparable level of network performance.
APA, Harvard, Vancouver, ISO, and other styles
2

ALFA, ATTAHIRU SULE, and DONG QIANG LIU. "POSTMAN ROUTING PROBLEM IN A HIERARCHICAL NETWORK." Engineering Optimization 14, no. 2 (November 1988): 127–38. http://dx.doi.org/10.1080/03052158808941206.

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

Chen, Chin-Ling, Yu-Ting Tsai, Aniello Castiglione, and Francesco Palmieri. "Using bivariate polynomial to design a dynamic key management scheme for wireless sensor networks." Computer Science and Information Systems 10, no. 2 (2013): 589–609. http://dx.doi.org/10.2298/csis120907025c.

Full text
Abstract:
Wireless sensor networks (WSN) have become increasingly popular in monitoring environments such as: disaster relief operations, seismic data collection, monitoring wildlife and military intelligence. The sensor typically consists of small, inexpensive, battery-powered sensing devices fitted with wireless transmitters, which can be spatially scattered to form an ad hoc hierarchically structured network. Recently, the global positioning system (GPS) facilities were embedded into the sensor node architecture to identify its location within the operating environment. This mechanism may be exploited to extend the WSN?s applications. To face with the security requirements and challenges in hierarchical WSNs, we propose a dynamic location-aware key management scheme based on the bivariate polynomial key predistribution, where the aggregation cluster nodes can easily find their best routing path to the base station, by containing the energy consumption, storage and computation demands in both the cluster nodes and the sensor nodes. This scheme is robust from the security point of view and able to work efficiently, despite the highly constrained nature of sensor nodes.
APA, Harvard, Vancouver, ISO, and other styles
4

Alphonse PJA, Sivaraj C, and Janakiraman T N. "An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks." International Journal of Distributed Systems and Technologies 8, no. 3 (July 2017): 43–66. http://dx.doi.org/10.4018/ijdst.2017070103.

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
5

Yang, Hwanseok. "A Study on Improving Secure Routing Performance Using Trust Model in MANET." Mobile Information Systems 2020 (September 16, 2020): 1–17. http://dx.doi.org/10.1155/2020/8819587.

Full text
Abstract:
MANET is utilized in many fields because of its advantage in quickly establishing networks. The network will perform well if mobile nodes trust each other and act cooperatively. However, dynamic topology characteristics and frequent connection failures by the movement of nodes make routing difficult and cause vulnerability to be easily exposed. Therefore, the routing provided in the MANET should have security features that can reduce the damage to various attacks. For this, in this paper, it is proposed for a trust evaluation method of nodes using cluster structure and a secure data transmission technique through key exchange without CA. The proposed technique adopted a hierarchical structure to enhance the efficiency of the reliability evaluation of nodes. The reliability measurement reflects the quality of packets as well as the number of packets and the measured reliability is maintained by the trust management node. The integrity of the data transmission is improved through key exchange without CA between the nodes. In order to increase the efficiency of routing, anomaly nodes are detected by DSN checking of nodes that generate excessive traffic on the path when data is transmitted. The proposed technique in this paper can maintain stably the network performance even in the presence of malicious nodes because it ensures reliability evaluation for nodes and the path setting between nodes and secure data transmission. The superior performance of the proposed trust-based model security routing technique was confirmed through comparative experiments for packet delivery ratio, end-to-end delay time, the number of control packets, network throughput, and average path length.
APA, Harvard, Vancouver, ISO, and other styles
6

Jerbi, Wassim, Abderrahmen Guermazi, and Hafedh Trabelsi. "A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks." International Journal of Business Data Communications and Networking 11, no. 2 (July 2015): 1–21. http://dx.doi.org/10.4018/ijbdcn.2015070101.

Full text
Abstract:
The optimum use of coverage in wireless sensor networks (WSNs) is very important. The hierarchical routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy) is referred to as the basic algorithm of distributed clustering protocols. LEACH allows clusters formation. Each cluster has a leader called Cluster Head (CH). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node join a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus several sensor nodes cannot reach any CH. As a result, the remaining part of the controlled field will not be covered; some sensor nodes will be outside the network. To solve this problem, the authors propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy), a routing protocol that takes into account the orphan nodes. O-LEACH presents two scenarios, a gateway and sub cluster that allow the joining of orphan nodes.
APA, Harvard, Vancouver, ISO, and other styles
7

Chang, B. "Distributed cost-based update policies for QoS routing on hierarchical networks." Information Sciences 159, no. 1-2 (January 20, 2004): 87–108. http://dx.doi.org/10.1016/s0020-0255(03)00191-9.

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

Roy, Siuli, Anurag D, and Somprakash Bandyopadhyay. "Testbed Implementation of a Pollution Monitoring System Using Wireless Sensor Network for the Protection of Public Spaces." International Journal of Business Data Communications and Networking 5, no. 4 (October 2009): 16–32. http://dx.doi.org/10.4018/jbdcn.2009091702.

Full text
Abstract:
Air pollution is an important environmental issue that has a direct effect on human health and ecological balance. Factories, power plants, vehicles, windblown dust and wildfires are some of the contributors of to pollution. Reasonable simulation tools exist for evaluating large scale sensor networks, ; however, they fail to capture significant details of node operation or practical aspects of wireless communication. Real life testbeds, capture the realism and bring out important aspects for further research. In this paper, we present an implementation of a wireless sensor network testbed for automatic and real-time monitoring of environmental pollution for the protection of public spaces. The paper describes the physical setup, the sensor node hardware and software architecture for “anytime, anywhere” monitoring and management of pollution data through a single, Web-based graphical user interface. The paper presents practical issues in the integration of sensors, actual power consumption rates and develops a practical hierarchical routing methodology.
APA, Harvard, Vancouver, ISO, and other styles
9

Girão-Silva, Rita, José Craveirinha, and João Clímaco. "Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution." International Transactions in Operational Research 16, no. 3 (May 2009): 275–305. http://dx.doi.org/10.1111/j.1475-3995.2009.00669.x.

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

Chang, B. "Analysis of adaptive cost functions for dynamic update policies for QoS routing in hierarchical networks." Information Sciences 151 (May 2003): 1–26. http://dx.doi.org/10.1016/s0020-0255(02)00274-8.

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

Dissertations / Theses on the topic "Hierarchical routing (Computer network management)"

1

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
2

CHENG, YI. "Security Mechanisms for Mobile Ad Hoc and Wireless Sensor Networks." University of Cincinnati / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1212076752.

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

Windmill, Christopher Mark. "Hierarchical network topographical routing." Thesis, University of Glasgow, 2013. http://theses.gla.ac.uk/4607/.

Full text
Abstract:
Within the last 10 years the content consumption model that underlies many of the assumptions about traffic aggregation within the Internet has changed; the previous short burst transfer followed by longer periods of inactivity that allowed for statistical aggregation of traffic has been increasingly replaced by continuous data transfer models. Approaching this issue from a clean slate perspective; this work looks at the design of a network routing structure and supporting protocols for assisting in the delivery of large scale content services. Rather than approaching a content support model through existing IP models the work takes a fresh look at Internet routing through a hierarchical model in order to highlight the benefits that can be gained with a new structural Internet or through similar modifications to the existing IP model. The work is divided into three major sections: investigating the existing UK based Internet structure as compared to the traditional Autonomous System (AS) Internet structural model; a localised hierarchical network topographical routing model; and intelligent distributed localised service models. The work begins by looking at the United Kingdom (UK) Internet structure as an example of a current generation technical and economic model with shared access to the last mile connectivity and a large scale wholesale network between Internet Service Providers (ISPs) and the end user. This model combined with the Internet Protocol (IP) address allocation and transparency of the wholesale network results in an enforced inefficiency within the overall network restricting the ability of ISPs to collaborate. From this model a core / edge separation hierarchical virtual tree based routing protocol based on the physical network topography (layers 2 and 3) is developed to remove this enforced inefficiency by allowing direct management and control at the lowest levels of the network. This model acts as the base layer for further distributed intelligent services such as management and content delivery to enable both ISPs and third parties to actively collaborate and provide content from the most efficient source.
APA, Harvard, Vancouver, ISO, and other styles
4

Roughgarden, Tim. "Selfish routing." online access from Digital Dissertation Consortium access full-text, 2002. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?3050436.

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

Yan, Wei. "Synchronization, buffer management, and multicast routing in multimedia networks." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/13426.

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

Jain, Sushant. "Routing in delay tolerant networks /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6922.

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

Zhao, Wenrui. "Routing and Network Design in Delay Tolerant Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14085.

Full text
Abstract:
Delay tolerant networks (DTNs) are a class of emerging networks that exhibit significantly different characteristics from today's Internet, such as intermittent connectivity, large delay, and high loss rates. DTNs have important applications in disaster relief, military, rural Internet access, environmental sensing and surveillance, interplanetary communication, underwater sensing, and vehicular communication. While not the common case for networking, DTNs represent some of the most critical cases, where the ability to communicate can make a huge difference for human lives. Supporting effective communication in DTNs, however, is challenging. First, with intermittent connectivity, DTNs are often extremely limited in capacity. Second, given resource limitations and uncertainty in DTNs, it is critical to deliver data efficiently and robustly. The situation is especially acute for multicast which sends data to multiple destinations. This thesis seeks to address these two issues. To enhance network capacity in DTNs, we propose a message ferrying scheme that exploits the use of special mobile nodes (called message ferries) and controlled device mobility to deliver data. Message ferries are utilized to transport data via mobility between sources and destinations. We develop a foundation for the control of the mobility of message ferries, and nodes if possible, to cooperatively deliver data under a variety of conditions. We also study another approach which deploys new nodes called throwboxes to enhance capacity. Throwboxes are small and inexpensive wireless devices. By relaying data between mobile nodes, throwboxes are able to create data transfer opportunities that otherwise would not exist. We systematically investigate the issues of deployment and routing, and develop algorithms for various deployment and routing approaches. Based on extensive evaluation, we obtain several findings to guide the design and operation of throwbox-augmented DTNs. To address the issue of efficient and robust data delivery, we focus on DTN multicasting. Given the unique characteristics of DTNs, traditional solutions such as IP multicast can not be simply ported to DTNs. We identify the limitations of IP multicast semantics in DTNs and define new semantic models for DTN multicast. Based on these semantic models, we develop and evaluate several multicast routing algorithms with different routing strategies.
APA, Harvard, Vancouver, ISO, and other styles
8

Praveenkumar, Ramesh. "Investigation of routing protocols in a sensor network." Birmingham, Ala. : University of Alabama at Birmingham, 2006. http://www.mhsl.uab.edu/dt/2006m/praveenkumar.pdf.

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

Al-Mousa, Yamin Samir. "MAC/routing design for under water sensor networks /." Online version of thesis, 2007. http://hdl.handle.net/1850/4496.

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

Mahajan, Ratul. "Practical and efficient internet routing with competing interests /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6960.

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

Books on the topic "Hierarchical routing (Computer network management)"

1

Chiong, John. SNA interconnections: Bridgingand routing in hierarchical, peer, and high-speed networks. New York: McGraw-Hill, 1996.

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

Caballero, Ricardo J. Partially optimal routing. Cambridge, MA: Massachusetts Institute of Technology, Dept. of Economics, 2006.

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

John, Chiong. SNA interconnections: Bridging and routing in hierarchical, peer, and high-speed networks. New York: McGraw-Hill, 1996.

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

Pardalos, P. M. (Panos M.), 1954- and SpringerLink (Online service), eds. Mathematical Aspects of Network Routing Optimization. New York, NY: Springer Science+Business Media, LLC, 2011.

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

Wallace, Kevin. Routing: Video mentor. Indianapolis, Ind: Cisco Press, 2009.

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

Implementing Cisco IP routing (ROUTE) foundation learning guide. Indianapolis, Ind: Cisco Press, 2010.

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

Woungang, Isaac. Routing in Opportunistic Networks. New York, NY: Springer New York, 2013.

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

Donohue, Denise. CCNP routing and switching quick reference. Indianapolis, Ind: Cisco Press, 2010.

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

Ji hui wang luo: Gao xiao shu ju fen fa ji shu = JIHUI WANGLUO : GAOXIAO SHUJU FENFA JISHU. Chengdu: Dian zi ke ji da xue chu ban she, 2014.

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

Giladi, Ran. Network processors: Architecture, programming, and implementation. Amsterdam: Morgan Kaufmann, 2008.

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

Book chapters on the topic "Hierarchical routing (Computer network management)"

1

Roy, Sohini, and Ayan Kumar Das. "Secure Hierarchical Routing Protocol (SHRP) for Wireless Sensor Network." In Communications in Computer and Information Science, 20–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44966-0_3.

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

Tong, Endong, Wenjia Niu, Gang Li, Hui Tang, Ding Tang, and Song Ci. "Hierarchical Workflow Management in Wireless Sensor Network." In Lecture Notes in Computer Science, 601–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32695-0_53.

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

Dubnicki, Cezary, Kai Li, and Malena Mesarina. "Network interface support for user-level buffer management." In Parallel Computer Routing and Communication, 256–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58429-3_42.

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

Lemeshko, Oleksandr, Olena Nevzorova, Andriy Ilyashenko, and Maryna Yevdokymenko. "Hierarchical Coordination Method of Inter-area Routing in Backboneless Network." In Advances in Computer Science for Engineering and Education II, 90–102. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16621-2_9.

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

Mohapatra, Seli, B. K. Ratha, and Kshirabdhi Tanaya Dhal. "Implementation of Multipath-Based Multicast Routing Protocol in Hierarchical Wireless Sensor Network." In Advances in Data Science and Management, 345–54. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-0978-0_34.

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

Das, Ayan Kumar, Rituparna Chaki, and Atreyee Biswas. "Power Aware Cluster Based Routing (PACBR) Protocol for Wireless Sensor Network." In Computer Information Systems and Industrial Management, 289–300. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40925-7_27.

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

Strassner, John, Sung-Su Kim, and James Won-Ki Hong. "Semantic Routing for Improved Network Management in the Future Internet." In Communications in Computer and Information Science, 163–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14171-3_14.

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

You, Peng, Yang Huixian, and Man Sha. "An ACO and Energy Management Routing Algorithm for ZigBee Network." In Communications in Computer and Information Science, 185–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19853-3_27.

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

Flegkas, Paris, Panos Trimintzios, George Pavlou, Ilias Adrikopoulos, and Carlos F. Calvacanti. "On Policy-Based Extensible Hierarchical Network Management in QoS-Enabled IP Networks." In Lecture Notes in Computer Science, 230–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44569-2_15.

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

Khan, Bilal, Dardo D. Kleiner, and David Talmage. "Towards an Agent-based Distributed Hierarchical Network Management System for All-Optical Networks." In Lecture Notes in Computer Science, 103–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44651-6_11.

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

Conference papers on the topic "Hierarchical routing (Computer network management)"

1

Santos, Bruno Pereira, Luiz Filipe Menezes Vieira, and Antonio Alfredo Ferreira Loureiro. "Routing and Mobility Management in the Internet of Things." In XXXVIII Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/sbrc_estendido.2020.12415.

Full text
Abstract:
This Ph.D. Thesis proposes new techniques for routing and mobility management for Internet of Things (IoT). In the future IoT, everyday mobile objects will probably be connected to the Internet. Currently, static IoT's devices have already been connected, but handle mobile devices suitably still being an open issue in IoT context. Then, solutions for routing mobility detection, handover, and mobility management are proposed through an algorithm that integrates Machine Learning (ML) and mobility metrics to figure out devices' mobility events, which we named Dribble. Also, an IPv6 hierarchical routing protocol named Mobile Matrix to boost efficient (memory and fault tolerance) end-to-end connectivity over mobility scenarios. The Thesis contributions are supported by numerous peer-reviewed publications in national and international conferences and journals included in ISI-JCR. Also, the applicability of this Thesis is evident by showing that our results overcome state-of-the-art in static and mobile scenarios, as well as, the impact of the proposed solutions is a step forward in at least two new research areas so-called Internet of Mobile Things (IoMT) and Social IoT, where devices move around and do social ties respectively. Moreover, during the Ph.D. degree, the author has contributed to different computer network fields rather than routing by publishing in areas like social networks, smart cities, intelligent transportation systems, software-defined networks, and parallel computing.
APA, Harvard, Vancouver, ISO, and other styles
2

Jinmei Liang and Jingdong Yu. "A mobility management scheme based routing for hierarchical ad hoc networks." In 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icacte.2010.5579812.

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

Hosseinalipour, Ali, Davood KeyKhosravi, and Abbas Mirzaei Somarin. "New Hierarchical Routing Protocol for WSNs." In 2010 Second International Conference on Computer and Network Technology. IEEE, 2010. http://dx.doi.org/10.1109/iccnt.2010.103.

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

Kwon, Hoon, Jeong-Hee Kim, and Ho-Young Kwak. "A Hierarchical Routing Protocol for Sensor Network Reconfiguration." In 2008 Fourth International Conference on Networked Computing and Advanced Information Management (NCM). IEEE, 2008. http://dx.doi.org/10.1109/ncm.2008.86.

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

Huang, Jian-Jhong, Ying-Yu Chen, Chien Chen, and Yu Huang Chu. "Weighted routing in hierarchical multi-domain SDN controllers." In 2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS). IEEE, 2015. http://dx.doi.org/10.1109/apnoms.2015.7275362.

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

Wang, Yuan, Hua Xu, and Peifa Jia. "A hierarchical routing architecture for the aviation communication network." In 2009 ISECS International Colloquium on Computing, Communication, Control, and Management (CCCM). IEEE, 2009. http://dx.doi.org/10.1109/cccm.2009.5268053.

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

Qian, Kaiguo. "An Energy Balanced Wireless Sensor Network Hierarchical Routing Algorithm." In 2013 International Conference on Computer Sciences and Applications (CSA). IEEE, 2013. http://dx.doi.org/10.1109/csa.2013.42.

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

Zhang, Rui. "HPRP: Hierarchical Probabilistic Routing Protocol for Wireless Mesh Network." In 2009 Eighth IEEE/ACIS International Conference on Computer and Information Science. IEEE, 2009. http://dx.doi.org/10.1109/icis.2009.37.

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

Eun, JeeSook, and Heeyoung Jung. "The implementation of domain routing protocol in hierarchical domain network model." In 2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS). IEEE, 2015. http://dx.doi.org/10.1109/apnoms.2015.7275350.

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

Chenhui Ma, Yixi Guo, Jinhai Su, and Chao Yang. "Hierarchical routing scheme on wide-area quantum key distribution network." In 2016 2nd IEEE International Conference on Computer and Communications (ICCC). IEEE, 2016. http://dx.doi.org/10.1109/compcomm.2016.7925053.

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