An efficient low-delay routing algorithm for community-based opportunistic network

The mobile devices with short-range wireless communication interface and carried by social people, consist of opportunistic network whose nodes have the characteristics of the community. The prevalent multi-copy message routing algorithms in opportunistic network don't consider these characteristics adequately, it will lead to higher resource consumption, higher latency and lower delivery ratio when we deploy them directly in the community-based opportunistic network. To address these issues, we present an efficient low-delay routing algorithm (ELRA), it can control the number of message copies adaptively, and depend on nodes, which hit nodes of destination community more frequently, to delivery the message to the destination community. In the destination community, ELRA completes message transmission according to a transitive utility function, and sends messages on the final hop firstly, then reduces overhead and delivery delay. Simulations results show that, compared with the SF algorithm, ELRA algorithm may ensures the message delivery ratio and reduce the number of messages forwarding, at the same time it reduces the delivery delay of about 25% in community-based opportunistic network, effectively reducing the consumption of resources. Copyright © 2013 Binary Information Press.