In order to solve the problems that the process of accessing channel is complex and pronely causes collision in MIMO-based wireless sensor networks(WSN)
a heterogeneous WSN model and a centralized time division multiple access(TDMA)scheduling algorithm based on the network model are proposed. The nodes of the network model are classified into common nodes and special nodes with multiple antennas
and are divided into clusters. The special nodes act as cluster headers
and tree-routes are constructed among them. The network model effectively solves the problem of transmission direction as assigning time slot. The scheduling algorithm based on the model first colors the nodes with considering the conflict node degree of special node
then decides the scheduling priority according to the product of node packet number and hop to the base station. The simulations show that the algorithm enables to effectively avoid conflict and raises utilization rate of slot with better performances in latency
throughput and suitability for the MIMO-based WSN.
关键词
Keywords
references
CHEN Weipeng, HOU Jennifer, SHA Lui. Dynamic clustering for acoustic target tracking in wireless sensor network. [J]. IEEE Transactions on Mobile Computing, 2004, 3(3): 258-271.
CUI Shuguang, GOLDSMISTH A J, ARS B. Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks [J]. IEEE Journal, 2004, 22(6): 1089-1098.
ZHANG Yanbing, DAI Huaiyu. Selecting optimal transmission strategies for cooperative sensor networks [C]∥Proceedings of IEEE Conference on Information Sciences and Systems. Piscataway, NJ, USA: IEEE Press, 2005: 335-341.
SUDHARMAN K. Virtual MIMO-based cooperative communication for energy-constrained wireless sensor networks [J]. IEEE Transactions on Wireless Communications, 2006, 5(5): 984-989.
李青, 于宏毅, 刘阿娜.基于协作分集技术的WSN MAC 协议设计[J].电信科学, 2007, 23(1): 54-59.
LI Qing, YU Hongyi, LIU A'na. MAC layer study of wireless sensor networks using cooperative transmission [J]. Telecommunications Science, 2007, 23(1): 54-59.
RAMANATHAN S. Scheduling algorithms for multi-hop radio networks [J]. ACM Transactions on Networking, 1993, 1(2): 211-222.
GANDHAM S, DAWANDE M. Link scheduling in sensor networks: distributed edge coloring revisited [C]∥Proceedings of IEEE INFCOM 2005: Vol 4. New York, USA: John Wiley, 2005: 2492-2501.
CHENG Maggie, LI Yin. Transmission scheduling in sensor networks via directed edge coloring [C]∥Proceedings of IEEE International Conference on Communications 2007. New York, USA: John Wiley, 2007: 3710-3715
LIN Zhiting, ZHAO Baohua, QU Yugui. Dynamic-tree structure in WSN [J]. Journal of Beijing University of Posts and Telecommunications, 2006, 29(S): 18-22.
ARIKAN E. Some complexity results about packet radio networks [J]. IEEE Trans on Information Theory, 1984, 30(4): 910-918.
SINERM C E, PRAVIN V. TDMA scheduling algorithms for sensor network [R]. Berkeley, CA, USA: University of California Berkeley. Department of Electrical Engineering and Computer Science, 2005.