当前位置: X-MOL 学术Peer-to-Peer Netw. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Volunteer nodes of ant colony optimization routing for minimizing delay in peer to peer MANETs
Peer-to-Peer Networking and Applications ( IF 3.3 ) Pub Date : 2019-06-21 , DOI: 10.1007/s12083-019-00772-w
N. Noor Alleema , D. Siva Kumar

A Mobile ad hoc Network (MANET) is an infrastructure less network that permits nodes to make a wireless network with mobility. In MANETs, the node linkages breaks are frequent due to all nodes are in movement. When neighbor nodes travel out of other node communication range connection among both mobile nodes breaks. Thus it makes delay and packet loss in the network. In the present Traffic Control method, several times, since the highest traffic, heavy rain, accidents, or other reasons, there may be probabilities of jam on roads. Thus, people could get delay owing to the highest traffic. Therefore, it is highly preferred to have an effective way to track the traffic on roads and thus select the suitable road that is traffic free. To resolve these problems, the volunteer Nodes of Ant Colony Optimization Routing (VNACO) is proposed. The primary objective of VNACO is to reduce both the delay and routing overhead in Peer to Peer (P2P) MANETs. Here, peer node act as a volunteer node and mobile node for transmitting data from source to destination. During data transmission, the relay node moving out of communication range when the volunteer node overheard the dropped data packet then deliver the data to the corresponding relay node. As a result, minimizes both the delay and packet losses. In VNACO, the volunteer’s nodes are elected based on node aptitude. Node aptitude is calculated by iterating node connectivity, transmission processing time, node energy and available bandwidth. In addition, an ant colony optimization algorithm to finds the optimal route and reduce the routing overhead in P2P MANETs. The significant application of this mechanism is utilized for the traffic management system. Network simulation results indicate that the VNACO mechanism is minimizing 22% delay and reducing 14% packet losses compared to the baseline protocol.

中文翻译:

蚁群优化路由的志愿者节点,用于最小化对等MANET中的延迟

移动自组织网络(MANET)是一种无基础结构的网络,它允许节点建立具有移动性的无线网络。在MANET中,由于所有节点都在运动,因此节点链接断开频繁。当邻居节点离开其他节点时,两个移动节点之间的连接中断。因此,它在网络中造成延迟和数据包丢失。在当前的交通控制方法中,由于交通量最大,大雨,事故或其他原因,几次,道路上可能会发生堵塞。因此,由于流量最高,人们可能会延迟。因此,高度优选的是具有一种有效的方式来跟踪道路上的交通并因此选择无交通的合适道路。为了解决这些问题,提出了蚁群优化路由的自愿节点。VNACO的主要目标是减少点对点(P2P)MANET中的延迟和路由开销。在此,对等节点充当志愿者节点和移动节点,用于将数据从源传输到目的地。在数据传输期间,当志愿者节点窃听丢失的数据包时,中继节点移出通信范围,然后将数据传递到相应的中继节点。结果,最小化了延迟和分组丢失。在VNACO中,志愿者的节点是根据节点的能力选出的。节点适应性是通过迭代节点连接性,传输处理时间,节点能量和可用带宽来计算的。另外,蚁群优化算法可以找到最佳路由并减少P2P MANET中的路由开销。该机制的重要应用被用于交通管理系统。网络仿真结果表明,与基准协议相比,VNACO机制可最大程度地减少22%的延迟并减少14%的数据包丢失。
更新日期:2019-06-21
down
wechat
bug