Low overhead on-demand routing protocol for mobile ad hoc networks by JIANG Guo-xing, YI Ming

“…To improve the performance of flooding,an efficient broadcasting algorithm with constrained flooding was proposed,this algorithm only selected efficient some from all routing packets to forward according to Euclidean Distance.A packet listening method,which could reduce route maintenance overhead and route discovery frequency,was studied,then a local route repair and optimization algorithm,which was based on node height and can repair the failure path due to link breakage,was presented.Furthermore,based on the efficient broadcasting algorithm and local route repair and optimization algorithm,a new on-demand routing protocol,named LOOR（low overhead on-demand routing）,was proposed.The simulation results on ns2 show that LOOR can enhance the route robustness,decrease the average hop count,the route discovery frequency and the routing overhead obviously,and increase the packet delivery ratio.…”
Get full text

Minimal coding cost and low delay multicast routing of wireless mesh networks by gang CHENZhi, jian SHENXiao, Li LIU

“…MNCLDMR protocol introduces the concept of topology key nodes and network coding key nodes, serving as the routing metric whether the next hop nodes were network coding key nodes or topology key nodes, using MNCLD algorithm construct multicast tree. …”
Get full text

Performance analysis of incremental cooperative relaying system over composite multipath/shadowing fading channels by HENGWei-jun CHENG, Yan HUANG

“…Since the performance metrics of digital communication systems over composite multipath/lognormal fading channels is intractable,a mixture Gamma (MG) fading model is used to approximate Nakagami-lognormal (NL) fading model.By using MG fading channel model,some exact closed-form expressions of the average error rate and outage probability for incremental cooperative relaying system are obtained,respectively,where per hop is independent and non-identically distributed.Finally,numerical and simulation results are shown to verify the accuracy of the analytical results.These results show that it is helpful to approximate the composite NL distribution by using the MG distribution in the performance analysis of cooperative relaying systems.…”
Get full text

Routing algorithm based on characteristics analysis of vehicle trace in vehicular ad hoc network by Hua TAO, Fu-qin FENG, Peng XIAO, Cheng-wei TAN, Jun TAO

“…The coarse granularity vehicle mobility information is extracted from the vehicle trace data.Then a fine granularity mobility model was presented based on the coarse-grained mobility information.Based on the mobility model,a VANET routing algorithm,RPT-D,was proposed to quickly deliver the packets to the destination according to the mobility attributes.The RPT-GA algorithm,which was integrated with the QoS demands in the path selection objective,was designed.Finally,through the extensive simulations,the proposed algorithms are compared with other typical VANET routing algorithms,IGRP and GPSR,in terms of the transmission latency,the delivery ratio,the hop count and the extra package number.The simulation results verify the performance of the proposed algorithms.…”
Get full text

Efficient broadcast transmission algorithms based on opportunistic network coding by Ji LU, Cheng-ke WU, Song XIAO, Ran ZHANG

“…Opportunistic network coding (ONC) based broadcast transmission algorithms were proposed to improve the transmission efficiency for wireless single-hop networks.Based on the traditional wireless broadcast transmission model,ONC based solo combination packet broadcast transmission (ONCSB) algorithm and ONC based multiple combination packets broadcast transmission (ONCMB) algorithm were osed respectively.By employing the method of combination different lost packets with different strategies,the ONCSB and ONCMB can improve the throughput with recovering lost packets via a combination packet efficiently.The simulation results show that either ONCSB or ONCMB can lead to better transmission bandwidth performance compared with other algorithms under different wireless channel conditions.…”
Get full text

Partial Relay Selection with Feedback Delay and Cochannel Interference: Performance Analysis and Power Optimization by Xuanxuan Tang, Weifeng Mou, Fang Fang, Yueming Cai, Weiwei Yang, Tao Zhang

“…The performance of a dual-hop amplify-and-forward (AF) relay system is studied with the k th worst partial relay selection (PRS) protocol under the joint impact of feedback delay and multiple cochannel interference (CCI) at the relay nodes. …”
Get full text

Distributed cooperative spectrum sensing based on consensus optimization by ZENG Fan-zi, LIU Jie, LI Ren-fa, ZENG Qing-guang

“…A distributed wideband spectrum compressive sensing approach based on consensus optimization was developed.The cognitive radio users firstly collected the time-domain sampling by compressive sampling and recover the local spectrum.Then the spectrum of primary users is recovered jointly by cooperative cognitive radio users,which utilizes iterative consensus optimization to reach globally sensing outcomes via one-hop local communication only.In particular,a weighted consensus-averaging constraint is introduced to reduce the number of the consensus constraints,which lowers the computation loads and expedites the convergence.The convergence of the proposed distributed cooperative spectrum sensing scheme is proved analytically.Simulations demonstrate that the proposed scheme can effectively sense the spectrum from compressive sample.…”
Get full text

Research on intelligent control technology for OSU-based OTN by Yanxia TAN, Zhiyan DUAN, Xiangkun MAN, He ZHANG, Yacheng LIU, Yantao ZHOU, Shan DONG

“…With the development of information and cloud technology, the dynamic demand for OTN service is gradually increasing.As a next generation OTN switching technology, OSU needs to provide network and cloud services for high-quality enterprise leased lines and boutique home broadband services.The OSU-based OTN needs to be able to provide integrated services and automated service provisioning through end-to-end management and control capabilities to support one-hop service into the cloud.Firstly, the background, technical characteristics, and standardization progress of OSU technology were introduced.Then, a service-aware control framework for OSU-OTN was proposed to meet the demand for efficient bearer of government and enterprise leased lines.Finally, an experimental validation of the end-to-end management and control capability of the access OSU-OTN controller system was carried out.…”
Get full text

Method for discovering intra-session network coding opportunity in wireless ad hoc networks by DONG Chao1, QIAN Rui2, CHEN Gui-hai1, WANG Hai2

“…Coding opportunity is critical to the performance of intra-session network coding in ad hoc networks.However,coding opportunity can not be discovered effectively with most distance-vector routing protocols including AODV which only knows one-hop neighbor node information.From the aspect of how much network topology information needs to be known,the condition under which the coding opportunity can be discovered effectively was proposed and the sufficiency and necessity of the condition was analyzed.Also the condition was implemented based on AODV routing protocol and validated with the help of real experiment and simulation.The results show that the proposed condition is correct and can improve the performance of wireless ad hoc networks effectively.…”
Get full text

Analysis of network coding delay:a Markov state transfer approach by Yu-ben QU, Chen CHEN, Chao DONG, Hai WANG

“…Network coding has been validated as an effective means to improve network throughput and reliability,but the study of its delay performance is not enough.Agai the widely used random linear network coding,the proposed method,based on the Markov state transfer,analyzed the delay expectation and probability distribution of the unicast flow in a single hop scene,and presented the exact recursions.Then according to numerical simulation,the effect of the encoding parameters were analyzed such as the finite f eld size,the channel loss rate and the encoding batch size on the delay.The results show that,as the finite field q increases,the delay variance continues to become smaller; the average delay is almost linear with the channel loss rate and the encoding batch size individually.…”
Get full text

Multi-level feedback based time synchronization algorithm for wireless sensor networks by HUANGFU Wei1, ZHOU Xin-yun1, CHEN Can-feng3

“…Aiming at the fast and efficient time synchronization protocol for the wireless sensor networks under resource constraints, a novel feedback-based full-scale time synchronization（FTS） algorithm was proposed.The basic idea of FTS is to execute iteratively time synchronization downlink operations on all the nodes of the wireless sensor network and collect the two-way path delay information from only a part of nodes to calculate the average delay adjustment per hop.The stochastically feedback scheme is adopted to reduce the uplink packets.The FTS algorithm also consists of the mechanisms of synchronization error monitoring and clock skew correction.The FTS was implemented on the popular TelosB sensor nodes from UC Berkeley.The experiments show that FTS is a fast, resource-efficient algorithm with ra-tional synchronization precision.…”
Get full text

Method of node distribution for heterogeneous WMSN based on load balancing by Yong-hong ZHU, En-jie DING

“…Multiple hop transmission in wireless sensor networks(WSN)would bring the energy hole problem near the sink.It proved that the energy hole problem would appear in any position in heterogeneous wireless multimedia sensor networks and propose a method of the node distribution based on load balancing to solve the problem.The energy consumption was analyzed on the basis of considering the data compression ratio and the energy consumed for data transmission and processing.It proved that in heterogeneous WMSN the energy consumption of data processing would affect the node distribution and define a word that profit of data processing.The simulation results show that the energy utilization rate and the survival time of the network can be effectively improved by using the method proposed.…”
Get full text

Research on link prediction model based on hierarchical attention mechanism by Xiaojuan ZHAO, Yan JIA, Aiping LI, Kai CHEN

“…In order to solve the problem that the existing graph attention mechanism tends to cause attention distribution to certain relations with high frequency when performing link prediction related tasks, a new link prediction model based on hierarchical attention mechanism was proposed.In the link prediction task, a hierarchical attention mechanism was designed to give different attention to the relationships of different relationship types connected to a given entity in the knowledge graph according to the relationship in the prediction task.While the characteristics of multi-hop neighbor entities were pay attention to, the relationship characteristics was pay more attention to find the relationship type that matches the target relationship.Through comparison experiments with the mainstream models on multiple benchmark data sets, the results show that the performance of the model is better than the mainstream models and has good robustness.…”
Get full text

Distributed refinement algorithm for WSN localization by Ying-biao YAO, Nan-lan JIANG

“…A distributed refinement algorithm was proposed based on the error analyzing of range-based WSN localization.In each iteration,the proposed algorithm identified “error nodes” and “effective nodes” according to the idea of“magnetic pole”at first; then,it choosed two nodes with the minimum relative deviations in the 1-hop neighbors set of error node,and getted the intersection points of two circles whose centers were the positions of above two nodes and radiuses are the range distances from above two nodes to the error node respectively; at last,it choosed the position with minimum error,from its current position and above two intersection points as refinement position of error node after this iteration.Simulation results show that the proposed algorithm can reduce the localization error of multilateral positioning model and improve the localization accuracy efficiently.…”
Get full text

Routing discovery algorithm based on reliable path stability estimation in MANET by Zhi-nan LI, Xiao-dong YANG

“…A novel routing discovery algorithm for MANETs was proposed based on reliable residual path lifetime (RPL) prediction (RLE-RPLP).Correlation between residual link lifetime (RLL) of neighboring links was explicitly investigated and fully taken into account in stability estimation of multi-hop paths in the algorithm.Optimized RPL statistical proper-ties were further explored to offer a more reliable path stability metric.Simulation analysis demonstrates that the pro-posed RLE-RPLP routing discovery algorithm shows prominent superiority in improving network throughput and reduc-ing route reconstruction frequency.Moreover,compared with the existing link stability-aware routing protocol,the RLE-RPLP achieves better performance improvement in terms of throughput and routing overhead.…”
Get full text

Implementation of a Cost and Variation Reduction Program for Hemostasis Products at a Large Academic Medical Center: A Multi-Stakeholder Perspective by Shah T, Brethauer S, Danker III WA, Doshi I, O'Hara M, Silber A, Vasileff WK

“…Thus, we sought to evaluate hospital stakeholder satisfaction with conversion to a sole supplier for hemostasis products, in addition to economic and clinical impacts, to help develop best practices for implementation.Methods: This cross-sectional study assessed satisfaction with converting to a sole supplier for hemostasis products at a large US academic medical center using qualitative interviews and quantitative surveys with clinical and non-clinical stakeholders, on the decision-making process, conversion, and vendor-supported hemostasis optimization program (HOP) post-implementation (February 2022–May 2022). …”
Get full text

Information freshness orientated wireless network design for 6G by Ke XIONG, Huimin HU, Bo AI, Yu ZHANG, Li PEI

“…The development of the Internet of things has led to the deployment and application of various real-time monitoring systems (such as intelligent driving) and status update systems (such as industrial control).For the above systems,the freshness of information is particularly important.If the destination receives outdated information,it may reduce the accuracy and reliability of the system’s decision-making and cause severe security risks.In the future 6G network,the freshness of information will become increasingly important for information update applications.In order to characterize the freshness of information effectively,the academic world has proposed the concept of age of information (AoI).Recently,AoI has quickly become a new performance index and research hotspot of wireless systems.Firstly the research history of information age was reviewed.Then,the key issues of AoI introduced in different network models (such as single-user networks,single-hop networks,and multi-user networks) were analyzed.Finally the future research trend was prospected.…”
Get full text

An Improved Algorithm of Wireless Sensor Networks Routing Protocol Based on LEACH by Jinshen Weng, Huabiao Qin, Zongguo Zhang

“…One of the most popular research focuses of wireless sensor network is postponing the life cycle of sensor network as well as reducing energy consumption.An efficient clustering routing algorithm based on LEACH（low energy adaptive clustering hierarch）was presented，which is the representative of hierarchy based protocol in wireless sensor network.The residual energy，average energy and maximum energy are considered in this algorithm while electing the cluster header.It can also limit the number of members of each cluster.At the same time，it can produce the first cluster header among the cluster heads which will use the multi-hop mode to balance the load of network.The simulation results show that this improved algorithm can reduce the energy consumption，extend the network life cycle and ensure the load balance of the system.…”
Get full text

A Multiple-Dimensional Tree Routing Protocol for Multisink Wireless Sensor Networks Based on Ant Colony Optimization by Hui Zhou, Dongliang Qing, Xiaomei Zhang, Honglin Yuan, Chen Xu

“…The simulation results show that the proposed protocol can realize the QoS optimization for multisink wireless sensor networks, and its performance is better than the routing protocol of minimum hop numbers.…”
Get full text

Social Contribution-Based Routing Protocol for Vehicular Network with Selfish Nodes by Haigang Gong, Lingfei Yu, Xue Zhang

“…The node with higher delivery probability and lower social contributions is the preferred candidate for the next hop. Simulation results show that SCR achieves better performance than other social routing protocols with the incentive scheme.…”
Get full text