A feedback suppression algorithm for reliable satellite multicast based on spatial–temporal prediction of the satellite channel

Αναστασόπουλος, Μάρκος Π.; Panagopoulos, Athanasios D.; Cottis, Panayotis G.

doi:10.1002/sat.931

Cited by 4 publications

(7 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In satellite networks operating above 10 GHz, the problem appears when the multicast system is under rain conditions. Then, the majority of users located within the served area suffer simultaneously from a high number of packet losses; therefore, the number of players is quite close to the total number of multicast receivers [22]. Using the same rationale with the two player game, if player i does not send an FBM, he has a normalized payoff equal to 1 and no delay, provided that at least one of the other N − 1 players will send an FBM.…”

Section: Extension To N Playersmentioning

confidence: 95%

“…Note that in the numerical calculations, a similar satellite network topology with that described in [22] has been employed. Specifically, Hellas Sat 2 at 39 o E is considered.…”

Section: A Analysis For Uniformly Distributed Costsmentioning

confidence: 99%

“…Next, the proposed GTFS scheme is compared to the timerbased feedback suppression schemes presented in [21] and [22]. The key idea behind these schemes is that when a receiver detects that an FBM has been sent by another terminal, it does not transmit its own FBM.…”

Section: A Analysis For Uniformly Distributed Costsmentioning

confidence: 99%

“…If all receivers delay their feedback transmission, feedback implosion can be avoided. The major difference between the two schemes is that in [21], the delays are random, while in [22], they are deterministic optimized under certain propagation conditions. In [21], the random delays introduced by the timer are assumed exponentially distributed over the interval (0, T ) following the distribution…”

Section: A Analysis For Uniformly Distributed Costsmentioning

confidence: 99%

“…However, its main disadvantage is that the feedback suppression algorithm assumes deterministic timeouts requiring multiple RTTs over the highdelay satellite channel. Furthermore, in [22], a propagationbased feedback suppression scheme is proposed for rain-faded satellite networks. The algorithm immediately identifies the worst-performing user in the serviced area and designates him as the area representative (AR) based on the fact that the AR transmits FBMs faster than the other users, thus suppressing their feedback.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Feedback Suppression in Multicast Satellite Networks Using Game Theory

Αναστασόπουλος

Taleb

Cottis

et al. 2012

IEEE Systems Journal

Self Cite

View full text Add to dashboard Cite

Feedback implosion is a major problem limiting scalability in multicast satellite networks that arises when a large number of users transmit their feedback messages (FBMs) through the uplink channel, occupying a significant portion of system resources. This paper investigates how suppression of FBMs may be achieved through a novel feedback suppression scheme in which each user unilaterally decides whether to send a FBM or not. The users decisions are modeled applying game theory with inaccurate information. For this problem, the Bayesian equilibrium for the two and N-player game is investigated. It is proved that the feedback suppression game has a unique Bayesian equilibrium point. Then, based on appropriate numerical and simulation results, it is demonstrated that the proposed scheme avoids feedback implosion while at the same time it keeps feedback latency at very low levels. Finally, it is shown that the proposed scheme exhibits a significant performance improvement compared to existing exponential timer-based schemes.Index Terms-Bayesian equilibrium, feedback suppression, game theory, IP multicast, multicast satellite systems, reliable multicast, satellite networks.

show abstract

Section: Extension To N Playersmentioning

confidence: 95%

“…Note that in the numerical calculations, a similar satellite network topology with that described in [22] has been employed. Specifically, Hellas Sat 2 at 39 o E is considered.…”

Section: A Analysis For Uniformly Distributed Costsmentioning

confidence: 99%

Section: A Analysis For Uniformly Distributed Costsmentioning

confidence: 99%

Section: A Analysis For Uniformly Distributed Costsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Feedback Suppression in Multicast Satellite Networks Using Game Theory

Αναστασόπουλος

Taleb

Cottis

et al. 2012

IEEE Systems Journal

Self Cite

View full text Add to dashboard Cite

show abstract

RLNC in satellite networks: A cooperative scenario for delivering M2M traffic

Bacco

Gotta

2017

Satell Commun Network

View full text Add to dashboard Cite

The fraction of machine-to-machine traffic carried by satellite networks is increasing, and an efficient delivery is required in order to enable a large set of applications that can benefit from the advantages provided by the use of satellites. This work analyses the use of random linear network coding techniques in land mobile satellite channels to reliably deliver machine-to-machine traffic to mobile nodes in urban areas. The considered scenario takes into account a cooperative coverage extension in land mobile satellite vehicular networks, where the use of random linear network coding techniques can remove the need for any fixed equipment on the ground at least in urban environments, where the density of mobile nodes is typically high. KEYWORDSgossiping, M2M, network coding, RLNC, satellite, VANET INTRODUCTIONThe application of network coding (NC) to communications networks is relatively recent and dates back to year 2000. 1 Since then, NC has shown great potentials in correcting random packet errors, erasures, and errors introduced by malicious nodes, making it a powerful tool to achieve efficient network service delivery and network reliability. In the seminal work by Ahlswede et al, 2 NC is illustrated by the butterfly network example: A data source delivers a stream of messages to two receivers; all links can deliver up a single message per unit of time. In the example, the middle link represents a bottleneck, and to overcome that, the authors propose to send a combination of the messages instead of plain packets. Two incoming messages a i and b i are XORed, a i ⊕ b i , then the coded packet a i ⊕ b i is sent in the middle link, reaching the two receivers in a single unit of time. The two receivers can reconstruct the whole piece of information by XORing the network coded packet and a i (or b i ), which comes on a separate link. In this way, the throughput of the network is increased, because less packet transmissions are needed to deliver the whole information block. Linear NC (LNC) is introduced by Li et al 3,4 : the idea behind LNC is to create combinations of packets by taking coefficients from a Galois field of size q = 2 x .The original messages can be retrieved, at destination, by performing Gaussian elimination on the matrix generated from the LNC coefficients of the packets. Considering k source packets, a so-called generation worth of k input symbols, n ⩾ k output symbols are generated by the coding procedure.If at least k independent symbols received at destination, then decoding is possible. Random linear network coding (RLNC) has been proposed in Ho et al 5 and Chou et al 6 in 2003: when using RLNC, the coefficients are randomly drawn from the finite field. According to Ho et al, 5 the failure probability when relying on RLNC depends on the size q of the finite field. The larger q, the lower the failure probability, but at the price of a larger packet overhead and larger lookup tables* to be maintained in memory. 7 Anyway, it should be noted that a larger q provides a lower energy per bit cost...

show abstract

Raptor-based file delivery protocol for satellite-CDNs (RFDPS)

Zhang

2016

2016 IEEE/CIC International Conference on Communications in China (ICCC Workshops)

View full text Add to dashboard Cite

A feedback suppression algorithm for reliable satellite multicast based on spatial–temporal prediction of the satellite channel

Cited by 4 publications

References 25 publications

Feedback Suppression in Multicast Satellite Networks Using Game Theory

Feedback Suppression in Multicast Satellite Networks Using Game Theory

RLNC in satellite networks: A cooperative scenario for delivering M2M traffic

Raptor-based file delivery protocol for satellite-CDNs (RFDPS)

Contact Info

Product

Resources

About