Play with it! https://chonyy.github.io/handoff-visualizer/
Handoff is the transition for any given user of signal transmission from one base station to a geographically adjacent base station as the user moves around. In this project, we visualize the process of handoff by generating cars moving around the blocks and connecting them to different base stations based on different policies.
This project is to visualize handoff and make the concept of handoff in wireless network easy to understand. Different policies are implemented to perform the handoff in different situations. The goal is to make the users try out all the different policies, understand the differences, and find out the most efficient policy.
If your are interested in this visualiztion, please also check out the handoff-simulator . We want people to understand handoff in this visualizer project, and we the value of data in that handoff-simulator .
Each node is a 39 (m ^ 2) square. A block is composed of 50 nodes, whick makes the block size [ P(t)=⋋”e” ^(−”⋋” ) (t is in sec) ] (m ^ 2). Cars are assummed to be moving on an extremely thin line path between blocks, the path doesn’t take up any space. The velocity of the car is m / s. In our simulation, we iterate once in a second. The cars move one node, and all the data are calculated and updated every second. (Velocity)=(km / hr= (m / s) (Probability of cars entrance) (follows) Poisson distribution (⋋)=1 cars / min [ P(t)=⋋”e” ^(−”⋋” ) (t is in sec) ]
- (Probability of cars turning (based on predefined value listed below Received Power Calculation (explained below)
- Poisson distribution and
In our simultation
(⋋)=0. 362 cars / secto dig deeper. Base station transmission Pt (mW)=- (dBm) Base=1mW (log (Pt / Base)=dBm First-meter path loss=(dBm) (P0=- dBm (Pd=- – – log (d (m) / 1m) Policies Pseudocode
Received Power referred to (P , base station referered to (B)
Threshold referred to (T , entrophy referred to (E)Best Policy(if) (Pnew
The probability of the entrance follows