A NEW UNOBSERVABLE SCHEME TO THWART NODES FROM SELFISHNESS ACT IN MANET

Anaphora resolution is a complex problem in natural language processing and has attracted the attention of many researchers. This is one of the most basic aspects of language interpretation. The study of anaphora and anaphora resolution has yielded many basic developments in computational linguistics and theoretical linguistics, and in important practical applications such as information extraction, automatic summarization, automated question answering, and machine translation. This paper is an overview of anaphoric resolution and provides a brief survey of the elementary computational strategies used to perform anaphoric resolution server or by a key management scheme like. The unobservable routing protocol is then executed in two phases. First, an anonymous key establishment process is performed to construct secret session keys. Then an unobservable route discovery process is executed to find a route to the destination. So the design of USOR offers strong privacy protection—completes unlinkability and content unobservability—for ad hoc networks.