Leader election in the presence of n-1 initial failures
Information Processing Letters
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
A Matrix-Based Fast Calculation Algorithm for Estimating Network Capacity of MANETs
ICW '05 Proceedings of the 2005 Systems Communications
A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Cost metric algorithm for transit routing in MANETs with internet connectivity
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
Centrality measurement on semantically multiplex social networks: divide-and-conquer approach
International Journal of Intelligent Information and Database Systems
A reverse AODV routing protocol in ad hoc mobile networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
An agent-assisted QoS-based routing algorithm for wireless sensor networks
Journal of Network and Computer Applications
A resource reuse method in cluster sensor networks in ad hoc networks
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
AGRIB-BHF: A sustainable and fault tolerant aggregation
Journal of Network and Computer Applications
Hi-index | 0.00 |
Wireless ad hoc networks do not rely on an existing infrastructure. They are organized as a network with nodes that act as hosts and routers to treat packets. With their frequent changes in topology, ad hoc networks do not rely on the same routing methods as for pre-established wired networks; they require routing methods for mobile wireless networks. To select a path from a source to a destination in dynamic ad hoc networks, an efficient and reliable routing method is very important. In this paper, we introduce a cost-matrix-based routing algorithm. An agent node creates topology information in the form of the adjacency-cost matrix which shows link costs of the network.Based on the adjacency-cost matrix, the minimum-cost matrix and the next-node matrices can be calculated. Based on the minimum-cost matrix and the next-node matrices, the minimum cost between source and destination nodes and between intermediate nodes on the minimum-cost paths can be calculated. The matrices are periodically distributed by the agent to the other nodes. Based on the minimum-cost matrix and the next-node matrices, each node decides the minimum-cost path to its destination. Because none of the nodes except the agent needs to gather network topology information, the control overhead of the proposed method is small compared with those of the general table-driven routing protocols.