Abstract
In traditional stop-and-wait strategy for reliable communications, such as ARQ, retransmission for the packet loss problem would incur a great number of packet transmissions in lossy wireless ad-hoc networks. We study the reliable multicast lifetime maximization problem by alternatively exploring the random linear network coding in this paper. We formulate such problem as a min-max problem and propose a heuristic algorithm, called maximum lifetime tree (MLT), to build a multicast tree that maximizes the network lifetime. Simulation results show that the proposed algorithms can significantly increase the network lifetime when compared with the traditional algorithms under various distributions of error probability on lossy wireless links.
Original language | English |
---|---|
Title of host publication | Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011 |
Pages | 95-99 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 1 Dec 2011 |
Externally published | Yes |
Event | 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011 - Melbourne, VIC, Australia Duration: 24 Oct 2011 → 26 Oct 2011 |
Conference
Conference | 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011 |
---|---|
Country/Territory | Australia |
City | Melbourne, VIC |
Period | 24/10/11 → 26/10/11 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Human-Computer Interaction