Exploiting opportunistic overhearing to improve performance of mutual exclusion in wireless ad hoc networks

Authors:
Ghazale Hosseinabadi;Nitin H. Vaidya
Affiliations:
Department of ECE and Coordinated Science Lab, University of Illinois at Urbana-Champaign, Urbana, IL;Department of ECE and Coordinated Science Lab, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Year:
2012

Citing 6
Cited 0

A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems

IEEE Transactions on Computers
An efficient and fault-tolerant solution for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
A mutual exclusion algorithm for ad hoc mobile networks

Wireless Networks
A distributed K-mutual exclusion algorithm

ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
A dual-token-based fault tolerant mutual exclusion algorithm for MANETs

MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We design two mutual exclusion algorithms for wireless networks. Our mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages is exploited. The design goal is to decrease the number of transmitted messages and delay per critical section entry using the information obtained from overheard messages.