COMSATS University Islamabad,

Sahiwal, Campus

Synopsis For the degree of M.S/M.Phil.

PART-1(to be completed by the student)

Name of Student Ans Ali Raza

Department Computer Science
Registration No. Date of
CIIT/FA17-RCS-004/SWL Thesis
Registration
Name of (i) Research Dr. Muhammad Shoaib
Supervisor
(ii) Co-Supervisor Dr. Muhammad Farhan
Members of Supervisory Committee
1.
2.
3.
4.
Title of Research Proposal A Methodology to find the boundary of wireless sensor
network
Signature of Student:

Summary of the Research :

Certain techniques, algorithms has been designed for detecting the boundary nodes in wireless
sensor network system. (WNS). As of those has limitations time efficiency. Distributed Least
Polar-angle Connected Node (D-LPCN) provides extension for LPCN algorithm. There is also
proposed algorithm known as D-LPCN. We are extending this D-LPCN algorithm. The proposed
system has two benefits. I.e. it works with polar network. Secondly, it determine the different
associated nodes of network. Our proposed Algorithm is stimulated on the CupCarbon. Algorithm
proves it easy to find the boundary nodes in Euclidean graph and all those nodes which are
connected in the cycle.
Introduction:
Wireless System Network has got cardinal importance due to its effectiveness in last few
years. It won't be a misrepresentation to think about WSNs as a standout. The research on
WSNs has been increased[1]. Applications of WSNs has been increased the demand. The
demand forecast raised from 0.45 billion to 2.0 B and still raising high[2, 3]. These
statements shows the importance and increasing demands of WSNs technology.

The advancement in wireless system carried out for communication permitted the
improvement of extensive smaller devices called sensor nodes[4]. These small devices
can detect, process, and convey information so as to perform two essential functions:
detecting and communication. The sensors should be very much associated and the
objective zone ought to be surrounded by these sensors. The data to be conveyed must be
reliable to affirm great communications. A good reporting will guarantee an excellent
picking up of data which is stimulating. There are two types of nodes. Some of them are
thin while some are thickly made. Similarly according to communication, nodes are also
organized deterministic way or arbitrarily. (e.g., factories, potential tragedies[5], military
uses of following and so forth.). Borderline nodes .i.e. the marginal nodes are very
necessary to know because it is used to detect the topology of network, in order to
perform area based (geographical) routing , guiding and tracking [6], to copy the
restraints of sensitive and tactical in some Wireless sensor network (WSNs) application.

Boundary is the connected frontline of WSNs nodes. This boundary has vast application
in security to chase any sensitive activity, or in fields. Algorithm designed to find the
polygon is LPCN[7] which stands for least polar connected network hull in Euclidean
graph. LPCN is based on Jarvis’ algorithm. This algorithm finds out the nearest node in
correspondence to the node found in previous iteration. In this way it detects the
boundary nodes but they are limited and finite. The problem in Jarvis’ algorithm is that it
determine the node between the finite numbers of nodes. LPCN has been designed in a
way that it provides the link to the node founded in previous iteration. Thus it makes it
easy to find the nearest node in the Euclidean graph.

To enable capabilities for diversified application, the graph topology has proved to be one
of the most important paradigm. This issue is extremely complex, particularly for
unconnected random graphs. The study of the topology construction of arbitrary
Euclidean graphs is our main point. Especially the recognition of all associated
components that are at the boundaries .Our main focus is to find graphs associated
components along with their corresponding boundaries [8]. Many research methods
assumes that the graph is planar, such that they utilize the approximative methods e.g.
heuristics etc. But this methods are not approximate correct. Many of research fails in the
energy utilize because Gabriel’s Graph consume a lot of energy to get a planar graph.
Saoudi et al.[9] Presented the distributed least polar connected node (D-LPCN) which is
related to this work which finds the polygon hull of Euclidean Graph.
Boundary node in any cycle, selects the nearest node except the first one as compared to
the node in the preceding iteration in D-PLCN (distributed least polar-angle connected
node).
The algorithm is to find minimum In graph is used to detect the first node. This algorithm
has two benefits. First is that it works with any planar network and secondly it determine
the different associated nodes of network. Moreover it also takes into consideration of
any hindering condition and also provide the essential elements to prevent them. This
algorithm is applied on CupCarbon[10]. CupCarbon is a simulator which is designed to
test, validate the algorithms. It do not only simulate the algorithms but it also used to test
the smart city[11] projects. CupCarbon is WSN based tool which offers the two
simulation environment to test the protocols as well the wireless topologies.

When high accuracy and precision is required for the position, sensor nodes are bind GPS
receiver. Positively, it’s extremely overpowering on account of continuing use. Despite
the fact that it tends to be utilized for smart city WSNs. For powering problem, they can
be mechanized repeatedly utilizing the power from urban areas. On the account of static
WSNs, the global position system GPS is utilized to get the position of site with no effect
on energy usage, as the GPS position will remain unaffected amid the network’s age[12].
There are a few ways which reflect the nodes freely wherever every node figures,
approximations its site. These sensors nodes which reflect the nodes by calculating the
exact distance and the angle shaped with its nearing nodes. Lot of new techniques have
been realistic. TOA, TDOA, RSSI, AOA, HIRLOC, SERLOC, and ADLA[13] are those
techniques which utilize the impact of the coming signals to control area. In the modern
age, different strategies utilizes the sensors which are hybrid and they are setup with the
global GPS. These hybrid nodes are called Anchor Nodes[14]. These nodes are also
called beacon nodes. Their function is to direct the location of such node and are not
localized. The precision of these techniques is liable to the quantity of anchor nodes.

We have presented our research which is the extension of this algorithm which made easy
to find the boundaries in Euclidean graph[8] and their correspondence associated
components. Our simulations in Wireless sensor networks WSN elaborate his efficiency.
Current condition is same as we dealt in the problem of detecting a polygon hull in
Euclidean graph. This graph displays minimum associated boundary nodes.

Problem Statement

In wireless sensor network (WSNs) many algorithms are used to find the boundary of sensor
network but these algorithms need to be improved. Boundary finding in WSN is used for the
monitoring a frontier or a secure place of strategic sensitive sites like oil fields or frontiers of a
country. This situation is modeled as the problem of finding a polygon hull in a connected
Euclidean graph, which represents a minimal set of connected boundary nodes. Therefore there is
a need to find the boundary with suitable algorithm.
Research Methodology

Step1:
Literature Review:
Certain work has been performed on finding the boundary nodes in wireless sensor
network. They can be composed in three distinct classifications, geometrical, statically
and topological. They work accurately to determine the position the of boundary node by
detecting the respective nodes. Statical methods are based on the numerical probability
for a specific network’s condition. Whereas topological method uses the information
gained through connectivity of nodes in network. When a node is connected in a network.
Its position is shared between the nodes. In other technique, boundary cycles are made in
the network. The highest edge of the cycle is selected. This cycle has been consider the
center of network. In this way other cycles are determined.

Step 2: Selection of an algorithm:

D-LPCN is a highly efficient algorithm for determining the boundary nodes. The
efficiency of this algorithm proves itself in many fields like in strategic security and
monitoring the frontline. Moreover it also saves energy than other techniques.

Step 3: Implementation:
Boundary node in any cycle, selects the nearest node except the first one as compared to
the node in the preceding iteration in D-PLCN (distributed least polar-angle connected
node). As we stimulated the algorithm in CupCarbon, it successfully detected the first
node. Moreover it also takes into consideration of any hindering condition and also
provide the essential elements to prevent them.

Step 4: Simulation:
We implemented our algorithm in CupCarbon. The results are as expected. Boundary
nodes are found with minimum energy consumption. Our simulations in Wireless sensor
networks WSN elaborate his efficiency.

Step 5: Results:
We have presented our research which is the extension of this algorithm which made easy
to find the boundaries in Euclidean graph and their correspondence associated
components. Current condition is same as we dealt in previous problem of polygon hull.
This graph displays minimum associated boundary nodes.
Figure 1. Flow chart the Research Methodology
Research Flow Activity

The research activities are divided into four phases.

Phases Activity

Phase-1 Theoretical Background,

 Detail literature review to understand the concept of

wireless sensor network.

 Analyze the design of existing system challenges,

opportunities and threats.

 Identifying and analyze the different boundary founding

Algorithm in wireless sensor network.

Phase 2 Problem Formulation and Design,

 Highlight the problems to address for this research work

 Set the objectives to investigate the research questions

 Detail description of proposed methodology

Phase-3 Implementations and Comparison,

 Designing and developing of proposed methodology

 Simulate the proposed methodology for checking the

performance of different parameters

 Evaluation and comparison of proposed methodology with

existing state-of-art work

Phase-4 Dissertation and Milestone,

 Thesis write up

 Publications
Bibliography

Tentative Time Table

1. Literature Review and Problem Identification July 2018 – Aug. 2018

2. Synopsis Write up and Submission and Presentation. Sep. 2018 – Sep. 2018
3. System Design: Logical and Physical Oct. 2018
4. Implementation and Results Dec. 2018
5. Thesis Write up and Submission Jan. 2019
6. Research Paper Write Up Feb. 2019
Final Defense Mar. 2019
PART II
Recommendation by the Research Supervisor

Name_________________________Signature_____________________Date________

Signed by Supervisory Committee

S.# Name of Committee member Designation Signature & Date

1.
2.
3.
4.

Approved by Departmental Advisory Committee

Certified that the synopsis has been seen by members of DAC and considered it suitable
for putting up to BASAR.

Secretary
Departmental Advisory Committee

Name:__________________________________ Signature:_____________________

Date: _________________

Chairman/HoD ____________________________

Signature: _____________________________

Date: _____________________________
PART III

Dean, Faculty of Information Sciences & Technology

_________________Approved for placement before BASAR.

_________________Not Approved on the basis of following reasons

Signature ____________________________ Date__________________

Secretary BASAR

_________________Approved from BASAR.

_________________Not Approved on the basis of the following reasons

Signature ____________________________ Date__________________

Dean, Faculty of Information Sciences & Technology

________________________________________________________________________

________________________________________________________________________

Signature:_______________________________ Date__________________
Please provide the list of courses studied

Course Title Code

Advance Algorithm Analysis CSC511
Advanced Topics in Multimedia Technologies CSC624
Special Topics in Wireless Technologies CSC836
Theory of Computation CSC510
Advanced Topics in Wireless Networks CSC636
Advanced Topics in Human Computer Interaction CSC626
Research Methodology in IT CSC679
Advanced Topics in Machine Learning CSC763