Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks
#1

A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks

Aim:

The mainstay of this project is to achieve the repair strategies to tolerate the frequent topological reconfigurations in Mobile AdHoc Networks by Content Based Routing (CBR) using a protocol namely COMAN.

CONTENT BASED ROUTING (CBR)
differs from classical routing in that messages are addressed based on their content instead of their destination. In conventional systems, the sender explicitly specifies the intended message recipients using a unicast or multicast address. Instead, in CBR, the sender simply injects the message in the network, which determines how to route it according to the nodesâ„¢ interests. Therefore, in CBR, it is the receiver that determines message delivery, not the sender. Although it enables multipoint communication, CBR is not simply multicast. In multicast, the address of the multicast groups (or topics) must be defined a priori and made globally known or available. In CBR, message consumers define their own message classes. These select only the desired messages, need not be known to other components, and can be arbitrarily overlapping. The difference between multicast and CBR is reflected also in the routing mechanisms enabling them. Multicast approaches typically propagate messages along a tree defined on a per-group basis, spanning all the receivers for that group. Therefore, a message addressed to multiple groups is typically duplicated at the sender, and each copy is routed independently. In CBR, the absence of an explicit and a priori definition of groups, along with the fact that every message can be addressed to a different set of components, discourages the use of separate per-group trees. Instead, most systems connect all the brokers (the CBR application level routers) in a single tree-shaped network. This broker tree is exploited to forward messages. Usually, these are not flooded to the entire tree but routed toward the interested components according to the message content and the subscriptions stored at tree nodes.
Motivation: CBR fosters a form of implicit communication that breaks the coupling between senders and receivers. Senders no longer need to determine the address of communication parties. Similarly, receivers do not know who is the sender of a message, unless this information is somehow encoded in the message itself. The sharp decoupling induced by this form of communication enables one to easily add, remove, or change components at runtime with little impact on the overall architecture.
Contribution: This paper overcomes the limitation above by achieving the following goal:

Defining a protocol to organize the nodes of a MANET in a single self-repairing tree that efficiently supports CBR

The goal of supporting CBR explains the rationale behind the choice of a tree topology. Therefore, our self-repairing tree enables the reuse of mainstream CBR protocols in the dynamic scenario characterizing MANETs, by leveraging off the consistent body of results related to the tree-based CBR. At the same time, providing a tree able to self-repair upon changes in the physical topology of a MANET is only our minimal (and obvious) target. Our ultimate goal is to design a protocol whose characteristics simplify the operations of the CBR layer operating on it.

Existing System:

In Multicast Ad Hoc On-Demand Distance Vector (MAODV) protocol for multicast over MANETs. Indeed, MAODV organizes the members of each multicast group in a single tree without relying on any underlying multihop unicast solution. Moreover, the page link repair process of MAODV is localized around one of the two end points of the broken link. This limits the impact of reconfiguration to a small portion of the system

Proposed System:

This paper proposes the logic concerned with the maintenance of the tree topology and adapt, extend, and optimize it in a context from MAODV. It was not designed for CBR. The result and main contribution of this paper is COntent-based routing for Mobile Ad hoc Networks (COMAN), a protocol for maintaining a CBR

System Requirements:

Hardware Requirements

¢ SYSTEM : Pentium IV 2.4 GHz
¢ HARD DISK : 40 GB
¢ FLOPPY DRIVE : 1.44 MB
¢ MONITOR : 15 VGA colour
¢ MOUSE : Logitech.
¢ RAM : 256 MB

Software Requirements

¢ Operating system :- Windows XP Professional
¢ Front End :- Microsoft Visual Studio .Net 2005
¢ Coding Language :- Visual C# .Net
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Popular Searches: matlab code self organinsing tree algorithm, topology control in mobile ad hoc networking with coporative communication ppt, process of wagon repairing worksho, self interested routing in over, two wheeler repairing books, sukam inverter repairing solution diagrams free downloads websites, road repairing and tracking system report,

[-]
Quick Reply
Message
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Messages In This Thread
Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks - by project report maker - 05-07-2010, 07:10 PM

Possibly Related Threads...
Thread Author Replies Views Last Post
  Opportunistic Routing in Multi-radio Multi-channel Multi-hop Wireless Networks seminar class 4 3,599 17-10-2017, 02:48 PM
Last Post: jaseela123d
  Privacy- and Integrity-Preserving Range Queries in Sensor Networks 1 881 15-02-2017, 04:10 PM
Last Post: jaseela123d
  Protecting Location Privacy in Sensor Networks Against a Global Eavesdropper 1 816 15-02-2017, 11:01 AM
Last Post: jaseela123d
  Protecting Location Privacy in Sensor Networks Against a Global Eavesdropper 1 786 15-02-2017, 11:00 AM
Last Post: jaseela123d
  SPOC: A Secure and Privacy-preserving Opportunistic Computing Framework for Mobile-He 1 921 14-02-2017, 03:49 PM
Last Post: jaseela123d
  Content-based image retrieval (CBIR) System project topics 15 13,854 13-05-2016, 02:30 PM
Last Post: dhanabhagya
  projects on computer networks? shakir_ali 2 1,612 25-01-2016, 02:26 PM
Last Post: seminar report asees
  DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORKS--PARALLEL AND DISTRIBU electronics seminars 9 7,394 14-07-2015, 02:25 PM
Last Post: seminar report asees
  Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks Projects9 2 1,338 14-07-2015, 02:11 PM
Last Post: seminar report asees
  An Acknowledgement-Based Approach for the Detection of routing misbehavior in MANETs mechanical engineering crazy 2 2,991 26-05-2015, 03:04 PM
Last Post: seminar report asees

Forum Jump: