检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]合肥工业大学,合肥230009
出 处:《电子测量与仪器学报》2015年第5期708-716,共9页Journal of Electronic Measurement and Instrumentation
基 金:国家自然科学基金(61374158);安徽高校省级自然科学研究(2011AJZR0916)资助项目
摘 要:网络生命周期是评价能量受限无线网络性能的重要指标之一,如何有效延长网络生命周期是影响该类无线网络实际应用的重要问题,优化发射功率或节约能耗是比较常见的解决方法之一。针对直接和协作2种传输链路,将协作通信技术与路由机制相结合,并基于节点的位置信息,提出一种最大化网络生命周期的协作路由算法。该算法在保证一定中断率的前提下,运用非线性规划方法求解最优发射功率,进而构建由节点发射能耗、接收能耗和剩余能量组成的权值代价公式。然后,基于Dijkstra’s最短路径,依据权值代价公式建立从源节点到目的节点的协作路由。仿真实验结果表明,该算法可以降低节点的发射功率,减少节点的能量消耗,从而有效的延长网络生命周期。Lifetime is one of the important performance parameter for energy-constrained wireless network, and how to extend the lifetime is a critical issue in practical applications of wireless network. Saving energy or optimizing the transmission power is one of the most common methods. For direct and cooperative transmission link, a lifetime maxi- mizing cooperative routing algorithm is proposed based on node' s location information, in which cooperative commu- nication is associated with routing mechanism. While guaranteeing the outage rate at a certain level, nonlinear pro- gramming problem is specified to obtain the optimal transmission power. Then, the link costs formula is given, which is constructed by representing transmission energy with optimal transmission power, receiving energy and node' s re- sidual energy. On the basis of the Dijkstra' s shortest path, the link costs formula is used to construct the route from source node to destination node. The simulation results show that this algorithm can reduce the transmission power and save energy consumption of nodes to extend network lifetime effectively.
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147