Efficient Throughput for Wireless Mesh Networks by CDMA/OVSF Code Assignment

A moisture permeable protector such as gloves, fingerstalls, etc. for protecting hands and fingers at workshop, etc. utilizing a polyurethane film which has excellent moisture permeability. The film is made of polyurethane polymer having a polyoxyethylene content of 15-62% in a polyesterpolyol having a molecular weight of 3000 or less. The moisture permeability (g/m2,24 hours) of the film is 1500 or higher per 45 micron thickness, and the water absorption swelling ratio is 30% or less.

[1]  J.J. Garcia-Luna-Aceves,et al.  Distributed assignment of codes for multihop packet-radio networks , 1997, MILCOM 97 MILCOM 97 Proceedings.

[2]  Marwan Krunz,et al.  CDMA-based MAC protocol for wireless ad hoc networks , 2003, MobiHoc '03.

[3]  Kai-Yeung Siu,et al.  Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA , 2000, IEEE Journal on Selected Areas in Communications.

[4]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[5]  Romano Fantacci,et al.  Multiple access protocol for integration of variable bit rate multimedia traffic in UMTS/IMT-2000 based on wideband CDMA , 2000, IEEE Journal on Selected Areas in Communications.

[6]  Limin Hu,et al.  Distributed code assignments for CDMA packet radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[7]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[8]  Gruia Calinescu.  Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks , 2003, ADHOC-NOW.

[9]  Xiang-Yang Li,et al.  Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks , 2002, DIALM '02.

[10]  Subramanian Ramanathan,et al.  Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM '92.

[11]  Ion I. Mandoiu,et al.  Selecting Forwarding Neighbors in Wireless Ad Hoc Networks , 2001, DIALM '01.

[12]  A. Gräf,et al.  On Coloring Unit Disk Graphs , 1998, Algorithmica.

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

[14]  Fumiyuki Adachi,et al.  Tree-structured generation of orthogonal spreading codes with different lengths for forward link of DS-CDMA mobile radio , 1997 .

[15]  Mauro Dell'Amico,et al.  Efficient algorithms for the assignment of OVSF codes in wideband CDMA , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[16]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[17]  Andrew V. Goldberg,et al.  Flows in Undirected Unit Capacity Networks , 1999, SIAM J. Discret. Math..

[18]  Fort Huachuca,et al.  Evaluation of Slot Allocation Strategies for TDMA Protocols in Packet Radio Networks , 1991 .

[19]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

[20]  Bruce A. Reed,et al.  Colouring proximity graphs in the plane , 1999, Discret. Math..

[21]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[22]  Phone Lin,et al.  OVSF code channel assignment for IMT-2000 , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).