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

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.

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.

scholarly journals Maximizing Network Lifetime Operator for Wireless Sensor Networks

2013 ◽  
Vol 4 (2) ◽  
pp. 267-272
Author(s):  
Dr. Deepali Virmani
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Topology Control ◽  
Performance Metrics ◽  
Minimum Energy ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Minimum Energy Consumption

Optimizing and enhancing network lifetime with minimum energy consumption is the major challenge in field of wireless sensor networks. Existing techniques for optimizing network lifetime are based on exploiting node redundancy, adaptive radio transmission power and topology control. Topology control protocols have a significant impact on network lifetime, available energy and connectivity. In this paper we categorize sensor nodes as strong and weak nodes based on their residual energy as well as operational lifetime and propose a Maximizing Network lifetime Operator (MLTO) that defines cluster based topology control mechanism to enhance network lifetime while guarantying the minimum energy consumption and minimum delay. Extensive simulations in Java-Simulator (J-Sim) show that our proposed operator outperforms the existing protocols in terms of various performance metrics life network lifetime, average delay and minimizes energy utilization.

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 Energy Conservation In Wsn Using Hyper Sphere Sensor Optimisation

2019 ◽  
Vol 8 (6) ◽  
pp. 3672-3676
Keyword(s):  
Energy Consumption ◽  
Sensor Network ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Network Nodes ◽  
Sensor Optimization ◽  
Minimum Energy Consumption ◽  
Compact Size ◽  
Energy Location ◽  
Almost All

Due to minimum energy consumption and compact size, the Wireless Sensor Network (WSN) is widely used in almost all areas of research. In WSN, optimum coverage and lifetime of nodes are major challenges. In this paper, a Hyper Sphere Sensor Optimization is proposed to estimate the neighbourhood distance for placing the sensor nods in an optimal way over an effective location. Levy fight in flower pollination utilized for optimal energy location with hyper sphere localization. In first phase based on hyper sphere is used to location identification of sensor nodes. Based on neighbour hood distance energy consumption of sensor network nodes are reduced. The results show that the proposed method is effective than other methods in terms of reducing the reduced energy consumption.

scholarly journals EARPC – Energy Aware Routing Protocol for Cooperative MIMO Scheme in WSNs

2020 ◽  
Vol 3 ◽  
pp. 22-27
Author(s):  
Kummathi Chenna Reddy ◽  
Geetha D. Devanagavi ◽  
Thippeswamy M. N.
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Levels ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Energy Aware ◽  
Energy Efficient Routing ◽  
Energy Aware Routing

Wireless sensor networks are typically operated on batteries. Therefore, in order to prolong network lifetime, an energy efficient routing algorithm is required. In this paper, an energy-aware routing protocol for the co-operative MIMO scheme in WSNs (EARPC) is presented. It is based on an improved cluster head selection method that considers the remaining energy level of a node and recent energy consumption of all nodes. This means that sensor nodes with lower energy levels are less likely to be chosen as cluster heads. Next, based on the cooperative node selection in each cluster, a virtual MIMO array is created, reducing uneven distribution of clusters. Simulation results show that the proposed routing protocol may reduce energy consumption and improve network lifetime compared with the LEACH protocol

scholarly journals An Improved GPSR Algorithm Based on Energy Gradient and APIT Grid

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Zhuang Liu ◽  
Xin Feng ◽  
Jingjing Zhang ◽  
Teng Li ◽  
Yanlong Wang
Keyword(s):  
Energy Consumption ◽  
Greedy Algorithm ◽  
Routing Algorithm ◽  
High Energy ◽  
Sensor Nodes ◽  
Target Area ◽  
Localization Algorithm ◽  
Right Hand ◽  
Energy Gradient ◽  
High Energy Consumption

We investigate GPSR algorithms of WSN and propose an improved routing algorithm based on energy gradient and APIT grid to solve the problem of high and unbalanced energy consumption of GPSR. In GPSR, network uses greedy algorithm and right-hand rule to establish routing paths, and the path keeps running till some nodes within the path are invalid because energy is exhausted, which would lead to the high energy consumption of some nodes in the path and the low energy consumption of others nearby the nodes not in the path as well as bringing high and unbalanced energy consumption of the network. Regarding these problems, we use APIT localization algorithm and APIT grid to query and establish routing paths and establish the corresponding energy gradient when messages are transmitted along the routing paths. When some nodes are approaching the threshold status, we use right-hand rule and recursion greedy algorithm in advance to plan a new routing path towards the target area. When query messages arrive at the event area, the network uses a different method to transmit data according to the density of sensor nodes. Simulation experiments show that the improved routing algorithm is capable of reducing the energy consumption of network and extending the lifecycle of network.

scholarly journals Determination of Optimal Number of Relays Using a New Energy Model for WSN

2018 ◽  
Vol 4 (2) ◽  
pp. 572-579
Author(s):  
Partha Pratim Bhattacharya ◽  
Shilpi Gupta ◽  
Nupur Pal
Keyword(s):  
Energy Consumption ◽  
Minimum Energy ◽  
Optimal Number ◽  
Energy Model ◽  
Sensor Nodes ◽  
Direct Transmission ◽  
Direct Path ◽  
Minimum Energy Consumption ◽  
New Energy

Wireless Sensor Networks are proving themselves as a boon to the surroundings and its deployment is a prominent area to be considered for minimum energy consumption. In this paper, we have considered deployment of a sensor grid network for 36 and 100 number of sensor nodes. Diagonally opposite nodes are considered to be source and destination. Using a modified energy model, the energy consumption for direct path and that with different number of relays are calculated. The maximum distance up to which direct transmission is possible and the number of required relays for higher transmission distances are then found out.

Evaluation of Energy Consumption of LPWAN Technologies

2021 ◽  
Author(s):  
Husam Rajab ◽  
Tibor Cinkler ◽  
Taoufik Bouguera
Keyword(s):  
Energy Consumption ◽  
Low Power ◽  
Sensor Node ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Sleep Mode ◽  
Area Network ◽  
Wide Area Network ◽  
Battery Lifetime ◽  
Minimum Energy Consumption

Abstract The modern technological innovations provide small radios with ability to broadcast over vast areas with minimum energy consumption that will significantly influence the future of the Internet of Things (IoT) communications. The majority of IoT implementations demand sensor nodes run reliably for an extended time. Furthermore, the radio settings can endure a high data rate transmission while optimizing the energy-efficiency. The LoRa/LoRaWAN is one of the primary Low-Power Wide Area Network (LPWAN) technology that has highly enticed much concentration recently from the community. The energy limits is a significant issue in wireless sensor networks since battery lifetime that supplies sensor nodes have a restricted amount of energy and neither expendable nor rechargeable in most cases. A common hypothesis in previous work is that the energy consumed by sensors in sleep mode is negligible. With this hypothesis, the usual approach is to consider subsets of nodes that reach all the iterative targets. These subsets also called coverage sets, are then put in the active mode, considering the others are in the low-power or sleep mode. In this paper, we address this question by proposing an energy consumption model based on LoRa and LoRaWAN, that model optimizes the energy consumption of the sensor node for different tasks for a period of time. The proposed analytical approach permits considering the consumed power of every sensor node element; furthermore, it can be used to analyse different LoRaWAN modes to determine the most desirable sensor node design to reach its energy autonomy.

Sign in / Sign up

Export Citation Format

Share Document