A Novel Stochastic Programming Formulation for Minimum Energy Cooperative Routing

Author(s):  
Fang Liu ◽  
Dacheng Yang ◽  
Yafeng Wang ◽  
Xin Zhang ◽  
Zhe Chen
Author(s):  
Rikard Bakkehaug ◽  
Eirik Stamsø Eidem ◽  
Kjetil Fagerholt ◽  
Lars Magnus Hvattum

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Shuli Song

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%.


2011 ◽  
Vol 10 (11) ◽  
pp. 3813-3823 ◽  
Author(s):  
Mostafa Dehghan ◽  
Majid Ghaderi ◽  
Dennis Goeckel

Sign in / Sign up

Export Citation Format

Share Document