Routing on ad-hoc network has become a major research issue among the networking communities due to its increasing complexity and the surge of challenging problems. One major factor contributing to this tendency is th...Routing on ad-hoc network has become a major research issue among the networking communities due to its increasing complexity and the surge of challenging problems. One major factor contributing to this tendency is that every terminal of an ad-hoc network is also functioning as a network router. In this paper we provide a comprehensive review about the principles and mechanisms of routing protocols used in ad-hoc networks. For comparison purposes, we discuss some relevant technical issues of two well-known routing strategies, namely On-Demand (Proactive routing) and Table-Driven (Reactive routing). In particular, focus our attention on two major and well-known routing protocols: AODV (Ad-hoc On-Demand Distance Vector Protocol) and OLSR (Optimized Link State Routing Protocol). Our study has no intention to suggest any definite solution for any ad-hoc network, because it is the case depending on dictated by the nature and varying factors of networks. Instead, we demonstrate our major perception and describe general models that may assist us while modeling a given network.展开更多
Due to highly dynamic topology caused by fast moving nodes the Vehicular ad-hoc network (VANET) results in the existence of transient communication links, which degrade the performance of developed protocols. Establis...Due to highly dynamic topology caused by fast moving nodes the Vehicular ad-hoc network (VANET) results in the existence of transient communication links, which degrade the performance of developed protocols. Established routes frequently become stale, and existing communication flows are interrupted, incurring delay and additional overhead. In this paper we propose a novel hybrid routing protocol, which is the combined between of the table-driven routing and on-demand routing in VANET. It makes fast convergence in routing process, minimal drop links, making more reliable links, and adaptive with changing of VANET topology. With neighbor table is updated instantaneously, and using strong neighbor for routing process makes route discovery process start whenever it received requirement, and through using route mechanism appropriately it reduces significantly route overhead at each node. The simulation results illustrate the outstanding properties of our proposed routing protocol.展开更多
In mobile ad hoc networks （MANETs）, if a mnltihop route breaks, route maintenance is typically performed to establish a new route which causes high control overhead and long packet delay. To decrease the time of rec...In mobile ad hoc networks （MANETs）, if a mnltihop route breaks, route maintenance is typically performed to establish a new route which causes high control overhead and long packet delay. To decrease the time of recovery and the overhead of maintenance, a new route maintenance mechanism in which the maintenance is confined to the vicinity of the broken link is proposed. This mechanism patches broken route through some other nodes in which only nodes near the broken link（s） may need to be substituted and the rest of nodes can be retained on the route. The broken link can be repaired without considering its relative position in the whole path, so the abihty of dealing with hnk failure is improved obviously. Simulation results show that the proposed strategy improves network performance significantly, such as in merits of control overhead and packet delay.展开更多
To cope with the problem of low protocol efficiency of the standard ad hoc on-demand distance vector （AODV） routing protocol with the periodic Hello message broadcast mechanism, a new link availability prediction ba...To cope with the problem of low protocol efficiency of the standard ad hoc on-demand distance vector （AODV） routing protocol with the periodic Hello message broadcast mechanism, a new link availability prediction based strategy is introduced to reduce the amount of Hello messages. In this strategy, a novel wireless link availability prediction model under line-of-sight （LOS） propagation environments is proposed based on which the parameter of Hello Interval in AODV can be dynamically adjusted to achieve the goal of changing the frequency of Hello message broadcasts under different link stability degrees. Simulation results demonstrate that, compared with the standard AODV with the periodic Hello message broadcast mechanism, the proposed protocol effectively reduces unnecessary control message overhead and greatly improves the performance in terms of end-to-end delay and efficiency.展开更多
针对群组机器人系统在应急场景下移动频繁、能量有限的特点,提出了一种基于能量与速度的分簇自组织按需距离矢量协议(Clustered Ad hoc On-Demand Distance Vector Protocol Based on Energy and Speed,ESC-AODV),以延长群组机器人网络...针对群组机器人系统在应急场景下移动频繁、能量有限的特点,提出了一种基于能量与速度的分簇自组织按需距离矢量协议(Clustered Ad hoc On-Demand Distance Vector Protocol Based on Energy and Speed,ESC-AODV),以延长群组机器人网络运行时间,提高通信可靠性。用路由性能代替跳数作为路由判据,目的节点在重复接收到路由请求(Route Request,RREQ)数据包时,若路由性能更小,则回复路由应答(Routing Reply,RREP)数据包,以此选择更好的路由,引入分簇结构,通过簇头和网关组成的骨干网络减少广播洪泛次数。实验结果证明,节点数量多时,改进的ESC-AODV协议在延长网络生存时间的同时,平均端到端时延、数据包投递率、吞吐量和路由开销均优于AODV以及基于能量、负载和速度的AODV路由协议(AODV Routing Protocol Based on Energy,Load and Speed,ELS-AODV)。ESC-AODV协议能够节约网络能量,提高可靠性,获得更优的网络性能。展开更多
Internet of Things(IoT)networks are characterized by a multitude of wireless,interconnected devices that can dynamically join or exit the network without centralized administration or fixed infrastructure for routing....Internet of Things(IoT)networks are characterized by a multitude of wireless,interconnected devices that can dynamically join or exit the network without centralized administration or fixed infrastructure for routing.While multipath routing in IoT networks can improve data transmission reliability and load balancing by establishing multiple paths between source and destination nodes,these networks are susceptible to security threats due to their wireless nature.Traditional security solutions developed for conventional networks are often ill-suited to the unique challenges posed by IoT environments.In response to these challenges,this paper proposes the integration of the Ad hoc On-demand Multipath Distance Vector(AOMDV)routing protocol with a trust model to enhance network performance.Key findings from this research demonstrate the successful fusion of AOMDV with a trust model,resulting in tangible improvements in network performance.The assessment of trustworthiness bolsters both security and routing capabilities in IoT networks.The trust model plays a crucial role in mitigating black hole attacks in IoT networks by evaluating the trustworthiness of nodes and helping in the identification and avoidance of malicious nodes that may act as black holes.Simulation results validate the efficacy of the proposed trust-based routing mechanism in achieving its objectives.Trust plays a pivotal role in decision-making and in the creation of secure distribution systems.By assessing the trustworthiness of nodes,both network security and routing efficiency can be enhanced.The effectiveness of the proposed trust-based routing mechanism is scrutinized through simulations,offering insights into its potential advantages in terms of improved network security and routing performance in the context of the IoT.展开更多
为了简化使用完美马尔科夫均衡方法可能引起的复杂计算过程,本文依据博弈论方法,提出一种平均场均衡的无线自组织网络路由协议(mean field equilibrium AODV,MFEA)。该方法要求每个节点利用所有其他节点的信息来分析自己的最优策略,而...为了简化使用完美马尔科夫均衡方法可能引起的复杂计算过程,本文依据博弈论方法,提出一种平均场均衡的无线自组织网络路由协议(mean field equilibrium AODV,MFEA)。该方法要求每个节点利用所有其他节点的信息来分析自己的最优策略,而不需要知道每一个局中人的信息,并且在足够大的局中人数目情况下性能更加近似马尔科夫均衡。仿真实验显示:提出的MFEA路由协议在包投递率、时延和归一化开销方面均优于AODV(Ad hoc on-demand distance vector routing)协议,在节点密集的无线自组织网络中仍可获得比较好效果。展开更多
针对G3标准电力线通信(G3-PLC)中6loWPAN Ad hoc距离矢量路由协议(LOAD)的路由发现的缺点,提出了基于邻居覆盖的概率重播路由发现算法。为了有效利用节点的邻居覆盖信息,提出了一种新的重播时延来决定重播RREQ的顺序,定义了路由代价用...针对G3标准电力线通信(G3-PLC)中6loWPAN Ad hoc距离矢量路由协议(LOAD)的路由发现的缺点,提出了基于邻居覆盖的概率重播路由发现算法。为了有效利用节点的邻居覆盖信息,提出了一种新的重播时延来决定重播RREQ的顺序,定义了路由代价用以指示链路质量。通过结合邻居覆盖信息与路由代价获得重播概率来决定是否重播RREQ消息。理论分析与仿真表明,该算法有效地减少了路由发现频率,提高了路由性能。展开更多
文摘Routing on ad-hoc network has become a major research issue among the networking communities due to its increasing complexity and the surge of challenging problems. One major factor contributing to this tendency is that every terminal of an ad-hoc network is also functioning as a network router. In this paper we provide a comprehensive review about the principles and mechanisms of routing protocols used in ad-hoc networks. For comparison purposes, we discuss some relevant technical issues of two well-known routing strategies, namely On-Demand (Proactive routing) and Table-Driven (Reactive routing). In particular, focus our attention on two major and well-known routing protocols: AODV (Ad-hoc On-Demand Distance Vector Protocol) and OLSR (Optimized Link State Routing Protocol). Our study has no intention to suggest any definite solution for any ad-hoc network, because it is the case depending on dictated by the nature and varying factors of networks. Instead, we demonstrate our major perception and describe general models that may assist us while modeling a given network.
基金Sponsored by the National Science and Technology Major Project(Grant No. 2010ZX03005-003)
文摘Due to highly dynamic topology caused by fast moving nodes the Vehicular ad-hoc network (VANET) results in the existence of transient communication links, which degrade the performance of developed protocols. Established routes frequently become stale, and existing communication flows are interrupted, incurring delay and additional overhead. In this paper we propose a novel hybrid routing protocol, which is the combined between of the table-driven routing and on-demand routing in VANET. It makes fast convergence in routing process, minimal drop links, making more reliable links, and adaptive with changing of VANET topology. With neighbor table is updated instantaneously, and using strong neighbor for routing process makes route discovery process start whenever it received requirement, and through using route mechanism appropriately it reduces significantly route overhead at each node. The simulation results illustrate the outstanding properties of our proposed routing protocol.
基金the National High Technology Research and Development Progamme of China(No2005AA123820)the National Natural Science Foundation of China(No60472052 and No10577007)
文摘In mobile ad hoc networks （MANETs）, if a mnltihop route breaks, route maintenance is typically performed to establish a new route which causes high control overhead and long packet delay. To decrease the time of recovery and the overhead of maintenance, a new route maintenance mechanism in which the maintenance is confined to the vicinity of the broken link is proposed. This mechanism patches broken route through some other nodes in which only nodes near the broken link（s） may need to be substituted and the rest of nodes can be retained on the route. The broken link can be repaired without considering its relative position in the whole path, so the abihty of dealing with hnk failure is improved obviously. Simulation results show that the proposed strategy improves network performance significantly, such as in merits of control overhead and packet delay.
基金The National High Technology Research and Development Program of China (863Program)(No2006AA01Z268)
文摘To cope with the problem of low protocol efficiency of the standard ad hoc on-demand distance vector （AODV） routing protocol with the periodic Hello message broadcast mechanism, a new link availability prediction based strategy is introduced to reduce the amount of Hello messages. In this strategy, a novel wireless link availability prediction model under line-of-sight （LOS） propagation environments is proposed based on which the parameter of Hello Interval in AODV can be dynamically adjusted to achieve the goal of changing the frequency of Hello message broadcasts under different link stability degrees. Simulation results demonstrate that, compared with the standard AODV with the periodic Hello message broadcast mechanism, the proposed protocol effectively reduces unnecessary control message overhead and greatly improves the performance in terms of end-to-end delay and efficiency.
文摘针对群组机器人系统在应急场景下移动频繁、能量有限的特点,提出了一种基于能量与速度的分簇自组织按需距离矢量协议(Clustered Ad hoc On-Demand Distance Vector Protocol Based on Energy and Speed,ESC-AODV),以延长群组机器人网络运行时间,提高通信可靠性。用路由性能代替跳数作为路由判据,目的节点在重复接收到路由请求(Route Request,RREQ)数据包时,若路由性能更小,则回复路由应答(Routing Reply,RREP)数据包,以此选择更好的路由,引入分簇结构,通过簇头和网关组成的骨干网络减少广播洪泛次数。实验结果证明,节点数量多时,改进的ESC-AODV协议在延长网络生存时间的同时,平均端到端时延、数据包投递率、吞吐量和路由开销均优于AODV以及基于能量、负载和速度的AODV路由协议(AODV Routing Protocol Based on Energy,Load and Speed,ELS-AODV)。ESC-AODV协议能够节约网络能量,提高可靠性,获得更优的网络性能。
文摘Internet of Things(IoT)networks are characterized by a multitude of wireless,interconnected devices that can dynamically join or exit the network without centralized administration or fixed infrastructure for routing.While multipath routing in IoT networks can improve data transmission reliability and load balancing by establishing multiple paths between source and destination nodes,these networks are susceptible to security threats due to their wireless nature.Traditional security solutions developed for conventional networks are often ill-suited to the unique challenges posed by IoT environments.In response to these challenges,this paper proposes the integration of the Ad hoc On-demand Multipath Distance Vector(AOMDV)routing protocol with a trust model to enhance network performance.Key findings from this research demonstrate the successful fusion of AOMDV with a trust model,resulting in tangible improvements in network performance.The assessment of trustworthiness bolsters both security and routing capabilities in IoT networks.The trust model plays a crucial role in mitigating black hole attacks in IoT networks by evaluating the trustworthiness of nodes and helping in the identification and avoidance of malicious nodes that may act as black holes.Simulation results validate the efficacy of the proposed trust-based routing mechanism in achieving its objectives.Trust plays a pivotal role in decision-making and in the creation of secure distribution systems.By assessing the trustworthiness of nodes,both network security and routing efficiency can be enhanced.The effectiveness of the proposed trust-based routing mechanism is scrutinized through simulations,offering insights into its potential advantages in terms of improved network security and routing performance in the context of the IoT.
文摘为了简化使用完美马尔科夫均衡方法可能引起的复杂计算过程,本文依据博弈论方法,提出一种平均场均衡的无线自组织网络路由协议(mean field equilibrium AODV,MFEA)。该方法要求每个节点利用所有其他节点的信息来分析自己的最优策略,而不需要知道每一个局中人的信息,并且在足够大的局中人数目情况下性能更加近似马尔科夫均衡。仿真实验显示:提出的MFEA路由协议在包投递率、时延和归一化开销方面均优于AODV(Ad hoc on-demand distance vector routing)协议,在节点密集的无线自组织网络中仍可获得比较好效果。
文摘针对G3标准电力线通信(G3-PLC)中6loWPAN Ad hoc距离矢量路由协议(LOAD)的路由发现的缺点,提出了基于邻居覆盖的概率重播路由发现算法。为了有效利用节点的邻居覆盖信息,提出了一种新的重播时延来决定重播RREQ的顺序,定义了路由代价用以指示链路质量。通过结合邻居覆盖信息与路由代价获得重播概率来决定是否重播RREQ消息。理论分析与仿真表明,该算法有效地减少了路由发现频率,提高了路由性能。
