Abstract:
In multiple level hierarchical Wireless Sensor Network, evolutionary algorithms have been applied to find the shortest possible distance from a transmitting head (cluster, intermediate or advanced) to the base station. From evidence and observation, it has been noted that in this methodology sometimes the node responsible for transmitting to the base station would exhaust its total energy and become inactive. To avoid this scenario and make sure that the cluster heads are alive for a considerable amount of time until all or majority of the sensor nodes in the network have died. The following paper describes and implements a methodology by introducing the evolutionary algorithm ACO into the TEEN protocol. The algorithm finds the shortest but at the same time, the most optimal path to the base station from a cluster head such that the total energy loss in transmission is the least in all of the paths found by the ACO. The results have been slightly better than TEEN and corresponding multi0heirarchical heterogeneous implementations such as EAMMH, mod -LEACH, and LEACH.
Page(s):
387-392
DOI:
DOI not available
Published:
Journal: Sindh University Research Journal, Volume: 49, Issue: 2, Year: 2017