中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A power adjusting algorithm on mobility control in mobile ad hoc networks

文献类型:会议论文

作者Yuan, Jianrui; Meng, Jintao
出版日期2011
会议名称8th IFIP International Conference on Network and Parallel Computing, NPC 2011
会议地点Changsha, PEOPLES R CHINA
英文摘要Power saving is one of the key issues in mobile ad-hoc networks (MANET), while previous researches in MAC layer are mostly focused on improving the channel utilization by adopting variable-range transmission power control. In this paper we focus on the power savings in the network layer, and propose apower adjusting algorithm (we term it PAA). In the presence of mobile host's mobility, PAA is designed to conserve energy by adjusting the transmissionpower to maintain the route's connectivity and restarting the route discovery periodically to find the new better route dynamically. After analyzing the operations of PAA, we find that the length of route discovery restarted period is a critical argument which will affect power saving, so we propose an optimizing model which finds the optimal value of this argument by analyzing the energy consumption of this algorithm. PAA can handle the mobility of MANET by adjusting the transmission power and in the meantime save energy by restarting route discovery periodically to balance the energy consumption on route discovery and packets delivering. It is suggested that PAA can be implemented in the dynamic source routing protocol (DSR). Simulation results are provided, which demonstrate DSR embedded with PAA saves nearly 40% energy compared to DSR without PAA in the presence of high mobility.
收录类别EI
语种英语
源URL[http://ir.siat.ac.cn:8080/handle/172644/3585]  
专题深圳先进技术研究院_数字所
作者单位2011
推荐引用方式
GB/T 7714
Yuan, Jianrui,Meng, Jintao. A power adjusting algorithm on mobility control in mobile ad hoc networks[C]. 见:8th IFIP International Conference on Network and Parallel Computing, NPC 2011. Changsha, PEOPLES R CHINA.

入库方式: OAI收割

来源:深圳先进技术研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。