scholarly journals Maximization of Energy Efficiency in Wireless ad hoc and Sensor Networks With SERENA

2009 ◽  
Vol 5 (1) ◽  
pp. 33-52 ◽  
Author(s):  
Saoucene Mahfoudh ◽  
Pascale Minet
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Ad Hoc ◽  
Idle State ◽  
Time Simulation ◽  
Simulation Results ◽  
Remaining Time ◽  
Slot Reuse ◽  
Node Energy

In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. SERENA is based on a two-hop coloring algorithm, whose complexity in terms of colors and rounds is evaluated. We then quantify the slot reuse. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks. We compare SERENA with classical TDMA and optimized variants such as USAP in wireless ad hoc and sensor networks.

Optimization of Clustering Algorithm in Ad Hoc Network

2014 ◽  
Vol 644-650 ◽  
pp. 2834-2837
Author(s):  
Qiong Yu ◽  
Ping Zong
Keyword(s):  
Energy Consumption ◽  
Dynamic Characteristics ◽  
Network Topology ◽  
Ad Hoc Network ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Cluster Structure ◽  
Weighted Clustering ◽  
Simulation Results ◽  
Node Energy

According to the dynamic characteristics of ad hoc network topology, this paper optimizes the clustering algorithm using node energy consumption and the relative connectivity as the factors of weights. Simulation results show the optimized weighted clustering algorithm (OWCA) get better performance than other algorithm, the cluster heads are distributed evenly, the cluster structure becomes more reasonable and stable.

scholarly journals A New Distributed Slot Assignment Algorithm for Wireless Sensor Network Under Convergecast Data Traffic

2017 ◽  
Vol 2 (4) ◽  
pp. 331 ◽  
Author(s):  
Ilker Bekmezci ◽  
Fatih Alagoz
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Ad Hoc ◽  
Time Slot ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Traffic Pattern ◽  
Assignment Algorithm ◽  
Slot Assignment ◽  
Major Factors

The scarcest resource for most of the wireless sensor networks (WSNs) is energy and one of the major factors inenergy consumption for WSNs is due to communication. Notonly transmission but also reception is the source of energyconsumption. The lore to decrease energy consumption is toturn off radio circuit when it is not needed. This is why TDMA has advantages over contention based methods. Time slot assignment algorithm is an essential part of TDMA based systems. Although centralized time slot assignment protocols are preferred in many WSNs, centralized approach is not scalable. In this paper, a new energy efficient and delay sensitive distributed time slot assignment algorithm (DTSM) is proposed for sensor networks under convergecast traffic pattern. DTSM which is developed as part of the military monitory (MILMON) system introduced in [27], aims to operate with low delay and low energy. Instead of collision based periods, it assigns slots by the help of tiny request slots. While traditional slot assignment algorithms do not allow assigning the same slot within two hop neighbors, because of the hidden node problem, DTSM can assign, if assignment is suitable for convergecast traffic. Simulation results have shown that delay and energy consumption performance of DTSM is superior to FPRP, DRAND, and TRAMA which are the most known distributed slot assignment protocols for WSNs or ad hoc networks. Although DTSM has somewhat long execution time, itsscalability characteristic may provide application specific time durations.

scholarly journals Enabling Green Wireless Sensor Networks: Energy Efficient T-MAC Using Markov Chain Based Optimization

Electronics ◽  
2019 ◽  
Vol 8 (5) ◽  
pp. 534 ◽  
Author(s):  
Mahendra Ram ◽  
Sushil Kumar ◽  
Vinod Kumar ◽  
Ajay Sikandar ◽  
Rupak Kharel
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Markov Chain ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Access Control ◽  
Analytical Model ◽  
Wireless Sensor ◽  
Medium Access ◽  
Service Delay

Due to the rapidly growing sensor-enabled connected world around us, with the continuously decreasing size of sensors from smaller to tiny, energy efficiency in wireless sensor networks has drawn ample consideration in both academia as well as in industries’ R&D. The literature of energy efficiency in wireless sensor networks (WSNs) is focused on the three layers of wireless communication, namely the physical, Medium Access Control (MAC) and network layers. Physical layer-centric energy efficiency techniques have limited capabilities due to hardware designs and size considerations. Network layer-centric energy efficiency approaches have been constrained, in view of network dynamics and available network infrastructures. However, energy efficiency at the MAC layer requires a traffic cooperative transmission control. In this context, this paper presents a one-dimensional discrete-time Markov chain analytical model of the Timeout Medium Access Control (T-MAC) protocol. Specifically, an analytical model is derived for T-MAC focusing on an analysis of service delay, throughput, energy consumption and power efficiency under unsaturated traffic conditions. The service delay model calculates the average service delay using the adaptive sleep wakeup schedules. The component models include a queuing theory-based throughput analysis model, a cycle probability-based analytical model for computing the probabilities of a successful transmission, collision, and the idle state of a sensor, as well as an energy consumption model for the sensor’s life cycle. A fair performance assessment of the proposed T-MAC analytical model attests to the energy efficiency of the model when compared to that of state-of-the-art techniques, in terms of better power saving, a higher throughput and a lower energy consumption under various traffic loads.

scholarly journals On Connectivity and Energy Efficiency for Sleeping-Schedule-Based Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2126 ◽  
Author(s):  
Lijun Wang ◽  
Jia Yan ◽  
Tao Han ◽  
Dexiang Deng
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Reference Value ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Normal Operation ◽  
Connectivity Probability ◽  
Communication Radius

Based on the connectivity and energy consumption problems in wireless sensor networks, this paper proposes a kind of new network algorithm called the connectivity and energy efficiency (CEE) algorithm to guarantee the connectivity and connectivity probability, and also to reduce the network energy consumption as much as possible. Under the premise that all sensors can communicate with each other in a specific communication radius, we obtained the relationship among the connectivity, the number of sensor nodes, and the communication radius because of the theory of probability and statistics. The innovation of the paper is to maximize the network connectivity and connectivity probability, by choosing which types of sleeping nodes to wake up. According to the node’s residual energy and the relative value of distance, the algorithm reduces the energy consumption of the whole network as much as possible, and wakes up the number of neighbor nodes as little as possible, to improve the service life of the whole network. Simulation results show that this algorithm combines the connectivity and the energy efficiency, provides a useful reference value for the normal operation of the sensors networks.

scholarly journals Balance the Energy Consumption of Geographic Hashing Location Service in Wireless Sensor and Actor Networks

2019 ◽  
Vol 15 (08) ◽  
pp. 74
Author(s):  
Zhaolin Wang ◽  
Zhezhuang Xu ◽  
Renxu Xie ◽  
Haotian Yan
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Load Balance ◽  
Efficient Solution ◽  
Geographic Routing ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Location Service ◽  
Simulation Results ◽  
Actor Networks

Location service is an efficient solution to handle actor mobility in wireless sensor and actor networks. Geographic hashing location service (GHLS) is a flat hashing-based protocol which has better energy efficiency than other location service protocols. Nevertheless, GHLS suffers from unbalanced energy consumption due to the fixed hashed region. In this paper, we propose a new protocol termed as GHLS-R<sup>2</sup> to achieve load balance in two aspects: location server rotation and energy-aware geographic routing. Simulation results show that GHLS-R<sup>2</sup> protocol can effectively balance the energy consumption, and hence prolong the network lifetime significantly.

Energy Efficient Multi-Hop Wireless Sensor Networks with CMIMO-SM Scheme

2014 ◽  
Vol 666 ◽  
pp. 322-326
Author(s):  
Yu Yang Peng ◽  
Jae Ho Choi
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Improve Energy Efficiency ◽  
Output System

Energy efficiency is one of the important hot issues in wireless sensor networks. In this paper, a multi-hop scheme based on a cooperative multi-input multi-outputspatial modulation technique is proposed in order to improve energy efficiency in WSN. In this scheme, the sensor nodes are grouped into clusters in order to achieve a multi-input multi-output system; and a simple forwarding transmission scenario is considered so that the intermediate clusters only forward packets originated from the source cluster down to the sink cluster. In order to verify the performance of the proposed system, the bit energy consumption formula is derived and the optimal number of hopsis determined. By qualitative experiments, the obtained results show that the proposed scheme can deliver the data over multiple hops consuming optimal energy consumption per bit.

Sign in / Sign up

Export Citation Format

Share Document