The transmission performance of wireless network was improved through static optimization with the combination of Linkscheduling and Timeslotassignment algorithms, focusing on the industrial wireless network. Linkscheduling algorithm allocated the spatial resource and Timeslotassignment algorithm distributed the temporal resource, the interaction of which impacts the transmission performance of wireless network commonly. Firstly, a multihops grading model was proposed according to the transmission performance of wireless network to build a hierarchical wireless network, through which the connections between wireless nodes were simplified. Then a scheme for synchronous optimization of Linkscheduling and Timeslotassignment was given based on the proposed model. Secondly, for the two different problems that belonged to space and time, respectively, link coloring algorithm was used to separate conflicting links for the sake of avoiding conflict data transfer in wireless network. Hierarchical coding scheme was proposed and a genetic algorithm (GA) with doublelayer encoding was put forward to connect Linkscheduling and Timeslotassignment algorithms by using implicit parallelism and combinatorial optimization, which could eliminate the interference between them. At last, a synchronous optimization strategy based on genetic algorithm was formulated and verified. Results show that the transmission performance of network sampling rate, the network delay and the network nodes load get further improvement by using optimized algorithms with synchronous strategy.
SI En bo, WANG Jing, JIN Qi bing, ZHOU Jing lin. Synchronous optimization of linkscheduling and timeslot assignment for industrial wireless network. JOURNAL OF ZHEJIANG UNIVERSITY (ENGINEERING SCIENCE), 2016, 50(6): 1203-1213.
[1] ERGEN S C,VARAIYA P. TDMA scheduling algorithms for sensor networks [J]. Wireless Networks, 2010,16(4): 985-997.
[2] GANDHAM S, DAWANDE M, PRAKASH R. Link scheduling in sensor networks: distributed edge coloring revisited [C] ∥ Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM ′05). New York: IEEE, 2005: 2492-2501.
[3] ZHANG X, HONG J, ZHANG L, et al. CCTDMA: coloringand codingbased multichannel TDMA scheduling for wireless ad hoc networks [C] ∥ Wireless Communications and Networking Conference. Hong Kong: WCNC, 2007: 133-137.
[4] TSVETKOV T, SANNECK H, CARLE G. A graph coloring approach for scheduling undo actions in selforganizing networks [C] ∥ 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM). Ottawa: IEEE, 2015: 348-356.
[5] 赵亚楠. 无线传感器网络中的时分复用调度算法研究[D].吉林:吉林大学,2013.
ZHAO Yanan, Research on time division multiplexing scheduling algorithm in wireless sensor networks [D]. Jilin: Jilin University, 2013.
[6] SRIDHARAN A, KRISHNAMACHARI B. Maxmin fair collisionfree scheduling for wireless sensor networks [C] ∥ 2004 IEEE International Conference on Performance, Computing, and Communications. Phoenix: IEEE, 2004: 585-590.
[7] GANDHAM S, ZHANG Y, HUANG Q. Distributed minimal time convergecast scheduling in wireless sensor networks [C] ∥ 26th IEEE International Conference on Distributed Computing Systems, 2006. ICDCS 2006. Lisbon: IEEE, 2006: 5050.
[8] DJUKIC P, VALAEE S. Link scheduling for minimum delay in spatial reuse TDMA [C] ∥ INFOCOM 2007. 26th IEEE International Conference on Computer Communications. Anchorage: IEEE, 2007: 28-36.
[9] KALA S M, MUSHAM R, REDDY M P K, et al. Radio colocation aware generic multiradio multichannel conflict graph generation [J]. arXiv preprint arXiv: 1412.2566, 2014.
[10] ABBAS S H, HONG S H. A scheduling and synchronization technique for RAPIEnet switches using edgecoloring of conflict multigraphs [J]. Journal of Communications and Networks, 2013, 15(3): 321-328.
[11] GOBRIEL S, MOSSE D, CLERIC R. TDMAASAP: Sensor network TDMA scheduling with adaptive slotstealing and parallelism [C] ∥ ICDCS′09.29th IEEE International Conference on Distributed Computing Systems. Montreal: IEEE, 2009: 458-465.
[12] LUO X Y, YAN Y L, LI S B, et al. Topology control based on optimally rigid graph in wireless sensor networks [J]. Computer Networks, 2013, 57(4): 1037-1047.
[13] MA J, LOU W, LI X Y. Contiguous link scheduling for data aggregation in wireless sensor networks [J]. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(7): 1691-1701.
[14] ZHOU Y, LI X Y, LIU M, et al. Throughput optimizing localized link scheduling for multihop wireless networks under physical interference model [J]. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(10): 2708-2720.
[15] KAR K, SARKAR S, GHAVAMI A, et al. Delay guarantees for throughputoptimal wireless link scheduling [J]. Transactions on Automatic Control, IEEE, 2012, 57(11): 2906-2911.
[16] KHAN M F, FELEMBAN E A, QAISAR S, et al. Performance analysis on packet delivery ratio and endtoend delay of different network topologies in wireless sensor networks (WSNs) [C] ∥ 2013 IEEE Ninth International Conference on Mobile Adhoc and Sensor Networks (MSN). Dalian: IEEE, 2013: 324-329.
[17] 张晓轲,曾健平,徐朝农,等.基于分布式图染色的无线MAC调度算法研究[J].计算机研究与发展,2011(增2):216-222.
ZHANG Xiaoke, ZENG Jianping, XU Chaonong, et al. Research on wireless MAC scheduling algorithm based on distributed graph coloring [J]. Computer Research and Development, 2011(Suppl.2): 216-222.
[18] ZENG J P, ZHANG X K, XU C N, et al. MAC scheduling algorithm for wireless networks based on distributed graph algorithm [J]. Computer Engineering, 2012, 19: 4.
HE Xiao-feng, MA Cheng-yan, YE Tian-chun, WANG Liang-kun,MO Tai-shan. Digital programmable RF wideband amplifier[J]. JOURNAL OF ZHEJIANG UNIVERSITY (ENGINEERING SCIENCE), 2012, 46(11): 1985-1990.