期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Cooperative Channel and Optimized Route Selection in Adhoc Network 被引量:1
1
作者 D.Manohari M.S.Kavitha +1 位作者 K.Periyakaruppan B.Chellapraba 《Intelligent Automation & Soft Computing》 SCIE 2023年第5期1547-1560,共14页
Over the last decade,mobile Adhoc networks have expanded dramati-cally in popularity,and their impact on the communication sector on a variety of levels is enormous.Its uses have expanded in lockstep with its growth.D... Over the last decade,mobile Adhoc networks have expanded dramati-cally in popularity,and their impact on the communication sector on a variety of levels is enormous.Its uses have expanded in lockstep with its growth.Due to its instability in usage and the fact that numerous nodes communicate data concur-rently,adequate channel and forwarder selection is essential.In this proposed design for a Cognitive Radio Cognitive Network(CRCN),we gain the confidence of each forwarding node by contacting one-hop and second level nodes,obtaining reports from them,and selecting the forwarder appropriately with the use of an optimization technique.At that point,we concentrate our efforts on their channel,selection,and lastly,the transmission of data packets via the designated forwarder.The simulation work is validated in this section using the MATLAB program.Additionally,steps show how the node acts as a confident forwarder and shares the channel in a compatible method to communicate,allowing for more packet bits to be transmitted by conveniently picking the channel between them.We cal-culate the confidence of the node at the start of the network by combining the reliability report for thefirst hop and the reliability report for the secondary hop.We then refer to the same node as the confident node in order to operate as a forwarder.As a result,we witness an increase in the leftover energy in the output.The percentage of data packets delivered has also increased. 展开更多
关键词 Adhoc Network confident FORWARDER one-hop optimized route selection secondary report channel selection
下载PDF
对等网中Chord资源查找算法研究 被引量:16
2
作者 张震 王晓明 《计算机工程与应用》 CSCD 北大核心 2006年第11期147-152,共6页
在大规模的对等网络结构中,如何快速准确地确定资源的位置是一个比较突出的问题,基于DHT(DistributedHashTable)资源定位及查找算法是目前比较流行的算法之一,文章介绍了其中具有代表性的Chord算法以及基于Chord的两种改进算法,对其进... 在大规模的对等网络结构中,如何快速准确地确定资源的位置是一个比较突出的问题,基于DHT(DistributedHashTable)资源定位及查找算法是目前比较流行的算法之一,文章介绍了其中具有代表性的Chord算法以及基于Chord的两种改进算法,对其进行了分析比较。 展开更多
关键词 对等网查找算法 CHORD one-hop EpiChord
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部