Improvement of the SARA strategies for MANET model
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2012, Vol 1, Issue 6
Abstract
Wireless ad-hoc networks are autonomous systems composed of mobile hosts that are free to move around arbitrarily. Routing is difficult in MANET’s since mobility may cause radio links to break frequently. When any link of a path breaks, this path needs to be either repaired by finding another link if any or replaced with a new path. To reduce rerouting operation, selecting an optimal path in such networks should consider both path reliability and energy efficiency. End-to-end reliability is used to reflect the probability of sending data successfully from the source to destination node. In existing system ACO frame work named Simple Ant Routing Algorithm(SARA) used to reduce the overhead, by using a new route discovery technique, based on the concept of Control Neighbor Broadcast (CNB). The CNB allows SARA to control the control packets flooding level in the network. This flooding mechanism as the disadvantage of increase the time required to discover a route. It lacks an efficient support of MANETs, as they require the use of a significant amount of control information during the route discovery process. The network capability to maintain the routes decreases. In high mobility scenarios it decrease SARA’s performance and increase the overhead. The Dynamic Source Routing (DSR) plays a prominent role in source routing, where reliability and energy efficiency plays an important role in the performance of routing in MANET”. A bio inspired algorithm dynamic source routing has been designed to enhance dynamic source routing based on the integration of ant colony and bee colony optimization techniques. The route discovery process is done by applying ACO and BCO by calculating threshold value based on energy consumed by each intermediate node and pheromone value. The path with minimum threshold and maximum pheromone is chosen as the best path and the path is considered for sending data packets the results show that the energy consumed by BeeDSR is less, PDR is high and delay is reduced
Authors and Affiliations
M. HARATHI , R. RAJA SEKHAR
Keywords
Related Articles
- EP ID EP141353
- DOI -
- Views 97
- Downloads 0
A SURVEY ON CONTENT BASED IMAGE RETRIEVAL SYSTEM
Image mining is a vital technique which is used to mine knowledge from image. This is simply an expansion of data mining. The function of image mining is to retrieve similar image from huge database. The developm...
Bandwidth and Energy Management in Wireless Sensor Networks
The emergence of sensor networks as one of the dominant technology trends in the coming decades has posed numerous problems regarding the Quality of Service (QoS) parameter to researchers. These QoS parameters are...
A Statistical Approach to Classify and Identify DDoS Attacks using UCLA Dataset
Nowadays, Internet is the most well-known and popular thing that is widely used by human beings. It is also an essential part of human life and provides the best and fast communication medium. As many people widely used...
GClustering Algorithm
—Graph clustering poses significant challenges because of the complex structures which may be present in the underlying data. The massive size of the underlying graph makes explicit structural enumeration very diff...
A Cost Effective Scaling Approach for Cloud Applications
Cloud computing is becoming an increasingly popular enterprise model in which computing resources are made available on-demand to the user as needed. In IT services the demand is not fixed and not predictable, henc...