1-2hit |
Kwang Bin IM Kyungran KANG Young-Jong CHO
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.
Yen-Wen LIN Hsiao-Kuang WU Feipei LAI
Technical advances in the development of portable computers and wireless communications enable users to take part in distributed computing even while moving. The resulting environment is subject to be constrained by the mobility of users and the nature of the cordless medium. In this paper we propose a commit protocol for providing low-powered mobile hosts with two phase commit service which is a powerful technique to implement atomic actions in distributed systems, with some important aspects such as low power consumption, efficient mobility management, subject oriented service binding and effective disconnection handling to well adapt to a mobile computing environment.