Skip to Main Content
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.