International Journal of Managment, IT and Engineering
  • Year: 2013
  • Volume: 3
  • Issue: 7

Advancements of corman technology in multi-hop wireless networks with rumor riding mechanism

  • Author:
  • R Gnanajeyaraman, A. S. Deepumon
  • Total Page Count: 12
  • Page Number: 304 to 315

Dept. of CSE, SBM College of Engineering & Technology, Dindigul, Tamil Nadu

Online published on 7 November, 2013.

Abstract

The link quality variation of wireless channels has been a challenging issue in data communications until recent explicit exploration in utilizing this characteristic. The same broadcast transmission may be perceived significantly differently, and usually independently, by receivers at different geographic locations. Furthermore, even the same stationary receiver may experience drastic link quality fluctuation over time. The combination of link-quality variation with the broadcasting nature of wireless channels has revealed a direction in the research of wireless networking, namely, cooperative communication. Research on cooperative communication started to attract interests in the community at the physical layer but more recently its importance and usability have also been realized at upper layers of the network protocol stack. In this article, we tackle the problem of opportunistic data transfer in mobile ad hoc networks. Our solution is called Cooperative Opportunistic Routing in Mobile Ad hoc Networks (CORMAN). It is a pure network layer scheme that can be built atop off-the-shelf wireless networking equipment. The new implementation part contains the security features, which provides the accurate node selection and its location access mechanism and also provides the security of data from unauthorized user. Mainly there three new features are added with the CORMAN mechanism. There are 1. Mobile Prediction(MP)-Nodes that frequently change their motion need to frequently update their neighbors, since their locations are changing dynamically 2. On-Demand Learning(OLD)-The MP rule solely, may not be sufficient for maintaining an accurate local topology. According to this rule, whenever a node overhears a data transmission from a new neighbor, it broadcasts a beacon as a response. 3. Rumor Riding(RR)-It is employing a random walk concept, RR issues key rumors and cipher rumors separately, It provides a high degree of anonymity.

Keywords

Cooperative communication, opportunistic routing, mobile ad hoc networks, proactive source routing, forwarder list update, On-Demand Learning, Mobility prediction, Rumor Riding