Much work in cooperative communication has been done from the perspective of the physical and network layers. However, the exact impact of signal error rate performance on cooperative routing discovery still remains unclear in multihop ad hoc networks. In this paper, we show the symbol error rate (SER) performance improvement obtained from cooperative commutation, and examine how to incorporate the factor of SER into the distributed routing discovery scheme called DGCR (Dynamic Geographic Cooperative Routing). For a single cooperative communication hop, we present two types of metric to specify the degree that one node is suitable for becoming the relay node. One metric is the potential of a node to relay with optimal SER performance. The other metric is the distance of a node to the straight line that passes through the last forwarding node and the destination. Based on location knowledge and contention scheme, we combine the two metrics into a composite metric to choose the relay node. The forwarding node is chosen dynamically according to the positions of the actual relay node and the destination. Simulation results show that our approach outperforms non-cooperative geographic routing significantly in terms of symbol error rate, and that DGCR's SER performance is better than traditional geographic cooperative routing with slight path length increase.
Yu TIAN
Air Force Engineering University
Linhua MA
Air Force Engineering University
Bo SONG
Air Force Engineering University
Hong TANG
Air Force Engineering University
Song ZHANG
Air Force Engineering University
Xing HU
Air Force Engineering University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yu TIAN, Linhua MA, Bo SONG, Hong TANG, Song ZHANG, Xing HU, "Geographic Cooperative Routing for Minimum Symbol Error Rate in Wireless Multihop Networks" in IEICE TRANSACTIONS on Communications,
vol. E97-B, no. 2, pp. 441-449, February 2014, doi: 10.1587/transcom.E97.B.441.
Abstract: Much work in cooperative communication has been done from the perspective of the physical and network layers. However, the exact impact of signal error rate performance on cooperative routing discovery still remains unclear in multihop ad hoc networks. In this paper, we show the symbol error rate (SER) performance improvement obtained from cooperative commutation, and examine how to incorporate the factor of SER into the distributed routing discovery scheme called DGCR (Dynamic Geographic Cooperative Routing). For a single cooperative communication hop, we present two types of metric to specify the degree that one node is suitable for becoming the relay node. One metric is the potential of a node to relay with optimal SER performance. The other metric is the distance of a node to the straight line that passes through the last forwarding node and the destination. Based on location knowledge and contention scheme, we combine the two metrics into a composite metric to choose the relay node. The forwarding node is chosen dynamically according to the positions of the actual relay node and the destination. Simulation results show that our approach outperforms non-cooperative geographic routing significantly in terms of symbol error rate, and that DGCR's SER performance is better than traditional geographic cooperative routing with slight path length increase.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.441/_p
Copy
@ARTICLE{e97-b_2_441,
author={Yu TIAN, Linhua MA, Bo SONG, Hong TANG, Song ZHANG, Xing HU, },
journal={IEICE TRANSACTIONS on Communications},
title={Geographic Cooperative Routing for Minimum Symbol Error Rate in Wireless Multihop Networks},
year={2014},
volume={E97-B},
number={2},
pages={441-449},
abstract={Much work in cooperative communication has been done from the perspective of the physical and network layers. However, the exact impact of signal error rate performance on cooperative routing discovery still remains unclear in multihop ad hoc networks. In this paper, we show the symbol error rate (SER) performance improvement obtained from cooperative commutation, and examine how to incorporate the factor of SER into the distributed routing discovery scheme called DGCR (Dynamic Geographic Cooperative Routing). For a single cooperative communication hop, we present two types of metric to specify the degree that one node is suitable for becoming the relay node. One metric is the potential of a node to relay with optimal SER performance. The other metric is the distance of a node to the straight line that passes through the last forwarding node and the destination. Based on location knowledge and contention scheme, we combine the two metrics into a composite metric to choose the relay node. The forwarding node is chosen dynamically according to the positions of the actual relay node and the destination. Simulation results show that our approach outperforms non-cooperative geographic routing significantly in terms of symbol error rate, and that DGCR's SER performance is better than traditional geographic cooperative routing with slight path length increase.},
keywords={},
doi={10.1587/transcom.E97.B.441},
ISSN={1745-1345},
month={February},}
Copy
TY - JOUR
TI - Geographic Cooperative Routing for Minimum Symbol Error Rate in Wireless Multihop Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 441
EP - 449
AU - Yu TIAN
AU - Linhua MA
AU - Bo SONG
AU - Hong TANG
AU - Song ZHANG
AU - Xing HU
PY - 2014
DO - 10.1587/transcom.E97.B.441
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2014
AB - Much work in cooperative communication has been done from the perspective of the physical and network layers. However, the exact impact of signal error rate performance on cooperative routing discovery still remains unclear in multihop ad hoc networks. In this paper, we show the symbol error rate (SER) performance improvement obtained from cooperative commutation, and examine how to incorporate the factor of SER into the distributed routing discovery scheme called DGCR (Dynamic Geographic Cooperative Routing). For a single cooperative communication hop, we present two types of metric to specify the degree that one node is suitable for becoming the relay node. One metric is the potential of a node to relay with optimal SER performance. The other metric is the distance of a node to the straight line that passes through the last forwarding node and the destination. Based on location knowledge and contention scheme, we combine the two metrics into a composite metric to choose the relay node. The forwarding node is chosen dynamically according to the positions of the actual relay node and the destination. Simulation results show that our approach outperforms non-cooperative geographic routing significantly in terms of symbol error rate, and that DGCR's SER performance is better than traditional geographic cooperative routing with slight path length increase.
ER -