A NEW ENERGY-EFFICIENT NEIGHBOR DISCOVERY AND LOAD BALANCING PROTOCOL FOR MOBILE SENSOR NETWORKS

2014 ◽  
Vol 23 (07) ◽  
pp. 1450100 ◽  
Author(s):  
RIDHA OUNI ◽  
ABDULLAH AL-DHELAAN ◽  
RAFIK LOUATI
Keyword(s):  
Sensor Networks ◽  
Load Distribution ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Neighbor Discovery ◽  
New Energy ◽  
Working Together ◽  
Save Energy ◽  
Specific Duty ◽  
Important Design

The wireless sensor networks (WSNs) are formed by a large number of sensor nodes working together to provide a specific duty. However, the low energy capacity assigned to each node prompts users to look at an important design challenge which is lifetime maximization. Especially the availability of nodes, the sensor coverage, and the connectivity have been included in discussions on network lifetime. Therefore, designing effective techniques that conserve scarce energy resources is a critical issue in WSNs. In this regard, we are interested in developing various mechanisms to save energy based on the constraints involved for energy consumption in WSNs. Three mechanisms are proposed to reduce the number of control packets responsible for path discovery, optimize diffusion area, and balance the load distribution in the network.

Security based on Received Signal Strength in Localization for Underwater Sensor Networks

2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon
Keyword(s):  
Sensor Networks ◽  
Threshold Value ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Research Subjects ◽  
Malicious Nodes ◽  
Intermediate Node ◽  
End To End Delay ◽  
End To End

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.

A Self-Adaptive Listen-Time Sleeping Algorithm Based on the Number of Neighbor Nodes for Wireless Mesh Sensor Networks

2012 ◽  
Vol 433-440 ◽  
pp. 5123-5128
Author(s):  
Jun Feng Hao ◽  
Jing Fan ◽  
Wen Yu Shi
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Heavy Traffic ◽  
Power Saving ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Mesh ◽  
End To End Delay ◽  
Low Traffic

Power saving is a very critical issue in wireless sensor network. Many schemes for power saving can be found in the literature, but these schemes barely consider different topology of nodes. In this paper, based on S-MAC algorithm, NALS-MAC algorithm is designed and combined with the characters of application background of wireless mesh sensor networks. According to the number of neighbor nodes, sensor nodes self-adaptively generate the listen-time during a period respectively. The node with more neighbors will have longer listen-time, because more neighbors means higher probability of heavy traffic. The nodes need longer time to deal with information than nodes with low traffic. The results show that the sensor nodes adjusting the listen-time self-adaptively in proper way achieves the reduction of end-to-end delay and enhance throughout.

scholarly journals Efficient Node and Sensed Module Management for Multisensory Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (7) ◽  
pp. 2328 ◽  
Author(s):  
Juan Feng ◽  
Xiaozhu Shi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Management Strategies ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Tracking Accuracy ◽  
Node Selection ◽  
Information Utility ◽  
Save Energy ◽  
Selection Of

In target tracking wireless sensor networks, choosing a part of sensor nodes to execute tracking tasks and letting the other nodes sleep to save energy are efficient node management strategies. However, at present more and more sensor nodes carry many different types of sensed modules, and the existing researches on node selection are mainly focused on sensor nodes with a single sensed module. Few works involved the management and selection of the sensed modules for sensor nodes which have several multi-mode sensed modules. This work proposes an efficient node and sensed module management strategy, called ENSMM, for multisensory WSNs (wireless sensor networks). ENSMM considers not only node selection, but also the selection of the sensed modules for each node, and then the power management of sensor nodes is performed according to the selection results. Moreover, a joint weighted information utility measurement is proposed to estimate the information utility of the multiple sensed modules in the different nodes. Through extensive and realistic experiments, the results show that, ENSMM outperforms the state-of-the-art approaches by decreasing the energy consumption and prolonging the network lifetime. Meanwhile, it reduces the computational complexity with guaranteeing the tracking accuracy.

scholarly journals An Improved Flooding Routing Protocol for Wireless Sensor Networks Based on Network-Coding

2018 ◽  
Vol 17 ◽  
pp. 02001
Author(s):  
Churan Tang ◽  
Linghua Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Coding ◽  
Routing Protocol ◽  
Network Reliability ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Bandwidth Utilization ◽  
Network Utilization ◽  
Save Energy

A central question in wireless sensor network research is how to reduce the consumption of the energy of the sensor nodes. Theoretically, the network coding technology proposed by Ahlswede et al (2000) can improve the network reliability and network throughput, increase the robustness and save energy. Based on the classic flooding routing protocol, the present study proposes a new flooding control protocol, i.e. NC-Flooding for wireless sensor networks. NC-Flooding protocol introduces five mechanisms to enhance the efficiency of wireless sensor networks. As shown by MATLAB simulation results, NC-Flooding protocol reduces the number of broadcasts of wireless sensor networks, increases the throughput of the network and increases the bandwidth utilization. We conclude that NC-Flooding protocol reduces data forwarding cost and node energy consumption and extends nodes’ life cycle, thus increasing network utilization.

An Efficient Sleeping Scheduling for Save Energy Consumption in Wireless Sensor Networks

2013 ◽  
Vol 756-759 ◽  
pp. 2288-2293
Author(s):  
Shu Guang Jia ◽  
Li Peng Lu ◽  
Ling Dong Su ◽  
Gui Lan Xing ◽  
Ming Yue Zhai
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Smart Grid ◽  
Round Robin ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Active Sensors ◽  
Save Energy ◽  
Battery Energy

Smart grid has become one hot topic at home and abroad in recent years. Wireless Sensor Networks (WSNs) has applied to lots of fields of smart grid, such as monitoring and controlling. We should ensure that there are enough active sensors to satisfy the service request. But, the sensor nodes have limited battery energy, so, how to reduce energy consumption in WSNs is a key challenging. Based on this problem, we propose a sleeping scheduling model. In this model, firstly, the sensor nodes round robin is used to let as little as possible active nodes while all the targets in the power grid are monitored; Secondly, for removing the redundant active nodes, the sensor nodes round robin is further optimized. Simulation result indicates that this sleep mechanism can save the energy consumption of every sensor node.

scholarly journals LNDIR: A lightweight non-increasing delivery-latency interval-based routing for duty-cycled sensor networks

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771876760 ◽  
Author(s):  
Muhammad K Shahzad ◽  
Dang Tu Nguyen ◽  
Vyacheslav Zalyubovskiy ◽  
Hyunseung Choo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Performance Improvements ◽  
Novel Approach ◽  
Minimum Latency ◽  
Latency Interval

Wireless sensor networks are composed of low-energy, small-size, and low-range unattended sensor nodes. Recently, it has been observed that by periodically turning on and off the sensing and communication capabilities of sensor nodes, we can significantly reduce the active time and thus prolong network lifetime. However, this duty cycling may result in high network latency, routing overhead, and neighbor discovery delays due to asynchronous sleep and wake-up scheduling. These limitations call for a countermeasure for duty-cycled wireless sensor networks which should minimize routing information, routing traffic load, and energy consumption. In this article, we propose a lightweight non-increasing delivery-latency interval routing referred as LNDIR. This scheme can discover minimum latency routes at each non-increasing delivery-latency interval instead of each time slot. Simulation experiments demonstrated the validity of this novel approach in minimizing routing information stored at each sensor. Furthermore, this novel routing can also guarantee the minimum delivery latency from each source to the sink. Performance improvements of up to 12-fold and 11-fold are observed in terms of routing traffic load reduction and energy efficiency, respectively, as compared to existing schemes.

ENERGY-EFFICIENT NODE SCHEDULING MODELS IN SENSOR NETWORKS WITH ADJUSTABLE RANGES

2005 ◽  
Vol 16 (01) ◽  
pp. 3-17 ◽  
Author(s):  
JIE WU ◽  
SHUHUI YANG
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Life Time ◽  
High Ratio ◽  
Sensor Nodes ◽  
Sensing Range ◽  
Node Scheduling ◽  
New Energy ◽  
Scheduling Models

In this paper, we study the problem of maintaining sensing coverage by keeping a small number of active sensor nodes and using a small amount of energy consumption in wireless sensor networks. This paper extends a result from 22 where only uniform sensing range among all sensors is used. We adopt an approach that allows non-uniform sensing ranges for different sensors. As opposed to the uniform sensing range node scheduling model in 22, two new energy-efficient models with different sensing ranges are proposed. Our objective is to minimize the overlapped sensing area of sensor nodes, thus to reduce the overall energy consumption by sensing and communication to prolong the whole network's life time, and at the same time to achieve the high ratio of coverage. Extensive simulation is conducted to verify the effectiveness of our node scheduling models.

Data Gathering with Multi-Attribute Fusion in Wireless Sensor Networks

2011 ◽  
pp. 159-181 ◽  
Author(s):  
Kai Lin ◽  
Lei Wang ◽  
Lei Shu ◽  
Al-Sakib Khan Pathan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Conservation ◽  
Data Gathering ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Physical Attributes ◽  
And Performance ◽  
Save Energy ◽  
Conservation Efficiency

This chapter addresses the problem of data gathering with multi-attribute fusion over a bandwidth and energy constrained wireless sensor network (WSN). As there are strong correlations between data gathered from sensor nodes in close physical proximity, effective in-network fusion schemes involve minimizing such redundancy and hence reducing the load in wireless sensor networks. Considering a complicated environment, each sensor node must be equipped with more than one type of sensor module to monitor multi-targets; hence, the complexity for the fusion process is increased due to the existence of various physical attributes. In this chapter, by investigating the process and performance of multi-attribute fusion in data gathering of WSNs, we design a self-adaptive threshold to balance the different change rates of each attributive data. Furthermore, we present a method to measure the energy-conservation efficiency of multi-attribute fusion. Then, a novel energy equilibrium routing method is proposed to balance and save energy in WSNs, which is named multi-attribute fusion tree (MAFT). The establishment of MAFT is determined by the remaining energy of sensor nodes and the energy-conservation efficiency of data fusion. Finally, the energy saving performance of the scheme is demonstrated through comprehensive simulations. The chapter concludes by identifying some open research issues on this topic.

MAC Protocols for Wireless Sensor Networks

2010 ◽  
pp. 165-174 ◽  
Author(s):  
Torsten Braun ◽  
Markus Anwander ◽  
Philipp Hurni ◽  
Markus Wälchli
Keyword(s):  
Sensor Networks ◽  
Sensor Node ◽  
Mac Protocol ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Medium Access Control Protocols ◽  
Medium Access ◽  
Wireless Sensor Nodes ◽  
Measurement Results ◽  
Save Energy

The chapter describes related work on medium access control protocols for wireless sensor nodes. We focus on scheduled and contention-based protocols that have been proposed by the research community during the last few years. In particular, we evaluate the potential to save energy of several representative protocols, namely LMAC, TEEM, and WiseMAC. This has been done by measurements of implementations in real sensor networks. The measurement results show that by sophisticated MAC protocol design we can significantly improve the energy-efficiency and increase the lifetime of a sensor node. Real-world measurements are important to determine power consumption parameters of sensor nodes.

A Novel Energy-Efficient Clustering Protocol Using Two-Stage Genetic Algorithm for Improving the Lifetime of Wireless Sensor Networks

2020 ◽  
Vol 19 (03) ◽  
pp. 2050019
Author(s):  
Ali Mahani ◽  
Ebrahim Farahmand ◽  
Saeide Sheikhpour ◽  
Nooshin Taheri-Chatrudi
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Clustering Protocol ◽  
New Energy ◽  
Energy Efficient Clustering

Wireless sensor networks (WSNs) are beginning to be deployed at an accelerated pace, and they have attracted significant attention in a broad spectrum of applications. WSNs encompass a large number of sensor nodes enabling a base station (BS) to sense and transmit data over the area where WSN is spread. As most sensor nodes have a limited energy capacity and at the same time transmit critical information, enhancing the lifetime and the reliability of WSNs are essential factors in designing these networks. Among many approaches, clustering of sensor nodes has proved to be an effective method of reducing energy consumption and increasing lifetime of WSNs. In this paper, a new energy-efficient clustering protocol is implemented using a two-step Genetic Algorithm (GA). In the first step of GA, cluster heads (CHs) are selected, and in the second step, cluster members are chosen based on their distance to the selected CHs. Compared to other clustering protocols, the lifetime of WSNs in the proposed clustering is improved. This improvement is the consequence of the fact that this clustering considers energy efficient parameters in clustering protocol.

Sign in / Sign up

Export Citation Format

Share Document