Preventing the impact of selfish behavior under MANET using Neighbor Credit Value based AODV routing algorithm

Mobile Ad hoc Network (MANET) nodes exchange information using the multi-hop wireless communications without the need for any pre-existing infrastructure. Routing protocols of MANET are designed with an assumption that the nodes will cooperate in routing process. To achieve high throughput and reliable communication, the nodes are expected to cooperate with each other. Routing protocol plays a crucial role in an effective communication between nodes and operates on the assumption that the nodes are fully cooperative. Due to the open structure and limited battery-based energy in MANET, some nodes may not cooperate correctly or behave maliciously and such kind of misbehavior impacts the fairness, reliability and efficiency in MANET. Previous work addressed the ways to overcome these kinds of node misbehaviors and attacks. Most of the existing works need time to analyse the neighbor traffic and decide whether a neighbor is behaving maliciously or not. Further, the existing credit-based detection mechanisms may mark a genuine idle node as a malicious node. This work addresses a simple Neighbor Credit Value based AODV (NCV-AODV) routing algorithm for the detection of selfish behavior which avoids such false detection. The proposed idea is implemented in Ad hoc On Demand Distance Vector (AODV) routing protocol and an extensive analysis on the performance of the proposed detection mechanism against the selfish behavior of some MANET nodes are conducted.     

基于Ad hoc无线网络的AODV路由协议仿真

利用以Ubuntu为平台的NS2网络仿真器,对AODV路由协议进行仿真.通过分析不同仿真场景的仿真数据,绘制出相应的仿真结果对比图,并对AODV路由协议进行了性能分析.仿真结果表明,在数据流不断增加的情况下,网络平均吞吐量、归一化路由开销以及端到端平均时延等性能指标会相应下降,得出了AODV路由协议适合于中小规模且发包率不高的网络场合的结论.     

Compatibility of TCP Reno and TCP Vegas in wireless ad hoc networks

Previous work has shown that TCP (transmission control protocol) Vegas outperforms the more widely deployed TCP Reno in both wired and wireless networks. It was also shown that when both TCP variants coexist on the same wired links, Reno dominates because of its more aggressive behaviour. This paper examines for the first time the compatibility between Reno and Vegas in wireless IEEE 802.11 ad hoc networks. It is shown that Vegas generally dominates in the heterogeneous Reno/Vegas network scenario; a startling result that is inconsistent with what is seen in wired networks. It is shown that the wireless ad hoc network environment does not reward the aggressive behaviour of Reno. On the other hand, Vegas, with its more accurate yet more conservative mechanisms, is able to capture most of the bandwidth. This is found to be true when using the on-demand routing protocols of dynamic source routing (DSR) or ad hoc on-demand distance vector (AODV): the failure of a node to reach a next-hop node because of media access control (MAC)-sublayer repeated collisions is reported to the routing protocol, which then declares a route error that impacts Reno in a more serious way than Vegas. When the table-driven routing protocol destination-sequenced distance vector (DSDV) is used, Reno and Vegas share the network bandwidth in a fairer manner. Generally, fairness in this environment can be improved by reducing the TCP maximum window size.     

Secure and Optimal LOADng Routing for IoT with Composite Routing Metric

Security is the one of the major challenges for routing the data between the source and destination in an Internet of Things (IoT) network. To overcome this challenge, a secure Lightweight On-demand Ad hoc Distance-vector—Next Generation (LOADng) Routing Protocol is proposed in this paper. As the LOADng protocol is the second version of Ad Hoc On-Demand Distance Vector (AODV) protocol, it retains most of the basic functionality and characteristics of AODV. During the route discovery process, the cyclic shift transposition algorithm (CSTA) is used to encrypt the control packets of the LOADng protocol to improve its security. CSTA approach only derives transposition and substitution without product cipher with respect to input data. Besides this, for choosing the best probable path between the source and destination, routing metrics such as link quality Indicator (LQI), hop count (HC) and queue length (QL) are included in the control packets. The data is then securely sent using CSTA using the optimal secure path selected. Experimental Results depict that the proposed secure and optimal LOADng (SO-LOADng) using CSTA encryption obtains better throughput, delivery ratio encryption time and decryption time than the existing state-of-art approaches.     

一种新的基于移动预测的MANET路由协议

移动自组网是一种由一系列可以自由移动的节点主机聚集而成的一个临时性动态网络。它没有固定基站，也没有作为控制管理中心的节点主机，由于其拓扑的动态性，其路由协议与其他传统网络有很大的区别。为了能更有效地移动自组网中实现数据的传送，本文提出了一种基于移动预测下的MANET路由协议，该协议综合考虑了传输路径的延时和稳定性，选择在延时限制下平均拥有最稳特性的传输路径，模拟结果表明，这种方法比基于移动预测量稳路径路由协议的传输时延要短，传送成功概率要高，而控制开销却相关不大。     

Energy Efficient Ambience Awake Routing with OpenFlow Approach

A major problem in networking has always been energy consumption. Battery life is one parameter which could help improve Energy Efficiency. Existing research on wireless networking stresses on reducing signaling messages or time required for data transfer for addressing energy consumption issues. Routing or Forwarding packets in a network between the network elements like routers, switches, wireless access points, etc., is complex in conventional networks. With the advent of Software Defined Networking (SDN) for 5G network architectures, the distributed networking has embarked onto centralized networking, wherein the SDN Controller is responsible for decision making. The controller pushes its decision onto the network elements with the help of a control plane protocol termed OpenFlow. Decentralized networks have been largely in use because of their ease in physical and logically setting the administrative hierarchies. The centralized controller deals with the policy funding and the protocols used for routing procedures are designated by the decentralized controller. Ambience Awake is a location centered routing protocol deployed in the 5G network architecture with OpenFlow model. The Ambience Awake mechanism relies on the power consumption of the network elements during the packet transmission for unicast and multicast scenarios. The signalling load and the routing overhead witnessed an improvement of 30% during the routing procedure. The proposed routing mechanism run on the top of the decentralized SDN controller proves to be 19.59% more efficient than the existing routing solutions.     

On physical layer-oriented routing with power control in ad hoc wireless networks

Routing in ad hoc wireless networks does not simply consist in finding a route with shortest length (as in wired networks with virtually error-free communication links), but it requires the creation of a stable and good quality communication route to avoid any unnecessary packet loss. In this paper,we discuss physical layer-oriented routing in ad hoc wireless networks, and we analyse the potential advantages of combining the use of power control (PC) with the chosen routing strategy. More precisely, we propose a modified ad hoc on-demand distance vector (MAODV) routing protocol, with and without PC, derived from the AODV-routing protocol by considering the bit error rate at the end of a multi-hop path as the metric to be minimised for route selection. In other words, we consider routing with a physical layer-oriented quality of service criterion, and we analyse the system performance in scenarios with either strong line-of-sight (LOS) or shadowed communications. Although in a scenario with strong LOS communications there are a few cases where the MAODV-PC protocol offers the best performance, in the presence of shadowed communications the proposed physical layer-oriented strategy is not attractive.     

A comparative QoS survey of mobile ad hoc network routing protocols

A mobile ad hoc network (MANET) is a wireless, dynamic, infrastructure-less, self-organized, multi-hop, and decentralized network. Each node in MANET can act as a router as well as a work station. Many routing protocols have been developed to increase the efficiency of MANET. The primary objective of this paper is a detailed QoS comparison of reactive (AODV), proactive (DSDV), and hybrid (ZRP) routing protocols of MANET in order to find which routing protocol works best in a particular network scenario. The analysis was made for TCP-based traffic patterns. The performance differentials were analyzed on the basis of normalized routing overhead, packet loss, packet delivery ratio, control packets, end-to-end delay, packet received, and packet sent with a variation of nodes density and mobility. The results were obtained using the NS-2 simulator.     

AODV协议在无线传感器网络中的应用

通过对无线传感器网络（Wireless Sensor Network,WSN）和AODV路由协议的特性进行分析,认为AODV协议（Ad—hoc On—Demand Distance Vector Routing）具有在无线传感器网络中应用的可行性,只是在网络能量效率方面考虑不多．本文详细给出了改进方案,利用协议头中原有的保留选项来存储平均路径能量,选路时采用最小路由最大路径能量策略,同时增加转发RREQ和发送RREP的延迟时间．用NS-2软件对改进后方案从吞吐量、延时、剩余能量等角度进行仿真,结果证明该方案可行．     

EAMTR: energy aware multi-tree routing for wireless sensor networks

IEEE 802.15.4 is the prevailing standard for low-rate wireless personal area networks. It specifies the physical layer and medium access control sub-layer. Some emerging standards such as ZigBee define the network layer on top of these lower levels to support routing and multi-hop communication. Tree routing is a favourable basis for ZigBee routing because of its simplicity and limited use of resources. However, in data collection systems that are based on spanning trees rooted at a sink node, non-optimal route selection, congestion and uneven distribution of traffic in tree routing can adversely contribute to network performance and lifetime. The imbalance in workload can result in hotspot problems and early energy depletion of specific nodes that are normally the crucial routers of the network. The authors propose a novel light-weight routing protocol, energy aware multi-tree routing (EAMTR) protocol, to balance the workload of data gathering and alleviate the hotspot and single points of failure problems for high-density sink-type networks. In this scheme, multiple trees are formed in the initialisation phase and according to network traffic, each node selects the least congested route to the root node. The results of simulation and performance evaluation of EAMTR show significant improvement in network lifetime and traffic distribution.     

基于局部位置更新的无线传感器网络路由协议

提出了在具有移动基站的无线传感器网络中的一种新的路由协议,该协议在基站移动时只需要在一个小的区域内更新基站的位置信息,因此既节省了传感器节点的能量,又使基站在移动过程中仍可保持与传感器节点的持续通信.理论分析和模拟研究表明,与全局更新基站位置信息的路由协议相比,该协议降低了基站位置信息更新的代价,减少了无线信道的冲突概率,减少了延迟,可适用于对延迟要求较高的大规模无线传感器网络.     

Link stability and mobility in ad hoc wireless networks

The fact that ad hoc networks are required to support mobility of individual network nodes results in problems arising when routing data. These problems include route loss, poor longevity of established routes and asymmetric communications links. Mobility of nodes also increases the control traffic overhead and affects the performance of the protocol. Mobility can, however, be exploited to improve route longevity when establishing the route. In some situations, the source of information is not available (e.g. GPS information in the underground), hence protocols relying on this information will fail to operate correctly. In such situations, alternative `self-content' information should be available to perform the needed task of routing. Three novel schemes that make use of such information, the heading direction angle, to provide a mechanism for establishing and maintaining robust and long-lived routes are presented. The results show that these schemes reduce the overhead and increase the route longevity when compared with the AODV protocol. The schemes described can operate as a standalone mechanism or can be adopted by other routing protocols in order to improve their performance.     

一种改进的传感器网络分簇分层路由协议

在分析了无线传感器网络中传统的LEACH和LEACH-C路由协议基础上,结合MTE路由协议思想,提出了一种新的改进型分簇分层路由协议(improved clustering hierarchical routing protocol,ICH).文中簇首节点可以采用多跳方式传输数据包,且在选择中继节点时考虑节点剩余能量,对进入下一轮的条件进行了限制.实验表明,改进后的ICH协议的节点存活率比LEACH-C好.     

无线传感器网络的流量自适应分簇算法协议

在分析LEACH路由协议算法的缺点的基础上,提出了一种用于无线传感器网络的基于流量自适应的TDMA分簇算法协议.该协议根据当前节点数据流量的变化,自适应地调整该节点在其簇内通信的时隙长度,减少节点空闲时消耗的能量和节点从睡眠到活跃状态来回切换的能量.仿真实验结果表明,与LEACH协议簇内时隙分配算法相比,运用这种新的时隙分配算法,可以节省节点的能量,提高网络的生存时间,改善网络性能.     

Directional routing protocols for ad-hoc networks

A directional routing approach for multihop ad-hoc networks, is presented which has been applied to two on-demand routing protocols: namely dynamic source routing (DSR) and ad-hoc on-demand distance vector routing (AODV). Both DSR-based and AODV-based directional routing protocols are designed to balance the tradeoff between co-channel interferences from nodes hops away and the total power consumed by all the nodes. In order to select the best route, three metrics are considered in the route discovery process. They consist of hop count, power budget and overlaps between adjacent beams. By exploiting the direction of directional antennas, both routing protocols are capable of reducing overlaps between beams of the nodes along the route, thus eliminating interference. Arbitrary networks and random networks are considered in the simulations. The results show considerable performance gains for transmission of real-time traffic over ad hoc networks.     

基于DSP的智能家居无线网络节点的设计

 将无线传感器网络技术融入智能家居系统中,设计合理的网络节点成为智能家居系统的核心问题．在分析无线传感器网络节点结构基础上,提出以DSP 芯片TMS320F206为处理器、AT86RF230为无线通信芯片的无线传感器网络节点．充分考虑节能和扩展性的需求,采用节点定时打开与关闭的协议且打开与关闭的时间比为1∶99．试验表明该无线网络节点能满足低功耗、长传输距离、准确定位、抗干扰的要求．     

基于位置信息的水声传感器网络路由协议

由于水下环境与地面环境不同,无线传感器网络中的协议不能直接应用于水下传感器网络中。针对水下环境的特点,提出了一种适用于水下传感器网络的路由协议。它是一种可扩展的、能量高效的路由协议。仿真结果显示:网络节点的移动速率不是很大时,该协议具有能量利用率高、数据传输成功率高和传输延时低等优点。     

ACO–EEOLSR: enhanced energy model based link stability routing protocol in mobile ad hoc networks

A mobile ad hoc network (MANET) has abundant mobile nodes that are free to communicate independently in many locations. Many existing energy models address the inadequacy of resources based on Ad hoc On-demand Multipath Distance Vector and Optimized Link State Protocol (OLSP) routing protocols for MANET along with various parameters. The architecture of energy-efficient routing mechanisms is a challenging problem in a MANET. In this work, a novel energy-aware routing model is introduced for MANET comprising an ant colony optimization (ACO) enhanced approach to energy-efficient-optimized link state routing (named ACO–EEOLSR). Initially, the route discovery is progressed by means of neighbor estimation and also with the authentication of link stability. Parameters such as energy, distance, and hop count are employed as willingness nodes, where both the energy and distance are entrenched through the OLSP. Consequently, the hop count is applied via the ACO system that is beneficial for link stability. After the acceptance of an acknowledgement, the hop count is authorized for further performance analysis. This approach increases the Quality of Service and also uses less energy compared to other energy models. The accomplished simulation upshot depicts that the ACO–EEOLSR outperforms the EEOLSR scheme with respect to the performance metrics of energy consumption, packet delivery ratio, total remaining time, average network lifetime, and a variance of energy.     

Genetic based optimization for multicast routing algorithm for MANET

Mobile Ad hoc Network (MANET) is established for a limited period, for special extemporaneous services related to mobile applications. This ad hoc network is set up for a limited period, in environments that change with the application. While in Internet the TCP/IP protocol suite supports a wide range of application, in MANETs protocols are tuned to specific customer/application. Multicasting is emerging as a popular communication format where the same packet is sent to multiple nodes in a network. Routing in multicasting involves maintaining routes and finding new node locations in a group and is NP-complete due to the dynamic nature of the network. In this paper, a Hybrid Genetic Based Optimization for Multicast Routing algorithm is proposed. The proposed algorithm uses the best features of Genetic Algorithm (GA) and particle swarm optimization (PSO) to improve the solution. Simulations were conducted by varying number of mobile nodes and results compared with Multicast AODV (MAODV) protocol, PSO based and GA based solution. The proposed optimization improves jitter, end to end delay and Packet Delivery Ratio (PDR) with faster convergence.     

自组网中一种基于跨层负载感知的蚁群优化路由协议

将蚁群优化和跨层优化方法结合起来,提出了一种基于跨层负载感知和蚁群优化的路由协议(CLAOR)。协议将整个路径中各节点MAC层的总平均估计时延和节点队列缓存的占用情况结合起来,共同作为路由选择和路由调整的重要度量标准进行按需路由发现和维护,通过拥塞节点丢弃蚂蚁分组以及借助部分兼具蚂蚁功能的数据分组实现正常路由表的维护等方法,减少了控制开销,增加了算法的可扩展性,较好地解决了自组网中现有基于蚁群优化的路由协议中普遍存在的拥塞问题、捷径问题和引入的路由开销问题。仿真结果表明,CLAOR在分组成功递交率、路由开销以及端到端平均时延等方面具有优良性能,能很好地实现网络中的业务流负载均衡。