Awakening mechanism for sleeping nodes in network containing inaccurate state information

Abstract

The invention discloses an adaptive awakening mechanism for sleeping nodes in a network containing inaccurate state information. The awakening mechanism is characterized in that the optimal awakening time of the sleeping nodes under the condition that the delay constraint is satisfied is computed according to the delays which data packets experience and evaluation on the downstream path delay; and the statistic characteristics of the inaccurate state information of the network are taken into full consideration during computation and the confidence interval of random state parameters is used for evaluating the upper and lower limits of the numerical value of the inaccurate state information in the probability sense, thus effectively increasing the computational accuracy. While ensuring that data delays conform to constraint, the awakening mechanism shows excellent and stable performances in the aspect of saving network energy by optimizing the total sleep time and state transition frequency of the nodes in the network.

Description

technical field [0001] In an imprecise information network with a sleep mechanism, according to the end-to-end delay constraints of data, the method of formulating the optimal wake-up time of each sleep node on the path belongs to the field of Internet energy-saving technology, especially related to reducing incompleteness under delay constraints. Green network field of energy consumption of nodes in information network. Background technique [0002] In recent years, the expansion of network scale and capabilities has led to an increase in the energy consumption of devices in the network (references: Towards Green Broadband Access Networks, P.Chowdhury, M.Tornatore, S.Sarkar, and B.Mukherjee, GLOBECOM, 2009 IEEE , pp.1-6, 2009.). In response to this trend, the concept of "Green Network" (references: Greening of the Internet, M.Gupta and S.Singh, in Proc. ACM SIGCOMM, Vancouver, BC, Canada, Aug.2003.) is gradually being applied to In the research and planning of the new gen...

AI Technical Summary

Problems solved by technology

[0028] The data packet is at the source node S, calculate the shortest delay path P from the source node S to the destination node D 8 S-D , but during the process of data transmission along the path, the state of links and nodes on the path (especially the node sleep state) may change, resulting in the path originally calculated is no longer the optimal path, or even no longer satisfies the delay constraint

Images