Journal articles: 'Hierarchical routing (Computer network management)'

1

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

HUA, Yi-qiang, Ai-bo LIU, Yue-ming LU, Hui LI, and Yue-feng JI. "Load balance in hierarchical routing network." Journal of China Universities of Posts and Telecommunications 16, no. 6 (December 2009): 72–77. http://dx.doi.org/10.1016/s1005-8885(08)60291-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

13

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

14

Rayri, Yassine, Hatim Kharraz Aroussi, and Abdelaziz Mouloudi. "Improved Energy Management Performance for Hierarchical Routing in WSNs." International Journal of Recent Contributions from Engineering, Science & IT (iJES) 6, no. 2 (August 29, 2018): 61. http://dx.doi.org/10.3991/ijes.v6i2.8818.

Full text

Abstract:

The rapidly evolving of technology in the area of communication and information, allowed the creation of a new device called wireless sensor. This small device allows measuring physical phenomenon quantity in environment such as light, pressure, temperature and transforming it autonomously into a digital value, In order to send to one or several points of collections, which is going to be processed. However, a wireless sensor network (WSN) is a network formed by a large number of sensor nodes, which are able to acquire, aggregate compress and to transmit data towards a base station. However, several constraints complicate the deployment and management of wireless sensor networks. The economy of energy is among the major issues of these networks, and it is difficult even impossible to replace the sensors or their battery because of the location of deployment that is often inaccessible. Among Scientifics researches, we find the improvement the energy management in WSNs. In this paper, we propose a new routing protocol based on clustering. The purpose is to have an equal distribution of the energy throughout the network

APA, Harvard, Vancouver, ISO, and other styles

15

Jadoon, Rab Nawaz, WuYang Zhou, Iftikhar Ahmed Khan, Muhammad Amir Khan, Shahbaz Akhtar Abid, and Nauman Ali Khan. "Performance Evaluation of Zone-Based Routing with Hierarchical Routing in Wireless Sensor Networks." Wireless Communications and Mobile Computing 2019 (October 13, 2019): 1–10. http://dx.doi.org/10.1155/2019/7152858.

Full text

Abstract:

Routing remains a most challenging task in sensor networks because of constrained resources like battery power, processing, and memory. Many energy efficiency techniques for the sensor networks have been proposed, among which hierarchical routing is considered the most energy-efficient and extended network lifetime technique. This technique has a lesser number of transmissions in the network. On the contrary, zone-based routing claims lesser control and routing overhead on the overall network lifetime. In this research, a simulation-based comparison of zone-based routing with static clustering hierarchical routing is conducted. The simulation results show that the zone-based routing outperforms hierarchical routing with static clustering in terms of energy efficiency, network lifetime, and throughput.

APA, Harvard, Vancouver, ISO, and other styles

16

Kai Yang, and Jianfeng Ma. "A Hierarchical Hybrid Routing Protocol for Wireless Mesh Network." Journal of Convergence Information Technology 5, no. 8 (October 31, 2010): 146–56. http://dx.doi.org/10.4156/jcit.vol5.issue8.15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Zhang, Yong, and Hong Pan. "Research on Routing Protocol for Wireless Sensor Network." Applied Mechanics and Materials 624 (August 2014): 532–35. http://dx.doi.org/10.4028/www.scientific.net/amm.624.532.

Full text

Abstract:

With the rapid development of computer technology,wireless sensor network (WSN) is widely used in many fields of society, This paper introduces the characteristics of wireless sensor network and its routing protocol. Based on the hierarchical model, a dynamic selection of the sink node and the hierarchical model of multipath routing protocol is proposed which can balance the energy consumption of nodes, and it also can prolong the network lifetime, improve the data transfer rate.

APA, Harvard, Vancouver, ISO, and other styles

18

Alaoui, El Arbi Abdellaoui, and Khalid Nassiri. "Stochastic analysis of DTN routing protocols in delay tolerant network routing hierarchical topology." International Journal of Wireless and Mobile Computing 15, no. 1 (2018): 28. http://dx.doi.org/10.1504/ijwmc.2018.094642.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Abdellaoui Alaoui, El Arbi, and Khalid Nassiri. "Stochastic analysis of DTN routing protocols in delay tolerant network routing hierarchical topology." International Journal of Wireless and Mobile Computing 15, no. 1 (2018): 28. http://dx.doi.org/10.1504/ijwmc.2018.10015857.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Yadav, Rakesh Kumar, and R. P. Mahapatra. "Energy aware optimized clustering for hierarchical routing in wireless sensor network." Computer Science Review 41 (August 2021): 100417. http://dx.doi.org/10.1016/j.cosrev.2021.100417.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Jeong, Moon‐Sang, and Jong‐Tae Park. "Hierarchical mobile network routing: Route optimization and micro‐mobility support for NEMO." International Journal of Pervasive Computing and Communications 1, no. 1 (February 2005): 43–52. http://dx.doi.org/10.1108/17427370580000112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Chan, Louie, Karina Gomez Chavez, Heiko Rudolph, and Akram Hourani. "Hierarchical routing protocols for wireless sensor network: a compressive survey." Wireless Networks 26, no. 5 (January 27, 2020): 3291–314. http://dx.doi.org/10.1007/s11276-020-02260-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Hafizur Rahman, M. M., and Susumu Horiguchi. "Routing performance enhancement in hierarchical torus network by link-selection algorithm." Journal of Parallel and Distributed Computing 65, no. 11 (November 2005): 1453–61. http://dx.doi.org/10.1016/j.jpdc.2005.05.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

KIM, JONG-RYUL, and DOHOON KIM. "ENHANCING INTERNET NETWORK RELIABILITY WITH INTEGRATED FRAMEWORK OF MULTI-OBJECTIVE GENETIC ALGORITHM AND MONTE CARLO SIMULATION." Asia-Pacific Journal of Operational Research 25, no. 06 (December 2008): 837–46. http://dx.doi.org/10.1142/s021759590800205x.

Full text

Abstract:

This paper presents a combined framework of Multi-Objective Generic Algorithm (MOGA) and Monte Carlo Simulation (MCS) in order to improve backbone topology by leveraging the Virtual Link (VL) system in an hierarchical Link-State (LS) routing domain. Given that the sound backbone topology structure has a great impact on the overall routing performance in a hierarchical LS domain, the importance of this research is evident. The proposed decision model is to find an optimal configuration of VLs that properly meets two-pronged engineering goals in installing and maintaining VLs: i.e., operational costs and network reliability. The experiment results clearly indicates that it is essential to the effective operations of hierarchical LS routing domain to consider not only engineering aspects but also specific benefits from systematical layout of VLs, thereby presenting the validity of the decision model and MOGA with MCS.

APA, Harvard, Vancouver, ISO, and other styles

25

Tingrui, Pei, Zhao Zhi, Zeng Wenli, and Zhang Zhaoxia. "A Cognitive Improved Hierarchical AODV Routing Protocol for Cognitive Wireless Mesh Network." Information Technology Journal 10, no. 2 (January 15, 2011): 376–84. http://dx.doi.org/10.3923/itj.2011.376.384.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Madhurikkha, S., and R. Sabitha. "Hierarchical Honey Bee Model to Avoid Sleep Deprivation Attack in MANET." International Journal of Engineering & Technology 7, no. 3.6 (July 4, 2018): 358. http://dx.doi.org/10.14419/ijet.v7i3.6.15133.

Full text

Abstract:

Ad-hoc networks are highly vulnerable to the attacks due to the dynamic nature of the network topology, lack of centralized management and cooperative algorithm. Nodes in the ad-hoc network are responsible to transmit packets to other nodes. One of many different kinds of attacks, a node may experience the exhaustion of power by consuming its batter power. Routing protocol controls the packet transmission over the network and calculates the routing path for transmission. The predefined static routed path is limited in ad-hoc network, and nodes have limited energy that is depleted due to transmission. Sleep deprivation attack constantly drops the power source on a particular node until the node gets shutdown. We have proposed an effective model named Honey-bee model to enhance Ad-hoc On-Demand Distance Vector Routing algorithm. Hierarchical clustering method is used for the formation of the cluster of nodes. Based on this approach, each node is assigned with a cluster that prevents the attack. We have simulated in ns2 tool compared results with other on-demand routing protocol such as Power Aware Routing Protocol, Dynamic Source Routing, Flow-State extensions to Dynamic Source Routing and AODV.

APA, Harvard, Vancouver, ISO, and other styles

27

Saha, Debashis, and Amitava Mukherjee. "Computational analysis of an optimal routing strategy in a hierarchical computer communication network." Computer Communications 18, no. 7 (July 1995): 507–11. http://dx.doi.org/10.1016/0140-3664(95)94377-n.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

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

29

Tripathy, Laxminath, and Chita Ranjan Tripathy. "Hierarchical Hexagon: A New Fault-Tolerant Interconnection Network for Parallel Systems." Cybernetics and Information Technologies 21, no. 1 (March 1, 2021): 32–49. http://dx.doi.org/10.2478/cait-2021-0003.

Full text

Abstract:

Abstract A new interconnection network topology called Hierarchical Hexagon HH(n) is proposed for massively parallel systems. The new network uses a hexagon as the primary building block and grows hierarchically. Our proposed network is shown to be superior to the star based and the hypercube networks, with respect to node degree, diameter, network cost, and fault tolerance. We thoroughly analyze different topological parameters of the proposed topology including fault tolerance routing and embedding Hamiltonian cycle.

APA, Harvard, Vancouver, ISO, and other styles

30

Et.al, Raghunandan G. H. "Energy-Efficient Hybrid Hierarchical Routing scheme for overall Efficiency in WSN." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 3 (April 11, 2021): 3581–88. http://dx.doi.org/10.17762/turcomat.v12i3.1635.

Full text

Abstract:

Wireless Sensor Network are spatially distributed sensors intended to monitor different physiological conditions. Sensing and communicating data from one place to another consumes more energy, therefore the management of sensor energy is a very important factor. Energy utilization, synchronization, and a lifetime of the network are the main criteria in WSN. More energy is utilized by sensors that are distant from the base station. The gateway nodes are deployed to collect and relay information from nodes to the base station to resolve this problem. To decrease energy consumption, gateway nodes are deployed in the network. In this paper, a hybrid approach is used to increase the overall efficiency of the network in WSNs with time synchronization which increases the throughput of the network. The efficiency of proposed protocol based network has shown improvements in network lifetime, residual energy, data packets, and the throughput of the network. The performance of WSN of the proposed scheme is compared to other classical routing schemes and the proposed algorithm has proved its merit.

APA, Harvard, Vancouver, ISO, and other styles

31

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

32

Khan, Farrukh Aslam, Wang-Cheol Song, and Khi-Jung Ahn. "Performance Analysis of Location-Aware Grid-Based Hierarchical Routing Protocol for Mobile Ad Hoc Networks." Wireless Communications and Mobile Computing 2018 (November 1, 2018): 1–10. http://dx.doi.org/10.1155/2018/1583205.

Full text

Abstract:

In this paper, the performance analysis of a hierarchical routing protocol for mobile ad hoc networks (MANETs) called Location-aware Grid-based Hierarchical Routing (LGHR) is performed. In LGHR, the network comprises nonoverlapping zones and each zone is further partitioned into smaller grids. Although LGHR is a location-aware routing protocol, the routing mechanism is similar to the link-state routing. The protocol overcomes some of the weaknesses of other existing location-based routing protocols such as Zone-based Hierarchical Link State (ZHLS) and GRID. A detailed analysis of the LGHR routing protocol is performed and its performance is compared with both the above-mentioned protocols. The comparison shows that LGHR works better than ZHLS in terms of storage overhead as well as communication overhead, whereas LGHR is more stable than GRID especially in scenarios where wireless nodes are moving with very high velocities.

APA, Harvard, Vancouver, ISO, and other styles

33

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

34

Sharma, Nidhi, and Shikha Sharma. "Comprehensive Survey of Routing Techniques in Wireless Sensor Network." INTERNATIONAL JOURNAL OF MANAGEMENT & INFORMATION TECHNOLOGY 5, no. 2 (August 15, 2013): 563–75. http://dx.doi.org/10.24297/ijmit.v5i2.4446.

Full text

Abstract:

Wireless Sensor Netw orks ( WSNs) c onsist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus , however, has been given to the routing protocols which might differ depending on the application and netw ork architecture. In this paper, we present a survey of the state-of-the-art routing techniques in WSNs. We first outline the designchallenges for routing protocols in WSNs followed by a comprehensive survey of different routing techniques . Overall, the routing techniques are classified into three categories based on the underlying netw ork structure: flat, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based,query-based, negotiation-based, QoS-based, and coherent-based depending on the protocol operation. We study the design tradeoffs b e twe e n ener gy and communication overhead savings in every routing paradigm. We also highlight the adv antages and performance issues of each routing technique.

APA, Harvard, Vancouver, ISO, and other styles

35

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 text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

36

Min Zhang, Wei Du, Ming Jiang, Chunming Wu, and Xiao Min. "Distributed Hierarchical Management Framework for Virtual Network Embedding." INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences 5, no. 3 (February 15, 2013): 477–87. http://dx.doi.org/10.4156/aiss.vol5.issue3.56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Cheklat, Lamia, Mourad Amad, Mawloud Omar, and Abdellah Boukerram. "CHEARP: Chord-based hierarchical energy-aware routing protocol for wireless sensor networks." Computer Science and Information Systems, no. 00 (2020): 43. http://dx.doi.org/10.2298/csis200308043c.

Full text

Abstract:

Wireless Sensor networks (WSNs) are mostly deployed in hostile environments, where nodes may do not have any information about their location. Hence, the designed routing protocols and applications have to function independently from the nodes location. Moreover, extending lifetime in such networks is a critical and challenging issue, since they consist of miniaturized energy-constrained devices. The motivation of this paper is to design an energy efficient location independent routing protocol for data delivery in WSNs. Therefore, a Chord-based Hierarchical Energy-Aware Routing Protocol (CHEARP) is developed with the focus on preserving the energy consumption. In contrary to the existing DHT-based protocols that interconnect nodes independently of their physical proximity, this paper proposes an approximate logical structure to the physical one, where the aim is to minimize the average paths? length. Simulation results show that the proposed solution reduces the transmission Load, minimizes the transmission delay, and extends the network longevity.

APA, Harvard, Vancouver, ISO, and other styles

38

Zhang, Zhenjiang, Yanan Wang, Fuxing Song, and Wenyu Zhang. "An Energy-Balanced Mechanism for Hierarchical Routing in Wireless Sensor Networks." International Journal of Distributed Sensor Networks 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/123521.

Full text

Abstract:

In wireless sensor networks (WSNs), energy-constrained sensor nodes are always deployed in hazardous and inaccessible environments, making energy management a key problem for network design. The mechanism of RNTA (redundant node transmission agents) lacks an updating mechanism for the redundant nodes, causing an unbalanced energy distribution among sensor nodes. This paper presents an energy-balanced mechanism for hierarchical routing (EBM-HR), in which the residual energy of redundant nodes is quantified and made hierarchic, so that the cluster head can dynamically select the redundant node with the highest residual energy grade as a relay to complete the information transmission to the sink node and achieve an intracluster energy balance. In addition, the network is divided into several layers according to the distances between cluster heads and the sink node. Based on the energy consumption of the cluster heads, the sink node will decide to recluster only in a certain layer so as to achieve an intercluster energy balance. Our approach is evaluated by a simulation comparing the LEACH algorithm to the HEED algorithm. The results demonstrate that the BEM-HR mechanism can significantly boost the performance of a network in terms of network lifetime, data transmission quality, and energy balance.

APA, Harvard, Vancouver, ISO, and other styles

39

Groves, G., J. le Roux, and J. H. van Vuuren. "Network service scheduling and routing." International Transactions in Operational Research 11, no. 6 (November 2004): 613–43. http://dx.doi.org/10.1111/j.1475-3995.2004.00481.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Et. al., P. Suman Prakash,. "Machine Learning-Based Optimized Hierarchical Routing Protocols for WSN Lifetime: A Review." INFORMATION TECHNOLOGY IN INDUSTRY 9, no. 2 (March 25, 2021): 289–307. http://dx.doi.org/10.17762/itii.v9i2.346.

Full text

Abstract:

In Wireless Sensor Networks, network lifetime optimization has challenging and significant issue. Subsequently, most of the existing works delineate several factors to improve the network lifetime: by decreasing the amount of the consumption of energy, reducing latency, load balancing, clustering, efficient data aggregating and by minimizing the data transmission delays. This paper provides a review of recent techniques and presents a Machine Learning-based Optimized Hierarchical Routing Protocols for WSN Lifetime. Research has been done, and reviews have been studied to explore the energy management schemes using optimized routing approach and Machine Learning Adaptability for WSN’s. Further, recommend future directions related to the Optimized Clustering Approaches to enhance wsn lifetime.

APA, Harvard, Vancouver, ISO, and other styles

41

Onuekwusi, Nnaemeka Chiemezie, Michael Chukwudi Ndinechi, Gordon Chiagozie Ononiwu, and Onyebuchi Chikezie Nosiri. "An Energy Balanced Routing Hole and Network Partitioning Mitigation Model for Homogeneous Hierarchical Wireless Sensor Networks." International Journal of Interdisciplinary Telecommunications and Networking 12, no. 1 (January 2020): 28–42. http://dx.doi.org/10.4018/ijitn.2020010103.

Full text

Abstract:

This article addresses the challenges of routing hole and network partitioning often experienced in hierarchical wireless sensor networks (WSNs). This developed model classifies network nodes into sets for effective energy management and formulates two cluster networks namely: switching and non-switching networks. Both networks are considered homogeneous and static WSNs and adopted approaches of residual energy, multi-hop and minimal distance as routing decision parameters. The switching network in addition introduces an energy switching factor as a major decision parameter for the switching of cluster head roles amongst cluster nodes. Network simulation was done using Truetime 2.0 and energy dissipation of the respective nodes and cluster heads was observed against a threshold. Results showed the introduction of the energy switching factor gave a significant energy balancing effect as nodes exhibited uniform energy dissipation. Furthermore, the residual energies for most nodes were above the threshold eliminating the possibility of the presence of routing hole and network partitioning.

APA, Harvard, Vancouver, ISO, and other styles

42

Zhong, Haifeng, and Jianying Xiong. "The Management Strategy of Metadata in Large-scale Network Storage System." MATEC Web of Conferences 228 (2018): 01011. http://dx.doi.org/10.1051/matecconf/201822801011.

Full text

Abstract:

The wan Internet storage system based on Distributed Hash Table uses fully distributed data and metadata management, and constructs an extensible and efficient mass storage system for the application based on Internet. However, such systems work in highly dynamic environments, and the frequent entry and exit of nodes will lead to huge communication costs. Therefore, this paper proposes a new hierarchical metadata routing management mechanism based on DHT, which makes full use of the node stabilization point to reduce the maintenance overhead of the overlay. Analysis shows that the algorithm can effectively improve efficiency and enhance stability.

APA, Harvard, Vancouver, ISO, and other styles

43

Li, Hongbing, Peng Gao, Qingyu Xiong, Weiren Shi, and Qiang Chen. "A Vascular-Network-Based Nonuniform Hierarchical Fault-Tolerant Routing Algorithm for Wireless Sensor Networks." International Journal of Distributed Sensor Networks 8, no. 11 (January 2012): 981380. http://dx.doi.org/10.1155/2012/981380.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Bidai, Zahia, Moufida Maimour, and Hafid Haffaf. "Multipath Extension of the ZigBee Tree Routing in Cluster-Tree Wireless Sensor Networks." International Journal of Mobile Computing and Multimedia Communications 4, no. 2 (April 2012): 30–48. http://dx.doi.org/10.4018/jmcmc.2012040103.

Full text

Abstract:

Wireless Multimedia Sensor Networks (WMSNs) are one of the most challenging applications of WSN. They require large amounts of data to be transmitted with high reporting rates which consume an order of magnitude of resources, such as storage, computation, bandwidth, and energy. On the other hand, the ZigBee standard was originally specified for low data rate, low power consumption, and low cost wireless personal area networks (WPANs), making it suitable to WSN. However, handling high data rate applications, such as video surveillance in WPANs, is a challenge. Simultaneous multipath routing is one solution to increase the available bandwidth in a ZigBee network. In this paper, we proposed Z-MHTR (ZigBee Multipath Hierarchical Tree Routing), a node disjoint multipath routing extension of the ZigBee tree routing protocol in cluster-tree WSNs. Extensive simulations were performed and showed that the propsed multipath routing enhances application performance in terms of packet delivery ratio, end to end delay, and network lifetime even under heavy data rates.

APA, Harvard, Vancouver, ISO, and other styles

45

Georgiades, Michael, Kar Ann Chew, and Rahim Tafazolli. "Advances in IP Micromobility Management Using a Mobility-Aware Routing Protocol." Research Letters in Communications 2007 (2007): 1–4. http://dx.doi.org/10.1155/2007/23254.

Full text

Abstract:

Several micromobility schemes have been proposed to augment Mobile IP and provide a faster and smoother handoff than what is achievable by Mobile IP alone, the majority of which can be categorized into either “network prefix-based” or “host-specific forwarding” mobility management protocols, depending on the routing method used. This letter proposes a mobility-aware routing protocol (MARP) which makes use of both of these routing methods using dynamic IP address allocation. Its performance is evaluated and compared against hierarchical Mobile IP (HMIP) and Cellular IP based on handoff performance, end-to-end delivery delay, and scalability. The results demonstrate that MARP is a more robust, flexible, and scalable micromobility protocol, minimizes session disruption, and offers improvements in handoff performance.

APA, Harvard, Vancouver, ISO, and other styles

46

Muñoz-Morera, Jorge, Francisco Alarcon, Ivan Maza, and Anibal Ollero. "Combining a hierarchical task network planner with a constraint satisfaction solver for assembly operations involving routing problems in a multi-robot context." International Journal of Advanced Robotic Systems 15, no. 3 (May 1, 2018): 172988141878208. http://dx.doi.org/10.1177/1729881418782088.

Full text

Abstract:

This work addresses the combination of a symbolic hierarchical task network planner and a constraint satisfaction solver for the vehicle routing problem in a multi-robot context for structure assembly operations. Each planner has its own problem domain and search space, and the article describes how both planners interact in a loop sharing information in order to improve the cost of the solutions. The vehicle routing problem solver gives an initial assignment of parts to robots, making the distribution based on the distance among parts and robots, trying also to maximize the parallelism of the future assembly operations evaluating during the process the dependencies among the parts assigned to each robot. Then, the hierarchical task network planner computes a scheduling for the given assignment and estimates the cost in terms of time spent on the structure assembly. This cost value is then given back to the vehicle routing problem solver as feedback to compute a better assignment, closing the loop and repeating again the whole process. This interaction scheme has been tested with different constraint satisfaction solvers for the vehicle routing problem. The article presents simulation results in a scenario with a team of aerial robots assembling a structure, comparing the results obtained with different configurations of the vehicle routing problem solver and showing the suitability of using this approach.

APA, Harvard, Vancouver, ISO, and other styles

47

Nehnouh, Chakib, and Mohamed Senouci. "A New Fault Tolerant Routing Algorithm for Networks on Chip." International Journal of Embedded and Real-Time Communication Systems 10, no. 3 (July 2019): 68–85. http://dx.doi.org/10.4018/ijertcs.2019070105.

Full text

Abstract:

To provide correct data transmission and to handle the communication requirements, the routing algorithm should find a new path to steer packets from the source to the destination in a faulty network. Many solutions have been proposed to overcome faults in network-on-chips (NoCs). This article introduces a new fault-tolerant routing algorithm, to tolerate permanent and transient faults in NoCs. This solution called DINRA can satisfy simultaneously congestion avoidance and fault tolerance. In this work, a novel approach inspired by Catnap is proposed for NoCs using local and global congestion detection mechanisms with a hierarchical sub-network architecture. The evaluation (on reliability, latency and throughput) shows the effectiveness of this approach to improve the NoC performances compared to state of art. In addition, with the test module and fault register integrated in the basic architecture, the routers are able to detect faults dynamically and re-route packets to fault-free and congestion-free zones.

APA, Harvard, Vancouver, ISO, and other styles

48

Rais, Amine, Khalid Bouragba, and Mohammed Ouzzif. "Routing and Clustering of Sensor Nodes in the Honeycomb Architecture." Journal of Computer Networks and Communications 2019 (March 25, 2019): 1–12. http://dx.doi.org/10.1155/2019/4861294.

Full text

Abstract:

Energy is the most valuable resource in wireless sensor networks; this resource is limited and much in demand during routing and communication between sensor nodes. Hierarchy structuring of the network into clusters allows reducing the energy consumption by using small distance transmissions within clusters in a multihop manner. In this article, we choose to use a hybrid routing protocol named Efficient Honeycomb Clustering Algorithm (EHCA), which is at the same time hierarchical and geographical protocol by using honeycomb clustering. This kind of clustering guarantees the balancing of the energy consumption through changing in each round the location of the cluster head, which is in a given vertex of the honeycomb cluster. The combination of geographical and hierarchical routing with the use of honeycomb clustering has proved its efficiency; the performances of our protocol outperform the existing protocols in terms of the number of nodes alive, the latency of data delivery, and the percentage of successful data delivery to the sinks. The simulations testify the superiority of our protocol against the existing geographical and hierarchical protocols.

APA, Harvard, Vancouver, ISO, and other styles

49

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

50

Kaur, Jaspreet, and Amit Kumar Bindal. "Adaptive Topology Control for Hierarchical Routing Over Resource Constrained Wireless Sensor Networks." Journal of Computational and Theoretical Nanoscience 16, no. 9 (September 1, 2019): 3917–24. http://dx.doi.org/10.1166/jctn.2019.8271.

Full text

Abstract:

Topology defines the standards used by sensors to communicate with each other. Frequent updates in topology may cause excessive control overhead. Overall resource requirements for network operations can be reduced by optimizing the topology control schemes. In this paper, traditional methods for topology management are investigated and a new approach is introduced to manage the frequent topological updates.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Hierarchical routing (Computer network management)'

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