...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Engineering Research and Applications >Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile Adhoc Networks
【24h】

Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile Adhoc Networks

机译：

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with infrastructure less environment to establish a data transmission between nodes within the network. A routing protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the cooperative transmission. In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination. Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are available at the transmitters. The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n) where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET (O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in the network use the components proactive routing protocol, forwarder list update and local re-transmission. We evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).

著录项

相似文献

  • 外文文献
  • 中文文献
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号