2002 · 65 citations · 13 references
ComputingComputer SystemsComputer NetworksMobile ComputingWireless CommunicationsAd Hoc Mobile NetworksMobile Ad Hoc NetworksMobile NetworksNetwork ProtocolsRoutingRouting ProtocolsAd Hoc Network ProtocolsAd Hoc NetworkingAd Hoc NetworksLink Layer CommunicationMobile Ad Hoc Network RoutingMobile Ad Hoc RoutingRoute DiscoveryRouting In Mobile Networks
Mobile ad hoc networks rely on wireless links that may be unidirectional, yet most routing protocols assume bidirectionality, causing sub‑optimal routing. The paper proposes a tunneling approach to enable efficient routing in MANETs that contain unidirectional links. The method tunnels packets from the receiving end of a unidirectional link back to its source using routing information, while avoiding loops and packet explosions caused by tunneling acknowledgments. The implemented tunneling scheme successfully eliminates the packet explosion problem and supports reliable communication over unidirectional links.
Mobile ad hoc networks (MANETs) consist of a set of similar mobile nodes, communicating with each other using wireless links. As a node may not be able to directly reach every other node, a packet may need to traverse multiple wireless links from its source to its destination. Unidirectional links can occur in such networks. Several existing routing protocols implicitly assume bidirectional links when making their routing decisions. Not using unidirectional links can lead to sub-optimal routes. A tunneling solution to allow efficient operation in ad hoc networks with unidirectional links is presented. The tunneling solution uses information gathered by the routing protocol to tunnel packets from the end-point of the unidirectional link to its source. A naive implementation of tunneling could lead to loops in the system and a deluge of packets. This is because when ACKs (acknowledgments) for link layer messages are tunneled across unidirectional links, ACKs for them may end up being generated recursively. The solution presented here prevents such a packet explosion from occurring.
13
Ad-hoc on-demand distance vector routing
Charles E. Perkins, E.M. Royer · 1999 · 10.3K citations
Congestion avoidance and control
Van Jacobson · ACM SIGCOMM Computer Communication Review · 1995 · 5.3K citations
Congestion avoidance and control
Van Jacobson · ACM SIGCOMM Computer Communication Review · 1988 · 1.9K citations