International Journal of Engineering Trends and Technology (IJETT) - Volume 21 Number 1 - March 2015
#1
#2
#1 M. Tech, Department of Computer Science and Engineering, AMC Engineering College, Bangalore – 560083
#2 M. Tech, School of Computing Sciences and Engineering, VIT University Vellore – 632014 Tamil Nadu India.
1 omerahyousuf28@gmail.com
2 khanrouf25@gmail.com
Abstract
— Looking at the recent trends in the fields of technology and engineering development, one can easily see that the wireless sensor networks is one of the most prominent fields and a lot of attention seeker from the researchers. Wireless sensor networks in the modern era need to be robust efficient, reliable and most importantly secure so that they can be used rigorously in each and every filed of life. In this research work we are proposing a new protocol which will make the data transmission in case of cluster based wireless sensor networks more reliable, robust and secure. The clustering itself is a step forward towards the improvement of the efficiency in the wireless sensor networks. In this paper the Request SET IBOOS
Based Routing protocol is developed. With the help of this routing protocol the forwarding of packets from source to destination in any cluster based network is made more reliable and robust with the help of finding cover set, neighbor set between the intermediate nodes of a sender and receiver in lesser time as compared to the existing routing protocols. Also the data transmission is made more secure using the concept of SET
IBOOS in which the neighbor node is picked based on the SET
IBOOS Level to make the route compromising the previous, neighbor and the next node in the cluster secure. The protocol is simulated using the ECLIPSE IDE.
Keywords
— Reliability, Robustness, Secure, SET IBOOS Level,
Cover set and Neighbor Set.
I.
I NTRODUCTION
Wireless sensor networks have shown a rapid surge in terms of development and design since the past half-decade. New technologies have been designed and implemented to make these wireless sensor networks to come at par with the existing wired networks in terms of efficiency and reliability.
Lot of research has been done already by the most Lot of research has been done already by the most prominent researchers of the prominent era. Clustering was one such design strategy which was aimed to improve the reliability and efficiency of the wireless sensor network, as a result of which the cluster based wireless sensor networks became a hot area of research in the field of wireless sensor networks within no time. [1] Then started the trend of further improvements in the fields of the cluster based wireless sensor networks. This paper aims at extending the same concept to a further level so that we can achieve better results as compared to the existing protocols. Placement of nodes in Wireless
Sensor Network (WSNs) often takes a lot of effort (therefore called as Massive) and LEACH Topology control algorithms focus in lowering the initial network topology, by reducing active nodes and links, thus saving resources and increasing network lifetime. Currently, most algorithms and schemes in
WSNs construct shared core-based trees with the sink as a root for this purpose. In actual what we are trying to demonstrate through this paper is that, whether trees that initiate from each source called source-based trees can assist in this purpose and provide an efficient topology control solution under specific circumstances.
Massive and LEACH placement of sensor nodes on a monitored field renders node communication a difficult task to be achieved. Congestion, Interference and routing problems are thus possible to arise at any point in such networks.
Routing challenges in WSNs mainly arise because of the fact that these networks possess some inbuilt unique characteristics such as: limited energy supply, limited bandwidth on the wireless links, and limited computing power, which impose severe restrictions on the design of efficient routing protocols.
Thus, topology control in conjunction with routing challenges, becomes an important issue that has to be carefully considered in order to achieve the features like robustness, reliability. [2]
Generally, congestion control algorithms in WSNs employ two methods in order to control and avoid congestion. i.
Traffic control – Algorithms employing this method adjust the rate with which sources inject traffic to the network in order to ii.
control congestion
Resource control – Resource control algorithms, employ redundant nodes, which are not in the initial path from source to sink, in the process of forwarding data. Do not control the data rate of the sources but the paths through which the data flows.
According to studies traffic control algorithms are not affected by different node placements, while according to the same studies resource control algorithms are significantly affected.
Different node placements create a variable number of paths which are important for the proper operation of these algorithms. Thus we can conclude that the clustering in case of WSNs increase the overall efficiency. [3]
ISSN: 2231-5381 http://www.ijettjournal.org

International Journal of Engineering Trends and Technology (IJETT) - Volume 21 Number 1 - March 2015
II.
R ELATED WORK
There has been a lot of research done in the area of Wireless
Sensor Networks security issues carried out by the prominent authors in the recent past. Since it is one of the important research areas of the 21st century. There is huge amount of research material available in this field on which this paper can be built and the new mechanism which will be efficient than the existing approaches will be proposed.
In the year 2000 N. Bulusu, J. Heidemann, and D. Estrin in their paper titled “GPS-less Low Cost Outdoor Localization for Very Small Devices ” [4] addressed localization in unconstrained, out-door environments for very small, low cost devices which do not have GPS. In the large sensor network systems, nodes need to locate themselves in various environments and on different distance scales. Interference, congestion, and routing problems are possible to arise at any point in such networks. According to this paper, there are various routing challenges in WSNs such as limited energy supply, limited computing power, and limited bandwidth on the wireless links, which impose severe restrictions on the design of efficient routing protocols and can affect the routing process in WSNs. Thus, topology control, in conjunction with routing challenges, becomes an important issue which need to be tackled for large scale deployment.
In the year 2002, Arati Manjeshwar, Qing-An Zeng and
Dharma P. Agrawal in their paper titled, “An Analytical
Model for Information Retrieval in Wireless Sensor Networks
Using APTEEN Protocol” [5] developed a model to analytically determine the delay which occurs while handling various types of queries using APTEEN protocol. It uses
TDMA schedule to handle various types of queries efficiently.
This was the first step to determine the delay characteristics of a wireless sensor networks. According to this model the delay in queries mainly depends upon the frame length which can be reduced only if all CHs use different CDMA codes to communicate with the base station. This protocol however improves the life of sensor network by at least two times but did not predict the impact of changing the threshold values ,count time, changing the percentage of idle nodes, etc. on the energy consumption and network longevity. In the year 2006 T. He, P. Vicaire, T. Yan, Q. Cao, L. Luo, L. Gu, G.
Zhou, J. Stankovic, and T. Abdelzaher in their paper titled
“Achieving Long Term Surveillance in VigilNet” [6] addressed the problem of energy efficiency for outdoor long term surveillance. According to this paper, the power management techniques is able to increase the lifetime of a realistic network from 4 days to 200 days. The results obtained here provide the lessons for future development of energy efficient sensor systems. In the year 2010, Huang Lu,
Jie Li, and Hisao Kameda in their paper titled “A Secure
Routing Protocol for Cluster-based Wireless Sensor Networks
Using ID-based Digital Signature.”, [7] discussed about the secure and efficient routing in cluster based wireless sensor networks .In this paper the authors described the various deficiencies in routing protocols with symmetric key pairing.
They proposed a new secure routing protocol with ID-based signature scheme for cluster based WSN’s in which the security lies on Diffie-Hellman problem. However the results obtained showed that the protocol consumes the extra energy and the security overhead is still large. Thus the researchers are trying to improve the routing protocols in order to improve the energy efficiency with pairing.
In the year 2010, Rehana Yasmin, Eike Ritter and Guilin
Wang in the paper titled, “An Authentication Framework for
Wireless Sensor Networks using Identity-Based Signatures:
Implementation and Evaluation” [8] pointed out the problem of authentication of nodes in WSN. In this paper an authentication framework for WSNs using Identity (ID) - based Cryptography and Online/Offline Signature (OOS) schemes was proposed which comprises of two authentication schemes. The first scheme allows the authentication among the various nodes in the network without the involvement of the base station. This scheme also allows the sensor nodes to verify a message and discard the false message. The second scheme enables all sensor nodes in the network to provide authentication to the outside world without storing any information about the user and establishes a session key for secure routing in the network. This paper however did not focused on the establishment of the session key between the outside user and the sensor node.
III.
S YSTEM DESIGN
All A new architecture is proposed which focuses on detection of the secure nodes in the cluster and defense mechanism by using both cluster-based approach and SET
IBOOS-based route discovery through each and every node in a clustered wireless senor network. [9] The route redundancy and message redundancy will be reduced by broadcasting the packets using piggybacking bit for SET IBOOSs. The lesser bandwidth consumption will be maintained and the broadcast storm problem will be reduced. The system design is developed in a way that it divides the nodes into compartments like trains called as clusters with one special node acting as cluster head. Which nodes to select as the forward nodes, in the cluster while transmitting packets from sender to receiving end is done based on the calculation of
SET IBOOS and efficient route is discovered based on maximum SET IBOOS level. [10] Fig 1 shows the system architecture for Secure, Reliable and Robust Data
Transmission for Cluster-based Wireless Sensor Networks
ISSN: 2231-5381 http://www.ijettjournal.org

International Journal of Engineering Trends and Technology (IJETT) - Volume 21 Number 1 - March 2015
Fig. 1 System Architecture
The system architecture shown in Fig. 1 reveals the main components of the design. These components are: i.
Node Deployment Algorithm, ii.
Zone Formation Algorithm, iii.
Cluster Head Election, iv.
Multiple Route Discoveries, v.
Best Route Selection, vi.
Encryption and Trust Computation, vii.
LEACH Cluster Head Election, viii.
LEACH Route Discovery, and ix.
Evaluating the performance of the system designed.
Node Deployment Algorithm – This algorithm is responsible for deployment of nodes in a particular area
Zone Formation Algorithm – Zone Formation algorithm divides the entire region into multiple zones. Each Zone is having a set of nodes in turn. Each zone bounded with the limits min & max on both the axis. It is shown in Fig. 2 below:
Cluster Head Election – This algorithm is used to elect the
Zone Leader by computing the distance between each node per zone and the node in the zone which has the minimum distance to every other node in the particular zone is elected as the Zone Leader.
Multiple Route Discovery – Since there are a number of possible routes possible between a sender and receiver in a particular zone or cluster, this component of the design helps us to obtain all these possible multiple routes.
Best Route Selection – Among the multiple routes discovered in the previous step our aim now is to find out the best possible route which has got the minimum spanning cost. This algorithm helps us in selection the said best route based on
SET IBOOS value. The route with the maximum SET IBOOS value is selected as the best possible route.
LEACH Cluster Head – This algorithm is responsible for the selection of the Cluster Head in a particular zone or a cluster.
Hops Comparison – This component deals with comparing the number of intermediate nodes (Hops) between the sender and destination node.
Energy Comparison – Since energy is consumed in transferring the control packets between source node and destination node, we need to find a way out to calculate this energy with respect to our design and compare the same with the existing approaches in the same area. The energy can be calculated by means of equation as below:
TE c
 i
N  l

1
E c
( i )
Where,
l

E
tx c


2 *
E tx

E
am p d

 amp


tan

Power Comparison – Power consumption is one of the main criteria on the basis of which an algorithm can be evaluated in terms of the efficiency. Thus we need to compare our designed algorithm with the existing ones in terms of power consumption. The total power consumption of the route is defined as:
TP c
 i
N  l

1
P c
( i )
Where,

l
(
)

is given by the relation:
ISSN: 2231-5381 http://www.ijettjournal.org

International Journal of Engineering Trends and Technology (IJETT) - Volume 21 Number 1 - March 2015
c


1

t

t


tan

0
  
1
The environment factor values for the different environments in the WSN network are:
TABLE 1 Various Environmental Factors affecting WSNs
Environment Factor
Standard
Value
0.5
Rainy
>42
0.07
0.8
<30 0.0654
End to End Delay or Route Discovery Time – The end to end delay is the time taken for a control packet to traverse from source node to destination node and come back. It can be calculated using the formula given below:
RDT
 t stop
 t start t stop

Time at which RRPLY is recieved at the source node t start

Time at which RREQ is int iated at the source node
Sleep and Non Sleep (Alive) Nodes – Sleep nodes are the nodes which have not participated in routing. Non Sleep nodes are the nodes which participated in routing while the packets were transferred from sender to the destination node.
Fig. 3 Input for SET IBOOS and LEACH algorithms.
The outputs obtained after executing the sequence of input steps are compared. The convention used in all the output results is that ‘Algo 1’ corresponds to SET IBOOS algorithm and ‘Algo 2’ corresponds to the already existing LEACH algorithm.
The following figure Fig. 4 shows the comparisons between the energy consumption of the said algorithms.
IV.
R ESULTS AND C ONCLUSIONS
In this section of the paper we are going to focus on the results obtained when we have compared the existing LEACH algorithm with the one designed in this paper (SET IBOOS based on trust algorithm). There are a number of parameters which can be compared and on the basis of which we can conclude which algorithm is more efficient, reliable and robust. However, we decide to take the major parameters like
Energy Consumption, Power Consumption as the basis on which the two algorithms can be compared.
The sequence of steps which we have gone through while simulating the algorithm include – giving the input to the algorithm to work upon, setting the cluster end points, feeding the input related to node deployment and creation of the topology.
The input to the algorithm is depicted in Fig. 3 as follows
Fig. 4 Energy consumption Comparison
As is clear from the figure above that the energy consumed by the SET IBOOS algorithm is very less as compared to the existing LEACH algorithm.
Figure shown in the Fig. 5 below shows the comparison between the power consumption levels between the two algorithms. The power consumed by the SET IBOOS is less as compared to the power consumed by the existing LEACH algorithm. Keeping in mind the two factors discussed so far we can conclude that the SET IBOOS algorithm is much efficient than the LEACH algorithm.
ISSN: 2231-5381 http://www.ijettjournal.org

International Journal of Engineering Trends and Technology (IJETT) - Volume 21 Number 1 - March 2015
Fig. 5 Power Consumption Comparison
Also we need to compare the end to end time delay between the said algorithms to make sure which one is more reliable.
Fig 6 shows the end to end time delay comparison between the two algorithms. It can be easily concluded that the end to end time delay of SET IBOOS algorithm is much lesser as compared to the existing LEACH algorithm.
[4] N. Bulusu, J. Heidemann, and D. Estrin, GPS-less Low Cost Outdoor
Localization for Very Small Devices, IEEE Personal Communications
Magazine, October 2000.
[5] A. Manjeshwar, Q.-A.Zeng, and D. P. Agrawal, “An analytical model for information retrieval in wireless sensor networks using enhanced
APTEEN protocol”, IEEE Trans. Parallel Distrib. Syst., vol. 13, 2002.
[6] T. He, P. Vicaire, T. Yan, Q. Cao, L. Luo, L. Gu, G. Zhou, J. Stankovic, and T. Abdelzaher, Achieving Long Term Surveillance in VigilNet,
Infocom, April 2006.
[7]
H. Lu, J. Li, and H. Kameda, “A Secure Routing Protocol for Cluster-
Based WSNs Using ID Based Digital Signature,” in Proc. IEEE
GLOBECOM, 2010.
[8] R. Yasmin, E. Ritter, and G. Wang, “An Authentication Framework for
Wireless SensorNetworks using Identity-Based Signatures,” in Proc.
IEEE CIT, 2010.
[9] Hanady M. Abdulsalama, Bader A. Alia, Anwar AlYatamab, Eman S.
AlRoumia, “Deploying a LEACH Data Aggregation Technique for Air
Quality Monitoring in Wireless Sensor Network”, ELSEVIER 2014.
[10] Salim EL KHEDIRI, Nejah NASRI, Anne WEI, Abdennaceur
KACHOURI, “A New Approach for Clustering in Wireless Sensors
Networks Based on LEACH”, ELSEVIER – 2014, International
Workshop on Wireless Networks and Energy Saving Techniques
(WNTEST).
Fig. 6 End to End Time Delay Comparison
From all the comparisons performed we can conclude that the proposed SET IBOOS algorithm in this paper consumes less energy and power. Hence the algorithm is more reliable as compared to the existing algorithms. Also the end to end delay time taken by the proposed algorithm is less as compared to the existing algorithm. Thus the algorithm is more reliable as compared to the existing algorithms.
R EFERENCES
[1] Jiang Zhu, Chung-Horng Lung and Vineet Srivastava, “A hybrid clustering technique using quantitative and qualitative data for wireless sensor networks” ELSEVIER – 2015
[2] Prabhudutta Mohanty and Manas Ranjan Kabat, “A Hierarchical
Energy Efficient Reliable Transport Protocol for Wireless Sensor
Networks”, Ain Shams Engineering Journal (2014) 5, 1141–1155
[3] N.S. Fayed , E.M. Daydamoni, and A. Atwan, “Efficient combined security system for wireless sensor network”, Egyptian Informatics
Journal (2012) 13, 185–190
ISSN: 2231-5381 http://www.ijettjournal.org