检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学信息科学与工程学院,辽宁沈阳110819
出 处:《东北大学学报(自然科学版)》2013年第1期35-39,共5页Journal of Northeastern University(Natural Science)
基 金:高等学校科技创新工程重大项目培育资金资助项目(708026)
摘 要:针对特定位置的车辆用户节点和Sink节点,通过选取最佳中继节点来最大限度提高车联网的端到端吞吐量.将上述问题纳入基于组确认机制的车联网模型中,结合数据重传技术及多跳中继技术,提出了最佳中继节点的选择算法OTNS.并借助非线性优化方法来求解,最终确定出车辆用户节点与Sink节点之间的最佳中继的位置,以使得该车辆用户节点与Sink节点间的端到端吞吐量达到最大值.最后通过仿真实验验证了OTNS算法的有效性,结果表明,最佳中继节点的选择方案有利于车联网性能的提高,相比于不使用中继节点,该方案使车联网端到端吞吐量的期望值得到了提高.According to the location-specific vehicular subscriber node and sink node,the end-to-end throughput of the vehicular networks was improved by selecting out the optimal trunk node.Incorporating this issue into the vehicular networks model which is based on the group-based acknowledgement mechanism,and combining with data retransmission technology and multi-hop relay technology,the optimal trunk node selection(OTNS) algorithm was presented.With the help of the nonlinear optimization method,the location of the optimal trunk node between the vehicular subscriber node and sink node was ultimately determined,which made the end-to-end throughput between the vehicular subscriber node and sink node reach its maximum.Finally,the effectiveness of this algorithm was verified through the simulation experiments,which showed that the selection of optimal trunk node is useful for increasing the vehicular networks performance.Compared to not using the optimal node,the vehicular networks end-to-end throughput expectation was improved on the basis of the proposed method.
关 键 词:多跳中继技术 组确认机制 吞吐量 车联网 包接收率
分 类 号:TG335.58[金属学及工艺—金属压力加工]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222