Probability of Time-Overlap between two Transceivers

  • Context: Undergrad 
  • Thread starter Thread starter Meshy
  • Start date Start date
  • Tags Tags
    Probability
Click For Summary

Discussion Overview

The discussion revolves around the probability of time-overlap between two transceivers that broadcast SEND requests at specific intervals. Participants explore mathematical models to determine how likely it is for the transceivers to communicate given their broadcasting schedules and potential starting offsets.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant proposes a scenario with two transceivers, A and B, each broadcasting for 2 seconds every 8 seconds, and questions how to calculate the time until they are guaranteed to find each other if started at random times.
  • Another participant suggests simplifying the problem by assuming both transceivers have a broadcasting/listening time of 1 second and asks about the relationship between their cycle lengths to ensure they coincide.
  • A participant notes that if both transceivers broadcast every 8 seconds, they may never communicate, but suggests that a 6-second cycle might allow for communication.
  • One participant calculates that every 40 seconds, under specific conditions, the transceivers would overlap.
  • A mathematical function is proposed to represent the relationship between the broadcasting intervals, leading to a conclusion that the product of the two time increments determines the overlap time.
  • Another participant expresses confusion, indicating that the proposed solution does not account for specific starting times, suggesting that the transceivers may not overlap as previously thought.

Areas of Agreement / Disagreement

Participants express differing views on whether the proposed solutions accurately address the problem. There is no consensus on the correct approach or solution, as some participants believe they have found a resolution while others challenge the validity of those conclusions.

Contextual Notes

Participants have not fully resolved the implications of different starting times and their effects on the probability of overlap. The discussion includes assumptions about the broadcasting intervals and their relationship, which may not hold under all conditions.

Meshy
Messages
5
Reaction score
0
Ok, so I had this thought for low power transistors to only broadcast certain data at specific time increments. I cannot figure out how to answer this for the heck of me.

Two transceivers, and they only broadcast SEND requests when they have data to send.

Transceiver A) Broadcasts every 8 seconds for 2 seconds. If it doesn't get a SEND request from another transceiver in those 2 seconds it goes back to sleep.

Transceiver B) Broadcasts every 8 seconds for 2 seconds. If it doesn't get a SEND request from another transceiver in those 2 seconds it goes back to sleep.

Transceiver X) Broadcasts every X seconds for Y seconds. If it doesn't get a SEND request from another transceiver in those Y seconds it goes back to sleep. ::

If they were started a random times, let's say 6 second differential or w/e, just as long as they weren't started at the same time, how long till I', guaranteed one finds the other? Is there a mathematical model to calculate this?
 
Physics news on Phys.org
Clearly A and B are not guaranteed ever to get in touch.
For simplicity, to start with, I would assume each broadcasts/listens for a time period of 1, and take the cycle lengths to be whole multiples of that. What then would be the relationship between two cycle lengths to ensure they coincide sometime?
 
Now that I think of it, if they were both 8 seconds they aren't guaranteed to ever communicate. But at 6 seconds, they should. Lemme give it another shot:-, * = 2 sec increments


----*----*----*----*----*----*----*----*----*----*----*----*----*----*----*----*----*----*----*----*----*
---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*---*
 
Looks like every 40 secs in that specific scenario.
 
Set - or * to t. x1 = 5, x2 = 4.

f(x,y,t)=>

f(5,4,2)=40;
f(5,4,1)=20;

f(x,y,t)=x*y*t

So X*Y*T it is I guess.

Lemme try, (2,3,1):

2X3X1 = 6

-*-*-*-*-*-*-*-*-*-*
--*--*--*--*--*--*--*

Yup that's six increments. Wow. Figured it out myself :)
 
So I just realized it's just the multiplication of the 2 time increments. Obviously had too much on my mind today. lol. SOLVED.
 
I'm glad you're happy, but if that's the answer then I clearly did not understand the question in the first place.
If A sends for 2 seconds starting at time 6t, and B does 2 seconds starting at time 6t+3, t=0, 1, ..., they will never be awake together. Likewise with 1 second at 10t, 15t+2. What have I misunderstood?
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
3
Views
2K
  • · Replies 75 ·
3
Replies
75
Views
8K
  • · Replies 29 ·
Replies
29
Views
6K
  • · Replies 131 ·
5
Replies
131
Views
9K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K