IEEE Transactions on Wireless Communications · 2004 · 168 citations · 26 references
ComputingCommunicationComputer ScienceComputer NetworksInformation TheoryWireless CommunicationsAd Hoc Mobile NetworksCommunication NetworksMobile Ad Hoc NetworksMobile NetworksNetwork Performance AnalysisRoutingAd Hoc NetworksAnalytical SolutionsMobile Ad Hoc Network RoutingMobile Ad Hoc RoutingMultipathMultipath RoutingRouting In Mobile NetworksWireless Signal Propagation
The instability of mobile ad hoc network topologies due to node mobility and changing wireless conditions makes time‑sensitive data transmission challenging. The study develops an analytical framework and proposes a multipath routing scheme that splits data across multiple paths to improve delivery probability without excessive delay. The scheme adds a linear overhead to each packet, fragments the packet into blocks, distributes them over available paths, and analytically derives the probability of successful reconstruction at the destination. The analysis shows that, under certain constraints, increasing the number of paths reduces packet dropping probability.
In this paper, we develop an analytical framework for evaluating multipath routing in mobile ad hoc networks. The instability of the topology (e.g., failure of links) in this type of network due to nodal mobility and changes in wireless propagation conditions makes transmission of time-sensitive information a challenging problem. To combat the inherent unreliability of these networks, we propose a routing scheme that uses multiple paths simultaneously by splitting the information between a multitude of paths, so as to increase the probability that the essential portion of the information is received at the destination without incurring excessive delay. Our scheme works by adding an overhead to each packet, which is calculated as a linear function of the original packet bits. The resulting packet (information and overhead) is fragmented into smaller blocks and distributed over the available paths. The probability of reconstructing the original information at the destination is derived in an analytical form and its behavior is studied for some special cases. It is shown that, under certain constraints, the packet dropping probability decreases as the number of used paths is increased.
26
Ad-hoc on-demand distance vector routing
Charles E. Perkins, E.M. Royer · 1999 · 10.3K citations
Split multipath routing with maximally disjoint paths in ad hoc networks
S.-J. Lee, Mário Gerla · 2002 · 1.2K citations