An emergent application of Wireless Sensor Network (WSN) technology is in the area of Wind FarmMonitoring (WFM), in which relays are used to connect sensors. Key problems to solve in WFM include how to balance loads across relay nodes and how to place relay nodes for redundancy and fault-tolerance. Each wind turbine has a potentially large number of data points needing to be monitored and collected, as farms continue to increase in scale; distances between turbines can reach several hundred meters. Optimal placement of relays in a large farm requires an efficient algorithmic solution. A relay node placement algorithm is proposed in this paper to approximate the optimal position for relays connecting each turbine. However, constraints are then required to prevent relay nodes being overloaded in 3-dimensions. The algorithm is extended to 3-dimensional Euclidean space for this optimal relay node placement problem. A heuristic algorithm is proposed for candidate relay nodes selection and its feasibility considered and verified. Based on the results obtained, an improved algorithm is proposed. Linearization of the algorithm's complexity is then considered to achieve network load balancing and reliability. Simulation results are presented in conclusion.

No abstract

No abstract

This paper presents the research on application of wireless sensor networks (WSNs) in wind power generation system and highlights an important issue associated with the deadline for the delivery of messages among nodes based on IEEE 802.15.4E standard. Due to the limits of standard and the power system application requirements, this research proposes a smart GTS (S-GTS) allocation algorithm which is based on Urgent/Important Matrix. This proposed algorithm promotes the utilization of CFP in a superframe, which can reach 94.64%. And over seven GTSs can be allocated in a superframe, there are only seven GTSs can be used in the standard. Additionally, this paper proves the value of BO and SO upper bound is 6 for the WSN application in power system. Moreover, when BO = SO =2, the network delay of S-GTS is 13.44ms, which perform better than 16-time-slot mechanism (58.08ms) and i-GAME mechanism (61.44 ms).