首页 | 本学科首页   官方微博 | 高级检索  
     

无线Ad hoc网络中基于节点停留概率的路径压缩
引用本文:周曜,徐佳,刘凤玉.无线Ad hoc网络中基于节点停留概率的路径压缩[J].电子与信息学报,2010,32(4):830-835.
作者姓名:周曜  徐佳  刘凤玉
作者单位:1. 南京理工大学计算机科学与技术学院,南京,210094;中国电子科技集团总公司第38研究所,合肥,230031
2. 南京理工大学计算机科学与技术学院,南京,210094
基金项目:国家自然科学基金(60803001);;国家部委“十一五”重点项目基金资助课题
摘    要:该文提出一种基于节点停留概率的路径压缩算法NSP-PCA。通过计算造成路径变化的节点相对于另一节点传输区域的停留概率,动态预测压缩路径的稳定性,并以此为依据决定压缩操作的优先级。仿真表明,NSP-PCA能有效控制短暂缩减和多次缩减等非正常压缩,在端到端时延,路由开销和包发送率方面均优于SHORT和PCA压缩算法。

关 键 词:Ad  hoc  路径压缩  节点停留概率
收稿时间:2009-4-7
修稿时间:2009-7-27

Path Compression Based on Node Staying Probability for Wireless Ad hoc Networks
Zhou Yao,Xu Jia,Liu Feng-yu.Path Compression Based on Node Staying Probability for Wireless Ad hoc Networks[J].Journal of Electronics & Information Technology,2010,32(4):830-835.
Authors:Zhou Yao  Xu Jia  Liu Feng-yu
Affiliation:School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094, China; China Eletronic Technology Group Corporation No.38 Research Institute, Hefei 230031, China
Abstract:A Node Staying Probability based Path Compression Algorithm (NSP-PCA) is proposed in this paper. In NSP-PCA,the stability of new local paths is predicted by computing the probability that one node keeps staying in another node's transmission range. The compressing operation is performed based on the prediction to reduce the blindness of compression. Simulation results show that NSP-PCA lessens the ephemeral and multiple short-cuts observably and achieves lower end-to-end delay,lower routing overhead and hig...
Keywords:Ad hoc  Path compression  Node staying probability
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号