The Implementation of Energy-Efficient and QoS Balancing Routing Based on OpenFlow Networks

2013 ◽  
Vol 411-414 ◽  
pp. 697-702
Author(s):  
Jia Hu ◽  
Jin He Zhou
Keyword(s):  
Energy Consumption ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Minimum Energy ◽  
Experimental Platform ◽  
Minimum Energy Consumption ◽  
Efficient Management

In this paper an energy-efficient management routing algorithm is presented. We provide a new idea and some solutions to balance the energy-efficient and QoS. Within the scope of QoS requirements, the routers consider energy-efficient and QoS at the same time, and choose a minimum energy consumption path. The proposed routing algorithm is then implemented with OpenFlow, which is an expandable, customizable, controllable and programmable experimental platform. The result indicates that proposed algorithm works well, and can balances between energy-efficient and QoS.

scholarly journals Optimization of Energy-Efficient Speed Profile for Electrified Vehicles

2018 ◽  
Author(s):  
Hadi Abbas ◽  
Youngki Kim ◽  
Jason B. Siegel ◽  
Denise M. Rizzo
Keyword(s):  
Energy Consumption ◽  
Energy Efficient ◽  
Minimum Energy ◽  
Efficient Operation ◽  
Operating Modes ◽  
Minimum Energy Consumption ◽  
System A ◽  
Trip Time ◽  
Route Information

This paper presents a study of energy-efficient operation of vehicles with electrified powertrains leveraging route information, such as road grades, to adjust the speed trajectory. First, Pontryagin’s Maximum Principle (PMP) is applied to derive necessary conditions and to determine the possible operating modes. The analysis shows that only 5 modes are required to achieve minimum energy consumption; full propulsion, cruising, coasting, full regeneration, and full regeneration with conventional braking. The minimum energy consumption problem is reformulated and solved in the distance domain using Dynamic Programming to optimize speed profiles. A case study is shown for a light weight military robot including road grades. For this system, a tradeoff between energy consumption and trip time was found. The optimal cycle uses 20% less energy for the same trip duration, or could reduce the travel time by 14% with the same energy consumption compared to the baseline operation.

scholarly journals Digital Media Art Communication Based on Wireless Cooperative Routing with Minimum Energy Consumption

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Shuli Song
Keyword(s):  
Energy Consumption ◽  
Digital Media ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Target Area ◽  
Media Art ◽  
Cooperative Routing ◽  
Minimum Energy Consumption

Wireless cooperative routing algorithm transmits the data collected in the target area to users, so that users can obtain monitoring information timely and accurately. In the traditional low-power adaptive clustering hierarchical routing protocol, the process of building clusters is random, the resources of nodes are not fully utilized, the node death speed is fast, the network life cycle is short, and the performance is not stable enough. In addition, the route maintenance process is cumbersome and will occupy a lot of bandwidth. In order to solve the problems of real-time transmission of digital media art communication data and network lifetime optimization, a wireless cooperative routing algorithm based on minimum energy consumption is proposed. The facts of transmission strength consumption, node residual strength, and minimal information transmission extension are analyzed, a new weight feature is proposed, and a multipath statistics routing scheme is developed by using the usage of the minimal strength consumption. All digital media art propagation sensor nodes transmit data to sink nodes along multiple transmission paths. Simulation results show that the algorithm can prolong the network lifetime, reduce and balance the node energy consumption, reduce the data transmission delay, reduce the energy consumption of wireless cooperative routing based on the minimum energy consumption by 64.5%, and increase the number of compressed images by 182%.

Energy Efficient Multi-Hop Wireless Sensor Networks with Cooperative MIMO Scheme

2013 ◽  
Vol 660 ◽  
pp. 124-129
Author(s):  
Yu Yang Peng ◽  
Jaeho Choi ◽  
Zi Chen Ren ◽  
Jae Ho Choi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Minimum Energy ◽  
Multiple Input Multiple Output ◽  
Wireless Sensor ◽  
Cooperative Mimo ◽  
Minimum Energy Consumption ◽  
Input Multiple Output

For wireless sensor networks, energy efficiency is one of the most important subjects in recent research. In this paper, an energy-efficient multi-hop scheme based on cooperative MIMO (multiple-input multiple-output) technique is proposed for wireless sensor networks. Different from other papers, we consider a single cluster transmission scenario in which energy consumption is optimized by selecting the hop length and modulation constellation size. The optimal energy consumption formula is derived and proved mathematically. In addition, the minimum energy consumption per bit is calculated numerically.

Optimal Hop Lengths to Ensure Minimum Energy Consumption in Wireless Sensor Networks

2020 ◽  
pp. 105-124
Author(s):  
Mekkaoui Kheireddine ◽  
Rahmoune Abdellatif
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
High Performance ◽  
Routing Algorithm ◽  
Minimum Energy ◽  
Wireless Sensor ◽  
Minimum Energy Consumption ◽  
Small Antenna ◽  
Save Energy

In wireless sensor networks, nodes have a low computing capacity, a small antenna and a very limited energy source; thereby batteries are considered as a critical resource and should be used efficiently. On the other hand, the antennas are the biggest consumers of energy, therefore, and their use must be very efficient to minimize energy consumption. In a dense WSN, each node may route messages to destination nodes either through short-hops or long-hops, by using a short or a long radio range. Thus, the hop length optimization can save energy. In this article, the authors propose a theorem to optimize the hop lengths and a routing algorithm to improve the WSN power consumption. The theorem establishes a simple condition to ensure the optimal hop lengths which guarantees the minimum energy consumption. And the proposed algorithm based on that condition is used to find the optimal routing path. The simulation results are obtained by applying the condition and the algorithm on WSNs and reveals a high performance regarding WSNs energy consumption and network lifetime.

Optimal Hop Lengths to Ensure Minimum Energy Consumption in Wireless Sensor Networks

2018 ◽  
Vol 9 (4) ◽  
pp. 1-18 ◽  
Author(s):  
Mekkaoui Kheireddine ◽  
Rahmoune Abdellatif
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
High Performance ◽  
Routing Algorithm ◽  
Minimum Energy ◽  
Wireless Sensor ◽  
Minimum Energy Consumption ◽  
Small Antenna ◽  
Save Energy

In wireless sensor networks, nodes have a low computing capacity, a small antenna and a very limited energy source; thereby batteries are considered as a critical resource and should be used efficiently. On the other hand, the antennas are the biggest consumers of energy, therefore, and their use must be very efficient to minimize energy consumption. In a dense WSN, each node may route messages to destination nodes either through short-hops or long-hops, by using a short or a long radio range. Thus, the hop length optimization can save energy. In this article, the authors propose a theorem to optimize the hop lengths and a routing algorithm to improve the WSN power consumption. The theorem establishes a simple condition to ensure the optimal hop lengths which guarantees the minimum energy consumption. And the proposed algorithm based on that condition is used to find the optimal routing path. The simulation results are obtained by applying the condition and the algorithm on WSNs and reveals a high performance regarding WSNs energy consumption and network lifetime.

scholarly journals Swarm intelligence based reliable and energy balance routing algorithm for wireless sensor network

2016 ◽  
Vol 29 (3) ◽  
pp. 339-355
Author(s):  
Fatma Elfouly ◽  
Rabie Ramadan ◽  
Mohamed Mahmoud ◽  
Moawad Dessouky
Keyword(s):  
Energy Consumption ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Minimum Energy Consumption ◽  
Energy Balanced Routing ◽  
Memory Resources

Energy is an extremely crucial resource for Wireless Sensor Networks (WSNs). Many routing techniques have been proposed for finding the minimum energy routing paths with a view to extend the network lifetime. However, this might lead to unbalanced distribution of energy among sensor nodes resulting in, energy hole problem. Therefore, designing energy-balanced routing technique is a challenge area of research in WSN. Moreover, dynamic and harsh environments pose great challenges in the reliability of WSN. To achieve reliable wireless communication within WSN, it is essential to have reliable routing protocol. Furthermore, due to the limited memory resources of sensor nodes, full utilization of such resources with less buffer overflow remains as a one of main consideration when designing a routing protocol for WSN. Consequently, this paper proposes a routing scheme that uses SWARM intelligence to achieve both minimum energy consumption and balanced energy consumption among sensor nodes for WSN lifetime extension. In addition, data reliability is considered in our model where, the sensed data can reach the sink node in a more reliable way. Finally, buffer space is considered to reduce the packet loss and energy consumption due to the retransmission of the same packets. Through simulation, the performance of proposed algorithm is compared with the previous work such as EBRP, ACO, TADR, SEB, and CLR-Routing.

scholarly journals Survey: energy efficient protocols using radio scheduling in wireless sensor network

2020 ◽  
Vol 10 (2) ◽  
pp. 1296
Author(s):  
Deepa Mathew K. ◽  
Anita Jones
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Transmission ◽  
Energy Efficient ◽  
Network Performance ◽  
Minimum Energy ◽  
Wireless Sensor ◽  
Survey Study ◽  
Minimum Energy Consumption ◽  
Scheduling Protocols

An efficient energy management scheme is crucial factor for design and implementation of any sensor network. Almost all sensor networks are structured with numerous small sized, low cost sensor devices which are scattered over the large area. To improvise the network performance by high throughput with minimum energy consumption, an energy efficient radio scheduling MAC protocol is effective solution, since MAC layer has the capability to collaborate with distributed wireless networks. The present survey study provides relevant research work towards radio scheduling mechanism in the design of energy efficient wireless sensor networks (WSNs). The various radio scheduling protocols are exist in the literature, which has some limitations. Therefore, it is require developing a new energy efficient radio scheduling protocol to perform multi tasks with minimum energy consumption (e.g. data transmission). The most of research studies paying more attention towards to enhance the overall network lifetime with the aim of using energy efficient scheduling protocol. In that context, this survey study overviews the different categories of MAC based radio scheduling protocols and those protocols are measured by evaluating their data transmission capability, energy efficiency, and network performance. With the extensive analysis of existing works, many research challenges are stated. Also provides future directions for new WSN design at the end of this survey.

Energy Efficient Clustering and Routing Algorithm for WSN

2019 ◽  
Vol 12 ◽  
Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Hot Spot ◽  
Routing Algorithm ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Clustering ◽  
Hot Spot Problem

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.

Sign in / Sign up

Export Citation Format

Share Document