Sensor communication area and node extend routing algorithm in opportunistic networks

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.