检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Anubha Ravneet Preet Singh Bedi Arfat Ahmad Khan Mohd Anul Haq Ahmad Alhussen Zamil S.Alzamil
机构地区:[1]Department of Computer Applications,I.K.G.Punjab Technical University,Kapurthala,144601,Punjab,India [2]Research and Development,I.K.G.Punjab Technical University,Kapurthala,144604,Punjab,India [3]Department of Computer Science,College of Computing,Khon Kaen University,Khon Kaen,40002,Thailand [4]Department of Computer Science,College of Computer and Information Sciences,Majmaah University,Al-Majmaah,11952,Saudi Arabia [5]Department of Computer Engineering,College of Computer and Information Sciences,Majmaah University,Al-Majmaah,11952,Saudi Arabia
出 处:《Computers, Materials & Continua》2023年第4期1331-1351,共21页计算机、材料和连续体(英文)
摘 要:Mobile adhoc networks have grown in prominence in recent years,and they are now utilized in a broader range of applications.The main challenges are related to routing techniques that are generally employed in them.Mobile Adhoc system management,on the other hand,requires further testing and improvements in terms of security.Traditional routing protocols,such as Adhoc On-Demand Distance Vector(AODV)and Dynamic Source Routing(DSR),employ the hop count to calculate the distance between two nodes.The main aim of this research work is to determine the optimum method for sending packets while also extending life time of the network.It is achieved by changing the residual energy of each network node.Also,in this paper,various algorithms for optimal routing based on parameters like energy,distance,mobility,and the pheromone value are proposed.Moreover,an approach based on a reward and penalty system is given in this paper to evaluate the efficiency of the proposed algorithms under the impact of parameters.The simulation results unveil that the reward penalty-based approach is quite effective for the selection of an optimal path for routing when the algorithms are implemented under the parameters of interest,which helps in achieving less packet drop and energy consumption of the nodes along with enhancing the network efficiency.
关 键 词:ROUTING optimization REWARD PENALTY MOBILITY energy THROUGHOUT PHEROMONE
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7