DocumentCode :
523122
Title :
On capacity achieving property of rotational coding for acyclic deterministic wireless networks
Author :
Khojastepour, M.A. ; Keshavarz-Haddad, Alireza ; Golsefidy, Alireza Salehi
Author_Institution :
NEC Labs. America, Princeton, NJ, USA
fYear :
2010
fDate :
May 31 2010-June 4 2010
Firstpage :
313
Lastpage :
317
Abstract :
It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and forwarding overhead of random coding scheme prohibits its application in practice. Recently, a practical low complexity alternative, rotational coding scheme, was proposed in where it was proved that the rotational coding can achieve the capacity of the layered deterministic wireless networks. In this paper, we extend the result and prove that the rotational coding is in fact capacity achieving for a general acyclic network. Our result adds to the practical property of rotational coding scheme and makes it desirable for communication networks with arbitrary topology as long as there is no directional cycle in the network.
Keywords :
communication complexity; radio networks; random codes; telecommunication network topology; acyclic deterministic wireless network; capacity achieving property; communication network; complexity overhead; cutset bounds; forwarding overhead; network topology; random coding; rotational coding; Communication networks; Computer networks; Interference; Laboratories; Mathematics; National electric code; Network coding; Network topology; Throughput; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2010 Proceedings of the 8th International Symposium on
Conference_Location :
Avignon
Print_ISBN :
978-1-4244-7523-0
Type :
conf
Filename :
5518795
Link To Document :
بازگشت