Wireless sensor networks routing algorithm based on particle swarm optimisation Online publication date: Wed, 05-Sep-2018
by Junhan Yang
International Journal of Internet Protocol Technology (IJIPT), Vol. 11, No. 3, 2018
Abstract: Routing policy is a key problem in wireless sensor network (WSN), and it aims to find an optimal path to transmit the data of source nodes to the destination nodes. Wireless sensor networks can represented as a graph model, where graph nodes refers the wireless sensors, and graph edges are used to connects various sensors. Furthermore, in this work, we suppose that wireless sensor networks contain three types of nodes, including base station, gateway, and sensor. In the proposed algorithm, each particle is exploited to provide a suitable route from each cluster head to the base station, and the dimension of each particle is equal to the number of gateways in WSN. In the end, experimental results demonstrate that the proposed algorithm is able to effectively prolong network lifetime and increase the number of packets received by base station. Furthermore, the conclusion can be drawn that the proposed method can effectively solve the WSN's routing problem, because particle swarm optimisation is able to effectively optimise WSN routing scheme.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Protocol Technology (IJIPT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook