Large scale wireless sensor networks raise many challenges in the design of efficient and effective routing algorithm due to their complexity and hardware constraints. However, the scalability challenge may be mitigated from a macroscopic perspective. One example is the distributed De la Garza iteration (DDLGI) algorithm for global routing load-balancing, based on a set of partial differential equations iteratively solved by the De la Garza method. We theoretically analyze the parallelism of DDLGI and illustrate that the region of interest may impact the degree of parallelism and error. Furthermore, though DDLGI always converges, the slow convergence and long-range information exchange problems may lead to excess energy consumption in communication. Thus, we propose various enhanced De la Garza routing (E-DLGR) algorithms to alleviate the energy consumption problem by which nodes may exchange less information and only need to exchange information with closer nodes to complete each iteration. Our theoretical analysis and simulation results show that the proposed E-DLGR algorithms may have less transmission overhead, thus further reducing energy consumption, and converge faster while still maintaining adequate accuracy.
We propose an analytical model to evaluate the lightpath blocking performance for a single ROADM node with intra-node add/drop contention,in which the number of lightpaths that can be added/dropped with the same wavelength is limited by the add/drop contention factor.Different models of traffic load per nodal degree are considered to validate the effectiveness of the analytical model.The simulation results show that the proposed analytical model is effective in predicting the performance for different values of add/drop contention factor C and for variable offered loads at the node.The add/drop contention factor shows an important impact on the lightpath blocking performance and properly raising the contention factor can significantly improve the lightpath blocking performance.When the add/drop contention factor C exceeds a certain level,the performance of a ROADM with intra-node contention is close to that of a contentionless ROADM. 相似文献
