Rateless Forward Error Correction for Topology-Transparent Scheduling

Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: (1) We generalize the combinatorial requirement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network conditions. (2) In simulation, we closely match the theoretical bound on expected throughput. The bound was derived assuming acknowledgments are available immediately. We use rate less forward error correction (RFEC) as an acknowledgment scheme with minimal computational overhead. Since the wireless medium is inherently unreliable, RFEC also offers some measure of automatic adaptation to channel load. These contributions renew interest in topology-transparent scheduling when delay is a principal objective.

[1]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[2]  Tracy Camp,et al.  Improving the Accuracy of Random Waypoint Simulations Through Steady-State Initialization , 2004 .

[3]  V. V. Rykov,et al.  Superimposed distance codes , 1989 .

[4]  Mingyan Liu,et al.  Sound mobility models , 2003, MobiCom '03.

[5]  Imrich Chlamtac,et al.  Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network , 1987, IEEE Transactions on Computers.

[6]  Imrich Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1994, TNET.

[7]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[8]  Victor O. K. Li,et al.  An optimal topology-transparent scheduling method in multihop packet radio networks , 1998, TNET.

[9]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[10]  Miklós Ruszinkó,et al.  On the upper bound of the size of the r -cover-free families , 1994 .

[11]  Chenxi Zhu,et al.  A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks , 2001, Wirel. Networks.

[12]  Miklós Ruszinkó,et al.  On the Upper Bound of the Size of the R-Cover-Free Families , 1993, Proceedings. IEEE International Symposium on Information Theory.

[13]  Mingyan Liu,et al.  A general framework to construct stationary mobility models for the simulation of mobile networks , 2006, IEEE Transactions on Mobile Computing.

[14]  Lih-Yuan Deng,et al.  Orthogonal Arrays: Theory and Applications , 1999, Technometrics.

[15]  David E. Culler,et al.  A transmission control scheme for media access in sensor networks , 2001, MobiCom '01.

[16]  Charles J. Colbourn,et al.  Cover-Free Families and Topology-Transparent Scheduling for MANETs , 2004, Des. Codes Cryptogr..

[17]  Lie Zhu,et al.  Some New Bounds for Cover-Free Families , 2000, J. Comb. Theory, Ser. A.

[18]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[19]  Charles J. Colbourn.  Group testing for consecutive positives , 1999 .

[20]  Charles J. Colbourn,et al.  Topology-transparent scheduling for MANETs using orthogonal arrays , 2003, DIALM-POMC '03.

[21]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[22]  Imrich Chlamtac,et al.  Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks , 1997, TNET.

[23]  Douglas R Stinson,et al.  Surveys in Combinatorics, 1999: Applications of Combinatorial Designs to Communications, Cryptography, and Networking , 1999 .

[24]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .