首页    期刊浏览 2024年09月21日 星期六
登录注册

文章基本信息

  • 标题:Improvement of the SARA strategies for MANET model
  • 本地全文:下载
  • 作者:M. HARATHI ; R.RAJA SEKHAR
  • 期刊名称:International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
  • 印刷版ISSN:2278-1323
  • 出版年度:2012
  • 卷号:1
  • 期号:6
  • 页码:246-251
  • 出版社:Shri Pannalal Research Institute of Technolgy
  • 摘要: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.
  • 关键词:ad-hoc networks; Dynamic Source Routing; Control ; Neighbor Broadcast; and ACO frame work; BeeDSR
国家哲学社会科学文献中心版权所有