45 results about "Energy efficient routing" patented technology

A method and system of an embodiment may include identifying a power source used by a network element, determining a carbon footprint of a unit of power usage from the power source, identifying one or more components associated with the network element used for a network operation performed by the network element, determining the power usage of the one or more identified components during the process, and calculating the carbon footprint of the process performed by the network element.

The invention relates to a clustered energy-saving route algorithm which is applied in wireless transducer network, which is a clustered energy-saving route algorithm which is based on cluster head forecasting and power control, which utilizes residual energy parameter and distance parameter of nodes to predict for cluster heads, and lowers vast cost of frequently constitute clusters and cluster heads, and a mechanism of power control is led in clustered routes and the process of data transmitting, thereby leading average energy consumption of the nodes to be lowered, further prolonging life cycle of networks.

The invention discloses an energy-saving routing method of nodes of an energy effective based on a context-aware technology. A CATRP (Context-Aware Technology Routing Protocol) is used as a routing work way of nodes in an internet of things environment, so as to achieve an established energy saving goal. The method disclosed by the invention belongs to the technical field of the internet of things. According to the method disclosed by the invention, the context-aware technology is applied to communicational nodes which work in the internet of things as a core technology for an energy-saving purpose of the invention, and composition modules of the protocol are designed comprehensively from the perspectives of working process, data structure, quantitative algorithm design, and the like. Due to application of the patent, a good foundation for realization of a universal computing service in the whole society in the near future can be laid, right development of the internet of things technology in the future is guided, theoretical basis enrichment and certain contribution for transformation of a wireless sensor network technology at the present stage are made, and the method has important meaning to enhancement of energy saving technology level of the internet of things in the industry, to acceleration of schedule of a national energy-saving routing research subject for nodes of the internet of things, to promotion of domestic demand, and to promotion of development of related industries.

The invention discloses an energy-saving route setup and power distribution method in a wireless multi-hop relay network in the technical field of network communication. The energy-saving route setup and power distribution method comprises the following steps of: firstly, randomly setting up an initialized route; updating a pheromone in the initialized route during a setup procedure; secondly, setting up a route on the basis through a setup method, and updating a pheromone in the route; obtaining an optimal route according to the pheromone in the route, and updating a specific parameter of the setup method; and repeating the steps for set time to obtain an optimal route which is a final route. According to the energy-saving route setup and power distribution method disclosed by the invention, by comprehensively considering network node residual energy, limited node transmitting power, inter-nodal interference and link transmission rate, the network throughput and the energy service efficiency are comprehensively optimized, so that a route algorithm can more adaptive to the changeful environment of the wireless multi-hop relay network, and meanwhile, the goal that energy is saved for the network is achieved.

The invention provides an energy-efficient routing algorithm (MEERP) for a wireless sensor network, and belongs to the technical field of the wireless sensor network application. This algorithm introduces a mobile sink node and a mobile relay node, considers a size of the network and a quantity of the nodes, and divides the network into several square areas; and then according to a weight sum of node residual energy and a cluster barycentric coordinate distance, a cluster head is selected. The nodes in a grid is communicated with a cluster head node through a multi-hop manner; a controllable mobile strategy is used for the mobile sink node, and when the mobile sink node moves to near the cluster head node, the cluster head node directly sends collected data to the mobile sink node; and a regular mobile manner is used for the mobile relay node in the network, and when the mobile relay node moves to a same position as a sensor node, the mobile relay node takes a forwarding task of all packets of the sensor node, but the sensor node only sends data which are sensed by the sensor node. This algorithm is mainly used in the wireless sensor network route control field.

The invention provides a multi-underwater robot communication-oriented energy-saving routing method. The method comprises three main links of route searching, route restoring and route maintenance and particular comprises the following steps of: judging whether routing exists between two robot nodes or not; if yes, judging whether a broken link exists in the routing or not, and otherwise, selecting and searching the routing between the two robots by a link life time limit-based route searching algorithm; if the broken link exists in a network, performing route restoring by an energy-saving route restoring algorithm; if the broken link does not exist in the network, detecting whether better routing exists or not by an algorithm, if yes, updating the current routing by an energy-saving route maintenance algorithm, and otherwise, judging whether a task ends up or not; and if the task ends up, finishing the process. The multi-underwater robot communication-oriented energy-saving routing method is applied to a multi-underwater robot system. The multi-underwater robot communication-oriented energy-saving routing method has the advantages of taking energy of communication into direct consideration in the steps of route researching, route restoring and route maintenance, greatly saving the energy and the response time of underwater robot communication and guaranteeing that the underwater robot task can be performed successfully.

The invention discloses an energy saving routing algorithm of a composite structure mine emergency rescue wireless mesh network. The algorithm includes the following steps: step 1, node type information is set up; step 2: communication states of Mesh wireless terminals are divided into three types, namely, an 'interior' state, an 'edge' state and a 'repair' state; step 3, each Mesh terminal node maintains one Mesh backbone routing node list; and step 4, if the first Mesh terminal is found to be in the 'interior' state, the neighbor backbone routing nodes nearest to a gateway are selected to set up a route to the gateway directly according to information of the Mesh backbone routing node lists.

The invention relates to a load sensing energy efficiency routing method based on spectrum reservation in an elastic optical network, and belongs to the technical field of optical fiber communication.According to the invention, spectrum use of a node adjacent link on a shortest optical path is subjected to statistics according to a service request, and according to a node spectrum use degree of acurrent optical path and an average spectrum use degree of all the nodes of the whole network, a node load state formula is designed. By the node load state formula and a candidate optical path spectrum idle degree, a load of the shortest optical path is determined. When the shortest optical path has a light load, an available spectrum sensing optical path bandwidth reservation grooming energy-saving routing method is designed, and according to a size of an available spectrum of the optical path, optical path and spectrum resources are dynamically reserved for a service, so that a service grooming success probability is improved and energy consumption of the optical path is reduced; and when the shortest optical path has a heavy load, on the basis of an optical path cost formula of optical path hops and a spectrum continuity, a load balanced minimum cost optical path routing method is designed, so that a service successful transmission probability is improved and a bandwidth blockingrate of a service is reduced.

The invention discloses a minimum-energy-consumption self-adaption convergent routing method on the basis of second-generation wavelet zero tree encoding, which belongs to the technical field of energy-efficient routing of the wireless sensor network. The minimum-energy-consumption self-adaption convergent routing method includes: firstly building an alpha-balance generation tree with performance between the minimum generation tree and the shortest-path tree as an initial transmission path of data; then transmitting node data according to the initial path, and self-adaptively judging whether transmission paths are converged and adjusted correspondingly or not according to convergent gains during transmission; and finally, compressing data subjected to convergent process by second-generation wavelet zero tree so as to reduce data transmission. By the method, aiming to the wireless sensor network of monitoring data which are complicated data such as voice, images or videos and the like, energy-efficient routing can be built and network survival time can be prolonged on the condition of necessary data convergence and convergence expense which cannot ignore.

The invention discloses an application method of a location heuristic factor in establishment of wireless ad hoc network energy-saving routing. On the basis of network energy-saving routing for low-speed wireless ad hoc network with network layer based on ant colony algorithm, network node location is used as one of probabilistic selection heuristic factors in routing establishment, so that neighbor nodes with more advantageous location distribution are highly possible to select for routing, success rate in routing search can be increased, retries of routing search are reduced and energy waste is further reduced. A routing request is initiated from a source node. After a routing request ant is broadcast and status information of a network is searched, a routing reply ant generated by a target node establishes routing from the source node to the target node by means of probabilistic selection. As the location heuristic factor serves as one of important factors in routing probabilistic selection, the routing probabilistic selection tends to connection between the target node and the source node.

The invention discloses an adaptive energy-saving route method for an SDN network and based on link utilization rate. According to features of the SDN network and for solving the shortcoming in an existing energy-saving route algorithm, the link utilization rate which is changed in real time is used as a link cost, and before route selecting, information of a network topology structure and flow matrix is acquired at first. Then a network topology is optimized and pruned, and calculating time of the route algorithm is shortened. According to the route scheme, demands of QoS can be guaranteed while the energy is saved, and after running for a period of time, input streams are automatically gathered on a specific heavy-load link. Finally, a non-load link is closed on the premise of guaranteeing network connectivity. By the method, the energy-saving effect is good in a simulating network, and time complexity is relatively low.

The invention is directed to energy-efficient network processing of delay tolerant data packet traffic. Embodiments of the invention determine if an aggregate of time critical traffic flow rates and minimum rates for meeting QoS requirements of delay tolerant traffic flows exceeds a combined optimal rate of packet processing engines of a network processor. In the affirmative case, embodiments set the processing rate of individual packet processing engines to a minimum rate, such that the cumulative rate of the packet processing engines meets the aggregate rate, and schedule the delay tolerant flows to meet their respective minimum rates. Advantageously, by throttling the processing rate of only delay tolerant traffic, energy consumption of network processors can be reduced while at the same time QoS requirements of the delay tolerant traffic and time critical traffic can be met.

The invention relates to a delay tolerant network energy-efficient routing scheme based on social attribute forwarding. When messages are transmitted from a source node to a target node, routing is carried out according to the following principles that forwarding of the messages in a network is in a single-copy mode; a life cycle TTL field is built for each newly generated message, the initial value of each field is a preset natural number n, a TTL value is reduced by 1 each time the corresponding message is forwarded, and when the TTL value is reduced to 0, the corresponding message is abandoned; the node carrying the messages forwards the messages to the node when and only when meeting a node with a social index SM value amp_ratio times larger than a social index SM value of the node. Besides, message forwarding conditions of the node carrying the messages can be adjusted in a self-adaptation mode by dynamically changing amp_ratio. By means of implement of the scheme, forwarding frequency of the messages in the network is effectively lowered, and routing power consumption of the delay tolerant network is effectively lowered on the premise that a high transmission success rate is guaranteed.

The invention is directed to energy-efficient network processing of delay tolerant data packet traffic. Embodiments of the invention determine if an aggregate of time critical traffic flow rates and minimum rates for meeting QoS requirements of delay tolerant traffic flows exceeds a combined optimal rate of packet processing engines of a network processor. In the affirmative case, embodiments set the processing rate of individual packet processing engines to a minimum rate, such that the cumulative rate of the packet processing engines meets the aggregate rate, and schedule the delay tolerant flows to meet their respective minimum rates. Advantageously, by throttling the processing rate of only delay tolerant traffic, energy consumption of network processors can be reduced while at the same time QoS requirements of the delay tolerant traffic and time critical traffic can be met.

The invention relates to a network device management and energy saving method as well as a resource management device and a route energy saving device thereof. The network device management and energy saving method comprises the following steps: network devices are divided into non-intersected groups which are independent and cover a whole network, intersected groups which have shared devices with other groups and cover the whole network, and an auxiliary group which is composed of a number of scattered devices and cannot cover the whole network; sorting all the network device groups in a unified manner; conducting a global energy-saving routing algorithm on the groups one by one; and determining working network device groups and dormant network device groups according to the relationship between network traffic and network capacity and the sorting sequence of the network device groups. As the network resource reorganization of devices of a whole data center network is based on mastering of the original network structure of the data center network, and the subsequent algorithm is conducted on the groups one by one, the complexity of the algorithm is greatly reduced, and the practicability is improved; and not only the problems that working hours of the devices are uneven and the devices are started frequently, but also the problem that network oscillation can be caused by dormancy awakening of the devices is solved.

The invention relates to an energy-efficient routing algorithm based on a genetic algorithm, which is characterized in that: in an energy harvesting wireless sensor network, establishing a fitness function considering absorption energy, residual energy, consumption energy and waste energy of a node, searching a global optimal path by using the genetic algorithm, and considering energy balance andenergy waste based on the minimum path loss. The energy-efficient routing algorithm has the advantages in energy utilization compared to a fitness function considering only minimum path energy consumption, a fitness function partially considering the path energy consumption and the absorption energy and residual energy of the node on the path, and a fitness function partially considering the pathenergy consumption and the waste energy of all nodes in the network, and can better extend the life cycle of the network.

The invention discloses a downhole wireless sensor network on-demand routing algorithm, and relates to the field of wireless sensor network energy-saving routing technologies. A method for determining a forwarding domain includes the steps that firstly, the angle of the forwarding domain is determined, and a set of neighbor nodes for forwarding an RREQ packet to a current node is set as S[n], wherein the number of nodes in S[n] is larger than or equal to one; when only one node exists in the set, the angle of the forwarding domain is 360 degrees, but a critical edge does not include a connecting line of the current node and the only one node, namely the current node can only be forwarded to nodes except the node in the set; when the number of the nodes in the set is more than one, the determined included angles between any two nodes and the current node are set as alpha, the included angles are compared, and the angle of the forwarding domain is beta, wherein beta is equal to 2 pi-max alpha; secondly, the critical edge of the forwarding domain is determined, wherein the critical edge is the connecting lines of the two nodes determining the angle alpha and the current node; the forwarding domain is determined by determining the angle and the critical edge of the forwarding domain, the forwarding range of the RREQ packet is controlled, and the RREQ packet is made to be only sent to the nodes which do not forward the packet to the current node.

The invention relates to a Q learning-based energy-saving routing method for an SDN network, and belongs to the technical field of network energy saving. The core method comprises the following steps:counting network flow requirements at the current moment, and storing the network flow information into a task queue according to difference of a source node and a target node; constructing a Q tablefor each target node of the network flow and initializing the Q table; taking elements out of the queue, inputting corresponding Q tables according to different destination nodes, outputting the nexthop node position, obtaining awards, and updating the Q tables; repeatedly iterating and updating the Q table; and processing the network flow demand by using the trained Q table. The method is characterized in that the SDN controller directly provides a routing path for each network flow, and dynamically adjusts the on-off states of the router and the link, so that the network achieves the optimal energy efficiency under the condition of meeting the flow demand.

The invention discloses an intra-domain energy-saving routing method based on quick rerouting, comprising the steps of: storing all nodes in a network into a queue Q, calculating a shortest path treespt(v) which uses an arbitrary node v as the root and the shortest path between all node pairs; storing all links in the network into a linked list L, selecting an arbitrary link (u, v) from the linked list L, performing statistics on link loops LC to which the link (u, v) belongs; counting the number of times of occurrences of the each link in the formed all link loops, performing ascending sorting according to the number of times of occurrences of the each link, and storing a sorting result into a linked list M; closing all the links of which deletion marker attributes are zero in the network, calculating a link set P of the all link loops, and marking deletion attributes of the all links in the link set P as 1. Through adoption of the intra-domain energy-saving routing method of the invention, a real-time traffic matrix is not required, and a quick rerouting technology and an energy-saving technology can be combined, thereby balancing energy saving and a network performance.

A method and system of an embodiment may include identifying a power source used by a network element, determining a carbon footprint of a unit of power usage from the power source, identifying one or more components associated with the network element used for a network operation performed by the network element, determining the power usage of the one or more identified components during the process, and calculating the carbon footprint of the process performed by the network element.

The invention discloses an energy-efficient routing decision-making method for a wireless sensor network in a tunnel environment, which comprises the following steps that a tunnel node serving as a source node initiates a routing request and initializes a routing request frame at the same time; after receiving the routing request, the routing node calculates decision factors ETX, Ei and E3TX, updates a routing table, checks whether a table entry of a destination node exists in the routing table, and sends a routing response if the table entry of the destination node exists in the routing table; the routing node receives the routing response, the node compares the locally calculated information with the data in the routing response frame, and if the condition is met, the routing node stopsforwarding to the source node and generates a reverse route. According to the present invention, the optimal path from the source node to the destination node can be obtained by using the routing decision algorithm in combination with energy efficiency, hop count, ETX and reliability, and meanwhile, the problems of time delay and reliability are solved.

The present invention relates to a network equipment management and energy-saving method and its resource management device, and a routing energy-saving device, including dividing network equipment into disjoint groups that are independent and cover the entire network, and intersecting groups that share equipment with other groups and cover the entire network and a number of scattered devices and affiliated groups that cannot cover the entire network, sort each network device group uniformly, and use the group as a unit to perform a global energy-saving routing algorithm. According to the relationship between network traffic and network capacity, according to the sorting order of each group Determine the working network equipment group and the dormant network equipment group. The present invention reorganizes the network resources of the entire data center network equipment on the basis of mastering the original network structure of the data center, and uses the group as a unit in the subsequent algorithm, greatly reducing It reduces the complexity of the algorithm and improves the practicability; it avoids the problems of uneven working time and frequent startup of the device, and also solves the problem of network shocks that may be caused by the device waking up from sleep.

The invention discloses an energy-saving routing strategy design method capable of providing differentiated services, and aims to prolong the service life of the whole networking as far as possible and provide differentiated services for services with different priorities under the condition that the energy of temporary networking nodes is limited. The method specifically comprises the following steps of explaining node energy and sent flow concepts, proposing a routing path residual energy concept, and designing an energy-saving routing strategy; a multi-priority service queue is designed, and differentiated services are provided for services with different priorities. Under the condition that the provided routing strategy and the priority service queue are used in a combined mode, the energy-saving routing strategy design method of differentiated services can be provided.

The present invention discloses an intra-domain energy-saving routing method based on fast rerouting. All nodes in the network are stored in the queue Q, and the shortest path tree spt(v) with any node v as the root and all node pairs are calculated. The shortest path; store all the links in the network in the linked list L, take out any link (u, v) from the linked list L, and count the link ring LC to which the link (u, v) belongs; the statistics formed In all link rings, the number of occurrences of each link is sorted in ascending order according to the number of occurrences of each link, and stored in the linked list M; in the closed network, delete all links whose tag attribute is 0, and calculate all links The link set P of the ring, mark the deletion attribute of all links in P as 1. The method of the present invention does not need a real-time traffic matrix, and can link the fast rerouting technology and the energy-saving technology together, taking energy-saving and network performance into consideration.

The invention discloses a non-uniform clustering low-power-consumption multi-hop routing control method based on fuzzy logic, and aims to solve the technical problems of energy consumption of a wireless sensor and weak adaptive capacity of an existing energy-saving routing control method to a network. A fuzzy logic algorithm is adopted, the clustering size is dynamically adjusted according to the network energy consumption condition and node density information, and energy consumption of cluster heads is effectively balanced; and a routing node with an optimal evaluation value is selected according to node energy and position information, and a routing path is determined. The concept of a network survival node state detector is introduced to monitor the state of the survival node and prolong the survival time of the network. The protocol has high adaptability, the network scale is more flexible, and the protocol is suitable for wireless sensor networks of various scales.

The invention discloses a robust energy efficiency routing method for a teaching cloud computing network, and belongs to the field of cloud computing network green communication. According to the invention, the maximum group of dormant links are searched by applying the SRLA, and the redundant links are converted into the dormant state as much as possible, so that the energy-saving network is realized. The REERA can meet the network robustness requirement under the condition of ensuring normal network routing. The MCRA routing algorithm represents the stability of the whole network through thenetwork criticality, and finally, the dormant redundant link algorithm is combined with the minimum criticality routing algorithm to construct the robust high-efficiency energy-saving routing of thecloud computing network, so that the problem of low-energy-efficiency cloud computing backbone network operation is solved. More importantly, the method can dynamically change and adjust the link weight, ensures that the links can be used in a maximum unified manner, avoids traffic congestion when some links of the cloud computing network are used excessively, and can improve the performance of the whole network.

A three-layer protocol stack in a wireless communication device and a wireless communication network are provided. The three-layer protocol stack includes a physical layer; a medium access control (MAC) layer; and a network layer. The physical layer includes one or more circuits to conduct a power consumption minimization and a waveform selection. The MAC layer is configured to perform a medium access control and a resource block reconfiguration. The network layer is configured to perform an energy efficient routing and connection maintenance. The physical layer, the MAC layer and the network layer cooperate with each other to at least reduce an energy consumption of the wireless communication device.