Search

Route stability and energy capacity of mobile nodes are the main challenging tasks in mobile ad hoc networks (MANETs) due to frequent network topology changes and limited energy resources of nodes in the network. This leads to link failures and excessive redundant traffic across the network which consumes high energy and reduces the performance of routing protocols. Therefore, different techniques are considered to deal with challenges that occur by mobility and energy failures of nodes in MANETs. This paper proposes a new routing algorithm to construct the optimal path by combining the concept of ant colony optimization (ACO) and ad hoc on-demand vector (AODV) routing protocol. The proposed routing algorithm effectively reduces the energy consumption and enhances the performance of conventional AODV protocol under different traffic loads by selecting a more stable and reliable route between source and destination nodes, using pheromone values. Node metrics such as residual energy, drain rate energy, number of hop counts, and speed of a node are considered to calculate pheromone values during the route discovery operations. These metrics play an important role to find a more stable and reliable route in MANET. The optimal path with energy efficient nodes are selected to maintain the stability, reliability, and improve the network lifetime. The experimental results demonstrate that the proposed routing algorithm significantly outperforms conventional AODV routing protocol in terms of packet delivery ratio, throughput, average end-to-end delay, packet loss ratio, and network lifetime. [ABSTRACT FROM AUTHOR]

In this brief, a generalized form for 2-, 4-, and 8-D coordinate rotation digital computer (CORDIC) rotation matrices is suggested, and a novel highly parallel efficient hardware-oriented 8-D octonion CORDIC algorithm for quaternion-valued matrix decomposition is designed and presented. Furthermore, a successful sequence of iterations with guaranteed convergence is determined, and the hardware implementation of this algorithm is considered. Such a processor can be utilized to speed up the Givens rotations and computing the QR and singular-value decomposition processes of a quaternion matrix in a digital signal processor. [ABSTRACT FROM PUBLISHER]

A correction to the article "Fuzzy approach to improving route stability of the AODV routing protocol" that was published in the previous issue, is presented.