10-04-2017, 07:55 PM
pegasis algorithm source code in ns2
The nodes of wireless sensor networks, with limited computing, communicating and sensing capabilities as well as limited energy, can make the best use themselves to gather data from sensor nodes to Base Station (BS) by using excellent network topologies, optimized routing schemes or data fusion algorithms in order gain the lifetime as long as possible
In the simplest direct communication routing protocol, each sensor node directly communicates with base station. Since the distance is large, it consumes the energy quickly in most cases.
In LEACH, it considers the energy dissipation of the receivers and concludes that multi-hop is energy efficient only in certain network topology and radio parameters of the system. The main idea of LEACH is to consider the local data fusion in each cluster to reduce the amount of redundant data that must be transmitted to BS. Each cluster head, instead of each sensor node, direclty sends fusion data to BS, thus it extends the lifetime of major nodes
PEGASIS and BCDCP improve LEACH by having only one cluster head leader node forward the data to BS.
PEGASIS build a chain using a greedy algorithm to route the data to the leader of all nodes. But increasing neighbor distances will have a significant effect on PEGASIS performance when the area sensor field is increased.
BCDCP creates a minimum spanning tree by BS to build the routing path and gains mode energy