To see the other types of publications on this topic, follow the link: Hierarchical routing algorithms.
Journal articles on the topic 'Hierarchical routing algorithms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Hierarchical routing algorithms.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
DATTA, AJOY K., JERRY L. DERBY, JAMES E. LAWRENCE, and SÉBASTIEN TIXEUIL. "STABILIZING HIERARCHICAL ROUTING." Journal of Interconnection Networks 01, no. 04 (December 2000): 283–302. http://dx.doi.org/10.1142/s0219265900000172.
Full textAbstract:
Hierarchical routing provides a less expensive algorithm compared to the traditional all-pairs routing algorithms. We present an algorithm in this paper which benefits from the lower memory requirement, faster routing table lookup, and less costly broadcast exemplified by hierarchical routing, and yet maintains routing capability of all pairs of connected nodes even in the presence of faults, such as link/node failures and repairs, and corruption of program variables. Additionally, this algorithm solves the problem of cluster partitioning where nodes that are supposed to be in the same subset of the network, become isolated due to link or node failures. Being self-stabilizing, starting from an arbitrary state (with possibly corrupted routing tables), the protocol is guaranteed to reach a configuration with routing tables containing valid entries in a finite time. The protocol automatically updates the shortest paths in the face of dynamically changing link weights. The proposed protocol also dynamically allocates/deallocates storage for the routing information as the network size changes. The algorithm works on an arbitrary topology and under a distributed daemon model.
2
Hachtel, G. D., and C. R. Morrison. "Linear complexity algorithms for hierarchical routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 8, no. 1 (1989): 64–80. http://dx.doi.org/10.1109/43.21820.
Full text
3
Du, Tao, Qing Bei Guo, Kun Zhang, and Kai Wang. "An Energy Aware Routing Algorithm for WSNs Based on Semi-Static Clustering." Applied Mechanics and Materials 752-753 (April 2015): 1413–18. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1413.
Full textAbstract:
Energy efficiency is a key factor to improve WSNs’ performance, and hierarchical routing algorithms are fitter in large scale networks and have more reliability, so they are mostly used to improve the nodes’ energy efficiency now. In this paper, mainly existing hierarchical routing algorithms are introduced, and based on these researches, a new energy efficient hierarchical routing algorithm designed based on energy aware semi-static clustering method is proposed. In this algorithm named EASCA, the nodes’ residual energy and cost of communication would both be considered when clustering. And a special packet head is defined to update nodes’ energy information when transmitting message; to rotate cluster head automatically, a member management scheme is designed to complete this function; and a re-cluster mechanism is used to dynamic adjust the clusters to make sensor nodes organization more reasonable. At last, EASCA is compared with other typical hierarchical routing algorithms in a series of experiments, and the experiments’ result proves that EASCA has obviously improved WSNs’ energy efficiency.
4
Keykhosravi, Davood, and Ali Hosseinalipour. "New Fault-Tolerant Hierarchical Routing Protocol for WSNs." Advanced Materials Research 433-440 (January 2012): 3223–29. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.3223.
Full textAbstract:
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.
5
Sang, Lei, and Duo Long. "Application of Ant Colony Algorithm to the Hierarchical Routing in Wireless Sensor Networks." Advanced Materials Research 989-994 (July 2014): 1833–36. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.1833.
Full textAbstract:
Wireless sensor networks (WSN) have become a hot research topic in the field of computer science. Since WSNs are characterized by limited node energy, dynamic topological structure and data fusion, the design of WSN routing protocols is faced with new problems and challenges. In recent years, many new routing algorithms for wireless sensor networks have appeared, but they all have some shortcomings. This paper studies and analyzes these routing protocols, and in view of their shortcomings, proposes a WSN hierarchical routing protocol based on ant colony algorithm. And a simulation test is conducted on this improved routing protocol, and the simulation result proves that this algorithm basically achieves the design objectives of WSN routing algorithms.
6
Saravanan, S., A. Jayanthiladevi, and M. Geetha. "Fuzzy-Ant Colony based Routing on Road Networks." APTIKOM Journal on Computer Science and Information Technologies 1, no. 1 (March 1, 2016): 33–40. http://dx.doi.org/10.11591/aptikom.j.csit.102.
Full textAbstract:
Route selection is essential in everyday life. We have several algorithms for detecting efficient route on Large Road Networks. This paper introduces the hierarchical community, is presented. It splits large road networks into hierarchical structure. It introduces a multi parameter route selection system which employs Fuzzy Logic (FL) and ant’s behavior in nature is applied to the dynamic routing. The important rates of parameters such as path length and traffic are adjustable by the user. The purposes of the new hierarchical routing algorithm significantly reduce the search space. We develop a community-based hierarchical graph model that supports Dynamic, efficient route computation on large road networks.
7
Saravanan, S., A. Jayanthiladevi, and M. Geetha. "Fuzzy-Ant Colony based Routing on Road Networks." APTIKOM Journal on Computer Science and Information Technologies 1, no. 1 (February 20, 2016): 33–40. http://dx.doi.org/10.34306/csit.v1i1.42.
Full textAbstract:
Route selection is essential in everyday life. We have several algorithms for detecting efficient route on Large Road Networks. This paper introduces the hierarchical community, is presented. It splits large road networks into hierarchical structure. It introduces a multi parameter route selection system which employs Fuzzy Logic (FL) and ant’s behavior in nature is applied to the dynamic routing. The important rates of parameters such as path length and traffic are adjustable by the user. The purposes of the new hierarchical routing algorithm significantly reduce the search space. We develop a community-based hierarchical graph model that supports Dynamic, efficient route computation on large road networks.
8
Roy, Sohini. "Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network." Foundations of Computing and Decision Sciences 40, no. 3 (September 1, 2015): 203–22. http://dx.doi.org/10.1515/fcds-2015-0013.
Full textAbstract:
Abstract Wireless Sensor Network (WSN) has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS) aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC) algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC).
9
Al-Sadoon, Maha, and Ahmed Jedidi. "A secure trust-based protocol for hierarchical routing in wireless sensor network." International Journal of Electrical and Computer Engineering (IJECE) 12, no. 4 (August 1, 2022): 3838. http://dx.doi.org/10.11591/ijece.v12i4.pp3838-3849.
Full textAbstract:
<p><span>Wireless sensor networks (WSNs) became the backbone of the internet of things (IoT). IoT applications are vital and demand specific quality of service (QoS) requirements. In addition, security has become a primary concern to provide secure communication between wireless nodes, with additional challenges related to the node’s computational resources. Particular, the design of secure and resource efficient routing protocol is a critical issue in the current deployment of WSNs. Therefore, this paper proposes a novel secure-trust aware routing protocol (ST2A) that provides secure and reliable routing. The proposed protocol establishes communication routes based on calculated trust value in joint with a novel cluster head selection algorithm in the hierarchical routing process. The proposed trust-aware routing algorithm improves the routing security in WSN and optimizes many performance metrics related to WSNs unique characteristics. The results of simulation validate the feasibility of the proposed algorithm for enhancing the network lifetime up to 18% and data delivery by 17% as compared with some state-of-the-art routing algorithms.</span></p>
10
Kalpana, M., R. Dhanalakshmi, and P. Parthiban. "Prolonging the Lifetime of Wireless Sensor Networks Interconnected to Fixed Network Using Hierarchical Energy Tree Based Routing Algorithm." Scientific World Journal 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/158420.
Full textAbstract:
This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN). It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA) based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP). The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.
11
Sinha, Ditipriya, Uma Bhattacharya, and Rituparna Chaki. "Clar: A Novel Cluster Oriented Agent Based Routing Protocol for Manet." Foundations of Computing and Decision Sciences 38, no. 1 (March 1, 2013): 3–23. http://dx.doi.org/10.2478/v10209-011-0018-5.
Full textAbstract:
Abstract In this paper we propose a novel algorithm CLAR to build an agent based routing protocol using ACO technique in cluster based mobile ad-hoc networks. Clustering makes possible hierarchical routing in which paths are recorded between cluster-heads instead of nodes. This reduces routing overheads. Presence of an unstable and non-reliable cluster-head degrades the performance of the network since cluster-heads of the network take active role in routing messages between a source destination pair. The proposed algorithm chooses the most reliable and stable node as cluster-head depending on four criteria i.e.: stability, battery power, degree, and trust value of the node. It also uses a multiagent based routing algorithm to generate load balanced routes between source and destination in cluster-based network. Performance of CLAR is compared with other existing efficient algorithms such as AODV, CBRP, Wu & Li’s Algorithm, dominating set based clustering algorithms, agent-based algorithms named as SACO and MALBACO. Simulation results prove that the proposed protocol combines merits of both clustering approach and agent based approach and provides efficient packet delivery even in the presence of high load in the network
12
Yang, Yinghui, Qunting Yang, and Tiegang Gao. "Improvement of Hierarchical Routing Algorithm in Wireless Sensor Network." International Journal of Online and Biomedical Engineering (iJOE) 15, no. 01 (January 17, 2019): 71. http://dx.doi.org/10.3991/ijoe.v15i01.9780.
Full textAbstract:
<span lang="EN-US">To prolong the life cycle of the network and increase the effective data transmission quantity of the network</span><span lang="EN-US">, several classic network layer routing algorithms are analyzed and they are implemented with programming language, which verifies their real advantages and disadvantages.</span><span lang="EN-US"> I</span><span lang="EN-US">n the model of ring networking, the optimal number of cluster heads in the annular region is deduced with the goal of minimizing the average energy consumption of cluster heads in each ring,</span><span lang="EN-US">and the formation mechanism of cluster heads is proposed for the purpose of preferentially using nodes with more residual energy as cluster heads.</span><span lang="EN-US">To further optimize energy consumption performance, a dynamic self-organizing multi-hop routing selection mode is proposed.</span><span lang="EN-US">Finally, the network simulation software is applied to construct the model based on ring network, and the optimization algorithm is adopted to obtain the flow chart of actual programming and some programming methods.</span><span lang="EN-US">The results show that the proposed algorithm achieves the ultimate optimization goal, which increases the number of effective monitoring data packets.</span>
13
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 textAbstract:
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.
14
Nejad, Mark Mahyar, Lena Mashayekhy, Ratna Babu Chinnam, and Anthony Phillips. "Hierarchical time-dependent shortest path algorithms for vehicle routing under ITS." IIE Transactions 48, no. 2 (December 21, 2015): 158–69. http://dx.doi.org/10.1080/0740817x.2015.1078523.
Full text
15
Xue, Xingsi, Ramalingam Shanmugam, SatheeshKumar Palanisamy, Osamah Ibrahim Khalaf, Dhanasekaran Selvaraj, and Ghaida Muttashar Abdulsahib. "A Hybrid Cross Layer with Harris-Hawk-Optimization-Based Efficient Routing for Wireless Sensor Networks." Symmetry 15, no. 2 (February 7, 2023): 438. http://dx.doi.org/10.3390/sym15020438.
Full textAbstract:
Efficient clustering and routing is a main challenge in a wireless sensor network (WSN). To achieve better quality-of-service (QoS) performance, this work introduces k-medoids with improved artificial-bee-colony (K-IABC)-based energy-efficient clustering and the cross-layer-based Harris-hawks-optimization-algorithm (CL-HHO) routing protocol for WSN. To overcome the power-asymmetry problem in wireless sensor networks, a cross-layer-based optimal-routing solution is proposed. The goal of cross-layer routing algorithms is to decrease network-transmission delay and power consumption. This algorithm which was used to evaluate and select the effective path route and data transfer was implemented using MATLAB, and the results were compared to some existing techniques. The proposed CL-HHO performs well in packet-loss ratio (PLR), throughput, end-to-end delay (E2E), jitter, network lifetime (NLT) and buffer occupancy. These results are then validated by comparing them to traditional routing strategies such as hierarchical energy-efficient data gathering (HEED), energy-efficient-clustering routing protocol (EECRP), Grey wolf optimization (GWO), and cross-layer-based Ant-Lion optimization (CL-ALO). Compared to the HEED, EECRP, GWO, and CL-ALO algorithms, the proposed CL-HHO outperforms them.
16
Wang, Jun Wei, and Yong Tao Wei. "PSO-Based Trust QoS Routing Algorithm for Wireless Sensor Networks." Applied Mechanics and Materials 401-403 (September 2013): 1751–55. http://dx.doi.org/10.4028/www.scientific.net/amm.401-403.1751.
Full textAbstract:
The existing routing algorithm of Wireless Sensor Networks (WSNs) pays more attention to the energy efficient. However, Quality of Service (QoS) supported and the validity of packet transmission unveil additional challenges. Based on the Particle Swarm Optimization (PSO), this paper presents a trust QoS routing algorithm for WSNs. Hierarchical structure is adopted and the trust value of the node is constructed with the direct trust value and the indirect trust value. In addition, delivery delay and packet loss are considered as main QoS metrics. Finally, under the optimization ability of PSO, the proposed algorithm tries to find the route with maximum residual energy and reliability in order to maximize network utilization as well as meets QoS constraints. Compared to typical routing algorithms in sensor networks, this new algorithm has better performance.
17
Wang, Jun Wei, and Wen Yi Sun. "Improved HEED Based Trust Routing Algorithm for WSNs." Advanced Materials Research 989-994 (July 2014): 4405–8. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.4405.
Full textAbstract:
In Wireless Sensor Networks (WSNs), besides the energy efficient, trust and Quality of Service (QoS) supported should be considered under some circumstances. All of them unveil additional challenges for routing scheme design. Based on Hybrid Energy - Efficient Distributed clustering (HEED) protocol, this paper presents a trust QoS routing algorithm for WSNs. Hierarchical structure is adopted and the trust value of the node is constructed by the direct trust value and the indirect trust value. In HEED, the combination of the trust value and residual energy as the main parameter and the propagation delay as the secondary parameter. The former guarantees the credibility of the data transmission, and the latter ensures the load balance of the entire network. Compared to typical routing algorithms of sensor networks, the proposed algorithm has better performance.
18
Wu, Jie, and Haifeng Qian. "Multitriangle: A Constant Node Degree Interconnection Network." International Journal of Foundations of Computer Science 08, no. 02 (June 1997): 187–209. http://dx.doi.org/10.1142/s0129054197000148.
Full textAbstract:
We propose a constant node degree network topology, multitriangle, which is hierarchical, recursive, and expansive. First we introduce a corner cutting approach that generates a set of new network topologies (including multitriangles), followed by a formal definition of the multitriangle network and discussion of its properties. The salient features of this network are that it is a constant node degree network and it can be viewed as a hierarchical ring, a popular topology which has been adopted in several commercial systems. Algorithms for node-to-node routing, hierarchical ring routing, optimal ring routing, and broadcasting are presented. The multitriangle network is analyzed in terms of diameter, degree, average distance, and message density, and results are compared with other relevant networks.
19
Barkouk, Hamid, El Mokhtar En-Naimi, and Aziz Mahboub. "Performance evaluation of hierarchical clustering protocols with fuzzy C-means." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 4 (August 1, 2021): 3212. http://dx.doi.org/10.11591/ijece.v11i4.pp3212-3221.
Full textAbstract:
The longevity of the network and the lack of resources are the main problems within the WSN. Minimizing energy dissipation and optimizing the lifespan of the WSN network are real challenges in the design of WSN routing protocols. Load balanced clustering increases the reliability of the system and enhances coordination between different nodes within the network. WSN is one of the main technologies dedicated to the detection, sensing, and monitoring of physical phenomena of the environment. For illustration, detection, and measurement of vibration, pressure, temperature, and sound. The WSN can be integrated into many domains, like street parking systems, smart roads, and industrial. This paper examines the efficiency of our two proposed clustering algorithms: Fuzzy C-means based hierarchical routing approach for homogeneous WSN (F-LEACH) and fuzzy distributed energy efficient clustering algorithm (F-DEEC) through a detailed comparison of WSN performance parameters such as the instability and stability duration, lifetime of the network, number of cluster heads per round and the number of alive nodes. The fuzzy C-means based on hierarchical routing approach is based on fuzzy C-means and low-energy adaptive clustering hierarchy (LEACH) protocol. The fuzzy distributed energy efficient clustering algorithm is based on fuzzy C-means and design of a distributed energy efficient clustering (DEEC) protocol. The technical capability of each protocol is measured according to the studied parameters.
20
El Alami, Hassan, and Abdellah Najid. "EEA." International Journal of Wireless Networks and Broadband Technologies 7, no. 2 (July 2018): 19–37. http://dx.doi.org/10.4018/ijwnbt.2018070102.
Full textAbstract:
The data communication task, in wireless sensor networks (WSNs), is a major issue of high energy consumption. A hierarchical design based on a clustering algorithm is one of the approaches to manage the data communication and save energy in WSNs. However, most of the previous approaches based on clustering algorithms have not considered the length of the data communication path, which is a direct relation to energy consumption in WSNs. In this article, a novel scheme of a clustering algorithm has been proposed for reducing the data communication distance in WSNs. Hierarchical routing protocols were implemented for homogeneous and heterogeneous networks. The results show that the proposed scheme is more efficient than other protocols.
21
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 textAbstract:
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.
22
Jassim, Waseem M., and Ammar E. Abdelkareem. "Performance Enhancement of Oil pipeline Monitoring for a Simulated Underwater Wireless Sensor Network." Al-Nahrain Journal for Engineering Sciences 23, no. 3 (November 21, 2020): 260–66. http://dx.doi.org/10.29194/njes.23030260.
Full textAbstract:
In the last two decades, underwater acoustic sensor networks have begun to be used for commercial and non-commercial purposes. In this paper, the focus will be on improving the monitoring performance system of oil pipelines. Linear wireless sensor networks are a model of underwater applications for which many solutions have been developed through several research studies in previous years for data collection research. In underwater environments, there are certain inherent limitations, like large propagation delays, high error rate, limited bandwidth capacity, and communication with short-range. Many deployment algorithms and routing algorithms have been used in this field. In this work a new hierarchical network model proposed with improvement to Smart Redirect or Jump algorithm (SRJ). This improved algorithm is used in an underwater linear wireless sensor network for data transfer to reduce the complexity in routing algorithm for relay nodes which boost delay in communication. This work is implemented using OMNeT++ and MATLAB based on their integration. The results obtained based on throughput, energy consumption, and end to the end delay.
23
Shanavas, I. Hameem, and R. K. Gnanamurthy. "Optimal Solution for VLSI Physical Design Automation Using Hybrid Genetic Algorithm." Mathematical Problems in Engineering 2014 (2014): 1–15. http://dx.doi.org/10.1155/2014/809642.
Full textAbstract:
In Optimization of VLSI Physical Design, area minimization and interconnect length minimization is an important objective in physical design automation of very large scale integration chips. The objective of minimizing the area and interconnect length would scale down the size of integrated chips. To meet the above objective, it is necessary to find an optimal solution for physical design components like partitioning, floorplanning, placement, and routing. This work helps to perform the optimization of the benchmark circuits with the above said components of physical design using hierarchical approach of evolutionary algorithms. The goal of minimizing the delay in partitioning, minimizing the silicon area in floorplanning, minimizing the layout area in placement, minimizing the wirelength in routing has indefinite influence on other criteria like power, clock, speed, cost, and so forth. Hybrid evolutionary algorithm is applied on each of its phases to achieve the objective. Because evolutionary algorithm that includes one or many local search steps within its evolutionary cycles to obtain the minimization of area and interconnect length. This approach combines a hierarchical design like genetic algorithm and simulated annealing to attain the objective. This hybrid approach can quickly produce optimal solutions for the popular benchmarks.
24
Khan, Humera. "A Survey on hierarchical cluster-based energy efficient routing protocol for wireless sensor networks." International Journal of Engineering & Technology 7, no. 2.8 (March 19, 2018): 216. http://dx.doi.org/10.14419/ijet.v7i2.8.10412.
Full textAbstract:
Wireless Sensor Network is a widely growing field and it comprises of tiny sensor nodes. These sensor nodes are distributed in the environment spatially. They are capable of sensing the environment, gathering the information and processing it. Each sensor node collaborate with other sensor nodes for processing the information. Sensor nodes have very limited resources available for their operation. For the purpose of consuming resources in an efficient way several routing algorithms are employed. Here the focus is mainly on hierarchical cluster based routing techniques. In this paper we provide an introduction for wireless sensor network, the requirement for reduction in energy consumption of sensor nodes and some of the already existing energy efficient routing protocols of wireless sensor network.
25
Saini, Vandana, and Meenu Khurana. "A Multi-Zone Based Hierarchical Protocol for Routing in Wireless Sensor Networks." ECS Transactions 107, no. 1 (April 24, 2022): 9489–96. http://dx.doi.org/10.1149/10701.9489ecst.
Full textAbstract:
Wireless sensor networks (WSNs) are used in many applications due to their small size and low cost. However, due to the limited battery constraint in WSNs, it faces several challenges of node failure, data drop, etc. There are many routing algorithms in the literature that ensures the energy efficiency routing by enhancing the network lifetime. But still the challenges of data aggregation, dynamic path selection needs much attention to further maximize the nodes lifetime. In this paper, a multi-hop routing is proposed with an additionally deployed master node to minimize the load on cluster head (CH) and base station (BS) node. The master node is deployed in the middle of the network, and it has been assumed that a master node is static node with power connection. The proposed network is divided into multiple zones according to nodes energy. The proposed network has shown better throughput and network lifetime. Also, the proposed scheme has shown lesser data drop and failure rate.
26
JEMAI, JABER. "A NOVEL APPROACH FOR SOLVING THE DYNAMIC VEHICLE ROUTING PROBLEM BASED ON HIERARCHICAL SELF-ORGANIZING MAPS." International Journal of Computational Intelligence and Applications 13, no. 04 (December 2014): 1450025. http://dx.doi.org/10.1142/s1469026814500254.
Full textAbstract:
Dynamic routing problems ask for policies and algorithms to build reactive plans able to integrate dynamically generated requests in currently running plans. The main desired quality of such approaches is to overcome the lack of information availability in the beginning of the solving process. That is by proposing flexible partial solutions anticipating future requests. In this paper, we propose a neural model based on Hierarchical self-organizing maps (HSOM) for solving the dynamic vehicle routing problem (DVRP). The DVRP consists of finding routes for a set of vehicles to serve customer's dynamically issued requests while minimizing routing costs and satisfying some constraints. We present the concept of problem control bloc (PCB) to represent the problem to solve by the HSOM algorithm when triggered by a new event. The overall solving approach is integrated within a discrete event manager that will wait for any new event to build the PCB, call the HSOM solver, get the proposed solution and update the running plan accordingly. The proposed approach was applied to solve the DVRP problems adapted from VRP benchmarks. The obtained results are compared to the best known solutions.
27
Li, Mingke, Heather McGrath, and Emmanuel Stefanakis. "Geovisualization of Hydrological Flow in Hexagonal Grid Systems." Geographies 2, no. 2 (April 29, 2022): 227–44. http://dx.doi.org/10.3390/geographies2020016.
Full textAbstract:
Recent research has extended conventional hydrological algorithms into a hexagonal grid and noted that hydrological modeling on a hexagonal mesh grid outperformed that on a rectangular grid. Among the hydrological products, flow routing grids are the base of many other hydrological simulations, such as flow accumulation, watershed delineation, and stream networks. However, most of the previous research adopted the D6 algorithm, which is analogous to the D8 algorithm over a rectangular grid, to produce flow routing. This paper explored another four methods regarding generating flow directions in a hexagonal grid, based on four algorithms of slope aspect computation. We also developed and visualized hexagonal-grid-based hydrological operations, including flow accumulation, watershed delineation, and hydrological indices computation. Experiments were carried out across multiple grid resolutions with various terrain roughness. The results showed that flow direction can vary among different approaches, and the impact of such variation can propagate to flow accumulation, watershed delineation, and hydrological indices production, which was reflected by the cell-wise comparison and visualization. This research is practical for hydrological analysis in hexagonal, hierarchical grids, such as Discrete Global Grid Systems, and the developed operations can be used in flood modeling in the real world.
28
Devika, G., D. Ramesh, and Asha Gowda Karegowda. "Analysis of Binary and Discrete Grey Wolf Optimization Algorithms Applied for Enhancing Performance of Energy Efficient Low Energy Adaptive Clustering Hierarchy." Journal of Computational and Theoretical Nanoscience 17, no. 9 (July 1, 2020): 3850–59. http://dx.doi.org/10.1166/jctn.2020.8974.
Full textAbstract:
Wireless sensor networks (WSN) are a yield of advancement in information technology and the requirement of large-scale communication infrastructures. Routing of data via selected paths is a critical task in WSN as process need to be carried on under resource constraint situations. This route identification problem can be better handled by employing appropriate heuristic bio-inspired computational intelligence optimization method. The most frequently applied routing is hierarchical routing algorithm is Low Energy Adaptive Clustering Hierarchy (LEACH) algorithm which has limitations in identifying energy efficient inter and intra route communication, identification of number of cluster head (CH), an eminent node to communicate to CH and Base Station (BS), selection of CH, and computing residual energy level, etc. Hence, researchers are focusing on boosting the capability of LEACH clustering algorithm by applying heuristic bio-inspired computational intelligence optimization methods. The proposed work is an attempt in this direction through applying heuristic bio-inspired Grey Wolf Optimization algorithm (GWO) for improving the performance of LEACH algorithm. In this paper, focus is given to increase the overall network time by adapting two modifications to conventional algorithms (i) selection of vice cluster head (VCH) in addition to CH (VCH node will replace the CH when CH when CH node goes down due to unexpected reasons as sensor node work under critical and uninterruptable environments and (ii) selection of intra and inter relay nodes (intra relay node will enhance the life span during CH data gathering and inter relay node will further enhance the life span of CH by acting as a mediator between CH an BS). The Spyder-py3 tool is used to simulate the proposed algorithms, LEACH Binary Grey Wolf search based Optimization (LEACH-BGWO) and LEACH Discrete Grey Wolf search based Optimization (LEACH-DGWO) protocols. The proposed work is compared with cluster based LEACH algorithm, chain based power-efficient gathering in sensor information systems (PEGASIS) algorithm, bio-inspired GWO and Genetic Algorithm data Aggregation (GADA) LEACH protocols. The results prove that both proposed algorithms outperformed other conventional algorithms in terms of prolonged network lifespan and increased throughput. Among proposed algorithms LEACH-BGWO outperformed LEACH-DGWO
29
Anish Soni and Rajneesh Randhawa. "Simulating and Analysing the Impact of Routing Protocols on Different Parameters of WSNs." Journal of Technology Management for Growing Economies 6, no. 1 (April 27, 2015): 27–37. http://dx.doi.org/10.15415/jtmge.2015.61003.
Full textAbstract:
Energy efficiency of Wireless Sensor Networks has become an essential requirement and is the main issue for researchers. Various routing, data dissemination and energy efficient protocols have been designed for Wireless Sensor Networks where energy issue has been given more stress. Sensors in wireless sensor networks work on battery and have limited energy. Hence, network has limited lifetime. Routing protocol plays a major role in deciding for how much time a network will survive. All routing algorithms tend to increase the lifetime of WSN while maintaining factors like successful and real-time delivery of a message. This paper aims towards studying different categories of routing protocols and finally four hierarchical routing protocols LEACH, EHRP, SEP and FAIR have been simulated. The performance of each routing protocol has been measured on some performance metrics like network lifetime, packets transferred to BS, number of dead nodes etc and finally concluded that how a routing protocol can impact the network lifetime.
30
Chen, Zhi, Shuai Li, and Wenjing Yue. "SOFM Neural Network Based Hierarchical Topology Control for Wireless Sensor Networks." Journal of Sensors 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/121278.
Full textAbstract:
Well-designed network topology provides vital support for routing, data fusion, and target tracking in wireless sensor networks (WSNs). Self-organization feature map (SOFM) neural network is a major branch of artificial neural networks, which has self-organizing and self-learning features. In this paper, we propose a cluster-based topology control algorithm for WSNs, named SOFMHTC, which uses SOFM neural network to form a hierarchical network structure, completes cluster head selection by the competitive learning among nodes, and takes the node residual energy and the distance to the neighbor nodes into account in the clustering process. In addition, the approach of dynamically adjusting the transmitting power of the cluster head nodes is adopted to optimize the network topology. Simulation results show that SOFMHTC may get a better energy-efficient performance and make more balanced energy consumption compared with some existing algorithms in WSNs.
31
Zhang, Yu Cheng, Xing Guo Qiu, and Zhan Jun Hao. "A Hierarchical and Clustering Strategy for Routing in WSN Based on Ant Colony Optimization." Advanced Materials Research 915-916 (April 2014): 1251–58. http://dx.doi.org/10.4028/www.scientific.net/amr.915-916.1251.
Full textAbstract:
Since the energy of wireless sensor nodes is limited, the protocols of wireless sensor network (WSN) we design should care about problems of balancing energy of nodes. After analyzing current algorithms, this paper puts forward an hierarchical and clustering strategy for routing based on Ant Colony Optimization (HC-ACO). The protocol divides the nodes into fixed clusters, each cluster selects a Cluster Header (CH) and switches the CH by its energy and other restrictive conditions. And it adopts ACO to search the optimal path between the CHs and Sink node. The simulation indicates the protocol can balance energy consumption of nodes of network.
32
Bossard, Antoine, and Keiichi Kaneko. "Torus–Connected Cycles: A Simple and Scalable Topology for Interconnection Networks." International Journal of Applied Mathematics and Computer Science 25, no. 4 (December 1, 2015): 723–35. http://dx.doi.org/10.1515/amcs-2015-0052.
Full textAbstract:
Abstract Supercomputers are today made up of hundreds of thousands of nodes. The interconnection network is responsible for connecting all these nodes to each other. Different interconnection networks have been proposed; high performance topologies have been introduced as a replacement for the conventional topologies of recent decades. A high order, a low degree and a small diameter are the usual properties aimed for by such topologies. However, this is not sufficient to lead to actual hardware implementations. Network scalability and topology simplicity are two critical parameters, and they are two of the reasons why modern supercomputers are often based on torus interconnection networks (e.g., Fujitsu K, IBM Sequoia). In this paper we first describe a new topology, torus-connected cycles (TCCs), realizing a combination of a torus and a ring, thus retaining interesting properties of torus networks in addition to those of hierarchical interconnection networks (HINs). Then, we formally establish the diameter of a TCC, and deduce a point-to-point routing algorithm. Next, we propose routing algorithms solving the Hamiltonian cycle problem, and, in a two dimensional TCC, the Hamiltonian path one. Correctness and complexities are formally proved. The proposed algorithms are time-optimal.
33
WANG, DAJIN, and JIANNONG CAO. "ON HIERARCHICAL CONFIGURATION OF DISTRIBUTED SYSTEMS ON MESH AND HYPERCUBE." International Journal of Foundations of Computer Science 15, no. 03 (June 2004): 517–34. http://dx.doi.org/10.1142/s0129054104002583.
Full textAbstract:
We study hierarchical configuration of distributed systems for achieving optimized system performance. A distributed system consists of a collection of local 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, so as to coordinate the local computation/control activities to improve the overall 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. The optimization problem considered in this paper is concerned with finding an optimal hierarchical partition of the processors, so that the total traffic flow over the network is minimized. The problem in its general form has been known to be NP-hard. Therefore, we just focus on distributed computing jobs which require collecting and processing information from all processors. By limiting levels of the hierarchy to two, we will establish the analytically optimal hierarchical configurations for two popular interconnection networks: mesh and hypercube. Based on analytical results, partitioning algorithms are proposed to achieve minimal communication cost (network traffic flow). We will also present and discuss heuristic algorithms for multiple-level hierarchical partitions.
34
Arai, Jun, and Yamin Li. "Fault-Tolerant Routing Algorithms for Hierarchical Dual-Nets with Limited and Arbitrary Number of Faulty Nodes." International Journal of Networking and Computing 5, no. 2 (2015): 329–46. http://dx.doi.org/10.15803/ijnc.5.2_329.
Full text
35
Samani, Mahia, Ahmad Khademzadeh, and Kambiz Badie. "A Novel Algorithm for Redundant Data Filtering in WSN and RFID Integrated Networks." Nexo Revista Científica 35, no. 04 (December 31, 2022): 1078–90. http://dx.doi.org/10.5377/nexo.v35i04.15550.
Full textAbstract:
Wireless sensor networks (WSN) and radio frequency identification (RFID) are base technologies employed in decentralised dynamic environments. In the hybrid network formed by integrating RFID and WSN, RFID data can be used applying WSN protocols for multi-hop communications. However, RFID data contain excessive duplication, which increases time delay and energy consumption, resulting in wastage of different resources. There exist four popular RFID–WSN integration architectures: hierarchical RFID-sensor topology, network RFID-sensor topology, reader-sensor nodes topology, and mixed topology. In this paper, we propose a new plan for a WSN–RFID integrated network. The entire network is divided into clusters, and the clustering hierarchical routing algorithm is employed to send data from the head nodes to the base station. Further, we propose two algorithms to overcome redundant data on the hybrid network. Our simulation results demonstrate that the proposed method reduces redundant data and processing time compared with existing methods.
36
Yong, Jin, Zhou Lin, Wei Qian, Bai Ke, Wang Chen, and Li Ji-fang. "Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks." Journal of Sensors 2021 (April 28, 2021): 1–14. http://dx.doi.org/10.1155/2021/6671978.
Full textAbstract:
In wireless sensor networks (WSNs), due to the limited energy of sensor nodes, how to design efficient hierarchical routing algorithms to balance network resources and extend network life is an important problem to be solved. Aiming at the problems such as random selection of cluster head, redundancy of working node, and construction of cluster head transmission path, which affect network energy consumption, this paper proposes a multihop routing algorithm based on path tree (MHRA-PT) to optimize the network energy. Firstly, some nodes are those close to the base station and have large remaining energy which are selected to construct a cluster head set. Then, after clustering, each cluster is divided into different regions, and in each region, nodes with residual energy greater than the average residual energy of the cluster are selected as a working node. Finally, the cluster heads are sorted according to their distance from base station, and the next hop node is selected for each cluster head in turn until a path tree rooted at base station is formed completely, leading to data transmission from working node to base station. Simulation results show that the proposed algorithm can effectively reduce network energy consumption, balance network resources, and prolong network life cycle.
37
Kumar, Rajeev, and Dilip Kumar. "Hybrid Swarm Intelligence Energy Efficient Clustered Routing Algorithm for Wireless Sensor Networks." Journal of Sensors 2016 (2016): 1–19. http://dx.doi.org/10.1155/2016/5836913.
Full textAbstract:
Currently, wireless sensor networks (WSNs) are used in many applications, namely, environment monitoring, disaster management, industrial automation, and medical electronics. Sensor nodes carry many limitations like low battery life, small memory space, and limited computing capability. To create a wireless sensor network more energy efficient, swarm intelligence technique has been applied to resolve many optimization issues in WSNs. In many existing clustering techniques an artificial bee colony (ABC) algorithm is utilized to collect information from the field periodically. Nevertheless, in the event based applications, an ant colony optimization (ACO) is a good solution to enhance the network lifespan. In this paper, we combine both algorithms (i.e., ABC and ACO) and propose a new hybrid ABCACO algorithm to solve a Nondeterministic Polynomial (NP) hard and finite problem of WSNs. ABCACO algorithm is divided into three main parts: (i) selection of optimal number of subregions and further subregion parts, (ii) cluster head selection using ABC algorithm, and (iii) efficient data transmission using ACO algorithm. We use a hierarchical clustering technique for data transmission; the data is transmitted from member nodes to the subcluster heads and then from subcluster heads to the elected cluster heads based on some threshold value. Cluster heads use an ACO algorithm to discover the best route for data transmission to the base station (BS). The proposed approach is very useful in designing the framework for forest fire detection and monitoring. The simulation results show that the ABCACO algorithm enhances the stability period by 60% and also improves the goodput by 31% against LEACH and WSNCABC, respectively.
38
Osmani, Amjad, Abolfazl Toroghi Haghighat, and Shirin Khezri. "Location Update Improvement Using Fuzzy Logic Optimization in Location Based Routing Protocols in MANET." International Journal of Grid and High Performance Computing 3, no. 3 (July 2011): 1–19. http://dx.doi.org/10.4018/jghpc.2011070101.
Full textAbstract:
Several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network. This paper introduces a new schema in management of mobile nodes location in mobile ad hoc networks. Fuzzy logic optimization is applied to a better management of location update operation in hierarchical location services. Update management overhead is decreased without significant loss of query success probability. One-hop-chain-technique is used for Auto compensation. A new composed method can update mobile nodes location when the nodes cross a grid boundary. The proposed method uses a dynamic grid area that ?solves the ping-pong problem between grids. Simulation results show that these methods are effective. The algorithms are distributed and can keep scalability in the scenario of increasing nodes density?. The described solutions are not limited to a special network grid ordering, and can be used in every hierarchical ordering like GLS if the ordering can be mappable on these methods.
39
Thanh Long, Nguyen. "Research on Innovating and Applying Evolutionary Algorithms Based Hierarchical Clustering and Multiple Paths Routing for Guaranteed Quality of Service on Service Based Routing." Internet of Things and Cloud Computing 3, no. 3 (2015): 22. http://dx.doi.org/10.11648/j.iotcc.s.2015030601.12.
Full text
40
Shah, Paritosh Kumar, Arun Kumar, and Mehedi Masud. "A mathematical optimization of the lifetime of the wireless sensor network using ML- based energy dependent clustering and tiered routing algorithm." Journal of Interdisciplinary Mathematics 26, no. 3 (2023): 351–59. http://dx.doi.org/10.47974/jim-1666.
Full textAbstract:
Significant research work is being done in the field of WSN and standardization of many aspects is being looked into. The most well-known procedures for optimising energy in WSNs are using hierarchical topology. LEACH is a hierarchical topology which was introduced initially and served as the basis for achieving energy efficiency in WSN. However, LEACH has certain limitations which has led to a lot of research in improving the conventional LEACH performance. The current study is based on the use of certain algorithms and strategy to enhance the performance of the conventional LEACH protocol. By focusing on parameters such as cluster head formation, energy expenditure in transmission etc., the performance such as throughput and network life may be extended using this enhanced LEACH.
41
Wang, Jun, Zhuangzhuang Du, Zhengkun He, and Xunyang Wang. "A Cluster-Head Rotating Election Routing Protocol for Energy Consumption Optimization in Wireless Sensor Networks." Complexity 2020 (December 21, 2020): 1–13. http://dx.doi.org/10.1155/2020/6660117.
Full textAbstract:
Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.
42
Del-Valle-Soto, Carolina, Ramiro Velázquez, Leonardo J. Valdivia, Nicola Ivan Giannoccaro, and Paolo Visconti. "An Energy Model Using Sleeping Algorithms for Wireless Sensor Networks under Proactive and Reactive Protocols: A Performance Evaluation." Energies 13, no. 11 (June 11, 2020): 3024. http://dx.doi.org/10.3390/en13113024.
Full textAbstract:
The continuous evolution of the Internet of Things (IoT) makes it possible to connect everyday objects to networks in order to monitor physical and environmental conditions, which is made possible due to wireless sensor networks (WSN) that enable the transfer of data. However, it has also brought about many challenges that need to be addressed, such as excess energy consumption. Accordingly, this paper presents and analyzes wireless network energy models using five different communication protocols: Ad Hoc On-Demand Distance Vector (AODV), Multi-Parent Hierarchical (MPH), Dynamic Source Routing (DSR), Low Energy Adaptive Clustering Hierarchy (LEACH) and Zigbee Tree Routing (ZTR). First, a series of metrics are defined to establish a comparison and determine which protocol exhibits the best energy consumption performance. Then, simulations are performed and the results are compared with real scenarios. The energy analysis is conducted with three proposed sleeping algorithms: Modified Sleeping Crown (MSC), Timer Sleeping Algorithm (TSA), and Local Energy Information (LEI). Thereafter, the proposed algorithms are compared by virtue of two widely used wireless technologies, namely Zigbee and WiFi. Indeed, the results suggest that Zigbee has a better energy performance than WiFi, but less redundancy in the topology links, and this study favors the analysis with the simulation of protocols with different nature. The tested scenario is implemented into a university campus to show a real network running.
43
WILLSON, JAMES K., XIAOFENG GAO, ZHONGHUA QU, YI ZHU, YINGSHU LI, and WEILI WU. "EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS." Discrete Mathematics, Algorithms and Applications 01, no. 04 (December 2009): 437–61. http://dx.doi.org/10.1142/s1793830909000348.
Full textAbstract:
A Connected Dominating Set (CDS) can be used to construct a virtual backbone for wireless and mobile ad-hoc networks to make the system hierarchical and efficient. A virtual backbone can significantly improve network throughput, optimize broadband utilization, extend network lifetime, and reduce interference as well as packet retransmissions. Calculating a minimum backbone for a network is critical to reduce routing computation and energy consumption. This problem is a well-known NP-hard optimization problem, which has various applications in practice. In this paper, we propose a new problem based on customer fairness, which looks for a minimum CDS in a given communication model with shortest path constraints. It guarantees that any two clients can communicate with each other through this CDS with hop counts the same as the best path from the original graph, which means that routing on such a CDS will not bring additional traffic for every client. We name this problem as shortest path connected dominating set (SPCDS) and prove its NP-hardness by reduction from Hitting Set. Then we propose a centralized greedy algorithm and an efficient distributed approximation algorithm with approximation ratio Δ to solve SPCDS, where Δ is the maximum vertex degree in the given topology. We also analyze the time complexity, message complexity, and evaluate the efficiency of our distributed heuristic by several numerical experiments and comparisons with previous literatures.
44
Kalimuthu, A., and M. Karthikeyan. "NOC Based Router Architecture Design Through Decoupled Resource Sharing Using CABHR Algorithm." International Journal of Reconfigurable and Embedded Systems (IJRES) 6, no. 2 (May 28, 2018): 105. http://dx.doi.org/10.11591/ijres.v6.i2.pp105-110.
Full textAbstract:
<span style="font-size: 9pt; font-family: 'Times New Roman', serif;">A Network-on-Chips (NoCs) is rapid promising for an on-chip alternative designed in support of many-core System-on-Chips (SoCs). In spite of this, developing an increased overall performance low latency Network on chip using low area overhead has always been a new challenge. Network on Chips (NoCs) by using mesh and torus interconnection topologies have become widely used because of the easy construction. A torus structure is nearly the same as the mesh structure, however, has very slighter diameter. In this regard, we propose effective router design for Decoupled Resource sharing in a torus topology based on clustering algorithms Based Hierarchical Routing (CABHR) to get better the efficiency of NoC. We show that our approach is provides improved latency and energy consumption, overall performance developments compared to the most distinguished existing routing technique</span>
45
Hamzah, Abdulmughni, Mohammad Shurman, Omar Al-Jarrah, and Eyad Taqieddin. "Energy-Efficient Fuzzy-Logic-Based Clustering Technique for Hierarchical Routing Protocols in Wireless Sensor Networks." Sensors 19, no. 3 (January 29, 2019): 561. http://dx.doi.org/10.3390/s19030561.
Full textAbstract:
In wireless sensor networks, the energy source is limited to the capacity of the sensor node’s battery. Clustering in WSN can help with reducing energy consumption because transmission energy is related to the distance between sender and receiver. In this paper, we propose a fuzzy logic model for cluster head election. The proposed model uses five descriptors to determine the opportunity for each node to become a CH. These descriptors are: residual energy, location suitability, density, compacting, and distance from the base station. We use this fuzzy logic model in proposing the Fuzzy Logic-based Energy-Efficient Clustering for WSN based on minimum separation Distance enforcement between CHs (FL-EEC/D). Furthermore, we adopt the Gini index to measure the clustering algorithms’ energy efficiency in terms of their ability to balance the distribution of energy through WSN sensor nodes. We compare the proposed technique FL-EEC/D with a fuzzy logic-based CH election approach, a k-means based clustering technique, and LEACH. Simulation results show enhancements in energy efficiency in terms of network lifetime and energy consumption balancing between sensor nodes for different network sizes and topologies. Results show an average improvement in terms of first node dead and half nodes dead.
46
Zhang, Li Xia. "Information Fusion Technology in Internet of Things: A Survey." Advanced Materials Research 1073-1076 (December 2014): 2434–37. http://dx.doi.org/10.4028/www.scientific.net/amr.1073-1076.2434.
Full textAbstract:
According to the technical support need of Internet of things, multi-source information fusion technology makes a contribution to saving network resources, getting accurate information, and improving the efficiency of information transmission in the Internet of things. In this paper, we firstly put forward the hierarchical structure of the Internet of things, and then we discuss information fusion technology from two aspects: information transmission process combined with routing, and analysis of information fusion technology. We give an overview of various algorithms in each category by summarizing design approach, benefits, and drawbacks. And finally, we list the future development of information fusion.
47
Thakur, Poonam. "Performance Evaluation of a Multi-Hop Cluster Based Algorithm for Vehicular Ad-hoc Networks." International Journal for Research in Applied Science and Engineering Technology 9, no. 11 (November 30, 2021): 802–12. http://dx.doi.org/10.22214/ijraset.2021.38846.
Full textAbstract:
Abstract: Vehicular ad hoc networks are characterized as the ad hoc networks with dynamic and dense network topology which faces issues like routing, data congestion, and overhead. One technique which has proved to be useful in managing VANETs is clustering. Clustering is a technique to divide the network into smaller, distributed and more stable hierarchical structure. The parameters like speed, position, distance, direction and mobility are used for clustering the networks. Clustering helps in load balancing, improving scalability, efficient resource allocation and reducing overhead. In this paper a multi-hop cluster-based algorithm (MhCA) for VANET is proposed which uses Fuzzy TOPSIS for CH selection based on Rank Index of nodes. The flowchart of the algorithm along with the description of the algorithm is given below in the paper. Extensive simulation experiments are run using the ns3 and SUMO to evaluate & compare the performance of proposed algorithm with the existing multi-hop algorithms like VMaSC and n-hop. Keywords: CH, CM, CH Change Duration, CH Duration, OSM, NS3.
48
Arieth, Madonna, K. Anuradha, B. Harika, D. Nowshad Ali, and Subrata Chowdhury. "Congestion Management of GSTEB Routing Protocol Using K-Means Algorithm in Wireless Sensor Network." ECS Transactions 107, no. 1 (April 24, 2022): 13147–54. http://dx.doi.org/10.1149/10701.13147ecst.
Full textAbstract:
A sensor node comprises of enormous nodes which can a variety of tasks such as recognize, indulgence, communication, and influence resource. Data transmission is the main aspect from starting to target. Once it is transferred between the node and within-cluster, the congestion will arise either node or in a resource allotment. So that it will affect the unremitting delay of reaching data, flow, the defeat of information to the destination, and the unfavorable use of a significant quantity of energy in the node. In this work, the impact of machine learning algorithms is studied using the GSTEB hierarchical protocol. By altering the type of input parameters, K-Means clustering on node energy usage can be performed. If congestion occurs, our proposal outlines a strategy for dealing with it and improving the CHPSCCC (Clustered Highly Prioritized Application-Specific Congestion Control Clustering Protocol) approach for congestion management. Simulation results show that in the proposed system there is significant growth of rises in the lifetime, energy, throughput, and packet loss.
49
Belyaev, D., A. Kanaev, S. Prisyazhniuk, M. Saharova, and R. Sorokin. "Conceptual Model of HF-Band Packet Radio Network Control System." Proceedings of Telecommunication Universities 6, no. 1 (2020): 32–42. http://dx.doi.org/10.31854/1813-324x-2020-6-1-32-42.
Full textAbstract:
The author develop the conceptual control system model to ensure the sustainable projected promising packet radio network HF-band operating. It is proposed to implement the control functions at the Element Management System level on the basis of automated radio centers, and to implement the Network Management System level management functions on the basis of a dedicated server. Such a management approach allows you to build a hierarchical centralized radio network management system architecture. We can observe a simulation modeling for the developed algorithms of the selected radio network control functions. The paper presents the simulation results, namely probabilistic-temporal characteristics of the processes reliability, routing and functioning under attacks.
50
Femi Salami, Abdulazeez, Emmanuel Adewale Adedokun, Habeeb Bello-Salau, and Bashir Olaniyi Sadiq. "Fault-Tolerant Backup Clustering Algorithm for Smart Connected Underwater Sensor Networks." International Journal of Software Engineering and Computer Systems 8, no. 1 (January 24, 2022): 29–44. http://dx.doi.org/10.15282/ijsecs.8.1.2022.4.0094.
Full textAbstract:
This paper addresses poor cluster formation and frequent Cluster Head (CH) failure issues of underwater sensor networks by proposing an energy-efficient hierarchical topology-aware clustering routing (EEHTAC) protocol. In this paper, fault-tolerant backup clustering (FTBC) algorithms and multi-parameter cluster formation (MPCF) model were developed for the EEHTAC operation. The MPCF model tackles the issue of poor cluster formation performance by integrating multiple parameters to achieve effective clustering process. The FTBC algorithms tackle the issue of frequent CH failures to avoid interruption in data transmission. Performance of the MPCF model was evaluated using normal, high-fault, and high routing overhead network scenarios. Performance metrics employed for this analysis are temporal topology variation ratio (TTVR), CH load distribution (CLD), and cluster stability (STB). Obtained results show that operating with a CH retention period of 90s achieves better CH duty cycling per round and improves the MPCF process with values of 25.69%, 55.56%, and 60% for TTVR, CLD, and STB respectively. Performance of the FTBC-based EEHTAC was evaluated relative to Energy-balanced Unequal Layering Clustering (EULC) protocol. Performance indicators adopted for this evaluation are routing overhead (Ω), end to end delay (Δ), CH failures recovered (CFR), CH failures detected (CFD), received packets (θ), and energy consumption (Σ). With reference to the best obtained values, EEHTAC demonstrated performance improvement of58.40%, 29.94%,81.33%, 28.02%, 86.65%, and 54.35% over EULC variants in terms of Ω, Δ,CFR, CFD, θ, and Σ respectively. Obtained results displayed that the MPCF model is efficient for cluster formation performance and the FTBC-based EEHTACprotocolcan perform effectively well against an existing CBR protocol.