Log in

Relevant bibliographies by topics / Balanced Path routing mechanism / Journal articles

To see the other types of publications on this topic, follow the link: Balanced Path routing mechanism.

Journal articles on the topic 'Balanced Path routing mechanism'

Author: Grafiati

Published: 7 June 2025

Last updated: 2 August 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Balanced Path routing mechanism.'

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

priya, T.Shanmuga, and N. Kamalraj. "Balanced Path Routing and Detection Mechanism for Wireless Sensor Networks." COMPUSOFT: An International Journal of Advanced Computer Technology 02, no. 10 (2013): 313–18. https://doi.org/10.5281/zenodo.14613411.

Full text

Abstract:

An Enhanced Dijkstra’s algorithm is presented in this paper. In this proposed approach, a new form of Balanced Path Routing technique is used in which the data send from source node is being transferred to the alternate node and then pass through the nodes to reach the destination. This prevents cuts in between the nodes and gives prior estimation of the shortest route path from source to destination. In Enhanced Dijkstra’s algorithm, the packet delivery ratio is maintained at 80% even when the number of nodes gets increased. This finding indicates that proposed method guarantees r

APA, Harvard, Vancouver, ISO, and other styles

2

Pham, Peter P., and Sylvie Perreau. "Performance analysis of reactive shortest path and multi-path routing mechanism with load balance." Journal of Telecommunications and Information Technology, no. 2 (June 30, 2003): 38–47. http://dx.doi.org/10.26636/jtit.2003.2.172.

Full text

Abstract:

Research on multi-path routing protocols to provide improved throughput and route resilience as compared with single-path routing has been explored in details in the context of wired networks. However, multi-path routing mechanism has not been explored thoroughly in the domain of ad hoc networks. In this paper, we analyze and compare reactive single-path and multi-path routing with load balance mechanisms in ad hoc networks, in terms of overhead, traffic distribution and connection throughput. The results reveals that in comparison with general single-path routing protocol, multi-path routing

APA, Harvard, Vancouver, ISO, and other styles

3

Jean de Dieu, Imanishimwe, Nyirabahizi Assouma, Maniraguha Muhamad, Wang Jin, and Sungyoung Lee. "Energy-Efficient Secure Path Algorithm for Wireless Sensor Networks." International Journal of Distributed Sensor Networks 8, no. 4 (2012): 751784. http://dx.doi.org/10.1155/2012/751784.

Full text

Abstract:

To collect the data and transmit them on the base station is the main task of the sensor nodes in wireless sensor networks (WSNs). This transmission requires a specific routing algorithm. To prolong the network lifetime, sensor nodes need a secure load-balancing route. In this paper, we investigate the facts of ensuring secure sensed data in a balanced energy network backbone, and propose energy-efficient secure path algorithm (ESPA) for WSNs. It is a process of ensuring sensed data authenticity and integrity under a well-structured energy-efficient routing. To overcome the limitation caused b

APA, Harvard, Vancouver, ISO, and other styles

4

Wu, Xiaoming, Yinglong Wang, and Yifan Hu. "A Swarm Intelligent Algorithm Based Route Maintaining Protocol for Mobile Sink Wireless Sensor Networks." Mathematical Problems in Engineering 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/823909.

Full text

Abstract:

Recent studies have shown that mobile sink can be a solution to solve the problem that energy consumption of sensor nodes is not balanced in wireless sensor networks (WSNs). Caused by the sink mobility, the paths between the sensor nodes and the sink change frequently and have profound influence on the lifetime of WSN. It is necessary to design a protocol that can find efficient routings between the mobile sink and nodes but does not consume too many network resources. In this paper, we propose a swarm intelligent algorithm based route maintaining protocol to resolve this issue. The protocol u

APA, Harvard, Vancouver, ISO, and other styles

5

Lalitha, T., Jayanthila Devi, and Dr G. M. Kadh. "A Study on Existing Protocols and Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 11, no. 7 (2013): 2787–91. http://dx.doi.org/10.24297/ijct.v11i7.3471.

Full text

Abstract:

Energy is an extremely critical resource for battery-powered wireless sensor networks (WSN), thus making energy-efficient protocol design a key challenging problem. Most of the existing energy-efficient routing protocols always forward packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of forming residue energy among sensor nodes, and eventually results in a network partition. In this paper, with the help of the concept of potential in physics, we design an Energy-Balanced Routing Protocol (EBRP) by constructing a mi

APA, Harvard, Vancouver, ISO, and other styles

6

Pham, Peter P., and Sylvie Perreau. "Increasing the network performance using multi-path routing mechanism with load balance." Ad Hoc Networks 2, no. 4 (2004): 433–59. http://dx.doi.org/10.1016/j.adhoc.2003.09.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Guo, Xuanchen, Lei Shu, Xing Yang, et al. "Two-Hop Energy Consumption Balanced Routing Algorithm for Solar Insecticidal Lamp Internet of Things." Sensors 22, no. 1 (2021): 154. http://dx.doi.org/10.3390/s22010154.

Full text

Abstract:

Due to the sparsity deployment of nodes, the full connection requirement, and the unpredictable electromagnetic interference on communication caused by high voltage pulse current of Solar Insecticidal Lamps Internet of Things (SIL-IoTs), a Two-Hop Energy Consumption Balanced routing algorithm (THECB) is proposed in this research work. THECB selects next-hop nodes according to 1-hop and 2-hop neighbors’ information. In addition, the greedy forwarding mechanism is expressed in the form of probability; that is, each neighbor node is given a weight between 0 and 1 according to the distance. THECB

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Zhen, and Lin Huang. "VCHR: Virtual Cluster-Based Hybrid Routing Protocol." Key Engineering Materials 467-469 (February 2011): 2117–22. http://dx.doi.org/10.4028/www.scientific.net/kem.467-469.2117.

Full text

Abstract:

There are a couple of inherent shortcomings which are hard to be overcome in single topology network; thus we propose a novel routing protocol—VCHR, i.e., Virtual Cluster-based Hybrid Routing, which employs hybrid topology, bears the stamp of flat and hierarchical routing protocol. At stage of hierarchical routing, VCHR draws on the idea of the virtual cluster; base station controls clustering process based on network coverage control criteria in centralized model, and ensuring the reliability of virtual clusters by making use of the three-way handshake mechanism. Flat routing employs shortest

APA, Harvard, Vancouver, ISO, and other styles

9

Liang, Shih Tsung, Bo Yi Song, and Yu Yao Su. "Opportunistic Frame Forwarding in Wireless Mesh Networks." Applied Mechanics and Materials 764-765 (May 2015): 941–45. http://dx.doi.org/10.4028/www.scientific.net/amm.764-765.941.

Full text

Abstract:

Opportunistic routing has been shown to achieve the high throughput of the wireless mesh network with lossy channels. Different from deterministic routing mechanisms in which a frame is <em>transmitted</em> and forwarded along with a fixed and predetermined <em>path</em>, the opportunistic routing technique allows multiple nodes hearing the frame to form the forwarder set containing promising candidates for the frame forwarding. Existing opportunistic routing protocols typically choose among forwarding candidates based on the decision made from the transmitter disregard

APA, Harvard, Vancouver, ISO, and other styles

10

Du Chen, Du Chen, Deyun Gao Du Chen, Wei Quan Deyun Gao, Chuan Heng Foh Wei Quan, and Hongke Zhang Chuan Heng Foh. "Fast and On-demand Network-wide Telemetry via Cluster Based Path Planning." 網際網路技術學刊 24, no. 6 (2023): 1343–52. http://dx.doi.org/10.53106/160792642023112406016.

Full text

Abstract:

<p>In-band Network Telemetry (INT) has profoundly promoted the network visibility. However, the existing solutions either face Maximum Transmission Unit (MTU) limitation or latency issue due to continuous insertion of INT metadata along long forwarding paths. In addition, conducting telemetry using user packets is prone to result in duplicate telemetry and fall short to achieve network-wide telemetry. In this work, we propose NetworkSight to comprehensively resolve these problems through cluster based path planning and source routing based on-demand forwarding. Specifically, a cluster ba

APA, Harvard, Vancouver, ISO, and other styles

11

Ravichandran, S., and M. Umamaheswari. "Design and Development in Research of Adaptive Multipath Routing for Burden Harmonizing in MANET." Asian Journal of Computer Science and Technology 4, no. 2 (2015): 39–43. http://dx.doi.org/10.51983/ajcst-2015.4.2.1751.

Full text

Abstract:

In mobile ad hoc network (MANET), congestion is one of the most important limitations that affect the performance of the whole network. Multi-path routing protocol can balance and share the load better than the single path routing protocol in ad hoc networks, hereby reducing the congestion possibility by dividing the traffic in alternative paths. The performance of the network can be improved by using a burden harmonizing mechanism. Such a mechanism transfers load from overloaded nodes to under loaded nodes. The objective of multipath routing is to improve the reliability and throughput and fa

APA, Harvard, Vancouver, ISO, and other styles

12

Liu, Longgeng, and Guangchun Luo. "Routing optimization in networks based on traffic gravitational field model." International Journal of Modern Physics B 31, no. 11 (2017): 1750074. http://dx.doi.org/10.1142/s0217979217500746.

Full text

Abstract:

For research on the gravitational field routing mechanism on complex networks, we further analyze the gravitational effect of paths. In this study, we introduce the concept of path confidence degree to evaluate the unblocked reliability of paths that it takes the traffic state of all nodes on the path into account from the overall. On the basis of this, we propose an improved gravitational field routing protocol considering all the nodes’ gravities on the path and the path confidence degree. In order to evaluate the transmission performance of the routing strategy, an order parameter is introd

APA, Harvard, Vancouver, ISO, and other styles

13

Cui, Guang Cai, Shan Shan Wang, and Jing Jing Fang. "An Ant-Colony Routing Algorithm for Wireless Sensor Network." Applied Mechanics and Materials 462-463 (November 2013): 112–17. http://dx.doi.org/10.4028/www.scientific.net/amm.462-463.112.

Full text

Abstract:

According to real-time and limited energy of the wireless sensor network (WSN), this paper proposed an ant-colony algorithm (ACO) for optimal routing. The algorithm limited the search space to next node based on search angle and designed directional pheromones to guide ants to the destination node. Using negative feedback mechanism encouraged later ants to choose the optimal path. When ants are timeout with limited life cycle, go back along the way and reduce the pheromone. Probability-transfer function contained the factors of distance, energy, pheromones and search angle. Compared with other

APA, Harvard, Vancouver, ISO, and other styles

14

Yang, Songxiang, Lin Ma, Shuang Jia, and Danyang Qin. "A Novel Markov Model-Based Low-Power and Secure Multihop Routing Mechanism." Journal of Sensors 2019 (October 7, 2019): 1–11. http://dx.doi.org/10.1155/2019/6578406.

Full text

Abstract:

For the severe impact of limited energy and network attacks caused by open transmission channels on data transmission, this paper presents a low-power and secure multihop routing mechanism based on the Markov state transition theory. The random selection of transmission paths enables the network to resist typical attacks such as interference and interception, thus ensuring the security of data transmission. Meanwhile, the proposed algorithm can reduce the overall energy consumption of the network and balance the load according to the residual energy of each path. Simulation results prove that

APA, Harvard, Vancouver, ISO, and other styles

15

Kim, Wooseong, Muhammad Muneer Umar, Shafiullah Khan, and Muhammad Altaf Khan. "Novel Scoring for Energy-Efficient Routing in Multi-Sensored Networks." Sensors 22, no. 4 (2022): 1673. http://dx.doi.org/10.3390/s22041673.

Full text

Abstract:

The seamless operation of inter-connected smart devices in Internet of Things (IoT) wireless sensor networks (WSNs) requires consistently available end-to-end routes. However, the sensor nodes that rely on a very limited power source tend to cause disconnection in multi-hop routes due to power shortages in the WSNs, which eventually results in the inefficiency of the overall IoT network. In addition, the density of the available sensor nodes affects the existence of feasible routes and the level of path multiplicity in the WSNs. Therefore, an efficient routing mechanism is expected to extend t

APA, Harvard, Vancouver, ISO, and other styles

16

Lee, Seung Chan, and Tae Hee Han. "Q-Function-Based Traffic- and Thermal-Aware Adaptive Routing for 3D Network-on-Chip." Electronics 9, no. 3 (2020): 392. http://dx.doi.org/10.3390/electronics9030392.

Full text

Abstract:

Die-stacking technology is expanding the space diversity of on-chip communications by leveraging through-silicon-via (TSV) integration and wafer bonding. The 3D network-on-chip (NoC), a combination of die-stacking technology and systematic on-chip communication infrastructure, suffers from increased thermal density and unbalanced heat dissipation across multi-stacked layers, significantly affecting chip performance and reliability. Recent studies have focused on runtime thermal management (RTM) techniques for improving the heat distribution balance, but performance degradations, owing to RTM m

APA, Harvard, Vancouver, ISO, and other styles

17

N., Prathviraj, and Santosh L. Deshpande. "Rough set based QoS enabled multipath source routing in MANET." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1915. http://dx.doi.org/10.11591/ijece.v10i2.pp1915-1923.

Full text

Abstract:

The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multi-layer mechanism should be

APA, Harvard, Vancouver, ISO, and other styles

18

Prathviraj, N., and Deshpande L. "Rough set based QoS enabled multipath source routing in MANET." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1915–23. https://doi.org/10.11591/ijece.v10i2.pp1915-1923.

Full text

Abstract:

The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be i

APA, Harvard, Vancouver, ISO, and other styles

19

Wang, Biao, Haobo Zhang, Yunan Zhu, Banggui Cai, and Xiaopeng Guo. "Adaptive Power-Controlled Depth-Based Routing Protocol for Underwater Wireless Sensor Networks." Journal of Marine Science and Engineering 11, no. 8 (2023): 1567. http://dx.doi.org/10.3390/jmse11081567.

Full text

Abstract:

Low energy consumption has always been one of the core issues in the routing design of underwater sensor networks. Due to the high cost and difficulty of deployment and replacement of current underwater nodes, many underwater applications require the routing protocol design to consider the network lifetime extension problem. Based on this, we designed a new routing protocol that takes into account both low energy consumption and balanced energy consumption, and achieves effective extension of the network lifetime, called adaptive power-controlled depth-based routing protocol for underwater wir

APA, Harvard, Vancouver, ISO, and other styles

20

Zhu, Fang, and Wenhao Wang. "A Distributed Unequal Clustering Routing Protocol Based on the Improved Sine Cosine Algorithm for WSN." Journal of Sensors 2022 (February 23, 2022): 1–13. http://dx.doi.org/10.1155/2022/7382098.

Full text

Abstract:

In order to balance the overall energy consumption and improve the energy efficiency of wireless sensor network (WSN), a distributed energy-balanced unequal clustering routing protocol based on the improved sine cosine algorithm (DUCISCA) is proposed. Firstly, DUCISCA adopts a time-based cluster head competition algorithm. In this algorithm, the broadcast time depends on the residual energy of the candidate cluster head, the distance to the base station, and the number of neighbour nodes. Secondly, a competition radius considering the distance from node to base station and the residual energy

APA, Harvard, Vancouver, ISO, and other styles

21

Li, Yanbing, Yang Zhu, and Shangpeng Wang. "SC-Route: A Scalable Cross-Layer Secure Routing Method for Multi-Hop Inter-Domain Wireless Networks." Mathematics 13, no. 11 (2025): 1741. https://doi.org/10.3390/math13111741.

Full text

Abstract:

Multi-hop inter-domain wireless networks play a vital role in future heterogeneous communication systems by improving data transmission efficiency and security assurance. Despite the advances in secure routing techniques in areas such as node authentication and encryption, they still suffer from the shortcomings of frequent key updates, high computational overhead, and poor adaptability to large-scale dynamic topologies. To address these limitations, we propose a new routing method—the Secure Cross-Layer Route—designed for multi-hop inter-domain wireless networks to achieve unified optimizatio

APA, Harvard, Vancouver, ISO, and other styles

22

Zhang, Hui. "A WSN Clustering Multi-Hop Routing Protocol Using Cellular Virtual Grid in IoT Environment." Mathematical Problems in Engineering 2020 (November 9, 2020): 1–7. http://dx.doi.org/10.1155/2020/8886687.

Full text

Abstract:

By dividing the grid and clustering multi-hop algorithm, the lifetime of WSN can be prolonged effectively, and the reliability of the system can be improved. In order to prolong network lifetime and balance network energy consumption, a WSN clustering multi-hop routing protocol for electric vehicles using cellular virtual grid is proposed. The routing mechanism divides cells into regular hexagons. In the cluster head selection stage, the node angle ratio, distance ratio, and throughput optimization threshold function are introduced to select cluster heads independently. In data transmission, s

APA, Harvard, Vancouver, ISO, and other styles

23

Wu, Jiagao, Fan Yuan, Yahang Guo, Hongyu Zhou, and Linfeng Liu. "A Fuzzy-Logic-Based Double Q -Learning Routing in Delay-Tolerant Networks." Wireless Communications and Mobile Computing 2021 (January 26, 2021): 1–17. http://dx.doi.org/10.1155/2021/8890772.

Full text

Abstract:

Delay-tolerant networks (DTNs) are wireless mobile networks, which suffer from frequent disruption, high latency, and lack of a complete path from source to destination. The intermittent connectivity in DTNs makes it difficult to efficiently deliver messages. Research results have shown that the routing protocol based on reinforcement learning can achieve a reasonable balance between routing performance and cost. However, due to the complexity, dynamics, and uncertainty of the characteristics of nodes in DTNs, providing a reliable multihop routing in DTNs is still a particular challenge. In th

APA, Harvard, Vancouver, ISO, and other styles

24

Li, Xian Li, Jia Wei Zhang, and Liang Bing Liu. "Dynamic Multi-Hop Routing Protocol in Wireless Sensor Networks." Applied Mechanics and Materials 442 (October 2013): 532–37. http://dx.doi.org/10.4028/www.scientific.net/amm.442.532.

Full text

Abstract:

Considering the shortage of LEACH protocol, a novel dynamic multi-hop routing protocol named Balance Energy-efficient and Real-time with Reliable communication protocol based on Connected Dominant Set (BERR-CDS) is proposed in this paper. BERR-CDS protocol fully takes account of the energy consumption of an individual node and entire network, a rational transmission path from source node to sink node is searched, aiming at the network topology changes which are caused by the death of cluster head, the invalidation of cluster member nodes and new nodes joining, BERR-CDS designs the correspondin

APA, Harvard, Vancouver, ISO, and other styles

25

Kim, Kyungdoh, Chunghun Ha, and Changsoo Ok. "Network Structure-Aware Ant-Based Routing in Large-Scale Wireless Sensor Networks." International Journal of Distributed Sensor Networks 2015 (2015): 1–16. http://dx.doi.org/10.1155/2015/521784.

Full text

Abstract:

Routing algorithms for large-scale sensor networks should be capable of finding energy efficient paths to prolong the lifetime of the networks in a decentralized manner. With this respect, Ant System has several proper characteristics for routing algorithm in large-scale wireless sensor networks. First, its distributed mechanism enables routing algorithm to find a solution with only local information and be robust for uncertainties in wireless sensor networks. Second, the framework of the Ant System is proper to solve dynamic problems such as routing problem. Transition probability in Ant Syst

APA, Harvard, Vancouver, ISO, and other styles

26

Faouzi, Hassan, Hicham Mouncif, and Mohamed Lamsaadi. "AODV Energy Routing Mechanism for Multi-Channel Multi-Interface Ad Hoc Networks (EMCMI-AODV) Using a Dynamic Programming Algorithm." International Journal of Mobile Computing and Multimedia Communications 7, no. 4 (2016): 1–16. http://dx.doi.org/10.4018/ijmcmc.2016100101.

Full text

Abstract:

Energy consumption is a significant issue and offers a rich scope for research in ad hoc networks. However, many energy efficiency routing protocols are configured to use only a single Interface single Channel (SISC). As a result, these networks rarely can fully exploit all bandwidth available in the radio spectrum provisioned by the standards. This paper proposes two extensions to the shortest-path routing algorithm that finds routes to balance load based on residual energy of nodes and hops of route, one uses Floyd Warshall and the other uses Bellman-Ford algorithm. The protocols work with n

APA, Harvard, Vancouver, ISO, and other styles

27

Reddy, G. Vinoda, Kavitha Thandapani, N. C. Sendhilkumar, et al. "Optimizing QoS-Based Clustering Using a Multi-Hop with Single Cluster Communication for Efficient Packet Routing." International Journal of Electrical and Electronics Research 10, no. 2 (2022): 69–73. http://dx.doi.org/10.37391/ijeer.100203.

Full text

Abstract:

Modern day communication systems have gained a revolutionized growth in long-distance wireless data transmission. High speed packet transfer impacts quality requirements. Critical factors that ruin service quality (Qos) are calculated by the primary factors involving power efficiency, packet delivery ratio, and overall transmission and reception delay. A well-developed routing protocol with unique attributes should be deployed to give improved QoS. The drawback of single path routing in delivering a packet at traffic is challenging since it does not have an alternative path in case of path fai

APA, Harvard, Vancouver, ISO, and other styles

28

Faheem, Butt, Raza, et al. "QoSRP: A Cross-layer QoS Channel-Aware Routing Protocol for the Internet of Underwater Acoustic Sensor Networks." Sensors 19, no. 21 (2019): 4762. http://dx.doi.org/10.3390/s19214762.

Full text

Abstract:

Quality of service (QoS)-aware data gathering in static-channel based underwater wireless sensor networks (UWSNs) is severely limited due to location and time-dependent acoustic channel communication characteristics. This paper proposes a novel cross-layer QoS-aware multichannel routing protocol called QoSRP for the internet of UWSNs-based time-critical marine monitoring applications. The proposed QoSRP scheme considers the unique characteristics of the acoustic communication in highly dynamic network topology during gathering and relaying events data towards the sink. The proposed QoSRP schem

APA, Harvard, Vancouver, ISO, and other styles

29

Zhang, Ling, and Cheng Wan. "Dynamic Path Planning Design for Mobile Sink with Burst Traffic in a Region of WSN." Wireless Communications and Mobile Computing 2019 (February 3, 2019): 1–8. http://dx.doi.org/10.1155/2019/2435712.

Full text

Abstract:

In mobile wireless sensor networks, priori-trail planning for the mobile sink is a commonly used solution to data collection from the whole network, for its low protocol overhead. However, these trail-based approaches lack efficient load balance mechanism to handle burst WSN traffic, which needs to be sent to the base station correctly with low delay. This paper proposed a dynamic path planning for mobile sink to balance load and avoid traffic bottleneck. It contains grid partition of the network, priori-trail creation, burst-traffic awareness and estimation, resources collaborative strategy,

APA, Harvard, Vancouver, ISO, and other styles

30

Singh, Satyanand, Joanna Rosak-Szyrocka, and Balàzs Lukàcs. "Design and Analysis of a Bandwidth Aware Adaptive Multipath N-Channel Routing Protocol for 5G Internet of Things (IoT)." Emerging Science Journal 8, no. 1 (2024): 251–69. http://dx.doi.org/10.28991/esj-2024-08-01-018.

Full text

Abstract:

Large numbers of mobile wireless nodes that can move randomly and join or leave the network at any moment make up mobile ad-hoc networks. A significant number of messages are delivered during information exchange in populated regions because of the Internet of Things' (IoT) exponential increase in connected devices. Congestion can increase transmission latency and packet loss by causing congestion. More network size, increased network traffic, and high mobility that necessitate dynamic topology make this problem worse. An adaptive Multipath Multichannel Energy Efficient (AMMEE) routing strateg

APA, Harvard, Vancouver, ISO, and other styles

31

Et. al., Dr Shanti Rathore,. "Multipath Reliable Routing Using Cluster Based Communication." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 2 (2021): 3210–15. http://dx.doi.org/10.17762/turcomat.v12i2.2378.

Full text

Abstract:

In this research we proposed the protection in ANT Optimized primarily based multipath congestion routing performance. Here the situation of DDoS is simulated and examines their impact in dynamic network. The multipath protocol like AOMDV is balance the all load by way of offering alternative path however not knowledgeable at each and every condition. The DDoS attacker is blocking off the whole viable direction in community by way of flooding large quantity of redundant packets in dynamic network. The attacker is that the intermediate node and this attacker contamination is continuously disper

APA, Harvard, Vancouver, ISO, and other styles

32

Xu, Kaida, Zhidong Zhao, Yi Luo, Guohua Hui, and Liqin Hu. "An Energy-Efficient Clustering Routing Protocol Based on a High-QoS Node Deployment with an Inter-Cluster Routing Mechanism in WSNs." Sensors 19, no. 12 (2019): 2752. http://dx.doi.org/10.3390/s19122752.

Full text

Abstract:

Currently, wireless sensor network (WSN) protocols are mainly used to achieve low power consumption of the network, but there are few studies on the quality of services (QoS) of these networks. Coverage can be used as a measure of the WSN’s QoS, which can further reflect the quality of data information. Additionally, the coverage requirements of regional monitoring target points are different in real applications. On this basis, this paper proposes an energy-efficient clustering routing protocol based on a high-QoS node deployment with an inter-cluster routing mechanism (EECRP-HQSND-ICRM) in W

APA, Harvard, Vancouver, ISO, and other styles

33

Arora, Ashima, and Neeraj Kr Shukla. "An Efficient and Congestion Aware Fuzzy Based Output Selection Strategy for On-Chip Routers." International Journal of Information System Modeling and Design 8, no. 2 (2017): 57–69. http://dx.doi.org/10.4018/ijismd.2017040104.

Full text

Abstract:

The network performance of an adaptive router largely depends on well designed selection strategy. The selection function selects one of the accepted output directions returned by the routing function. The effectiveness of any selection strategy relies on its congestion free traffic distribution mechanism for each incoming packet. This article proposes a fuzzy based output selection strategy that considers the congestion information from both neighboring routers as well as routers on global path. The strategy efficiently balances the traffic load by using the knowledge base of fuzzy controller

APA, Harvard, Vancouver, ISO, and other styles

34

Alejandrino, Jonnel D., Ronnie S. Concepcion II, Vincent Jan D. Almero, et al. "Protocol-Independent Data Acquisition for Precision Farming." Journal of Advanced Computational Intelligence and Intelligent Informatics 25, no. 4 (2021): 397–403. http://dx.doi.org/10.20965/jaciii.2021.p0397.

Full text

Abstract:

This paper proposes an optimal design of network and a routing mechanism that is independent from fixed protocols. It provides an optimized route for diversified mesh network, which can support interorganizational communication in a large-scale operation. Decentralization of the system ensures that every protocol acts independently and selects the best optimal path during transmission of data without modifying their architecture and technology. Incorporation of definite source configuration improves the mobility of the systems. Each sensor is individually processed to balance the data load and

APA, Harvard, Vancouver, ISO, and other styles

35

Lin, Hsiao-Chung, Ping Wang, Wen-Hui Lin, and Yu-Hsiang Huang. "A Multiple-Swarm Particle Swarm Optimisation Scheme for Tracing Packets Back to the Attack Sources of Botnet." Applied Sciences 11, no. 3 (2021): 1139. http://dx.doi.org/10.3390/app11031139.

Full text

Abstract:

Network intrusion detection systems that employ existing IP traceback (IPTBK) algorithms are generally unable to trace multiple attack sources. In these systems, the sampling mechanism only screens parts of the routing information, which leads to the tracing of the neighbour of the attack source and fails to identify the attack source. Theoretically, the multimodal optimisation problem cannot be solved for all of its multiple solutions using the traditional particle swarm optimisation (PSO) algorithm. The present study focuses on the use of multiple-swarm PSO (MSPSO) for recursively tracing at

APA, Harvard, Vancouver, ISO, and other styles

36

Cao, Bingyao, Xiwen Fan, Yiming Hong, and Qianqian Zhao. "Research on Time-Sensitive Service Transmission Routing and Scheduling Strategies Based on Optical Interconnect Low Earth Orbit Mega-Constellations." Applied Sciences 15, no. 7 (2025): 3843. https://doi.org/10.3390/app15073843.

Full text

Abstract:

The development of low-orbit satellite communication networks marks the beginning of a new era in global communication. However, in the context of large-scale LEO satellite communication scenarios, the traditional adjacent connection transmission method limits the advantages of low latency in optical communication. Multi-hop transmission increases the number of hops and propagation distance, thereby affecting time-sensitive business transmissions. Therefore, based on the design of optical interconnect parallel subnetworks, this paper proposes a scheduling strategy for time-sensitive business t

APA, Harvard, Vancouver, ISO, and other styles

37

Sun, Zeyu, Chen Xu, Guoyong Wang, et al. "An Enhanced Energy-Efficient Data Collection Optimization Algorithm for UAV Swarm in the Intelligent Internet of Things." Drones 7, no. 6 (2023): 373. http://dx.doi.org/10.3390/drones7060373.

Full text

Abstract:

In the case of limited endurance of unmanned aerial vehicles (UAVs), in order to further improve UAV data collection efficiency, this paper puts forward EDC-UAVIIoT: an enhanced energy-efficient data collection optimization algorithm for UAV swarm in the intelligent Internet of Things. First of all, the algorithm optimizes the UAV cruise path through the intelligent Internet of Things routing mechanism, avoids the occurrence of data errors in the packet transmission process, and uses the end-to-end transmission error probability model. The error probability of data packets in the transmission

APA, Harvard, Vancouver, ISO, and other styles

38

Cheng, Hengfei, Zhaobin Xu, Xiaoxu Guo, et al. "Research on Routing Equalization Algorithm of Inter-Satellite Partition for Low-Orbit Micro-Satellites." Future Internet 14, no. 7 (2022): 207. http://dx.doi.org/10.3390/fi14070207.

Full text

Abstract:

Low-orbit micro-satellite technology has developed rapidly in recent years due to its advantages of low time delay, low cost and short research period. However, among the existing inter-satellite routing algorithms, the classical flooding and greedy algorithms and their derivatives also have some limitations. The path delay calculated by the flooding algorithm is small but the calculation is large, while the greedy algorithm is the opposite. In this paper, a balanced inter-satellite routing algorithm based on partition routing is proposed. This paper presents the simulation experiments for the

APA, Harvard, Vancouver, ISO, and other styles

39

S.Girija, Ms, Mrs S.Kayathri, and Ms S.Meena. "Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks." International Journal of Engineering & Technology 7, no. 3.10 (2018): 59. http://dx.doi.org/10.14419/ijet.v7i3.10.15630.

Full text

Abstract:

In the concurrent system, each node avails as a packet over the network depends on the length of the node. The length of the node generated through straight line routing algorithm. The cost of routing depends on the shortest path routing algorithm. The shortest path is determined by the cost of a distance from one node to another over the network. The capacity of a network is balanced and maintained by the straight routing. The traffic and cost is balanced over the network by using the algorithms.

APA, Harvard, Vancouver, ISO, and other styles

40

Jie Gao and Li Zhang. "Load-balanced short-path routing in wireless networks." IEEE Transactions on Parallel and Distributed Systems 17, no. 4 (2006): 377–88. http://dx.doi.org/10.1109/tpds.2006.49.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

SUN, Guo-Dong, and Ming-Hong LIAO. "Energy-balanced Short Path Routing in Wireless Sensor Networks." Acta Automatica Sinica 34, no. 12 (2009): 1540–44. http://dx.doi.org/10.3724/sp.j.1004.2008.01540.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Ma, Zhongyu, Qun Guo, Ji Ma, et al. "VaSe-MRP: Velocity-aware and stability-estimation–based multi-path routing protocol in flying ad hoc network." International Journal of Distributed Sensor Networks 15, no. 11 (2019): 155014771988312. http://dx.doi.org/10.1177/1550147719883128.

Full text

Abstract:

Flying ad hoc network is widely used in many military and civilian scenarios. Compared with mobile ad hoc network and vehicular ad hoc network, flying ad hoc network holds some special characteristics such as high mobility, long-distance communication, and sparse node-deployment, which cause an important challenge in the design of routing protocols. In this article, a velocity-aware and stability-estimation–based multi-path routing protocol is proposed for flying ad hoc network. The protocol is mainly composed of two important parts, which are the routing discovery mechanism and routing mainte

APA, Harvard, Vancouver, ISO, and other styles

43

Liu, Zhuang, Xin Feng, Jing Zhang, Yan Liu, Jianfei Zhang, and Xin Zhang. "An Improved Rumor Routing Protocol Based on Optimized Intersection Angle Theory and Localization Technologies in WSN." Journal of Advanced Computational Intelligence and Intelligent Informatics 21, no. 7 (2017): 1172–79. http://dx.doi.org/10.20965/jaciii.2017.p1172.

Full text

Abstract:

Routing mechanism is a key issue in Wireless Sensor Networks, and rumor routing protocol can reduce energy consumption and extend the lifecycle of network with unicast mechanism. However, in Rumor Routing protocol, the transmission path of event message is not optimal and random forwarding mechanism will lead to routing loop. In this paper, we investigate Rumor Routing protocol, and propose an improved rumor routing protocol based on optimized intersection angle theory. Localization technology and vector intersection angle mechanism are brought into the new protocol as two metrics of route sel

APA, Harvard, Vancouver, ISO, and other styles

44

Nguyen, Phi Le, Thanh Hung Nguyen, and Kien Nguyen. "A Path-Length Efficient, Low-Overhead, Load-Balanced Routing Protocol for Maximum Network Lifetime in Wireless Sensor Networks with Holes." Sensors 20, no. 9 (2020): 2506. http://dx.doi.org/10.3390/s20092506.

Full text

Abstract:

In wireless sensor networks (WSNs) with holes, designing efficient routing protocols, which prolong the network lifetime, is one of the most critical issues. To this end, this paper proposes a new geographic routing protocol for WSNs named the load Balanced and constant Stretch protocol for bypassing Multiple Holes (i.e., BSMH). In contrast to the existing works in the literature, the design of BSMH simultaneously takes into account the three factors that impacted the network lifetime, including routing path length, control packet overhead, and load balance among the nodes. Moreover, BSMH aims

APA, Harvard, Vancouver, ISO, and other styles

45

Yao, Yan Xin, and Qiu Shi Liu. "Energy-Balanced Routing Method for Wireless Cooperative Wireless Network." Advanced Materials Research 774-776 (September 2013): 1659–63. http://dx.doi.org/10.4028/www.scientific.net/amr.774-776.1659.

Full text

Abstract:

This paper presents a new method for optimizing energy consumption of wireless network. This new method tries to keep the energy consumption of the whole network while balancing the energy consumption of each node. In particular, we focus on the routing method to shorten the transmission path for reducing the energy path loss. We perform this by introducing an appropriate fitness function with the Genetic Algorithm. This fitness function is designed in a dedicate way so that the energy consumption minimization and energy consumption balance between nodes could be fulfilled simultaneously. Simu

APA, Harvard, Vancouver, ISO, and other styles

46

Rathee, Geetanjali, and Hemraj Saini. "Weight Trusted Routing Mechanism for Hierarchical Mesh Environments." International Journal of Distributed Systems and Technologies 8, no. 3 (2017): 25–42. http://dx.doi.org/10.4018/ijdst.2017070102.

Full text

Abstract:

In this paper, we have proposed a technique to detect and eliminate the malicious/misbehaving nodes involved during routing path formation in hierarchical mesh environments. In this, dijkstra's shortest path routing algorithm is used whose weights are deliberated using certain parameters (i.e. node distance, node's previous interactions, packet loss percentage and trust values of each node) for providing the security against routing attacks. The malicious nodes involved during route discovery process are eliminated by calculating the trust of each node using Social Impact Theory Optimizer (SIT

APA, Harvard, Vancouver, ISO, and other styles

47

Wu, Runze, Haobo Guo, Liangrui Tang, and Bing Fan. "Autonomous Load Regulation Based Energy Balanced Routing in Rechargeable Wireless Sensor Networks." Applied Sciences 9, no. 16 (2019): 3251. http://dx.doi.org/10.3390/app9163251.

Full text

Abstract:

Recent progress in wireless charging technologies has greatly promoted the development of rechargeable wireless sensor networks (RWSN). The network lifetime of RWSN can be commonly extended through routing strategy and wireless charging technology. However, the node accepts the relay request of its neighbor unconditionally, and it cannot remove its overload on its own in a timely manner in traditional routing strategies. The energy balancing efficiency of the network may be limited by this passive mechanism, which poses a great challenge to obtaining optimal joint efficiency of routing and cha

APA, Harvard, Vancouver, ISO, and other styles

48

Liu, Wei Qun, and Xiang Kui Chen. "A Delay-Constrained Multicast Routing Balanced-Optimization Algorithm of Link-Sharing." Applied Mechanics and Materials 152-154 (January 2012): 1834–39. http://dx.doi.org/10.4028/www.scientific.net/amm.152-154.1834.

Full text

Abstract:

In multimedia network, Quality of service (QoS) provisioning generally assumes more than one QoS measure which implies that QoS routing can be categorized as an instance of routing subject to multiple constraints: delay, cost, bandwidth, etc. We study the problem of constructing multicast trees to meet the QoS requirements of real-time applications where it is necessary to provide bounded delays among the source and all destinations while keeping overall cost of the multicast tree low. So the cost and computational complexity are analyzed as constructing delay-constrained multicast tree. So as

APA, Harvard, Vancouver, ISO, and other styles

49

Alharbi, Nouf, Lewis Mackenzie, and Dimitrios Pezaros. "Enhancing Graph Routing Algorithm of Industrial Wireless Sensor Networks Using the Covariance-Matrix Adaptation Evolution Strategy." Sensors 22, no. 19 (2022): 7462. http://dx.doi.org/10.3390/s22197462.

Full text

Abstract:

The emergence of the Industrial Internet of Things (IIoT) has accelerated the adoption of Industrial Wireless Sensor Networks (IWSNs) for numerous applications. Effective communication in such applications requires reduced end-to-end transmission time, balanced energy consumption and increased communication reliability. Graph routing, the main routing method in IWSNs, has a significant impact on achieving effective communication in terms of satisfying these requirements. Graph routing algorithms involve applying the first-path available approach and using path redundancy to transmit data packe

APA, Harvard, Vancouver, ISO, and other styles

50

Kaur, Harpreet, and Amit Grover. "Adaptive Load Balanced Approach for Multi-path Routing in VANETS." International Journal of Computer Applications 147, no. 1 (2016): 26–29. http://dx.doi.org/10.5120/ijca2016910969.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!