Coloring-Based Inter-WBAN Scheduling for Mobile Wireless Body Area Networks

In this study, random incomplete coloring (RIC) with low time-complexity and high spatial reuse is proposed to overcome in-between wireless-body-area-networks (WBAN) interference, which can cause serious throughput degradation and energy waste. Interference-avoidance scheduling of wireless networks can be modeled as a problem of graph coloring. For instance, high spatial-reuse scheduling for a dense sensor network is mapped to high spatial-reuse coloring; fast convergence scheduling for a mobile ad hoc network (MANET) is mapped to low time-complexity coloring. However, for a dense and mobile WBAN, inter-WBAN scheduling (IWS) should simultaneously satisfy both of the following requirements: 1) high spatial-reuse and 2) fast convergence, which are tradeoffs in conventional coloring. By relaxing the coloring rule, the proposed distributed coloring algorithm RIC avoids this tradeoff and satisfies both requirements. Simulation results verify that the proposed coloring algorithm effectively overcomes inter-WBAN interference and invariably supports higher system throughput in various mobile WBAN scenarios compared to conventional colorings.

[1]  Andreas Björklund,et al.  Set Partitioning via Inclusion-Exclusion , 2009, SIAM J. Comput..

[2]  Yuming Jiang,et al.  Provisioning of adaptability to variable topologies for routing schemes in MANETs , 2004, IEEE Journal on Selected Areas in Communications.

[3]  Yves Métivier,et al.  About randomised distributed graph colouring and graph partition algorithms , 2010, Inf. Comput..

[4]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[5]  Öjvind Johansson.  Simple Distributed Delta+1-coloring of Graphs , 1999, Inf. Process. Lett..

[6]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[7]  Chun-Ting Chou,et al.  Mobility support enhancements for the WiMedia UWB MAC protocol , 2005, 2nd International Conference on Broadband Networks, 2005..

[8]  Ivan Howitt.  Mutual interference between independent Bluetooth piconets , 2003, IEEE Trans. Veh. Technol..

[9]  Milind Dawande,et al.  Link scheduling in wireless sensor networks: Distributed edge-coloring revisited , 2008, J. Parallel Distributed Comput..

[10]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[11]  ChingYao Huang,et al.  Power model for wireless body area network , 2008, 2008 IEEE Biomedical Circuits and Systems Conference.

[12]  Amre El-Hoiydi.  Interference between Bluetooth networks-upper bound on the packet error rate , 2001, IEEE Communications Letters.

[13]  Benedito J. B. Fonseca.  An augmented graph-based coloring scheme to derive upper bounds for the performance of distributed schedulers in CSMA-based mbile ad hoc networks , 2006, IWCMC '06.

[14]  Alessandro Panconesi,et al.  Nearly optimal distributed edge coloring in O (log log n ) rounds , 1997 .

[15]  Avraham Adler,et al.  Lambert-W Function , 2015 .

[16]  Jianfeng Wang,et al.  Applications, challenges, and prospective in emerging body area networking technologies , 2010, IEEE Wireless Communications.

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

[18]  Viswanath Tolety,et al.  Load Reduction in Ad Hoc Networks Using Mobile Servers , 1999 .

[19]  S. Ramanathan,et al.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[20]  Mehul Motani,et al.  Inter-User Interference in Body Sensor Networks: Preliminary Investigation and an Infrastructure-Based Solution , 2009, 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks.

[21]  Christian Scheideler,et al.  Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.