scholarly journals Research on the WSN Node Localization Based on TOA

2013 ◽  
Vol 2013 ◽  
pp. 1-6
Author(s):  
Qing-hui Wang ◽  
Ting-ting Lu ◽  
Meng-long Liu ◽  
Li-feng Wei
Keyword(s):  
Large Scale ◽  
Loss Rate ◽  
Routing Algorithm ◽  
Location Information ◽  
Node Localization ◽  
Average Delay ◽  
Delay Reduction ◽  
Node Location ◽  
System Overhead ◽  
Fixed Node

Regarding the tracking of moving target in the large-scale fixed scene, a new routing algorithm of LAODV in the principle of TOA localization is proposed. Then, the participation field of the fixed node based on the node location information is properly controlled, while the routing request area is reduced through combination of AODV and LAR during transmission of the location information. Simulation results show that the proposed algorithm renders satisfactory performance in terms of average delay reduction from end to end, packet loss rate, and routing overhead. As a result, the delay and system overhead during localization could be minimized.

scholarly journals Load Balancing Routing Algorithm of Low-Orbit Communication Satellite Network Traffic Based on Machine Learning

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Tie Liu ◽  
Chenhua Sun ◽  
Yasheng Zhang
Keyword(s):  
Machine Learning ◽  
Loss Rate ◽  
Satellite Communication ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Research Trend ◽  
Average Delay ◽  
Average Value ◽  
Distribution Index ◽  
Better Than

Satellite communication has become an important research trend in the field of communication technology. Low-orbit satellites have always been the focus of extensive attention by scholars due to their wide coverage, strong flexibility, and freedom from geographical constraints. This article introduces some technologies about low-orbit satellites and introduces a routing algorithm DDPG based on machine learning for simulation experiments. The performance of this algorithm is compared with the performance of three commonly used low-orbit satellite routing algorithms, and a conclusion is drawn. The routing algorithm based on machine learning has the smallest average delay, and the average value is 126 ms under different weights. Its packet loss rate is the smallest, with an average of 2.9%. Its throughput is the largest, with an average of 201.7 Mbps; its load distribution index is the smallest, with an average of 0.54. In summary, the performance of routing algorithms based on machine learning is better than general algorithms.

SecRET

2021 ◽  
Vol 15 (1) ◽  
pp. 1-26
Author(s):  
Sudip Misra ◽  
Tamoghna Ojha ◽  
Madhusoodhanan P
Keyword(s):  
Sensor Networks ◽  
Error Rates ◽  
Location Information ◽  
Underwater Sensor Networks ◽  
Node Localization ◽  
Limited Bandwidth ◽  
Secure Localization ◽  
Localization Scheme ◽  
Monitoring Application ◽  
Fundamental Requirement

Node localization is a fundamental requirement in underwater sensor networks (UWSNs) due to the ineptness of GPS and other terrestrial localization techniques in the underwater environment. In any UWSN monitoring application, the sensed information produces a better result when it is tagged with location information. However, the deployed nodes in UWSNs are vulnerable to many attacks, and hence, can be compromised by interested parties to generate incorrect location information. Consequently, using the existing localization schemes, the deployed nodes are unable to autonomously estimate the precise location information. In this regard, similar existing schemes for terrestrial wireless sensor networks are not applicable to UWSNs due to its inherent mobility, limited bandwidth availability, strict energy constraints, and high bit-error rates. In this article, we propose SecRET , a <underline>Sec</underline>ure <underline>R</underline>ange-based localization scheme empowered by <underline>E</underline>vidence <underline>T</underline>heory for UWSNs. With trust-based computations, the proposed scheme, SecRET , enables the unlocalized nodes to select the most reliable set of anchors with low resource consumption. Thus, the proposed scheme is adaptive to many attacks in UWSN environment. NS-3 based performance evaluation indicates that SecRET maintains energy-efficiency of the deployed nodes while ensuring efficient and secure localization, despite the presence of compromised nodes under various attacks.

Dynamic Routing Algorithm Based on HIP Multicast Model

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang
Keyword(s):  
Loss Rate ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Simulation Experiments ◽  
Delay Jitter ◽  
Result Show ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

scholarly journals Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Sohail Jabbar ◽  
Rabia Iram ◽  
Muhammad Imran ◽  
Awais Ahmad ◽  
Anand Paul ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Large Scale ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Route Discovery ◽  
Route Selection ◽  
Energy Aware ◽  
Forwarding Node

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

Antnet Routing Algorithm with Link Evaporation and Multiple Ant Colonies to Overcome Stagnation Problem

2013 ◽  
pp. 255-274
Author(s):  
Firat Tekiner ◽  
Zabih Ghassemlooy
Keyword(s):  
Routing Algorithm ◽  
Packet Delay ◽  
Average Delay ◽  
Ant Colonies ◽  
Feedback Information ◽  
Switched Networks ◽  
Agent Based ◽  
Data Packets ◽  
Reinforcement Parameter ◽  
Distance Vector

Antnet is a software agent-based routing algorithm that is influenced by the unsophisticated and individual ant’s emergent behaviour. The aim of this chapter is twofold, firstly to introduce improvements to the antnet routing algorithm and then to critically review the work that is done around antnet and reinforcement learning in routing applications. In this chapter a modified antnet algorithm for packet-based networks has been proposed, which offers improvement in the throughput and the average delay by detecting and dropping packets routed through the non-optimal routes. The effect of traffic fluctuations has been limited by applying boundaries to the reinforcement parameter. The round trip feedback information supplied by the software agents is reinforced by updated probability entries in the distance vector table. In addition, link usage information is also used to prevent stagnation problems. Also discussed is antnet with multiple ant colonies applied to packet switched networks. Simulation results show that the average delay experienced by data packets is reduced for evaporation for all cases when non-uniform traffic model traffic is used. However, there is no performance gain on the uniform traffic models. In addition, multiple ant colonies are applied to the packet switched networks, and results are compared with the other approaches. Results show that the throughput could be increased when compared to other schemes, but with no gain in the average packet delay time.

Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks

2010 ◽  
Vol 2 (2) ◽  
pp. 53-63 ◽  
Author(s):  
Amitabha Chakrabarty ◽  
Martin Collier ◽  
Sourav Mukhopadhyay
Keyword(s):  
Large Scale ◽  
Blocking Probability ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Low Complexity ◽  
Deterministic Algorithms ◽  
Routing Strategy ◽  
The Status ◽  
Extensive Computation ◽  
Symmetric Networks

This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 × 2 switch elements such as Bene?s networks. This algorithm trades off the probability of blocking against algorithm execution time. Deterministic algorithms exploit the rearrangeability property of Bene?s networks to ensure a zero blocking probability for unicast connections, at the expense of extensive computation. The authors’ algorithm makes its routing decisions depending on the status of each switching element at every stage of the network, hence the name adaptive routing. This method provides a low complexity solution, but with much better blocking performance than random routing algorithms. This paper presents simulation results for various input loads, demonstrating the tradeoffs involved.

scholarly journals The Feasibility of Opening Communities -- Based on the Wiedemann Car-Following Model

2018 ◽  
Vol 11 (3) ◽  
pp. 57
Author(s):  
Xiao-Yan Cao ◽  
Bing-Qian Liu ◽  
Bao-Ru Pan ◽  
Yuan-Biao Zhang
Keyword(s):  
Traffic Congestion ◽  
Large Scale ◽  
Gated Communities ◽  
Urban Traffic ◽  
Average Delay ◽  
Traffic Demand ◽  
Car Following ◽  
Car Following Model ◽  
Urbanization In China ◽  
The Impact

With the accelerating development of urbanization in China, the increasing traffic demand and large scale gated communities have aggravated urban traffic congestion. This paper studies the impact of communities opening on road network structure and the surrounding road capacity. Firstly, we select four indicators, namely average speed, vehicle flow, average delay time, and queue length, to measure traffic capacity. Secondly, we establish the Wiedemann car-following model, then use VISSIM software to simulate the traffic conditions of surrounding roads of communities. Finally, we take Shenzhen as an example to simulate and compare the four kinds of gated communities, axis, centripetal and intensive layout, and we also analyze the feasibility of opening communities.

A Wireless Sensor Network Routing Algorithm Based on Zigbee

2014 ◽  
Vol 513-517 ◽  
pp. 1845-1849
Author(s):  
Hua Rui Wu ◽  
Li Zhu
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Routing Algorithm ◽  
Network Routing ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Quantitative Relation ◽  
Analysis Model

Routing strategy with effective and saving energy is an important problem in the research on the application of wireless sensor network into the farmland micro climate and soil moisture monitoring,it analyzed the disadvantage of the layered tree routing algorithm and ZigBee routing algorithms in energy saving, combined with ZigBee network topology,establishing an optimal node analysis model based on fuzzy decision, bringing forward a new routing algorithm which is suitable for large-scale farmland gradient environment, this new algorithm find out the quantitative relation between energy consumption and routing node selecting strategy,which can greatly decrease the route hop number by routing discovery mechanism and create an optimum goal group. Simulation results showed that compared with the layered tree and ZigBee routing algorithms,the new routing algorithms can significantly reduce the energy consumption of routing process.

Sign in / Sign up

Export Citation Format

Share Document