scholarly journals An Energy Efficient Simultaneous-Node Repositioning Algorithm for Mobile Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Muhammad Amir Khan ◽  
Halabi Hasbullah ◽  
Babar Nazir ◽  
Imran Ali Khan
Keyword(s):  
Energy Efficient ◽  
Mobile Sensor Networks ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Network Nodes ◽  
Connectivity Restoration ◽  
Communication Problems ◽  
Area Of Interest ◽  
Simulation Results ◽  
Failed Node

Recently, wireless sensor network (WSN) applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results.

scholarly journals PACR: Position-Aware Protocol for Connectivity Restoration in Mobile Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Rab Nawaz Jadoon ◽  
Adnan Anwar Awan ◽  
Muhammad Amir Khan ◽  
WuYang Zhou ◽  
Aqdas Naveed Malik
Keyword(s):  
Sensor Networks ◽  
Data Transmission ◽  
Recovery Process ◽  
Mobile Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Connectivity Restoration ◽  
Communication Links ◽  
Exact Position ◽  
Failed Node

Wireless Sensor Networks (WSNs) have gained global attention in recent times due to their vast applications in various fields. These networks can face the disruption of data transmission due to sensor node failures when placed in harsh, inaccessible, and adverse environments such as battlefields or monitoring in enemy territory. The specific tasks performed by the collaboration among the sensor nodes in WSNs by internode connectivity may be terminated. Besides this, due to the failure of sensor nodes, the area covered by the network may be limited, which can cause damage to the objectives for such a network, as there might be an unaware danger in the lost area. Connectivity is a big problem in mobile WSNs due to the mobility of nodes. Researchers have developed a lot of algorithms that are capable enough for connectivity problems, but they do not emphasize the loss of coverage. We try to fill these gaps by proposing the new hybrid algorithm PACR (Position-Aware protocol for Connectivity Restoration). The concept behind PACR is the same as a person who writes his will before death on a deathbed. In the same way, when the sensor energy is below the threshold, it is converted into a recovery coordinator and generates a recovery plan. This accelerates the recovery by decreasing the time needed for failure identification. For the recovery process, the neighbor’s nodes do not travel to the exact position of the failed node. Instead, they just move to the distance where they can build communication links with other nodes. This greatly prolongs the network lifetime. The simulation results show that PACR outperforms other techniques present in the literature.

scholarly journals Energy Efficient Trust Node Based Routing Protocol (EETRP) to Maximize the Lifetime of Wireless Sensor Networks in Plateaus

2019 ◽  
Vol 15 (06) ◽  
pp. 113 ◽  
Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Energy Limitation

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

scholarly journals Detection and Countermeasure of Node Misbehaviour in Clustered Wireless Sensor Network

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Meenakshi Tripathi ◽  
M. S. Gaur ◽  
V. Laxmi ◽  
P. Sharma
Keyword(s):  
Energy Efficient ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Environment Monitoring ◽  
Detection Scheme ◽  
Data Packets ◽  
Battery Power ◽  
Processing Power ◽  
Simulation Results

Wireless sensor networks are widely used in many applications like battlefield monitoring, environment monitoring, and so forth. In all of these applications the cooperation among various sensor nodes is needed to forward the data packets to the base station. However, it expends the various resources of a sensor node such as battery power, storage, and processing power. Therefore, to conserve its own resources a node may become selfish by not forwarding the data to the others. This kind of attack has serious consequences if the attacker node is the leader of a cluster. In the presence of attack the base station will not be able to get the data from the victimized cluster while resources of the member of that cluster are being consumed. In this paper we propose a scheme called window based scheme (WBS) to detect this kind of misbehavior in WSN. Our detection scheme is energy efficient because most of the computations are done at base station only. Simulation results prove that our method detects and removes the attacker effectively and efficiently.

scholarly journals TAPU: Test and pick up-based k-connectivity restoration algorithm for wireless sensor networks

2019 ◽  
pp. 985-997 ◽  
Author(s):  
VAHİD KHALİLPOUR AKRAM ◽  
ORHAN DAĞDEVİREN
Keyword(s):  
Lower Cost ◽  
Greedy Algorithms ◽  
Wireless Sensor ◽  
Previous Approach ◽  
K Value ◽  
Shortest Path Tree ◽  
Connectivity Restoration ◽  
Restoration Algorithm ◽  
Optimal Movement ◽  
Failed Node

A k-connected wireless sensor network remains connected if any k-1 arbitrary nodes stop working. The aim of movement-assisted k -connectivity restoration is to preserve the k -connectivity of a network by moving the nodes to the necessary positions after possible failures in nodes. This paper proposes an algorithm named TAPU for k-connectivity restoration that guarantees the optimal movement cost. Our algorithm improves the time and space complexities of the previous approach (MCCR) in both best and worst cases. In the proposed algorithm, the nodes are classified into safe and unsafe groups. Failures of safe nodes do not change the k value of the network while failures of unsafe nodes reduce the k value. After an unsafe node’s failure, the shortest path tree of the failed node is generated. Each node moves to its parent location in the tree starting from a safe node with the minimum moving cost to the root. TAPU has been implemented on simulation and testbed environments including Kobuki robots and Iris nodes. The measurements show that TAPU finds the optimum movement up to 79.5% faster with 50% lower memory usage than MCCR and with up to 59% lower cost than the greedy algorithms.

Improving Area Coverage With Mobile Nodes in Wireless Sensor Networks

2021 ◽  
Vol 13 (1) ◽  
pp. 36-48
Author(s):  
Dhruvi Patel ◽  
Arunita Jaekel
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Mobile Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Area Of Interest ◽  
Adequate Coverage ◽  
Considerable Work

Wireless sensor networks (WSN) consist of sensor nodes that detect relevant events in their vicinity and relay this information for further analysis. Considerable work has been done in the area of sensor node placement to ensure adequate coverage of the area of interest. However, in many applications it may not be possible to accurately place individual sensor nodes. In such cases, imprecise placement can result in regions, referred to as coverage holes, that are not monitored by any sensor node. The use of mobile nodes that can ‘visit' such uncovered regions after deployment has been proposed in the literature as an effective way to maintain adequate coverage. In this paper, the authors propose a novel integer linear programming (ILP) formulation that determines the paths the mobile node(s) should take to realize the specified level of coverage in the shortest time. The authors also present a heuristic algorithm that can be used for larger networks.

Energy Balance Routing Algorithm Based on Energy Heterogeneous WSN

2014 ◽  
Vol 687-691 ◽  
pp. 3976-3979 ◽  
Author(s):  
Ming Xin Liu ◽  
Xiao Meng Wang
Keyword(s):  
Energy Balance ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Energy Balancing ◽  
Network Nodes ◽  
Cluster Head Election ◽  
Balancing Energy ◽  
Simulation Results

Balancing energy load is a key problem in wireless sensor network (WSN) research. For balancing node energy consumption and prolong the network lifetime, this paper proposes an improved routing algorithm EBRA (Energy Balancing Routing Algorithm) based on energy heterogeneous WSN. To maximize the energy efficiency of network nodes, the EBRA weights the probability of cluster head election. According to the estimate value of the network average remaining energy and the residual energy of network nodes, we can calculate the new cluster head election threshold. The simulation results show that the utilization of energy balance of EBRA algorithm is improved 74%, 30% and 23%, compare with LEACH, SEP and DCHS, respectively.

Certain Investigation on Secured Data Transmission in Wireless Sensor Networks

2020 ◽  
pp. 1372-1385
Author(s):  
P. Padmaja ◽  
G.V. Marutheswar
Keyword(s):  
Data Aggregation ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Trust Value ◽  
Security Issues ◽  
Deviation Factor ◽  
Simulation Results ◽  
Secured Data

Wireless Sensor Network (WSN) need to be more secure while transmitting data as well as should be deployed properly to reduce redundancy and energy consumption. WSNs suffer from many constraints, including low computation capability, small memory, limited energy resources, susceptibility to physical capture and the use of insecure wireless communication channels. These constraints make security in WSNs a challenge. In this paper, a survey of security issues in WSNs is presented and a new algorithm TESDA is proposed, which is an optimized energy efficient secured data aggregation technic. The cluster head is rotated based on residual energy after each round of aggregation so that network lifetime increases. Based on deviation factor calculated, the trust weight is assigned, if more deviation, then the trust value is less. Simulation results observed by using NS-2. From network animator and x-graphs the result are analyzed. Among all protocols tesda is an energy efficient secured data aggregation method.

An Energy-Efficient Routing Mechanism (EERM) for Wireless Sensor and Actor Networks

2021 ◽  
Author(s):  
Muhammad Kashif Saeed ◽  
Khalid Mahmood ◽  
Mahmood Ul Hassan ◽  
Ansar Munir Shah ◽  
Jahangir Khan ◽  
...  
Keyword(s):  
Energy Efficient ◽  
Data Gathering ◽  
Research Area ◽  
Efficient Solutions ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Area Of Interest ◽  
Routing Mechanism ◽  
Actor Networks

Abstract Wireless Sensor and actor networks (WSANs) are the most vital research area in the wireless communication field. It consists of sensors, actors, and the base station, where actor nodes work as these networks' spine. The network's main objective is to sense the critical information from the area of interest and then send it to the base station. After that, it can make accurate decisions. This project proposes an Energy-Efficient Routing Mechanism (EERM) technique for the effective routing process. It works in three phases, which are Network initialization, data gathering, and routing. Once the node senses the data and tries to forward it to the base station, it chooses the sensor/ actor nodes from its neighbors having more energy and less distance towards the base station, a final node. As a result, there are significantly fewer chances of data loss due to battery depletion. Moreover, it confirms that there is no data duplication. After successful data transmission, the node will be set as in sleeping mode to save energy. EERM evaluates with other gossiping routing techniques like FELGossiping, ELGossiping, and LGossiping. It notices that there is less data packet loss in it. More nodes are alive in additional iterations due to energy-efficient solutions, which increases the network lifetime.

scholarly journals Performance Evaluation of Zone-Based Routing with Hierarchical Routing in Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-10
Author(s):  
Rab Nawaz Jadoon ◽  
WuYang Zhou ◽  
Iftikhar Ahmed Khan ◽  
Muhammad Amir Khan ◽  
Shahbaz Akhtar Abid ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
Hierarchical Routing ◽  
Battery Power ◽  
Simulation Based ◽  
Simulation Results ◽  
Static Clustering

Routing remains a most challenging task in sensor networks because of constrained resources like battery power, processing, and memory. Many energy efficiency techniques for the sensor networks have been proposed, among which hierarchical routing is considered the most energy-efficient and extended network lifetime technique. This technique has a lesser number of transmissions in the network. On the contrary, zone-based routing claims lesser control and routing overhead on the overall network lifetime. In this research, a simulation-based comparison of zone-based routing with static clustering hierarchical routing is conducted. The simulation results show that the zone-based routing outperforms hierarchical routing with static clustering in terms of energy efficiency, network lifetime, and throughput.

Sign in / Sign up

Export Citation Format

Share Document