On packet lengths and overhead for random linear coding over the erasure channel
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Heuristics for network coding in wireless networks
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Proceedings of the second ACM conference on Wireless network security
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Joint source-channel coding for transmitting correlated sources over broadcast networks
IEEE Transactions on Information Theory
Achievable rate and optimal physical layer rate allocation in interference-free wireless networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Sum capacity of multi-source linear finite-field relay networks with fading
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Joint source-channel coding at the application layer for parallel Gaussian sources
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
On noncoherent correction of network errors and erasures with random locations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Rate regions for coherent and noncoherent multisource network error correction
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On the delay of network coding over line networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Deterministic relay networks with state information
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
A lower bound on the capacity of wireless erasure networks with random node locations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Diversity analysis of irregular fractional cooperation
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On models for multi-user Gaussian channels with fading
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Multicasting of digital images over erasure broadcast channels using rateless codes
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
On broadcast stability of queue-based dynamic network coding over erasure channels
IEEE Transactions on Information Theory
Combining prediction hashing and MDS codes for efficient multicast stream authentication
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Random linear network coding for time division duplexing: energy analysis
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Diversity-rate trade-off in erasure networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the tradeoffs of implementing randomized network coding in multicast networks
IEEE Transactions on Communications
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Robust network coding in the presence of untrusted nodes
IEEE Transactions on Information Theory
Practical defenses against pollution attacks in wireless network coding
ACM Transactions on Information and System Security (TISSEC)
Network capacity region and minimum energy function for a delay-tolerant mobile ad hoc network
IEEE/ACM Transactions on Networking (TON)
Achieving multicast stream authentication using MDS codes
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Full length article: On coding for reliable communication over packet networks
Physical Communication
Orthogonal projection decomposition of matrices and construction of fusion frames
Advances in Computational Mathematics
Optimal opportunistic routing and network coding for bidirectional wireless flows
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 755.02 |
In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring each node to send the same signal on all outgoing channels. However, we assume there is no interference in reception. Such models are therefore appropriate for wireless networks where all information transmission is packetized and where some mechanism for interference avoidance is already built in. This paper looks at multicast problems over these networks. The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained. It turns out that the capacity region has a nice max-flow min-cut interpretation. The definition of cut-capacity in these networks incorporates the broadcast property of the wireless medium. It is further shown that linear coding at nodes in the network suffices to achieve the capacity region. Finally, the performance of different coding schemes in these networks when no side information is available to the destinations is analyzed