Abstract
In this paper, we propose SWS: a Smart Walk mechanism for resources Search in unstructured mobile P2P networks. SWS is a smart version of the conventional Random Walk used for resource search in unstructured P2P networks. The advantage of SWS is the awareness of both the overlay and mobile underlay constraints during the resources search process. The search query is forwarded from peer to peer following three smart conditions concerning each candidate neighbor which are: its physical distance from the current peer, its remaining energy and its ability (which will be defined later). Simulation results show that our mechanism offers good performances comparing to other existing search mechanisms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
