TCAR: A new network coding-aware routing mechanism based on local topology detection
TCAR: A new network coding-aware routing mechanism based on local topology detection
复制标题
TCAR：一种基于本地拓扑检测的新型网络编码感知路由机制
DOI：
10.1007/s11771-014-2289-5
复制
发表时间：
2014-08
影响因子：
4.4
通讯作者：
王建新
中科院分区：
文献类型：
--
作者：
王伟平;吴伟;关庆娟;王建新
近年来的研究表明，与传统的转发机制相比，会话间网络编码可以减少无线网络中传输的数据包数量，实现更高的吞吐量。在现有的大多数基于会话间网络的中继机制中，如COPE，中继节点需要收集邻居节点的消息，以获知哪些报文已经被邻居节点窃听到，从而判断转发报文之间或转发报文之间是否存在编码机会。然而，此消息收集的传输开销和机会确定的计算成本将降低这些机制的性能。可以看出，中继节点的编码机会与局部拓扑的关系更大，在一般密度的无线网络中，将三个或多个数据包一起编码的机会远远小于将两个数据包一起编码的机会。在此基础上，提出了一种新的编码感知路由机制——TCAR。TCAR忽略了将三个或三个以上的数据包一起编码的机会。每个中继节点根据其本地拓扑检测的结果维护一个正在建立的编码映射表，该表可用于计算路由建立阶段的路径开销，并确定在报文转发阶段哪两个报文可以一起编码。在TCAR中，每个中继节点只需要进行一次本地拓扑检测，而不是周期性的消息收集，并且编码确定比以前的机制简单得多。仿真结果表明，与典型的会话间网络编码机制COPE和基于COPE的路由相比，TCAR的吞吐量提高了12%和7%，并保持了最小的端到端延迟。
Recent researches show that inter-session network coding could decrease the number of packets transmission and achieve higher throughput in wireless network compared with traditional forwarding mechanism. In most existing relay mechanisms based on inter-session network such as COPE, relay node demands to collect the messages from its neighbor nodes to get notice of which packets already overheard by them so as to determine whether there exists coding opportunity between or among forwarding packets. However, transmission overhead of this message collection and computing cost of opportunity determination will degrade the performance of these mechanisms. It is observed that coding opportunity at relay node is much more related with the local topology, and the opportunity of encoding three or more packets together is far less than that of encoding two packets together in wireless network with general density. Based on this, a new coding-aware routing mechanism, named TCAR, is proposed. TCAR ignores the opportunity of encoding three or more than three packets together. Each relay node maintains an encoding mapping table being established according to the result of its local topology detection, which can be used to calculate the path cost during routing setup phase, and determine that which two packets can be encoded together during the packets forwarding phase. In TCAR, instead of periodic messages collection, each relay nodes just need once local topology detection, and the encoding determination is much simpler than that of the former mechanisms. Simulation results show that compared with typical inter-session network coding mechanisms COPE and COPE-based routing, TCAR achieves 12% and 7% throughput gains, and keeps the minimum end to end delay.
登录
查看更多内容
影响因子：
--
作者：
Dong-yang Long
通讯作者：
Dong-yang Long
影响因子：
2.5
作者：
Ahlswede, R;Cai, N;Yeung, RW
通讯作者：
Yeung, RW
DOI：
10.1109/tnet.2010.2042727
发表时间：
2010-08
期刊：
IEEE/ACM Transactions on Networking
影响因子：
--
作者：
S. Sengupta;Shravan K. Rayanchu;Suman Banerjee
通讯作者：
S. Sengupta;Shravan K. Rayanchu;Suman Banerjee
无线传感器网络中最大寿命目标覆盖的参数化复杂度
影响因子：
1.1
作者：
Weizhong Luo;Jianxin Wang;Jiong Guo;Jianer Chen
通讯作者：
Jianer Chen
DOI：
--
发表时间：
2012-04
期刊：
--
影响因子：
--
作者：
S. Meenatchi
通讯作者：
S. Meenatchi