Skip to main content
Log in

Sade: competitive MAC under adversarial SINR

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. Our second contribution is a distributed MAC protocol called Sade which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

Notes

  1. Sade stands for SINR Jade, the SINR variant of the jamming defense protocol in [39].

  2. While a conservative estimate on \(\log T\) and \(\log \log n\) would leave room for a superpolynomial change in n and a polynomial change in T over time without the need to update \(\gamma \), estimating n in adversarial settings within any reasonable guarantees (e.g., constant or polynomial) is challenging. Whether we can eliminate any dependence on n and T for \(\gamma \) remains an open question.

References

  1. Alistarh, D., Gilbert, S., Guerraoui, R., Milosevic, Z., Newport, C.: Securing your every bit: reliable broadcast in byzantine wireless networks. In: Proceedings Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 50–59 (2010)

  2. Alnifie, G., Simon, R.: A multi-channel defense against jamming attacks in wireless sensor networks. In: Proceedings of Q2SWinet, pp. 95–104 (2007)

  3. Awerbuch, B., Richa, A., Scheideler, C.: A jamming-resistant MAC protocol for single-hop wireless networks. In: Proceedings of ACM PODC (2008)

  4. Bayraktaroglu, E., King, C., Liu, X., Noubir, G., Rajaraman, R.,  Thapa, B.: On the performance of IEEE 802.11 under jamming. In: Proceedings of IEEE INFOCOM, pp. 1265–1273 (2008)

  5. Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Proceedings of ACM SPAA (2005)

  6. Bender, M.A., Fineman, J.T., Gilbert, S., Young, M.: How to scale exponential backoff: constant throughput, polylog access attempts, and robustness. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 636–654 (2016)

  7. Bertier, M., Kermarrec, A.-M., Tan, G.: Message-efficient byzantine fault-tolerant broadcast in a multi-hop wireless sensor network. In: Proceedings of IEEE 30th International Conference on Distributed Computing Systems (ICDCS), pp. 408–417 (2010)

  8. Brown, T., James, J., Sethi, A.: Jamming and sensing of encrypted wireless ad hoc networks. In: Proceedings of ACM International Symposium on Mobile Ad hoc Networking and Computing (MOBIHOC), pp. 120–130 (2006)

  9. Chiang, J., Hu, Y.-C.: Cross-layer jamming detection and mitigation in wireless broadcast networks. In: Proceedings of MOBICOM, pp. 346–349 (2007)

  10. Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple-access channel. In: Proceedings of ACM PODC (2006)

  11. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2), 115–143 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dams, J., Hoefer, M., Kesselheim, T.: Jamming-resistant learning in wireless networks. In: Proceedings of International Colloquium on Automata, Languages, and Programming (ICALP), pp. 447–458 (2014)

  13. Dolev, S., Gilbert, S., Guerraoui, R., Kowalski, D., Newport, C., Kuhn, F., Lynch, N.: Reliable distributed computing on unreliable radio channels. In: Proceedings of 2009 MOBIHOC S3 Workshop (2009)

  14. Dolev, S., Gilbert, S., Guerraoui, R., Kuhn, F., Newport, C.C.: The wireless synchronization problem. In: Proceedings of 28th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 190–199 (2009)

  15. Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Gossiping in a multi-channel radio network: an oblivious approach to coping with malicious interference. In: Proceedings of the Symposium on Distributed Computing (DISC) (2007)

  16. Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Secure communication over radio channels. In: Proceedings of 27th ACM Symposium on Principles of Distributed Computing (PODC), pp. 105–114 (2008)

  17. Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.C.: Gossiping in a multi-channel radio network. In: Proceedings of 21st International Symposium on Distributed Computing (DISC), pp. 208–222 (2007)

  18. Gilbert, S., Guerraoui, R., Kowalski, D., Newport, C.: Interference-resilient information exchange. In: Proceedings of the 28th Conference on Computer Communications. IEEE INFOCOM (2009)

  19. Gilbert, S., Guerraoui, R., Kowalski, D., Newport, C.C.: Interference-resilient information exchange. In: proceedings of 28th IEEE International Conference on Computer Communications (INFOCOM), pp. 2249–2257 (2009)

  20. Gilbert, S., Guerraoui, R., Newport, C.: Of malicious motes and suspicious sensors: on the efficiency of malicious interference in wireless networks. In: Proceedings of OPODIS (2006)

  21. Gilbert, S., King, V., Pettie, S., Porat, E., Saia, J., Young, M.: (Near) Optimal resource-competitive broadcast with jamming. In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 257–266 (2014)

  22. Gilbert, S.L., Zheng, C.: Sybilcast: broadcast on the open airwaves. In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 130–139 (2013)

  23. Goldberg, L.A., Mackenzie, P.D., Paterson, M., Srinivasan, A.: Contention resolution with constant expected delay. J. ACM 47(6), 1048 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  24. Gupta, P., Kumar, P.: The capacity of wireless networks. IEEE Trans. Inf. Theory 46(2), 388–404 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  25. Hastad, J., Leighton, T., Rogoff, B.: Analysis of backoff protocols for mulitiple accesschannels. SIAM J. Comput. 25(4), 740 (1996)

    Article  MathSciNet  Google Scholar 

  26. IEEE: Medium access control (MAC) and physical specifications. In: IEEE P802.11/D10 (1999)

  27. King, V., Saia, J., Young, M.: Conflict on a communication channel. In: Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), pp. 277–286 (2011)

  28. Koo, C., Bhandari, V., Katz, J., Vaidya, N.: Reliable broadcast in radio networks: the bounded collision case. In: Proceedings of ACM PODC (2006)

  29. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Radio network clustering from scratch. In: Proceedings of ESA (2004)

  30. Kwak, B.-J., Song, N.-O., Miller, L.E.: Performance analysis of exponential backoff. IEEE/ACM Trans. Netw. 13(2), 343–355 (2005)

  31. Li, M., Koutsopoulos, I., Poovendran, R.: Optimal jamming attacks and network defense policies in wireless sensor networks. In: Proceedings of IEEE INFOCOM, pp. 1307–1315 (2007)

  32. Liu, X., Noubir, G., Sundaram, R., Tan, S.: Spread: foiling smart jammers using multi-layer agility. In: Proceedings of IEEE INFOCOM, pp. 2536–2540 (2007)

  33. Meier, D., Pignolet, Y.A., Schmid, S., Wattenhofer, R.: Speed dating despite jammers. In: Proceedings of DCOSS (2009)

  34. Navda, V., Bohra, A., Ganguly, S., Rubenstein, D.: Using channel hopping to increase 802.11 resilience to jamming attacks. In: Proceedings of IEEE INFOCOM, pp. 2526–2530 (2007)

  35. Ogierman, A., Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Competitive mac under adversarial sinr. In: Proceedings of IEEE INFOCOM (2014)

  36. Pelc, A., Peleg, D.: Feasibility and complexity of broadcasting with random transmission failures. In: Proceedings of ACM PODC (2005)

  37. Raghavan, P., Upfal, E.: Stochastic contention resolution with short delays. SIAM J. Comput. 28(2), 709–719 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  38. Rappaport, T.: Wireless Communications. Prentice Hall PTR, Upper Saddle River (2002)

    Google Scholar 

  39. Richa, A., Scheideler, C., Schmid, S., Zhang, J.: A jamming-resistant MAC protocol for multi-hop wireless networks. In: Proceedings of DISC (2010)

  40. Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Competitive and fair medium access despite reactive jamming. In: Proceedings of 31st International Conference on Distributed Computing Systems (ICDCS) (2011)

  41. Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Self-stabilizing leader election for single-hop wireless networks despite jamming. In: Proceedings of 12th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC) (2011)

  42. Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of 31st Annual ACM Symposium on Principles of Distributed Computing (PODC) (2012)

  43. Scheideler, C., Richa, A., Santi, P.: An \(O(\log n)\) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: Proceedings of ACM International Symposium on Mobile Ad hoc Networking and Computing (MOBIHOC) (2008)

  44. Simon, M.K., Omura, J.K., Schultz, R.A., Levin, B.K.: Spread Spectrum Communications Handbook. McGraw-Hill, New York (2001)

    Google Scholar 

  45. Tan, H., Wacek, C., Newport, C., Sherr, M.: A disruption-resistant mac layer for multichannel wireless networks. In: Proceedings of International Conference on Principles of Distributed Systems (OPODIS), pp. 202–216 (2014)

  46. Wood, A., Stankovic, J., Zhou, G.: DEEJAM: defeating energy-efficient jamming in IEEE 802.15.4-based wireless networks. In: Proceedings of SECON (2007)

  47. Xu, W., Wood, T., Zhang, Y.: Channel surfing and spatial retreats: defenses against wireless denial of service. In: Proceedings of Workshop on Wireless Security (2004)

Download references

Acknowledgements

The authors would like to thank Michael Meier from the University of Paderborn for his help with the evaluation of the protocol. This research is partly supported by the Danish Villum project ReNet.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefan Schmid.

Additional information

A first version of this paper was presented at the IEEE INFOCOM 2014 conference [35].

A Proof of Lemma 3

A Proof of Lemma 3

We prove the lemma for the case that initially \(p_S \le \rho _{green}\); the other case is analogous. Consider some fixed round t in \(I'\). Let \(p_S\) be the cumulative probability at the beginning of t and \(p'_S\) be the cumulative probability at the end of t. Moreover, let \(p_{S}^{(0)}\) denote the cumulative probability of the nodes \(w \in S\) with a total interference of less than \(\vartheta \) in round t when ignoring the nodes in S. Similarly, let \(p_{S}^{(1)}\) denote the cumulative probability of the nodes \(w \in S\) with a single transmitting node in \(Z_1(w) {\setminus } S\) and additionally an interference of less than \(\vartheta \) in round t, and let \(p_{S}^{(2)}\) be the cumulative probability of the nodes \(w \in S\) that do not satisfy the first two cases (which implies that they will not experience an idle channel, no matter what the nodes in S will do). Certainly, \(p_S = p_S^{(0)}+p_S^{(1)}+p_S^{(2)}\). Our goal is to determine \(p'_S\) in this case. Let \(q_0(S)\) be the probability that all nodes in S stay silent, let \(q_1(S)\) be the probability that exactly one node in S is transmitting, and let \(q_2(S) = 1-q_0(S)-q_1(S)\) be the probability that at least two nodes in S are transmitting.

First, let us simplify our setting slightly and ignore the case that \(c_v > T_v\) for a node \(v \in S\) at round t. By examining the 9 different cases, we obtain the following result:

$$\begin{aligned} \mathbb {E}[p'_S]\le & {} q_0(S) \cdot [(1+\gamma ) p_S^{(0)} + (1+\gamma )^{-1} p_S^{(1)} + p_S^{(2)}]\\&+\,q_1(S) \cdot [(1+\gamma )^{-1} p_S^{(0)} + p_S^{(1)}+p_S^{(2)}]\\&+\,q_2(S) \cdot [p_S^{(0)} + p_S^{(1)} + p_S^{(2)}] \end{aligned}$$

To give an example (the other cases are similar), we consider \(q_0(S)\) and \(p_S^{(1)}\), i.e., all nodes in S are silent and for all nodes in \(w \in S\) accounted for in \(p_S^{(1)}\) there is exactly one transmitting node in \(Z_1(w) {\setminus } S\) and the remaining interference is less than \(\vartheta \). In this case, w is guaranteed to receive a message, so according to the \(Sade \) protocol, it lowers \(p_w\) by \((1+\gamma )\).

The upper bound on \(\mathbb {E}[p'_S]\) certainly also holds if \(c_v > T_v\) for a node \(v \in S\), because \(p_v\) will never be increased (but possibly decreased) in this case.

Now, consider the event \(E_2\) that at least two nodes in S transmit a message. If \(E_2\) holds, then \(\mathbb {E}[p'_S] = p'_S = p_S\), so there is no change in the system. On the other hand, assume that \(E_2\) does not hold. Let \(q'_0(S)=q_0(S)/(1-q_2(S))\) and \(q'_1(S)=q_1(S)/(1-q_2(S))\) be the probabilities \(q_0(S)\) and \(q_1(S)\) under the condition of \(\lnot E_2\). We distinguish between three cases.

Case 1 \(p_S^{(0)}=p_S\). Then

$$\begin{aligned} \mathbb {E}[p'_S]\le & {} q'_0(S) \cdot (1+\gamma ) p_S + q'_1(S) \cdot (1+\gamma )^{-1} p_S \\= & {} ((1+\gamma )q'_0(S) + (1+\gamma )^{-1}q'_1(S)) p_S. \end{aligned}$$

We know that \(q_0(S) \le q_1(S) / p_S\), so \(q'_0(S) \le q'_1(S) / p_S\). If \(p_S \ge \rho _{green}\), then \(q'_0(S) \le q'_1(S)/5\). Hence,

$$\begin{aligned} \mathbb {E}[p'_S]\le & {} ((1+\gamma )/6 + (1+\gamma )^{-1}5/6) p_S \le (1+\gamma )^{-1/2} p_S \end{aligned}$$

since \(\gamma =o(1)\). On the other hand, \(p'_S \le (1+\gamma ) p_S\) in any case.

Case 2 \(p_S^{(1)}=p_S\). Then

$$\begin{aligned} \mathbb {E}[p'_S]\le & {} q'_0(S) \cdot (1+\gamma )^{-1} p_S + q'_1(S) p_S \\= & {} (q'_0(S)/(1+\gamma ) + (1-q'_0(S))) p_S\\= & {} (1 - q'_0(S) \gamma /(1+\gamma ))p_S. \end{aligned}$$

Now, it holds that \(1-x \gamma /(1+\gamma ) \le (1+\gamma )^{-x/2}\) for all \(x \in [0,1]\) because from the Taylor series of \(e^x\) and \(\ln (1+x)\) it follows that

$$\begin{aligned} (1+\gamma )^{-x/2} \ge 1- (x \ln (1+\gamma ))/2 \ge 1-(x (1-\gamma /2)\gamma )/2 \end{aligned}$$

and

$$\begin{aligned} 1 - x \gamma /(1+\gamma ) \le 1-(x (1-\gamma /2)\gamma )/2 \end{aligned}$$

for all \(x, \gamma \in [0,1]\) as is easy to check. Therefore, when defining \(\varphi = q'_0(S)\), we get \(\mathbb {E}[p'_S] \le (1+\gamma )^{-\varphi /2} p_S\). On the other hand, \(p'_S \le p_S \le (1+\gamma )^{\varphi } p_S\).

Case 3 \(p_S^{(2)}=p_S\). Then for \(\varphi =0\), \(\mathbb {E}[p'_S] \le p_S = (1+\gamma )^{-\varphi /2} p_S\) and \(p'_S \le p_S = (1+\gamma )^{\varphi } p_S\).

Combining the three cases and taking into account that \(p_S^{(0)}+p_S^{(1)}+p_S^{(2)}=p_S\), we obtain the following result.

Claim

There is a \(\phi \in [0,1]\) (depending on \(p_S^{(0)}\), \(p_S^{(1)}\) and \(p_S^{(2)}\)) so that

$$\begin{aligned} \mathbb {E}[p'_S] \le (1+\gamma )^{-\phi } p_S \quad \text{ and } \quad p'_S \le (1+\gamma )^{2\phi } p_S. \end{aligned}$$
(2)

Proof

Let \(a=(1+\gamma )^{1/2}\), \(b=(1+\gamma )^{\varphi /2}\) for the \(\varphi \) defined in Case 2, and \(c=1\). Furthermore, let \(x_0 = p_S^{(0)}/p_S\), \(x_1 = p_S^{(1)}/p_S\) and \(x_2 =p_S^{(2)}/p_S\). Define \(\phi = - \log _{1+\gamma } ((1/a)x_0 + (1/b)x_1 + (1/c)x_2)\). Then we have

$$\begin{aligned} \mathbb {E}[p'_S]\le & {} (1+\gamma )^{-1/2} p_S^{(0)} + (1+\gamma )^{-\varphi /2} p_S^{(1)} + p_S^{(2)}\\= & {} (1+\gamma )^{-\phi } p_S. \end{aligned}$$

We need to show that for this \(\phi \), also \(p'_S \le (1+\gamma )^{2\phi } p_S\). As \(p'_S \le (1+\gamma ) p_S^{(0)} + (1+\gamma )^{\varphi } p_S^{(1)} + p_S^{(2)}\), this is true if

$$\begin{aligned} a^2 x_0 + b^2 x_1 + c^2 x_2 \le \frac{1}{((1/a)x_0 + (1/b)x_1 + (1/c)x_2)^2} \end{aligned}$$

or

$$\begin{aligned} ((1/a)x_0 + (1/b)x_1 + (1/c)x_2)^2(a^2 x_0 + b^2 x_1 + c^2 x_2) \le 1\nonumber \\ \end{aligned}$$
(3)

To prove this, we need two claims whose proofs are tedious but follow from standard math.

Claim

For any \(a,b,c>0\) and any \(x_0,x_1,x_2>0\) with \(x_0+x_1+x_2=1\),

$$\begin{aligned} (a x_0 + b x_1 + c x_2)^2 \le (a^2 x_0 + b^2 x_1 + c^2 x_2) \end{aligned}$$

Claim

For any \(a,b,c>0\) and any \(x_0,x_1,x_2>0\) with \(x_0+x_1+x_2=1\),

$$\begin{aligned} ((1/a)x_0 + (1/b)x_1 + (1/c)x_2)(a x_0 + b x_1 + c x_2) \le 1 \end{aligned}$$

Combining the claims, Eq. (3) follows, which completes the proof. \(\square \)

Hence, for any outcome of \(E_2\), \(\mathbb {E}[p'_S] \le (1+\gamma )^{-\varphi } p_S\) and \(p'_S \le (1+\gamma )^{2\varphi } p_S\) for some \(\varphi \in [0,1]\). If we define \(q_S = \log _{1+\gamma } p_S\), then it holds that \(\mathbb {E}[q'_S] \le q_S - \varphi \). For any time t in I, let \(q_t\) be equal to \(q_S\) at time t and \(\varphi _t\) be defined as \(\varphi \) at time t. Our calculations above imply that as long as \(p_S \in [\rho _{green}, \rho _{yellow}]\), \(\mathbb {E}[q_{t+1}] \le q_t - \varphi _t\) and \(q_{t+1} \le q_t + 2\varphi _t\).

Now, suppose that within subframe I we reach a point t when \(p_S > \rho _{yellow}\). Since we start with \(p_S \le \rho _{green}\), there must be a time interval \(I' \subseteq I\) so that right before \(I'\), \(p_S \le \rho _{green}\), during \(I'\) we always have \(\rho _{green} < p_S \le \rho _{yellow}\), and at the end of \(I'\), \(p_S > \rho _{yellow}\). We want to bound the probability for this to happen.

Consider some fixed interval \(I'\) with the properties above, i.e., with \(p_S \le \rho _{green}\) right before \(I'\) and \(p_S \ge \rho _{green}\) at the first round of \(I'\), so initially, \(p_S \in [\rho _{green}, (1+\gamma )\rho _{green}]\). We use martingale theory to bound the probability that in this case, the properties defined above for \(I'\) hold. Consider the rounds in \(I'\) to be numbered from 1 to \(|I'|\), let \(q_t\) and \(\varphi _t\) be defined as above, and let \(q'_t = q_t + \sum _{i=1}^{t-1} \varphi _i\). It holds that

$$\begin{aligned} \mathbb {E}[q'_{t+1}]= & {} \mathbb {E}[q_{t+1} + \sum _{i=1}^{t} \varphi _i]\\= & {} \mathbb {E}[q_{t+1}] + \sum _{i=1}^{t}\varphi _i \le q_t - \varphi _t + \sum _{i=1}^{t}\varphi _i\\= & {} q_t + \sum _{i=1}^{t-1} \varphi _i\\= & {} q'_t. \end{aligned}$$

Moreover, it follows from Inequality (2) that for any round t, \(p'_S \le (1+\gamma )^{2\varphi _t} p_S\). Therefore, \(q_{t+1} \le q_t + 2\varphi _t\), which implies that \(q'_{t+1} \le q'_t + \varphi _t\). Hence, we can define a martingale \((X_t)_{t \in I'}\) with \(\mathbb {E}[X_{t+1}] = X_t\) and \(X_{t+1} \le X_t + \varphi _t\) that stochastically dominates \(q'_t\). Recall that a random variable \(Y_t\) stochastically dominates a random variable \(Z_t\) if for any z, \(\mathbb {P}[Y_t \ge z] \ge \mathbb {P}[Z_t \ge z]\). In that case, it is also straightforward to show that \(\sum _i Y_i\) stochastically dominates \(\sum _i Z_i\), which we will need in the following. Let \(T = |I'|\). We will make use of Azuma’s inequality to bound \(X_T\).

Fact 5

(Azuma Inequality) Let \(X_0, X_1, \ldots \) be a martingale satisfying the property that \(X_i \le X_{i-1} + c_i\) for all \(i\ge 1\). Then for any \(\delta \ge 0\),

$$\begin{aligned} \mathbb {P}[X_T > X_0 + \delta ] \le e^{-\delta ^2/(2 \sum _{i=1}^T c_i^2)}. \end{aligned}$$

Thus, for \(\delta = 1/\gamma + \sum _{i=1}^T \varphi _i\) it holds in our case that

$$\begin{aligned} \mathbb {P}[X_T > X_0 + \delta ] \le e^{-\delta ^2/(2 \sum _{i=1}^T \varphi _i^2)}. \end{aligned}$$

This implies that

$$\begin{aligned} \mathbb {P}[q'_T > q'_0 + \delta ] \le e^{-\delta ^2/(2 \sum _{i=1}^T \varphi _i^2)}, \end{aligned}$$

for several reasons. First of all, stochastic dominance holds as long as \(p_S \in [\rho _{green},\rho _{yellow}]\), and whenever this is violated, we can stop the process as the requirements on \(I'\) would be violated, so we would not have to count that probability towards \(I'\). Therefore,

$$\begin{aligned} \mathbb {P}[q_T > q_0 + 1/\gamma ] \le e^{-\delta ^2/(2 \sum _{i=1}^T \varphi _i^2)}. \end{aligned}$$

Notice that \(q_T > q_0 + 1/\gamma \) is required so that \(p_S > \rho _{yellow}\) at the end of \(I'\), so the probability bound above is exactly what we need. Let \(\varphi = \sum _{i=1}^T \varphi _i\). Since \(\varphi _i \le 1\) for all i, \(\varphi \ge \sum _{i=1}^T \varphi _i^2\). Hence,

$$\begin{aligned} \frac{\delta ^2}{2 \sum _{i=1}^T \varphi _i^2}\ge & {} \frac{(1/\gamma + \varphi )^2}{2 \varphi } \ge \left( \frac{1}{2\varphi \gamma ^2} + \frac{\varphi }{2} \right) . \end{aligned}$$

This is minimized for \(1/(2\varphi \gamma ^2) = \varphi /2\) or equivalently, \(\varphi =1/\gamma \). Thus,

$$\begin{aligned} \mathbb {P}[q_T > q_0 + 1/\gamma ] \le e^{-1/\gamma } \end{aligned}$$

Since there are at most \({f \atopwithdelims ()2}\) ways of selecting \(I' \subseteq I\), the probability that there exists an interval \(I'\) with the properties above is at most

$$\begin{aligned} {f \atopwithdelims ()2} e^{-1/\gamma } \le f^2 e^{-1/\gamma } \le \frac{1}{\log ^c n} \end{aligned}$$

for any constant c if \(\gamma = O(1/(\log T + \log \log n))\) is small enough.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ogierman, A., Richa, A., Scheideler, C. et al. Sade: competitive MAC under adversarial SINR. Distrib. Comput. 31, 241–254 (2018). https://doi.org/10.1007/s00446-017-0307-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-017-0307-1

Navigation