Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
kent1248031485.pdf (9.12 MB)
ETD Abstract Container
Abstract Header
Addressing and Distances for Cellular Networks with Holes
Author Info
Harbart, Robert Allan
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485
Abstract Details
Year and Degree
2009, MS, Kent State University, College of Arts and Sciences / Department of Computer Science.
Abstract
There is still much research in the areas of routing and location updates in cellular communication networks. Given the limited amount of memory and power of these network devices it is desirable to find the most effective and resource conscious method for solving routing and location update problems. Recently, these problems have been addressed for simply connected cellular networks and significant results were achieved. An effective method for addressing, location update and routing has been offered using a method of isometric embeddings into a set of three trees. This method however does not fully work when a hole is present in the network. To handle networks containing holes, a variation of the above method is required, where the cellular network will be decomposed into few sub-graphs that encompass the properties of the original network graph. Proposed here is a method that will handle the above mentioned problems on cellular networks with holes, namely holes with disc structures and other shapes that have the convex property. Also presented are two distinct methods for handling networks with multiple disc-structured holes. These methods will also use sub-graphs to reduce the number of holes while preserving all shortest paths.
Committee
Feodor F. Dragan, PhD (Advisor)
Ruoming Jin, PhD (Committee Member)
Hassan Peyravi, PhD (Committee Member)
Pages
105 p.
Subject Headings
Computer Science
Keywords
communication
;
network
;
graph
;
routing
;
addressing
;
distances
;
shortest
;
path
;
hexagonal
;
triangular
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Harbart, R. A. (2009).
Addressing and Distances for Cellular Networks with Holes
[Master's thesis, Kent State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485
APA Style (7th edition)
Harbart, Robert.
Addressing and Distances for Cellular Networks with Holes.
2009. Kent State University, Master's thesis.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485.
MLA Style (8th edition)
Harbart, Robert. "Addressing and Distances for Cellular Networks with Holes." Master's thesis, Kent State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
kent1248031485
Download Count:
496
Copyright Info
© 2009, all rights reserved.
This open access ETD is published by Kent State University and OhioLINK.