AdaptiveProbabilisticBroadcast¶

Package: inet.networklayer.probabilistic

simple module AdaptiveProbabilisticBroadcast

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.

Inheritance diagram¶

Extends¶

Name	Type	Description
ProbabilisticBroadcast	simple module	Multi-hop ad-hoc data dissemination protocol based on probabilistic broadcast.

Parameters¶

Name	Type	Default value	Description
displayStringTextFormat	string	“”	Determines the text that is written on top of the submodule, supports displaying pars, watches, and module-specific information
interfaceTableModule	string
headerLength	int	96b	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	int	1	maximal number of broadcast attempts for each packet.
maxFirstBcastBackoff	double	1 s	maximal back-off before the first broadcast attempt [seconds]. If you 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 the queue after it dies. That way the message is known if the node receives one of its copies that isn’t dead because of TTL de-synchronization due to MAC backoff, propagation delay, and clock drift.
timeInNeighboursTable	double	60 s

Properties¶

Name	Value	Description
class	AdaptiveProbabilisticBroadcast
display	i=block/fork

Gates¶

Name	Direction	Size	Description
transportIn	input
transportOut	output
queueIn	input
queueOut	output

Signals¶

Name	Type	Unit	Description
packetDropped	cPacket
packetReceivedFromLower	cPacket
packetReceivedFromUpper	cPacket
packetSentToLower	cPacket
packetSentToUpper	cPacket

Source code¶

//
// 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);
}

File: src/inet/networklayer/probabilistic/AdaptiveProbabilisticBroadcast.ned