摘要
MAXM is a multi-channel MAC protocol for ad hoc networks. The idea of MAXM is to maximize utilization of bandwidth by adopting a distributed selfstabilizing maximal matching-transmission algorithm. In this paper, we prove that given a fixed number, p, of packets, MAXM is able to guarantee that all packets are delivered within O(pN + pT) time in the network of N mobile hosts, where T is the time to transmit a packet on a non-conflicting channel.
| 原文 | 英語 |
|---|---|
| 頁(從 - 到) | 880-887 |
| 頁數 | 8 |
| 期刊 | Journal of Networks |
| 卷 | 5 |
| 發行號 | 8 |
| DOIs | |
| 出版狀態 | 已發佈 - 2010 |
ASJC Scopus subject areas
- 電腦網路與通信