Papers Based on Oppurtunistic Routing

Dr.A.V.Senthil Kumar proposed an Opportunistic Routing (HFSA-SORA) Algorithm that introduced the concerning of the range map from local and global spectrum sensing information and achieving the research certifies the possibility of range maps to serve range aware functions and facilitates a new paradigm for multi-hop transmissions in CRAHNs [1].

Milind R et al suggested an opportunistic Routing for Emerging Situations (OPPRES) using VDTN to route messages in real world which resulted in decision making for forwarding messages is done based on the fitness or utility of a node computed from contact history information (destination node meeting count or relay node meeting count) stored in them. They argue that the algorithm can be used to deliver messages in emergency situations[2].

Ivan O. Nunes et al introduced [3] an spatial information together with social awareness to improve the cost effectiveness of D2D opportunistic routing and proposed a propose SAMPLER, a simple scheme that combines four different features: nodes’ popularity, individual mobility patterns, PoIs, and social communities. Which Enables enabling higher content delivery while reducing network overhead and average delivery time of messages.

Ms. Varsha T. Lokare proposed[4] an adaptive algorithm to find efficient route in completely dynamic environment. In MANET as nodes are movable and wireless links are unpredictable, static routes never suits for long time and hence existing routing protocols can’t be applied as it is, to wireless network.Their proposed markov chain based protocol uses the latest concept of opportunistic routing, to enhance the probability of successful transmission.

Ning Li et al proposed an opportunistic routing (CBRT) algorithm for MANETs. In CBRT, the RND in the CRS is a range rather than a constant number. The node is divided into different categories based on the value of RND. The nodes adjust their transmission power according to the RND in CRS. The cross-layer metrics are not inputted into the fuzzy logic system directly; the inputs are the relative variances of these metrics and providing network enhancement better than of ExOR[5].

Hajer Ben Fradj et al identified the characteristics and the criticisms of sensor arrays, and they describe the energy recovery technology that achieves an approximately endless lifetime and exceeds the energy constraints. The second part, essentially, presents the basic idea of the traditional and opportunistic routing protocol. Then, they devoted to the comparison between the two methods to show the advantages of opportunistic method compared to the traditional proposed models. The simulation scenarios were presented within this part. The results obtained in this study made it possible to reveal the limits of the TR protocols and to confirm the simultaneous improvement of the lifetime of the network by the use of OR[6].

Yue Cao et al, proposed a trajectory-driven routing protocol for VCPS. As the trajectory towards destination is computed by the source node when needed, such a source based routing nature is immune to the mobility of intermediate nodes. By considering the mobility proximity to the certain trajectory, TDOR is decoupled into a routing policy with three cases to relay messages with differentiated transmission orders. Evaluation results under the Helsinki city scenario showed that the advantages of TDOR over well known opportunistic geographic routing protocols, in terms of much lower routing overhead with comparable delivery ratio[7].