scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Classification and prediction of routing nodes behavior in MANET using Fuzzy proximity relation and ordering with Bayesian classifier

15 Apr 2013-pp 454-460
TL;DR: A prediction model based on the Bayesian approach with fuzzy proximity relation and ordering to predict the link-failure and hidden associations using routing information system of MANET is proposed.
Abstract: Mobile Ad-hoc Network (MANET) is a technology that has been developed for real-world applications. The routing information system of MANET can be said to be the back bone for routing process which also represents the characteristics or behaviours of routing nodes. The performance of MANET can be improved if the routing is done based on nodes routing behaviours. Thus, classification and prediction of routing nodes behaviour could lead to proper data analysis and decision making through which an effective routing model can be developed. Association among the routing attributes could help us to predict the behaviour of routing nodes based on the similarity but it is also possible that some of the associations may be hidden due to uncertain behaviour of the routing nodes. Absence of unseen associations may possess some necessary information which should not be ignored when we build an effective routing model. Keeping this in view, we have proposed a prediction model based on the Bayesian approach with fuzzy proximity relation and ordering to predict the link-failure and hidden associations using routing information system of MANET. Since the values in the routing information system are almost identical, we have considered the almost indiscernibility relation to characterize the routing nodes based on fuzzy proximity relation. This result induces the almost equivalence class of routing nodes. On imposing order relation on this equivalence class, we have obtained ordered categorical classes of routing nodes through which we can compute the link-failure possibilities of each routing node. Finally, we use the Bayesian approach to predict the hidden associations of routing attributes which can provide useful information to build an effective routing model for MANET.
Citations
More filters
Proceedings ArticleDOI
12 Mar 2015
TL;DR: Various machine learning techniques are studied as artificial neural network, support vector machine, decision tree, Q-learning, Bayesian network for identifying the malicious nodes and future behaviors of the nodes are predicted with supervised, un-supervised, reinforcement machinelearning techniques.
Abstract: Mobile ad-hoc networks have to suffer with different types of packet dropping attacks. Therefore, we need strong mechanism to detect these malevolent nodes and to classify normal and abnormal nodes as per the behavior of nodes. Machine learning techniques distinguish outlier nodes quickly and accurately provide classification by observing behavior of those nodes in the network. In this paper, we study various machine learning techniques as artificial neural network, support vector machine, decision tree, Q-learning, Bayesian network for identifying the malicious nodes. These techniques are able to detect black hole, gray hole, flooding attacks and other packet dropping attacks. These types of misbehaving nodes are identified and future behaviors of the nodes are predicted with supervised, un-supervised, reinforcement machine learning techniques.

15 citations


Cites methods from "Classification and prediction of ro..."

  • ...Classification and prediction of routing nodes behavior in MANET using Fuzzy proximity relation and ordering with Bayesian classifier [28] Bayesian classifier predict the behavior of node with ordering attributes and fuzzy proximities relations responsible for relationship and priorities Bayesian algorithm, fuzzy proximities relation RREQ, RREP, control packets, node speed Classification and prediction of behavior of routing nodes Hidden and uncertain behavior of nodes Improve control packets and accuracy in prediction...

    [...]

  • ...[28] proposed prediction model with Bayesian classifier and predict the link failure and hidden association with fuzzy proximity relation using routing information of nodes....

    [...]

Journal Article
TL;DR: SKEMA adopts Clique based graph theoretic approach to detect node activity and identifying neighbors during random mobility and works on developing a random key based exchange approach among clustered nodes in network.
Abstract: Though numerous research challenges in security focus on MANET, the need for design based secure Group Communication Systems (GCSs) is always a major constraint. The constraint is felt towards incorporation of group based multi-hop security for variable services which requires resource constraints. SKEMA adopts Clique based graph theoretic approach to detect node activity and identifying neighbors during random mobility. SKEMA focuses on towards design of trust mapping mechanism by identifying the maximal connectivity in network. SKEMA also works on developing a random key based exchange approach among clustered nodes in network. SKEMA has been tested over CLIQUES and PROFIDES schemes over secured session maintenance and handling node failure. SKEMA performs better when compared with existing approaches and hence suits well for multi-hop type of services.

2 citations


Cites background from "Classification and prediction of ro..."

  • ...The Key Management Protocol takes the responsibility of key generation [17] and distribution of distributed cluster [20] managed key protocol over multiple nodes....

    [...]

  • ...Many security schemes from different aspects of MANET have been proposed in order to protect the routing information or data packets during communication over secure routing protocols [7],[13],[20],[27] and secure key management solutions [13],[19]....

    [...]

Proceedings ArticleDOI
09 Apr 2016
TL;DR: Simulation and the experimental results showed that the mechanism could provide a better QoS route for the multi-media transmission under realtime constraint in MANET, named ad-hoc on-demand distance vector routing based on location information and linkstability evaluation (LL-AODV).
Abstract: The development and widespread use of real-time constrained multi-media application in MANET has resulted in the need to optimize or update current routing mechanisms. This paper proposed a QoS routing mechanism for multi-media transmission under real-time constraint in MANET, named ad-hoc on-demand distance vector routing based on location information and linkstability evaluation (LL-AODV). The mechanism abstracts the routing problems into the shortest path problem of an undirected weighted graph in which the weights of the paths are determined by the duration time of links, the residual battery and energy consumption of nodes, and utilizes the shortest path algorithm to determine a feasible transport path. We use a prediction model of the duration time of links to predict the probable time the link may maintain, and that improves the deficiency of the AODV routing mechanism, which only uses hop counts as the transport path metric. Furthermore, it adopts periodical maintenance and rescue maintenance to ensure an alternative path can be found in time to transmit data, and thus improves the reliability of multimedia data transmission under real-time constraint. Simulation and the experimental results showed that the mechanism could provide a better QoS route for the multi-media transmission under realtime constraint in MANET.

Cites methods from "Classification and prediction of ro..."

  • ...[14] introduced the method of Bayesian classifier and fuzzy proximity relation to classifier the MANET and predict the movement of nodes, and it could get a more efficient routing mechanism....

    [...]

References
More filters
Journal ArticleDOI
TL;DR: Routing protocols for ad hoc networks are examined by providing an overview of eight different protocols by presenting their characteristics and functionality, and then a comparison and discussion of their respective merits and drawbacks are provided.
Abstract: An ad hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This article examines routing protocols for ad hoc networks and evaluates these protocols based on a given set of parameters. The article provides an overview of eight different protocols by presenting their characteristics and functionality, and then provides a comparison and discussion of their respective merits and drawbacks.

4,278 citations

Journal ArticleDOI
01 Jul 2003
TL;DR: The important role that mobile ad hoc networks play in the evolution of future wireless technologies is explained and the latest research activities in these areas are reviewed, including a summary of MANETs characteristics, capabilities, applications, and design constraints.
Abstract: Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, ‘‘ad-hoc’’ network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANETs characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future. � 2003 Elsevier B.V. All rights reserved.

1,430 citations


"Classification and prediction of ro..." refers background in this paper

  • ...MANET is based on self-creation, self-organization, selfadministration and has high potential for real-world applications [1]....

    [...]

Journal ArticleDOI
01 Jan 2004
TL;DR: In this article, a wide range of routing protocols have been proposed in the literature and a performance comparison of all routing protocols and suggest which protocols may perform best in large networks is provided.
Abstract: The 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the dynamic nature of these networks demands new set of networking strategies to be implemented in order to provide efficient end-to-end communication. This, along with the diverse application of these networks in many different scenarios such as battlefield and disaster recovery, have seen MANETs being researched by many different organisations and institutes. MANETs employ the traditional TCP/IP structure to provide end-to-end communication between nodes. However, due to their mobility and the limited resource in wireless networks, each layer in the TCP/IP model require redefinition or modifications to function efficiently in MANETs. One interesting research area in MANET is routing. Routing in the MANETs is a challenging task and has received a tremendous amount of attention from researches. This has led to development of many different routing protocols for MANETs, and each author of each proposed protocol argues that the strategy proposed provides an improvement over a number of different strategies considered in the literature for a given network scenario. Therefore, it is quite difficult to determine which protocols may perform best under a number of different network scenarios, such as increasing node density and traffic. In this paper, we provide an overview of a wide range of routing protocols proposed in the literature. We also provide a performance comparison of all routing protocols and suggest which protocols may perform best in large networks.

1,281 citations

Journal ArticleDOI
TL;DR: In tolerance approximation spaces the lower and upper set approximations are defined and the tolerance relation defined by the so called uncertainty function or the positive region of a given partition of objects have been chosen as invariants in the attribute reduction process.
Abstract: We generalize the notion of an approximation space introduced in [8] In tolerance approximation spaces we define the lower and upper set approximations We investigate some attribute reduction problems for tolerance approximation spaces determined by tolerance information systems The tolerance relation defined by the so called uncertainty function or the positive region of a given partition of objects have been chosen as invariants in the attribute reduction process We obtain the solutions of the reduction problems by applying boolean reasoning [1] The solutions are represented by tolerance reducts and relative tolerance reducts

955 citations


"Classification and prediction of ro..." refers background in this paper

  • ...Therefore, indiscernibility relation is formalized as a tolerance relation or proximity relation [6]....

    [...]

Journal ArticleDOI
TL;DR: The presented approach leads to a new information systems organization and the implementation shows many advantages compared with other methods.

607 citations


"Classification and prediction of ro..." refers background in this paper

  • ...The above formalization is based on equivalence relations in [7] and indicates that node n1 is ordered than n2 if and only if n1 has higher priority-order than n2 according to all attributes in P[13]....

    [...]