A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
A scalable approach for reliable downstream data delivery in wireless sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Proceedings of the 5th international conference on Information processing in sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
IEEE Transactions on Information Theory
Minimum-cost multicast over coded packet networks
IEEE Transactions on Information Theory
A digital fountain approach to asynchronous reliable multicast
IEEE Journal on Selected Areas in Communications
Enabling cognitive load-aware AR with rateless coding on a wearable network
Advances in Multimedia
IEEE Transactions on Communications
Robust video communication for ubiquitous network access
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
The problem of reliable and energy-efficient one-to-all broadcasting in multihop wireless networks is investigated in this paper and a low-complexity and scalable scheme (referred to as FTS) is proposed. This scheme utilizes rateless coding and the broadcasting nature of wireless channels to reduce the cost of broadcasting. In FTS, raw data is first encoded, and each node requires to send only a fraction of the total encoded packets. We compare our schemes with present energy-efficient methods such as Network Coding (NC), Multipoint Relaying (MPR), Broadcast Incremental Power (BIP), and Collaborative Rateless Broadcast (CRBcast). Our simulations reveal that our scheme performs well in comparison with these strategies, while having lower complexity and higher adaptability in comparison with some of them.