Parallel Opportunistic Routing in Wireless Networks

We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source- destination pairs increases up to the operating maximum. Our opportunistic routing is novel in a sense that it is massively parallel, i.e., it is performed by many nodes simultaneously to maximize the opportunistic gain while controlling the inter-user interference. The scaling behavior of conventional multi-hop transmission that does not employ opportunistic routing is also examined for comparison. Our results indicate that our opportunistic routing can exhibit a net improvement in overall power--delay trade-off over the conventional routing by providing up to a logarithmic boost in the scaling law. Such a gain is possible since the receivers can tolerate more interference due to the increased received signal power provided by the multi-user diversity gain, which means that having more simultaneous transmissions is possible.Comment: 18 pages, 7 figures, Under Review for Possible Publication in IEEE Transactions on Information Theor

Cross-layer Balanced and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks

For improving the efficiency and the reliability of the opportunistic routing algorithm, in this paper, we propose the cross-layer and reliable opportunistic routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the improved efficiency fuzzy logic and humoral regulation inspired topology control into the opportunistic routing algorithm. In CBRT, the inputs of the fuzzy logic system are the relative variance (rv) of the metrics rather than the values of the metrics, which reduces the number of fuzzy rules dramatically. Moreover, the number of fuzzy rules does not increase when the number of inputs increases. For reducing the control cost, in CBRT, the node degree in the candidate relays set is a range rather than a constant number. The nodes are divided into different categories based on their node degree in the candidate relays set. The nodes adjust their transmission range based on which categories that they belong to. Additionally, for investigating the effection of the node mobility on routing performance, we propose a link lifetime prediction algorithm which takes both the moving speed and moving direction into account. In CBRT, the source node determines the relaying priorities of the relaying nodes based on their utilities. The relaying node which the utility is large will have high priority to relay the data packet. By these innovations, the network performance in CBRT is much better than that in ExOR, however, the computation complexity is not increased in CBRT.Comment: 14 pages, 17 figures, 31 formulas, IEEE Sensors Journal, 201