淡江大學機構典藏:Item 987654321/89071
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3987862      在线人数 : 595
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/89071


    题名: Energy-Efficient Ant-Colony-Based Routing Algorithm for the MANETs
    作者: Liu, Fong-Hao;Lo, Hsiang-Fu;Juan, Sheng Chieh;Lee, Wei-Tsong;Liao, Jen-chi
    贡献者: 淡江大學電機工程學系
    关键词: Swarm intelligence;Ant colony optimization;Adaptive routing;Power-Aware routing
    日期: 2013-01-01
    上传时间: 2013-05-08 23:50:07 (UTC+8)
    出版者: 花蓮縣:臺灣學術網路管理委員會
    摘要: Routing in MANET is a challenging problem as a result of highly dynamic topology as well as bandwidth and energy constraints. Many researchers have developed different routing protocols at network layer which have considered transmission power, residual battery capacity and self-organization while routing data packets to the destination. Swarm intelligence such as ants can find a shortest path when they work collectively as a group. The main focus of this work is to develop an energy-efficient swarm routing algorithm called Energy-efficient Ant-colony-based Routing Algorithm (EARA) for the MANETs. We have compared traditional Ad hoc On-Demand Distance Vector (AODV) with EARA in terms of the node lifetime and throughput. The simulation results show that EARA has around 7% increase in average packet delivery ratio than AODV under different mobility speed indicating that it explores other optimal routes to improve the total efficiency.
    關聯: 網際網路技術學刊=Journal of Internet Technology 14(1),頁21-30
    DOI: 10.6138/JIT.2013.14.1.03
    显示于类别:[電機工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML323检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈