TY - GEN
T1 - Message efficient leader finding algorithm for mobile ad hoc networks
AU - Singh, Awadhesh Kumar
AU - Sharma, Shantanu
PY - 2011
Y1 - 2011
N2 - MANET is very hostile environment to design and implement computing algorithms. One of the major concerns in MANET's is to elect a coordinator in order to manage many mobile computing applications. In the contemporary literature, many protocols exist for leader election. However, most of them use message broadcast technique. The present article proposes a technique that avoids the broadcast of messages and uses multicast and unicast for leader election. The correctness proof and efficiency analysis of the proposed technique has also been included.
AB - MANET is very hostile environment to design and implement computing algorithms. One of the major concerns in MANET's is to elect a coordinator in order to manage many mobile computing applications. In the contemporary literature, many protocols exist for leader election. However, most of them use message broadcast technique. The present article proposes a technique that avoids the broadcast of messages and uses multicast and unicast for leader election. The correctness proof and efficiency analysis of the proposed technique has also been included.
KW - Coordinator election
KW - Mobile ad hoc networks
UR - http://www.scopus.com/inward/record.url?scp=79952558344&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79952558344&partnerID=8YFLogxK
U2 - 10.1109/COMSNETS.2011.5716512
DO - 10.1109/COMSNETS.2011.5716512
M3 - Conference contribution
AN - SCOPUS:79952558344
SN - 9781424489534
T3 - 2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011
BT - 2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011
T2 - 2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011
Y2 - 4 January 2011 through 8 January 2011
ER -