X-graph with the Stimulation time and the Number of live

nodes present in the existing and the proposed method. In the existing method,
only using the AODV (adhoc on-demand vector routing) for the process of
communication because of this method and low energy efficiency the number of
live nodes present in the network is very low. We proposed the Ant colony
optimization algorithm for the proposed method to find the shortest path. By
processing the network in the shortest path the energy of the network is increased
highly and the live nodes present in the network is also increased.
In the existing method, at the time of 10min the number of live
nodes present in the network is 132. But in the proposed method within the same
transmission time the number of live node present in the network is 153.

83

X-graph with the Stimulation time and the Bandwidth usages present
in the existing and the proposed method. In the existing method, with the low
energy efficiency the packet delivery ratio and the packet receiving ratio are very
low. Bandwidth is the total number of packet sent and the received ratio. So, the
bandwidth is also comparatively low in the existing method. In the proposed
method by using the shortest path algorithm and the security algorithm the
bandwidth of the entire network is increased.

84

X-graph with the Stimulation time and the Total Number of control
packets present in the existing and the proposed method. In the existing method,
with the low energy efficiency the packet delivery ratio and the packet receiving
ratio are very low.
Bandwidth is the total number of packet sent and the received ratio.
Then the low security problem the control packet present in the network is very
low. In the proposed method by using the shortest path algorithm and the security
algorithm the bandwidth of the entire network is increased. Then the high security
problem the control packet present in the network is very high.

85

X-graph with the Stimulation time and the Total Number of Data
packet received present in the existing and the proposed method. In the existing
method, with the low energy efficiency the packet receiving ratio are very low. In
the proposed method by using the shortest path algorithm and the security
algorithm the packet receiving ratio of the entire network is increased. The clear
difference is shown in the X-graph.

86

X-graph with the Stimulation time and the Total Number of Data
packet sent present in the existing and the proposed method. . In the existing
method, with the low energy efficiency the packet sent ratio are very low. In the
proposed method by using the shortest path algorithm and the security algorithm
the packet sent ratio of the entire network is increased. The clear difference is
shown in the X-graph.

87

X-graph with the Stimulation time and the End to End Delay
present in the existing and the proposed method. . In the existing method, with the
low energy efficiency the End to End ratio is very low. In the proposed method by
using the shortest path algorithm and the security algorithm the End to End ratio of
the entire network is increased. The clear difference is shown in the X-graph.

88

X-graph with the Stimulation time and the Throughput present

in the existing and the proposed method. In the existing method, with the low
energy efficiency the Throughput is very low. In the proposed method by using the
shortest path algorithm and the security algorithm the Throughput ratio of the
entire network is increased. The clear difference is shown in the X-graph.

89

CHAPTER 8
CONCLUSION
The protocol is achieved by using ACO algorithm to optimize routing paths,
providing an effective multi-path with single sink and clustering concept for data
transmission to obtain reliable communications in the case of node faults. We
aimed to maintain network life time in maximum, while data transmission is
achieved efficiently. Our study was concluded to evaluate the performance of ant
based algorithm and AODV routing protocol in terms of Packet Delivery Ratio and
Normalized Routing Load. From the comparison it is concluded that overall
performance of ant based algorithm is better than AODV
FUTURE WORK
Our proposed algorithm can control the overhead generated by ants and
improved packet delivery ratio. The future work could be to investigate different
methods to further limit the traffic or load and compare the ant based algorithm for
other proactive and reactive routing protocols.

90

CHAPTER 9
REFERENCE
[1] Ahmed A Ahmed, Hongchi Shi, and Yi Shang. A survey on network protocols
for wireless sensor networks. In Information Technology: Research and Education,
2013. Proceedings. ITRE2003. International Conference on, pages 301305. IEEE,
2013.

[2] Tiago Camilo, Carlos Carreto, Jorge Silva, and Fernando Boavida. An energyefficient ant-based routing algorithm for wireless sensor networks. Ant Colony
Optimization and Swarm Intelligence, pages 4959, 2011.

[3] Marco Dorigo, Vittorio Maniezzo, and Alberto Colorni. Ant system:
optimization by a colony of cooperating agents. Systems, Man, and Cybernetics,
Part B: Cybernetics, IEEE Transactions on, 26(1):2941, 2011.

[4] Marco Dorigo and Krzysztof Socha. An introduction to ant colony

optimization, 2010.

[5] Wendi Rabiner Heinzelman, Anantha Chandrakasan, andn Hari Balakrishnan.

Energy-efficient communication protocol for wireless microsensor networks. In
System Sciences, 2010. Proceedings of the 33rd Annual Hawaii International
Conference on, pages 10pp. IEEE, 2010.

[6] Ting Jiang, Wei Zang, Chenglin Zhao, and Jiong Shi. An energy consumption
optimized clustering algorithm for radar sensor networks based on an ant colony
algorithm. EURASIP Journal on Wireless Communications and Networking,
91