• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • Tagged with
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A Wireless Ad Hoc Routing protocol Based on Physical Layer Characteristics

Lin, Sie-Wei 24 June 2003 (has links)
In recent years, there has been a growing interest in wireless ad hoc network. One of the major issues in wireless network is developing efficient routing protocol. Based on the concept of designing protocol model such as OSI model, the designers distilled the process of transmitting data to its most fundamental elements and identified which networking functions had related uses and collected those functions into discrete groups that became the layers. It is not suitable to design wireless ad hoc routing protocol based on OSI model conception because the OSI model is developed from the view point of wired network and there are many different characteristics between wired and wireless environment. The main different characteristics between wired and wireless are the mobility of mobile host and the transmission medium. Such differences have great effect on network performance. Due to the differences between wired and wireless characteristics, we present a comprehensive conception of designing wireless ad hoc routing protocol. In this context, we provide a wireless ad hoc routing protocol based on physical layer characteristics, ex: bit error rate, robust link. Our routing protocol will find out a route in good transmission environment and it is efficient to improve network throughput. Furthermore, our routing protocol will decrease the number of route request packets, the amount of retransmissions, link breakage rate, and increase throughput.
2

A Simulation Framework for Efficient Search in P2P Networks with 8-Point HyperCircles

Abbas, Syed Muhammad, Henricsson, Christopher January 2008 (has links)
<p>This report concerns the implementation of a simulation framework to evaluate an emerging peer-to-peer network topology scheme using 8-point hypercircles, entitled HyperCircle. This topology was proposed in order to alleviate some of the drawbacks of current P2P systems evolving in an uncontrolled manner, such as scalability issues, network overload and long search times. The framework is supposed to be used to evaluate the advantages of this new topology. The framework has been built on top of an existing simulator software solution, the selection of which was an important part of the development. Weighing different variables such as scalability and API usability, the selection fell on OverSim, an open-source discreet-event simulator based on OMNET++.</p><p>After formalizing the protocol for easier implementation, as well as extending it for better performance, implementation followed using C++ with OverSim’s API and simulation library. Implemented as a module (alongside other stock modules providing their own protocols such as Chord and Kademlia), it can be used in OverSim to simulate a user-defined network using one of the simulation routine applications provided (or using a custom application written by the user). For the purposes of this thesis, the standard application KBRTestApp was used; an application sending test messages between randomly selected nodes, while adding and removing nodes at specific time intervals. The adding and removing of nodes can be configured with probability parameters.</p><p>Tentative testing shows that this implementation of the HyperCircle protocol has a certain performance gain over the OverSim implementations of the Chord and Kademlia protocols, measurable in the time it takes a message to get from sender to recipient. Further testing is outside the scope of this thesis.</p>
3

A Simulation Framework for Efficient Search in P2P Networks with 8-Point HyperCircles

Abbas, Syed Muhammad, Henricsson, Christopher January 2008 (has links)
This report concerns the implementation of a simulation framework to evaluate an emerging peer-to-peer network topology scheme using 8-point hypercircles, entitled HyperCircle. This topology was proposed in order to alleviate some of the drawbacks of current P2P systems evolving in an uncontrolled manner, such as scalability issues, network overload and long search times. The framework is supposed to be used to evaluate the advantages of this new topology. The framework has been built on top of an existing simulator software solution, the selection of which was an important part of the development. Weighing different variables such as scalability and API usability, the selection fell on OverSim, an open-source discreet-event simulator based on OMNET++. After formalizing the protocol for easier implementation, as well as extending it for better performance, implementation followed using C++ with OverSim’s API and simulation library. Implemented as a module (alongside other stock modules providing their own protocols such as Chord and Kademlia), it can be used in OverSim to simulate a user-defined network using one of the simulation routine applications provided (or using a custom application written by the user). For the purposes of this thesis, the standard application KBRTestApp was used; an application sending test messages between randomly selected nodes, while adding and removing nodes at specific time intervals. The adding and removing of nodes can be configured with probability parameters. Tentative testing shows that this implementation of the HyperCircle protocol has a certain performance gain over the OverSim implementations of the Chord and Kademlia protocols, measurable in the time it takes a message to get from sender to recipient. Further testing is outside the scope of this thesis.

Page generated in 0.0581 seconds