Volume 4, Issue 3, November 2013, Pages 477–482
Ouadoudi Zytoune1 and Driss Aboutajdine2
1 LaRIT Lab, Ibn Tofail University, Kenitra, Morocco
2 Faculty of Sciences, Mohamed V University, Rabat, Morocco
Original language: English
Copyright © 2013 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Wireless Sensor Network (WSN) is a collection of large number of tiny sensor nodes that are deployed to monitor the physical environment such temperature, humidity, etc. The sensor readings must be routed to the base station and then to the end-user. These sensor nodes have limited capabilities, especially the energy reserve, the processing ability and the memory storage. So, the routing protocols design for this kind of networks is a crucial challenge. Since these routing protocols should be simple, energy-efficient, and robust to operate with a very large number of nodes. They should also be auto-configurable to node failures and changes of the network topology dynamically. This paper presents a new algorithm for gathering data in WSN based on chain forming using greedy algorithm. It focuses on equitably distributing the energy load over the whole network nodes. To avoid fast node dying, the leader role is better distributed over nodes based on their required energies to transmit to the sink. Thus, the entire network nodes would have the same lifetime and then as result, the network lifetime would be extended. We have conducted simulation-based evaluations to illustrate the performance of the proposed technique. The simulation results show that this algorithm allows network stability extension compared to the most known chaining algorithm.
Author Keywords: Wireless Sensor Networks, Data Gathering, PEGASIS, Greedy algorithm, Network lifetime.
Ouadoudi Zytoune1 and Driss Aboutajdine2
1 LaRIT Lab, Ibn Tofail University, Kenitra, Morocco
2 Faculty of Sciences, Mohamed V University, Rabat, Morocco
Original language: English
Copyright © 2013 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
Wireless Sensor Network (WSN) is a collection of large number of tiny sensor nodes that are deployed to monitor the physical environment such temperature, humidity, etc. The sensor readings must be routed to the base station and then to the end-user. These sensor nodes have limited capabilities, especially the energy reserve, the processing ability and the memory storage. So, the routing protocols design for this kind of networks is a crucial challenge. Since these routing protocols should be simple, energy-efficient, and robust to operate with a very large number of nodes. They should also be auto-configurable to node failures and changes of the network topology dynamically. This paper presents a new algorithm for gathering data in WSN based on chain forming using greedy algorithm. It focuses on equitably distributing the energy load over the whole network nodes. To avoid fast node dying, the leader role is better distributed over nodes based on their required energies to transmit to the sink. Thus, the entire network nodes would have the same lifetime and then as result, the network lifetime would be extended. We have conducted simulation-based evaluations to illustrate the performance of the proposed technique. The simulation results show that this algorithm allows network stability extension compared to the most known chaining algorithm.
Author Keywords: Wireless Sensor Networks, Data Gathering, PEGASIS, Greedy algorithm, Network lifetime.
How to Cite this Article
Ouadoudi Zytoune and Driss Aboutajdine, “A Lifetime Extension Protocol for Data Gathering in Wireless Sensor Networks,” International Journal of Innovation and Applied Studies, vol. 4, no. 3, pp. 477–482, November 2013.
