Grin logo
de en es fr
Shop
GRIN Website
Publish your texts - enjoy our full service for authors
Go to shop › Computer Science - Technical Computer Science

Comparitive Performance Study Of Routing Protocols in Wireless Sensor Network

Title: Comparitive Performance  Study Of Routing Protocols in Wireless Sensor Network

Master's Thesis , 2012 , 121 Pages , Grade: 70%

Autor:in: Abid Afsar (Author)

Computer Science - Technical Computer Science
Excerpt & Details   Look inside the ebook
Summary Excerpt Details

Modern wireless sensor network can be expanded into large geographical areas via cheap sensor devices which can sustain themselves itself with very a low power usage. The networking capability enables these sensor nodes to incorporate, collaborates, and coordinates with among each other , and this is a fundamental shift in the field of networks which differentiates sensor network nodes form other networks such as IP-datagram, Ad-Hoc and so on.
Currently, routing in the wireless sensor network faces multiple challenges, such as new scalability, coverage, packet loss, interference, real-time audio and video real time streaming, harsh weather environments, energy constraints and so forth. Network routing can be called an amalgamation of routing protocol and routing algorithm. The job of the routing protocols is to provide a cohesive view of network nodes topology while routing algorithm provides the intelligence in terms of optimal path calculation.
We set out to conduct a detailed study of routing protocols in a IP-datagram, wireless ad-hoc and sensor network, and also accomplished routing protocols comparison against the chosen network performance factor dropped packet ratio.
Routing protocols play an important role in modern wireless communication networks.
Routing protocols’ performance can be measured by a number of factors such as packet dropped rate and so forth.
Rumour and Optimal Spinal Routing algorithms are compared using ShoX simulation and the results and analysis are based upon the simulation experiments.

Excerpt


Table of Contents

1. Introduction

1.1 Background

1.2 Problem Definition

1.3 Motivation for Current Work

1.4 Research Question

1.5 Research Methodology

1.6 Aims and Objectives

1.7 Assumption

1.8 Thesis Contribution

1.9 Related work

1.10 Organization of the Thesis

2. Routing Protocols in IP-Datagram Networks

2.1 Introduction

2.2 Routing

2.3 Proprieties of Routing Protocols

2.4 Classification of Routing Protocol

2.5 Goals of Routing Protocol

2.6 Conventional Routing Protocols

2.6.1 Adaptive Routing Protocols

2.6.2 Open Shortest Path First (OSPF)

2.7 Enhanced Interior Gateway Routing Protocol (EIGRP)

2.7.1 Link-state- based Routing

2.8 Border Gateway Protocol or Path Vector- based Routing

2.9 Advance Routing Approaches

2.9.1 Self-Adjusting Routing Protocols

3. Routing Protocols in Wireless Ad-hHoc and Sensor Network

3.1 Introduction

3.2 Classification of Wireless Network

3.3 Conventional Ad-Hoc Routing Protocol

3.3.1 Optimal Source Routing (OSR)

3.3.2 Wireless Routing Protocol (WRP)

3.3.3 Global State Routing (GSR) Protocol

3.4 Wireless Sensor Network (WSNs)

3.4.1 Network Characteristics, Design Objectives

3.4.2 Network Design Objectives

3.4.3 WSNs Network Design Challenges

3.5 Routing

3.5.1 Routing in Wireless Sensor Network

3.5.2 Classification of Wireless Senor Network Routing Protocols

4 Design of Simulation Experiments

4.1 Introduction

4.2 Scalable Ad-Hoc Network Simulator (ShoX)

4.3 Architecture of ShoX

4.4 ShoX Key Features

4.5 ShoX Configuration

4.6 Metrics

4.6.1 Simulation Parameters

4.7 Experimentation Design and Setup parameters

4.7.1 Experiment No.1 –Design of Small Network Topology

4.7.2 Experiment No.2 – Design of Medium Network Topology

4.7.3 Experiment No.3- Design of Large Network Topology

4.7.4 Experiment No. 4- Design of Simulation Time variation

4.7.5 Experiment No. 5- Design of Nodes Deployment Area variation

4.7.6 Experiment No. 6- Design of Interference Handler Model Variation

5 Implementation and Results Analysis

5.1 Introduction

5.2 Implementation

5.3 Experiment 1: Small Nodes Scenario

5.3.1 Case 1, 2, 3 & 4: Measurement of packet drop ratio in small number of stationary and mobile nodes using OSR and Rumor routing protocols

5.4 Experiment 2- Medium Nodes Scenario

5.4.1 Case 1, 2, 3 & 4: Measurement of packet drop at hop in 25 stationary nodes using OSR and rumor routing algorithm

5.5 Experiment 3- Large Nodes Scenario

5.5.1 Case 1, 2, 3 and 4: Measurement of packet drop at hop in 49 stationary nodes using OSR and rumor routing algorithm

5.6 Experiment No. 4- Simulation Time Variation

5.6.1 Case 1, 2, 3 and 4: Measurement of drop packet ratio/rate at stationary topology using OSR and rumor routing algorithm

5.7 Experiment No. 5- Network Deployment Area Variation

5.7.1 Case 1, 2, 3 and 4: Measurement of drop packet ratio/rate at stationary topology using OSR and rumor routing algorithm

5.8 Experiment No. 7- Interference Handler Model Variation

5.8.1 Case 1, 2, 3 and 4: Measurement of packet drop ratio at stationary topology using OSR and rumor routing algorithm

5.9 Simulation Results and Performance Analysis

6 Conclusion And Future Work

6.1 Introduction

6.2 Conclusion

6.2.1 Reflection of our work on research question

6.3 Future Work

Research Goals and Themes

The primary research goal is to conduct a detailed comparative performance study of routing protocols within wireless sensor networks (WSNs). The study aims to evaluate and compare the effectiveness of the Rumour routing protocol and the Optimal Source Routing (OSR) protocol, particularly focusing on their performance under varying network conditions, such as topology size, node mobility, simulation time, and interference scenarios, using the ShoX simulation environment to minimize packet drop ratios.

  • Comparative analysis of Rumour vs. OSR routing protocols.
  • Performance evaluation based on packet drop ratio as the key metric.
  • Impact of different network topologies (small, medium, large).
  • Influence of node mobility and network deployment area variations.
  • Simulation-based validation using the Scalable Ad-Hoc Network Simulator (ShoX).

Excerpt from the Book

3.4. Wireless Sensor Network

A wireless senor network is the latest and fastest growing technology and is expected to revolutionise a wide range of applications in terms of its quality and availability in the near future. The technology has arrived because of the huge advancements over the past decades, particularly in the field of embedded microprocessors, MEMS sensor and wireless communication [CX9].

Is a wireless computer network which can be formed in a large span of space , having distributed autonomous devices which consist of sensors so as to monitor the physical environmental condition, meaning pressure, temperature, motion and so forth at a remote location. Furthermore, according to ad-hoc network classification, WSNs can be called infrastructure-less networks. [ K. E. Kannammal et al]

A wireless sensor network is a group of network nodes which collaborate with each other in a sophisticated fashion. In WSNs each node has its own sort of ‘poly sort of memory’, such as data and flash memories, program; and it also accommodates devices, for instance a microcontroller, CPU or DSP chips. It also consists of an RF transceiver and this typically involves a single –Omni-direction. Moreover, nodes in WSNs have their own power source such as batteries and solar cells and they also host a number of sensors and accumulators.

Chapter Summary

1. Introduction: Outlines the background of wireless sensor networks, identifies the problem of efficient routing, and defines the research question regarding the performance comparison of Rumour and OSR protocols.

2. Routing Protocols in IP-Datagram Networks: Provides a theoretical foundation by discussing conventional routing, adaptive/non-adaptive protocols, and specific examples like OSPF and EIGRP.

3. Routing Protocols in Wireless Ad-Hoc and Sensor Network: Details the classification of wireless networks and specific routing challenges for WSNs, including an introduction to OSR and Rumour protocols.

4 Design of Simulation Experiments: Describes the methodology for simulation using the ShoX tool, including architectural components and the design of various experimental scenarios.

5 Implementation and Results Analysis: Details the practical implementation of scenarios and presents an analysis of simulation results comparing OSR and Rumour performance across different metrics.

6 Conclusion And Future Work: Summarizes the thesis findings, answers the core research questions based on experimental data, and suggests directions for future research.

Keywords

Wireless Sensor Network, WSNs, Routing Protocols, Optimal Source Routing, OSR, Rumour Routing, ShoX Simulator, Packet Drop Ratio, Network Topology, Node Mobility, Performance Comparison, Simulation Experiments, Energy Constraints, Interference, Scalability

Frequently Asked Questions

What is the core subject of this thesis?

This thesis focuses on the comparative performance study of routing protocols, specifically Rumour and Optimal Source Routing (OSR) protocols, within the context of wireless sensor networks (WSNs).

What are the central thematic fields covered in this work?

The work covers wireless sensor network architecture, design challenges for WSN routing, simulation-based performance analysis, and the evaluation of network metrics like packet drop ratios under diverse operating conditions.

What is the primary research objective?

The primary goal is to determine which of the two selected routing protocols—Rumour or OSR—performs better in terms of packet delivery efficiency under varying environmental and network circumstances.

Which scientific methods are utilized?

The author employs quantitative research methods by designing and executing extensive simulation experiments using the Scalable Ad-Hoc Network Simulator (ShoX) to evaluate and compare protocol behaviors.

What specific topics are discussed in the main body?

The main body examines conventional and advanced routing approaches in IP-datagram and wireless ad-hoc networks, detailing the architecture of WSNs, design objectives, challenges, and specific algorithm mechanics for both OSR and Rumour protocols.

How would you characterize this thesis using keywords?

The thesis is best characterized by terms such as Wireless Sensor Network, WSNs, Routing Protocols, OSR, Rumour Routing, ShoX Simulator, Packet Drop Ratio, and Network Performance Evaluation.

How does the OSR protocol handle network topology changes?

The OSR protocol, being proactive, collects global topological information and maintains a spine graph, which requires updating the routing table when topological changes, such as node insertion or deletion, occur.

In what scenario is the Rumour routing protocol considered more efficient?

Rumour routing is generally found to be more efficient than OSR in scenarios involving node mobility and larger network deployments because it minimizes routing overhead by creating paths only when events occur, rather than maintaining global state information.

Excerpt out of 121 pages  - scroll top

Details

Title
Comparitive Performance Study Of Routing Protocols in Wireless Sensor Network
College
Griffith College Dublin  (Faculty of Computing )
Course
MSC Computing
Grade
70%
Author
Abid Afsar (Author)
Publication Year
2012
Pages
121
Catalog Number
V206335
ISBN (eBook)
9783656341253
ISBN (Book)
9783656342014
Language
English
Tags
comparitive perfromance study routing protocols wireless sensor networks
Product Safety
GRIN Publishing GmbH
Quote paper
Abid Afsar (Author), 2012, Comparitive Performance Study Of Routing Protocols in Wireless Sensor Network, Munich, GRIN Verlag, https://www.grin.com/document/206335
Look inside the ebook
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
  • Depending on your browser, you might see this message in place of the failed image.
Excerpt from  121  pages
Grin logo
  • Grin.com
  • Shipping
  • Contact
  • Privacy
  • Terms
  • Imprint