针对车辆自组织网络(vehicular Ad Hoc network,VANET)中紧急消息的传输,提出一个改进的二元分割广播(MBPAB)协议。协议将通信范围迭代划分成小的区域,寻找离发送节点最远区域内的车辆,对紧急消息执行转发,通过减少转发跳数,提高消息传...针对车辆自组织网络(vehicular Ad Hoc network,VANET)中紧急消息的传输,提出一个改进的二元分割广播(MBPAB)协议。协议将通信范围迭代划分成小的区域,寻找离发送节点最远区域内的车辆,对紧急消息执行转发,通过减少转发跳数,提高消息传播速度。通过引入MAC(medium access control)子层的微型分布式帧间间隔(mini-DIFS),赋予对紧急消息以更高的优先级接入通信信道。仿真结果表明,在VANET中,MBPAB协议与现有的广播协议相比,在通信时延和消息传播速度方面有更好的性能表现。展开更多
城市的发展为车载自组织网络(vehicular ad hoc network,VANET)(也称车联网)提供了广阔的应用空间,其中紧急消息广播方法则是应用的一个重点研究内容.紧急消息广播需要满足低延迟、高可靠和高可扩展性等服务质量方面的要求.现有的紧急...城市的发展为车载自组织网络(vehicular ad hoc network,VANET)(也称车联网)提供了广阔的应用空间,其中紧急消息广播方法则是应用的一个重点研究内容.紧急消息广播需要满足低延迟、高可靠和高可扩展性等服务质量方面的要求.现有的紧急消息广播方法在选择下一跳转发节点时,假定每一个位置均有大致相等的概率被选为中继区域,对所有位置的节点一视同仁,缺乏针对最优节点位置分布规律的研究,不能较好地适应最优转发节点的分布情况.而降低紧急消息传播延迟的关键是快速确定合适的中继转发节点.因此,为了进一步提高紧急消息广播的及时性,降低传播延迟,提出一种采用类哈夫曼编码的紧急消息广播方法.首先分析了城市道路中最优转发节点的概率分布情况,然后在此基础上利用哈夫曼编码的原理,设计了一种能够最小化最优节点选取时间的快速分区方法,最终达到快速确定最优中继节点,降低紧急消息广播延迟,提高紧急消息传播速度的目的.仿真实验证明:该方法在不同场景中能够降低5.3%~18.0%的紧急消息广播时延,提高8.9%~24.5%的紧急消息传播速度.展开更多
In orthogonal frequency division multiplexing （OFDM） based multihop communications, the conventional decodeand-forward （DF） relay scheme severely suffers from the error propagation problem. This drawback is seriou...In orthogonal frequency division multiplexing （OFDM） based multihop communications, the conventional decodeand-forward （DF） relay scheme severely suffers from the error propagation problem. This drawback is serious in multihop networks as errors made by any relay node may fail the decoder at the destination in great chance. In this paper, we propose a bit error rate （BER） modified DF protocol （BMDF） which can be applied to systems where error correction channel coding and M-ary modulation are used. By modeling all links except the last one as a binary symmetric channel （BSC）, we derive a log likelihood ratio （LLR） modification function relying only on the accumulated BER of all previous links to be applied to the output of the soft demapper. Furthermore, to reduce the computational complexity and signaling overhead, the modification function is simplified from its original exponential expression and less BERs are delivered between nodes by making successive subcarriers share the same BER. In addition, for situations where the channel state information （CSI） of forward link is available, the proposed BMDF can be further enhanced by combining with subcarrier pairing （SP） and power allocation （PA）, where a sorted-channel gain SP scheme and a greedy PA algorithm are proposed. The simulation results verify thesignificant performance improvement to the conventional DF.展开更多
文摘针对车辆自组织网络(vehicular Ad Hoc network,VANET)中紧急消息的传输,提出一个改进的二元分割广播(MBPAB)协议。协议将通信范围迭代划分成小的区域,寻找离发送节点最远区域内的车辆,对紧急消息执行转发,通过减少转发跳数,提高消息传播速度。通过引入MAC(medium access control)子层的微型分布式帧间间隔(mini-DIFS),赋予对紧急消息以更高的优先级接入通信信道。仿真结果表明,在VANET中,MBPAB协议与现有的广播协议相比,在通信时延和消息传播速度方面有更好的性能表现。
文摘城市的发展为车载自组织网络(vehicular ad hoc network,VANET)(也称车联网)提供了广阔的应用空间,其中紧急消息广播方法则是应用的一个重点研究内容.紧急消息广播需要满足低延迟、高可靠和高可扩展性等服务质量方面的要求.现有的紧急消息广播方法在选择下一跳转发节点时,假定每一个位置均有大致相等的概率被选为中继区域,对所有位置的节点一视同仁,缺乏针对最优节点位置分布规律的研究,不能较好地适应最优转发节点的分布情况.而降低紧急消息传播延迟的关键是快速确定合适的中继转发节点.因此,为了进一步提高紧急消息广播的及时性,降低传播延迟,提出一种采用类哈夫曼编码的紧急消息广播方法.首先分析了城市道路中最优转发节点的概率分布情况,然后在此基础上利用哈夫曼编码的原理,设计了一种能够最小化最优节点选取时间的快速分区方法,最终达到快速确定最优中继节点,降低紧急消息广播延迟,提高紧急消息传播速度的目的.仿真实验证明:该方法在不同场景中能够降低5.3%~18.0%的紧急消息广播时延,提高8.9%~24.5%的紧急消息传播速度.
基金The authors would like to thank National Natural Science Foundation of China （No. 61072059）.
文摘In orthogonal frequency division multiplexing （OFDM） based multihop communications, the conventional decodeand-forward （DF） relay scheme severely suffers from the error propagation problem. This drawback is serious in multihop networks as errors made by any relay node may fail the decoder at the destination in great chance. In this paper, we propose a bit error rate （BER） modified DF protocol （BMDF） which can be applied to systems where error correction channel coding and M-ary modulation are used. By modeling all links except the last one as a binary symmetric channel （BSC）, we derive a log likelihood ratio （LLR） modification function relying only on the accumulated BER of all previous links to be applied to the output of the soft demapper. Furthermore, to reduce the computational complexity and signaling overhead, the modification function is simplified from its original exponential expression and less BERs are delivered between nodes by making successive subcarriers share the same BER. In addition, for situations where the channel state information （CSI） of forward link is available, the proposed BMDF can be further enhanced by combining with subcarrier pairing （SP） and power allocation （PA）, where a sorted-channel gain SP scheme and a greedy PA algorithm are proposed. The simulation results verify thesignificant performance improvement to the conventional DF.
