The study of ZigBee network routing algorithm based on adjacent relation

2012 ◽  
Author(s):  
Yujie Zhang ◽  
Sale Hui
Keyword(s):  
Routing Algorithm ◽  
Network Routing ◽  
Zigbee Network ◽  
Adjacent Relation

An Approach on Optimization of ZigBee Network Routing Algorithm

2013 ◽  
Vol 347-350 ◽  
pp. 1987-1991
Author(s):  
Hao Fan Liu ◽  
Ping Li
Keyword(s):  
Routing Protocol ◽  
Optimization Algorithm ◽  
Routing Algorithm ◽  
Network Routing ◽  
Low Energy ◽  
Network Robustness ◽  
Packet Forwarding ◽  
Zigbee Network ◽  
Protocol Study

ZigBee routing protocol study and optimization for the problem of the effects of flooding AODVjr algorithm RREQ packet.By introducing new coordinate parameters and other methods to control the RREQ packet forwarding. Network robustness problem and prolong the life of the network, by changing the algorithm in the case of low energy strategy.And simulation comparison to verify the effectiveness of the optimization algorithm.

scholarly journals Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks

Electronics ◽  
2021 ◽  
Vol 10 (10) ◽  
pp. 1138
Author(s):  
Yu Lu ◽  
Liu Chang ◽  
Jingwen Luo ◽  
Jia Wu
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Relay Node ◽  
Network Routing ◽  
Transmission Factor ◽  
Transmission Scheme ◽  
Network Delay ◽  
Significant Burden

With the rapid popularization of 5G communication and internet of things technologies, the amount of information has increased significantly in opportunistic social networks, and the types of messages have become more and more complex. More and more mobile devices join the network as nodes, making the network scale increase sharply, and the tremendous amount of datatransmission brings a more significant burden to the network. Traditional opportunistic social network routing algorithms lack effective message copy management and relay node selection methods, which will cause problems such as high network delay and insufficient cache space. Thus, we propose an opportunistic social network routing algorithm based on user-adaptive data transmission. The algorithm will combine the similarity factor, communication factor, and transmission factor of the nodes in the opportunistic social network and use information entropy theory to adaptively assign the weights of decision feature attributes in response to network changes. Also, edge nodes are effectively used, and the nodes are divided into multiple communities to reconstruct the community structure. The simulation results show that the algorithm demonstrates good performance in improving the information transmission’s success rate, reducing network delay, and caching overhead.

Network Routing Mechanism Simulation Research Based on VANETs

2014 ◽  
Vol 651-653 ◽  
pp. 1868-1874
Author(s):  
Li Zhu ◽  
Lan Bai
Keyword(s):  
Routing Protocol ◽  
Vehicular Networks ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Network Routing ◽  
On Demand ◽  
Routing Mechanism ◽  
Demand Routing ◽  
On The Road ◽  
Low Efficiency

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

A Optimization Traffic Grooming Algorithm Based on Bidirectional SONET Ring Topology Network

2015 ◽  
Vol 727-728 ◽  
pp. 996-999 ◽  
Author(s):  
Su Xia Cui
Keyword(s):  
Resource Utilization ◽  
Network Performance ◽  
Minimum Weight ◽  
Routing Algorithm ◽  
Traffic Grooming ◽  
Network Routing ◽  
Ring Network ◽  
Network Resource ◽  
Blocking Rate ◽  
The Impact

The issue of WDM network traffic grooming has been a hot in the field of research. The implementation of traffic grooming technology can improve the utilization of wavelength channels, reducing the link delay and the blocking rate of the network, which to improve network resource utilization and optimize network performance. This article mainly studies all-optical network routing algorithm utilizing WDM technology to achieve the dynamic traffic grooming and propose a optimization grooming policy -HaffmanGroom (M) algorithms which based on SONET / WDM ring network. The most important feature of this algorithm is that the SONET / WDM ring network of multiple multicast request packet , with a minimum weight of the light path priority selection method, the flow of requests each group effectively optimize ease . The algorithm takes into account the impact of the link request factor and link hops to optimize the link selection. The simulation results show that under the conditions of factors and the number of hop a request fully consider the impact of these two factors to the link, and can achieve optimal link with the smallest weights for effective data transmission, improving resource utilization, reducing blocking rate in order to achieve the purpose of optimizing network performance.

scholarly journals Research on LEACH-Based Wireless Sensor Network Routing

2019 ◽  
Vol 25 ◽  
pp. 01011
Author(s):  
Junke Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Routing Algorithm ◽  
Network Routing ◽  
Wireless Sensor ◽  
Practical Significance ◽  
Routing Optimization ◽  
Leach Protocol ◽  
Routing Technology

Routing technology is one of the main supporting technologies of wireless sensor networks. Only by using routing algorithm reasonably or finding better routing optimization algorithm, can the function of wireless sensor networks be maximized. Therefore, the research of routing technology for wireless sensor networks has important theoretical and practical significance. Based on the analysis of existing routing protocols in wireless sensor networks, this paper focuses on LEACH protocol.

Sign in / Sign up

Export Citation Format

Share Document