Robust on-demand routing mechanism for wireless multi-hop networks

Su, Jingfang; Muqing, Wu; Zhou, Yan; Zhang, Qinjuan

doi:10.1049/iet-com.2009.0650

Cited by 8 publications

(8 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As more duplicate transmissions lead to longer queue delay and ineffective backoff mechanism causes large BTT time, time overhead can well represent the efficiency of ORs. We apply our model to evaluate three typical ORs, Extremely Opportunistic Routing (ExOR) [2], Network layer Broadcast with Confirmed Opportunity routing (NBC-OPP) [3] and Dual Priority Cooperative Opportunistic Routing Scheme (DPCOR) [4]. The theoretical value of the proposed model coincides basically with the experimental data, with the average error less than 5%.…”

Section: Introductionmentioning

confidence: 64%

Efficiency analysis of opportunistic routing protocol in wireless multi-hop networks

Lai¹,

Wang²,

Lin³

2014

International Conference on Cyberspace Technology (CCT 2014)

View full text Add to dashboard Cite

Opportunistic routing (OR) is widely regarded as a promising way to improve the transmission reliability in wireless multihop networks. However, additional overheads introduced by OR such as duplicate transmission and collision avoidance overhead degrade the transmission efficiency. In this paper, an analytical model based on open queueing network with markov chains is proposed to evaluate the efficiency. In the analysis, efficiency is expressed by time overhead including the average queue delay and the back off time to transmit. With the knowledge of delivery ratio, the closed form expressions of time overhead could be obtained. In order to validate rationality of the model, three typical ORs were analyzed based on the proposed model and at the same time a large number of simulation studies have been done. We observed that theoretical value of the proposed model coincides basically with the experimental data with the average error less than 5%.

show abstract

Section: Introductionmentioning

confidence: 64%

Efficiency analysis of opportunistic routing protocol in wireless multi-hop networks

Lai¹,

Wang²,

Lin³

2014

International Conference on Cyberspace Technology (CCT 2014)

View full text Add to dashboard Cite

show abstract

“…If , time overhead for is (6) Since the departure process of the proposed node model is also Poisson, the network behaves as if it were composed of independent M/M/1 queues. The multidimensional Markov cast packets effectively.…”

Section: Applications For Typical Orsmentioning

confidence: 99%

“…Both of them are optimal values obtained in our previous work [6]. Regarding to the basic time unit denoted as Δt, the optimal value should be the processing time of one packet, including the numerical results.…”

Section: Performance Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Reclaiming the efficiency of opportunistic routing in wireless multi-hop networks

et al. 2014

View full text Add to dashboard Cite

145 probability from any forwarding candidate, which is different from traditional routing only relying on pre-defined path such as dynamic source routing (DSR) [2]. Therefore, OR can cope well with the fluctuant link quality that is typical characteristic of wireless networks.Cooperation mechanism is employed to coordinate the behaviors of forwarding candidates. Based on the mechanism used, existing ORs are divided into three groups: timer, network coding [3] and token [4]. Since no extra tokens or encoding modules are involved, timer-based OR is the most straightforward approach and could be implemented easily [1].One of the important issues for timer-based OR is transmission efficiency. To address this issue from theory, we propose an analytical model. Since more duplicate transmissions lead to longer queue delay and ineffective back-off mechanism causes larger back-off time for transmission (BTT), time overhead in this proposed model can well represent the efficiency. Accuracy of this model is validated by the accordance between theoretical values and experimental results. By applying the model to evaluate two typical ORs, named extremely opportunistic routing (ExOR) [5] and network layer broadcast with confirmed opportunity routing (NBC-OPP) [6], we find that coordinating the candidates without priorities or exclusively using a single priority for the cooperation is inefficient. Therefore, a Abstract: Opportunistic routing (OR) is an effective way to guarantee transmission reliability in wireless multi-hop networks. H o w e v e r, l i t t l e r e s e a r c h f o c u s e s o n transmission efficiency. Thus, an analytical model based on open queuing network withMarkov chains was proposed to evaluate the efficiency. By analyzing two typical ORs, we find duplicate transmission and collision avoidance overhead are the root reasons behind inefficiency. Therefore, a new scheme called dual priority cooperative opportunistic routing (DPCOR) was proposed. In DPCOR, forwarding candidates are configured with dual priority, which enables the network to classify forwarding candidates more effectively so as to reduce the back-off time and obtain more diversity gain. Theoretical analysis and simulation results show DPCOR achieves significant performance improvement with less time overhead compared with traditional routings and typical ORs.

show abstract

“…Local priority is used to decide whether to forward the received data packet and when to forward it. We test the performance of DPCOR in the Nakagami fading model by NS-2 (version 2.34) and compare it to the well-understood DSR and Network layer Broadcast with confirmed Opportunity routing (NBC-OPP) [4] in an array of wireless multi-hop network scenarios. According to the simulation results, we observe that the proposed method could achieve better packet delivery and end-to-end delay with less transmission cost.…”

Section: Introductionmentioning

confidence: 99%

A Novel Dual Priority Cooperative Opportunistic Routing Scheme in Wireless Multi-Hop Networks

Wang

Muqing

Wen

et al. 2013

2013 IEEE 78th Vehicular Technology Conference (VTC Fall)

View full text Add to dashboard Cite

Distributed cooperation among the forwarding candidates is the main challenge of opportunistic routing design for wireless multi-hop networks. Timer-based coordination is an efficient way to solve this problem. However this method leads to unnecessary duplicate transmission problem which will degrade the system performance. In the scenario where nodes are nonadjacent, the duplicate transmission problem gets even worse. To avoid the useless retransmission, this paper proposes a pure network layer scheme called Dual Priority Cooperative Opportunistic Routing Scheme (DPCOR). DPCOR exploits the global network information to complete the network layer confirmation. The nodes with lower global priority receive a duplicate packet will not respond again. Furthermore, it combines the local link quality variation and adjacent information to classify the forwarding candidates into three levels with local priority. As the packets are broadcasted at different time according to the local priority, the scheme can get more time diversity, which can avoid collision and improve performance effectively. We test DPCOR by using the simulation in various network scenarios. The results show that DPCOR achieve significant performance improvement with less transmission cost compared to the traditional routing and typical opportunistic routing.

show abstract

Robust on-demand routing mechanism for wireless multi-hop networks

Cited by 8 publications

References 9 publications

Efficiency analysis of opportunistic routing protocol in wireless multi-hop networks

Efficiency analysis of opportunistic routing protocol in wireless multi-hop networks

Reclaiming the efficiency of opportunistic routing in wireless multi-hop networks

A Novel Dual Priority Cooperative Opportunistic Routing Scheme in Wireless Multi-Hop Networks

Contact Info

Product

Resources

About