Abstract
In opportunistic networks, sensor communication areas are established by node movements. Information can be transmitted among communication areas. Relevance nodes in communication areas are important because they carry information and build bridges between areas and data packets so that information can be delivered to the destination node. This study proposes a routing algorithm called sensor communication area node extend (SCANE), which aims to select relevance nodes and to recombine communication areas. This algorithm also enables information to be transmitted from the start node to the destination node easily. The simulation indicates that compared with Epidemic, PRoPHET, and Spray and wait algorithms in opportunistic networks, the proposed algorithm improves delivery ratio, overhead, and delay time.
Sign-in/Register to access full text options 
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.
