Journal articles: '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.

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

11

GuhaNeogi, Subhrendu, Anand A. Bhaskar, and Prasun Chakrabarti. "Energy Efficient Hierarchy-based Clustering Routing Protocol for Wireless Sensor Networks." International Journal of Computer Applications 95, no. 13 (June 18, 2014): 1–8. http://dx.doi.org/10.5120/16651-6627.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Mahyastuty, Veronica Windha, and A. Adya Pramudita. "Low Energy Adaptive Clustering Hierarchy Routing Protocol for Wireless Sensor Network." TELKOMNIKA (Telecommunication Computing Electronics and Control) 12, no. 4 (December 1, 2014): 963. http://dx.doi.org/10.12928/telkomnika.v12i4.660.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Schley, Gert, Ibrahim Ahmed, Muhammad Afzal, and Martin Radetzki. "Reconfigurable fault tolerant routing for networks-on-chip with logical hierarchy." Computers & Electrical Engineering 51 (April 2016): 195–206. http://dx.doi.org/10.1016/j.compeleceng.2016.02.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Katsaros, Konstantinos, Mehrdad Dianati, Zhili Sun, and Rahim Tafazolli. "An evaluation of routing in vehicular networks using analytic hierarchy process." Wireless Communications and Mobile Computing 16, no. 8 (February 2, 2015): 895–911. http://dx.doi.org/10.1002/wcm.2578.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Aziz, Layla, and Hanane Aznaoui. "Efficient Routing Approach Using a Collaborative Strategy." Journal of Sensors 2020 (February 25, 2020): 1–17. http://dx.doi.org/10.1155/2020/2547061.

Full text

Abstract:

Wireless sensor networks (WSNs) are a huge number of sensors, which are distributed in area monitoring to collect important signals. WSNs are widely used in several applications such as home automation, environment, and healthcare monitoring. However, most of these applications face various difficulties due to sensor design. Therefore, the major challenge of designing WSNs is saving the energy consumed during communication and extending the network lifetime. Multicriteria Decision Analysis (MCDA) methods have been exploited for saving network energy. However, the majority of researches focus on the Cluster Head (CH) selection. In this paper, we aim to enhance the process of forwarder selection using an efficient combined multicriteria model. The proposed scheme improved the intercluster communication by controlling the distance separating CHs from the sink node. To minimize the cluster density, this work consists of activating only sensor nodes that detect enough strong signals. The activation phase presents a fault-tolerant technique to succeed in the communication process. Moreover, the proposed work is aimed at selecting the most efficient hops, which are responsible for routing data to the sink using the Analytic Hierarchy Process (AHP) and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) methods. Simulation results proved that our new protocol maximized the residual energy by 15% and 25% and the network lifetime by 35% and 47% compared to the Distributed Clustering Protocol using Voting and Priority (DCPVP) and Low-Energy Adaptive Clustering Hierarchy (LEACH), respectively.

APA, Harvard, Vancouver, ISO, and other styles

16

Liu, You Wu, Syazwina Binti Alias, Ming-yue Liu, and Bian-bian Jiao. "Improved Routing Protocol Based on Multiobjective Optimization in Industrial Robot Networks." Advances in Multimedia 2022 (January 12, 2022): 1–8. http://dx.doi.org/10.1155/2022/7012779.

Full text

Abstract:

This paper decomposes the routing process of industrial robot network using the application of analytic hierarchy process in decision-making. The influence of four factors, such as path length, data integrity, energy consumption, and receiving delay, on routing effect is analyzed. Simultaneous interpreting routes are selected to achieve the purpose of routing. Simulation results show that this method can more comprehensively consider the factors affecting routing and is superior to the existing methods in terms of energy consumption, data integrity, and transmission delay.

APA, Harvard, Vancouver, ISO, and other styles

17

Anzola, John, Jordán Pascual, Giovanny Tarazona, and Rubén González. "A Clustering WSN Routing Protocol Based on k-d Tree Algorithm." Sensors 18, no. 9 (September 1, 2018): 2899. http://dx.doi.org/10.3390/s18092899.

Full text

Abstract:

Clustering in wireless sensor networks has been widely discussed in the literature as a strategy to reduce power consumption. However, aspects such as cluster formation and cluster head (CH) node assignment strategies have a significant impact on quality of service, as energy savings imply restrictions in application usage and data traffic within the network. Regarding the first aspect, this article proposes a hierarchical routing protocol based on the k-d tree algorithm, taking a partition data structure of the space to organize nodes into clusters. For the second aspect, we propose a reactive mechanism for the formation of CH nodes, with the purpose of improving delay, jitter, and throughput, in contrast with the low-energy adaptive clustering hierarchy/hierarchy-centralized protocol and validating the results through simulation.

APA, Harvard, Vancouver, ISO, and other styles

18

Liu, Ya, and Zhen Xu. "Research on Wireless Sensor Network Routing Protocol Based on Internet of Things." Applied Mechanics and Materials 513-517 (February 2014): 1127–30. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1127.

Full text

Abstract:

The development and application of the Internet of things and the basic structure of wireless sensor network are briefly introduced,routing protocol in wireless sensor network is studied in detail. Since the wireless sensor network is a kind of energy-limited and resource-limited network, the routing protocol must guarantee the smaller routing expenses and the reducing energy consumption. Based on the analysis and research of existing wireless sensor network routing protocol, this paper emphasizes on the detailed analysis of the hierarchy routing protocol LEACH algorithm.The paper also introduces two improved algorithms according to the limit of LEACH protocol.

APA, Harvard, Vancouver, ISO, and other styles

19

Jaffri, Zain ul Abidin, Muhammad Asif, Wali Ullah Khan, Zeeshan Ahmad, Zain ul Abiden Akhtar, Kalim Ullah, and Md Sadek Ali. "TEZEM: A new energy-efficient routing protocol for next-generation wireless sensor networks." International Journal of Distributed Sensor Networks 18, no. 6 (June 2022): 155013292211072. http://dx.doi.org/10.1177/15501329221107246.

Full text

Abstract:

The design and implementation of energy-efficient routing protocols for next-generation wireless sensor networks is always a challenge due to limited power resource capabilities. Hierarchical (clustering) routing protocols appeared to be a remarkable solution for extending the lifetime of wireless sensor networks, particularly in application-aware (threshold-sensitive) and heterogeneity-aware cluster-based routing protocols. In this article, we propose a protocol, namely, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol. It is a heterogeneity-aware and threshold-based protocol that provides a better solution to existing problems in next-generation wireless sensor networks. During execution, the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol splits the entire network area into several zones to manage network traffic efficiently. In the first step, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is designed for a homogeneous network where the initial energy of all the nodes is the same. Thereafter, we bring in heterogeneity in the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol execution environment to optimize its energy consumption. By investigating the performance of the various numbers of divisions, it is proved that the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol with 9 zonal divisions has higher stability and throughput. The performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is compared with those of Stable Election Protocol, Low-Energy Adaptive Clustering Hierarchy, Modified Low-Energy Adaptive Clustering Hierarchy, and Gateway-Based Energy-Efficient Routing Protocol through computer simulations. Simulation results verify the improved performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol in terms of network stability, lifetime, and throughput.

APA, Harvard, Vancouver, ISO, and other styles

20

Chuang, Po Jen, and Teng Tai Hu. "BHAR: a bidirectional hierarchy-based anycast routing protocol for wireless sensor networks." International Journal of Communication Networks and Distributed Systems 13, no. 1 (2014): 1. http://dx.doi.org/10.1504/ijcnds.2014.063968.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Eid, Ahmed O., Amr Zamel, and Ibrahim E. Ziedan. "Improved Low Energy Adaptive Clustering Hierarchy in Wireless Sensor Network Routing Protocols." International Journal of Engineering and Technology 10, no. 5 (October 31, 2018): 1338–45. http://dx.doi.org/10.21817/ijet/2018/v10i5/181005041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Storandt, Sabine. "The Hierarchy in Grid Graphs (Extended Abstract)." Proceedings of the International Symposium on Combinatorial Search 4, no. 1 (August 20, 2021): 209–10. http://dx.doi.org/10.1609/socs.v4i1.18301.

Full text

Abstract:

Many speed-up techniques developed for accelerating the computation of shortest paths in road networks, like reach or contraction hierarchies, are based on the property that some streets are ’more important’ than others, e.g. on long routes the usage of an interstate is almost inevitable. In grids there is no obvious hierarchy among the edges, especially if the costs are uniform. Nevertheless we will show that contraction hierarchies can be applied to grid graphs as well. We will point out interesting connections to speed-up techniques shaped for routing on grids, like swamp hierarchies and jump points, and provide experimental results for game maps, mazes, random grids and rooms.

APA, Harvard, Vancouver, ISO, and other styles

23

Pachlor, Rohit, and Deepti Shrimankar. "VCH-ECCR: A Centralized Routing Protocol for Wireless Sensor Networks." Journal of Sensors 2017 (2017): 1–10. http://dx.doi.org/10.1155/2017/8946576.

Full text

Abstract:

A wireless sensor network (WSN) is a collection of hundreds to thousands of compact, battery-operated sensors. It is deployed to accumulate useful information from the nearby environment. Depending upon the type of application, the sensors have to work for months to years with a finite energy source. In some extreme environments, the replacement of energy source is challenging and sometimes not feasible. Therefore, it is vital for sensors to perform their duties in an energy efficient way to improve the longevity of the network. This paper proposes an energy-efficient centralized cluster-based routing protocol called Vice-Cluster-Head-Enabled Centralized Cluster-based Routing protocol (VCH-ECCR). The VCH-ECCR uses a two-level hierarchy of vice cluster heads to use the energy of sensors efficiently and to cut back the frequency of the clustering. The performance of VCH-ECCR is compared with low-energy adaptive clustering hierarchy (LEACH), LEACH-Centralized (LEACH-C), and base station controlled dynamic clustering protocol (BCDCP). The experimental results show that the VCH-ECCR outperforms over its comparative in terms of network lifetime, overall energy consumption, and throughput.

APA, Harvard, Vancouver, ISO, and other styles

24

Li, Lin, and Donghui Li. "An Energy-Balanced Routing Protocol for a Wireless Sensor Network." Journal of Sensors 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/8505616.

Full text

Abstract:

The wireless sensor network is an intelligent self-organizing network which consists of many sensor nodes deployed in the monitoring area. The greatest challenge of designing a wireless sensor network is to balance the energy consumption and prolong the lifetime of the network, seeing that the nodes can be powered only by batteries in most conditions. An energy-balanced routing protocol (EBRP) for wireless sensor networks is proposed in this paper. In EBRP, we divide the network into several clusters by using K-means++ algorithm and select the cluster head by using the fuzzy logical system (FLS). Since the previous researches did not demonstrate how to get the fuzzy rules for different networks, we propose a genetic algorithm (GA) to obtain the fuzzy rules. We code the rules as a chromosome, and the lifetime of the network is treated as a fit function. Then, through the selection, crossover, and mutation of each generation, the best offspring can be decoded as the best rule for each network model. Through the simulation, comparing with the existing routing protocols such as low-energy adaptive clustering hierarchy (LEACH), low-energy adaptive clustering hierarchy-centralized (LEACH-C), and stable election protocol (SEP), the EBRP prolongs the network lifetime (first node dies) by 57%, 63%, and 63%, respectively.

APA, Harvard, Vancouver, ISO, and other styles

25

Moussa, Sherif, Ghada Abdel Halim, and Salah Ramadan. "Study on the Hierarchical Routing Protocols for Wireless Sensor Networks." Applied Mechanics and Materials 850 (August 2016): 43–51. http://dx.doi.org/10.4028/www.scientific.net/amm.850.43.

Full text

Abstract:

Routing the sensed data is considered a main challenge in Wireless Sensor Networks (WSN) because the routing characteristics may vary depending on the network application and/or the network architecture. Since most sensor network applications work in clusters, hierarchical routing protocols have been developed to fit this network topology. This paper introduces the performance differentials for most common hierarchical routing protocols such as Low Energy Adaptive Clustering Hierarchy (LEACH) and Threshold sensitive Energy Efficient sensor Network protocol (TEEN). The design parameters of sensor networks are analyzed to present a classification and comparison of LEACH, TEEN routing protocols. The two protocols are analyzed using different mobility models using NS2 simulation tool. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks.

APA, Harvard, Vancouver, ISO, and other styles

26

Rakai, Logan, Laleh Behjat, Shawki Areibi, and Tamas Terlaky. "A Multilevel Congestion-Based Global Router." VLSI Design 2009 (November 17, 2009): 1–13. http://dx.doi.org/10.1155/2009/537341.

Full text

Abstract:

Routing in nanometer nodes creates an elevated level of importance for low-congestion routing. At the same time, advances in mathematical programming have increased the power to solve complex problems, such as the routing problem. Hence, new routing methods need to be developed that can combine advanced mathematical programming and modeling techniques to provide low-congestion solutions. In this paper, a hierarchical mathematical programming-based global routing technique that considers congestion is proposed. The main contributions presented in this paper include (i) implementation of congestion estimation based on actual routing solutions versus purely probabilistic techniques, (ii) development of a congestion-based hierarchy for solving the global routing problem, and (iii) generation of a robust framework for solving the routing problem using mathematical programming techniques. Experimental results illustrate that the proposed global router is capable of reducing congestion and overflow by as much as 36% compared to the state-of-the-art mathematical programming models.

APA, Harvard, Vancouver, ISO, and other styles

27

Yang, Pu-Tai, and Seokcheon Lee. "A Distributed Reclustering Hierarchy Routing Protocol Using Social Welfare in Wireless Sensor Networks." International Journal of Distributed Sensor Networks 8, no. 4 (April 1, 2012): 681026. http://dx.doi.org/10.1155/2012/681026.

Full text

Abstract:

In recent years, there has been a rapid proliferation of research concerning Wireless Sensor Networks (WSNs), due to the wide range of potential applications that they can be used for. Lifetime is one of the most important considerations for WSNs due to their inherent energy constraints, and various protocols have been proposed to overcome these difficulties. This study proposes a novel distributed reclustering routing protocol: Predictive and Adaptive Routing Protocol using Energy Welfare (PARPEW). PARPEW incorporates the concept of energy welfare (EW) to achieve both energy efficiency and energy balance simultaneously. PARPEW is equipped with a cluster head (CH) shift mechanism that utilizes predictive energy after transmission for the computation of EW. The average case time complexity of the shift mechanism belongs to [Formula: see text], where [Formula: see text] is the average number of sensors in a cluster in the WSN. Experimental results demonstrate that the new protocol is capable of significantly prolonging the lifetime of WSNs under various scenarios.

APA, Harvard, Vancouver, ISO, and other styles

28

Seno, Sayed, Doaa Abd Ali, and Mohammed Mohammed. "EFFICIENT ROUTING PROTOCOL ALGORITHM FOR WIRELESS SENSOR NETWORKS." Iraqi Journal for Computers and Informatics 44, no. 1 (June 30, 2018): 11–17. http://dx.doi.org/10.25195/ijci.v44i1.67.

Full text

Abstract:

Recently, different applications of wireless sensor networks (WSNs) in the industry fields using different data transfer protocols has been developed. As the energy of sensor nodes is limited, prolonging network lifetime in WSNs considered a significant occurrence. To develop network permanence, researchers had considered energy consuming in routing protocols of WSNs by using modified Low Energy Adaptive Clustering Hierarchy. This article presents a developed effective transfer protocols for autonomic WSNs. An efficient routing scheme for wireless sensor network regarded as significant components of electronic devices is proposed. An optimal election probability of a node to be cluster head has being presented. In addition, this article uses a Voronoi diagram, which decomposes the nodes into zone around each node. This diagram used in management architecture for WSNs.

APA, Harvard, Vancouver, ISO, and other styles

29

Rajivegandhi, C., K. Raghavi, and K. S. Jeyshree. "Low Energy Adaptive Clustering Hierarchy based routing Protocols Comparison for Wireless Sensor Networks." IOSR Journal of Computer Engineering 16, no. 6 (2014): 56–61. http://dx.doi.org/10.9790/0661-16625661.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Awerbuch, B., Y. Du, and Y. Shavitt. "The effect of network hierarchy structure on performance of ATM PNNI hierarchical routing." Computer Communications 23, no. 10 (May 2000): 980–86. http://dx.doi.org/10.1016/s0140-3664(99)00247-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Ashok Kumar, A. R., S. V. Rao, and Diganta Goswami. "Simple, efficient location-based routing for data center network using IP address hierarchy." International Journal of Network Management 26, no. 6 (August 24, 2016): 492–514. http://dx.doi.org/10.1002/nem.1946.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Luo, Ming Yu, and Meng Yang Chen. "Hexagonal Distributed Cluster-Base Routing Protocol Based on Event Triggering." Applied Mechanics and Materials 427-429 (September 2013): 2545–48. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2545.

Full text

Abstract:

For random distribution of large-scale wireless sensor network (WSN), the hexagonal distributed cluster-based multi-hop routing protocol based on event triggering (HDCMET) is proposed. Triggered by events, nodes optimize a cluster head, according to the rest energy. A cluster head chooses other nodes for a hexagon, with distance to the cluster, energy and so on. Simulation results show that this protocol prolongs the network life in total, improving the network performance in large-scale WSN, compared with the low energy adaptive cluster hierarchy (LEACH).

APA, Harvard, Vancouver, ISO, and other styles

33

Zhao, Zhong-Nan, Jian Wang, and Hong-Wei Guo. "A hierarchical adaptive routing algorithm of wireless sensor network based on software-defined network." International Journal of Distributed Sensor Networks 14, no. 8 (August 2018): 155014771879461. http://dx.doi.org/10.1177/1550147718794617.

Full text

Abstract:

The target tracking issue has always been the hotspot in wireless sensor network, and with the emergence of new application in multimedia and real-time transmission, new requirements are proposed for transmission performance of target tracking routing; therefore, a software-defined network–based hierarchical adaptive routing algorithm of wireless sensor network is proposed in this article. The algorithm takes into account both network energy and throughput, uses Hopfield neural network algorithm to calculate the optimal path among adjacent clusters as a local routing (LR), and builds the Multi-choice Knapsack Problem model based on local paths to realize end-to-end global routing, in order to realize the routing of tracking target information under multi-objective conditions. The test bed includes physical and simulation tests. Experimental results show that the proposed algorithm is superior to low energy adaptive clustering hierarchy (LEACH) and Sequential Assignment Routing under different test scenarios.

APA, Harvard, Vancouver, ISO, and other styles

34

Huang, Liang, Mei Wang, and Jing Wu. "Hierarchical Routing Algorithm for Wireless Sensor Network." Applied Mechanics and Materials 427-429 (September 2013): 2416–19. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2416.

Full text

Abstract:

Aiming at the deficiency in the hierarchical routing algorithm, an improved routing algorithm of ring based multi-hop clustering (IRBMC) is developed. The main idea of IRBMC is to divide wireless sensor networks field into heterogeneous spacing rings to control the cluster number and build unequal size of clusters in different rings. To ensure the higher energy level nodes having more chance to become cluster head, the improved average residual energy estimation is used to determine the probability of nodes in each ring to be the cluster heads. Simulation results illustrate that IRBMC has a better result in prolonging the lifetime of network with the multi-level energy than the stable election protocol (SEP) for clustered heterogeneous wireless sensor networks, the low-energy adaptive clustering hierarchy (LEACH), and the ring based multi-hop clustering (RBMC) algorithm. The lifetime of IRBMC is 1.14 times of SEP, 1.57 times of LEACH, and 1.6 times of RBMC.

APA, Harvard, Vancouver, ISO, and other styles

35

Brandl, Martin, Andreas Kos, Karlheinz Kellner, Christian Mayerhofer, Thomas Posnicek, and Christian Fabian. "A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks." International Journal of Wireless Networks and Broadband Technologies 1, no. 3 (July 2011): 49–70. http://dx.doi.org/10.4018/ijwnbt.2011070104.

Full text

Abstract:

Wireless Sensor Networks (WSNs) are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric (Pa) gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm (DSR). The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node’s attractiveness metric.

APA, Harvard, Vancouver, ISO, and other styles

36

Pabani, Jitander Kumar, Miguel-Ángel Luque-Nieto, Waheeduddin Hyder, and Alfonso Ariza. "Energy-Efficient Routing Protocol for Selecting Relay Nodes in Underwater Sensor Networks Based on Fuzzy Analytical Hierarchy Process." Sensors 22, no. 22 (November 18, 2022): 8930. http://dx.doi.org/10.3390/s22228930.

Full text

Abstract:

The use of underwater sensor networks (UWSNs) offers great advantages in many automatic observation services such as water monitoring (ocean, sea, etc.) and registering of geological events (landslides, earthquakes). However, UWSNs have many more limitations than terrestrial sensor networks (smaller bandwidth, higher delays, etc.) with new requirements such as low power consumption by nodes or being able to select appropriate routes in a dynamic topology due to water currents and movements. To cope with these problems, the use of a routing protocol is very important. In this paper we propose a routing technique that adapts to changes in the network topology, avoiding multiple retransmissions that would affect its overall performance. This protocol is energy-efficient and is implemented using a fuzzy analytical hierarchical process (FAHP) under multi-criteria decision making (MCDM) to make an intelligent routing decision based on objectives, criteria and alternatives. To select the next node on the route, several comparison matrices are used: number of hops, distances to the sink node, and number of neighbors. The results show that the proposed setup behaves similarly to other existing underwater sensor network routing schemes using fuzzy schemes such as SPRINT.

APA, Harvard, Vancouver, ISO, and other styles

37

Ouyang, Bai Cheng. "Research on the Automatic Routing Technology in the Logistics System and IOT." Applied Mechanics and Materials 608-609 (October 2014): 665–69. http://dx.doi.org/10.4028/www.scientific.net/amm.608-609.665.

Full text

Abstract:

With the rapid development of logistics enterprises, tradition logistics sorting has been unable to meet the needs of the development of express logistics. Combining with the RFID technology, the paper proposes a new way of logistics sorting and data routing. By increasing the RFID tag and the AWB in the express waybill will improve efficiency. Using Cluster head selection principle and clustering algorithm of LEACH (adaptive clustering hierarchy). Comparison with original system, verified the practicability of RFID technology and data routing algorithm in the sorting system and easy to use.

APA, Harvard, Vancouver, ISO, and other styles

38

Zhang, Dahua, Wei Li, and Tao Du. "A Multilevel Pseudo-Boolean Satisfiability-Based Approach for Segmented Channel Routing." Journal of Circuits, Systems and Computers 24, no. 06 (May 26, 2015): 1550083. http://dx.doi.org/10.1142/s0218126615500838.

Full text

Abstract:

The segmented channel routing problem is fundamental to the routing of row-based field programmable gate arrays (FPGAs) and is proven to be nondeterministic polynomial time (NP) complete. In this paper, we capitalize on the compelling advancements in satisfiability (SAT) solvers to propose a multilevel pseudo-Boolean SAT-based approach. We construct several levels of hierarchy amongst the nets and the routing problem of each level is formulated as a pseudo-Boolean optimization (PBO) problem. Moreover, an optimization technique of reducing the number of variables in PBO problems is described to improve the scalability of the proposed method. Similar to the SAT-based routing, the unroutability of a given circuit can be proved by the approach. Experimental results show that the proposed method compares very favorably with existing algorithms and achieves the best convergence rate.

APA, Harvard, Vancouver, ISO, and other styles

39

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

40

Chao Wang, Chao Wang, Wen-Wen Zha Chao Wang, Cheng Zhu Wen-Wen Zha, Wen-Yang Wang Cheng Zhu, Guang-Bo Li Wen-Yang Wang, Liang Tao Guang-Bo Li, Hui-Min Ma Liang Tao, and Jun Jiao Hui-Min Ma. "LEACH Clustering Routing Protocol Based on Balanced Energy Consumption." 電腦學刊 33, no. 5 (October 2022): 151–62. http://dx.doi.org/10.53106/199115992022103305013.

Full text

Abstract:

Faced with the problems of unbalanced energy consumption (EC) and short lifetime of nodes in Wireless Sensor Networks (WSN), a Low Energy Adaptive Clustering Hierarchy (LEACH) clustering routing protocol based on energy balance, namely LEACH-EB (LEACH Based on Energy Balance) protocol was proposed. At the initial selection stage, the nodes which are close to the base station (BS) with great remaining energy and many neighbor nodes are selected as the cluster heads (CHs); then, the non-CH nodes enter the clusters which have the least costs based on the strength and remaining energy of the communication signals between themselves and different CHs. At the data transmission stage, if the CH which sends the information is one hop away from BS, the CH needs to select a neighbor CH with the largest forwarding probability as the next hop relay node based on the remaining energy of each neighbor CH, the number of nodes in the cluster, and the distance from BS. The selected neighbor CH continues to determine the next hop in the above manner until the data is successfully sent to BS. Simulation tests show that LEACH-EB protocol can receive more data and extend the network life cycle by 60%, 43.1%, and 13.36% compared with LEACH, LEACH-C, and FIGWO, respectively.

APA, Harvard, Vancouver, ISO, and other styles

41

El Ouadi, Mohammed Réda, and Abderrahim Hasbi. "Comparison of LEACH and PEGASIS Hierarchical Routing Protocols in WSN." International Journal of Online and Biomedical Engineering (iJOE) 16, no. 09 (August 13, 2020): 159. http://dx.doi.org/10.3991/ijoe.v16i09.14691.

Full text

Abstract:

Wireless Sensor Networks is a group of sensor nodes dispatched in a geographical area for a defined objective. These sensor nodes are characterized by limited capacity of communicating, computing and especially of energy. The performance of these WSN is resting on a good routing protocol, hence the need to choose the routing protocol able to satisfy the wsn's objectives, and to satisfy the common challenge to prolong network life time.Several routing concepts have been proposed for the WSN, hierarchical routing is one of the most used concepts. It is divided into 3 types: cluster based routing, grid based routing and chain based protocol. In this paper, we are interested to Study, analyse and compare two popular routing protocols for Wireless sensor networks (WSNs), Low-Energy Adaptive Clustering Hierarchy (LEACH) using clusters based concept and Power-Efficient Gathering in Sensor Information System (PEGASIS) with chain based concept. The both protocols are simulated with Matlab simulator, in order to evaluate its performances against the different users and the WSNs objectives defined.

APA, Harvard, Vancouver, ISO, and other styles

42

Hui, Fei, Xiao Le Wang, and Xin Shi. "A STATIC-LEACH WSNs for Hazardous Materials Monitoring." Advanced Materials Research 463-464 (February 2012): 261–65. http://dx.doi.org/10.4028/www.scientific.net/amr.463-464.261.

Full text

Abstract:

In this paper, hazardous materials transportation monitoring system is designed, implemented, and tested using Wireless Sensor Networks (WSNs). According to energy consumption and response time during clustering of Wireless Sensor Networks LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol, we proposed STATIC-LEACH routing protocol based on static clustering, it can effectively reduce energy consumption of the wireless sensor nodes and reduce network latency of cluster. With WSN and GSM/GPRS, low cost and easy deployment remote monitoring is possible without interfering with the operation of the transportation.

APA, Harvard, Vancouver, ISO, and other styles

43

Du, Sen, Junjie Hou, Shijin Song, Yuefeng Song, and Yongxin Zhu. "A geographical hierarchy greedy routing strategy for vehicular big data communications over millimeter wave." Physical Communication 40 (June 2020): 101065. http://dx.doi.org/10.1016/j.phycom.2020.101065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Yuan, Zhong Hu, Bin Li, and Nan Wang. "A New Geography and Energy Cluster Algorithm for Routing Protocol in Wireless Sensor Network." Advanced Materials Research 971-973 (June 2014): 1966–69. http://dx.doi.org/10.4028/www.scientific.net/amr.971-973.1966.

Full text

Abstract:

The energy of the node in Wireless Sensor Network (WSN) is supplied by the battery, and the energy is limited. In this paper, the more energy-efficient WSN routing protocol is improved, to support the operation of the WSN to prolong the lifetime of network as much as possible. On the basis of the existing Low Energy Adaptive Clustering Hierarchy (LEACH) routing protocol, a new Geography and Energy Cluster Algorithm is proposed. The new algorithm not only improve the biggest connectivity of the clustering routing protocol, but also balance the energy consumption of the whole network, and achieve more energy-efficient . The results of the simulation of the software indicated that the new improvement of GECA protocol is more efficient and prolongs the WSN lifetime.

APA, Harvard, Vancouver, ISO, and other styles

45

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

46

WANG, DAJIN. "AN EMPIRICAL STUDY OF HIERARCHICAL DIVISION FOR MESH-STRUCTURED NETWORKS." Journal of Interconnection Networks 08, no. 03 (September 2007): 285–304. http://dx.doi.org/10.1142/s0219265907002028.

Full text

Abstract:

A parallel/distributed system consists of a collection of processes, which are distributed over a network of processors, and work in a cooperative manner to fulfill various tasks. A hierarchical approach is to group and organize the distributed processes into a logical hierarchy of multiple levels to achieve better system performance. It has been proposed as an effective way to solve various problems in distributed computing, such as distributed monitoring, resource scheduling, and network routing. In [21], we studied hierarchical configuration for mesh and hypercube networks to the end of achieving better system performance. In particular, we proposed theoretically optimal hierarchy for mesh and hypercube, so that the total traffic flow over the network is minimized. In this paper, we present the experimental results to establish the practical relevance of mesh hierarchy proposed in [21]. We simulated situations for multi-level division, real network loading scenarios, random data aggregation rates, and different division sizes other than derived in [21]. The simulation results not only show that the analytically obtained hierarchy works well for many realistic settings, but also offer some useful insights into the proposed hierarchy scheme.

APA, Harvard, Vancouver, ISO, and other styles

47

Li, Zhong Min. "Energy Consumption Balance LEACH Routing Protocol for Wireless Sensor Networks." Applied Mechanics and Materials 536-537 (April 2014): 744–47. http://dx.doi.org/10.4028/www.scientific.net/amm.536-537.744.

Full text

Abstract:

Energy consumption is an open issue in research field of Wireless Sensor Networks (WSNs). Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is the most additional routing protocol in WSNs. In LEACH, Cluster Head (CH) is selected randomly, not considering any parameter such as node energy, distance, which causes shortening its lifetime while energy consumption is unbalanced in WSNs. In this paper, it proposes a new LEACH-based protocol, energy consumption balance LEACH protocol. Firstly, all nodes are grouped based on their locations, and a CH is elected in every group, which ensures CHs even distribution in the network area. And an important factor selecting CHs, node energy is considered, which further energy consumption in WSNs. The results of simulation show that ECB-LEACH can increase energy efficiency and prolong the network lifetime.

APA, Harvard, Vancouver, ISO, and other styles

48

Gao, Lu, Zhong Min Li, and Jing Jing Wu. "A Survey on Clustering and Routing on LEACH for Wireless Sensor Network." Applied Mechanics and Materials 336-338 (July 2013): 248–52. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.248.

Full text

Abstract:

In recent years, Wireless Sensor Networks (WSNs) have been promising approaches for a variety of application monitoring and capturing the required data from the environment. Due to the restricted communication range and high density of sensor nodes, routing in WSNs has been considered an important field of research over the past decade. The most popular protocol for clustering in WSNs is Low Energy Adaptive Clustering Hierarchy (LEACH) which is based on adaptive clustering technique. The factors affecting LEACH efficiency include Cluster Head (CH), topology structure and routing algorithm. This paper provides in the past years the taxonomy of various clustering and routing techniques based on LEACH in WSNs. The paper highlights the primary principle of each improved protocol and emphasize on their advantages and disadvantages compared to the LEACH.

APA, Harvard, Vancouver, ISO, and other styles

49

Acharya, Sasmita, and C. R. Tripathy. "A Fuzzy Knowledge Based Fault Tolerance Mechanism for Wireless Sensor Networks." International Journal of Rough Sets and Data Analysis 5, no. 1 (January 2018): 99–116. http://dx.doi.org/10.4018/ijrsda.2018010107.

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

50

Dilip Charaan, R. M., P. R. Therasa, and P. Malathi. "A REVIEW ON DESCENDANTS OF LEACH PROTOCOL - A PRAGMATIC APPROACH." International Journal of Advanced Research 10, no. 03 (March 31, 2022): 751–59. http://dx.doi.org/10.21474/ijar01/14444.

Full text

Abstract:

A Wireless Sensor Networks (WSN) is a Wireless Networks comprising of spatially disseminated independent sensors to screen physical or natural circumstances. The battery power in these sensor nodes assumes a significant part in expanding the life expectancy of the nodes. Hierarchical routing protocols are the most popular protocols to limit the energy utilization when compared to Flat Routing. Low-Energy Adaptive Clustering Hierarchy (LEACH) is a traditional Cluster based routing protocol for WSNs having great execution, energy productivity, and successful in elongating the lifetime of the network life time by consuming a little level of the complete disseminated energy in the framework. This paper reviews the condition of craft of various progressed, enhanced routing protocols that have been created from the LEACH. This paper features a portion of the downsides and issues of LEACH how these issues are vanquished by the relatives of LEACH. Appraisal of descendants of LEACH routing protocols in advised with regards to versatility, self-association, and conveyance of nodes, network control, Hop count, energy proficiency, and utilization of data.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Hierarchy routing'

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