Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 30 August 2012

Multicost Routing Approach in Wireless Ad hoc Networks

D. Loganathan1 & P. Ramamoorthy1

Journal of Computer Science, Volume 8, Issue 10, pp. 1739–1748 · doi.org/10.3844/jcssp.2012.1739.1748

6,737 accesses4,698 downloads0 citations (Crossref)Metrics
Cite Check for updates

Abstract

Problem statement: A Wireless ad hoc network is a collection of autonomous movable nodes that communicate with each other over wireless links without any static infrastructure. In these networks there is no fixed topology because of the mobility of nodes, interference, multipath propagation and path loss. A variety of routing protocols and algorithm with varying network settings are analyzed to link between the nodes and communicate packets to their destinations. Most of these algorithms are single cost, in the logic that they consign a scalar cost parameter to every link and compute the path that has minimum cost. Although multicost routing, a vector of cost parameters is consigned to each link and the cost vector of a path is well-defined based on the cost vectors of the links that embrace it. Adjustable transmission power control of the nodes with multi cost routing algorithm can support optimizeto acquire the reduced interference and improve the ad hoc network performance. Approach: The link and path of the wireless network is consigned with several cost parameters. Hop count, total interference, node link delay, residual energy of a node and the node transmission power are the cost parameters assigned for link and path of the ad hoc networks. Multicost parameters are combined in different optimization function with respect to various routing algorithm. Results: Simulation and optimization shows multicost SUM/MIN Energy-Interference algorithm with variable transmission power can lead to decrease the interference and improves the overall network performance. Conclusion: The function optimized for wireless ad hoc networks that the Multicost SUM/MIN Energy-Interference algorithm achieves improved performance over than the single cost algorithm.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2012 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Loganathan, D. & Ramamoorthy, P. (2012). Multicost Routing Approach in Wireless Ad hoc Networks. Journal of Computer Science, 8(10), 1739–1748. https://doi.org/10.3844/jcssp.2012.1739.1748

Licence
© Science Publications
Issue
Volume 8, Issue 10
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Multicost Routing Approach in Wireless Ad hoc NetworksJournal of Computer Science · Volume 8, Issue 10 · pp. 1739–1748 · © Science PublicationsDownload