Flower Pollination Algorithm with Powell’s Method for the Minimum Energy Broadcast Problem in Wireless Sensor Network

Abstract Sensors are important device to collect the information for many applications. The present era is using internet of things (IOT) which is basically working on sensors. The inputs or status of the system is monitored using the sensors embedded in the system under consideration. The sensors need to be small in size, has to consume less power, more reliable and consistence. Wireless sensor network (WSN) is a collection of sensors which works together to do a particular task. This cluster of sensors are called nodes and has its own power and ability to communicate to other nodes in the cluster. The location of sensors in the cluster is required to be identified for proper data analysis. When the data is received from the sensor the location is also mapped with it then only proper action can be taken based on signal and location. In WSN few sensor locations are known which are called anchors, from these anchors, the location of unknown sensors are estimated. In this paper, intelligent algorithms firefly and flower pollination algorithm (FPA) are used to find the location of the sensors. The performance of the algorithms is compared with their accuracy to find the location and convergence speed.

Download Full-text

Flower pollination algorithm based localization of wireless sensor network

2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS) ◽

10.1109/raecs.2015.7453299 ◽

2015 ◽

Cited By ~ 14

Author(s):

Sonia Goyal ◽

Manjeet Singh Patterh

Keyword(s):

Wireless Sensor Network ◽

Sensor Network ◽

Wireless Sensor ◽

Flower Pollination Algorithm ◽

Flower Pollination

Download Full-text

Minimizing the Energy Consumption of Wireless Sensor Network by Comparing the Performances of Maxweight and Minimum Energy Scheduling Algorithms

International Journal of communication and computer Technologies ◽

10.31838/ijccts/03.01.03 ◽

2019 ◽

Vol 3 (1) ◽

Keyword(s):

Energy Consumption ◽

Wireless Sensor Network ◽

Sensor Network ◽

Minimum Energy ◽

Scheduling Algorithms ◽

Wireless Sensor

Download Full-text

Towards Void Hole Alleviation by Exploiting the Energy Efficient Path and by Providing the Interference-Free Proactive Routing Protocols in IoT Enabled Underwater WSNs

Sensors ◽

10.3390/s19061313 ◽

2019 ◽

Vol 19 (6) ◽

pp. 1313 ◽

Cited By ~ 6

Author(s):

Muhammad Awais ◽

Nadeem Javaid ◽

Amjad Rehman ◽

Umar Qasim ◽

Musaed Alhussein ◽

...

Keyword(s):

Wireless Sensor Network ◽

Sensor Network ◽

Routing Protocols ◽

Energy Efficient ◽

Minimum Energy ◽

Wireless Sensor ◽

Delivery Ratio ◽

Minimum Energy Consumption ◽

Proactive Routing ◽

Delay Increase

Nowadays, the Internet of Things enabled Underwater Wireless Sensor Network (IoT-UWSN) is suffering from serious performance restrictions, i.e., high End to End (E2E) delay, low energy efficiency, low data reliability, etc. The necessity of efficient, reliable, collision and interference-free communication has become a challenging task for the researchers. However, the minimum Energy Consumption (EC) and low E2E delay increase the performance of the IoT-UWSN. Therefore, in the current work, two proactive routing protocols are presented, namely: Bellman–Ford Shortest Path-based Routing (BF-SPR-Three) and Energy-efficient Path-based Void hole and Interference-free Routing (EP-VIR-Three). Then we formalized the aforementioned problems to accomplish the reliable data transmission in Underwater Wireless Sensor Network (UWSN). The main objectives of this paper include minimum EC, interference-free transmission, void hole avoidance and high Packet Delivery Ratio (PDR). Furthermore, the algorithms for the proposed routing protocols are presented. Feasible regions using linear programming are also computed for optimal EC and to enhance the network lifespan. Comparative analysis is also performed with state-of-the-art proactive routing protocols. In the end, extensive simulations have been performed to authenticate the performance of the proposed routing protocols. Results and discussion disclose that the proposed routing protocols outperformed the counterparts significantly.

Download Full-text