Survey on routing algorithms in opportunistic networks

• Published in: 2013 International Conference on Computer Communication and Informatics pp. 1 - 5
• Main Authors: Poonguzharselvi, B., Vetriselvi, V.
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 01.01.2013
• Subjects: Algorithms; Computer networks; Conferences; context; Evolution; flooding; Messages; Mobile communication systems; Networks; Opportunistic network; prediction; routing; Routing (telecommunications); store-carryforward
• ISBN: 1467329061; 9781467329064
• DOI: 10.1109/ICCCI.2013.6466129

Opportunistic network are one of the most interesting evolutions of MANETs. In opportunistic network, mobile nodes are enabled to communicate with each other even if a route connecting to them never exists. Therefore, in this network, message delivery relies on opportunistic routing where nodes use store-carry-and-forward paradigm to route the messages. Routes are built dynamically, while messages are routed between the sender and the destination. Any possible node can opportunistically be used as a next hop, if it can bring the message closer to the final destination. These requirements make opportunistic network a challenging research field. In this paper we survey the existing routing algorithms in opportunistic network. The routing algorithms are classified based on their routing behaviour and comparisons among these algorithms are also presented in this paper.