Crosslayer Design for Distributed MAC and Network Coding in 分布式MAC层和网络编码的跨层设计.pptVIP

Crosslayer Design for Distributed MAC and Network Coding in Wireless Ad Hoc Networks Yalin E. Sagduyu Anthony Ephremides University of Maryland at College Park Background / Motivation Outline Example of Wireless Network Coding Step 1: Predetermine conflict-free wireless network realizations. Set of wireless network realizations and hypothetical wired network graph have the same cut values and have the same maximum flows. Consider the problem of joint MAC (scheduling) and network coding. Subtree Decomposition of a Network Graph Step 1: Construct a dual line graph from the original network graph. Network Coding by Subtree Decomposition (1) The code vector of any subtree is in the linear span of code vectors of parent subtrees. (2) The code vectors of any two subtrees that share a destination node or that are connected to a common child subtree are linearly independent. Network Coding by Subtree Decomposition (Cont’d.) Scheduling Method A Use the subtree decomposition of the network to construct conflict-free schedules. Scheduling Methods B and C III. Network Coding vs. Plain Routing IV. Summary and Thoughts for Future Work Addressed the problem of network coding in wireless networks. Constructed a network coding solution over predetermined network realizations. Presented distributed methods to derive conflict-free transmission schedules from network codes based on subtree network decomposition. Clearly the MAC aspect is not fully optimized. Contention-based protocols can be partially handled through Group TDMA. * 2005 IEEE ISIT Adelaide, Australia Network coding was originally developed for wired networks. Objective: Extend network coding to operate in ad hoc wireless networks: Simultaneous multiple transmissions/receptions over different links (no interference). Throughput has been the main performance focus. (1) No simultaneous transmission and reception at any node. (2) Interference effects – need for M