检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陶军[1] 刘莹[1] 肖鹏[1] 朱利旻[1] 陈文强[1]
机构地区:[1]东南大学教育部计算机网络和信息集成重点实验室,南京210096
出 处:《Journal of Southeast University(English Edition)》2013年第3期252-258,共7页东南大学学报(英文版)
基 金:The National Basic Research Program of China(973 Program)(No.2009CB320501);the National Natural Science Foundation of China(No.61370209,61272532);the Natural Science Foundation of Jiangsu Province(No.BK2010414,BK2011335)
摘 要:In order to save the energy and reduce the latency of the end-to-end transmission in mobile ad hoc networks an adaptive and distance-driven power control ADPC scheme is proposed by means of distance research in random geometrics. Through mathematical proof the optimal number of relay nodes and the optimal location of each node for data transmission can be obtained when a distance is given.In the ADPC first the source node computes the optimal number and the sites of the relay nodes between the source and the destination nodes.Then it searches feasible relay nodes around the optimal virtual relay-sites and selects one link with the minimal total transmission energy consumption for data transmission.Simulation results show that the ADPC can reduce both the energy dissipation and the end-to-end latency of the transmission.为减少MANETs中节点的能量消耗,并同时减少传输过程中端到端的时延,引入随机几何中距离研究的方法,构建出一种自适应的距离驱动功率控制方法(简称ADPC).经数学证明可知,任意给定一个距离,可以得出传输数据所需最优中继节点个数及最优中继节点位置.在ADPC中,源节点首先根据与目的节点间的距离,计算通信所需的最优中继节点数量及最优中继节点位置;然后在最佳中继节点周围搜索可行的中继节点,并选择一条总能耗最小的链路,进行数据传输.仿真结果表明,所提ADPC方法能够降低传输能耗、减少端到端的传输时延.
关 键 词:power control mobile ad hoc networks energyefficient route optimal virtual relay-site
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.188