Motivated by various applications
in mobile ad-hoc networks (MANETs) that require nodes to share their individual
information to each other, we study the multi-message dissemination problem in
a MANET, which is to distribute multiple messages to all mobile nodes in the
network in parallel. The objective is to minimize the stopping time, textit {i.e.},
the time taking for all nodes to receive a copy of the whole messages. We
consider an intrinsically one-sided protocol based on random linear network
coding (RLNC), where all packets forwarded are in the form of random linear
combinations of packets received so far. Its supreme performance is
demonstrated theoretically for two cases, low mobility and high mobility,
according to the node velocity. In particular, we show that, under general
settings, our derived upper bounds of the stopping time match the established
lower bound in both cases, although the effects of mobility in the two cases
are significantly different. Thus, we conclude that RLNC achieves order optimality
for fast information dissemination in MANETs.
No comments:
Post a Comment