SlideShare a Scribd company logo
1 of 58
Download to read offline
An Improvment in ERTLD Protocol for Mobile
wireless sensor network
A Thesis submitted in partial fulllment of the requirements for the
award of the degree of
Master of Technology
in
CSE (ADVANCED NETWORK)
by
Vishnu Kumar Prajapati
(2012AN020)
ATAL BIHARI VAJPAYEE
INDIAN INSTITUTE OF INFORMATION
TECHNOLOGY AND MANAGEMENT
GWALIOR-474015
2014
Checklist
# Items Declaration
1. Is the thesis/report bound as specied? Yes No
2. Is the Cover page in proper format as given in Annexure 1 of
guidelines for thesis preparation?
Yes No
3. Is the Title page (Inner cover page) in proper format? Yes No
4. I.Is the Certicate from the Supervisor in proper format? Yes No
II.Has it been signed by the Supervisor?
5. I.Is the Abstract included in the thesis/report properly writ-
ten within 400 to 600 words?
Yes No
II.Have the technical keywords (not more than six) specied
properly?
6. Have you included the List of Abbreviations/Acronyms in the
thesis/report?
Yes No
7. Does the thesis/report contain a summary of the literature
survey?
Yes No
8.
Does the Table of Contents include page numbers? Yes No
I.Are the Pages numbered properly? (Chapter 1 should start
on page number 1)
II. Are the Figures numbered properly? (Figure Numbers
and Figure Titles should be only at the bottom of the gures)
III.Are the Tables numbered properly? (Table Numbers and
Table Titles should be only at the top of the tables)
IV. Are the Titles for the Figures and Tables proper and
sources acknowledged?
V. Are the Appendices numbered properly? Are their titles
appropriate?
9. Have you incorporated feedback received during various stages
of evaluation?
Yes No
10.Is the Conclusion of the thesis/report based on discussion of
the work?
Yes No
11.
I. Are References or Bibliography given at the end of the
thesis/report?
Yes No
II.Have the References been cited properly inside the text of
the thesis/report?
III.Is the citation of References in proper format?
12.Is the thesis/report format and contents are according to the
guidelines?
Yes No
ii
Candidate Declaration
I hereby certify that I have properly checked and veried all the items as
prescribed in the checklist and ensure that my thesis/report is in proper format
as specied in the guideline for thesis preparation.
I also declare that the work containing in this report is my own work. I,
understand that plagiarism is dened as any one or combination of the following:
1. To steal and pass o (the ideas or words of another) as one's own
2. To use (another's production) without crediting the source
3. To commit literary theft
4. To present as new and original an idea or product derived from an existing
source.
I understand that plagiarism involves an intentional act by the plagiarist
of using someone else's work/ideas completely/partially and claiming author-
ship/originality of the work/ideas. Verbatim copy as well as close resemblance
to some else's work constitute plagiarism.
I have given due credit to the original authors/sources for all the words, ideas,
diagrams, graphics, computer programmes, experiments, results, websites, that
are not my original contribution. I have used quotation marks to identify verbatim
sentences and given credit to the original authors/sources.
I arm that no portion of my work is plagiarized, and the experiments and
results reported in the report/dissertation/thesis are not manipulated. In the
event of a complaint of plagiarism and the manipulation of the experiments and
results, I shall be fully responsible and answerable. My faculty supervisor(s) will
not be responsible for the same.
Signature:
Name:Vishnu Kumar Prajapati
Roll No.2012 AN 20:
Date: //-
iii
Abstract
Mobile Wireless Sensor Network (MWSN) is act as wireless ad hoc network which
consists of large number of nodes and mobile nodes, which are communicating to
each other. In real time routing protocol has capabilities to mobility and sens-
ing within a range. As we know in the sensor nodes have a limited of power
energy, processing and data storage when Enhenced Real Time Routing Protocol
with Load Distribution (ERTLD) can take a replica in the Personal Area Network
(PAN) Coordinator, if PAN Coordinator is fail or below of threshold than Voice
PAN Coordinator work as a PAN Coordinator. Voice PAN coordinator overall
network life time increase 30% compare to ERTLD protocol.
In ERTLD protocol is used corona width, if transmission range is tilding some
angle than corona width are less than the transmission range, so that the perfor-
mance and throughput are increasing. Improvement Enhenced Real time Routing
Protocol (IERTLD) is used backward mechnism. The backward mechnism give
better performance compare to other techniques such as Fast farwarding etc.
Keywords- Corona Mechanism, Mobile sensor node, Delivery ratio, End-to-
end delay, packet reception rate and Network Life Time.
iv
Acknowledgement
I am highly indebted to Mr. Nirmal Robertsand obliged for giving me the
autonomy of functioning and experimenting with ideas. I would like to take this
opportunity to express my profound gratitude to him not only for his academic
guidance but also for his personal interest in my thesis and constant support cou-
pled with condence boosting and motivating sessions which proved very fruitful
and were instrumental in infusing self-assurance and trust within me. The nur-
turing and blossoming of the present work is mainly due to his valuable guidance,
suggestions, astute judgement, constructive criticism and an eye for perfection.
My mentor always answered myriad of my doubts with smiling graciousness and
prodigious patience, never letting me feel that I am novices by always lending an
ear to my views, appreciating and improving them and by giving me a free hand
in my report. It's only because of his overwhelming interest and helpful attitude,
the present work has attained the stage it has.
I also express my deep and immense gratitude to Prof. ShashikalaTapaswi.
Their encouragement and constructive criticisms have contributed immensely to
the successful completion of this work.
Finally, I am grateful to our Institution and colleagues whose constant encour-
agement served to renew my spirit, refocus my attention and energy and helped
me in carrying out this work.
Date:  Vishnu kumar Prajapati
v
Contents
Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv
List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix
List of Abbreviations . . . . . . . . . . . . . . . . . . . . . . . . . . . . x
1 Introduction 1
1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.3 Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.4 Objective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.5 Thesis Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2 Literature Review 8
2.1 Wireless Sensor Network . . . . . . . . . . . . . . . . . . . . . . . 9
2.1.1 Sensor Network Challenges . . . . . . . . . . . . . . . . . . 11
2.1.2 Characteristics . . . . . . . . . . . . . . . . . . . . . . . . 13
2.1.2.1 Network Topologies . . . . . . . . . . . . . . . . 13
2.1.2.2 Application Specic . . . . . . . . . . . . . . . . 14
2.1.2.3 Environment . . . . . . . . . . . . . . . . . . . . 14
2.1.2.4 Types of Nodes . . . . . . . . . . . . . . . . . . . 14
2.1.2.5 Resource Constraints . . . . . . . . . . . . . . . 14
2.1.2.6 Fault Tolerance . . . . . . . . . . . . . . . . . . 15
2.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
2.3 Routing Protocol In Wireless Sensor Network . . . . . . . . . . . 15
2.3.1 Location Based Routing . . . . . . . . . . . . . . . . . . . 15
2.3.2 Hierarchical Routing . . . . . . . . . . . . . . . . . . . . . 16
2.3.3 Geographic adaptive delity . . . . . . . . . . . . . . . . . 16
2.3.4 Flat Network Routing . . . . . . . . . . . . . . . . . . . . 17
2.3.5 Geographic and Energy Aware Routing . . . . . . . . . . 17
2.3.6 SPEED . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
2.4 Routing Challenges and Design Issue . . . . . . . . . . . . . . . . 18
2.4.1 Transmission Media . . . . . . . . . . . . . . . . . . . . . . 18
vi
2.4.2 Node Deployment . . . . . . . . . . . . . . . . . . . . . . . 18
2.4.3 Network Dynamics . . . . . . . . . . . . . . . . . . . . . . 19
2.4.4 Node Mobility . . . . . . . . . . . . . . . . . . . . . . . . . 19
2.4.5 Scale and Density . . . . . . . . . . . . . . . . . . . . . . . 19
2.4.6 Coverage . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
2.4.7 Connectivity . . . . . . . . . . . . . . . . . . . . . . . . . . 20
2.4.8 Quality of Service . . . . . . . . . . . . . . . . . . . . . . . 20
2.4.9 Energy Consideration . . . . . . . . . . . . . . . . . . . . . 20
2.4.10 Data Aggregation . . . . . . . . . . . . . . . . . . . . . . . 21
2.4.11 None Capabilities . . . . . . . . . . . . . . . . . . . . . . . 21
2.4.12 Fault Tolerance . . . . . . . . . . . . . . . . . . . . . . . . 21
3 Propose IERTLD Protocol Design 22
3.1 IERTLD Protocol Design . . . . . . . . . . . . . . . . . . . . . . . 23
3.1.1 Corona Management . . . . . . . . . . . . . . . . . . . . . 23
3.1.2 Routing management . . . . . . . . . . . . . . . . . . . . . 26
3.1.2.1 Forwarding Mechanism . . . . . . . . . . . . . . . 26
3.1.2.2 Routing problem handler . . . . . . . . . . . . . 27
3.1.2.3 Optimal forwarding . . . . . . . . . . . . . . . . . 28
3.1.3 Neighbour management . . . . . . . . . . . . . . . . . . . 28
3.1.4 Power management . . . . . . . . . . . . . . . . . . . . . . 28
3.2 Voice PAN Coordinator . . . . . . . . . . . . . . . . . . . . . . . 29
4 Implementation Detailed 30
4.1 System Requirements . . . . . . . . . . . . . . . . . . . . . . . . . 30
4.1.1 Hardware Requirements . . . . . . . . . . . . . . . . . . . 30
4.1.2 Software Requirements . . . . . . . . . . . . . . . . . . . . 30
4.1.3 Operating System and Memory . . . . . . . . . . . . . . . 31
4.2 Computer Simulations . . . . . . . . . . . . . . . . . . . . . . . . 31
4.2.1 Existing WSN Simulators . . . . . . . . . . . . . . . . . . 31
4.3 Introduction to the NS-2 Network Simulator . . . . . . . . . . . . 32
4.3.1 Architecture of NS-2 . . . . . . . . . . . . . . . . . . . . . 33
4.3.2 Running Simulations . . . . . . . . . . . . . . . . . . . . . 33
4.3.2.1 Scenaios . . . . . . . . . . . . . . . . . . . . . . . 34
4.3.2.2 Nodes . . . . . . . . . . . . . . . . . . . . . . . . 34
4.3.2.3 Agents . . . . . . . . . . . . . . . . . . . . . . . . 35
4.3.2.4 Traces Files . . . . . . . . . . . . . . . . . . . . . 35
4.3.3 Adding Protocols to NS2 . . . . . . . . . . . . . . . . . . . 35
vii
4.3.3.1 Adding the New Agent to NS . . . . . . . . . . . 35
4.3.4 Overview of Mobile Node in NS2 . . . . . . . . . . . . . . 36
5 Simulation and Results 37
5.1 NS-2.35 ow graph . . . . . . . . . . . . . . . . . . . . . . . . . . 38
5.2 NS-2.35 Implementation ow graph . . . . . . . . . . . . . . . . . 38
5.3 How to get result . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
5.4 Result based on static sensor network . . . . . . . . . . . . . . . . 41
5.5 Result based on Mobile sensor network . . . . . . . . . . . . . . . 43
6 Conclusion and Future work 45
6.1 Conclustion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
6.2 Future work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
viii
List of Figures
1.1 Wireless Sensor Netwrok . . . . . . . . . . . . . . . . . . . . . . . 3
1.2 MWSN Architecture . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.1 Sensor Network Applications . . . . . . . . . . . . . . . . . . . . . 16
3.1 IERTLD Block Diagram . . . . . . . . . . . . . . . . . . . . . . . 23
3.2 Corona mechanism eects : MWSN immediately after deployment 24
3.3 MWSN using corona concentric to PAN coordinate . . . . . . . . 25
3.4 PAN after traveling and changing of MWSN PAN coordinate system 26
3.5 Voice PAN Coordinator work as PAN coordinator when PAN co-
ordinator is fail or below of threshold value . . . . . . . . . . . . . 29
4.1 OTcl/C++ Duality show . . . . . . . . . . . . . . . . . . . . . . . 33
4.2 Mobile Nodes architecture . . . . . . . . . . . . . . . . . . . . . . 36
5.1 Train of technology . . . . . . . . . . . . . . . . . . . . . . . . . . 37
5.2 Flow graph in NS-2.35 . . . . . . . . . . . . . . . . . . . . . . . . 38
5.3 Process description in ns-2.35 with implementation by representa-
tion of the directory format . . . . . . . . . . . . . . . . . . . . . 39
5.4 Awk command run on trace le and nd such .txt le for making
results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
5.5 packet rate v/s energy per packet . . . . . . . . . . . . . . . . . . 41
5.6 packet rate v/s Average EtE Delay . . . . . . . . . . . . . . . . . 42
5.7 Packet rate v/s Delivery ratio . . . . . . . . . . . . . . . . . . . . 42
5.8 Packet rate v/s Normalized packet overhead . . . . . . . . . . . . 42
5.9 packet rate v/s energy per packet . . . . . . . . . . . . . . . . . . 43
5.10 packet rate v/s Average EtE Delay . . . . . . . . . . . . . . . . . 43
5.11 Packet rate v/s Delivery ratio . . . . . . . . . . . . . . . . . . . . 44
5.12 Packet rate v/s Normalized packet overhead . . . . . . . . . . . . 44
ix
List of Abbreviations
CCP-ID Corona Control Packet Identity
C-ID Corona Identity
ERTLD Enhenced Real time with load Distribution
IERTLD Improvement in Enhenced Real time with load Distribution
LN Local Neighbour
MS Mobile Sink
MN Mobile Node
NM Neighbour Management
OF Optimal Forwarding
PM Power Management
RM Routing Management
RSSI Received Signal Strength Indicator
CCP Corona Control Packet
CD Corona Discovery
LM Loction Management
MWSN Mobile Wireless Sensor Network
ND Neighbour Discovery
NS-2 Network Simulator-2
NT Neighbour Table
PE Performance Evaluation
ND Neighbour Discovery
PRR Packet Reception Rate
RPH Route Problem Handler
RTR Request to Route
x
Chapter 1
Introduction
There was development in the eld of wireless technology such as micro electrical
mechanical systems (MEMS) [1,2]. In these form of technology, through radio
communication small tiny (sensor) nodes may be formed, that have the capability
of communication, sensing and computing in a specic short range. Such nodes
have the capability to perform the sensing collaboratively but it will not give
precise results if monitored by a sensor. It also has the capability to form an
autonomous intelligent network that may do an unattended management.
A WSN is collection of nodes with computing, sensing, and communication capa-
bilities. In this technology, sink node has the capability to communicate internal
nodes with outside world according to topology. Such networks have the activ-
ities and phenomenon monitoring capabilities, that cannot be monitored easily
by human beings, such as sight of environment monitoring, some chemical eld
monitoring and nuclear accident over long period of time. The main characteristic
of these networks [2] is continuously changing topology, through the scheduling
of the nodes in a network into dierent states, such as dying nodes and wake up
states or sleep in the network, autonomous intelligent network management, dense
deployment of the network, limited bandwidth, limited storage capacity, limited
node energy [1] and multi-hop communication.
1.1 Background
A WSN is a group of microcomputers that is called sensor nodes. It has the
capability of collaboration in the common task, it also have the capability of
communication in the wireless that may be allow a small microcontroller and an
1
energy source [1] and the formation of the network. In the sensor networks, the
infrastructure of the networks does not exist, so that the nodes may act as router,
receiver and emitter. In networks all the nodes send their respective information
(which every one have collected) to a base station or sink node [3]. Wireless
sensor network consists of many microcomputers (sensor nodes), that are sensing
and communicating with each other. In WSN, sensors collect information about
the sink node or base station and physical world (outside of the sensor network
like computer and other machine) performs appropriate action and makes decision
upon the condition. It is dierent from simple or traditional network s as it is
compare action upon the environment as shown the following g 1.1. It is consist
of a huge number of sensor nodes that produce innumerable data [7]. However,
the wireless sensor network does not free to restriction of computational, power,
and memory capacity. Due to such kind of properties, another management is not
ecient to manage sensor network. In the real time sensor network communication
is needed in a large number of wireless sensor network application for example a
cricket match, the batsman where proper action should be made in that event
exactly as delay can cause the boll hit to the wickets that batsman goes to out
[1].
After that, wireless sensor networks have several applications in several elds like
military surveillance, environmental or medical monitoring [4], domestics, etc.
Such types of characteristics are shown the following:
• It used limited power supplies
• Self conguring.
• Easy to deployment
• Communication between nodes may failures.
• Dynamic network topologies.
• Node may failures.
On that time research of sensor network is towards to particular communication
and routing protocol and it is good to used attending the characteristics of these
2
Figure 1.1: Wireless Sensor Netwrok
networks [5,6]. However, the protocol may be monitor their sources of that nodes,
such as example, will change the routing topology, the data can be aggregated
to reduce the actual data transmission in the sink node (PAN coor) while man-
aging the eectively data or transmission of data and using good time schemes
of transferring data, the sink node or other sensor nodes can have sleep mode
than the order to save energy while they are not working or they are idle. To
work eectively, wireless sensor networks protocols must handle dierent issues,
such as energy of the sensors, routing information, data transmission to base sta-
tion, Routing Hole Problem, etc. By A Ahmed Mobile Wireless Sensor Network
(MWSN) is a collection of distributed mobile sensor nodes that have the capabil-
ity of moving, communicating, and sensing within its range. The MWSN consist
of moving sensor (Laptop or PDA) and static sensor nodes as shown the Fig 1.2.
It may have mobile sink node and mobile node to communicating among them.
Each sensor nodes have the capabilities of collecting data and routing these data
peer to peer to base station. It has not only static capabilities but also have the
mobility capabilities by adding robotic based. A PAN coordinator is used as a
bridge between the sensor network and other device such as laptop or network
3
or platform. The mobile sensor nodes have several advances such as scalability,
maintain load balancing, and conserve energy. In MWSN can have more challenge
compare to WSN that are dicult to send a routing path, processing, storage ca-
pacities and energy, each node needs to eective resource management policies [8].
Several applications lead to several architectures and design constraints. Since the
performance of a real time routing protocol is relate well to architectural model,
such as tree base, star base and cluster based architecture. As we have shown the
following mobile wireless sensor network architecture, there are some node have
static and some other have moveable capability.
Figure 1.2: MWSN Architecture
1.2 Motivation
In the IERTLD protocol has a good packet delivery ratio and expecte minimum
end to end delay in wireless sensor network and mobile wireless sensor network
compare to other routing protocol. We propose a (20%, 30% and 40%) dynamic
wireless sensor network in which sensor nodes and the PAN Cooradinator nodes
are mobile. It computes the optimal forwarding node (routing technique) based
on Received Signal Strength Indicator so that the computing time is reduced. It
4
also increases the packet lifetime in the network. By using Corona mechanism,
it broadcast the packet to the one hop for every next one hop after that it work
backward corona mechanism and each node have the capability if node a not
forward the packet it backward it reduced the overhead and routing hole problems.
1.3 Problem Statement
Unlike other networks Wireless Sensor Network suer from the problem of low
battery power of sensor nodes and in multi hop routing it suer routing hole
problem. To deal with such problem dierent routing protocols are presented and
also discussed by the research community. These protocols are using dierent
techniques to overcome such problem. In the RTLD and ERTLD protocol is one
of the solutions to deal with the problem of low sensor energy by avoiding the
data transmission directly to Base Station and optimum forwarding is reduced
the routing hole problem. The objectives of ERTLD protocol are given here.
• Reduced the communication overhead
• Reduced the routing hole problem in static and dynamic network.
• Increase the delivery ratio
• Save the Power in network as well as sensor nodes
• It uses corona mechanism to broadcasting and Unicasting, so reduced the
delay between sink nodes to destination or mobile nodes.
• Reduce network trac and the contention for the channel
Real time protocol is one of the ecient protocols to overcome these problems.
I also choose Real time protocol to reduce such problems. I have found some
problem in the Real Time routing protocols as RAP, RTLD, SPEED, MM-SPEED
and ERTLD.
• In the dynamic network the routing hole problem is increase.
• If the sink node is fail or below of threshold than the whole network is fail
or need to reestablishment a new sink node.
5
• There are need some channel assignment technique to reduce the channel
overhead
• In the mobile sensor need to manage mobile node management, that reduced
the complexity problem.
• Corona mechanism are apply but corona id is equal to transmission range,
if transmission range is tilding some environmental condition than the Un-
reachability problem can occur.
For that I want to propose a new routing protocol that works same as ERTLD but
overcome above problems. For that I am work on Improved ERTLD (IERTLD)
Protocol and expect that my proposed solution will outperform ERTLD.
1.4 Objective
Real time routing protocol is widely using in WSN. In Real Time Routing Protocol
for Wireless sensor network (RTLD) works as a centric sink node and there are
multi hope routing with respect to sink node. RTLD protocol is developed by
A. Ahmed, N. Fisal in 2008. After that 2013 by A. Ahmed developed a ERTLD
protocol based on previous RTLD protocol. It works on Mobile Wireless Sensor
(MWSN) with load distribution and it also use corona mechanism to reduced the
routing hole problem and neighbor management. Main objective of this thesis is
to Improvement ERTLD protocol and achieved the following goal.
• To increase the total life time in WSN and MWSN.
• To achieved the minimum EtE delay and high packet delivery ratio.
• To reduced the Routing Hole problem.
• To increase the performance.
1.5 Thesis Outline
This thesis is organized in 6 chapters where Literature survey in given in chapter
2 and discussion of Real Time Routing Protocol and proposed methodology is
given in chapter 3, where discussion of tools used. The analysis and design of
6
the project is discussed in chapter 4, chapter 5 discussed about implementation
of project with results and nally conclusion and future work is given in chapter
6.
7
Chapter 2
Literature Review
WSN have important role in wireless technology. WSN s are consisting of thou-
sands of nodes, each node having limited communication power, sensing capability
and computational power [1] [2]. The networks have the capability of deploy a
large-scale sensor network. A wireless network consists of small devices which
monitor physical or environmental conditions such as pressure, pollutants or mo-
tion and temperature etc. at similar but another areas, Such as sensor networks
are expecte to be dierent widely deployed in a vast variety of environments for
civil, military and commercial applications such as climate, acoustic data gath-
ering, vehicle tracking, medical, surveillance, habitat monitoring and intelligence.
The limitations of WSN are the power, storage, processing. Such limitations and
the specic architecture of sensor nodes call for secure communication and energy
ecient protocols. The reasonable of such inexpensive sensor networks is acceler-
ated by the advances in Micro Electro Mechanical Systems technology, combined
with radio frequency circuits, low cost digital signal processors and low power [9].
By the Gupta, G. Younis consist of power supply, microcontroller, radio transceiver,
and the actual sensor. The sensing circuitry measures ambient condition related
to the environment surrounding the sensor and transforms them into an electric
signal [10]. Processing such a signal reveals some properties about objects located
and/or events happening in the vicinity of the sensor. The sensor sends these col-
lected data, usually via radio transmitter, to a command sink node either directly
or through a data concentration center.
Sensor nodes are spatially distributed apart from the region that has to be moni-
tored, self-organize in to a network via wireless communication, and it collaborate
8
with each other to do the common task. Basic and simple features of sensor
networks are dynamic network topology, mobility of nodes, selforganizing capa-
bilities, node failures, multi-hop routing, limited power, large scale of deployment
and short-range broadcast communication [11]. Strength of the wireless sensor
network lies in their scalability and exibility. The capability of wireless com-
munication and self-organize made them to be deployed in ad-hoc fashion in re-
mote hazardous location without the need of any existing infrastructure. Through
multi-hop communication a sensor node may communicate other sensor node that
is far away in the sink node or sensor network. This is allow the addition of sensor
nodes in the network to expand the monitored area and hence proves its exibility
and scalability property. The main challenge in sensor networks is to maximize
the lifetime of sensor nodes due to the fact that it is not feasible to replace the
batteries of thousands of sensor nodes. Therefore, communication protocols must
be made as energy ecient and computational operations of nodes as possible.
Among such kind of protocols have more importance in terms of energy, since
the energy required for data transmission it takes 70% of the total energy con-
sumption of a wireless sensor network [2]. Now a day there are dierent types
of commercially available sensor nodes. University of California at Berkeley has
developed Mica mote that is a special purpose sensor node. Other special purpose
sensor nodes available are Spec, Rene, Mica 2, Telos etc. Some high bandwidth
sensor nodes available are BTNode, Imote1.0, Stargate, Inryonc Cerfeube etc. [12].
2.1 Wireless Sensor Network
WSN is potentially one of the most important technologies of recent century.
There recent advancement in wireless communications and electronics has enabled
the development of low-power, low-cost, multifunctional miniature devices for use
in several real time applications. The combination of these factors has improved
the viability of utilizing a sensor network. It is consisting of a large number of
intelligent sensors, processing analysis, enabling the collection and dissemination
of valuable information gathered in several varieties of environments.
By C. Lu and at all a wireless sensor network for real time routing protocol are
9
classied into two category one is RT routing protocol for wireless sensor network
and another are real time routing protocol for mobile wireless sensor network.
Several protocols work on WSN and MWSN for routing based on velocity [14],
RAP (real time architecture and protocol) are provide service dierentiation in
the time lines domain by velocity- monotonic classication of packets. It depends
on packet deadline and destination, required velocity to calculate and need to
determine the priority in velocity-monotonic order there for high velocity packet
can be send earlier than a low velocity of them. SPEED and MM-SPEED [15],
protocol based on stateless which is real time communication in WSN. They work
EtE communication based on uniform communication speed in multi-hop in the
network. RTLD compute the optimal forwarding techniques based on packet re-
ception rate, remaining power and packet velocity over single hop of the sensor
nodes [16]. It gives better performance in terms of power consumption, control
packet overhead, delivery ratio.
ERTLD design for static WSN as well as for dynamic WSN work several protocol
like RACE work in MWSN, it provide quality of service requirements to the appli-
cation layer and it also handing network congestions, Routing done node by node,
where each node calculate the value that is known as score, to choose the best
node to forward the message. The score consist of packet velocity, buer remain-
ing and link quality [7]. Sidewinder protocol periodically predicts the current sink
location based (sink location prediction) on distributed knowledge of sink mobil-
ity among all node in a multihop routing process [17]. Such of the continuous
sink estimation was scaled and adjusted to perform with resource-constrained in
wireless sensors.
By the Author s show that the impact of radio ranges on topology changes when
nodes are mobile, we have conclude that traditional mobile ad-hoc routing proto-
cols does not work Well when Mobility present in the networks. In other paper,
the authors give test bed application that geographic forwarding based on sensor
node location have poor performance in terms of end-to end delay and delivery
ratio. It works well in static wireless sensor networks, but when mobility are
present it gives poor performances in end to end delay and delivery ratio, be-
cause only maintain local information to achieve end-to-end routing. However,
10
a common assumption of these geographic forwarding-based protocols is that all
intermediate nodes in a routing path know the exact sink location and use it for
multi-hop routing. This assumption is good when the sink node is static, but it
gives poor performance when the sink node is mobile. However, these protocols do
not design for real-time forwarding that needs end-to-end delay enhancement to
achieve good end to end delay and delivery ratio. By ERTLD protocol has corona
mechanism to maintain high performance and provide the mobility for MWSN
in end to end delay and delivery ratio. It used a backward corona mechanism to
solve the routing hole problem. It also produces more exibility to forwarding
[8], It compute the optimal forwarding node based on RSSI and work on highly
dynamic wireless sensor network, that reduce the unnecessary calculation time.
But ERTLD protocol work poor when tilding transmission range and highly dy-
namic the fast forwarding and network fail if PAN coordinator is fail or below of
threshold.
In the VLEACH routing protocol [18], reduce the energy consumption and increase
the total lifetime compare to the LEACH protocol. The LEACH protocol based
on cluster, but in the Real time protocol work with Network. When dierent-
dierent network are work then the voice sink node (like voice cluster head [8])
work and may increase the total lifetime compare to ERTLD protocol.
2.1.1 Sensor Network Challenges
WSN are used several real time applications such as public safety, physical world,
automotive, agriculture and airport etc. and to impact these applications in real
world environments, we are required more ecient and eective algorithms and
protocols. Designing a new algorithm or protocol, needs to explain some chal-
lenges [4]. These challenges are shown below:
• Deployment
Sensor network are infrastructure less, each sensor node have the capability
of random deployment. In the real life, there are several applications are
requires to ad-hoc deployment. Sensor networks, Sensor nodes have the ca-
11
pability of random deployment over the region without any prior knowledge
topology and infrastructure. Here the each node has the information about
connectivity and distribution among them.
• Scability
In the real time application most of them are needed scalability. In the net-
works, the number of sensor nodes deployed must be in order of hundreds,
thousands or more. The sensor network must be scalable to respond and
operate with such large number of sensor nodes.
• Fault-Tolerance
In the real time application, sensor node can fail or below of threshold value
due to lack of energy and physical damage. If some nodes fail, the working
protocols must accommodate these changes in the network. As an example,
for routing or aggregation protocol, they must nd suitable paths or aggre-
gation point if these kinds of failures.
• Quality of Service
Real time application, the sensor network need some applications are very
time critical that means the data should be delivered within a certain period
of time from the moment it is sensed, otherwise the data will be unusable.
such kind of application must be a QOS parameter.
• Unattended operation
Some application are required when some nodes are deployed once, and after
deployed once there are no need human intervention. Hence the sensor node
needs to themselves are responsible for any change or reconguration.
• Security
In the real time applications the security is most important parameter. In
12
the sensor network, security is very critical parameter. When data trans-
mit from one sensor to another, the security parameter have important role
for secure communication in the sensor network, unlike traditional networks
also focus on maximizing channel throughput with secure transmission.
• Physical Resource Constraints
The main constraint imposed of limited battery power in the sensor net-
work. Almost the time eective lifetime of a sensor node or sensor network
is directly determined by its power supply. Hence the energy consumption is
main issue for designing a protocol. Limited memory size and computational
power is another constraint that aects the computation and the amount
of data that may be stored in individual sensor nodes. The design protocol
should be light-weighted and simple. By the limited communication channel
in the sensor network the communication delay can be high.
2.1.2 Characteristics
Characteristics of sensor networks, which have some special features such as re-
source constraints, type of nodes, application specic, topology and fault tolerance
etc as shown below [13]:
2.1.2.1 Network Topologies
In the wireless sensor network have used several topologies such as mesh, star
and tree topology. It represents reachable ability of sensor nodes in the sensor
network. Some time the sensor nodes move from one position to another then the
WSN topology may be a dynamic. For example, the exiting nodes may fail due
to physical destruction or lack of energy and some new nodes may join the net-
work. Therefore, the sensor network must be able to recongure itself periodically
13
2.1.2.2 Application Specic
Most of the time wireless sensor networks tightly dependent upon the applica-
tions and application designs and management of architectures in wireless sensor
networks are also dependent on application semantics. We know about the ap-
plication designers, most of time they have to develop many complex and special
program to perform data routing, data aggregation tailored and node localization
to specic sensor networks applications.
2.1.2.3 Environment
Sensor networks are location geographic, the nodes can be deployed in hostile,
harsh and widely scattered environments. Such environments will rises to chal-
lenge other mechanisms like managements. And the other ways of the spectrum,
sensor nodes are occasionally deployed densely either in directly inside the envi-
ronment to be observed or close proximity of the environment to be observed.
2.1.2.4 Types of Nodes
WSN s involve with three types of sensor nodes names sink node, full function
node and reduced function nodes. Full function nodes are mainly responsible
for collecting sensor data, or occasionally involving with collaborated tasks with
neighborhood nodes. Due to limited storage full function nodes don t have extra
storage space to hold large amount of sensor data (or processed data). It may
take simply data processing if necessary. Other sink nodes responsible for broad-
casting, storing, processing and receiving of data from fully function or reduced
function nodes. Reduced function nodes that connect sink nodes. It doesn t have
capability to connect malty hope communication.
2.1.2.5 Resource Constraints
As mentioned previously, resource-constrains of sensor nodes is another unique
feature of WSNs. Sensor nodes usually compose of four basic units sensing unit, a
processing unit, a transceiver unit, and a power unit. The power unit supports all
14
the activities on a sensor node, including communication, local data processing,
sensing, etc. The lifetime of a sensor node is mainly determined by the power
supply since battery replacement is not an option in sensor networks, especially
in critical environments as battleelds or environment monitoring. The longer the
lifetime of a sensor, the more stable the WSN s.
2.1.2.6 Fault Tolerance
Failures are prone to happen in WSNs, which normally include sensor nodes failure
(as discussed previously), and communication failures etc. Although the sensor
application may have already considered this in their design, there is still a need
for WSN to have the ability to recongure and recover itself without too much
human being intervene, especially in inaccessible environment.
2.2 Applications
The WSN has several application of across the spectrum of human endeavors.
It has to control of environmental systems and monitoring such as engineering
manufacturing and design, forest re tracking, critical infrastructure protection,
battleeld surveillance, disaster management and health care. The real world
several applications are involving which have the capacity of sensed data collection
and dissemination are depicted as showing the following gure 2.1.1that the way
that data ow from its source to the anticipated sink.
2.3 Routing Protocol In Wireless Sensor Network
Routing protocol based on network as following.
2.3.1 Location Based Routing
The sensor networks are used several protocol for nding the route that is known
as routing protocol. Most of the routing protocols are requiring location infor-
mation for nding the path. For estimation of energy consumption, we need to
15
Figure 2.1: Sensor Network Applications
calculate the distance between two particular sensor nodes. Because, there is no
addressing scheme for sensor networks like IP-addresses and they are spatially
deployed on a region, the advantage of location information, it can be utilized in
routing information in an energy ecient way.
2.3.2 Hierarchical Routing
Hierarchical routing in the sensor network are use, to decrease the number of
transmitted messages to the sink node by using the data aggregation and fusion.
In the multihop communication [1] the hierarchical routing is to eciently main-
tain the energy consumption in sensor nodes.
2.3.3 Geographic adaptive delity
The energy aware routing protocols are used to inform neighbour selection heuris-
tics to route the packet towards a sink. By using direct diusion the restrict
number of interest are consider a certain region rather than whole network for
sending the interests This type of protocol are takes more energy conserves.
16
2.3.4 Flat Network Routing
The main advantage of at network architecture are the potential for the dis-
covery of multiple route s between communicating node s for fault tolerance and
including minimal overhead to maintain the infrastructure [10]. In the multihop
at network s, there is each sensor nodes typically plays the same role and col-
laborate to perform the sensing task. In the Large number of sensor node s or
large sensor network is not a feasible for assign a global identier to each node
due to data centric, where the sink node or base station sends queries to certain
regions and waits for data from the sensors located in the selected regions. Since
data is being requested through queries, attribute-based naming is necessary to
specify the properties of data. In the previous work on data centric routing (e.g.,
directed diusion and SPIN) was shown to save energy through data elimination
and data negotiation.
2.3.5 Geographic and Energy Aware Routing
It is an energy-aware location-based routing protocol and designed for mobile ad
hoc networks, but now a day it can be applicable to sensor network s or mobile
sensor networks. It is conserves energy by using the unnecessary nodes that is not
working or not using, turn o such unnecessary sensor nodes without aecting the
routing or level of routing delity. It creates the virtual grid to cover the area.
That the association of virtual grid are possible by using each node which is used
GPSindicated location. Such types of node association are equivalent in terms of
the cost of packet routing. So that the energy are saving and the network lifetime
are increased as many nodes energy are saved.
2.3.6 SPEED
A SPEED is a QoS routing protocol. Such protocols are provides soft real-time
end-to-end guarantees [5]. SPEED protocol is requiring maintaining node infor-
mation, such as its neighbors and uses geographic forwarding to nd the paths. It
also has the information about the speed to the each packet in the network that
17
each and every application may be estimate the end-to-end delay. It also has the
capability to making the decision and provides congestion avoidance. The routing
module in SPEED is called stateless geographic non-deterministic forwarding.
2.4 Routing Challenges and Design Issue
The WSN s have several restrictions, such as limited power consumption, limited
bandwidth links connective and limited energy supply. Routing challenge are one
of the main design goals of WSN s. The routing of WSN s are most important
challenging factors, routing challenging element must be overcome before ecient
communication will be achieving in WSN s. I have summarized in the following
some of the routing challenges as well as design issues that aect the routing
process in WSN s.
2.4.1 Transmission Media
In a multi-hop sensor network, communicating nodes are linked by a wireless
medium. The traditional problems associated with a wireless channel (e.g., fading,
high error rate) can also aect the operation of the sensor network. In general,
the required bandwidth of sensor data will be low, on the order of 1-100 kb/s.
Related to the transmission media is the design of medium access control (MAC).
One approach of MAC design for sensor networks is to use TDMA based protocols
that conserve more energy compare to contention based protocols as CSMA (e.g.
IEEE 802.11). Bluetooth technology may also be used [4].
2.4.2 Node Deployment
In the WSN s, the node deployment is one of the aecting parameter in the
routing protocol. The node deployment can be either randomized or deterministic.
In the deterministic, the node deployment is not a bit challenge but in random
node deployment, the infrastructure is creating in an ad hoc manner. The sensor
nodes are scattered randomly. If the deployment of node is not a uniform, then
the optimal clustering becomes important role to allow connectivity and enable
energy ecient network operation.
18
2.4.3 Network Dynamics
The sensor network has main three components which are monitoring events,
sensor nodes and sink node. We need a few of setup to utilize the mobile sensors.
Most of researchers are assume that the sensor nodes are stationary. And other
hand, sink node is sometimes deemed necessary, because it may be static or may be
mobile. And the event which is sensed may be either static or dynamic depending
on the application. For instance, the forest monitoring for early re prevention is
static events and in a target detection/tracking application is dynamic.
2.4.4 Node Mobility
Mobility of the sensor network has of both PAN Coordinator and sensor nodes.
Both of them are sometimes important depend s on applications. When routing
is performed then the moving nodes are more challenging and route stability will
become an important issue in the sensor network. There are some other parame-
ters like energy, bandwidth and others like sensed phenomenon may be static or
dynamic depends on the application. If it is dynamic for detection/tracking then
the dynamic events more applicable while it is static then static events are more
applicable [4].
2.4.5 Scale and Density
The scaling of the sensor network s are deployments of the node in the sensing
area. There are may be hundreds or thousands or more nodes in the deployment
area. In the deployment of the sensor node are necessary to apply the any one
routing scheme and sensor network routing protocols should be scalable and also
respond to events when require. The density, only parts of the area of covered
by the sensor nodes. Which are dense in the form of sensor nodes like how many
nodes are present per square area, the area of interest is completely covered by
sensor nodes. Some time multiple sensor nodes cover the same area. The network
lifetime can be extended by switching the redundant sensor nodes to power-saving
sleep modes.
19
2.4.6 Coverage
WSN has a limited area covered by using several sensor nodes and each sensor
node also have the limited range as well as accuracy. Here sensor nodes have
covered only limited physical area of the environment. Hence, the how much area
is covered is also an important design parameter [4].
2.4.7 Connectivity
The connectivity is depends on the random distribution of sensor nodes [4]. Such
connectivity can be as topology. Need to highly connected network for the purpose
of strong connection. If the sensor nodes are not deployed appropriate so the
network topology can not be work appropriate. Hence the connectivity becomes
an important role of design parameter.
2.4.8 Quality of Service
The quality of service is also the important design parameter in the sensor network
because of some applications data should be need to delivered within a certain pe-
riod of time from the moment when it is sensed otherwise the data will be useless.
So there is some limitation for minting the quality of service because of condition
applications as time-constrained applications. Some other many applications, as
energy conservation, that is related to network lifetime, it is more important than
the quality of data sent.
2.4.9 Energy Consideration
The node lifetime is show a strong dependency on the battery lifetime [1] in the
sensor network. Sensor nodes have limited energy and limited processing power.
But the essential need of communication and computation. The sensor network
has multi hop communication then, each node plays a dual role as data router and
data sender. Some sensor nodes failure due to power failure, so need to change
the topological signicant and might be require rerouting of sensor networks [4].
Multi-hop routing is consuming less energy than direct communication.
20
2.4.10 Data Aggregation
Data aggregations in the sensor network are used to reduced the fault or make too
sure that the delivery ratio will increase. Since sensor nodes can be generating
signicant redundant data. Data aggregation is technique to combine data from
dierent sources and apply the same function like minima, maxima, duplicate,
average and suppression [4] and these functions can be performed either partially
or fully in each sensor node.
2.4.11 None Capabilities
The sensor node has dierent capabilities in the sensor network. In the previous
work some researcher s assume that all sensor nodes are homogenous. So that
such nodes have equal capacity in terms of power, communication and computa-
tion. But depending on applications a sensor node may be dierent in term of
this capacity and a particular function such as sensing aggregation and relaying.
2.4.12 Fault Tolerance
The sensor network has hundred s or thousand s of sensor nodes, some nodes
may be going to below of threshold value or it may be fail or do not able to work,
Due to physical damage, lack of power and environmental interferences . These
nodes are going to fail. The whole network will aect but by managing such
failure should not be aect the overall task of the sensor network. By using MAC
and routing protocols will not aect many nodes fail, because routing protocol
and MAC must accommodate formation of routes and new links where the data
can be sends or received to or from sink nodes. Fault tolerance may needs to
actively adjusting transmit powers as well as signaling rates on the existing links
to rerouting packets through regions and to reduce energy consumption of the
network where more energy is available. Therefore, multiple levels of redundancy
may needs in a fault tolerance in the sensor networks [4].
21
Chapter 3
Propose IERTLD Protocol Design
In the ERTLD Protocol have four elds which are power management, routing
management, corona mechanism and neighbor management. The previous pro-
tocol RTLD based on location management in place of corona mechanism. The
location management techniques are calculating the sensor node based on three
pre determine location of the neighbored nodes, When static WSN it work well
but the mobility it not work eective, the ERTLD work with corona mechanism in
place of location management. The previous protocol (RTLD) is compute optimal
forwarding node based on packet velocity over one hop, remaining power of sensor
nodes and PRR. PRR can be calculated approximately as the probability of re-
ceiving successfully a packet between two or more neighbor and reects the very
dierent link qualities within the corona width, and it also decreases the calcula-
tion time by utilizing RSSI. The RSSI value is built-in physical layer, so no need
to require extra calculation. If a sensor node or mobile sensor node does not able
to forward packets to the neighbour or the next-hop neighbor, the mobile node
have capable to do backwards mechanism, which is a mechanism to backwards the
packet to the high corona level to any neighbour, which can follow the optimal
path and it will inform its parent to stop the sending packet. that the parent node
will select to forward the new neighbour nodes, so that the routing hole problem
can be reduced. And the each node has the autonomous body and it will select
new forwarding nodes. The backward mechanism provides the guarantees to stop
the dropping of data packet in the sensor nodes and mobile sensor nodes or its
parent. Such types of mechanism are not founded on previous protocols.
22
3.1 IERTLD Protocol Design
The IERTLD have same four elds in the previous protocol, but we manage the
corona birth and there is corona ID is always less the transmission range in a
sensor node. We have shown the following g 3.1, so that there are total four
elds which are corona management, neighbour management, power management
and routing management.
The corona mechanism is capable to calculate the each sensor node corona level
based on the distance to the sink node. The routing management can be to
handle routing problem, nd the forwarding mechanism and choose the optimum
forwarding. The neighbour management is capable to maintain the neighbour
table and also discovers a subset of forwarding nodes. The power management
has the capability to determine the state of the transmission and transceiver in
the sensor network.
Figure 3.1: IERTLD Block Diagram
3.1.1 Corona Management
Firstly we need to determine corona ID (C_ID). The sensor network has a PAN
coordinator, PAN coordinator is broadcast the packets to the one hop neighbour
in periodically and these neighbour also broadcast to next hop neighbour further
23
this process continue within the network. In the MWSN as shown the Fig 3.2,Fig
3.3 and Fig 3.4 after deployment immediate, we assumed that the PAN coordina-
tor are middle in the MWSN and corona belong to concentric circle with respect
to the PAN coordinator. The corona width is less than the transmission range
r, so that the unreachability and packet drop can be reduced. Hence the (outer)
radius ri of corona Ci is less than to ri. The use of corona mechanism is to impose
a PAN coordinator in such a way that each sensor exactly belongs to one corona
level. So that identify each sensor node, which nodes are belongs to which corona
level. As showing the below in Fig 3.3, the corona is concentric to the PAN coor-
dinator and in the one hope there are one voice PAN coordinator as showing in
red color. PAN coordinator is also having mobility, after travelling and changing
of MWSN coordinate system (CS) or corona and the PAN coordinator may be
travel to random position, the CS of MWSN and the C_ID of sensor nodes are
changed accordingly as changing to the PAN coordinator as shown in Fig 3.4. In
the Fig 3.4 are also based on data packet forwarding from the mobile node to the
sink node or mobile PAN coordinator.
Figure 3.2: Corona mechanism eects : MWSN immediately after deployment
24
At the high level of corona, the data travel from mobile sensor node or sensor
node to low level corona of mobile sensor node or sensor node. If the sensor node
cannot have any entry in the neighbour table to low level corona sensor node, so
that it forward the data packet to the same corona level which is in neighbour
table. It is initiated at the PAN coordinator which are broadcast CCP packet to
all one-hop neighbours.
Figure 3.3: MWSN using corona concentric to PAN coordinate
Corona Control Packet (CCP), Corona ID (C_ID) C_ID initial at 0 and CCP_ID
are most important parameter in the corona mechanism. If mobile sensors nodes
are receive CCP, then it will fetch CCP_ID and C_ID after that it will check
CCP_ID has already received or not to the CCP. If mobile sensor node (MSN) has
received CCP then it will discard CCP_ID. Otherwise MSN will increase C_ID
eld in the CCP and also save the new value of C_ID as its corona level. After
increasing C_ID the MSN will broadcast CCP to its neighbor nodes. There is
important and useful information, the PAN coordinator has produced only one
CCP, If MSN or SN cannot receive CCP in case of the hidden problem or sleeping
mode, so that it need to utilize the old C_ID. If the C_ID is equal to zero, then
25
Figure 3.4: PAN after traveling and changing of MWSN PAN coordinate system
MSN will immediate change its status to the idle mode and wait until it gets new
C_ID. If the topology is change dynamically, in such case the PAN coordinator
will broadcast CCP in periodically and previous scenario will be repeated. So
that the any change of network will not be aect to the corona mechanism.
3.1.2 Routing management
The routing management inbuilt three sub processes which are forwarding mech-
anism, routing problem handler and forwarding metrics calculation. Here no need
extra calculation because of RSSI, we chose optimal nodes rely on RSSI, the re-
maining power and the delay per hop. Unicasting technique are used to select
the way of forward data and the routing problem handler will handle the routing
hole problem due to loss of energy, below threshold value, sensor node crash and
hidden sensor nodes in network.
3.1.2.1 Forwarding Mechanism
Unicasting forwarding mechanism is used in the IERTLD protocol for forwarding
to the route data packet from MSN and towards the PAN coordinator. Unicast
26
forwarding, the source node which in MSN is checking the C_ID of every neigh-
bour in neighbour table, If C_ID of any neighbour node is less than the source
node C_ID or equal to source node C_ID, the optimal forwarding algorithm is
apply and choose the optimal neighbour node. If in the neighbour table cannot
has C_ID less or equal to source node C_ID, then the source node will check
neighbour discovery and choose the optimal forwarding. Once the optimal for-
warding choice is nd, the data packet will be Unicast to the selected node and
this procedure will be continues until the PAN coordinator is one of the selected
node s neighbours. The neighbour discovery may fail due to when there is no
neighbour nodes are found in that direction where the destination. Such type of
problem will solve by using the routing handler as described in the next section.
3.1.2.2 Routing problem handler
The MWSN have a routing hole problem, the hole problem dened the failure of
route due to sensor node fail or node deployment. Such problem can be solved in
IERTLD protocol by using only backward mechanism that is also known as slow
recovery method. We cannot use fast recovery using power adaptation method
because the fast recovery is applied when the diameter of the hole is smaller than
the transmission range at the maximum power. So we dont need to apply the fast
recovery. Because of in 87% (70 times I have checking out of them 61 times it will
need to apply slow recovery) the fast recovery method is not solving the routing
hole problem due to node deployed or not nding node within the diameter of
transmission range in MWSN. Fig 3.2 shows the slow recovery in IERTLD, in this
gure OF node y has data packet from parent node p, MN y will search in its
neighbour table about higher corona (C_ID of MN + 1) and will select OF from
dierent candidates. In such case the data packet need to send backward corona
mechanism. In Figure 3.2, we assumed MN y sends data packet to MN z and will
also inform MN p to stop sending data packet toward itself. This mechanism is
called backward corona mechanism. When p received backward control packet,
it will implement routing management again. During the time that MN p search
about new OF candidate, MN y will forward data packets backward to MN z. In
this scenario, MN p has two chooses z or Q.
27
3.1.2.3 Optimal forwarding
The IERTLD protocol has used optimal forwarding (OF) technique. In the OF
we need to calculate three parameters which are remaining battery power, RSSI
link quality and packet velocity for every one hop neighbours nodes. Dispute, the
router management is forwarding a data packet to the one-hop neighbor that has
an OF and the OF is compute as previous protocol ERTLD.
3.1.3 Neighbour management
The neighbour management is a discovery of subset of forwarding candidate nodes.
It also has the capability to manage the neighbour table. The limitation of neigh-
bour table there are limited memory and it support at most 16 neighbour nodes.
So, the design of neighbour table need to a small set of forwarding candidates that
are most useful in meeting the one-hop end-to-end delay with the reaming battery
power and optimal packet reception rate. The neighbour table has contains RSSI,
CCP_ID, one hop end to end delay, node ID, remaining power, location informa-
tion, expiry time and C_ID. The neighbour discovery is a procedure to execute
the initialize stage and to identify a node that satises the forwarding condition.
It also introduces small communication overhead, which is necessary to minimize
the time and it takes to satisfactory discovery.
3.1.4 Power management
The power management is to adjust the power of the transmitter as well as
transceiver and select the sensor node transmission power level. By using power
management the energy consumption are reduce for each and every sensor node
between source and destination, so increase sensor node lifetime. The increas-
ing lifetime of sensor nodes and sensor network by, to control packet overhead,
minimizes the energy wasted by idle listening and to minimize the energy con-
sumed. According to the data sheet values, the receive mode has a higher power
consumption than the all other modes or states. In IERTLD protocol, the sensor
nodes are sleeping mode most of the time and it is going to changes its state to
idle state, if neighbour nodes in the direction of the destination. There for, if
28
the sensor node wants to broadcast request to route, it will changing its state to
transmit mode. Then, it changes to receive mode, if it wills receiving reply or
data packet from its neighbour and rest of the procedure are follow the previous
ERTLD protocol and power management process all most similar to that protocol.
3.2 Voice PAN Coordinator
Voice PAN Coordinator (VPAN coor) is work as a PAN coordinator, when PAN
coordinator is fail or below of threshold value. VPAN coor continuous communi-
cate to the PAN coor and maintain the previous state, if PAN coor fail or below
of threshold than the VPAN coor work as a PAN coor and broadcast the packet
to neighbour by using C_ID and C_ID set as dynamic to its value according to
around us (C_ID=1). Shown the below g 3.5, the PAN coor is fail and VPAN
coor work as PAN coor. Here the VPAN coor change the corona ID and broad-
cast the CCP to the all neighbours and further all other mobile sensor nodes or
sensor nodes can broadcast until the whole network and the entire mobile sensor
node nd the corona ID and corona control packet. Further all processes work as
previous section like PAN coordinator. By using the voice PAN coordinator the
network life time are increases up to 30 % compare to previous ERTLD protocol
on my experiment result.
Figure 3.5: Voice PAN Coordinator work as PAN coordinator when PAN coordi-
nator is fail or below of threshold value
29
Chapter 4
Implementation Detailed
A research methodology is a collection of techniques, documentation, methods
and tools, which help to the system designer, analyzer, developers, designer and
implementation of the system software s. Here we will describe the methods
to use the conduct research and the fact nding techniques employed. There is
various research techniques use to gather data and analyze the WSNs routing
protocols.
4.1 System Requirements
The minimum system requirement for implementation of the proposed protocol is
given below, including hardware and software requirements:
4.1.1 Hardware Requirements
Memory Size: 512 MB or above.
Hard disk space: 40 GB
CPU: Pentium IV, 2.0 GHz or above
4.1.2 Software Requirements
Operating System: Linux, Ubuntu-12.04, any linux invirolment OS
Simulator: NS2 any version
Supporting Packages: GCC, TCL/TK
30
Documentation: LaTex/Microsoft Oce Excel/Linux Open Oce/Spreadsheet/X-
Graph
Scripting Package: Perl, Awk
4.1.3 Operating System and Memory
Network Simulator 2.35 [16] are install either in a UNIX environment (or LINUX)
or Windows (2000 and XP) environment. However, in a XP and Windows en-
vironment, it is necessary to install a UNIX emulator such as Cygwin prior to
the installation of the NS2.35 software. The main disadvantage of performing the
simulation (NS2.35) in a XP or Windows environment is the stability and support
of the software. The simulations of the work conducted and run on all are done in
a UBUNTU-12.04 LINUX environment. Because of the NS2.35 software is highly
stable in a LINUX (UBUNTU) environment. The need of hard disk space at least
20 GB for allocation of the space for this simulation purpose.
4.2 Computer Simulations
Generally the analyzing techniques are used to the performance of any wireless
networks, which is measure in computer simulation, analytical methods and physi-
cal measurement [18]. The sensor network technology is experimental equipments,
WSN simulations appear to be the only feasible approaches. NS2 provided a pow-
erful method or technique for simulating the behavior of computer networks. To
clearly observe and investigate the performance of an each particular routing pro-
tocol, the simulation experiments have used to mimic the sensor network. Separate
routing protocols have applied to the network and their performance analyzed.
4.2.1 Existing WSN Simulators
In the world wide there is more need to simulate the networks. Because real time
network cannot be possible or very tropical to work on world real time network.
So network simulators are very important for analyzing several design protocols
31
for a network and it is very well known in the eld of research. Many research
eorts have been made to develop new tools and environments for WSN simu-
lations such as OPNET, SENSE, OMNeT, J-sim and NS2 etc. [17, 18]. Now a
day very popular tools like OPTEN, OmNET++, GlomoSim and NS2. But none
of these simulators perfectly meet the demands of sensor networks. For example,
OMNET++ are not easily available or not a open source, another simulator NS2
is not specically designed for sensor network and it is not simple to simulate,
some are commercial simulator too infrequently used to easily allow comparison
of results with work of other researchers. Shown the following table, here briey
describes common sensor network simulators, Network simulators are very impor-
tant for analyzing various protocols designed for a network in the world wide.
4.3 Introduction to the NS-2 Network Simulator
NS2 simulator has two languages by, using two languages the time is saving.
Otcl is an interpreted language; it is slower than the C++ or other compiled
language. But it not needs extra time to modication. C++ is a powerful and fast
executable programming language, some modications, may be requested to the
simulations. In the network simulator NS2 are used feasible for unication through
Otcl language. The c++ language are keeping the main structure of the simulation
but modifying some parameters, with the purpose of comparing dierent results.
That implies additional time recompiling C++ code each and every time a need
to modication. So Otcl have advantage that these modications do not need
additional time recompiling. The main objects of a simulation such as sensor
nodes and protocols are implemented using C++ and the conguration of the
parameters such as time of the simulation ,number or position of nodes, etc. are
implemented in Otcl language. In the previous years, ns- 2 became a most popular
tool in mobile wireless sensor network or MANET research, because of it includes
wireless and ad hoc networking support in mobility and easy conguration scripts
and les. Hence, the NS2 is an interpreter of OTcl with NS2 object libraries.
32
4.3.1 Architecture of NS-2
NS2 is a discrete event simulator written in C++ language, with an OTcl inter-
preter as a front-end. The simulator supports a class hierarchy within the OTcl
interpreter we call it the interpreted and similar class in C++ we also call it the
compiled hierarchy. Both of the two hierarchies are related to each other. From
the user's perspective, there is a one-to-one correspondence between a class in the
interpreted hierarchy and one in the compiled hierarchy. The root of this hierar-
chy is the class Tcl object. The users are creating new simulation objects through
the interpreter. Such objects are closely mirrored by a corresponding object and
instantiated within the interpreter in the compiled hierarchy. The interpreted
class hierarchy is automatically established through methods dened in the class
TclClass. User instantiated objects are mirrored through methods dened in the
class Tcl object.
Figure 4.1: OTcl/C++ Duality show
4.3.2 Running Simulations
The main components of the ns-2 are the input simulation program, the simu-
lation results, the event scheduler and network objects. For managing all these
events and objects is scheduler an OTcl script and they should be dened, i.e.
the input simulation program. The NS2 simulator, the event scheduler keeps a
record of simulation time triggering all events in the event queue scheduled at
this moment. The communication among network components does not consume
simulation time, except the necessary time that a sensor node needs for implying
a delay and handling a packet, which is managed by the event scheduler. Here
the event scheduler is also used as a timer, e.g. the execution of the ns-2 and in
a packet retransmission is mainly the execution of an OTcl script.
33
4.3.2.1 Scenaios
In the NS2 simulator, the simulation scenarios are scripts, which is necessary to
dene and it is composed of routing information, agent and topology. Scenarios
have the rst step is to initiate a simulator instance and choose the output for the
position and the results and numbers of nodes are congured. In future we should
be dened the transport protocol agent and links among nodes and the last step
is to be dene the routing protocol to be used for this simulation. The results of
these simulations are one or more text les which containing detailed simulation
data. Such of these les can be used for simulation input for a visualization or
analysis. These les are also known as NAM (Network Animator).
4.3.2.2 Nodes
The NS2, in the network have several nodes and each node is crucial for the trans-
mission of data packets or a packets. When receiving such Packet in the nodes, the
elds of these packets is analyzed, which include the destination address, which
is the receiver node.
In the NS2, all nodes have at least the following elds or components:
• List of neighbors
• A routing module and conguration of each node takes place in the denition
of scenario. We need to set up important parameters for this simulation,
such as the type of routing, network components for mobile nodes and type
of addressing structure used.
• Id or address, monotonically increasing by 1. For simplicity it is started at
o, here across the Simulation and namespace are created.
• Node type
• List of agents
34
4.3.2.3 Agents
NS2 simulator are used Agents for the implementation purpose of protocols. NS2,
the language OTcl is possible to modify and create objects of type agent and it
is also possible to create methods, composed of internal state, new Agent class,
supporting packet generation and reception.
4.3.2.4 Traces Files
In the ns-2 has main objective to provide the dierent type information from the
simulated results. There are three types of trace les, the new format, the old
format and a tagged trace format.
4.3.3 Adding Protocols to NS2
NS2 has two languages C++ and Otcl. The Otcl language is use for the descrip-
tion of applications and models and the C++ language are use for core simulator.
The simulation of protocols are requires to manipulation of large data sets at
high run-time speed, so need C++. When the network researcher is require low
iteration time than it is usually needed to vary parameters and need re-run the
simulation several times to compare results in previous protocols. Otcl can be
change very quickly but runs much slower than C++. The simple steps to add a
new protocol. NS2 consists of creating a C++ class and conguring the simulator
in order to allow OTcl end users to access this new class. I extracted the such
information which you can refer [18].
4.3.3.1 Adding the New Agent to NS
In the NS2 are adding the new C++ class, we need to edit the le Makefile of net-
work simulator directory. In the directory have variable which is called OBJ_CC
that contains the name of the objects which is created while compiling, before
linking he object le newagent.o has to be added in that variable: OBJ_CC=
...
newagent.o
...
After adding new class we can execute the make command and run TCL Scripts.
35
4.3.4 Overview of Mobile Node in NS2
The implementations of a mobile node in network simulator are shown in Fig.
4.2, and whole processes are described as follow. Firstly start The Application, it
creates datapackets” and sent to the Agent. The Agent works the network-layer
and transport functions of the protocol stack and after that the Agent sends data
packets to the CMUTrace. The CMUTrace has writes statistics about the data
packets to the trace les and packets are sent to a Connector. The Connector
is passes to the Link-Layer of Queue, if there are packet then packet are added
in the queue otherwise packets are transmitted. When the packet is removed
from the Queue, it is sent to the medium access control layer. In the MAC
layer, where media access protocols are run and nally, the data packet is sent
to the network interface. In the network interface, it provide correct transmit
power which added to the packet and sent through the proper channel. The
channel sends a copy of these data packets to each node which is connected to
the corresponding channels. Such data packets are received by each node's in
the network interface and then passed through the MAC, Link-Layer, Connector,
CMUTrace, and Agent functions. The nally agent depacketizes such data packet
and sends notication of packet arrival to the Application.
Figure 4.2: Mobile Nodes architecture
36
Chapter 5
Simulation and Results
The Zigbee technology is used in the IEEE 802.15.4 standard. It gives several
features such as low cost, less complexity and low power consumption. The simu-
lation done by NS-2.35 in ubuntu 12.04 version of Linux based operating system.
I have taken 101 sensor nodes, ones is PAN coordinator and all other are mobile
sensor nodes or sensor nodes. Hare ones of them that is neighbour of PAN co-
ordinator is Voice PAN Coordinator. The IEEE 802.15.4 standard is belongs to
following position.
Figure 5.1: Train of technology
37
5.1 NS-2.35 ow graph
In the simulation based on network simulation NS2 version .35 are give ow of
data. It takes Scenario generation and break into two le Scenario le and commu-
nication le, these le shall operated based on mobility with NS-2.35 and produce
the output les. In the output les shall take data processing and produced the
IERTLD.tr and IERTLD.nam (Network Animator). By taken IERTLD.tr le gen-
erates the plot by using GnuPlot. IERTLD.nam pictorial representation output
of the trasle.
Figure 5.2: Flow graph in NS-2.35
5.2 NS-2.35 Implementation ow graph
With the help of ow graph as shown below, we follow the steps in to the im-
plementation of our thesis, such as ns2.35 take the command directory, Mac,
Tcl/lib, Trace and Queue directories in the rst phase. The second phase it
takes the 802.15.4, Sensornet, CoronaM directories and third phase it take only
38
IERTLD.scn le. In the command directory, it takes Packet.h le which have the
information about packet. What is the size of packet and what is information
inside the packet that information store in this le.
Mac Directory: This directory work with c++ language which takes the in-
Figure 5.3: Process description in ns-2.35 with implementation by representation
of the directory format
formation about Mac.cc le and 802.15.4.cc/.h les take the information about
IEEE 802.15.4 MAC layer of the WPAN architecture. It may be handling about
all the necessary information about this project.
Tcl/lib directory: It is an important directory that contains three les, ns-
lib.tcl, ns-mobilenode.tcl and IERTLD.tcl le. In these take the information
about mobility functionality and library information these information calls by
the IERTLD.tcl le. In the IERTLD.tcl le have information like routing, trac,
monitoring, dened protocol and creating God, etc.
Tracedirectory: In the trace directory, it takes information about what is takes
in the out trace le. In the output trace le have several thousand of line. There
39
are two le which is IERTLD.cc and IERTLD.h.
Queue directory: It takes dynamic queue functionality and mange the queue
information by using several eld in the neighbour table.
802.15.4 Directory:
This directory takes the functionality about 802.15.4 protocol and takes about
required information with the several les such as 802.15.4.h, 802.15.4_packet.h,
802.15.4.cc, 802.15.4_packet.cc and debug.cc
Sensornetdirectory: It takes all the information about sensor nodes and sensor
networks. It also have the in functionality application of sensor nodes and sensor
networks.
CoronaM Directory: It takes the functionality and feature of corona mecha-
nism. As I have told in the previous chapter.
IERTLD.scn in this le store the database of the deployment nodes. Here 101
nodes have deployed, which have information on this le.
5.3 How to get result
The network simulation runs on command prompt than we write ns IERTLD.tcl.
It generates the .tr and .man les. By using IERTLD.tr le write awk command
on command prompt and nd the result le, by these les we can generate a graph
by using GnuPlot.
40
Figure 5.4: Awk command run on trace le and nd such .txt le for making
results
5.4 Result based on static sensor network
These result based on static network. In the static network, result may will
same with some better performance compare to pervious protocols like RTLD and
ERTLD. Compare the two protocols on the basis of Data Packet Received (packet
rate) per Unit Energy Consumed (Energy per packet) with network size. Here
the protocol IERTLD performed better compare to ERTLD protocol in average
for small networks but better in the large networks. As shown the following Fig
5.5 and Fig 5.6.
Figure 5.5: packet rate v/s energy per packet
41
Figure 5.6: packet rate v/s Average EtE Delay
Compare the two protocols on the basis of Data Packet Received (packet rate)
per Average EtE delay with network. Here the protocol ERTLD performed much
better compare to IERTLD protocol in average and small networks but in the
large networks IERTLD work better. As shown the Fig 5.7 and g 5.8.
Compare the two protocols on the basis of Data Packet Received (packet rate) and
Delivery ratio, in case of static networks, delivery ratio are increases in average as
compare to ERTLD protocol. In another result, the packet rate v/s normalized
packet overhead, it will remain same as previous protocol.
Figure 5.7: Packet rate v/s Delivery ratio
Figure 5.8: Packet rate v/s Normalized packet overhead
42
5.5 Result based on Mobile sensor network
Compare two protocols on the basis of Data Packet Received (packet rate) per Unit
Energy Consumed (Energy per packet) with network size, simulate NS2.35 simu-
lator. Here the protocol IERTLD performed better compare to ERTLD protocol
when mobility is added on dierentdierent sensor nodes (average case mobility
at 20%, 30% and 40%) in the networks. As shown the following rst gure 5.9.
Compare the two protocols on the basis of Data Packet Received (packet rate)
Figure 5.9: packet rate v/s energy per packet
Figure 5.10: packet rate v/s Average EtE Delay
per Average EtE delay with network. Here the protocol ERTLD performed better
compare to my design IERTLD protocol in the network. In this case my design
protocol gives worst performance compare to previous protocol. As shown the Fig
5.9 and Fig 5.10.
When compare two protocol based on packet rate and delivery ratio, in case of
mobility than IERTLD protocol gives much better performance as compare to
ERTLD protocol. In the new design protocol give 76% delivery ratio that is 12%
43
Figure 5.11: Packet rate v/s Delivery ratio
greater than previous ERTLD protocol. In case of packet reception rate the new
protocol give better performance as compare to ERTLD protocol as shown Fig
5.11 and Fig 5.12.
Figure 5.12: Packet rate v/s Normalized packet overhead
44
Chapter 6
Conclusion and Future work
6.1 Conclustion
The IERTLD protocol provides good performance in delivery ratio, normalized
per packet and energy per packet of the mobile sensor networks. The packet
delivery ratio is increase 12% compare to other existing protocol. It will reduce
the energy consumption by using backward mechanism. Backward mechanism
provide the guarantee to deliver the data packet to the neighbour, so that the
delivery ratio is increase. The packet reception rate and normalize packet are
also in favor. At the static sensor network the delivery ratio, energy per packet
and EtE delay may same but the highly mobility the new IERTLD protocol give
better response compare to other existing protocols. When applying the corona
birth are less than the transition range then the EtE delay increase, which is not
a favorable.
Voice sink node, the overall life time or aliveness of the sensor network are increase
because of the sink node scattered or fail, than the voice sink manage all the
processing and transceiver activity to the sink node. Network aliveness is increase
30% compare to ERTLD protocol.
6.2 Future work
In the sensor netwrok s have mobility. In highly mobile sensor network need
to manage the mobility at mobile sensor network because of highly mobility the
delivery ratio will decrease and the increasing the EtE delay. The increasing EtE
delay so need to manage the mobility withing the network. Further the EtE delay
also reduced by using the mobility management techniques.
45
Bibliography
[1] Akyildiz I. F., Su W, Sankarasubramaniam Y, Cayirci E, 2002 Wireless sensor
network: a survey, Computer Networks, 393-422.
[2] Al-Karaki J. N. and Kamal A. E., 2004 Routing techniques in wireless sensor
Networks: A survey, IEEE Wireless Communications, vol. 11, 6.
[3] T. He, J. Stankovic, C. Lu, T. Abdelzaher, SPEED: a stateless protocol for
real-time communication in sensor networks, in: IEEE Proceedings of the
23rd International Conference on Distributed Computing Systems, 2003, pp.
46 to 55.
[4] Mainwaring A., Anderson J., Polastre J., Culler D., Szewczyk R. ,2002 Wire-
less Sensor Networks for Habitat Monitoring, Proceedings of the 1st ACM
International workshop on Wireless Sensor Networks and applications, 88-97.
[5] Heinzelman, W. Application-Specic Protocol Architectures for Wireless Net-
works. PhD thesis, Massachusetts Institute of Technology, June 2000.
[6] Muruganathan S.D., Ma D.C.F., Bhasin R.I, and Fpojuwo A.O., 2005 A
centralized energy ecient routing protocol for wireless sensor networks,
Communication magazine, IEEE, Pp. 8-13.
[7] Ahmed, N. Fisal, A real-time routing protocol with load distribution in wire-
less sensor networks, Elsevier Computer Communication Journal 31 (2008)
3190 to 3203.
[8] A Ahmed, An enhanced real time routing protocol with load distribution for
mobile wireless sensor networks, Elsevier Computer Communication February
19 (2013) 1459 to 1473.
46
[9] Akkaya K. and Younis M., 2005 A survey on routing protocols for wireless
Sensor Network, journal of Adhoc Networks, vol 3, 325-349.
[10] Gupta, G. Younis, M., 2003 Load-balanced clustering of wireless sensor
networks, Anchorage, AK, United States.
[11] Heinzelman W.R.,Chandrakasan A, and Balakrishnan H., 2000 Energy Ef-
cient Communication Protocol for Wireless Micro sensor Networks, Proc.
33rd Hawaii Int l. Conf. Sys. Sci.
[12] Nauman Israr and Irfan Awan, July 2006 Multihop routing Algorithm for In-
ter cluster Head Communication, 22nd UK Performance Engineering Work-
shop Bournemouth UK, Pp.24-31.
[13] Heinzelman W.B, Chandrakasan A.P, and Balakrishnan H. 2002 Applica-
tion specic Protocol Architecture for Wireless Sensor Network, vol. PhD:
Massachusetts institute of technology.
[14] C. Lu, B.M. Blum, T.F. Abdelzaher, J.A. Stankovic, T. He, RAP: a real
time communication architecture for large-scale wireless sensor networks, in:
IEEE Conference on Real-Time and Embedded Technology and Applications
Symposium, 2002, pp. 55 to 66.
[15] T. He, J. Stankovic, C. Lu, T. Abdelzaher, SPEED: a stateless protocol for
real-time communication in sensor networks, in: IEEE Proceedings of the
23rd International Conference on Distributed Computing Systems, 2003, pp.
46 to 55.
[16] E. Felemban, C. G. Lee, E. Ekici, R. Boder and S. Vural, Probabilistic QoS
guarantee in reliability and timeliness domains in wireless sensor networks,
in: IEEE Proceedings of the 24th Annual Joint Conference of the IEEE
Computer and Communications Societies, 2005, pp. 2646 to 2657.
[17] G. M. Arau jo, L.B. Becker, A network conditions aware geographical for-
warding protocol for real-time applications in mobile wireless sensor networks,
in: AINA 2011 IEEE International Conference, 2011,pp. 38 to 45.
47
[18] Nutan sindhwani, rohit vaid, V LEACH: An energy ecient communication
protocol for WSN, ISSN, January (2013) 2320 to 2491.
[19] Chipcon, CC2420 Low Power Radio Transceiver,
http://www.chipcon.com, (accessed on June 2011).
[20] B. Bougard, F. Catthoor, D. Daly, A. Chandrakasan, W. Dehaene, Energy
eciency of the IEEE 802.15.4 standard in dense wireless microsensor net-
works: modeling and improvement perspectives, in: IEEE DATE 2005, 2005,
pp. 196 to 201.
[21] The Network Simulator NS 2, http://www.isi.edu/nsnam/ns/,(accessed
on Jannury 2012).
[22] http://www.ZigBee.org
[23] http://www.ieee802.org/15/pub/TG4.html
48

More Related Content

What's hot

The Dissertation
The DissertationThe Dissertation
The Dissertation
phooji
 
Lequocanh
LequocanhLequocanh
Lequocanh
Lê Anh
 
Scale The Realtime Web
Scale The Realtime WebScale The Realtime Web
Scale The Realtime Web
pfleidi
 
Mohan_Dissertation (1)
Mohan_Dissertation (1)Mohan_Dissertation (1)
Mohan_Dissertation (1)
Mohan Bhargav
 

What's hot (19)

The Dissertation
The DissertationThe Dissertation
The Dissertation
 
mpi4py Manual!
mpi4py Manual!mpi4py Manual!
mpi4py Manual!
 
Gomadam Dissertation
Gomadam DissertationGomadam Dissertation
Gomadam Dissertation
 
Tr1546
Tr1546Tr1546
Tr1546
 
Lequocanh
LequocanhLequocanh
Lequocanh
 
Computer security using machine learning
Computer security using machine learningComputer security using machine learning
Computer security using machine learning
 
10.1.1.866.373
10.1.1.866.37310.1.1.866.373
10.1.1.866.373
 
Scale The Realtime Web
Scale The Realtime WebScale The Realtime Web
Scale The Realtime Web
 
Phd dissertation
Phd dissertationPhd dissertation
Phd dissertation
 
Upstill_thesis_2000
Upstill_thesis_2000Upstill_thesis_2000
Upstill_thesis_2000
 
Cimplementation
CimplementationCimplementation
Cimplementation
 
2019 imta bouklihacene-ghouthi
2019 imta bouklihacene-ghouthi2019 imta bouklihacene-ghouthi
2019 imta bouklihacene-ghouthi
 
Rfb
RfbRfb
Rfb
 
D4.2. User Profile Schema and Profile Capturing
D4.2. User Profile Schema and Profile CapturingD4.2. User Profile Schema and Profile Capturing
D4.2. User Profile Schema and Profile Capturing
 
Design patterns by example
Design patterns by exampleDesign patterns by example
Design patterns by example
 
Design of a bionic hand using non invasive interface
Design of a bionic hand using non invasive interfaceDesign of a bionic hand using non invasive interface
Design of a bionic hand using non invasive interface
 
Thesis van Heesch
Thesis van HeeschThesis van Heesch
Thesis van Heesch
 
Mohan_Dissertation (1)
Mohan_Dissertation (1)Mohan_Dissertation (1)
Mohan_Dissertation (1)
 
Optical Character Recognition IIT BHU
Optical Character Recognition IIT BHUOptical Character Recognition IIT BHU
Optical Character Recognition IIT BHU
 

Viewers also liked

Wireless Sensor Networks
Wireless Sensor NetworksWireless Sensor Networks
Wireless Sensor Networks
rajatmal4
 

Viewers also liked (6)

Presentation 1
Presentation 1Presentation 1
Presentation 1
 
Ca mwsn clustering algorithm for mobile wireless senor network [
Ca mwsn clustering algorithm for mobile wireless senor network  [Ca mwsn clustering algorithm for mobile wireless senor network  [
Ca mwsn clustering algorithm for mobile wireless senor network [
 
Analysis of wireless sensor networks
Analysis of wireless sensor networksAnalysis of wireless sensor networks
Analysis of wireless sensor networks
 
wirelesssensornetwork
wirelesssensornetworkwirelesssensornetwork
wirelesssensornetwork
 
Ppt taken workshoponwsn_withns2
Ppt taken workshoponwsn_withns2Ppt taken workshoponwsn_withns2
Ppt taken workshoponwsn_withns2
 
Wireless Sensor Networks
Wireless Sensor NetworksWireless Sensor Networks
Wireless Sensor Networks
 

Similar to 12.06.2014

ImplementationOFDMFPGA
ImplementationOFDMFPGAImplementationOFDMFPGA
ImplementationOFDMFPGA
Nikita Pinto
 
Composition of Semantic Geo Services
Composition of Semantic Geo ServicesComposition of Semantic Geo Services
Composition of Semantic Geo Services
Felipe Diniz
 
Mixed Streaming of Video over Wireless Networks
Mixed Streaming of Video over Wireless NetworksMixed Streaming of Video over Wireless Networks
Mixed Streaming of Video over Wireless Networks
Videoguy
 
Routing Protocols for Wireless Sensor Networks
Routing Protocols for Wireless Sensor NetworksRouting Protocols for Wireless Sensor Networks
Routing Protocols for Wireless Sensor Networks
Darpan Dekivadiya
 
bonino_thesis_final
bonino_thesis_finalbonino_thesis_final
bonino_thesis_final
Dario Bonino
 
iPDC Report Kedar
iPDC Report KedariPDC Report Kedar
iPDC Report Kedar
Nitesh Pandit
 

Similar to 12.06.2014 (20)

ImplementationOFDMFPGA
ImplementationOFDMFPGAImplementationOFDMFPGA
ImplementationOFDMFPGA
 
Composition of Semantic Geo Services
Composition of Semantic Geo ServicesComposition of Semantic Geo Services
Composition of Semantic Geo Services
 
Mixed Streaming of Video over Wireless Networks
Mixed Streaming of Video over Wireless NetworksMixed Streaming of Video over Wireless Networks
Mixed Streaming of Video over Wireless Networks
 
KHAN_FAHAD_FL14
KHAN_FAHAD_FL14KHAN_FAHAD_FL14
KHAN_FAHAD_FL14
 
MSc_Thesis
MSc_ThesisMSc_Thesis
MSc_Thesis
 
iPDC-v1.3.0 - A Complete Technical Report including iPDC, PMU Simulator, and ...
iPDC-v1.3.0 - A Complete Technical Report including iPDC, PMU Simulator, and ...iPDC-v1.3.0 - A Complete Technical Report including iPDC, PMU Simulator, and ...
iPDC-v1.3.0 - A Complete Technical Report including iPDC, PMU Simulator, and ...
 
I Pdc V1.3.0 A Complete Technical Report Including I Pdc, Pmu Simulator, An...
I Pdc V1.3.0   A Complete Technical Report Including I Pdc, Pmu Simulator, An...I Pdc V1.3.0   A Complete Technical Report Including I Pdc, Pmu Simulator, An...
I Pdc V1.3.0 A Complete Technical Report Including I Pdc, Pmu Simulator, An...
 
T401
T401T401
T401
 
Wcn (1)
Wcn (1)Wcn (1)
Wcn (1)
 
Efficient Planning and Offline Routing Approaches for IP Networks
Efficient Planning and Offline Routing Approaches for IP NetworksEfficient Planning and Offline Routing Approaches for IP Networks
Efficient Planning and Offline Routing Approaches for IP Networks
 
Routing Protocols for Wireless Sensor Networks
Routing Protocols for Wireless Sensor NetworksRouting Protocols for Wireless Sensor Networks
Routing Protocols for Wireless Sensor Networks
 
iGUARD: An Intelligent Way To Secure - Report
iGUARD: An Intelligent Way To Secure - ReportiGUARD: An Intelligent Way To Secure - Report
iGUARD: An Intelligent Way To Secure - Report
 
thesis
thesisthesis
thesis
 
bonino_thesis_final
bonino_thesis_finalbonino_thesis_final
bonino_thesis_final
 
Thesis
ThesisThesis
Thesis
 
thesis_online
thesis_onlinethesis_online
thesis_online
 
Content and concept filter
Content and concept filterContent and concept filter
Content and concept filter
 
Chat Application [Full Documentation]
Chat Application [Full Documentation]Chat Application [Full Documentation]
Chat Application [Full Documentation]
 
iPDC Report Kedar
iPDC Report KedariPDC Report Kedar
iPDC Report Kedar
 
My PhD Thesis
My PhD Thesis My PhD Thesis
My PhD Thesis
 

Recently uploaded

Call Now ≽ 9953056974 ≼🔝 Call Girls In New Ashok Nagar ≼🔝 Delhi door step de...
Call Now ≽ 9953056974 ≼🔝 Call Girls In New Ashok Nagar  ≼🔝 Delhi door step de...Call Now ≽ 9953056974 ≼🔝 Call Girls In New Ashok Nagar  ≼🔝 Delhi door step de...
Call Now ≽ 9953056974 ≼🔝 Call Girls In New Ashok Nagar ≼🔝 Delhi door step de...
9953056974 Low Rate Call Girls In Saket, Delhi NCR
 
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
ssuser89054b
 
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
dharasingh5698
 
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
dollysharma2066
 
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort ServiceCall Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
9953056974 Low Rate Call Girls In Saket, Delhi NCR
 
Integrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - NeometrixIntegrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - Neometrix
Neometrix_Engineering_Pvt_Ltd
 

Recently uploaded (20)

(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
 
Minimum and Maximum Modes of microprocessor 8086
Minimum and Maximum Modes of microprocessor 8086Minimum and Maximum Modes of microprocessor 8086
Minimum and Maximum Modes of microprocessor 8086
 
Call Now ≽ 9953056974 ≼🔝 Call Girls In New Ashok Nagar ≼🔝 Delhi door step de...
Call Now ≽ 9953056974 ≼🔝 Call Girls In New Ashok Nagar  ≼🔝 Delhi door step de...Call Now ≽ 9953056974 ≼🔝 Call Girls In New Ashok Nagar  ≼🔝 Delhi door step de...
Call Now ≽ 9953056974 ≼🔝 Call Girls In New Ashok Nagar ≼🔝 Delhi door step de...
 
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
 
Design For Accessibility: Getting it right from the start
Design For Accessibility: Getting it right from the startDesign For Accessibility: Getting it right from the start
Design For Accessibility: Getting it right from the start
 
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
 
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
 
Block diagram reduction techniques in control systems.ppt
Block diagram reduction techniques in control systems.pptBlock diagram reduction techniques in control systems.ppt
Block diagram reduction techniques in control systems.ppt
 
ONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdf
ONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdfONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdf
ONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdf
 
Thermal Engineering -unit - III & IV.ppt
Thermal Engineering -unit - III & IV.pptThermal Engineering -unit - III & IV.ppt
Thermal Engineering -unit - III & IV.ppt
 
Water Industry Process Automation & Control Monthly - April 2024
Water Industry Process Automation & Control Monthly - April 2024Water Industry Process Automation & Control Monthly - April 2024
Water Industry Process Automation & Control Monthly - April 2024
 
Generative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPTGenerative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPT
 
VIP Model Call Girls Kothrud ( Pune ) Call ON 8005736733 Starting From 5K to ...
VIP Model Call Girls Kothrud ( Pune ) Call ON 8005736733 Starting From 5K to ...VIP Model Call Girls Kothrud ( Pune ) Call ON 8005736733 Starting From 5K to ...
VIP Model Call Girls Kothrud ( Pune ) Call ON 8005736733 Starting From 5K to ...
 
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort ServiceCall Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
 
Integrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - NeometrixIntegrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - Neometrix
 
FEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced Loads
FEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced LoadsFEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced Loads
FEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced Loads
 
Work-Permit-Receiver-in-Saudi-Aramco.pptx
Work-Permit-Receiver-in-Saudi-Aramco.pptxWork-Permit-Receiver-in-Saudi-Aramco.pptx
Work-Permit-Receiver-in-Saudi-Aramco.pptx
 
Double Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torqueDouble Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torque
 
2016EF22_0 solar project report rooftop projects
2016EF22_0 solar project report rooftop projects2016EF22_0 solar project report rooftop projects
2016EF22_0 solar project report rooftop projects
 
Call Girls Wakad Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Wakad Call Me 7737669865 Budget Friendly No Advance BookingCall Girls Wakad Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Wakad Call Me 7737669865 Budget Friendly No Advance Booking
 

12.06.2014

  • 1. An Improvment in ERTLD Protocol for Mobile wireless sensor network A Thesis submitted in partial fulllment of the requirements for the award of the degree of Master of Technology in CSE (ADVANCED NETWORK) by Vishnu Kumar Prajapati (2012AN020) ATAL BIHARI VAJPAYEE INDIAN INSTITUTE OF INFORMATION TECHNOLOGY AND MANAGEMENT GWALIOR-474015 2014
  • 2. Checklist # Items Declaration 1. Is the thesis/report bound as specied? Yes No 2. Is the Cover page in proper format as given in Annexure 1 of guidelines for thesis preparation? Yes No 3. Is the Title page (Inner cover page) in proper format? Yes No 4. I.Is the Certicate from the Supervisor in proper format? Yes No II.Has it been signed by the Supervisor? 5. I.Is the Abstract included in the thesis/report properly writ- ten within 400 to 600 words? Yes No II.Have the technical keywords (not more than six) specied properly? 6. Have you included the List of Abbreviations/Acronyms in the thesis/report? Yes No 7. Does the thesis/report contain a summary of the literature survey? Yes No 8. Does the Table of Contents include page numbers? Yes No I.Are the Pages numbered properly? (Chapter 1 should start on page number 1) II. Are the Figures numbered properly? (Figure Numbers and Figure Titles should be only at the bottom of the gures) III.Are the Tables numbered properly? (Table Numbers and Table Titles should be only at the top of the tables) IV. Are the Titles for the Figures and Tables proper and sources acknowledged? V. Are the Appendices numbered properly? Are their titles appropriate? 9. Have you incorporated feedback received during various stages of evaluation? Yes No 10.Is the Conclusion of the thesis/report based on discussion of the work? Yes No 11. I. Are References or Bibliography given at the end of the thesis/report? Yes No II.Have the References been cited properly inside the text of the thesis/report? III.Is the citation of References in proper format? 12.Is the thesis/report format and contents are according to the guidelines? Yes No ii
  • 3. Candidate Declaration I hereby certify that I have properly checked and veried all the items as prescribed in the checklist and ensure that my thesis/report is in proper format as specied in the guideline for thesis preparation. I also declare that the work containing in this report is my own work. I, understand that plagiarism is dened as any one or combination of the following: 1. To steal and pass o (the ideas or words of another) as one's own 2. To use (another's production) without crediting the source 3. To commit literary theft 4. To present as new and original an idea or product derived from an existing source. I understand that plagiarism involves an intentional act by the plagiarist of using someone else's work/ideas completely/partially and claiming author- ship/originality of the work/ideas. Verbatim copy as well as close resemblance to some else's work constitute plagiarism. I have given due credit to the original authors/sources for all the words, ideas, diagrams, graphics, computer programmes, experiments, results, websites, that are not my original contribution. I have used quotation marks to identify verbatim sentences and given credit to the original authors/sources. I arm that no portion of my work is plagiarized, and the experiments and results reported in the report/dissertation/thesis are not manipulated. In the event of a complaint of plagiarism and the manipulation of the experiments and results, I shall be fully responsible and answerable. My faculty supervisor(s) will not be responsible for the same. Signature: Name:Vishnu Kumar Prajapati Roll No.2012 AN 20: Date: //- iii
  • 4. Abstract Mobile Wireless Sensor Network (MWSN) is act as wireless ad hoc network which consists of large number of nodes and mobile nodes, which are communicating to each other. In real time routing protocol has capabilities to mobility and sens- ing within a range. As we know in the sensor nodes have a limited of power energy, processing and data storage when Enhenced Real Time Routing Protocol with Load Distribution (ERTLD) can take a replica in the Personal Area Network (PAN) Coordinator, if PAN Coordinator is fail or below of threshold than Voice PAN Coordinator work as a PAN Coordinator. Voice PAN coordinator overall network life time increase 30% compare to ERTLD protocol. In ERTLD protocol is used corona width, if transmission range is tilding some angle than corona width are less than the transmission range, so that the perfor- mance and throughput are increasing. Improvement Enhenced Real time Routing Protocol (IERTLD) is used backward mechnism. The backward mechnism give better performance compare to other techniques such as Fast farwarding etc. Keywords- Corona Mechanism, Mobile sensor node, Delivery ratio, End-to- end delay, packet reception rate and Network Life Time. iv
  • 5. Acknowledgement I am highly indebted to Mr. Nirmal Robertsand obliged for giving me the autonomy of functioning and experimenting with ideas. I would like to take this opportunity to express my profound gratitude to him not only for his academic guidance but also for his personal interest in my thesis and constant support cou- pled with condence boosting and motivating sessions which proved very fruitful and were instrumental in infusing self-assurance and trust within me. The nur- turing and blossoming of the present work is mainly due to his valuable guidance, suggestions, astute judgement, constructive criticism and an eye for perfection. My mentor always answered myriad of my doubts with smiling graciousness and prodigious patience, never letting me feel that I am novices by always lending an ear to my views, appreciating and improving them and by giving me a free hand in my report. It's only because of his overwhelming interest and helpful attitude, the present work has attained the stage it has. I also express my deep and immense gratitude to Prof. ShashikalaTapaswi. Their encouragement and constructive criticisms have contributed immensely to the successful completion of this work. Finally, I am grateful to our Institution and colleagues whose constant encour- agement served to renew my spirit, refocus my attention and energy and helped me in carrying out this work. Date: Vishnu kumar Prajapati v
  • 6. Contents Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix List of Abbreviations . . . . . . . . . . . . . . . . . . . . . . . . . . . . x 1 Introduction 1 1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.4 Objective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.5 Thesis Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2 Literature Review 8 2.1 Wireless Sensor Network . . . . . . . . . . . . . . . . . . . . . . . 9 2.1.1 Sensor Network Challenges . . . . . . . . . . . . . . . . . . 11 2.1.2 Characteristics . . . . . . . . . . . . . . . . . . . . . . . . 13 2.1.2.1 Network Topologies . . . . . . . . . . . . . . . . 13 2.1.2.2 Application Specic . . . . . . . . . . . . . . . . 14 2.1.2.3 Environment . . . . . . . . . . . . . . . . . . . . 14 2.1.2.4 Types of Nodes . . . . . . . . . . . . . . . . . . . 14 2.1.2.5 Resource Constraints . . . . . . . . . . . . . . . 14 2.1.2.6 Fault Tolerance . . . . . . . . . . . . . . . . . . 15 2.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.3 Routing Protocol In Wireless Sensor Network . . . . . . . . . . . 15 2.3.1 Location Based Routing . . . . . . . . . . . . . . . . . . . 15 2.3.2 Hierarchical Routing . . . . . . . . . . . . . . . . . . . . . 16 2.3.3 Geographic adaptive delity . . . . . . . . . . . . . . . . . 16 2.3.4 Flat Network Routing . . . . . . . . . . . . . . . . . . . . 17 2.3.5 Geographic and Energy Aware Routing . . . . . . . . . . 17 2.3.6 SPEED . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.4 Routing Challenges and Design Issue . . . . . . . . . . . . . . . . 18 2.4.1 Transmission Media . . . . . . . . . . . . . . . . . . . . . . 18 vi
  • 7. 2.4.2 Node Deployment . . . . . . . . . . . . . . . . . . . . . . . 18 2.4.3 Network Dynamics . . . . . . . . . . . . . . . . . . . . . . 19 2.4.4 Node Mobility . . . . . . . . . . . . . . . . . . . . . . . . . 19 2.4.5 Scale and Density . . . . . . . . . . . . . . . . . . . . . . . 19 2.4.6 Coverage . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 2.4.7 Connectivity . . . . . . . . . . . . . . . . . . . . . . . . . . 20 2.4.8 Quality of Service . . . . . . . . . . . . . . . . . . . . . . . 20 2.4.9 Energy Consideration . . . . . . . . . . . . . . . . . . . . . 20 2.4.10 Data Aggregation . . . . . . . . . . . . . . . . . . . . . . . 21 2.4.11 None Capabilities . . . . . . . . . . . . . . . . . . . . . . . 21 2.4.12 Fault Tolerance . . . . . . . . . . . . . . . . . . . . . . . . 21 3 Propose IERTLD Protocol Design 22 3.1 IERTLD Protocol Design . . . . . . . . . . . . . . . . . . . . . . . 23 3.1.1 Corona Management . . . . . . . . . . . . . . . . . . . . . 23 3.1.2 Routing management . . . . . . . . . . . . . . . . . . . . . 26 3.1.2.1 Forwarding Mechanism . . . . . . . . . . . . . . . 26 3.1.2.2 Routing problem handler . . . . . . . . . . . . . 27 3.1.2.3 Optimal forwarding . . . . . . . . . . . . . . . . . 28 3.1.3 Neighbour management . . . . . . . . . . . . . . . . . . . 28 3.1.4 Power management . . . . . . . . . . . . . . . . . . . . . . 28 3.2 Voice PAN Coordinator . . . . . . . . . . . . . . . . . . . . . . . 29 4 Implementation Detailed 30 4.1 System Requirements . . . . . . . . . . . . . . . . . . . . . . . . . 30 4.1.1 Hardware Requirements . . . . . . . . . . . . . . . . . . . 30 4.1.2 Software Requirements . . . . . . . . . . . . . . . . . . . . 30 4.1.3 Operating System and Memory . . . . . . . . . . . . . . . 31 4.2 Computer Simulations . . . . . . . . . . . . . . . . . . . . . . . . 31 4.2.1 Existing WSN Simulators . . . . . . . . . . . . . . . . . . 31 4.3 Introduction to the NS-2 Network Simulator . . . . . . . . . . . . 32 4.3.1 Architecture of NS-2 . . . . . . . . . . . . . . . . . . . . . 33 4.3.2 Running Simulations . . . . . . . . . . . . . . . . . . . . . 33 4.3.2.1 Scenaios . . . . . . . . . . . . . . . . . . . . . . . 34 4.3.2.2 Nodes . . . . . . . . . . . . . . . . . . . . . . . . 34 4.3.2.3 Agents . . . . . . . . . . . . . . . . . . . . . . . . 35 4.3.2.4 Traces Files . . . . . . . . . . . . . . . . . . . . . 35 4.3.3 Adding Protocols to NS2 . . . . . . . . . . . . . . . . . . . 35 vii
  • 8. 4.3.3.1 Adding the New Agent to NS . . . . . . . . . . . 35 4.3.4 Overview of Mobile Node in NS2 . . . . . . . . . . . . . . 36 5 Simulation and Results 37 5.1 NS-2.35 ow graph . . . . . . . . . . . . . . . . . . . . . . . . . . 38 5.2 NS-2.35 Implementation ow graph . . . . . . . . . . . . . . . . . 38 5.3 How to get result . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 5.4 Result based on static sensor network . . . . . . . . . . . . . . . . 41 5.5 Result based on Mobile sensor network . . . . . . . . . . . . . . . 43 6 Conclusion and Future work 45 6.1 Conclustion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 6.2 Future work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 viii
  • 9. List of Figures 1.1 Wireless Sensor Netwrok . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 MWSN Architecture . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1 Sensor Network Applications . . . . . . . . . . . . . . . . . . . . . 16 3.1 IERTLD Block Diagram . . . . . . . . . . . . . . . . . . . . . . . 23 3.2 Corona mechanism eects : MWSN immediately after deployment 24 3.3 MWSN using corona concentric to PAN coordinate . . . . . . . . 25 3.4 PAN after traveling and changing of MWSN PAN coordinate system 26 3.5 Voice PAN Coordinator work as PAN coordinator when PAN co- ordinator is fail or below of threshold value . . . . . . . . . . . . . 29 4.1 OTcl/C++ Duality show . . . . . . . . . . . . . . . . . . . . . . . 33 4.2 Mobile Nodes architecture . . . . . . . . . . . . . . . . . . . . . . 36 5.1 Train of technology . . . . . . . . . . . . . . . . . . . . . . . . . . 37 5.2 Flow graph in NS-2.35 . . . . . . . . . . . . . . . . . . . . . . . . 38 5.3 Process description in ns-2.35 with implementation by representa- tion of the directory format . . . . . . . . . . . . . . . . . . . . . 39 5.4 Awk command run on trace le and nd such .txt le for making results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 5.5 packet rate v/s energy per packet . . . . . . . . . . . . . . . . . . 41 5.6 packet rate v/s Average EtE Delay . . . . . . . . . . . . . . . . . 42 5.7 Packet rate v/s Delivery ratio . . . . . . . . . . . . . . . . . . . . 42 5.8 Packet rate v/s Normalized packet overhead . . . . . . . . . . . . 42 5.9 packet rate v/s energy per packet . . . . . . . . . . . . . . . . . . 43 5.10 packet rate v/s Average EtE Delay . . . . . . . . . . . . . . . . . 43 5.11 Packet rate v/s Delivery ratio . . . . . . . . . . . . . . . . . . . . 44 5.12 Packet rate v/s Normalized packet overhead . . . . . . . . . . . . 44 ix
  • 10. List of Abbreviations CCP-ID Corona Control Packet Identity C-ID Corona Identity ERTLD Enhenced Real time with load Distribution IERTLD Improvement in Enhenced Real time with load Distribution LN Local Neighbour MS Mobile Sink MN Mobile Node NM Neighbour Management OF Optimal Forwarding PM Power Management RM Routing Management RSSI Received Signal Strength Indicator CCP Corona Control Packet CD Corona Discovery LM Loction Management MWSN Mobile Wireless Sensor Network ND Neighbour Discovery NS-2 Network Simulator-2 NT Neighbour Table PE Performance Evaluation ND Neighbour Discovery PRR Packet Reception Rate RPH Route Problem Handler RTR Request to Route x
  • 11. Chapter 1 Introduction There was development in the eld of wireless technology such as micro electrical mechanical systems (MEMS) [1,2]. In these form of technology, through radio communication small tiny (sensor) nodes may be formed, that have the capability of communication, sensing and computing in a specic short range. Such nodes have the capability to perform the sensing collaboratively but it will not give precise results if monitored by a sensor. It also has the capability to form an autonomous intelligent network that may do an unattended management. A WSN is collection of nodes with computing, sensing, and communication capa- bilities. In this technology, sink node has the capability to communicate internal nodes with outside world according to topology. Such networks have the activ- ities and phenomenon monitoring capabilities, that cannot be monitored easily by human beings, such as sight of environment monitoring, some chemical eld monitoring and nuclear accident over long period of time. The main characteristic of these networks [2] is continuously changing topology, through the scheduling of the nodes in a network into dierent states, such as dying nodes and wake up states or sleep in the network, autonomous intelligent network management, dense deployment of the network, limited bandwidth, limited storage capacity, limited node energy [1] and multi-hop communication. 1.1 Background A WSN is a group of microcomputers that is called sensor nodes. It has the capability of collaboration in the common task, it also have the capability of communication in the wireless that may be allow a small microcontroller and an 1
  • 12. energy source [1] and the formation of the network. In the sensor networks, the infrastructure of the networks does not exist, so that the nodes may act as router, receiver and emitter. In networks all the nodes send their respective information (which every one have collected) to a base station or sink node [3]. Wireless sensor network consists of many microcomputers (sensor nodes), that are sensing and communicating with each other. In WSN, sensors collect information about the sink node or base station and physical world (outside of the sensor network like computer and other machine) performs appropriate action and makes decision upon the condition. It is dierent from simple or traditional network s as it is compare action upon the environment as shown the following g 1.1. It is consist of a huge number of sensor nodes that produce innumerable data [7]. However, the wireless sensor network does not free to restriction of computational, power, and memory capacity. Due to such kind of properties, another management is not ecient to manage sensor network. In the real time sensor network communication is needed in a large number of wireless sensor network application for example a cricket match, the batsman where proper action should be made in that event exactly as delay can cause the boll hit to the wickets that batsman goes to out [1]. After that, wireless sensor networks have several applications in several elds like military surveillance, environmental or medical monitoring [4], domestics, etc. Such types of characteristics are shown the following: • It used limited power supplies • Self conguring. • Easy to deployment • Communication between nodes may failures. • Dynamic network topologies. • Node may failures. On that time research of sensor network is towards to particular communication and routing protocol and it is good to used attending the characteristics of these 2
  • 13. Figure 1.1: Wireless Sensor Netwrok networks [5,6]. However, the protocol may be monitor their sources of that nodes, such as example, will change the routing topology, the data can be aggregated to reduce the actual data transmission in the sink node (PAN coor) while man- aging the eectively data or transmission of data and using good time schemes of transferring data, the sink node or other sensor nodes can have sleep mode than the order to save energy while they are not working or they are idle. To work eectively, wireless sensor networks protocols must handle dierent issues, such as energy of the sensors, routing information, data transmission to base sta- tion, Routing Hole Problem, etc. By A Ahmed Mobile Wireless Sensor Network (MWSN) is a collection of distributed mobile sensor nodes that have the capabil- ity of moving, communicating, and sensing within its range. The MWSN consist of moving sensor (Laptop or PDA) and static sensor nodes as shown the Fig 1.2. It may have mobile sink node and mobile node to communicating among them. Each sensor nodes have the capabilities of collecting data and routing these data peer to peer to base station. It has not only static capabilities but also have the mobility capabilities by adding robotic based. A PAN coordinator is used as a bridge between the sensor network and other device such as laptop or network 3
  • 14. or platform. The mobile sensor nodes have several advances such as scalability, maintain load balancing, and conserve energy. In MWSN can have more challenge compare to WSN that are dicult to send a routing path, processing, storage ca- pacities and energy, each node needs to eective resource management policies [8]. Several applications lead to several architectures and design constraints. Since the performance of a real time routing protocol is relate well to architectural model, such as tree base, star base and cluster based architecture. As we have shown the following mobile wireless sensor network architecture, there are some node have static and some other have moveable capability. Figure 1.2: MWSN Architecture 1.2 Motivation In the IERTLD protocol has a good packet delivery ratio and expecte minimum end to end delay in wireless sensor network and mobile wireless sensor network compare to other routing protocol. We propose a (20%, 30% and 40%) dynamic wireless sensor network in which sensor nodes and the PAN Cooradinator nodes are mobile. It computes the optimal forwarding node (routing technique) based on Received Signal Strength Indicator so that the computing time is reduced. It 4
  • 15. also increases the packet lifetime in the network. By using Corona mechanism, it broadcast the packet to the one hop for every next one hop after that it work backward corona mechanism and each node have the capability if node a not forward the packet it backward it reduced the overhead and routing hole problems. 1.3 Problem Statement Unlike other networks Wireless Sensor Network suer from the problem of low battery power of sensor nodes and in multi hop routing it suer routing hole problem. To deal with such problem dierent routing protocols are presented and also discussed by the research community. These protocols are using dierent techniques to overcome such problem. In the RTLD and ERTLD protocol is one of the solutions to deal with the problem of low sensor energy by avoiding the data transmission directly to Base Station and optimum forwarding is reduced the routing hole problem. The objectives of ERTLD protocol are given here. • Reduced the communication overhead • Reduced the routing hole problem in static and dynamic network. • Increase the delivery ratio • Save the Power in network as well as sensor nodes • It uses corona mechanism to broadcasting and Unicasting, so reduced the delay between sink nodes to destination or mobile nodes. • Reduce network trac and the contention for the channel Real time protocol is one of the ecient protocols to overcome these problems. I also choose Real time protocol to reduce such problems. I have found some problem in the Real Time routing protocols as RAP, RTLD, SPEED, MM-SPEED and ERTLD. • In the dynamic network the routing hole problem is increase. • If the sink node is fail or below of threshold than the whole network is fail or need to reestablishment a new sink node. 5
  • 16. • There are need some channel assignment technique to reduce the channel overhead • In the mobile sensor need to manage mobile node management, that reduced the complexity problem. • Corona mechanism are apply but corona id is equal to transmission range, if transmission range is tilding some environmental condition than the Un- reachability problem can occur. For that I want to propose a new routing protocol that works same as ERTLD but overcome above problems. For that I am work on Improved ERTLD (IERTLD) Protocol and expect that my proposed solution will outperform ERTLD. 1.4 Objective Real time routing protocol is widely using in WSN. In Real Time Routing Protocol for Wireless sensor network (RTLD) works as a centric sink node and there are multi hope routing with respect to sink node. RTLD protocol is developed by A. Ahmed, N. Fisal in 2008. After that 2013 by A. Ahmed developed a ERTLD protocol based on previous RTLD protocol. It works on Mobile Wireless Sensor (MWSN) with load distribution and it also use corona mechanism to reduced the routing hole problem and neighbor management. Main objective of this thesis is to Improvement ERTLD protocol and achieved the following goal. • To increase the total life time in WSN and MWSN. • To achieved the minimum EtE delay and high packet delivery ratio. • To reduced the Routing Hole problem. • To increase the performance. 1.5 Thesis Outline This thesis is organized in 6 chapters where Literature survey in given in chapter 2 and discussion of Real Time Routing Protocol and proposed methodology is given in chapter 3, where discussion of tools used. The analysis and design of 6
  • 17. the project is discussed in chapter 4, chapter 5 discussed about implementation of project with results and nally conclusion and future work is given in chapter 6. 7
  • 18. Chapter 2 Literature Review WSN have important role in wireless technology. WSN s are consisting of thou- sands of nodes, each node having limited communication power, sensing capability and computational power [1] [2]. The networks have the capability of deploy a large-scale sensor network. A wireless network consists of small devices which monitor physical or environmental conditions such as pressure, pollutants or mo- tion and temperature etc. at similar but another areas, Such as sensor networks are expecte to be dierent widely deployed in a vast variety of environments for civil, military and commercial applications such as climate, acoustic data gath- ering, vehicle tracking, medical, surveillance, habitat monitoring and intelligence. The limitations of WSN are the power, storage, processing. Such limitations and the specic architecture of sensor nodes call for secure communication and energy ecient protocols. The reasonable of such inexpensive sensor networks is acceler- ated by the advances in Micro Electro Mechanical Systems technology, combined with radio frequency circuits, low cost digital signal processors and low power [9]. By the Gupta, G. Younis consist of power supply, microcontroller, radio transceiver, and the actual sensor. The sensing circuitry measures ambient condition related to the environment surrounding the sensor and transforms them into an electric signal [10]. Processing such a signal reveals some properties about objects located and/or events happening in the vicinity of the sensor. The sensor sends these col- lected data, usually via radio transmitter, to a command sink node either directly or through a data concentration center. Sensor nodes are spatially distributed apart from the region that has to be moni- tored, self-organize in to a network via wireless communication, and it collaborate 8
  • 19. with each other to do the common task. Basic and simple features of sensor networks are dynamic network topology, mobility of nodes, selforganizing capa- bilities, node failures, multi-hop routing, limited power, large scale of deployment and short-range broadcast communication [11]. Strength of the wireless sensor network lies in their scalability and exibility. The capability of wireless com- munication and self-organize made them to be deployed in ad-hoc fashion in re- mote hazardous location without the need of any existing infrastructure. Through multi-hop communication a sensor node may communicate other sensor node that is far away in the sink node or sensor network. This is allow the addition of sensor nodes in the network to expand the monitored area and hence proves its exibility and scalability property. The main challenge in sensor networks is to maximize the lifetime of sensor nodes due to the fact that it is not feasible to replace the batteries of thousands of sensor nodes. Therefore, communication protocols must be made as energy ecient and computational operations of nodes as possible. Among such kind of protocols have more importance in terms of energy, since the energy required for data transmission it takes 70% of the total energy con- sumption of a wireless sensor network [2]. Now a day there are dierent types of commercially available sensor nodes. University of California at Berkeley has developed Mica mote that is a special purpose sensor node. Other special purpose sensor nodes available are Spec, Rene, Mica 2, Telos etc. Some high bandwidth sensor nodes available are BTNode, Imote1.0, Stargate, Inryonc Cerfeube etc. [12]. 2.1 Wireless Sensor Network WSN is potentially one of the most important technologies of recent century. There recent advancement in wireless communications and electronics has enabled the development of low-power, low-cost, multifunctional miniature devices for use in several real time applications. The combination of these factors has improved the viability of utilizing a sensor network. It is consisting of a large number of intelligent sensors, processing analysis, enabling the collection and dissemination of valuable information gathered in several varieties of environments. By C. Lu and at all a wireless sensor network for real time routing protocol are 9
  • 20. classied into two category one is RT routing protocol for wireless sensor network and another are real time routing protocol for mobile wireless sensor network. Several protocols work on WSN and MWSN for routing based on velocity [14], RAP (real time architecture and protocol) are provide service dierentiation in the time lines domain by velocity- monotonic classication of packets. It depends on packet deadline and destination, required velocity to calculate and need to determine the priority in velocity-monotonic order there for high velocity packet can be send earlier than a low velocity of them. SPEED and MM-SPEED [15], protocol based on stateless which is real time communication in WSN. They work EtE communication based on uniform communication speed in multi-hop in the network. RTLD compute the optimal forwarding techniques based on packet re- ception rate, remaining power and packet velocity over single hop of the sensor nodes [16]. It gives better performance in terms of power consumption, control packet overhead, delivery ratio. ERTLD design for static WSN as well as for dynamic WSN work several protocol like RACE work in MWSN, it provide quality of service requirements to the appli- cation layer and it also handing network congestions, Routing done node by node, where each node calculate the value that is known as score, to choose the best node to forward the message. The score consist of packet velocity, buer remain- ing and link quality [7]. Sidewinder protocol periodically predicts the current sink location based (sink location prediction) on distributed knowledge of sink mobil- ity among all node in a multihop routing process [17]. Such of the continuous sink estimation was scaled and adjusted to perform with resource-constrained in wireless sensors. By the Author s show that the impact of radio ranges on topology changes when nodes are mobile, we have conclude that traditional mobile ad-hoc routing proto- cols does not work Well when Mobility present in the networks. In other paper, the authors give test bed application that geographic forwarding based on sensor node location have poor performance in terms of end-to end delay and delivery ratio. It works well in static wireless sensor networks, but when mobility are present it gives poor performances in end to end delay and delivery ratio, be- cause only maintain local information to achieve end-to-end routing. However, 10
  • 21. a common assumption of these geographic forwarding-based protocols is that all intermediate nodes in a routing path know the exact sink location and use it for multi-hop routing. This assumption is good when the sink node is static, but it gives poor performance when the sink node is mobile. However, these protocols do not design for real-time forwarding that needs end-to-end delay enhancement to achieve good end to end delay and delivery ratio. By ERTLD protocol has corona mechanism to maintain high performance and provide the mobility for MWSN in end to end delay and delivery ratio. It used a backward corona mechanism to solve the routing hole problem. It also produces more exibility to forwarding [8], It compute the optimal forwarding node based on RSSI and work on highly dynamic wireless sensor network, that reduce the unnecessary calculation time. But ERTLD protocol work poor when tilding transmission range and highly dy- namic the fast forwarding and network fail if PAN coordinator is fail or below of threshold. In the VLEACH routing protocol [18], reduce the energy consumption and increase the total lifetime compare to the LEACH protocol. The LEACH protocol based on cluster, but in the Real time protocol work with Network. When dierent- dierent network are work then the voice sink node (like voice cluster head [8]) work and may increase the total lifetime compare to ERTLD protocol. 2.1.1 Sensor Network Challenges WSN are used several real time applications such as public safety, physical world, automotive, agriculture and airport etc. and to impact these applications in real world environments, we are required more ecient and eective algorithms and protocols. Designing a new algorithm or protocol, needs to explain some chal- lenges [4]. These challenges are shown below: • Deployment Sensor network are infrastructure less, each sensor node have the capability of random deployment. In the real life, there are several applications are requires to ad-hoc deployment. Sensor networks, Sensor nodes have the ca- 11
  • 22. pability of random deployment over the region without any prior knowledge topology and infrastructure. Here the each node has the information about connectivity and distribution among them. • Scability In the real time application most of them are needed scalability. In the net- works, the number of sensor nodes deployed must be in order of hundreds, thousands or more. The sensor network must be scalable to respond and operate with such large number of sensor nodes. • Fault-Tolerance In the real time application, sensor node can fail or below of threshold value due to lack of energy and physical damage. If some nodes fail, the working protocols must accommodate these changes in the network. As an example, for routing or aggregation protocol, they must nd suitable paths or aggre- gation point if these kinds of failures. • Quality of Service Real time application, the sensor network need some applications are very time critical that means the data should be delivered within a certain period of time from the moment it is sensed, otherwise the data will be unusable. such kind of application must be a QOS parameter. • Unattended operation Some application are required when some nodes are deployed once, and after deployed once there are no need human intervention. Hence the sensor node needs to themselves are responsible for any change or reconguration. • Security In the real time applications the security is most important parameter. In 12
  • 23. the sensor network, security is very critical parameter. When data trans- mit from one sensor to another, the security parameter have important role for secure communication in the sensor network, unlike traditional networks also focus on maximizing channel throughput with secure transmission. • Physical Resource Constraints The main constraint imposed of limited battery power in the sensor net- work. Almost the time eective lifetime of a sensor node or sensor network is directly determined by its power supply. Hence the energy consumption is main issue for designing a protocol. Limited memory size and computational power is another constraint that aects the computation and the amount of data that may be stored in individual sensor nodes. The design protocol should be light-weighted and simple. By the limited communication channel in the sensor network the communication delay can be high. 2.1.2 Characteristics Characteristics of sensor networks, which have some special features such as re- source constraints, type of nodes, application specic, topology and fault tolerance etc as shown below [13]: 2.1.2.1 Network Topologies In the wireless sensor network have used several topologies such as mesh, star and tree topology. It represents reachable ability of sensor nodes in the sensor network. Some time the sensor nodes move from one position to another then the WSN topology may be a dynamic. For example, the exiting nodes may fail due to physical destruction or lack of energy and some new nodes may join the net- work. Therefore, the sensor network must be able to recongure itself periodically 13
  • 24. 2.1.2.2 Application Specic Most of the time wireless sensor networks tightly dependent upon the applica- tions and application designs and management of architectures in wireless sensor networks are also dependent on application semantics. We know about the ap- plication designers, most of time they have to develop many complex and special program to perform data routing, data aggregation tailored and node localization to specic sensor networks applications. 2.1.2.3 Environment Sensor networks are location geographic, the nodes can be deployed in hostile, harsh and widely scattered environments. Such environments will rises to chal- lenge other mechanisms like managements. And the other ways of the spectrum, sensor nodes are occasionally deployed densely either in directly inside the envi- ronment to be observed or close proximity of the environment to be observed. 2.1.2.4 Types of Nodes WSN s involve with three types of sensor nodes names sink node, full function node and reduced function nodes. Full function nodes are mainly responsible for collecting sensor data, or occasionally involving with collaborated tasks with neighborhood nodes. Due to limited storage full function nodes don t have extra storage space to hold large amount of sensor data (or processed data). It may take simply data processing if necessary. Other sink nodes responsible for broad- casting, storing, processing and receiving of data from fully function or reduced function nodes. Reduced function nodes that connect sink nodes. It doesn t have capability to connect malty hope communication. 2.1.2.5 Resource Constraints As mentioned previously, resource-constrains of sensor nodes is another unique feature of WSNs. Sensor nodes usually compose of four basic units sensing unit, a processing unit, a transceiver unit, and a power unit. The power unit supports all 14
  • 25. the activities on a sensor node, including communication, local data processing, sensing, etc. The lifetime of a sensor node is mainly determined by the power supply since battery replacement is not an option in sensor networks, especially in critical environments as battleelds or environment monitoring. The longer the lifetime of a sensor, the more stable the WSN s. 2.1.2.6 Fault Tolerance Failures are prone to happen in WSNs, which normally include sensor nodes failure (as discussed previously), and communication failures etc. Although the sensor application may have already considered this in their design, there is still a need for WSN to have the ability to recongure and recover itself without too much human being intervene, especially in inaccessible environment. 2.2 Applications The WSN has several application of across the spectrum of human endeavors. It has to control of environmental systems and monitoring such as engineering manufacturing and design, forest re tracking, critical infrastructure protection, battleeld surveillance, disaster management and health care. The real world several applications are involving which have the capacity of sensed data collection and dissemination are depicted as showing the following gure 2.1.1that the way that data ow from its source to the anticipated sink. 2.3 Routing Protocol In Wireless Sensor Network Routing protocol based on network as following. 2.3.1 Location Based Routing The sensor networks are used several protocol for nding the route that is known as routing protocol. Most of the routing protocols are requiring location infor- mation for nding the path. For estimation of energy consumption, we need to 15
  • 26. Figure 2.1: Sensor Network Applications calculate the distance between two particular sensor nodes. Because, there is no addressing scheme for sensor networks like IP-addresses and they are spatially deployed on a region, the advantage of location information, it can be utilized in routing information in an energy ecient way. 2.3.2 Hierarchical Routing Hierarchical routing in the sensor network are use, to decrease the number of transmitted messages to the sink node by using the data aggregation and fusion. In the multihop communication [1] the hierarchical routing is to eciently main- tain the energy consumption in sensor nodes. 2.3.3 Geographic adaptive delity The energy aware routing protocols are used to inform neighbour selection heuris- tics to route the packet towards a sink. By using direct diusion the restrict number of interest are consider a certain region rather than whole network for sending the interests This type of protocol are takes more energy conserves. 16
  • 27. 2.3.4 Flat Network Routing The main advantage of at network architecture are the potential for the dis- covery of multiple route s between communicating node s for fault tolerance and including minimal overhead to maintain the infrastructure [10]. In the multihop at network s, there is each sensor nodes typically plays the same role and col- laborate to perform the sensing task. In the Large number of sensor node s or large sensor network is not a feasible for assign a global identier to each node due to data centric, where the sink node or base station sends queries to certain regions and waits for data from the sensors located in the selected regions. Since data is being requested through queries, attribute-based naming is necessary to specify the properties of data. In the previous work on data centric routing (e.g., directed diusion and SPIN) was shown to save energy through data elimination and data negotiation. 2.3.5 Geographic and Energy Aware Routing It is an energy-aware location-based routing protocol and designed for mobile ad hoc networks, but now a day it can be applicable to sensor network s or mobile sensor networks. It is conserves energy by using the unnecessary nodes that is not working or not using, turn o such unnecessary sensor nodes without aecting the routing or level of routing delity. It creates the virtual grid to cover the area. That the association of virtual grid are possible by using each node which is used GPSindicated location. Such types of node association are equivalent in terms of the cost of packet routing. So that the energy are saving and the network lifetime are increased as many nodes energy are saved. 2.3.6 SPEED A SPEED is a QoS routing protocol. Such protocols are provides soft real-time end-to-end guarantees [5]. SPEED protocol is requiring maintaining node infor- mation, such as its neighbors and uses geographic forwarding to nd the paths. It also has the information about the speed to the each packet in the network that 17
  • 28. each and every application may be estimate the end-to-end delay. It also has the capability to making the decision and provides congestion avoidance. The routing module in SPEED is called stateless geographic non-deterministic forwarding. 2.4 Routing Challenges and Design Issue The WSN s have several restrictions, such as limited power consumption, limited bandwidth links connective and limited energy supply. Routing challenge are one of the main design goals of WSN s. The routing of WSN s are most important challenging factors, routing challenging element must be overcome before ecient communication will be achieving in WSN s. I have summarized in the following some of the routing challenges as well as design issues that aect the routing process in WSN s. 2.4.1 Transmission Media In a multi-hop sensor network, communicating nodes are linked by a wireless medium. The traditional problems associated with a wireless channel (e.g., fading, high error rate) can also aect the operation of the sensor network. In general, the required bandwidth of sensor data will be low, on the order of 1-100 kb/s. Related to the transmission media is the design of medium access control (MAC). One approach of MAC design for sensor networks is to use TDMA based protocols that conserve more energy compare to contention based protocols as CSMA (e.g. IEEE 802.11). Bluetooth technology may also be used [4]. 2.4.2 Node Deployment In the WSN s, the node deployment is one of the aecting parameter in the routing protocol. The node deployment can be either randomized or deterministic. In the deterministic, the node deployment is not a bit challenge but in random node deployment, the infrastructure is creating in an ad hoc manner. The sensor nodes are scattered randomly. If the deployment of node is not a uniform, then the optimal clustering becomes important role to allow connectivity and enable energy ecient network operation. 18
  • 29. 2.4.3 Network Dynamics The sensor network has main three components which are monitoring events, sensor nodes and sink node. We need a few of setup to utilize the mobile sensors. Most of researchers are assume that the sensor nodes are stationary. And other hand, sink node is sometimes deemed necessary, because it may be static or may be mobile. And the event which is sensed may be either static or dynamic depending on the application. For instance, the forest monitoring for early re prevention is static events and in a target detection/tracking application is dynamic. 2.4.4 Node Mobility Mobility of the sensor network has of both PAN Coordinator and sensor nodes. Both of them are sometimes important depend s on applications. When routing is performed then the moving nodes are more challenging and route stability will become an important issue in the sensor network. There are some other parame- ters like energy, bandwidth and others like sensed phenomenon may be static or dynamic depends on the application. If it is dynamic for detection/tracking then the dynamic events more applicable while it is static then static events are more applicable [4]. 2.4.5 Scale and Density The scaling of the sensor network s are deployments of the node in the sensing area. There are may be hundreds or thousands or more nodes in the deployment area. In the deployment of the sensor node are necessary to apply the any one routing scheme and sensor network routing protocols should be scalable and also respond to events when require. The density, only parts of the area of covered by the sensor nodes. Which are dense in the form of sensor nodes like how many nodes are present per square area, the area of interest is completely covered by sensor nodes. Some time multiple sensor nodes cover the same area. The network lifetime can be extended by switching the redundant sensor nodes to power-saving sleep modes. 19
  • 30. 2.4.6 Coverage WSN has a limited area covered by using several sensor nodes and each sensor node also have the limited range as well as accuracy. Here sensor nodes have covered only limited physical area of the environment. Hence, the how much area is covered is also an important design parameter [4]. 2.4.7 Connectivity The connectivity is depends on the random distribution of sensor nodes [4]. Such connectivity can be as topology. Need to highly connected network for the purpose of strong connection. If the sensor nodes are not deployed appropriate so the network topology can not be work appropriate. Hence the connectivity becomes an important role of design parameter. 2.4.8 Quality of Service The quality of service is also the important design parameter in the sensor network because of some applications data should be need to delivered within a certain pe- riod of time from the moment when it is sensed otherwise the data will be useless. So there is some limitation for minting the quality of service because of condition applications as time-constrained applications. Some other many applications, as energy conservation, that is related to network lifetime, it is more important than the quality of data sent. 2.4.9 Energy Consideration The node lifetime is show a strong dependency on the battery lifetime [1] in the sensor network. Sensor nodes have limited energy and limited processing power. But the essential need of communication and computation. The sensor network has multi hop communication then, each node plays a dual role as data router and data sender. Some sensor nodes failure due to power failure, so need to change the topological signicant and might be require rerouting of sensor networks [4]. Multi-hop routing is consuming less energy than direct communication. 20
  • 31. 2.4.10 Data Aggregation Data aggregations in the sensor network are used to reduced the fault or make too sure that the delivery ratio will increase. Since sensor nodes can be generating signicant redundant data. Data aggregation is technique to combine data from dierent sources and apply the same function like minima, maxima, duplicate, average and suppression [4] and these functions can be performed either partially or fully in each sensor node. 2.4.11 None Capabilities The sensor node has dierent capabilities in the sensor network. In the previous work some researcher s assume that all sensor nodes are homogenous. So that such nodes have equal capacity in terms of power, communication and computa- tion. But depending on applications a sensor node may be dierent in term of this capacity and a particular function such as sensing aggregation and relaying. 2.4.12 Fault Tolerance The sensor network has hundred s or thousand s of sensor nodes, some nodes may be going to below of threshold value or it may be fail or do not able to work, Due to physical damage, lack of power and environmental interferences . These nodes are going to fail. The whole network will aect but by managing such failure should not be aect the overall task of the sensor network. By using MAC and routing protocols will not aect many nodes fail, because routing protocol and MAC must accommodate formation of routes and new links where the data can be sends or received to or from sink nodes. Fault tolerance may needs to actively adjusting transmit powers as well as signaling rates on the existing links to rerouting packets through regions and to reduce energy consumption of the network where more energy is available. Therefore, multiple levels of redundancy may needs in a fault tolerance in the sensor networks [4]. 21
  • 32. Chapter 3 Propose IERTLD Protocol Design In the ERTLD Protocol have four elds which are power management, routing management, corona mechanism and neighbor management. The previous pro- tocol RTLD based on location management in place of corona mechanism. The location management techniques are calculating the sensor node based on three pre determine location of the neighbored nodes, When static WSN it work well but the mobility it not work eective, the ERTLD work with corona mechanism in place of location management. The previous protocol (RTLD) is compute optimal forwarding node based on packet velocity over one hop, remaining power of sensor nodes and PRR. PRR can be calculated approximately as the probability of re- ceiving successfully a packet between two or more neighbor and reects the very dierent link qualities within the corona width, and it also decreases the calcula- tion time by utilizing RSSI. The RSSI value is built-in physical layer, so no need to require extra calculation. If a sensor node or mobile sensor node does not able to forward packets to the neighbour or the next-hop neighbor, the mobile node have capable to do backwards mechanism, which is a mechanism to backwards the packet to the high corona level to any neighbour, which can follow the optimal path and it will inform its parent to stop the sending packet. that the parent node will select to forward the new neighbour nodes, so that the routing hole problem can be reduced. And the each node has the autonomous body and it will select new forwarding nodes. The backward mechanism provides the guarantees to stop the dropping of data packet in the sensor nodes and mobile sensor nodes or its parent. Such types of mechanism are not founded on previous protocols. 22
  • 33. 3.1 IERTLD Protocol Design The IERTLD have same four elds in the previous protocol, but we manage the corona birth and there is corona ID is always less the transmission range in a sensor node. We have shown the following g 3.1, so that there are total four elds which are corona management, neighbour management, power management and routing management. The corona mechanism is capable to calculate the each sensor node corona level based on the distance to the sink node. The routing management can be to handle routing problem, nd the forwarding mechanism and choose the optimum forwarding. The neighbour management is capable to maintain the neighbour table and also discovers a subset of forwarding nodes. The power management has the capability to determine the state of the transmission and transceiver in the sensor network. Figure 3.1: IERTLD Block Diagram 3.1.1 Corona Management Firstly we need to determine corona ID (C_ID). The sensor network has a PAN coordinator, PAN coordinator is broadcast the packets to the one hop neighbour in periodically and these neighbour also broadcast to next hop neighbour further 23
  • 34. this process continue within the network. In the MWSN as shown the Fig 3.2,Fig 3.3 and Fig 3.4 after deployment immediate, we assumed that the PAN coordina- tor are middle in the MWSN and corona belong to concentric circle with respect to the PAN coordinator. The corona width is less than the transmission range r, so that the unreachability and packet drop can be reduced. Hence the (outer) radius ri of corona Ci is less than to ri. The use of corona mechanism is to impose a PAN coordinator in such a way that each sensor exactly belongs to one corona level. So that identify each sensor node, which nodes are belongs to which corona level. As showing the below in Fig 3.3, the corona is concentric to the PAN coor- dinator and in the one hope there are one voice PAN coordinator as showing in red color. PAN coordinator is also having mobility, after travelling and changing of MWSN coordinate system (CS) or corona and the PAN coordinator may be travel to random position, the CS of MWSN and the C_ID of sensor nodes are changed accordingly as changing to the PAN coordinator as shown in Fig 3.4. In the Fig 3.4 are also based on data packet forwarding from the mobile node to the sink node or mobile PAN coordinator. Figure 3.2: Corona mechanism eects : MWSN immediately after deployment 24
  • 35. At the high level of corona, the data travel from mobile sensor node or sensor node to low level corona of mobile sensor node or sensor node. If the sensor node cannot have any entry in the neighbour table to low level corona sensor node, so that it forward the data packet to the same corona level which is in neighbour table. It is initiated at the PAN coordinator which are broadcast CCP packet to all one-hop neighbours. Figure 3.3: MWSN using corona concentric to PAN coordinate Corona Control Packet (CCP), Corona ID (C_ID) C_ID initial at 0 and CCP_ID are most important parameter in the corona mechanism. If mobile sensors nodes are receive CCP, then it will fetch CCP_ID and C_ID after that it will check CCP_ID has already received or not to the CCP. If mobile sensor node (MSN) has received CCP then it will discard CCP_ID. Otherwise MSN will increase C_ID eld in the CCP and also save the new value of C_ID as its corona level. After increasing C_ID the MSN will broadcast CCP to its neighbor nodes. There is important and useful information, the PAN coordinator has produced only one CCP, If MSN or SN cannot receive CCP in case of the hidden problem or sleeping mode, so that it need to utilize the old C_ID. If the C_ID is equal to zero, then 25
  • 36. Figure 3.4: PAN after traveling and changing of MWSN PAN coordinate system MSN will immediate change its status to the idle mode and wait until it gets new C_ID. If the topology is change dynamically, in such case the PAN coordinator will broadcast CCP in periodically and previous scenario will be repeated. So that the any change of network will not be aect to the corona mechanism. 3.1.2 Routing management The routing management inbuilt three sub processes which are forwarding mech- anism, routing problem handler and forwarding metrics calculation. Here no need extra calculation because of RSSI, we chose optimal nodes rely on RSSI, the re- maining power and the delay per hop. Unicasting technique are used to select the way of forward data and the routing problem handler will handle the routing hole problem due to loss of energy, below threshold value, sensor node crash and hidden sensor nodes in network. 3.1.2.1 Forwarding Mechanism Unicasting forwarding mechanism is used in the IERTLD protocol for forwarding to the route data packet from MSN and towards the PAN coordinator. Unicast 26
  • 37. forwarding, the source node which in MSN is checking the C_ID of every neigh- bour in neighbour table, If C_ID of any neighbour node is less than the source node C_ID or equal to source node C_ID, the optimal forwarding algorithm is apply and choose the optimal neighbour node. If in the neighbour table cannot has C_ID less or equal to source node C_ID, then the source node will check neighbour discovery and choose the optimal forwarding. Once the optimal for- warding choice is nd, the data packet will be Unicast to the selected node and this procedure will be continues until the PAN coordinator is one of the selected node s neighbours. The neighbour discovery may fail due to when there is no neighbour nodes are found in that direction where the destination. Such type of problem will solve by using the routing handler as described in the next section. 3.1.2.2 Routing problem handler The MWSN have a routing hole problem, the hole problem dened the failure of route due to sensor node fail or node deployment. Such problem can be solved in IERTLD protocol by using only backward mechanism that is also known as slow recovery method. We cannot use fast recovery using power adaptation method because the fast recovery is applied when the diameter of the hole is smaller than the transmission range at the maximum power. So we dont need to apply the fast recovery. Because of in 87% (70 times I have checking out of them 61 times it will need to apply slow recovery) the fast recovery method is not solving the routing hole problem due to node deployed or not nding node within the diameter of transmission range in MWSN. Fig 3.2 shows the slow recovery in IERTLD, in this gure OF node y has data packet from parent node p, MN y will search in its neighbour table about higher corona (C_ID of MN + 1) and will select OF from dierent candidates. In such case the data packet need to send backward corona mechanism. In Figure 3.2, we assumed MN y sends data packet to MN z and will also inform MN p to stop sending data packet toward itself. This mechanism is called backward corona mechanism. When p received backward control packet, it will implement routing management again. During the time that MN p search about new OF candidate, MN y will forward data packets backward to MN z. In this scenario, MN p has two chooses z or Q. 27
  • 38. 3.1.2.3 Optimal forwarding The IERTLD protocol has used optimal forwarding (OF) technique. In the OF we need to calculate three parameters which are remaining battery power, RSSI link quality and packet velocity for every one hop neighbours nodes. Dispute, the router management is forwarding a data packet to the one-hop neighbor that has an OF and the OF is compute as previous protocol ERTLD. 3.1.3 Neighbour management The neighbour management is a discovery of subset of forwarding candidate nodes. It also has the capability to manage the neighbour table. The limitation of neigh- bour table there are limited memory and it support at most 16 neighbour nodes. So, the design of neighbour table need to a small set of forwarding candidates that are most useful in meeting the one-hop end-to-end delay with the reaming battery power and optimal packet reception rate. The neighbour table has contains RSSI, CCP_ID, one hop end to end delay, node ID, remaining power, location informa- tion, expiry time and C_ID. The neighbour discovery is a procedure to execute the initialize stage and to identify a node that satises the forwarding condition. It also introduces small communication overhead, which is necessary to minimize the time and it takes to satisfactory discovery. 3.1.4 Power management The power management is to adjust the power of the transmitter as well as transceiver and select the sensor node transmission power level. By using power management the energy consumption are reduce for each and every sensor node between source and destination, so increase sensor node lifetime. The increas- ing lifetime of sensor nodes and sensor network by, to control packet overhead, minimizes the energy wasted by idle listening and to minimize the energy con- sumed. According to the data sheet values, the receive mode has a higher power consumption than the all other modes or states. In IERTLD protocol, the sensor nodes are sleeping mode most of the time and it is going to changes its state to idle state, if neighbour nodes in the direction of the destination. There for, if 28
  • 39. the sensor node wants to broadcast request to route, it will changing its state to transmit mode. Then, it changes to receive mode, if it wills receiving reply or data packet from its neighbour and rest of the procedure are follow the previous ERTLD protocol and power management process all most similar to that protocol. 3.2 Voice PAN Coordinator Voice PAN Coordinator (VPAN coor) is work as a PAN coordinator, when PAN coordinator is fail or below of threshold value. VPAN coor continuous communi- cate to the PAN coor and maintain the previous state, if PAN coor fail or below of threshold than the VPAN coor work as a PAN coor and broadcast the packet to neighbour by using C_ID and C_ID set as dynamic to its value according to around us (C_ID=1). Shown the below g 3.5, the PAN coor is fail and VPAN coor work as PAN coor. Here the VPAN coor change the corona ID and broad- cast the CCP to the all neighbours and further all other mobile sensor nodes or sensor nodes can broadcast until the whole network and the entire mobile sensor node nd the corona ID and corona control packet. Further all processes work as previous section like PAN coordinator. By using the voice PAN coordinator the network life time are increases up to 30 % compare to previous ERTLD protocol on my experiment result. Figure 3.5: Voice PAN Coordinator work as PAN coordinator when PAN coordi- nator is fail or below of threshold value 29
  • 40. Chapter 4 Implementation Detailed A research methodology is a collection of techniques, documentation, methods and tools, which help to the system designer, analyzer, developers, designer and implementation of the system software s. Here we will describe the methods to use the conduct research and the fact nding techniques employed. There is various research techniques use to gather data and analyze the WSNs routing protocols. 4.1 System Requirements The minimum system requirement for implementation of the proposed protocol is given below, including hardware and software requirements: 4.1.1 Hardware Requirements Memory Size: 512 MB or above. Hard disk space: 40 GB CPU: Pentium IV, 2.0 GHz or above 4.1.2 Software Requirements Operating System: Linux, Ubuntu-12.04, any linux invirolment OS Simulator: NS2 any version Supporting Packages: GCC, TCL/TK 30
  • 41. Documentation: LaTex/Microsoft Oce Excel/Linux Open Oce/Spreadsheet/X- Graph Scripting Package: Perl, Awk 4.1.3 Operating System and Memory Network Simulator 2.35 [16] are install either in a UNIX environment (or LINUX) or Windows (2000 and XP) environment. However, in a XP and Windows en- vironment, it is necessary to install a UNIX emulator such as Cygwin prior to the installation of the NS2.35 software. The main disadvantage of performing the simulation (NS2.35) in a XP or Windows environment is the stability and support of the software. The simulations of the work conducted and run on all are done in a UBUNTU-12.04 LINUX environment. Because of the NS2.35 software is highly stable in a LINUX (UBUNTU) environment. The need of hard disk space at least 20 GB for allocation of the space for this simulation purpose. 4.2 Computer Simulations Generally the analyzing techniques are used to the performance of any wireless networks, which is measure in computer simulation, analytical methods and physi- cal measurement [18]. The sensor network technology is experimental equipments, WSN simulations appear to be the only feasible approaches. NS2 provided a pow- erful method or technique for simulating the behavior of computer networks. To clearly observe and investigate the performance of an each particular routing pro- tocol, the simulation experiments have used to mimic the sensor network. Separate routing protocols have applied to the network and their performance analyzed. 4.2.1 Existing WSN Simulators In the world wide there is more need to simulate the networks. Because real time network cannot be possible or very tropical to work on world real time network. So network simulators are very important for analyzing several design protocols 31
  • 42. for a network and it is very well known in the eld of research. Many research eorts have been made to develop new tools and environments for WSN simu- lations such as OPNET, SENSE, OMNeT, J-sim and NS2 etc. [17, 18]. Now a day very popular tools like OPTEN, OmNET++, GlomoSim and NS2. But none of these simulators perfectly meet the demands of sensor networks. For example, OMNET++ are not easily available or not a open source, another simulator NS2 is not specically designed for sensor network and it is not simple to simulate, some are commercial simulator too infrequently used to easily allow comparison of results with work of other researchers. Shown the following table, here briey describes common sensor network simulators, Network simulators are very impor- tant for analyzing various protocols designed for a network in the world wide. 4.3 Introduction to the NS-2 Network Simulator NS2 simulator has two languages by, using two languages the time is saving. Otcl is an interpreted language; it is slower than the C++ or other compiled language. But it not needs extra time to modication. C++ is a powerful and fast executable programming language, some modications, may be requested to the simulations. In the network simulator NS2 are used feasible for unication through Otcl language. The c++ language are keeping the main structure of the simulation but modifying some parameters, with the purpose of comparing dierent results. That implies additional time recompiling C++ code each and every time a need to modication. So Otcl have advantage that these modications do not need additional time recompiling. The main objects of a simulation such as sensor nodes and protocols are implemented using C++ and the conguration of the parameters such as time of the simulation ,number or position of nodes, etc. are implemented in Otcl language. In the previous years, ns- 2 became a most popular tool in mobile wireless sensor network or MANET research, because of it includes wireless and ad hoc networking support in mobility and easy conguration scripts and les. Hence, the NS2 is an interpreter of OTcl with NS2 object libraries. 32
  • 43. 4.3.1 Architecture of NS-2 NS2 is a discrete event simulator written in C++ language, with an OTcl inter- preter as a front-end. The simulator supports a class hierarchy within the OTcl interpreter we call it the interpreted and similar class in C++ we also call it the compiled hierarchy. Both of the two hierarchies are related to each other. From the user's perspective, there is a one-to-one correspondence between a class in the interpreted hierarchy and one in the compiled hierarchy. The root of this hierar- chy is the class Tcl object. The users are creating new simulation objects through the interpreter. Such objects are closely mirrored by a corresponding object and instantiated within the interpreter in the compiled hierarchy. The interpreted class hierarchy is automatically established through methods dened in the class TclClass. User instantiated objects are mirrored through methods dened in the class Tcl object. Figure 4.1: OTcl/C++ Duality show 4.3.2 Running Simulations The main components of the ns-2 are the input simulation program, the simu- lation results, the event scheduler and network objects. For managing all these events and objects is scheduler an OTcl script and they should be dened, i.e. the input simulation program. The NS2 simulator, the event scheduler keeps a record of simulation time triggering all events in the event queue scheduled at this moment. The communication among network components does not consume simulation time, except the necessary time that a sensor node needs for implying a delay and handling a packet, which is managed by the event scheduler. Here the event scheduler is also used as a timer, e.g. the execution of the ns-2 and in a packet retransmission is mainly the execution of an OTcl script. 33
  • 44. 4.3.2.1 Scenaios In the NS2 simulator, the simulation scenarios are scripts, which is necessary to dene and it is composed of routing information, agent and topology. Scenarios have the rst step is to initiate a simulator instance and choose the output for the position and the results and numbers of nodes are congured. In future we should be dened the transport protocol agent and links among nodes and the last step is to be dene the routing protocol to be used for this simulation. The results of these simulations are one or more text les which containing detailed simulation data. Such of these les can be used for simulation input for a visualization or analysis. These les are also known as NAM (Network Animator). 4.3.2.2 Nodes The NS2, in the network have several nodes and each node is crucial for the trans- mission of data packets or a packets. When receiving such Packet in the nodes, the elds of these packets is analyzed, which include the destination address, which is the receiver node. In the NS2, all nodes have at least the following elds or components: • List of neighbors • A routing module and conguration of each node takes place in the denition of scenario. We need to set up important parameters for this simulation, such as the type of routing, network components for mobile nodes and type of addressing structure used. • Id or address, monotonically increasing by 1. For simplicity it is started at o, here across the Simulation and namespace are created. • Node type • List of agents 34
  • 45. 4.3.2.3 Agents NS2 simulator are used Agents for the implementation purpose of protocols. NS2, the language OTcl is possible to modify and create objects of type agent and it is also possible to create methods, composed of internal state, new Agent class, supporting packet generation and reception. 4.3.2.4 Traces Files In the ns-2 has main objective to provide the dierent type information from the simulated results. There are three types of trace les, the new format, the old format and a tagged trace format. 4.3.3 Adding Protocols to NS2 NS2 has two languages C++ and Otcl. The Otcl language is use for the descrip- tion of applications and models and the C++ language are use for core simulator. The simulation of protocols are requires to manipulation of large data sets at high run-time speed, so need C++. When the network researcher is require low iteration time than it is usually needed to vary parameters and need re-run the simulation several times to compare results in previous protocols. Otcl can be change very quickly but runs much slower than C++. The simple steps to add a new protocol. NS2 consists of creating a C++ class and conguring the simulator in order to allow OTcl end users to access this new class. I extracted the such information which you can refer [18]. 4.3.3.1 Adding the New Agent to NS In the NS2 are adding the new C++ class, we need to edit the le Makefile of net- work simulator directory. In the directory have variable which is called OBJ_CC that contains the name of the objects which is created while compiling, before linking he object le newagent.o has to be added in that variable: OBJ_CC= ... newagent.o ... After adding new class we can execute the make command and run TCL Scripts. 35
  • 46. 4.3.4 Overview of Mobile Node in NS2 The implementations of a mobile node in network simulator are shown in Fig. 4.2, and whole processes are described as follow. Firstly start The Application, it creates datapackets” and sent to the Agent. The Agent works the network-layer and transport functions of the protocol stack and after that the Agent sends data packets to the CMUTrace. The CMUTrace has writes statistics about the data packets to the trace les and packets are sent to a Connector. The Connector is passes to the Link-Layer of Queue, if there are packet then packet are added in the queue otherwise packets are transmitted. When the packet is removed from the Queue, it is sent to the medium access control layer. In the MAC layer, where media access protocols are run and nally, the data packet is sent to the network interface. In the network interface, it provide correct transmit power which added to the packet and sent through the proper channel. The channel sends a copy of these data packets to each node which is connected to the corresponding channels. Such data packets are received by each node's in the network interface and then passed through the MAC, Link-Layer, Connector, CMUTrace, and Agent functions. The nally agent depacketizes such data packet and sends notication of packet arrival to the Application. Figure 4.2: Mobile Nodes architecture 36
  • 47. Chapter 5 Simulation and Results The Zigbee technology is used in the IEEE 802.15.4 standard. It gives several features such as low cost, less complexity and low power consumption. The simu- lation done by NS-2.35 in ubuntu 12.04 version of Linux based operating system. I have taken 101 sensor nodes, ones is PAN coordinator and all other are mobile sensor nodes or sensor nodes. Hare ones of them that is neighbour of PAN co- ordinator is Voice PAN Coordinator. The IEEE 802.15.4 standard is belongs to following position. Figure 5.1: Train of technology 37
  • 48. 5.1 NS-2.35 ow graph In the simulation based on network simulation NS2 version .35 are give ow of data. It takes Scenario generation and break into two le Scenario le and commu- nication le, these le shall operated based on mobility with NS-2.35 and produce the output les. In the output les shall take data processing and produced the IERTLD.tr and IERTLD.nam (Network Animator). By taken IERTLD.tr le gen- erates the plot by using GnuPlot. IERTLD.nam pictorial representation output of the trasle. Figure 5.2: Flow graph in NS-2.35 5.2 NS-2.35 Implementation ow graph With the help of ow graph as shown below, we follow the steps in to the im- plementation of our thesis, such as ns2.35 take the command directory, Mac, Tcl/lib, Trace and Queue directories in the rst phase. The second phase it takes the 802.15.4, Sensornet, CoronaM directories and third phase it take only 38
  • 49. IERTLD.scn le. In the command directory, it takes Packet.h le which have the information about packet. What is the size of packet and what is information inside the packet that information store in this le. Mac Directory: This directory work with c++ language which takes the in- Figure 5.3: Process description in ns-2.35 with implementation by representation of the directory format formation about Mac.cc le and 802.15.4.cc/.h les take the information about IEEE 802.15.4 MAC layer of the WPAN architecture. It may be handling about all the necessary information about this project. Tcl/lib directory: It is an important directory that contains three les, ns- lib.tcl, ns-mobilenode.tcl and IERTLD.tcl le. In these take the information about mobility functionality and library information these information calls by the IERTLD.tcl le. In the IERTLD.tcl le have information like routing, trac, monitoring, dened protocol and creating God, etc. Tracedirectory: In the trace directory, it takes information about what is takes in the out trace le. In the output trace le have several thousand of line. There 39
  • 50. are two le which is IERTLD.cc and IERTLD.h. Queue directory: It takes dynamic queue functionality and mange the queue information by using several eld in the neighbour table. 802.15.4 Directory: This directory takes the functionality about 802.15.4 protocol and takes about required information with the several les such as 802.15.4.h, 802.15.4_packet.h, 802.15.4.cc, 802.15.4_packet.cc and debug.cc Sensornetdirectory: It takes all the information about sensor nodes and sensor networks. It also have the in functionality application of sensor nodes and sensor networks. CoronaM Directory: It takes the functionality and feature of corona mecha- nism. As I have told in the previous chapter. IERTLD.scn in this le store the database of the deployment nodes. Here 101 nodes have deployed, which have information on this le. 5.3 How to get result The network simulation runs on command prompt than we write ns IERTLD.tcl. It generates the .tr and .man les. By using IERTLD.tr le write awk command on command prompt and nd the result le, by these les we can generate a graph by using GnuPlot. 40
  • 51. Figure 5.4: Awk command run on trace le and nd such .txt le for making results 5.4 Result based on static sensor network These result based on static network. In the static network, result may will same with some better performance compare to pervious protocols like RTLD and ERTLD. Compare the two protocols on the basis of Data Packet Received (packet rate) per Unit Energy Consumed (Energy per packet) with network size. Here the protocol IERTLD performed better compare to ERTLD protocol in average for small networks but better in the large networks. As shown the following Fig 5.5 and Fig 5.6. Figure 5.5: packet rate v/s energy per packet 41
  • 52. Figure 5.6: packet rate v/s Average EtE Delay Compare the two protocols on the basis of Data Packet Received (packet rate) per Average EtE delay with network. Here the protocol ERTLD performed much better compare to IERTLD protocol in average and small networks but in the large networks IERTLD work better. As shown the Fig 5.7 and g 5.8. Compare the two protocols on the basis of Data Packet Received (packet rate) and Delivery ratio, in case of static networks, delivery ratio are increases in average as compare to ERTLD protocol. In another result, the packet rate v/s normalized packet overhead, it will remain same as previous protocol. Figure 5.7: Packet rate v/s Delivery ratio Figure 5.8: Packet rate v/s Normalized packet overhead 42
  • 53. 5.5 Result based on Mobile sensor network Compare two protocols on the basis of Data Packet Received (packet rate) per Unit Energy Consumed (Energy per packet) with network size, simulate NS2.35 simu- lator. Here the protocol IERTLD performed better compare to ERTLD protocol when mobility is added on dierentdierent sensor nodes (average case mobility at 20%, 30% and 40%) in the networks. As shown the following rst gure 5.9. Compare the two protocols on the basis of Data Packet Received (packet rate) Figure 5.9: packet rate v/s energy per packet Figure 5.10: packet rate v/s Average EtE Delay per Average EtE delay with network. Here the protocol ERTLD performed better compare to my design IERTLD protocol in the network. In this case my design protocol gives worst performance compare to previous protocol. As shown the Fig 5.9 and Fig 5.10. When compare two protocol based on packet rate and delivery ratio, in case of mobility than IERTLD protocol gives much better performance as compare to ERTLD protocol. In the new design protocol give 76% delivery ratio that is 12% 43
  • 54. Figure 5.11: Packet rate v/s Delivery ratio greater than previous ERTLD protocol. In case of packet reception rate the new protocol give better performance as compare to ERTLD protocol as shown Fig 5.11 and Fig 5.12. Figure 5.12: Packet rate v/s Normalized packet overhead 44
  • 55. Chapter 6 Conclusion and Future work 6.1 Conclustion The IERTLD protocol provides good performance in delivery ratio, normalized per packet and energy per packet of the mobile sensor networks. The packet delivery ratio is increase 12% compare to other existing protocol. It will reduce the energy consumption by using backward mechanism. Backward mechanism provide the guarantee to deliver the data packet to the neighbour, so that the delivery ratio is increase. The packet reception rate and normalize packet are also in favor. At the static sensor network the delivery ratio, energy per packet and EtE delay may same but the highly mobility the new IERTLD protocol give better response compare to other existing protocols. When applying the corona birth are less than the transition range then the EtE delay increase, which is not a favorable. Voice sink node, the overall life time or aliveness of the sensor network are increase because of the sink node scattered or fail, than the voice sink manage all the processing and transceiver activity to the sink node. Network aliveness is increase 30% compare to ERTLD protocol. 6.2 Future work In the sensor netwrok s have mobility. In highly mobile sensor network need to manage the mobility at mobile sensor network because of highly mobility the delivery ratio will decrease and the increasing the EtE delay. The increasing EtE delay so need to manage the mobility withing the network. Further the EtE delay also reduced by using the mobility management techniques. 45
  • 56. Bibliography [1] Akyildiz I. F., Su W, Sankarasubramaniam Y, Cayirci E, 2002 Wireless sensor network: a survey, Computer Networks, 393-422. [2] Al-Karaki J. N. and Kamal A. E., 2004 Routing techniques in wireless sensor Networks: A survey, IEEE Wireless Communications, vol. 11, 6. [3] T. He, J. Stankovic, C. Lu, T. Abdelzaher, SPEED: a stateless protocol for real-time communication in sensor networks, in: IEEE Proceedings of the 23rd International Conference on Distributed Computing Systems, 2003, pp. 46 to 55. [4] Mainwaring A., Anderson J., Polastre J., Culler D., Szewczyk R. ,2002 Wire- less Sensor Networks for Habitat Monitoring, Proceedings of the 1st ACM International workshop on Wireless Sensor Networks and applications, 88-97. [5] Heinzelman, W. Application-Specic Protocol Architectures for Wireless Net- works. PhD thesis, Massachusetts Institute of Technology, June 2000. [6] Muruganathan S.D., Ma D.C.F., Bhasin R.I, and Fpojuwo A.O., 2005 A centralized energy ecient routing protocol for wireless sensor networks, Communication magazine, IEEE, Pp. 8-13. [7] Ahmed, N. Fisal, A real-time routing protocol with load distribution in wire- less sensor networks, Elsevier Computer Communication Journal 31 (2008) 3190 to 3203. [8] A Ahmed, An enhanced real time routing protocol with load distribution for mobile wireless sensor networks, Elsevier Computer Communication February 19 (2013) 1459 to 1473. 46
  • 57. [9] Akkaya K. and Younis M., 2005 A survey on routing protocols for wireless Sensor Network, journal of Adhoc Networks, vol 3, 325-349. [10] Gupta, G. Younis, M., 2003 Load-balanced clustering of wireless sensor networks, Anchorage, AK, United States. [11] Heinzelman W.R.,Chandrakasan A, and Balakrishnan H., 2000 Energy Ef- cient Communication Protocol for Wireless Micro sensor Networks, Proc. 33rd Hawaii Int l. Conf. Sys. Sci. [12] Nauman Israr and Irfan Awan, July 2006 Multihop routing Algorithm for In- ter cluster Head Communication, 22nd UK Performance Engineering Work- shop Bournemouth UK, Pp.24-31. [13] Heinzelman W.B, Chandrakasan A.P, and Balakrishnan H. 2002 Applica- tion specic Protocol Architecture for Wireless Sensor Network, vol. PhD: Massachusetts institute of technology. [14] C. Lu, B.M. Blum, T.F. Abdelzaher, J.A. Stankovic, T. He, RAP: a real time communication architecture for large-scale wireless sensor networks, in: IEEE Conference on Real-Time and Embedded Technology and Applications Symposium, 2002, pp. 55 to 66. [15] T. He, J. Stankovic, C. Lu, T. Abdelzaher, SPEED: a stateless protocol for real-time communication in sensor networks, in: IEEE Proceedings of the 23rd International Conference on Distributed Computing Systems, 2003, pp. 46 to 55. [16] E. Felemban, C. G. Lee, E. Ekici, R. Boder and S. Vural, Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks, in: IEEE Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005, pp. 2646 to 2657. [17] G. M. Arau jo, L.B. Becker, A network conditions aware geographical for- warding protocol for real-time applications in mobile wireless sensor networks, in: AINA 2011 IEEE International Conference, 2011,pp. 38 to 45. 47
  • 58. [18] Nutan sindhwani, rohit vaid, V LEACH: An energy ecient communication protocol for WSN, ISSN, January (2013) 2320 to 2491. [19] Chipcon, CC2420 Low Power Radio Transceiver, http://www.chipcon.com, (accessed on June 2011). [20] B. Bougard, F. Catthoor, D. Daly, A. Chandrakasan, W. Dehaene, Energy eciency of the IEEE 802.15.4 standard in dense wireless microsensor net- works: modeling and improvement perspectives, in: IEEE DATE 2005, 2005, pp. 196 to 201. [21] The Network Simulator NS 2, http://www.isi.edu/nsnam/ns/,(accessed on Jannury 2012). [22] http://www.ZigBee.org [23] http://www.ieee802.org/15/pub/TG4.html 48