Energy Efficient Sensor Deployment with TCOV and NCON in Wireless Sensor Networks

Author(s):  
Arvind Madhukar Jagtap ◽  
Gomathi N.

In the past years, wireless sensor networks (WSNs) have increased successful real-world deployment in a wide range of civil and military applications. In order to ensure effective environmental sensing and robust communication, the two fundamental issues like TCOV and NCON are the very challenging tasks in WSN. As sensor nodes are battery-operated devices, the wide utilization of WSNs is obstructed by the severely limited energy constraints, this article tackles these kinds of issues by proposing an approach based on the energy model and aims at enhancing the network lifetime by improved balancing the movement and energy losses in the network. This article proposes a design which minimizes the power consumption and movement cost, thus enhancing the network lifetime. Finally, the authors compared the energy efficiency of the proposed approach with that of the existing approach. As such, the proposed AVABC improves the network lifetime by 14.29%, 26.09%, and 14.29% over VABC in response to the varying sensing radius of 5, 10, and 15, respectively.

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Asmaa Ez-Zaidi ◽  
Said Rakrak

Wireless sensor networks have been the subject of intense research in recent years. Sensor nodes are used in wide range of applications such as security, military, and environmental monitoring. One of the most interesting applications in wireless sensor networks is target tracking, which mainly consists in detecting and monitoring the motion of mobile targets. In this paper, we present a comprehensive survey of target tracking approaches. We then analyze them according to several metrics. We also discuss some of the challenges that influence the performance of tracking schemes. In the end, we conduct detailed analysis and comparison between these algorithms and we conclude with some future directions.


Author(s):  
Asfandyar Khan ◽  
Azween Abdullah ◽  
Nurul Hasan

Wireless sensor networks (WSANs) are increasingly being used and deployed to monitor the surrounding physical environments and detect events of interest. In wireless sensor networks, energy is one of the primary issues and requires the conservation of energy of the sensor nodes, so that network lifetime can be maximized. It is not recommended as a way to transmit or store all data of the sensor nodes for analysis to the end user. The purpose of this “Event Based Detection” Model is to simulate the results in terms of energy savings during field activities like a fire detection system in a remote area or habitat monitoring, and it is also used in security concerned issues. The model is designed to detect events (when occurring) of significant changes and save the data for further processing and transmission. In this way, the amount of transmitted data is reduced, and the network lifetime is increased. The main goal of this model is to meet the needs of critical condition monitoring applications and increase the network lifetime by saving more energy. This is useful where the size of the network increases. Matlab software is used for simulation.


Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Mohammad Baniata ◽  
Jiman Hong

The recent advances in sensing and communication technologies such as wireless sensor networks (WSN) have enabled low-priced distributed monitoring systems that are the foundation of smart cities. These advances are also helping to monitor smart cities and making our living environments workable. However, sensor nodes are constrained in energy supply if they have no constant power supply. Moreover, communication links can be easily failed because of unequal node energy depletion. The energy constraints and link failures affect the performance and quality of the sensor network. Therefore, designing a routing protocol that minimizes energy consumption and maximizes the network lifetime should be considered in the design of the routing protocol for WSN. In this paper, we propose an Energy-Efficient Unequal Chain Length Clustering (EEUCLC) protocol which has a suboptimal multihop routing algorithm to reduce the burden on the cluster head and a probability-based cluster head selection algorithm to prolong the network lifetime. Simulation results show that the EEUCLC mechanism enhanced the energy balance and prolonged the network lifetime compared to other related protocols.


2013 ◽  
Vol 706-708 ◽  
pp. 635-638
Author(s):  
Yong Lv

Wireless Sensor Networks consisting of nodes with limited power are deployed to collect and distribute useful information from the field to the other sensor nodes. Energy consumption is a key issue in the sensor’s communications since many use battery power, which is limited. In this paper, we describe a novel energy efficient routing approach which combines swarm intelligence, especially the ant colony based meta-heuristic, with a novel variation of reinforcement learning for sensor networks (ARNet). The main goal of our study was to maintain network lifetime at a maximum, while discovering the shortest paths from the source nodes to the sink node using an improved swarm intelligence. ARNet balances the energy consumption of nodes in the network and extends the network lifetime. Simulation results show that compared with the traditional EEABR algorithm can obviously improve adaptability and reduce the average energy consumption effectively.


2020 ◽  
Vol 10 (21) ◽  
pp. 7886
Author(s):  
Atefeh Rahiminasab ◽  
Peyman Tirandazi ◽  
M. J. Ebadi ◽  
Ali Ahmadian ◽  
Mehdi Salimi

Wireless sensor networks (WSNs) include several sensor nodes that have limited capabilities. The most critical restriction in WSNs is energy resources. Moreover, since each sensor node’s energy resources cannot be recharged or replaced, it is inevitable to propose various methods for managing the energy resources. Furthermore, this procedure increases the network lifetime. In wireless sensor networks, the cluster head has a significant impact on system global scalability, energy efficiency, and lifetime. Furthermore, the cluster head is most important in combining, aggregating, and transferring data that are received from other cluster nodes. One of the substantial challenges in a cluster-based network is to choose a suitable cluster head. In this paper, to select an appropriate cluster head, we first model this problem by using multi-factor decision-making according to the four factors, including energy, mobility, distance to centre, and the length of data queues. Then, we use the Cluster Splitting Process (CSP) algorithm and the Analytical Hierarchy Process (AHP) method in order to provide a new method to solve this problem. These four factors are examined in our proposed approach, and our method is compared with the Base station Controlled Dynamic Clustering Protocol (BCDCP) algorithm. The simulation results show the proposed method in improving the network lifetime has better performance than the base station controlled dynamic clustering protocol algorithm. In our proposed method, the energy reduction is almost 5% more than the BCDCP method, and the packet loss rate in our proposed method is almost 25% lower than in the BCDCP method.


2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668968 ◽  
Author(s):  
Sunyong Kim ◽  
Chiwoo Cho ◽  
Kyung-Joon Park ◽  
Hyuk Lim

In wireless sensor networks powered by battery-limited energy harvesting, sensor nodes that have relatively more energy can help other sensor nodes reduce their energy consumption by compressing the sensing data packets in order to consequently extend the network lifetime. In this article, we consider a data compression technique that can shorten the data packet itself to reduce the energies consumed for packet transmission and reception and to eventually increase the entire network lifetime. First, we present an energy consumption model, in which the energy consumption at each sensor node is derived. We then propose a data compression algorithm that determines the compression level at each sensor node to decrease the total energy consumption depending on the average energy level of neighboring sensor nodes while maximizing the lifetime of multihop wireless sensor networks with energy harvesting. Numerical simulations show that the proposed algorithm achieves a reduced average energy consumption while extending the entire network lifetime.


Author(s):  
Ghassan Samara ◽  
Mohammad Hassan ◽  
Yahya Zayed

Wireless sensor networks (WSNs) has a practical ability to link a set of sensors to build a wireless network that can be accessed remotely; this technology has become increasingly popular in recent years. Wi-Fi-enabled sensor networks (WSNs) are used to gather information from the environment in which the network operates. Many obstacles prevent wireless sensor networks from being used in a wide range of fields. This includes maintaining network stability and extending network life. In a wireless network, sensors are the most essential component. Sensors are powered by a battery that has a finite amount of power. The battery is prone to power loss, and the sensor is therefore rendered inoperative as a result. In addition, the growing number of sensor nodes off-site affects the network's stability. The transmission and reception of information between the sensors and the base consumes the most energy in the sensor. An Intelligent Vice Cluster Head Selection Protocol is proposed in this study (IVC LEACH). In order to achieve the best performance with the least amount of energy consumption, the proposed hierarchical protocol relies on a fuzzy logic algorithm using four parameters to calculate the value of each node in the network and divides them into three hierarchical levels based on their value. This improves network efficiency and reliability while extending network life by 50 percent more than the original Low Energy Adaptive Clustering Hierarchy protocol. Keywords: Wireless Sensor Networks, Sensors, Communication Protocol, Fuzzy logic, Leach protocol.


The network delay and power consumptions are the two main factors governing the efficiency of wireless sensor networks. In this paper, our goal is to minimize the delay and maximize the lifespan of event-based wireless sensor networks in which activities occur infrequently.In such architectures, most of the power is fed on when the radios are on, ready for a packet to arrive.Sleep–wake scheduling is a highly efficient mechanism to prolong the lifetime of these power-constrained wireless sensor networks. However, sleep–wake scheduling could provide result with considerable delays. This research attempts to limit these delays by developing “anycast” based packet forwarding schemes that places each node opportunistically forwards a packet to the first neighboring node which wakes up amongst more than one candidate nodes.In this paper, we propose to optimize the anycast forwarding schemes by minimizing the anticipated packetdelivery delays from the sensor nodes to the sink node. Based on this analysis, we then provide a solution to the joint control problem of how to optimally manage the architecture parameters of the sleep–wake scheduling protocol and the any-cast packetforwarding protocol to maximize the network lifetime, with reference to a constraint on the expected end-to-end packetarriving delay.


Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2251
Author(s):  
Amir Masoud Rahmani ◽  
Saqib Ali ◽  
Mohammad Sadegh Yousefpoor ◽  
Efat Yousefpoor ◽  
Rizwan Ali Naqvi ◽  
...  

Coverage is a fundamental issue in wireless sensor networks (WSNs). It plays a important role in network efficiency and performance. When sensor nodes are randomly scattered in the network environment, an ON/OFF scheduling mechanism can be designed for these nodes to ensure network coverage and increase the network lifetime. In this paper, we propose an appropriate and optimal area coverage method. The proposed area coverage scheme includes four phases: (1) Calculating the overlap between the sensing ranges of sensor nodes in the network. In this phase, we present a novel, distributed, and efficient method based on the digital matrix so that each sensor node can estimate the overlap between its sensing range and other neighboring nodes. (2) Designing a fuzzy scheduling mechanism. In this phase, an ON/OFF scheduling mechanism is designed using fuzzy logic. In this fuzzy system, if a sensor node has a high energy level, a low distance to the base station, and a low overlap between its sensing range and other neighboring nodes, then this node will be in the ON state for more time. (3) Predicting the node replacement time. In this phase, we seek to provide a suitable method to estimate the death time of sensor nodes and prevent possible holes in the network, and thus the data transmission process is not disturbed. (4) Reconstructing and covering the holes created in the network. In this phase, the goal is to find the best replacement strategy of mobile nodes to maximize the coverage rate and minimize the number of mobile sensor nodes used for covering the hole. For this purpose, we apply the shuffled frog-leaping algorithm (SFLA) and propose an appropriate multi-objective fitness function. To evaluate the performance of the proposed scheme, we simulate it using NS2 simulator and compare our scheme with three methods, including CCM-RL, CCA, and PCLA. The simulation results show that our proposed scheme outperformed the other methods in terms of the average number of active sensor nodes, coverage rate, energy consumption, and network lifetime.


Sign in / Sign up

Export Citation Format

Share Document