A Jini Based Implementation for Best Leader Node Selection in MANETs

MANETs provide a good alternative for handling the constraints of disconnectivity and disruption of static communication infrastructure faced during emergency situations. In such frameworks, it sometimes becomes necessary to elect a leader node for the MANET. Electing a leader node in a MANET poses several challenges due to the inherent properties of mobility, resource constraints etc. of these ad hoc networks. Although there are at present some existing leader node selection algorithms, it is difficult to apply them to MANET based frameworks where multiple selection of leader nodes is allowed, because of various reasons. This paper presents an algorithm for the best leader node selection, along with a network wide searching technique that a client uses to search for a particular service in the network, both of which are especially suitable for these types of frameworks.

[1]  Yu Zhang,et al.  Design and implementation of a leader election algorithm in hierarchy mobile ad hoc network , 2009, 2009 4th International Conference on Computer Science & Education.

[2]  Nandini Mukherjee,et al.  Determining JINI leasing time limits using the random waypoint mobility model in mobile ad hoc networks , 2010, 2010 International Conference on Networking and Information Technology.

[3]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[4]  Lionel M. Ni,et al.  Service discovery in pervasive computing environments , 2005, IEEE Pervasive Computing.

[5]  Scott Rose,et al.  Self-adaptive leasing for jini , 2003, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)..

[6]  Oksam Chae,et al.  Performance analysis of Leader Election Algorithms in Mobile Ad hoc Networks , 2008 .

[7]  Chonggun Kim,et al.  A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks , 2007, ICESS.