Title: Secured MPR node selection in the presence of cheating nodes

Authors: Jeril Kuriakose; Sandeep Joshi

Addresses: School of Computing and Information Technology, Manipal University Jaipur, Rajasthan, India; Department of Information Technology, St. John College of Engineering, Maharastra, India ' School of Computing and Information Technology, Manipal University Jaipur, Rajasthan, India

Abstract: In MANETs, exchange of data is carried out with the help neighbouring nodes, and the destination node is identified with the broadcasting schemes. Broadcasting schemes are considered to increase the efficiency, and MPR broadcasting scheme is considered because of its reduced overhead. The message is broadcasted only to the selected MPR nodes, thus reducing flooding in the network. Nodes that are selected to act as the MPR nodes can be any neighbouring nodes, and there are no significant conditions that prove the MPR node's integrity. In this paper, we have proposed a novel approach in selecting the MPR nodes by adding an additional security feature before MPR node selection. Our security feature does not add any additional communicational overhead or data exchanges. We were also able to reduce the localisation error by using Mahalanobis distance and maximum-likelihood. Localisation techniques were used during simulation to verify the time constraints and efficiency.

Keywords: localisation; trilateration; maximum-likelihood; wireless networks; Mahalanobis distance; mobile ad hoc networks; MANETs; network security; multipoint relay; MPR node selection; MPR broadcasting; MPR nodes; simulation.

DOI: 10.1504/IJTMCC.2016.081849

International Journal of Trust Management in Computing and Communications, 2016 Vol.3 No.3, pp.246 - 268

Received: 09 Dec 2015
Accepted: 21 Apr 2016

Published online: 27 Jan 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article