Floor acquisition multiple access (FAMA) for packet-radio networks
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Floor acquisition multiple access (FAMA) in single-channel wireless networks
Mobile Networks and Applications
ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 10th annual international conference on Mobile computing and networking
A Multi-Radio Unification Protocol for IEEE 802.11 Wireless Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
rDCF: A Relay-Enabled Medium Access Control Protocol for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Altruistic cooperation for energy-efficient multi-channel MAC protocols
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Analyzing multi-channel medium access control schemes with ALOHA reservation
IEEE Transactions on Wireless Communications
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Capacity bounds for Cooperative diversity
IEEE Transactions on Information Theory
CoopMAC: A Cooperative MAC for Wireless LANs
IEEE Journal on Selected Areas in Communications
Cognitive DISH: virtual spectrum sensing meets cooperation
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
| Hi-index | 0.00 |
For long, node cooperation has been exploited as a data relaying mechanism. However, the wireless channel allows for much richer interaction between nodes. One such scenario is in a multi-channel environment, where transmitter-receiver pairs may make incorrect decisions (e.g., in selecting channels) but idle neighbors could help by sharing information to prevent undesirable consequences (e.g., data collisions). This represents a Distributed Information SHaring (DISH) mechanism for cooperation and suggests new ways of designing cooperative protocols. However, what is lacking is a theoretical understanding of this new notion of cooperation. In this paper, we view cooperation as a network resource and evaluate the availability of cooperation via a metric, pco, the probability of obtaining cooperation. First, we analytically evaluate pco in the context of multi-channel multi-hop wireless networks. Second, we verify our analysis via simulations and the results show that our analysis accurately characterizes the behavior of pco as a function of underlying network parameters. This step also yields important insights into DISH with respect to network dynamics. Third, we investigate the correlation between pco and network performance in terms of collision rate, packet delay, and throughput. The results indicate a near-linear relationship, which may significantly simplify performance analysis for cooperative networks and suggests that pco be used as an appropriate performance indicator itself. Throughout this work, we utilize, as appropriate, three different DISH contexts - model-based DISH, ideal DISH, and real DISH - to explore pco.