In Mobile Ad hoc Networks, The route discovery mechanism utilize simple flooding method, where a mobile node massively rebroadcasts received route request (RREQ) packets until a route to destination is established. This can cause more retransmissions and thus excessive energy consumption. This work aims to reduce the number of messages RREQ (Route Request), by a new probabilistic and dichotomic method for the discovery of destination. This method can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation analysis can result in significant performance improvements in terms of energy. We propose a new probabilistic algorithm DRREQ (Dichotomic Route Request) which minimize significantly the energy consumption. Extensive simulations have been carried out for evaluation of the performance of our algorithm in different scenarios.
Comments: 6 Pages.
[v1] 2012-08-18 13:02:50
Unique-IP document downloads: 573 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.