10th IEEE International Conference on Communication Systems and Network Technologies
Swarm Technology based Self-Deployment with
2021 10th IEEE International Conference on Communication Systems and Network Technologies (CSNT) | 978-1-6654-2306-9/21/$31.00 ©2021 IEEE | DOI: 10.1109/CSNT51715.2021.9509712
ACO for Wireless Sensor Network in the Presence
of Obstacles
Uppalapati Srilakshmi,
Department of CSE,
VFSTR Deemed to be University, Vadlamudi, Guntur, A.P, India.
druppalapati2019@gmail.com
Abstract— Wireless sensor networks are often called insider
attacks because of the misbehavior of nodes in transmission of
packets. Wireless sensor networks made up of limited-power
nodes are deployed to collect valuable field information. In
WSN, it is essential to efficiently collect the information. WSN is
a small, large collection of densely deployed sensor nodes that
are smart, efficient and very powerful and versatile networking
where wired and wireless networking is traditionally not
available. The lifetime of a WSN depends significantly on node
batteries and is critical for most WSN applications. Trust-based
routing is necessary for both securing the data collected and
protecting network efficiency from unreasonable use of
degradation and network resources as a result of the attacks in
wireless sensor networks. ACO (Ant Colony Optimization)
protocols for WSN is presented in the present paper. This
protocol supports protected networks but it does not resolve the
damaging effect of the network process. We have therefore
proposed a new SD-ACO technique (trust, link quality, distance,
and energy) with the QoS Parameters. It optimizes the routing
paths, providing a secure transmission of data for the
identification of malicious nodes. The main objective is to
maintain the maximum network life while transmitting data
effectively. ST-ACO performs very well with regard to
mitigation of malicious nodes, packet delivery ratio, end-to - end
delay, energy use and output. Result of simulation using NS2
software to verify our method 's effectiveness.
Keywords -- WSN, Connectivity, Mobile Sensor Network, Node
deployment, Relative Neighborhood Graph, Target Coverage,
Virtual Force, Self-Deployment, Ant Colony Optimization.
I. INTRODUCTION
NOWADAYS, Coverage is a Wireless Sensor Network
(WSN) active research area. There are three categories of
coverage, according to [1] and [2]; barrier coverage, target
coverage or coverage of points also area coverage,
respectively. Sensor nodes will be a barrier during barrier
coverage to identify intruders. Target coverage denotes
toward the controlling by the region of interest (ROI) of a
given number of targets. Area coverage means that any point
inside ROI requires either one or more sensor nodes or
combined detection to be monitored. The majority of current
studies are based on the problem of coverage of areas [ 1],
[3]-[12] and barrier coverage [13]-[15] and less on the target
scope of work [16], [17]. Li et al.[16] are proposing an
978-1-6654-2306-9/21/$31.00 ©2021 IEEE
DOI: 10.1109/CSNT.2021.85
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 05:52:35 UTC from IEEE Xplore. Restrictions apply.
algorithm for deployment to track such ROI points that have
been previously identified. This research does not take into
account the connectivity among base station with sensor
nodes. In [17] authors suggest an automated deployment
method to preserve network access while using mobile sensor
nodes. This device is not suitable when there are obstacles in
the sensing field.
Here, we present the Distance, Energy, Link Quality, and
Trust Awareness Swarm intelligence based Self-deployment,
which is designed specifically to meet the harsh and
aggressive circles of WSN nodes. Hard and hostile
environments represent WSN in the areas of battlefields,
forests, disasters and unattended areas, where conditions
continue to be dramatically affected and where there is a
growing exposure to various types of threats and attacks. It
should be noted that link quality and other relevant
parameters, which are not taken into consideration when
selecting the next forwarder by different WSN ant-colony-
based routing algorithms mentioned in the literature, which
vary depending on their environment and the environment
and surrounding environmental and networking conditions. It
is also found that the number of pheromones determined to
take a return journey during the simulation time does not
represent the optimal direction. In view of these, pheromone
updated model has been built taking into account the
parameters collected by forward ants from source to
destination, i.e. the path trust rating, the average energy
available, the minimum node energy along path, the number
of hops and link path quality, to strengthen a path with plenty
of pheromones to select this path as the best source.
II. LITERATURE SURVEY
Our key contribution here in [19] is a coupling estimation
and monitoring algorithm with an official derivation, namely
algorithms 1 and 2. We are implementing information based
blocking algorithms as an independent deployment strategy
for mobile sensor networks to boost both sensor coverage and
sensor efficiency. After deployment phase, multi-target
monitoring of mobile sensor network targets can be done
using an information fusion algorithm.
We propose a self-deployment scheme for grids in this
Author [20]. A sensing area can be fully covered by the
494
proposed scheme. The sensing region is divided into cells. since more ants prefer shorter sides than long sides. The
The maximum square sensing area is represented by a cell broken line number in the figure. 1 is approximately the
which is covered by a single sensor. When sensors are direct ratio to ant number. The artificial ant colony system
deployed randomly, they share location information with is derived from the ant colony system principle to solve
their neighbors. After the original cell determination, the types of problems with optimization. Pheromone is the key
sensor attempts to cover the cell that it locates and its nearest to ants decision. The ACO Computational flow is shown in
cell if the next cell does not have a sensor. Other sensors Figure 2.
travel in the direction of the sink node with the exception of
sensors that cover the current cells. No sensor in empty cells
often moves in the direction of the node of the sink. We are
inserting an empty cell hole, and the sensor is replaced by a
hole in its direction. Additional sensors locate hole in middle
of the sink or around the sink; eventually, at least one sensor
Fig1: A decision-making process for ants to choose their journeys by their
covers all cells. pheromones
In this article [21] the traditional VFA was developed to 3.2 Proposed Computational Flow Chart for the ACO Path
include Multi-Self-Deployment Algorithm (Abbr. MCSA), and Dynamic Routing Environment:
capable of process of managing self-coverage nodes and
therefore of upgrading the network coverage accuracy.

III. PROPOSED METHOD Start

3.0 Self-Deployment with Ant Colony Optimization method:

Set current position
The Major Contributions in work:
• Moving sensors randomly deployed
• GPSR to identify the location of sensor node Find the best
point from the
during deployment.
next move
• Edge, node trajectory calculation
based on
• Euclidean distance
• Aodv protocol shows the connection from nodes to
sinks.
Ending
• ACO implements and enhances routes
point?
a. ACO (Ant Colony Optimization):
Yes
Theory of algorithm of the ant colony method was that
a special chemical route (pheromone) is left to lead other axes Stor Back to
Best
toward the solution of the target. More pheromones are left starting
e path
as supplementary ants go on trip, thereby increasing path
probability of others selecting the trip. In addition, a No
diminishing influence over time is caused by this chemical
trail (pheromone). Furthermore, the amount of ants left Pheromone
depends on the number of ants on this path. Fig.1 shows a evaluation
decision-making procedure in which the ants choose their
trips.
Update path
There are some people who select one side, then few pheromone No
randomly select another when ants meet in decision A.
Suppose that these ants crawl at the same pace, those who Max
choose a short side will reach faster at decision B than those iteration?
who choose a long side. The ants who unconsciously choose
Yes
the short side of the nest is the first. As a result, the short
side gets pheromones faster than the long one, and thus
increases the probability that other ants will prefer them Stop
rather than the long side. As well as a consequence, in short
sides, the number of pheromones is greater than in long sides Fig2: ACO 's computational flow chart

495

Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 05:52:35 UTC from IEEE Xplore. Restrictions apply.
 to other nodes up to a broadcast range of 250 m.

Start The constant bit rate (CBR) sources transmit all packets
with a rating of 1000 bytes of 20 packets per ms. All nodes
are communicated via a single radio channel with a data rate
of 54 Mbps following IEEE 802.11. The total energy of every
ACO algorithm for the shortest path node is 100 J.
PARAMETER VALUE
Application Traffic CBR
Transmission rate 1000 packets/0.1ms
Adding traffic Radio range 250m
Packet size 512 bytes
Initial energy 100j
Simulation time 8 sec
Number of nodes 40
Pheromone re-initialization
Area 1000x1000
Routing methods OATIDA, SD-ACO
Routing protocol AODV
Table1: Simulation Table
ACO algorithm for the shortest path

Yes DELAY
No 1.5
D
Max iteration? E
L 1
A
Y
(m 0.5
s)
Stop

0
Fig3: The flow chart of ACO in a Dynamic Domain 20 40 60 80

OATIDA SD-ACO TIME(Sec)

The proposed ACO algorithm has the following concepts:
Fig4: Delay
a. The path search ants are called forward ants since source About delay in the network was represented in figure
nodes to end point nodes, perform route search function,
4. Due to a less time-limited network result, we have
and set the reverse pheromone table. proposed a method called SD-ACO for overcoming the
b. The ants are called the backward ants that update the existing OATIDA method. In comparison to existing work,
pheromone function and set the routing table from target
delay is reduced, so network performance is good.
nodes returns to the source nodes if the forward ants enter
target nodes.
c. In each search, forward ants enter a certain node in which PDR
the routing table shows the source nodes and the reverse 2
pheromone table is defined as source node, next node, and P
D
pheromone inside reverse node. R 1.5
Figure 3 shows ACO's flowchart in a dynamic domain. (
% 1
IV. RESULT AND DISCUSSION )

In the following section, we analyze the output with 0.5

detailed NS-2 network simulation of our proposed SD-ACO
scheme. The performance of the schemes considered is 0
compared in terms of packet delay, energy consumption, 20 40 60 80
OATIDA TIME(Sec)
packet delivery relationship also output. Table 1 shows the
simulation parameters. Simulation configuration comprises
40 stationary nodes distributed randomly across 1000 × 1000 Fig5: Ratio of package delivery
m2. For an interference range of 500 m, each node will link

496

Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 05:52:35 UTC from IEEE Xplore. Restrictions apply.
 Figure 5 indicates the network Ratio of package quality features in order to select the best next step to the
delivery. We suggest a system called SD-ACO to solve the routing, thereby improving load balance and extension of the
current OATIDA process, since the packet transmission ratio network life. The secure routing process is dependent on key
should be higher in a network to produce better performance. distribution. We also simulated NS2 and showed that our SD-
Here, as compared to existing work, the transmission ratio of ACO is practical for the discriminating malicious and
packets is increased, hence network efficiency is good. improves ACO using a secure mechanism. We are finally
overcoming malicious activities with ACO method based on
trust awareness.
ENERGY
2
E REFERENCES:
N 1.5
E [1] A. Howard, M. J. Mataric, and G. S. Sukhatme, “Mobile sensor
R network deployment using potential fields: A distributed, scalable
G 1 solution to the area coverage problem,” in Proc. 6th Int. Conf. Distrib.
Y Auto. Robot. Syst. (DARS), 2002, pp. 299-308.
( [2] R. Mulligan and H. M. Ammari, “Coverage in wireless sensor
0.5
j networks: a survey,” Network Protocols and Algorithms, vol. 2, no.
) 2, pp. 27-53, 2010.
0 [3] Y. Zou and K. Chakrabarty, “Sensor deployment and target
20 40 60 80 localization based on virtual forces,” in Proc. IEEE INFOCOM, San
OATIDA SD-ACO TIME(Sec) Francisco, Mar. 2003, pp. 1293-1303.
[4] N. Heo and P. K. Varshney, “Energy-efficient deployment of
Fig6: Energy intelligent mobile sensor networks,” IEEE Trans. Syst. Man Cybern.
It represented energy in the network in figure 6. As the A., st. Humans, vol. 35, no. 1, pp. 78 – 92, 2005.
energy consumption in the network should be less, we [5] G. Wang, G. Cao, and F. L. Porta, “Movement-assisted sensor
deployment,” IEEE Trans. Mobile Comput., vol. 6, no. 6, pp. 1-13,
proposed a method called SD-ACO to overcome the existing Jun. 2006.
OATIDA. Here, while compared to existing work, energy [6] Y. Mei et al., “Sensor replacement using mobile robots,” J. Comput.
consumption is reduced, so network performance is good. Commun.., vol. 30, no. 13, pp. 2615–2626, Sep. 2007.
[7] J. Chen, S. Li, and Y. Sun, “Novel deployment schemes for mobile
sensor networks,” Sensors, vol. 7, no. 11, pp. 2907– 2919, 2007.

T 2
THROUGHPUT [8] R. Chang and S. Wang, “Self-deployment by density control in sensor
networks,” IEEE Trans. Veh. Technol., vol. 57, no. 3, pp. 1745-1755,
H 2008.
R
[9] F. Kribi, P. Minet, and A. Laouiti, “Redeploying mobile wireless
O 1.5
sensor networks with virtual forces,” in Proc. 2nd IFIP Conf.
U
Wireless days, (WD’09), Piscataway, NJ, USA, 2009, pp. 254–259.
G 1
H [10] X. Yu et al., “A novel virtual force approach for node deployment in
P wireless sensor network,” in Proc. IEEE 8th Int. Conf. Distributed
U 0.5 Computing in Sens. Syst. (DCOSS), 2012, pp. 359-363.
T [11] S. Mahfoudh et al., “Relocation of mobile wireless sensors in the
( presence of obstacles,” in Proc. Int. Conf. Telecommun. (ICT),
k 0 Maroc, 2013, pp. 1-5.
b 20 40 60 80 [12] Y. Qu and S. V. Georgakopoulos, “A distributed self-relocating
p OATIDA SD-ACO TIME(Sec) algorithm for randomly deployed mobile wireless sensors,” in Proc.
s IEEE Topical Conf. Wireless Sensors and Sensor Networks (WiSNet),
) 2013, pp.148-150.
Fig7: Throughput [13] S. Kumar, T. H. Lai, and A. Arora, “Barrier coverage with wireless
sensors,” in Proc. 11th Annu. Int. Conf. Mobile Computing and
Figure 7 showed the network's performance. Since there networking (MobiCom), Cologne, Germany, Aug. 2005, pp. 284-298.
is a need for better network performance, we have suggested [14] C. Shen et al., “Barrier coverage with mobile sensors,” in Proc. Int.
a method called the SD-ACO in order to overcome the Symp. Parallel Architectures, Algorithms, and Networks (I-SPAN),
May 2008, pp. 99-104.
existing OATIDA method. In comparison with existing work,
[15] A. Saipulla et al., “Barrier coverage of line-based deployed wireless
the output is increased, so that network performance is good. sensor networks,” in Proc. IEEE INFOCOM, Rio de Janeiro, Apr.
2009, pp 127—135.
V. CONCLUSION
[16] M. Li et al., “Sweep coverage with mobile sensors,” IEEE Trans.
Our proposal of SD-ACO, Swarm Intelligence Ant Mobile Comput., vol. 10, no. 11, pp. 1534-1545, 2011.
colony optimization with Distance, Energy, link quality and [17] T. Razafindralambo and D. Simplot, “Connectivity preservation and
trust awareness were presented in this paper. Routing coverage schemes for wireless sensor networks,” IEEE Trans. Autom.
Control, vol. 56, no. 10, pp. 2418-2428, 2011.
decisions for SD-ACO are based on the ACO methodology,
[18] T. M. Cheng and A. V. Savkin, "A problem of decentralized self-
which incorporates trust, residual energy, distance and link deployment for mobile sensor networks: Barrier coverage between

497

Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 05:52:35 UTC from IEEE Xplore. Restrictions apply.
 landmarks," 2009 IEEE International Conference on Control and
Automation, Christchurch, 2009, pp. 1438-1442.
[19] P. Jalalkamali and R. Olfati-Saber, "Information-driven self-
deployment and dynamic sensor coverage for mobile sensor
networks," 2012 American Control Conference (ACC), Montreal,
QC, 2012, pp. 4933-4938.
[20] P. Park, S. Min and Y. Han, "A Grid-Based Self-Deployment
Schemes in Mobile Sensor Networks," 2010 Proceedings of the 5th
International Conference on Ubiquitous Information Technologies
and Applications, Sanya, 2010, pp. 1-5.
[21] L. Tan, C. Yu and M. Yang, "A multi-center self-deployment
algorithm of mobile sensor network," 2010 5th International
Conference on Computer Science & Education, Hefei, 2010, pp. 965-
968.
[22] U. Sri Lakshmi, B. Srinivas Rao, (2016), “Secure Performance of
intrusion detection system for manets using new digital signature” in
IJIET (International journal), 7(1): 392-397.
[23] U. Sri Lakshmi, B. Srinivas Rao, (2017), “Proficient Interference
Exposure Expedients to Secure MANET from Occurrences” in IJAT
(International journal – Open Access), 8(4), doi:10.4172/0976-
4860.1000195
[24] U. Sri Lakshmi, B. Srinivas Rao, (2018), “Mitigate the Routing
overhead in WSN using new random walk detectors based approach”
in Journal of Advanced Research Dynamic Control System
(International journal), 10(4): 2062-2073.
[25] GS Tomar, Tripti Sharma, Brijesh Kumar, “Fuzzy based Ant colony
Optimization Approach for Wireless Sensor Network”, Wireless
Personal Communication, Vol.84, No.1, pp.361-375, May 2015.
[26] U. Sri Lakshmi, B. Srinivas Rao, (2019), “An Overhead Aware
Multipath Routing Protocol for Improving Relay Node Selection in
MANET” in IJRTE (International journal), 8(1): 2890-2897.
[27] U. Srilakshmi, D. Yakobu, G. Jose Moses, P. Anusha, Dr. E. Laxmi
Lydia, (2020), “Energy Efficient with load balancing Bee Ad-Hoc
Routing Protocol for Manet” in Test Engineering & Management
(International journal), 82: 1197-1207.
[28] Jung-Yoon Kim, Tripti Sharma, Brijesh Kumar, G.S. Tomar, Karan
Berry, Won-Hyung Lee, “Intercluster Ant Colony Optimization
Algorithm for Wireless Sensor Network in Dense Environment”,
Hindawi International Journal of Distributed Sensor Network, Vol
2014, pp.1-8, 2014.
[29] Uttej Kumar Nannapanenia, U. Srilakshmi, Alaparthi Sravyaa,
Kavuru Tejaswi, (2020), “Cluster-Based Collection Point Energy
Efficient Routing Protocol for the Mobile Sink in Wireless Sensor
Network”, in International Journal of Future Generation
Communication and Networking, 13(2): 787-796.
[30] U. Srilakshmi, (2020), “Energy-Efficient Heterogeneous
Optimization Routing Protocol for Wireless Sensor Network”, in
INSTRUMENTATION MESURE MÉTROLOGIE! (IIETA), 19(5):
391 – 397.

498

Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 05:52:35 UTC from IEEE Xplore. Restrictions apply.