DocumentCode
1925310
Title
Conflict-Free Transmission Schedule Based on Network Coding in Wireless Networks
Author
Wang, Jing ; Liu, Xiangyang ; Wang, Xinmei
Author_Institution
Sch. of Inf. Eng., Chang´´an Univ., Xi´´an, China
fYear
2011
fDate
18-20 April 2011
Firstpage
328
Lastpage
331
Abstract
In wireless networks, the cross-layer design of joint medium access control and network coding can avoid destructive interferences among concurrent transmissions. Wireless network codes in conjunction with conflict-free network realizations are designed by Sagduyu. Then, this paper proposed a new conflict-free transmission schedule based on network coding to achieve better network performance. We construct sub tree graphs by sub tree decomposition, and based on the achieved sub tree graphs, time slots are assigned from the first sub tree. Nodes of the latter sub trees can be chosen to combine with the front time slots according to whether there exist conflicts or not. Finally, network codes allocation method for network with two sources is presented, which adopts the theory of graph coloring.
Keywords
access protocols; graph colouring; interference suppression; network coding; radio networks; scheduling; trees (mathematics); conflict-free transmission schedule; cross-layer design; destructive interference avoidance; graph coloring theory; joint medium access control protocol; network code allocation method; subtree decomposition; subtree graphs; wireless networks; Algorithm design and analysis; Color; Encoding; Network coding; Resource management; Schedules; Wireless networks; conflict-free transmission; network codes; network coding; subtree decomposition; wireless network;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Mobile Computing (CMC), 2011 Third International Conference on
Conference_Location
Qingdao
Print_ISBN
978-1-61284-312-4
Type
conf
DOI
10.1109/CMC.2011.20
Filename
5931238
Link To Document