By Topic

Maximizing resource sharing by minimizing response time in ad-hoc network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Rajeswari ; Angel College of Engineering and Technology, Tirupur, India ; T. Dhivya

In a mobile ad hoc network, nodes that are close to one another may need to have exclusive access to a shared resource, which means that only one node can access the resource at the same time. This mutual exclusion algorithm requires nodes to communicate with only their current neighbors, this paper provides a solution to this problem and it is an extension to mobile networks of the dining philosopher's problem. A Primary goal in the design of wireless sensor networks is life time maximization, constrained by the energy capacity of batteries. One well known method to reduce energy consumption in such networks is data aggregation. It has the advantage of incurring less communication overhead. One of the features of an algorithm is having response time and failure locality independent of the total number of nodes, and thus providing a scalable and robust solution. One of this algorithm has response time that depends on the number of nodes in the entire system and is polynomial in the maximum number of neighboring nodes; the failure locality, is small and grows very slowly with system size and it does not provide optimal solution. The second algorithm has optimal failure locality and response time that is quadratic in the number of nodes. The important aspect of the later algorithm is that it gives linear response time when nodes do not move, provides better improvement in previous results.

Published in:

Communication and Computational Intelligence (INCOCCI), 2010 International Conference on

Date of Conference:

27-29 Dec. 2010