In wireless sensor networks, the routing\nalgorithms currently available assume that the sensor nodes are\nstationary. Therefore when mobility modulation is applied to the\nwireless sensor networks, most of the current routing algorithms\nsuffer from performance degradation. The path breaks in mobile\nwireless networks are due to the movement of mobile nodes, node\nfailure, channel fading and shadowing. It is desirable to deal with\ndynamic topology changes with optimal effort in terms of\nresource and channel utilization. As the nodes in wireless sensor\nmedium make use of wireless broadcast to communicate, it is\npossible to make use of neighboring node information to recover\nfrom path failure. Cooperation among the neighboring nodes\nplays an important role in the context of routing among the\nmobile nodes. This paper proposes an enhancement to an existing\nprotocol for accommodating node mobility through neighboring\nnode information while keeping the utilization of resources to a\nminimum.
Jinpeng WangGérard ChalhoubHamadoun TallMichel Misson
Hiren Kumar Deva SarmaAvijit KarRajib Mall
Shah Ahsanul HaqueSyed Mahfuzul Aziz
Nadia M. NawarS. E. SolimanNabil AyadHala S. El‐sayedM.H. Kelash