Multiplex communications – Communication over free space – Having a plurality of contiguous regions served by...
Reexamination Certificate
2006-05-26
2011-10-18
Edouard, Patrick (Department: 2617)
Multiplex communications
Communication over free space
Having a plurality of contiguous regions served by...
C370S255000
Reexamination Certificate
active
08040836
ABSTRACT:
A local network coding framework and method including techniques to improve efficiency in a wireless network by reducing overhead. The local network coding method includes exchanging data availability between nodes on the wireless network by sending Bloom filters of lists of packets to neighboring nodes. Based on data availability, optimized mixing of pure packets is performed to form mixture packets for output. A separate acknowledgement buffer keeps track of the pure packets transmitted but not acknowledged. If an acknowledgement does not arrive after a certain time period, the packet is assumed to be lost and is retransmitted. An optimized packet mixing process generates mixture packets and decides which nodes to send the mixture packets. The local network coding framework and method also includes methods for representing the composition of a mixture packet and using mixing at a wireless access point to improve the performance of the wireless local area network.
REFERENCES:
patent: 5926101 (1999-07-01), Dasgupta
patent: 6046978 (2000-04-01), Melnik
patent: 6757738 (2004-06-01), Cao et al.
patent: 6778518 (2004-08-01), Jesse et al.
patent: 6798765 (2004-09-01), Larsson
patent: 2003/0026268 (2003-02-01), Navas
patent: 2005/0010675 (2005-01-01), Jaggi et al.
patent: 2005/0013253 (2005-01-01), Lindskog et al.
patent: 2005/0108368 (2005-05-01), Mohan et al.
patent: 2005/0152391 (2005-07-01), Effros et al.
patent: 2006/0098585 (2006-05-01), Singh et al.
patent: 2006/0245410 (2006-11-01), Jiang
patent: 2007/0094181 (2007-04-01), Tayebnejad et al.
patent: 2008/0002599 (2008-01-01), Yau et al.
patent: 1610503 (2005-12-01), None
patent: WO-2005099222 (2005-10-01), None
patent: WO-2005109728 (2005-11-01), None
Beyond Routing An Algebraic Approach to Network Coding.pdf.
Network Coding—An Instant Primer.pdf.
Ahlswede et al., “Network Information Flow”, 2000.
Wu et al., “Information Exchange in Wireless Network with Network Coding and Physical Layer Broadcast”, Mar. 2005.
Ahlswede et al., “Network Information Flow”, 2000.
Wu et al., “Information Exchange in Wireless Network with Network Coding and Physical Layer Broadcast”, Mar. 2005.
Ahuja, R. K., T. I. Magnanti, and J. B. Orlin, Some recent advances in network flows, SIAM Review, vol. 33, pp. 175-219, 1991.
Ahlswede, R., N. Cai, S. R. Li, and R. W. Yeung, Network information flow, Proc. of IEEE Transactions on Info. Theory, Jul. 2000, pp. 1204-1216, vol. IT-46, No. 4.
Biswas, S. and R. Morris, Opportunistic routing in multi-hop wireless networks, SIGCOMM Comput. Commun. Rev., 2004, pp. 69-74, vol. 34, No. 1.
Bloom, B., Space/time trade-offs in hash coding with allowable errors, Commun. ACM, Jul. 1970, pp. 422-426, vol. 13, No. 7.
Chazelle, B., J. Kilian, R. Rubinfeld, and A. Tal, The Bloomier filter: An efficient data structure for static support lookup tables, Proc. of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 30-39.
Chou, C., A. Misra, Low latency multimedia broadcast in multi-rate wireless meshes, 1st IEEE Workshop on Wireless Mesh Networks, 2005, pp. 54-63.
Herhold, P., E. Zimmermann, G. Fettweis, Cooperative multi-hop transmission in wireless networks, Computer Networks, 2005, vol. 49, No. 3, pp. 299-324.
Herhold, P., E. Zimmerman, and G. Fettweis, Relaying and cooperation—A system perspective. Technische Universität Dresden, Vodafone Chair Mobile Comm. Sys., D-01062 Dresden, Germany.
Ho, T., M. Médard, R. Koetter, D. R. Karger, M. Effros, J. Shi and B. Leong, Toward a random operation of networks, IEEE Trans. Inform. Theory, 2004 submitted.
Katti, S., D. Katabi, W. Hu, H. S. Rahul, and M. Médard, The importance of being opportunistic: Practical network coding for wireless environments, Proc. 43rd Annual Allerton Conf. on Comm., Control, and Computing, 2005.
Koetter, R., and M. Médard, An algebraic approach to network coding, IEEE/ACM Trans. Networking, Oct. 2003., pp. 782-795, vol. 11, No. 5.
Lee, S.-J., M. Gerla, and C.-C. Chiang, On-demand multicast routing protocol, Proc. IEEE Wireless Communications and Networking Conference (WCNC'99), Sep. 1999, pp. 1298-1302, New Orleans, Louisiana, U.S.A.
Mitzenmacher, M., Compressed bloom filters, IEEE/ACM Transactions on Networking, 2002, vol. 10, No. 5, pp. 604-612.
Wu, Y., P. A. Chou, and S.-Y. Kung, Information exchange in wireless networks with netwrok coding and physical-layer broadcast, Proc. 39th Annual Conf. on Info. Sciences and Sys. (CISS), Mar. 2005.
Chandra Ranveer
Chou Philip A.
Khaki Mohamed Jawad
Padhye Jitendra D.
Padmanabhan Venkata N.
Edouard Patrick
Fischer Craig S.
Irace Michael
Lyon & Harr L.L.P.
Microsoft Corporation
LandOfFree
Local network coding for wireless networks does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Local network coding for wireless networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local network coding for wireless networks will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4271940