Hierarchical routing using k-SPR

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Nesheim, Skyler
dc.contributor.author Smith, Matt
dc.date.accessioned 2007-05-31T19:01:37Z
dc.date.available 2007-05-31T19:01:37Z
dc.date.issued 2007-05-31T19:01:37Z
dc.identifier.uri http://hdl.handle.net/2092/562
dc.description.abstract The goal of our research is to create an improved routing protocol for Ad-Hoc Wireless networking. We began our research by studying a protocol developed by two Drake students, Tiffany Meredith and Jennifer Ehrlich, which they named k-SPR, and that standard is based loosely on AODV standards. Our protocol was developed using their framework as a basis for our changes and additions. We want to develop a protocol that will pick routers such that those routers are more likely to experience a lot of traffic and also to make router selection a hierarchical process. The method we use to determine the traffic density of any given node is to compute its covering number, which is the number of node pairs that node covers. A node pair in a k-SPR set is a pair of nodes that are k+1 hops apart, and a node covers that pair if it is along the shortest path between the node pair, hence the name Shortest Path Routing (SPR). A hierarchical system of choosing routers is then implemented by applying a similar method to the resulting set of nodes and selecting super routers based on similar criteria to those used for routers. During our research, we grappled with the issue of generalizing a hierarchical router selection algorithm. We decided that generalizing hierarchical router selection is complicated by the AODV packet header system and is also limited functionally by the number of nodes in the set, sometimes requiring an increase of millions or billions of nodes, in order to necessitate another tier in the hierarchy. Further research should include a close analysis of data resulting from our studies and strive towards a greater understanding of the ‘shape’ of the network that is developed when choosing routers. en
dc.format.extent 1770597 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.relation.ispartofseries DUCURS 2006;15
dc.subject Ad hoc wireless networks en
dc.subject Routing algorithm en
dc.subject Computer network protocols en
dc.title Hierarchical routing using k-SPR en
dc.type Presentation en

Files in this item

This item appears in the following Collection(s)

  • DUCURS [196]
    Poster sessions and presentation from the Drake University Conference on Undergraduate Research in the Sciences held each April at Olmsted Center on the Drake campus.

Show simple item record

Search DSpace

Advanced Search


My Account