Downloads: 114

Review Papers | Computer Science & Engineering | India | Volume 3 Issue 11, November 2014

Survey on Latest Routing Algorithms in Opportunistic Networks

Sonam Kashyap | Jasvir Singh ^[3]

Abstract: In the past wireless LANS and Cellular networks were used for communication. But there were some problems with these networks, in terms of coverage and capacity. In case of cellular networks the coverage is unlimited but capacity is small and in wireless networks coverage is limited and capacity is unlimited. In case of wireless networks if the nodes are mobile then Manets (mobile ad-hoc networks) can be used for communication. But this is only possible when distance between the nodes is small, if the distance increases then it is not possible to communicate so to remove this limitation opportunistic networks were developed. With this network nodes can communicate irrespective of the distance and the type of node Opportunistic networking tries to remove the assumption of physical end-to-end connectivity while providing connectivity opportunities to pervasive devices when no direct access to the Internet is available. Pervasive devices, can opportunistically exploit their mobility and contacts for data delivery. In this kind of network if a node moves towards another node then this is also taken as advantage in transmitting data. In this paper various routing schemes used in these kinds of networks are briefly explained. The routing schemes are classified based on their routing behavior and we will also present comparison among them.

Keywords: Opportunistic network, routing algorithms, flooding, prediction, context

Edition: Volume 3 Issue 11, November 2014,

Pages: 1288 - 1291

Similar Articles with Keyword 'routing algorithms'