To see the other types of publications on this topic, follow the link: Depth based routing.
Journal articles on the topic 'Depth based routing'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Depth based routing.'
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
Andalib, Abdolreza, Fariba Abbasi Nia, Mojtaba Jamshidi, Abdusalam Abdulla Shaltooki, and Mehdi Esnaashari. "ADBR: Accelerated Depth-Based Routing for Underwater Sensor Networks." JITCE (Journal of Information Technology and Computer Engineering) 6, no. 01 (2022): 19–28. http://dx.doi.org/10.25077/jitce.6.01.19-28.2022.
Full textAbstract:
It is challenging to propose an efficient routing algorithm for Underwater Wireless Sensor Networks (UWSNs) in terms of packet delivery ratio, end-to-end delay of packet delivery from the source to the destination, and energy consumption. The reasons of that are UWSNs have unique characteristics (e.g. using acoustic channels instead of radio channels for communications), and they have dynamic topology due to the movement of the sensor by the water flow. Depth-Based Routing (DBR) considers one of the well-known algorithms in this context. DBR is a very simple algorithm; however, it is inefficient in terms of packet delivery rate, end-to-end delay, and energy consumption. This study we developed DBR by adding an accelerated routine to it to improve its efficiency, the proposed algorithm; called Accelerated Depth-Based Routing (ADBR). In ADBR, a simple probabilistic mechanism is used to accelerate packet forwarding and provide more multi-path to the destination. In ADBR, each node immediately delivers received packet to the destination with a probability of and follows the DBR routine with a probability of 1 – Pf. The performance of ADBR is evaluated via a set of experiments by using J-SIM simulator. Experimental results indicate the superiority of the ADBR over the DBR algorithm.
2
Patil, Prasad, and Rinku Shah. "DEPTH-3 ADJACENCY CLUSTER BASED ROUTING PROTOCOL." International Journal of Engineering Sciences & Emerging Technologies 1, no. 2 (2012): 77–82. http://dx.doi.org/10.7323/ijeset/v1_i2_9.
Full text
3
V., Bharathi, Raja P., Meenabavyakarthika S., and Logisvary V. "Itinerary Aware Data Delivery Technique for Underwater Acoustic Sensor Networks." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 2 (2019): 593–97. https://doi.org/10.35940/ijeat.A1889.129219.
Full textAbstract:
Monitoring and maintaining aquatic environment is the universal need and Underwater Acoustic Sensor Networks (UASN) is an emerging technology plays a major role in acoustic data acquistion. The data acquisition is challenging issue in UASN due to its communication characteristics. Though, there are several geo-opportunistic routing protocols were explored to improve the data acquisition it can be still improved by enhanced routing technique. The existing Geo-graphical depth adjustment routing (GEDAR) uses Global Positioning System(GPS) based notes for improving data acquisition, however it consumes more energy and increases overhead. We make an attempt to study about efficient data acquisition process and its path reliability. The proposed Itinerary aware routing protocol(IARP) acquires neighboring node’s information for constructing efficient and reliable link with minimum information which improves data delivery ratio with minimum energy consumption. The proposed IARP increases 11% packet delivery ratio and reduces delay by 13%, and energy consumption by 9% comparing with existing GEDAR based algorithm. IARP also performs better than Depth based routing (DBR).
4
Diao, Boyu, Yongjun Xu, Zhulin An, Fei Wang, and Chao Li. "Improving Both Energy and Time Efficiency of Depth-Based Routing for Underwater Sensor Networks." International Journal of Distributed Sensor Networks 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/781932.
Full textAbstract:
Underwater Sensor Network (UWSN) is a representative three-dimensional wireless sensor network. Due to the unique characteristics of underwater acoustic communication, providing energy-efficient and low-latency routing protocols for UWSNs is challenging. Major challenges are water currents, limited resources, and long acoustic propagation delay. Network topology of UWSNs is dynamic and complex as sensors have always been moving with currents. Some proposed protocols adopt geographic routing to address this problem, but three-dimensional localization is hard to obtain in underwater environment. As depth-based routing protocol (DBR) uses depth information only which is much more easier to obtain, it is more practical for UWSNs. However, depth information is not enough to restrict packets to be forwarded within a particular area. Packets may be forwarded through multiple paths which might cause energy waste and increase end-to-end delay. In this paper, we introduce underwater time of arrival (ToA) ranging technique to address the problem above. To maintain all the original advantages of DBR, we make the following contributions: energy-efficient depth-based routing protocol that reduces redundancy energy cost in some blind zones; low-latency depth-based routing protocol that is able to deliver a packet through an optimal path. The proposed protocols are validated through extensive simulations.
5
Patil, Kishor, Mohsin Jafri, Dieter Fiems, and Andrea Marin. "Stochastic modeling of depth based routing in underwater sensor networks." Ad Hoc Networks 89 (June 2019): 132–41. http://dx.doi.org/10.1016/j.adhoc.2019.03.009.
Full text
6
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 textAbstract:
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 wireless sensor networks (APCDBRP). The protocol consists of two phases: (1) the route establishment phase and (2) the data transmission phase. In the route establishment phase, the initial path is established by the sink node broadcasting beacon packets at the maximum transmission power. The receiving nodes update their routing tables based on the beacon information and forward the beacon packets. In the data transmission phase, APCDBRP introduces a novel forwarding factor that considers both energy efficiency and energy balance. It selects the optimal next hop based on high energy efficiency and relatively abundant energy, thus extending the network’s lifetime. Additionally, APCDBRP proposes a new data protection and route reconstruction mechanism to address issues such as network topology changes due to node mobility and data transmission failures. Our simulation is based on AquaSim–Next Generation, which is a specialized tool built on the NS3 platform for researching underwater networks. Simulation results demonstrate that, compared to other typical routing protocols, APCDBRP exhibits superior performance in reducing network energy consumption and extending the network’s lifetime. It also achieves a high packet delivery rate with lower energy consumption.
7
Lilhore, Umesh Kumar, Osamah Ibrahim Khalaf, Sarita Simaiya, et al. "A depth-controlled and energy-efficient routing protocol for underwater wireless sensor networks." International Journal of Distributed Sensor Networks 18, no. 9 (2022): 155013292211171. http://dx.doi.org/10.1177/15501329221117118.
Full textAbstract:
Underwater wireless sensor network attracted massive attention from researchers. In underwater wireless sensor network, many sensor nodes are distributed at different depths in the sea. Due to its complex nature, updating their location or adding new devices is pretty challenging. Due to the constraints on energy storage of underwater wireless sensor network end devices and the complexity of repairing or recharging the device underwater, this is highly significant to strengthen the energy performance of underwater wireless sensor network. An imbalance in power consumption can cause poor performance and a limited network lifetime. To overcome these issues, we propose a depth controlled with energy-balanced routing protocol, which will be able to adjust the depth of lower energy nodes and be able to swap the lower energy nodes with higher energy nodes to ensure consistent energy utilization. The proposed energy-efficient routing protocol is based on an enhanced genetic algorithm and data fusion technique. In the proposed energy-efficient routing protocol, an existing genetic algorithm is enhanced by adding an encoding strategy, a crossover procedure, and an improved mutation operation that helps determine the nodes. The proposed model also utilized an enhanced back propagation neural network for data fusion operation, which is based on multi-hop system and also operates a highly optimized momentum technique, which helps to choose only optimum energy nodes and avoid duplicate selections that help to improve the overall energy and further reduce the quantity of data transmission. In the proposed energy-efficient routing protocol, an enhanced cluster head node is used to select a strategy that can analyze the remaining energy and directions of each participating node. In the simulation, the proposed model achieves 86.7% packet delivery ratio, 12.6% energy consumption, and 10.5% packet drop ratio over existing depth-based routing and energy-efficient depth-based routing methods for underwater wireless sensor network.
8
Natesan, Sathish Kumar, and Raja Kumar Krishnan. "Fuzzy Logic Depth Based Energy Aware Routing Protocol for Underwater Acoustic Sensor Network: FLDEAR." Journal of Information & Knowledge Management 20, Supp01 (2021): 2140002. http://dx.doi.org/10.1142/s0219649221400025.
Full textAbstract:
The Underwater Acoustic Sensor Network (UASN) plays a dynamic role in various application extents like surveillance, military, terrestrial networks and industrial application. In UASN, each Underwater Sensor Node (USN) is deployed in many places. The multiple paths are always used for transmitting data from USN to the Sink Node (SN). Each sensor constitutes a set of small devices and a small battery. If data is received from multiple nodes at the same time then, there is a chance for a collision and also it will bring down network lifetime. In recent years, only a few research works are done in fuzzy based routing in UASN. For increasing the network’s lifetime, there is always a need for an optimum routing path in UASN with improved parameters related to propagation delay, energy and throughput. The present paper proposes the Fuzzy Logic Depth based Energy-Aware Routing (FLDEAR) path in UASN. A static USN was utilized in the proposed system. Each USN is assigned a Priority Number (PN) by the SN. The PN is used for avoiding collision in the proposed model. The simulation is conducted employing Aqua-Sim (AS) which is based on Network Simulator-2(NS2). The simulation results illustrate that this system outperforms the existing routing protocol such as protocols of Energy Efficient Cooperative Opportunistic Routing (EECOR), Fuzzy Depth Based Routing (FDBR) and Depth Based Routing (DBR) in terms of improved parameters related to energy, propagation delay and throughput. Finally, the lifetime of UASN is improved by 70–80% by the implementation of the proposed FLDEAR protocol.
9
Sher, Arshad, Nadeem Javaid, Irfan Azam, et al. "Monitoring square and circular fields with sensors using energy-efficient cluster-based routing for underwater wireless sensor networks." International Journal of Distributed Sensor Networks 13, no. 7 (2017): 155014771771718. http://dx.doi.org/10.1177/1550147717717189.
Full textAbstract:
In this article, to monitor the fields with square and circular geometries, three energy-efficient routing protocols are proposed for underwater wireless sensor networks. First one is sparsity-aware energy-efficient clustering, second one is circular sparsity-aware energy-efficient clustering, and the third one is circular depth–based sparsity-aware energy-efficient clustering routing protocol. All three protocols are proposed to minimize the energy consumption of sparse regions, whereas sparsity search algorithm is proposed to find sparse regions and density search algorithm is used to find dense regions of the network field. Moreover, clustering is performed in dense regions to minimize redundant transmissions of a data packet, while sink mobility is exploited to collect data from sensor nodes with an objective of minimum energy consumption. A depth threshold [Formula: see text] value is also used to minimize number of hops between source and destination for less energy consumption. Simulation results show that our schemes perform better than their counter-part schemes (depth-based routing and energy-efficient depth-based routing) in terms of energy efficiency.
10
Shahid Rahim, Saqib, Sheeraz Ahmed, Fazle Hadi, Ayub Khan, M. Usman Akhtar, and Lailma Javed. "Depth-based Adaptive and Energy-aware (DAE) Routing Scheme for UWSNs." EAI Endorsed Transactions on Energy Web 5, no. 17 (2018): 154449. http://dx.doi.org/10.4108/eai.10-4-2018.154449.
Full text
11
Khan, M. Nouman, Zahid Wadud, Aisha Khalid, Sheeraz Ahmed, Nadeem Javaid, and Abdul Hafeez. "EH-DBR: Energy Harvesting Depth Based Routing for Underwater Sensor Networks." EAI Endorsed Transactions on Energy Web 5, no. 17 (2018): 154451. http://dx.doi.org/10.4108/eai.10-4-2018.154451.
Full text
12
Arzani Galea Noy, Mohsen, and Saheb Aghajeri. "Routing based on maximizing Output in underwater sensor networks." Journal of Research in Science, Engineering and Technology 5, no. 02 (2019): 14–29. http://dx.doi.org/10.24200/jrset.vol5iss02pp14-29.
Full textAbstract:
In this study we want to optimize routing in underwater sensor networks through considering the spatial distribution of network's sensor nodes and their energy consumption limitation such that the overload of layer routing protocol (including the number of message passing specified to routing operation and waiting time for upper layers) on network output will be decrease, The main feature of this study is simultaneously considering the model of underwater channel, geometric distribution of network and transaction of network layer and MAC sub layer is solving routing problem. In this study we present a routing mathematical model with the capacity of sink movement in wireless sensor networks. We introduce an algorithm to compute the DS in certain modeled networks as a graph. Through simulation, presented design will be evaluated and investigated ,Our presented design is Depth and Energy Aware Dominating Set based Algorithm (DEADS) ( an algorithm based on depth and energy) . In this study we applied MATLAB software for simulation. Finally we conclude that the durability and the trend of active nodes in each period of our presented design is better suggesting that the applicability and capacity of our plan was improved, Also the energy consumption of our design is as a result of more transfer number. Also, head-to-head delay is lower and partially it is followed from the same paradigm.
13
Khasawneh, Ahmad M., Omprakash Kaiwartya, Jaime Lloret, et al. "Green Communication for Underwater Wireless Sensor Networks: Triangle Metric Based Multi-Layered Routing Protocol." Sensors 20, no. 24 (2020): 7278. http://dx.doi.org/10.3390/s20247278.
Full textAbstract:
In this paper, we propose a non-localization routing protocol for underwater wireless sensor networks (UWSNs), namely, the triangle metric based multi-layered routing protocol (TM2RP). The main idea of the proposed TM2RP is to utilize supernodes along with depth information and residual energy to balance the energy consumption between sensors. Moreover, TM2RP is the first multi-layered and multi-metric pressure routing protocol that considers link quality with residual energy to improve the selection of next forwarding nodes with more reliable and energy-efficient links. The aqua-sim package based on the ns-2 simulator was used to evaluate the performance of the proposed TM2RP. The obtained results were compared to other similar methods such as depth based routing (DBR) and multi-layered routing protocol (MRP). Simulation results showed that the proposed protocol (TM2RP) obtained better outcomes in terms of energy consumption, network lifetime, packet delivery ratio, and end-to-end delay.
14
Dou, Zhengxiong, Xiaonan Wang, and Yanli Li. "Anycast-Tree Addressing-Based Routing for 6LoWPAN." International Journal of Interdisciplinary Telecommunications and Networking 10, no. 4 (2018): 1–25. http://dx.doi.org/10.4018/ijitn.2018100101.
Full textAbstract:
This article proposes an anycast-tree addressing-based routing scheme for 6LoWPAN. In this scheme, multiple gateways are introduced to 6LoWPAN and divide 6LoWPAN into multiple tree topologies. Anycast is used to construct a tree topology which is called an anycast tree and where a gateway works as a root. A node joins the anycast tree identified by the nearest gateway to acquire a unique address, and achieves communications with the Internet via the nearest gateway. Anycast trees are distributed around 6LoWPAN, so the depth of an anycast tree is substantially shortened and the routing path and latency are also reduced. Moreover, if a gateway fails, its descendants can communicate with the Internet via the nearest active gateway and update their addresses instead of reacquiring new addresses. The performance parameters of this scheme are evaluated, and the data results show that this scheme effectively shortens the routing latency.
15
Chen, Yi Xian. "Cross-Layer Routing Protocol Based on AODV in Cognitive Radio." Applied Mechanics and Materials 443 (October 2013): 388–91. http://dx.doi.org/10.4028/www.scientific.net/amm.443.388.
Full textAbstract:
With the rapid development of science and technology, the current spectrum resources cannot simply cope with the high-load wireless networks cross-layer transmission. This thesis is based on the in-depth analysis of cognitive radio technology to understand the routing protocol in wireless cross-layer data transmission, and then discuss the relevant characteristics of the AODV routing protocol, and base on the AODV, the routing protocol uses in the analysis of the radio network organization based on the proposed to the possibility of cross-layer cognitive radio.
16
Patil, Hemavathi, and Vishwanath Tegampure. "Examining Cluster-Based Scenarios in Wireless Sensor Network." Journal of Network Security Computer Networks 11, no. 1 (2025): 1–8. https://doi.org/10.46610/jonscn.2025.v11i01.001.
Full textAbstract:
Energy consumption optimization remains a critical challenge in Wireless Sensor Networks (WSNs), especially in situations where node energy cannot be replenished. Optimal routing strategies are paramount in managing energy utilization, emphasizing the significance of routing methods in WSNs that are energy-efficient. This paper delves into the nuances of energy-efficient routing protocols characterized into four innovative schemes: (i) Topology-Based Model (ii) Communication Model, and (iii) Network Structure. Notably, the Network Structure category is explored in-depth, distinguishing between flat and cluster-based approaches, and (iv) Reliable Routing. This work specifically hones in on the advancements within the cluster-based routing protocols, renowned for their prowess in energy consumption reduction within WSNs. The study conducts a comprehensive review and analysis, focusing on key performance indicators including clustering strategy, data delivery delay, scalability, energy efficiency, and algorithm complexity.
17
Parane, Khyamling, B. M. Prabhu Prasad, and Basavaraj Talawar. "YaNoC: Yet Another Network-on-Chip Simulation Acceleration Engine Supporting Congestion-Aware Adaptive Routing Using FPGAs." Journal of Circuits, Systems and Computers 28, no. 12 (2019): 1950202. http://dx.doi.org/10.1142/s0218126619502025.
Full textAbstract:
Many-core systems employ the Network on Chip (NoC) as the underlying communication architecture. To achieve an optimized design for an application under consideration, there is a need for fast and flexible NoC simulator. This paper presents an FPGA-based NoC simulation acceleration framework supporting design space exploration of standard and custom NoC topologies considering a full set of microarchitectural parameters. The framework is capable of designing custom routing algorithms, various traffic patterns such as uniform random, transpose, bit complement and random permutation are supported. For conventional NoCs, the standard minimal routing algorithms are supported. For designing the custom topologies, the table-based routing has been implemented. A custom topology called diagonal mesh has been evaluated using table-based and novel shortest path routing algorithm. A congestion-aware adaptive routing has been proposed to route the packets along the minimally congested path. The congestion-aware adaptive routing algorithm has negligible FPGA area overhead compared to the conventional XY routing. Employing the congestion-aware adaptive routing, network latency is reduced by 55% compared to the XY routing algorithm. The microarchitectural parameters such as buffer depth, traffic pattern and flit width have been varied to observe the effect on NoC behavior. For the [Formula: see text] mesh topology, the LUT and FF usages will be increased from 32.23% to 34.45% and from 12.62% to 15% considering the buffer depth of 4 and flit widths of 16 bits, and 32 bits, respectively. Similar behavior has been observed for other configurations of buffer depth and flit width. The torus topology consumes 24% more resources than the mesh topology. The 56-node fat tree topology consumes 27% and 2.2% more FPGA resources than the [Formula: see text] mesh and torus topologies. The 56-node fat tree topology with buffer depth of 8 and 16 flits saturates at the injection rates of 40% and 45%, respectively.
18
Gupta, C. P., Chaitanya Kumar Karn, and R. K. Banyal. "Delay minimising depth-based routing for multi-sink underwater wireless sensor networks." International Journal of Sensor Networks 27, no. 2 (2018): 85. http://dx.doi.org/10.1504/ijsnet.2018.092627.
Full text
19
Gupta, C. P., R. K. Banyal, and Chaitanya Kumar Karn. "Delay minimising depth-based routing for multi-sink underwater wireless sensor networks." International Journal of Sensor Networks 27, no. 2 (2018): 85. http://dx.doi.org/10.1504/ijsnet.2018.10014015.
Full text
20
Ahmed, Sheeraz, Nadeem Javaid, Ashfaq Ahmad, et al. "SPARCO: Stochastic Performance Analysis with Reliability and Cooperation for Underwater Wireless Sensor Networks." Journal of Sensors 2016 (2016): 1–17. http://dx.doi.org/10.1155/2016/7604163.
Full textAbstract:
Reliability is a key factor for application-oriented Underwater Sensor Networks (UWSNs) which are utilized for gaining certain objectives and a demand always exists for efficient data routing mechanisms. Cooperative routing is a promising technique which utilizes the broadcast feature of wireless medium and forwards data with cooperation using sensor nodes as relays. Here, we present a cooperation-based routing protocol for underwater networks to enhance their performance called Stochastic Performance Analysis with Reliability and Cooperation (SPARCO). Cooperative communication is explored in order to design an energy-efficient routing scheme for UWSNs. Each node of the network is assumed to be consisting of a single omnidirectional antenna and multiple nodes cooperatively forward their transmissions taking advantage of spatial diversity to reduce energy consumption. Both multihop and single-hop schemes are exploited which contribute to lowering of path-losses present in the channels connecting nodes and forwarding of data. Simulations demonstrate that SPARCO protocol functions better regarding end-to-end delay, network lifetime, and energy consumption comparative to noncooperative routing protocol—improved Adaptive Mobility of Courier nodes in Threshold-optimized Depth-based routing (iAMCTD). The performance is also compared with three cooperation-based routing protocols for UWSN: Cognitive Cooperation (Cog-Coop), Cooperative Depth-Based Routing (CoDBR), and Cooperative Partner Node Selection Criteria for Cooperative Routing (Coop Re and dth).
21
Daniel, Alberto Priano, Sergio Bruschetti Fabio, Claudia Abeledo María, and . Guevara Javier. "EXPLORING ROUTING AND QUALITY OF SERVICE IN SOFTWARE-DEFINED NETWORKS: INTERACTIONS WITH LEGACY SYSTEMS AND FLOW MANAGEMENT." Engineering and Technology Journal 8, no. 08 (2023): 2540–55. https://doi.org/10.5281/zenodo.8211287.
Full textAbstract:
The following article presents the most important aspects of routing technologies and the QoS (Quality of Service) of the SDN architecture. The interaction of SDN with traditional or legacy networks is discussed in depth and concepts related to flow management are developed. Additionally, the analysis of the Open Flow protocol is included.
22
Lu, Yongjie, Rongxi He, Xiaojing Chen, Bin Lin, and Cunqian Yu. "Energy-Efficient Depth-Based Opportunistic Routing with Q-Learning for Underwater Wireless Sensor Networks." Sensors 20, no. 4 (2020): 1025. http://dx.doi.org/10.3390/s20041025.
Full textAbstract:
Underwater Wireless Sensor Networks (UWSNs) have aroused increasing interest of many researchers in industry, military, commerce and academe recently. Due to the harsh underwater environment, energy efficiency is a significant theme should be considered for routing in UWSNs. Underwater positioning is also a particularly tricky task since the high attenuation of radio-frequency signals in UWSNs. In this paper, we propose an energy-efficient depth-based opportunistic routing algorithm with Q-learning (EDORQ) for UWSNs to guarantee the energy-saving and reliable data transmission. It combines the respective advantages of Q-learning technique and opportunistic routing (OR) algorithm without the full-dimensional location information to improve the network performance in terms of energy consumption, average network overhead and packet delivery ratio. In EDORQ, the void detection factor, residual energy and depth information of candidate nodes are jointly considered when defining the Q-value function, which contributes to proactively detecting void nodes in advance, meanwhile, reducing energy consumption. In addition, a simple and scalable void node recovery mode is proposed for the selection of candidate set so as to rescue packets that are stuck in void nodes unfortunately. Furthermore, we design a novel method to set the holding time for the schedule of packet forwarding base on Q-value so as to alleviate the packet collision and redundant transmission. We conduct extensive simulations to evaluate the performance of our proposed algorithm and compare it with other three routing algorithms on Aqua-sim platform (NS2). The results show that the proposed algorithm significantly improve the performance in terms of energy efficiency, packet delivery ratio and average network overhead without sacrificing too much average packet delay.
23
Chen, Xiao Yun, Yu Kai Yao, Guo Hua Liu, and Long Jie Li. "An Effective Strategy to Defense Black Hole Attack Based on AODV Routing Protocol." Applied Mechanics and Materials 40-41 (November 2010): 457–61. http://dx.doi.org/10.4028/www.scientific.net/amm.40-41.457.
Full textAbstract:
Mobile Ad hoc Network (MANET) has attracted lots of research efforts these years, mainly due to its appealing applications in no infrastructure situations such as battle fields and disaster recovery operations [1]. In this paper, we explore wireless Ad Hoc network focusing on its Routing Protocol AODV, we in depth analyze its operation principles and the problems exist in AODV routing protocol. AODV routing protocol is vulnerable, it is always exposed to many attacks, such as DoS, black hole, etc. [2] Through exhaustive researching the behaviors of black hole attack in NS2 simulation platform, and we finally propose a new routing security strategy to defense the black hole attack in AODV. Simulation results show that the strategy we proposed can not only effectively defense the black hole nodes, but also has better routing performance for moderate or small scale Ad Hoc Networks.
24
Zhang, Yi, Lanxin Qiu, Yangzhou Xu, et al. "Multi-Path Routing Algorithm Based on Deep Reinforcement Learning for SDN." Applied Sciences 13, no. 22 (2023): 12520. http://dx.doi.org/10.3390/app132212520.
Full textAbstract:
Software-Defined Networking (SDN) enhances network control but faces Distributed Denial of Service (DDoS) attacks due to centralized control and flow-table constraints in network devices. To overcome this limitation, we introduce a multi-path routing algorithm for SDN called Trust-Based Proximal Policy Optimization (TBPPO). TBPPO incorporates a Kullback–Leibler divergence (KL divergence) trust value and a node diversity mechanism as the security assessment criterion, aiming to mitigate issues such as network fluctuations, low robustness, and congestion, with a particular emphasis on countering DDoS attacks. To avoid routing loops, differently from conventional ‘Next Hop’ routing decision methodology, we implemented an enhanced Depth-First Search (DFS) approach involving the pre-computation of path sets, from which we select the best path. To optimize the routing efficiency, we introduced an improved Proximal Policy Optimization (PPO) algorithm based on deep reinforcement learning. This enhanced PPO algorithm focuses on optimizing multi-path routing, considering security, network delay, and variations in multi-path delays. The TBPPO outperforms traditional methods in the Germany-50 evaluation, reducing average delay by 20%, cutting delay variation by 50%, and leading in trust value by 0.5, improving security and routing efficiency in SDN. TBPPO provides a practical and effective solution to enhance SDN security and routing efficiency.
25
Li, Meiju, Xiujuan Du, Xin Liu, and Chong Li. "Shortest Path Routing Protocol Based on the Vertical Angle for Underwater Acoustic Networks." Journal of Sensors 2019 (July 4, 2019): 1–14. http://dx.doi.org/10.1155/2019/9145675.
Full textAbstract:
Underwater Acoustic Networks (UANs) use acoustic communication. UANs are characterized by narrow bandwidth, long delay, limited energy, high bit error rate, and dynamic network topology. Therefore, UANs call for energy-efficient and latency-minimized routing protocol. In this paper, the shortest path routing protocol based on the vertical angle (SPRVA) is proposed. In SPRVA, the forwarding node determines the best next-hop according to main priority. When the main priorities of candidate nodes are the same, the alternative priority is used. The main priority is denoted by the residual energy and angle between propagation direction and depth direction, and the alternative priority is indicated by the link quality. SPRVA selects the node along the depth direction with more residual energy and better link quality as the best next-hop. In addition, a recovery algorithm is designed to avoid nodes in void areas as forwarding nodes. Simulation results show that SPRVA improves energy efficiency and decreases end-to-end communication delay.
26
Saliu, Mohammed Shaba, Muyideen Omuya Momoh, Pascal Uchenna Chinedu, Wilson Nwankwo, and Aliu Daniel. "Comparative Performance Analysis of Selected Routing Algorithms by Load Variation of 2-Dimensional Mesh Topology Based Network-On-Chip." ELEKTRIKA- Journal of Electrical Engineering 20, no. 3 (2021): 1–6. http://dx.doi.org/10.11113/elektrika.v20n3.249.
Full textAbstract:
Network-on-Chip (NoC) has been proposed as a viable solution to the communication challenges on System-on-Chips (SoCs). As the communication paradigm of SoC, NoCs performance depends mainly on the type of routing algorithm chosen. In this paper different categories of routing algorithms were compared. These include XY routing, OE turn model adaptive routing, DyAD routing and Age-Aware adaptive routing. By varying the load at different Packet Injection Rate (PIR) under random traffic pattern, comparison was conducted using a 4 × 4 mesh topology. The Noxim simulator, a cycle accurate systemC based simulator was employed. The packets were modeled as a Poisson distribution; first-in-first-out (FIFO) input buffer channel with a depth of five (5) flits and a flit size of 32 bits; and a packet size of 3 flits respectively. The simulation time was 10,000 cycles. The findings showed that the XY routing algorithm performed better when the PIR is low. In a similar vein, the DyAD routing and Age-aware algorithms performed better when the load i.e. PIR is high.
27
Zradgui, Hamza, and Khalil Ibrahimi. "BDREA Betta and Dolphin Pods Routing via Energy Scarcity Aware Protocol for Underwater Acoustic Wireless Sensor Networks (UAWSNs)." Acoustics 4, no. 3 (2022): 656–78. http://dx.doi.org/10.3390/acoustics4030040.
Full textAbstract:
There exist numerous applications for deploying Underwater Wireless Sensor Networks (UWSNs), including submarine detection, disaster prevention, oil and gas monitoring, off-shore exploration, and military target tracking. The acoustic sensor nodes are deployed to monitor the underwater environment, considering the area under observation. This research work proposes an energy scarcity-aware routing protocol for energy efficient UWSNs. Moreover, it aims to find the feasible region on the basis of the objective function, in order to minimize the energy tax and extend the network life. There are three different sensors nodes in the network environment, i.e., anchor nodes, relay nodes, and the centralized station. Anchor nodes originate data packets, while relay nodes process them and broadcast between each other until the packets reach the centralized station. The underline base scheme Weighting Depth and Forwarding Area Division Depth-Based Routing (WDFAD-DBR) for routing is based on the depth differences of the first- and second-hop nodes of the source node. The propose work, Betta and Dolphin Pods Routing via Energy Scarcity Aware protocol (BDREA) for packet forwarding from the forwarding nodes considers the first and second hops of the source node, i.e., the packet advancement, the network traffic, the distance to the centralized station, and the inverse normalized energy of the forwarding zone. It is observed that the proposed work improves the performance parameters by approximately 50% in terms of energy efficiency, and prolongs the network life compared to Dolphin and Whale Pod (DOW-PR) protocols. Furthermore, the energy efficiency directly relates to the other parameters, and its enhancement can be seen in terms of an 18.02% reduction in end-to-end delay when compared with the Weighting Depth and Forwarding Area Division Depth-Based Routing (WDFAD-DBR) protocol. Furthermore, BDREA improves the Packet Delivery Ratio (PDR) by approximately 8.71%, compared to DOW-PR, and by 10% compared with the benchmark, WDFAD-DBR, the energy tax by 50% in comparison to DOW-PR, the end-to-end delay by 18%, and the APD by 5% in comparison to WDFAD-DBR.
28
A., Giorgetti, Sgambelluri A., Paolucci F., Cugini F., and Castoldi P. "Segment routing for effective recovery and multi-domain traffic engineering." IEEE/OSA Journal of Optical Communications and Networking 9, no. 2 (2017): A223 — A232. https://doi.org/10.1364/JOCN.9.00A223.
Full textAbstract:
Segment routing is an emerging traffic engineering technique relying on Multi-protocol Label-Switched (MPLS) label stacking to steer traffic using the source-routing paradigm. Traffic flows are enforced through a given path by applying a specifically designed stack of labels (i.e., the segment list). Each packet is then forwarded along the shortest path toward the network element represented by the top label. Unlike traditional MPLS networks, segment routing maintains a per-flow state only at the ingress node; no signaling protocol is required to establish new flows or change the routing of active flows. Thus, control plane scalability is greatly improved. Several segment routing use cases have recently been proposed. As an example, it can be effectively used to dynamically steer traffic flows on paths characterized by low latency values. However, this may suffer from some potential issues. Indeed, deployed MPLS equipment typically supports a limited number of stacked labels. Therefore, it is important to define the proper procedures to minimize the required segment list depth. This work is focused on two relevant segment routing use cases: dynamic traffic recovery and traffic engineering in multi-domain networks. Indeed, in both use cases, the utilization of segment routing can significantly simplify the network operation with respect to traditional Internet Protocol (IP)/MPLS procedures. Thus, two original procedures based on segment routing are proposed for the aforementioned use cases. Both procedures are evaluated including a simulative analysis of the segment list depth. Moreover, an experimental demonstration is performed in a multi-layer test bed exploiting a software-defined-networking-based implementation of segment routing.
29
Shi, Lan, Qing Feng Hou, and Jian Hui Lv. "An Improved Routing Node Selection Algorithm Based on Trust Evaluation." Applied Mechanics and Materials 644-650 (September 2014): 1961–64. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.1961.
Full textAbstract:
With further consideration of factors that affect the value of the indirect trust, and depth analysis by statistical principles, we proposed a new trust value estimation model. On basis of this model, the method of cluster nodes election has been studied to design a rout decision-making algorithm which combined trust value, density, distance between nodes and forwarding capabilities. Experimental results show that the trust value assessment model built on trust value calculation is very reliable with increasing cycle times, trust value gradually moving to 1. The improved algorithm has faster convergence than algorithms in [5] and [6]. In information transfer process, when the routing nodes are within a certain range, and the algorithm is also more stable. When the network topology changes, the algorithm can be re-routed quickly, indicating that the algorithm has a wide range of applications.
30
Cimorelli, Luigi, Luca Cozzolino, Andrea D'Aniello, and Domenico Pianese. "Exact solution of the Linear Parabolic Approximation for flow-depth based diffusive flow routing." Journal of Hydrology 563 (August 2018): 620–32. http://dx.doi.org/10.1016/j.jhydrol.2018.06.026.
Full text
31
Zhang, Meiyan, and Wenyu Cai. "Energy-Efficient Depth Based Probabilistic Routing Within 2-Hop Neighborhood for Underwater Sensor Networks." IEEE Sensors Letters 4, no. 6 (2020): 1–4. http://dx.doi.org/10.1109/lsens.2020.2995236.
Full text
32
Yang, Xinduoji, Minghui Liu, Xinxin Wang, Bingyu Hu, Meng Liu, and Xiaomin Wang. "Ship Network Traffic Engineering Based on Reinforcement Learning." Electronics 13, no. 9 (2024): 1710. http://dx.doi.org/10.3390/electronics13091710.
Full textAbstract:
This research addresses multiple challenges faced by ship networks, including limited bandwidth, unstable network connections, high latency, and command priority. To solve these problems, we used reinforcement learning-based methods to simulate traffic engineering in ship networks. We focused on three aspects—traffic balance, instruction priority, and complex network structure—to evaluate reinforcement learning performance in these scenarios. Performance: We developed a reinforcement learning framework for ship network traffic engineering that treats the routing policy as the state and the network state as the environment. The agent generates routing changes and uses actions to optimize traffic services. The experimental results show that reinforcement learning optimizes network traffic balance, reasonably arranges instruction priorities, and copes with complex network structures, greatly improving the network’s quality of service (QoS). Through an in-depth analysis of the experimental data, we noticed that network consumption was reduced by 9.1% under reinforcement learning. Reinforcement learning effectively implemented priority routing of high-priority instructions while reducing the occupancy rate of the edge with the highest occupancy rate in the network by 18.53%.
33
Yassine, Sembati, Naja Najib, and Jamali Abdellah. "Named Multipath Depth-First Search: An SDN-based Routing Strategy for Efficient Failure Handling and Content Delivery in NDN." International Journal of Communication Networks and Information Security (IJCNIS) 15, no. 4 (2023): 17–29. http://dx.doi.org/10.17762/ijcnis.v15i4.6293.
Full textAbstract:
Information-centric networking (ICN) architectures, such as named data networking (NDN), have emerged as potential solutions for efficiently retrieving and delivering content. However, challenges remain regarding routing scalability, resilience, and caching efficiency. Software-defined networking (SDN) offers opportunities to optimize NDN implementations through centralized control and programmability. In this paper, we propose Named Multipath DFS, an SDN-based routing and caching scheme for NDN networks. NMDFS leverages a centralized controller to pre-compute multipath routes and implement coordinated caching. We evaluate NMDFS on an emulated topology testbed against default NDN and Named-data link state routing. The results demonstrate significant improvements with NMDFS, reducing overhead signalling costs by 94% and 78%, respectively, compared with other schemes. Round-trip latencies for content retrieval were reduced by up to 98%. The SDN controller’s global network view and control are leveraged to optimize content caching through packet loss-driven adaptation and eliminate redundant messaging, leading to substantial performance gains.
34
Dong, Shanshan, Zhijun Tang, and Haowei Ma. "A Review Of Routing Protocols For FANET." IOSR Journal of Electronics and Communication Engineering 19, no. 6 (2024): 06–22. http://dx.doi.org/10.9790/2834-1906010622.
Full textAbstract:
With the continuous development of radio and aviation technology, the research on Flying Ad-hoc Networks (FANET) has become the hotspot. FANET is a distributed network composed of multiple Unmanned Aerial Vehicles (UAVs) in a self-organized form, which has great potential for application in both military and civil fields. Different application scenarios have different requirements for FANET channel resource allocation. To facilitate future in-depth research on FANET, a comprehensive investigation into FANET routing protocols and related knowledge was conducted. Firstly, common mobility models and routing techniques in routing protocols are introduced. Then, FANET routing protocols are reviewed and analyzed based on existing knowledge of routing protocols. Routing protocols are classified into five categories, and each discussed routing algorithm is introduced in detail from the perspectives of principles, strengths and weaknesses, and applicability scenarios. Finally, the problems and current status of optimization of OLSR routing protocols are discussed.
35
Effah, Emmanuel, Ousmane Thiare, and Alexander M. Wyglinski. "A Tutorial on Agricultural IoT: Fundamental Concepts, Architectures, Routing, and Optimization." IoT 4, no. 3 (2023): 265–318. http://dx.doi.org/10.3390/iot4030014.
Full textAbstract:
This paper presents an in-depth contextualized tutorial on Agricultural IoT (Agri-IoT), covering the fundamental concepts, assessment of routing architectures and protocols, and performance optimization techniques via a systematic survey and synthesis of the related literature. The negative impacts of climate change and the increasing global population on food security and unemployment threats have motivated the adoption of the wireless sensor network (WSN)-based Agri-IoT as an indispensable underlying technology in precision agriculture and greenhouses to improve food production capacities and quality. However, most related Agri-IoT testbed solutions have failed to achieve their performance expectations due to the lack of an in-depth and contextualized reference tutorial that provides a holistic overview of communication technologies, routing architectures, and performance optimization modalities based on users’ expectations. Thus, although IoT applications are founded on a common idea, each use case (e.g., Agri-IoT) varies based on the specific performance and user expectations as well as technological, architectural, and deployment requirements. Likewise, the agricultural setting is a unique and hostile area where conventional IoT technologies do not apply, hence the need for this tutorial. Consequently, this tutorial addresses these via the following contributions: (1) a systematic overview of the fundamental concepts, technologies, and architectural standards of WSN-based Agri-IoT, (2) an evaluation of the technical design requirements of a robust, location-independent, and affordable Agri-IoT, (3) a comprehensive survey of the benchmarking fault-tolerance techniques, communication standards, routing and medium access control (MAC) protocols, and WSN-based Agri-IoT testbed solutions, and (4) an in-depth case study on how to design a self-healing, energy-efficient, affordable, adaptive, stable, autonomous, and cluster-based WSN-specific Agri-IoT from a proposed taxonomy of multi-objective optimization (MOO) metrics that can guarantee an optimized network performance. Furthermore, this tutorial established new taxonomies of faults, architectural layers, and MOO metrics for cluster-based Agri-IoT (CA-IoT) networks and a three-tier objective framework with remedial measures for designing an efficient associated supervisory protocol for cluster-based Agri-IoT networks.
36
Rajini, S., and M. Ramakrishna. "Analysis of CoDBR and CEEDBR Protocols in Underwater Wireless Sensor Networks." BOHR International Journal of Computational Intelligence and Communication Network 1, no. 1 (2022): 35–42. http://dx.doi.org/10.54646/bijcicn.006.
Full textAbstract:
UWSNs (underwater wireless sensor networks) are essential for doing any type of task underwater. Huge broadcast lag, great error degree, small bandwidth, and restricted energy in Underwater Sensor Networks interest concentration of utmost investigators. In UWSNs, the efficient use of energy is one of the main problems, as the substitution of energy sources in this kind of location is extremely costly. UWSNs are utilized in many fields, like measuring pollution, issuing tsunami cautions, conducting offshore surveys, and strategic tracing. For numerous functions, the efficacy and dependability of network regarding prominent operation, energy preservation, small bit error rate, and decreased interruption are fundamental. Nevertheless, UWSN’s exclusive features like small bandwidth accessibility, large interruptions in broadcast, very vivacious network topology, and extreme possibility of error present numerous problems in the growth of effective and dependable communication procedures. As opposed to current deepness-based routing techniques, we are focusing on CoDBR (Cooperative Depth-based Routing) and CEEDBR (Cooperative Energy Efficient Depth-based Routing) procedures to improve network lifespan, energy efficacy, and amount.
37
Zhang, Ling, and Ziyun Ni. "A quality of system routing based on neighborhood interference detection and mitigation in wireless sensor network." International Journal of Distributed Sensor Networks 16, no. 10 (2020): 155014772096846. http://dx.doi.org/10.1177/1550147720968462.
Full textAbstract:
The current quality of system routing available in wireless sensor network mainly provides assurance for traffic flow, with little consideration on full use of network resource, like bandwidth. Aiming at solving these problems, this article proposes a quality of system routing method based on neighborhood interference detection and mitigation. First, the algorithm uses a sink node as root node to establish a minimum spanning tree for the network to obtain the depth of each node. Then, each node dynamically updates its interference degree by contiguous iterations during neighboring nodes communication. Finally, the interference degree, packet level, residual energy, and node depth are combined to establish a multipath route to enhance the network bandwidth and thus improve the quality of system. Experimental results show that the algorithm can not only effectively balance the network load but also reduce the network packet delay and improve the network throughput. It also has a good network lifetime; thus, it can effectively improve the quality of system of wireless sensor network.
38
Wahid, Abdul, and Dongkyun Kim. "An Energy Efficient Localization-Free Routing Protocol for Underwater Wireless Sensor Networks." International Journal of Distributed Sensor Networks 8, no. 4 (2012): 307246. http://dx.doi.org/10.1155/2012/307246.
Full textAbstract:
Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention from both academia and industry, in order to explore the vast underwater environment. UWSNs have peculiar characteristics; that is, they have large propagation delay, high error rate, low bandwidth, and limited energy. Therefore, designing network/routing protocols for UWSNs is very challenging. Also, in UWSNs, improving the energy efficiency is one of the most important issues since the replacement of the batteries of underwater sensor nodes is very expensive due to the unpleasant underwater environment. In this paper, we therefore propose an energy efficient routing protocol, named (energy-efficient depth-based routing protocol) EEDBR for UWSNs. EEDBR utilizes the depth of sensor nodes for forwarding data packets. Furthermore, the residual energy of sensor nodes is also taken into account in order to improve the network lifetime. Based on the comprehensive simulation using NS2, we observe that EEDBR contributes to the performance improvements in terms of the network lifetime, energy consumption, and end-to-end delay. A previous version of this paper was accepted in AST-2011 conference.
39
Kang, Sang H. "Energy Optimization in Cluster-Based Routing Protocols for Large-Area Wireless Sensor Networks." Symmetry 11, no. 1 (2019): 37. http://dx.doi.org/10.3390/sym11010037.
Full textAbstract:
In large-area wireless sensor networks with hierarchical cluster-based routing protocols, the average number of clusters, k, and the transmission range for the control messages, R, significantly affect the network lifespan. We analyze energy consumption in depth as a function of ( k , R ) , taking into account the energy dissipation of cluster head nodes and the member nodes, separately. To achieve joint optimization of ( k o p t , R o p t ) , we adopt derivative-free Nelder–Mead Simplex method. Computer simulations have shown that our approach effectively reduces energy consumption of sensor nodes in the process of clustering and data transmission in large-area sensor fields. Our optimization can be applied to existing cluster-based routing schemes to maximize their energy efficiency.
40
Ali, Elmustafa Sayed, Rashid A. Saeed, and Ibrahim Khider Eltahir. "Depth based stable election routing protocol for heterogeneous internet of underwater things (IoUT) energy efficiency." Computers and Electrical Engineering 119 (October 2024): 109507. http://dx.doi.org/10.1016/j.compeleceng.2024.109507.
Full text
41
Bai, Qiuchan, and Chunxia Jin. "A K-Means and Ant Colony Optimization-Based Routing in Underwater Sensor Networks." Mobile Information Systems 2022 (April 18, 2022): 1–12. http://dx.doi.org/10.1155/2022/4465339.
Full textAbstract:
Reliable data transfer seems a quite challenging task in underwater sensor networks (UWSNs) in comparison with terrestrial wireless sensor networks due to the peculiar attributes of UWSN communication. Therefore, K-means and ant colony optimization-based routing (KACO) is proposed in this paper. In KACO, network area under water is divided into layers with regard to the depth level. And nodes of each layer are divided into clusters by the optimized K-means algorithm. The K-means algorithm is used to cluster nodes. Considering the shortcoming of K-means clustering, an improved K-means clustering is used to select the initial cluster center. In the stage of selecting cluster heads, the remaining energy of nodes and the distance from the sink node are used to calculate the competing factors of nodes, and then, the cluster heads are selected according to the competing factors. In the intercluster routing, the ant colony optimization (ACO) was improved by introducing the Gini coefficient, and the intercluster routing based on improved ACO is proposed. The simulation results show that the proposed KACO routing can effectively reduce the energy consumption of nodes and improve the efficiency of packet transmission.
42
Liang, Hua, Yang Yang, and Ziyan Wang. "Routing Optimization Algorithm of Spatial DTN Network Based on Multiattribute Decision." Wireless Communications and Mobile Computing 2021 (September 26, 2021): 1–11. http://dx.doi.org/10.1155/2021/4830701.
Full textAbstract:
Delay or stop (DTN) tolerance space network is considered to be a technology that can trade with a limited or restricted field communication area. In the space DTN network architecture, routing is very important. This article is based on the best-in-class multiattribute decision-making DTN network routing optimization algorithm. The goal is to use the optimized DTN network routing algorithm multiattribute decision-making algorithm and conduct a more in-depth study on the field information mechanism multipath decision algorithm and network path. Aiming at the problems of long link delay and frequent link interruption of current deep-space communication characteristics, and solving the impact on communication caused by system performance degradation. This paper adopts the multiattribute decision-making model algorithm to construct simulation tests, introduces the DTN network architecture, and analyzes the four attributes of the multi-attribute decision-making link bandwidth, node data forwarding rate, link establishment delay, and network error rate. The experimental results show that, in the spatial information network, the high-speed movement of nodes and the highly dynamic nature of the network make the deep-space network topology unstable and long communication delay; the change of the link mode and switch connection in the network will cause the routing table to update. This routing update method requires the exchange of topology information between all networks; when the forwarding rates of adjacent nodes are 100%, 90%, 95%, and 70%, nodes can only perform routing independently when they meet. The decision attribute algorithm has obvious changes to the attributes of any node in the spatial DTN network. The most obvious is that the link establishment delay has reached the standard of 5 or more.
43
He, T., X. F. Xu, H. C. Xu, and Y. L. Fu. "A New Approach to Routing of Advanced Flexible Manufacturing Shopfloor." Applied Mechanics and Materials 10-12 (December 2007): 104–8. http://dx.doi.org/10.4028/www.scientific.net/amm.10-12.104.
Full textAbstract:
This paper presents a new routing method for advanced flexible manufacturing shopfloor by combining a new Petri net model with a new evolution based hybrid algorithm. The approach embodies the notion of global optimization and thus makes it easier for the new PN to interface with global optimization algorithms. Finally, simulation results show that the proposed method is effective, practical and worthy of more-depth investigations.
44
Li, Ji, Huagang Xiong, Qiao Li, Feng Xiong, and Jiaying Feng. "Run-Time Reconfiguration Strategy and Implementation of Time-Triggered Networks." Electronics 11, no. 9 (2022): 1477. http://dx.doi.org/10.3390/electronics11091477.
Full textAbstract:
Time-triggered networks are deployed in avionics and astronautics because they provide deterministic and low-latency communications. Remapping of partitions and the applications that reside in them that are executing on the failed core and the resulting re-routing and re-scheduling are conducted when a permanent end-system core failure occurs and local resources are insufficient. We present a network-wide reconfiguration strategy as well as an implementation scheme, and propose an Integer Linear Programming based joint mapping, routing, and scheduling reconfiguration method (JILP) for global reconfiguration. Based on scheduling compatibility, a novel heuristic algorithm (SCA) for mapping and routing is proposed to reduce the reconfiguration time. Experimentally, JILP achieved a higher success rate compared to mapping-then-routing-and-scheduling algorithms. In addition, relative to JILP, SCA/ILP was 50-fold faster and with a minimal impact on reconfiguration success rate. SCA achieved a higher reconfiguration success rate compared to shortest path routing and load-balanced routing. In addition, scheduling compatibility plays a guiding role in ILP-based optimization objectives and ‘reconfigurable depth’, which is a metric proposed in this paper for the determination of the reconfiguration potential of a TT network.
45
Pang, Lili, Jiaye Xie, and Qiqing Xu. "Neural Network-Based Routing Energy-Saving Algorithm for Wireless Sensor Networks." Computational Intelligence and Neuroscience 2022 (July 1, 2022): 1–11. http://dx.doi.org/10.1155/2022/3342031.
Full textAbstract:
With the evolvement, standards have changed, mobile Internet technology has also been upgraded, and it has also driven the development of smart objects mobile. With the continuous development of smart objects mobile, the bottleneck of small node size and low battery energy storage has not been solved in the end, which makes the research of wireless sensor network energy-saving technology become the focus, and the improvement of routing technology is an effective way to improve energy-saving technology. From the data transmission energy consumption of smart objects mobile, the routing algorithm of smart objects mobile is discussed and analyzed and the classical representative LEACH is the object of in-depth research. Routing algorithms can easily and reliably process network data and make the network work well and are widely used in highly secure military systems and smaller commercial networks. Aiming at these deficiencies, a corresponding improved algorithm is proposed, and it is tested through simulation and specific experiments to verify the correctness and the system’s reliability. The SMPSO-BP algorithm converges when the number of iterations is about 600, which is earlier than the LEACH algorithm and the improved LEACH algorithm, so the SMPSO-BP algorithm is due to the other two algorithms. In the wireless sensor network routing energy consumption experiment, in addition, the SMPSO-BP algorithm uses less energy than the other two methods. Therefore, the energy-saving algorithm under the neural network data fusion mechanism is still feasible.
46
Jiang, Zheng Qiang, and Yue Wu. "The Research on Vehicle Routing Problem Based on Improved Ant Colony Algorithm." Applied Mechanics and Materials 397-400 (September 2013): 2439–46. http://dx.doi.org/10.4028/www.scientific.net/amm.397-400.2439.
Full textAbstract:
Vehicle Routing Problem (VRP) plays a vital role in mathematical and logistics research. Its a typical NP-Hard problem, and ant colony algorithm has been proven to be an effect way in solving these problems. An improved ant colony algorithm is proposed to solve VRP on the basis of depth analyzing VRP and ant colony algorithm. It proposes the mathematical model of VRP and designs an improved ant colony algorithm, considering the inefficient solving, easy to partial stagnation shortcomings of ant colony algorithm and the attraction, repulsion, time constraint phenomena in VRP. This paper redesigns the pheromone update rule and the state transition rule and then it makes a simulation experiment by MATLAB programming, the results show that the improved ant colony is feasible and very valid in solving VRP.
47
Battula, Ashok, S. Emalda Roslin, and W. Florin. "Void Avoidance in Underwater Acoustic Sensor Network Using Secure Opportunistic Energy Efficient Depth Routing Protocol." International Journal of Computer Network and Information Security 15, no. 3 (2013): 65–77. http://dx.doi.org/10.5815/ijcnis.2023.03.05.
Full textAbstract:
For starters, in UASN, distance between nodes as they move with water current, improved network's energy usage. The second problem with UASNs is void hole occurrence, which affects network performance. Nodes are unable to deliver data to the destination because there are no forwarder nodes (FNs) in the network. As a result, routing in UASNs aims to solve the previously mentioned issues in order to increase the network's lifespan. This research proposed novel technique in Void avoidance in underwater acoustic sensor network (UASN) with improving the energy efficiency of the network and analysing depth with security. In this proposed model, secure opportunistic energy efficient void avoidance protocol (Se_Opp_EE_VA) is used and the depth of the network has been analysed. By avoiding the vacuum zone and balancing network energy with depth analysis and security, the suggested effort extends the network lifetime. Routing techniques must be comprehensive enough to overcome all of these constraints as well as provide an energy-efficient routing that avoids empty zones while also extending network lifetime. The depth factor is used in depth-based algorithms proposed in recent decades to assess the path from sender to sink. They reduce information replication by using the holding time calculation. 81% of QoS, 92% of PDR, 96% of energy efficiency, Network lifetime attained by Proposed Se_Opp_EE_VA is 94%, and 50% of end to end delay have all improved as a result of the simulation.
48
Song, Xinrui, Zhenyu Song, and Zheng Chai. "Research on Multi-Beam Sounding Based on Local Optimal Model." Highlights in Science, Engineering and Technology 100 (May 22, 2024): 31–41. http://dx.doi.org/10.54097/z2gyg051.
Full textAbstract:
Multi-beam sounding technology can provide higher spatial resolution than single-beam sounding by transmitting fan-shaped acoustic signals from the transducer of a survey ship along the normal plane of the survey line to measure the sea depth. It is of great significance to study the line design scheme of multi-beam sounding for uneven seabed topography to improve the efficiency of underwater terrain mapping. This paper mainly studies the optimization of multi-beam sounding line under ideal slope. Firstly, a single angle model of ideal slope is established, and the flat seabed overlap ratio formula is extended to slope seabed to calculate the coverage width of beam sounding. Secondly, an angle model of ideal slope is established to calculate the corresponding coverage width under different positions of the slope sea area. Finally, the optimal routing model of ideal slope is established. The design scheme of the local optimal survey line is obtained through comprehensive analysis. In engineering practice, the optimal routing of real terrain can be solved by using the ideal slope optimal routing model through the idea of plane approximation, which provides a new idea for the optimal route selection of underwater terrain mapping.
49
Farooq, Muhammad, and Dirk Pesch. "Reduced Overhead Routing in Short-Range Low-Power and Lossy Wireless Networks." Sensors 19, no. 5 (2019): 1240. http://dx.doi.org/10.3390/s19051240.
Full textAbstract:
In this paper we present enhanced routing protocol for low-lower and lossy networks (ERPL), a reduced overhead routing protocol for short-range low-power and lossy wireless networks, based on RPL. ERPL enhances peer-to-peer (P2P) route construction and data packet forwarding in RPL’s storing and non-storing modes of operation (MoPs). In order to minimize source routing overhead, it encodes routing paths in Bloom Filters (BF). The salient features of ERPL include the following: (i) optimized P2P routing and data forwarding; (ii) no additional control messages; and (iii) minimized source routing overhead. We extensively evaluated ERPL against RPL using emulation, simulation, and physical test-bed based experiments. Our results demonstrate that ERPL outperforms standard RPL in P2P communication and its optimized P2P route construction and data forwarding algorithms also positively impact the protocol’s performance in multi-point to point (MP2P) and point to multi-point (P2MP) communications. Our results demonstrate that the BF-based approach towards compressed source routing information is feasible for the kinds of networks considered in this paper. The BF-based approach results in 65% lower source routing control overhead compared to RPL. Our results also provide new insights into the performance of MP2P, P2MP, and P2P communications relative to RPL’s destination-oriented directed a-cyclic graph (DODAG) depth, i.e., a deeper DODAG negatively impacts the performance of MP2P and P2MP communications, however it positively impacts P2P communication, while the reverse holds true for a relatively shallow DODAG.
50
Memon, Komal, Nafeesa Bohra, and Faisal K Shaikh. "Performance Comparison of Routing Protocols for Underwater Sensor Networks." International Journal of Engineering & Technology 7, no. 4.15 (2018): 178. http://dx.doi.org/10.14419/ijet.v7i4.15.21442.
Full textAbstract:
There is a great demand of an Underwater Sensor Networks (UWSNs) in applications of water monitoring and offshore exploration. In such applications, network comprises of multiple sensor nodes which are deployed at different locations and depths of water. Sensor nodes perform collective tasks such as data collection and data transmission to other nodes or Base Station (BS). The bottom nodes are located at depth of water, and are not able to communicate directly with the surface level nodes, these nodes require multi-hop communication with appropriate routing protocol. Therefore, an energy efficient routing protocols are used for such scenarios, which is necessary as well as challenging task. As sensors are battery operated devices, which are really problematic to recharge or replace. The error and propagation path delays are high in acoustic channels therefore underwater communication is much effected. Realizing the circumstances, more attention has been given to compare energy efficient routing protocols which comparatively consume low energy and achieve high throughput. This paper, comprises of analysis and comparison of existing UWSN based efficient energy routing protocols. Based upon the analysis and comparison, VBF and DBR have been proposed that fulfill the requirements. The analysis is done on NS-2 and for comparison, the performance metrics which are evaluated are: Packet delivery Ratio (PDR), energy consumption, throughput and average End to End (E2E) delay. The results show that VBF protocol consume very large amount of energy as compared to DBR protocol. Whereas DBR protocol have characteristics like low energy consumption, minimum delay high PDR and high throughput than VBF protocol.