
	Information Technology Journal
	Year: 2010 \| Volume: 9 \| Issue: 3 \| Page No.: 506-511 DOI: 10.3923/itj.2010.506.511

A Security Routing Optimization Scheme for Multi-hop Wireless Networks

Du Jun and Li Wei-Hua

Abstract: Selfish nodes and malicious nodes in large-scale ad hoc networks lead to poor performance and even paralyze the network. How to dismiss these nodes from routing table is important to improve the network security. In this study, a security aware routing optimization algorithm named SARO is proposed to achieve this. The SARO is an improvement to ant optimization. It utilizes reputations from a reputation system to derive the pheromone trail refresh process and visible functions. Abnormal nodes are discarded from routing tables and packets are routed along paths with least abnormal nodes. The SARO is a security enhancement to routing protocols, which can both improve security of network and enhance the network performance.

PDF Fulltext XML References Citation Report Citation

RELATED ARTICLES:

•	Research on the Repeater Optimization Design in the Wireless Senor Networks Based on Voronoi Algorithm

•	UC Secure Network Coding Against Pollution Attacks

•	Crossover Router Based Handoff Scheme for Path Reservation in Hierarchical Mobile Network

•	Impact of Data Privacy and Confidentiality on Developing Telemedicine Applications: A Review Participates Opinion and Expert Concerns

How to cite this article:

Du Jun and Li Wei-Hua, 2010. A Security Routing Optimization Scheme for Multi-hop Wireless Networks. Information Technology Journal, 9: 506-511.

DOI: 10.3923/itj.2010.506.511

URL: https://scialert.net/abstract/?doi=itj.2010.506.511

COMMENT ON THIS PAPER

Navigation


		Online First
		Current Issue
		Previous Issues
		Editorial Board
		Submit a Manuscript
		Guide to Authors
		Subscribe to E-alerts

Indexed In


		ASCI-Database
		Asian Digital Library
		Google Scholar

Science Alert