Due to its character of topology independency, topology-transparent medium access control (MAC) scheduling algorithm is very suitable for large-scale mobile ad hoc wireless networks. In this paper, we propose a new topologytransparent MAC scheduling algorithm, with parameters of the node number and the maximal nodal degree known, our scheduling algorithm is based on a special balanced incomplete block design whose block size is optimized by maximizing the guaranteed throughput. Its superiority over typical other scheduling algorithms is proven mathematically with respect to the guaranteed throughput, the maximal transmission delay, and also the minimal transmission delay. The effect of inaccuracy in the estimation of the maximal nodal degree on the guaranteed throughput is deduced mathematically, showing that the guaranteed throughput decreases almost linearly as the actual nodal degree increases. Further techniques for improving the feasibility of the algorithm, such as collision avoidance, time synchronization, etc., are also discussed.
Two-way packet exchange synchronization scheme has been widely used in wireless sensor networks. However, due to the fact that its synchronization error accumulates rapidly over hop count, its applications are greatly restricted. In this paper, the factors that cause the accumulation of synchronization error over hop count are investigated. Theoretical analysis shows that two factors including the clock drift and the asymmetry of two-way packet exchange, have distinct influences on synchronization error between two adjacent nodes. Further, the clock frequency order along synchronization path is found to be vital to the accumulation of synchronization error. The above three factors jointly determine the accumulation of synchronization error over hop count in wireless network. Theoretic results are also verified by three fine-grained experiments on wireless sensor network testbed. The conclusions can be used to decrease synchronization error for large-scale wireless network by careful network deployment.
In wireless sensor networks,node localization is a fundamental middleware service.In this paper,a robust and accurate localization algorithm is proposed,which uses a novel iterative clustering model to obtain the most representative intersection points between every two circles and use them to estimate the position of unknown nodes.Simulation results demonstrate that the proposed algorithm outperforms other localization schemes (such as Min-Max,etc.) in accuracy,scalability and gross error tolerance.
