Opportunistic routing in multi-hop wireless networks

被引:264
|
作者
Biswas, S [1 ]
Morris, R [1 ]
机构
[1] MIT, Comp Sci Lab, Cambridge, MA 02139 USA
关键词
D O I
10.1145/972374.972387
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes Extremely Opportunistic Routing (ExOR), a new unicast routing technique for multi-hop wireless networks. ExOR forwards each packet through a sequence of nodes, deferring the choice of each node in the sequence until after the previous node has transmitted the packet on its radio. ExOR then determines which node, of all the nodes that successfully received that transmission, is the node closest to the destination. That closest node transmits the packet. The result is that each hop moves the packet farther (on average) than the hops of the best possible predetermined route. The ExOR design addresses the challenge of choosing a forwarding node after transmission using a distributed algorithm. First, when a node transmits a packet, it includes in the packet a simple schedule describing the priority order in which the potential receivers should forward the packet. The node computes the schedule based on shared measurements of inter-node delivery rates. ExOR then uses a distributed slotted MAC protocol for acknowledgments to ensure that the receivers agree who the highest priority receiver was. The efficacy of ExOR depends mainly on the rate at which the reception probability falls off with distance. Simulations based on measured radio characteristics [6] suggest that ExOR reduces the total number of transmissions by nearly a factor of two over the best possible pre-determined route.
引用
收藏
页码:69 / 74
页数:6
相关论文
共 50 条
  • [41] QoS-Aware Forward Error Correction Cooperating with Opportunistic Routing in Wireless Multi-hop Networks
    Zhou, Ming
    Jin, Chanyuan
    WIRELESS PERSONAL COMMUNICATIONS, 2017, 92 (04) : 1407 - 1422
  • [42] Joint Opportunistic Routing and Intra-Flow Network Coding in Multi-Hop Wireless Networks: A Survey
    Zhang, Chen
    Li, Cheng
    Chen, Yuanzhu
    IEEE NETWORK, 2019, 33 (01): : 113 - 119
  • [43] Multi-Hop Routing for Multi-Stationed Wireless Sensor Networks
    Manjula, S. H.
    Prabhavathi, M.
    Arjun, A., V
    Shaila, K.
    Nalini, L.
    Venugopal, K. R.
    Patnaik, L. M.
    2009 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE, VOLS 1-3, 2009, : 806 - +
  • [44] Gossip Routing, Percolation, and Restart in Wireless Multi-Hop Networks
    Blywis, Bastian
    Reinecke, Philipp
    Guenes, Mesut
    Wolter, Katinka
    2012 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2012, : 3019 - 3023
  • [45] Probabilistic Routing for Multiple Flows in Wireless Multi-hop Networks
    Cui, Yong
    Hu, Wenjie
    Tarkoma, Sasu
    Yla-Jaaski, Antti
    2009 IEEE 34TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2009), 2009, : 261 - +
  • [46] Effect of Information on Routing Performance in Multi-hop Wireless Networks
    Hong, Jun
    Li, Victor O. K.
    2010 IEEE 71ST VEHICULAR TECHNOLOGY CONFERENCE, 2010,
  • [47] Multi-hop Routing Protocol for Mobile Wireless Sensor Networks
    Arshad, Muhammad
    Aalsalem, Mohamad Yahya
    Siddqui, Farhan Ahmed
    WORLD CONGRESS ON COMPUTER & INFORMATION TECHNOLOGY (WCCIT 2013), 2013,
  • [48] Diversity Routing for Multi-hop Wireless Networks with Cooperative Transmissions
    Lakshmanan, Sriram
    Sivakumar, Raghupathy
    2009 6TH ANNUAL IEEE COMMUNICATIONS SOCIETY CONFERENCE ON SENSOR, MESH AND AD HOC COMMUNICATIONS AND NETWORKS (SECON 2009), 2009, : 610 - 618
  • [49] Stable routing scheduling algorithms in multi-hop wireless networks
    Cholvi, Vicent
    Garncarek, P.
    Jurdzinski, T.
    Kowalski, Dariusz R.
    THEORETICAL COMPUTER SCIENCE, 2022, 921 : 20 - 35
  • [50] Towards optimising routing overhead in wireless multi-hop networks
    Javaid, N.
    Bibi, A.
    Mohammad, S. N.
    Khan, Z. A.
    Alrajeh, N.
    INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2015, 19 (1-2) : 4 - 18