Multi-hop ad-hoc data dissemination protocol based on probabilistic broadcast, with adaptive parameters.
This protocol performs network-level broadcast using a probabilistic mechanism. This method reduces the number of packets sent on the channel (reducing the broadcast storm problem) at the risk of some nodes not receiving the data. It is particularly interesting for mobile networks. This version of probabilistic broadcast automatically adapts transmission probabilities depending on the estimated number of neighbours. timeInNeighboursTable is its unique parameter, and sets the time during which the node remembers a neighbour. It is particularly important in mobile networks: in that case, the faster the nodes, the smaller the timeInNeighboursTable parameter.
The following diagram shows usage relationships between types. Unresolved types are missing from the diagram.
The following diagram shows inheritance relationships for this type. Unresolved types are missing from the diagram.
Name | Type | Description |
---|---|---|
ProbabilisticBroadcast | simple module |
Multi-hop ad-hoc data dissemination protocol based on probabilistic broadcast. |
Name | Type | Default value | Description |
---|---|---|---|
interfaceTableModule | string | ||
headerLength | int | 100b |
length of the network packet header (in bits) |
bcperiod | double | 2 s |
period between two probabilistic broadcast attempts |
beta | double | 0.8 |
probability of broadcast for each attempt |
maxNbBcast | double | 1 |
maximal number of broadcast attempts for each packet. |
maxFirstBcastBackoff | double | 1 s |
maximal back-off before first broadcast attempt [seconds]. if don't want to use this parameter, simply set it to a value that is greater than bcperiod. |
timeToLive | double | 10 s | |
timeInQueueAfterDeath | double | 60 s |
How many seconds the message should be kept in queue after its died. That way the message is known if the node receives one of its copy that isn't dead because of TTL de-synchronization due to MAC backoff, propagation delay and clock drift. |
timeInNeighboursTable | double | 60 s |
Name | Value | Description |
---|---|---|
display | i=block/fork | |
class | AdaptiveProbabilisticBroadcast |
Name | Direction | Size | Description |
---|---|---|---|
upperLayerIn [ ] | input | ||
upperLayerOut [ ] | output | ||
lowerLayerIn [ ] | input | ||
lowerLayerOut [ ] | output |
Name | Type | Unit |
---|---|---|
packetReceivedFromUpper | cPacket | |
packetReceivedFromLower | cPacket | |
packetFromLowerDropped | cPacket | |
packetFromUpperDropped | cPacket | |
packetSentToLower | cPacket | |
packetSentToUpper | cPacket |
// // Multi-hop ad-hoc data dissemination protocol based on probabilistic broadcast, with adaptive parameters. // // This protocol performs network-level broadcast using a probabilistic mechanism. // This method reduces the number of packets sent on the channel (reducing the // broadcast storm problem) at the risk of some nodes not receiving the data. // It is particularly interesting for mobile networks. // This version of probabilistic broadcast automatically adapts transmission // probabilities depending on the estimated number of neighbours. // timeInNeighboursTable is its unique parameter, and sets the time // during which the node remembers a neighbour. It is particularly important // in mobile networks: in that case, the faster the nodes, the smaller the // timeInNeighboursTable parameter. // simple AdaptiveProbabilisticBroadcast extends ProbabilisticBroadcast { parameters: @class(AdaptiveProbabilisticBroadcast); double timeInNeighboursTable @unit(s) = default(60 s); }