Title: Priority-based model for network partition problems for mobile ad hoc networks

Authors: G. Varaprasad; R.S.D. Wahidabanu

Addresses: Department of Computer Science and Engineering, B.M.S. College of Engineering, Bangalore 560 019, India ' Department of Electronics and Communication Engineering, Government College of Engineering, Salem 636 036, India

Abstract: In mobile ad hoc networks, it is collection of nodes used for communication among the nodes. Due to the node mobility, the network may be divided into a number of parts. This paper proposes a priority-based model for mobile ad hoc networks, which assigns the weights to all nodes. Here, the high-priority nodes must maintain connections against those of low-priority nodes. The proposed model has been simulated with the help of 100 mobile nodes in the network using Network Simulator (NS-2.34). The proposed model was simulated and tested under the various environments. It was compared with Goyal model and Hähner model. The simulation results have shown that the proposed model has reached the top position in terms of the network size, percentage of path reconstruction and average delay.

Keywords: MANETs; mobile ad hoc networks; network partition; partition size; percentage of path reconstruction; average delay; mobile networks; priority-based modelling; simulation.

DOI: 10.1504/IJRFITA.2013.054664

International Journal of Radio Frequency Identification Technology and Applications, 2013 Vol.4 No.2, pp.138 - 148

Received: 20 Nov 2010
Accepted: 03 Oct 2011

Published online: 20 Sep 2014 *

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