Home | History | Annotate | Line # | Download | only in net80211
ieee80211_rssadapt.c revision 1.4
      1  1.4  dyoung /* $NetBSD: ieee80211_rssadapt.c,v 1.4 2004/03/29 04:09:45 dyoung Exp $ */
      2  1.1  dyoung /*-
      3  1.1  dyoung  * Copyright (c) 2003, 2004 David Young.  All rights reserved.
      4  1.1  dyoung  *
      5  1.1  dyoung  * Redistribution and use in source and binary forms, with or
      6  1.1  dyoung  * without modification, are permitted provided that the following
      7  1.1  dyoung  * conditions are met:
      8  1.1  dyoung  * 1. Redistributions of source code must retain the above copyright
      9  1.1  dyoung  *    notice, this list of conditions and the following disclaimer.
     10  1.1  dyoung  * 2. Redistributions in binary form must reproduce the above
     11  1.1  dyoung  *    copyright notice, this list of conditions and the following
     12  1.1  dyoung  *    disclaimer in the documentation and/or other materials provided
     13  1.1  dyoung  *    with the distribution.
     14  1.1  dyoung  * 3. The name of David Young may not be used to endorse or promote
     15  1.1  dyoung  *    products derived from this software without specific prior
     16  1.1  dyoung  *    written permission.
     17  1.1  dyoung  *
     18  1.1  dyoung  * THIS SOFTWARE IS PROVIDED BY David Young ``AS IS'' AND ANY
     19  1.1  dyoung  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
     20  1.1  dyoung  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
     21  1.1  dyoung  * PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL David
     22  1.1  dyoung  * Young BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
     23  1.1  dyoung  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
     24  1.1  dyoung  * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     25  1.1  dyoung  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
     26  1.1  dyoung  * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
     27  1.1  dyoung  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  1.1  dyoung  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
     29  1.1  dyoung  * OF SUCH DAMAGE.
     30  1.1  dyoung  */
     31  1.1  dyoung 
     32  1.1  dyoung #include <sys/param.h>
     33  1.1  dyoung #include <sys/types.h>
     34  1.1  dyoung #include <sys/kernel.h>		/* for hz */
     35  1.1  dyoung 
     36  1.1  dyoung #include <net/if.h>
     37  1.1  dyoung #include <net/if_media.h>
     38  1.1  dyoung #include <net/if_ether.h>
     39  1.1  dyoung 
     40  1.1  dyoung #include <net80211/ieee80211_var.h>
     41  1.1  dyoung #include <net80211/ieee80211.h>
     42  1.1  dyoung #include <net80211/ieee80211_compat.h>
     43  1.1  dyoung #include <net80211/ieee80211_rssadapt.h>
     44  1.1  dyoung 
     45  1.3  dyoung #ifdef interpolate
     46  1.3  dyoung #undef interpolate
     47  1.3  dyoung #endif
     48  1.3  dyoung #define interpolate(parm, old, new) ((parm##_old * (old) + \
     49  1.3  dyoung                                      (parm##_denom - parm##_old) * (new)) / \
     50  1.3  dyoung 				    parm##_denom)
     51  1.3  dyoung 
     52  1.1  dyoung #ifdef IEEE80211_DEBUG
     53  1.1  dyoung static	struct timeval lastrateadapt;	/* time of last rate adaptation msg */
     54  1.1  dyoung static	int currssadaptps = 0;		/* rate-adaptation msgs this second */
     55  1.1  dyoung static	int ieee80211_adaptrate = 4;	/* rate-adaptation max msgs/sec */
     56  1.1  dyoung 
     57  1.1  dyoung #define RSSADAPT_DO_PRINT() \
     58  1.1  dyoung 	((ieee80211_debug > 0) && \
     59  1.1  dyoung 	 ppsratecheck(&lastrateadapt, &currssadaptps, ieee80211_adaptrate))
     60  1.1  dyoung #define	RSSADAPT_PRINTF(X) \
     61  1.1  dyoung 	if (RSSADAPT_DO_PRINT()) \
     62  1.1  dyoung 		printf X
     63  1.1  dyoung 
     64  1.1  dyoung #else
     65  1.1  dyoung #define	RSSADAPT_DO_PRINT() (0)
     66  1.1  dyoung #define	RSSADAPT_PRINTF(X)
     67  1.1  dyoung #endif
     68  1.1  dyoung 
     69  1.3  dyoung struct ieee80211_rssadapt_expavgctl master_expavgctl = {
     70  1.3  dyoung 	rc_decay_denom : 16,
     71  1.3  dyoung 	rc_decay_old : 15,
     72  1.3  dyoung 	rc_thresh_denom : 8,
     73  1.3  dyoung 	rc_thresh_old : 4,
     74  1.3  dyoung 	rc_avgrssi_denom : 8,
     75  1.3  dyoung 	rc_avgrssi_old : 4
     76  1.3  dyoung };
     77  1.3  dyoung 
     78  1.3  dyoung int
     79  1.3  dyoung ieee80211_rssadapt_choose(struct ieee80211_rssadapt *ra,
     80  1.3  dyoung     struct ieee80211_rateset *rs, struct ieee80211_frame *wh, u_int len,
     81  1.3  dyoung     int fixed_rate, const char *dvname, int do_not_adapt)
     82  1.3  dyoung {
     83  1.3  dyoung 	u_int16_t (*thrs)[IEEE80211_RATE_SIZE];
     84  1.3  dyoung 	int flags = 0, i, rateidx = 0, thridx, top;
     85  1.3  dyoung 
     86  1.3  dyoung 	if ((wh->i_fc[0] & IEEE80211_FC0_TYPE_MASK) == IEEE80211_FC0_TYPE_CTL)
     87  1.3  dyoung 		flags |= IEEE80211_RATE_BASIC;
     88  1.3  dyoung 
     89  1.3  dyoung 	for (i = 0, top = IEEE80211_RSSADAPT_BKT0;
     90  1.3  dyoung 	     i < IEEE80211_RSSADAPT_BKTS;
     91  1.3  dyoung 	     i++, top <<= IEEE80211_RSSADAPT_BKTPOWER) {
     92  1.3  dyoung 		thridx = i;
     93  1.3  dyoung 		if (len <= top)
     94  1.3  dyoung 			break;
     95  1.3  dyoung 	}
     96  1.3  dyoung 
     97  1.3  dyoung 	thrs = &ra->ra_rate_thresh[thridx];
     98  1.3  dyoung 
     99  1.3  dyoung 	if (fixed_rate != -1) {
    100  1.3  dyoung 		if ((rs->rs_rates[fixed_rate] & flags) == flags) {
    101  1.3  dyoung 			rateidx = fixed_rate;
    102  1.3  dyoung 			goto out;
    103  1.3  dyoung 		}
    104  1.3  dyoung 		flags |= IEEE80211_RATE_BASIC;
    105  1.3  dyoung 		i = fixed_rate;
    106  1.3  dyoung 	} else
    107  1.3  dyoung 		i = rs->rs_nrates;
    108  1.3  dyoung 
    109  1.3  dyoung 	while (--i >= 0) {
    110  1.3  dyoung 		rateidx = i;
    111  1.3  dyoung 		if ((rs->rs_rates[i] & flags) != flags)
    112  1.3  dyoung 			continue;
    113  1.3  dyoung 		if (do_not_adapt)
    114  1.3  dyoung 			break;
    115  1.3  dyoung 		if ((*thrs)[i] < ra->ra_avg_rssi)
    116  1.3  dyoung 			break;
    117  1.3  dyoung 	}
    118  1.3  dyoung 
    119  1.3  dyoung out:
    120  1.3  dyoung 	if (dvname != NULL) {
    121  1.3  dyoung 		printf("%s: dst %s threshold[%d, %d.%d] %d < %d\n",
    122  1.3  dyoung 		    dvname, ether_sprintf(wh->i_addr1), len,
    123  1.3  dyoung 		    (rs->rs_rates[rateidx] & IEEE80211_RATE_VAL) / 2,
    124  1.3  dyoung 		    (rs->rs_rates[rateidx] & IEEE80211_RATE_VAL) * 5 % 10,
    125  1.3  dyoung 		    (*thrs)[rateidx], ra->ra_avg_rssi);
    126  1.3  dyoung 	}
    127  1.3  dyoung 	return rateidx;
    128  1.3  dyoung }
    129  1.1  dyoung 
    130  1.1  dyoung void
    131  1.1  dyoung ieee80211_rssadapt_updatestats(struct ieee80211_rssadapt *ra)
    132  1.1  dyoung {
    133  1.1  dyoung 	long interval;
    134  1.1  dyoung 
    135  1.1  dyoung 	ra->ra_pktrate =
    136  1.1  dyoung 	    (ra->ra_pktrate + 10 * (ra->ra_nfail + ra->ra_nok)) / 2;
    137  1.1  dyoung 	ra->ra_nfail = ra->ra_nok = 0;
    138  1.1  dyoung 
    139  1.1  dyoung 	/* a node is eligible for its rate to be raised every 1/10 to 10
    140  1.1  dyoung 	 * seconds, more eligible in proportion to recent packet rates.
    141  1.1  dyoung 	 */
    142  1.1  dyoung 	interval = MAX(100000, 10000000 / MAX(1, 10 * ra->ra_pktrate));
    143  1.1  dyoung 	ra->ra_raise_interval.tv_sec = interval / (1000 * 1000);
    144  1.1  dyoung 	ra->ra_raise_interval.tv_usec = interval % (1000 * 1000);
    145  1.1  dyoung }
    146  1.1  dyoung 
    147  1.1  dyoung void
    148  1.1  dyoung ieee80211_rssadapt_input(struct ieee80211com *ic, struct ieee80211_node *ni,
    149  1.1  dyoung     struct ieee80211_rssadapt *ra, int rssi)
    150  1.1  dyoung {
    151  1.2  dyoung #ifdef IEEE80211_DEBUG
    152  1.1  dyoung 	int last_avg_rssi = ra->ra_avg_rssi;
    153  1.2  dyoung #endif
    154  1.1  dyoung 
    155  1.3  dyoung 	ra->ra_avg_rssi = interpolate(master_expavgctl.rc_avgrssi,
    156  1.3  dyoung 	                              ra->ra_avg_rssi, (rssi << 8));
    157  1.1  dyoung 
    158  1.1  dyoung 	RSSADAPT_PRINTF(("%s: src %s rssi %d avg %d -> %d\n",
    159  1.1  dyoung 	    ic->ic_if.if_xname, ether_sprintf(ni->ni_macaddr),
    160  1.1  dyoung 	    rssi, last_avg_rssi, ra->ra_avg_rssi));
    161  1.1  dyoung }
    162  1.1  dyoung 
    163  1.1  dyoung /*
    164  1.1  dyoung  * Adapt the data rate to suit the conditions.  When a transmitted
    165  1.1  dyoung  * packet is dropped after IEEE80211_RSSADAPT_RETRY_LIMIT retransmissions,
    166  1.1  dyoung  * raise the RSS threshold for transmitting packets of similar length at
    167  1.1  dyoung  * the same data rate.
    168  1.1  dyoung  */
    169  1.1  dyoung void
    170  1.1  dyoung ieee80211_rssadapt_lower_rate(struct ieee80211com *ic,
    171  1.1  dyoung     struct ieee80211_node *ni, struct ieee80211_rssadapt *ra,
    172  1.1  dyoung     struct ieee80211_rssdesc *id)
    173  1.1  dyoung {
    174  1.1  dyoung 	struct ieee80211_rateset *rs = &ni->ni_rates;
    175  1.1  dyoung 	u_int16_t last_thr;
    176  1.1  dyoung 	u_int i, thridx, top;
    177  1.1  dyoung 
    178  1.4  dyoung 	ra->ra_nfail++;
    179  1.1  dyoung 
    180  1.1  dyoung 	if (id->id_rateidx >= rs->rs_nrates) {
    181  1.1  dyoung 		RSSADAPT_PRINTF(("ieee80211_rssadapt_lower_rate: "
    182  1.1  dyoung 		    "%s rate #%d > #%d out of bounds\n",
    183  1.1  dyoung 		    ether_sprintf(ni->ni_macaddr), id->id_rateidx,
    184  1.1  dyoung 		        rs->rs_nrates - 1));
    185  1.1  dyoung 		return;
    186  1.1  dyoung 	}
    187  1.1  dyoung 
    188  1.1  dyoung 	for (i = 0, top = IEEE80211_RSSADAPT_BKT0;
    189  1.1  dyoung 	     i < IEEE80211_RSSADAPT_BKTS;
    190  1.1  dyoung 	     i++, top <<= IEEE80211_RSSADAPT_BKTPOWER) {
    191  1.1  dyoung 		thridx = i;
    192  1.1  dyoung 		if (id->id_len <= top)
    193  1.1  dyoung 			break;
    194  1.1  dyoung 	}
    195  1.1  dyoung 
    196  1.1  dyoung 	last_thr = ra->ra_rate_thresh[thridx][id->id_rateidx];
    197  1.1  dyoung 	ra->ra_rate_thresh[thridx][id->id_rateidx] =
    198  1.3  dyoung 	    interpolate(master_expavgctl.rc_thresh, last_thr,
    199  1.3  dyoung 	                (id->id_rssi << 8));
    200  1.1  dyoung 
    201  1.1  dyoung 	RSSADAPT_PRINTF(("%s: dst %s rssi %d threshold[%d, %d.%d] %d -> %d\n",
    202  1.1  dyoung 	    ic->ic_if.if_xname, ether_sprintf(ni->ni_macaddr),
    203  1.1  dyoung 	    id->id_rssi, id->id_len,
    204  1.1  dyoung 	    (rs->rs_rates[id->id_rateidx] & IEEE80211_RATE_VAL) / 2,
    205  1.1  dyoung 	    (rs->rs_rates[id->id_rateidx] & IEEE80211_RATE_VAL) * 5 % 10,
    206  1.1  dyoung 	    last_thr, ra->ra_rate_thresh[thridx][id->id_rateidx]));
    207  1.1  dyoung }
    208  1.1  dyoung 
    209  1.1  dyoung void
    210  1.1  dyoung ieee80211_rssadapt_raise_rate(struct ieee80211com *ic,
    211  1.1  dyoung     struct ieee80211_rssadapt *ra, struct ieee80211_rssdesc *id)
    212  1.1  dyoung {
    213  1.1  dyoung 	u_int16_t (*thrs)[IEEE80211_RATE_SIZE], newthr, oldthr;
    214  1.1  dyoung 	struct ieee80211_node *ni = id->id_node;
    215  1.1  dyoung 	struct ieee80211_rateset *rs = &ni->ni_rates;
    216  1.2  dyoung 	int i, rate, top;
    217  1.2  dyoung #ifdef IEEE80211_DEBUG
    218  1.2  dyoung 	int j;
    219  1.2  dyoung #endif
    220  1.1  dyoung 
    221  1.4  dyoung 	ra->ra_nok++;
    222  1.1  dyoung 
    223  1.1  dyoung 	if (!ratecheck(&ra->ra_last_raise, &ra->ra_raise_interval))
    224  1.1  dyoung 		return;
    225  1.1  dyoung 
    226  1.1  dyoung 	for (i = 0, top = IEEE80211_RSSADAPT_BKT0;
    227  1.1  dyoung 	     i < IEEE80211_RSSADAPT_BKTS;
    228  1.1  dyoung 	     i++, top <<= IEEE80211_RSSADAPT_BKTPOWER) {
    229  1.1  dyoung 		thrs = &ra->ra_rate_thresh[i];
    230  1.1  dyoung 		if (id->id_len <= top)
    231  1.1  dyoung 			break;
    232  1.1  dyoung 	}
    233  1.1  dyoung 
    234  1.1  dyoung 	if (id->id_rateidx + 1 < rs->rs_nrates &&
    235  1.1  dyoung 	    (*thrs)[id->id_rateidx + 1] > (*thrs)[id->id_rateidx]) {
    236  1.1  dyoung 		rate = (rs->rs_rates[id->id_rateidx + 1] & IEEE80211_RATE_VAL);
    237  1.1  dyoung 
    238  1.1  dyoung 		RSSADAPT_PRINTF(("%s: threshold[%d, %d.%d] decay %d ",
    239  1.1  dyoung 		    ic->ic_if.if_xname,
    240  1.1  dyoung 		    IEEE80211_RSSADAPT_BKT0 << (IEEE80211_RSSADAPT_BKTPOWER* i),
    241  1.1  dyoung 		    rate / 2, rate * 5 % 10, (*thrs)[id->id_rateidx + 1]));
    242  1.1  dyoung 		oldthr = (*thrs)[id->id_rateidx + 1];
    243  1.1  dyoung 		if ((*thrs)[id->id_rateidx] == 0)
    244  1.1  dyoung 			newthr = ra->ra_avg_rssi;
    245  1.1  dyoung 		else
    246  1.1  dyoung 			newthr = (*thrs)[id->id_rateidx];
    247  1.1  dyoung 		(*thrs)[id->id_rateidx + 1] =
    248  1.3  dyoung 		    interpolate(master_expavgctl.rc_decay, oldthr, newthr);
    249  1.1  dyoung 
    250  1.1  dyoung 		RSSADAPT_PRINTF(("-> %d\n", (*thrs)[id->id_rateidx + 1]));
    251  1.1  dyoung 	}
    252  1.1  dyoung 
    253  1.1  dyoung #ifdef IEEE80211_DEBUG
    254  1.1  dyoung 	if (RSSADAPT_DO_PRINT()) {
    255  1.1  dyoung 		printf("%s: dst %s thresholds\n", ic->ic_if.if_xname,
    256  1.1  dyoung 		    ether_sprintf(ni->ni_macaddr));
    257  1.1  dyoung 		for (i = 0; i < IEEE80211_RSSADAPT_BKTS; i++) {
    258  1.1  dyoung 			printf("%d-byte", IEEE80211_RSSADAPT_BKT0 << (IEEE80211_RSSADAPT_BKTPOWER * i));
    259  1.1  dyoung 			for (j = 0; j < rs->rs_nrates; j++) {
    260  1.1  dyoung 				rate = (rs->rs_rates[j] & IEEE80211_RATE_VAL);
    261  1.1  dyoung 				printf(", T[%d.%d] = %d", rate / 2,
    262  1.1  dyoung 				    rate * 5 % 10, ra->ra_rate_thresh[i][j]);
    263  1.1  dyoung 			}
    264  1.1  dyoung 			printf("\n");
    265  1.1  dyoung 		}
    266  1.1  dyoung 	}
    267  1.1  dyoung #endif /* IEEE80211_DEBUG */
    268  1.1  dyoung }
    269