A cost matrix agent for shortest path routing in ad hoc networks

Title
A cost matrix agent for shortest path routing in ad hoc networks
Author(s)
김종근우매리[우매리]
Keywords
LEADER ELECTION
Issue Date
201008
Publisher
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
Citation
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, v.35, no.6, pp.646 - 652
Abstract
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. (C) 2010 Elsevier Ltd. All rights reserved.
URI
http://hdl.handle.net/YU.REPOSITORY/23860http://dx.doi.org/10.1016/j.jnca.2010.03.013
ISSN
1084-8045
Appears in Collections:
공과대학 > 컴퓨터공학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE