Simple Local Multicast Tree Extension against Intermittently Disconnected State by Exploiting Motion Affinity

Search this article

Abstract

This letter proposes a simple k-hop flooding scheme for the temporarily lost child node of a multicast tree in a mobile ad hoc network where a group of nodes move together within a bound. Through simulation, we show that our scheme improves the packet delivery ratio of MAODV to be comparable to the epidemic routing with only small additional duplicate packets.

Journal

References(15)*help

See more

Details 詳細情報について

Report a problem

Back to top