You searched for subject:(Routing protocols Computer network protocols ).
Showing records 1 – 30 of
119760 total matches.
◁ [1] [2] [3] [4] [5] … [3992] ▶
Rutgers University
1.
Sriram, Shravan, 1991-.
Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture.
Degree: MS, Electrical and Computer Engineering, 2015, Rutgers University
URL: https://rucore.libraries.rutgers.edu/rutgers-lib/48669/ 
► This thesis presents the design and evaluation of an edge-aware inter-domain routing (EIR) protocol for the MobilityFirst Future Internet Architecture. The EIR protocol provides enhanced…
(more)
▼ This thesis presents the design and evaluation of an edge-aware inter-domain
routing (EIR) protocol for the MobilityFirst Future Internet Architecture. The EIR protocol provides enhanced inter-domain
routing capabilities for wireless/mobile usage scenarios including wireless edge peering, dynamic
network formation and mobility, multipath and multi-homing support. The EIR protocol design proposed here is based on abstractions of internal
network topology and state of ASes in terms of aNodes and vLinks with this information being flooded through
Network State Packets (nSPs) across the Internet. A technique called “telescopic flooding” in which nSP forwarding rates are reduced as a function of hop-distance from the originating node is introduced in order to control the overhead. These nSPs are used to construct the global
network topology with some information about the structure and capabilities of each autonomous system(AS), making it possible to realize a variety of
routing algorithms corresponding to the use cases mentioned earlier. Further, EIR is designed to work in conjunction with late binding of names to addresses and in-
network storage in order to provide robust services in environments with dynamic mobility and disconnection. The proposed EIR protocol was validated through both large-scale simulations and ORBIT testbed emulations using the Click software framework implementation. The evaluations prove the feasibility of the protocol in terms of flooding overhead, convergence time and inter-domain forwarding table sizes. Also, evaluation of mobility service scenarios with migration of clients and networks across domains were performed and the results demonstrate the benefit of exposing the
network state and the performance enhancements that can be achieved through the EIR protocol and related
routing algorithms.
Advisors/Committee Members: Raychaudhuri, Dipankar (chair).
Subjects/Keywords: Routing (Computer network management); Computer architecture; Routing protocols (Computer network protocols)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sriram, Shravan, 1. (2015). Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/48669/
Chicago Manual of Style (16th Edition):
Sriram, Shravan, 1991-. “Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture.” 2015. Masters Thesis, Rutgers University. Accessed March 04, 2021.
https://rucore.libraries.rutgers.edu/rutgers-lib/48669/.
MLA Handbook (7th Edition):
Sriram, Shravan, 1991-. “Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture.” 2015. Web. 04 Mar 2021.
Vancouver:
Sriram, Shravan 1. Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture. [Internet] [Masters thesis]. Rutgers University; 2015. [cited 2021 Mar 04].
Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48669/.
Council of Science Editors:
Sriram, Shravan 1. Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture. [Masters Thesis]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48669/
Stellenbosch University
2.
Merts, Andre-Jan.
Satellite network simulator - design and verifcation using AODV and AntHocNet.
Degree: MEng, Electrical and Electronic Engineering, 2017, Stellenbosch University
URL: http://hdl.handle.net/10019.1/101241
► ENGLISH ABSTRACT: As access to space increases, the viability of creating satellite networks and dedicated services for satellite clients also increases. However, satellites are expensive…
(more)
▼ ENGLISH ABSTRACT: As access to space increases, the viability of creating satellite networks and dedicated
services for satellite clients also increases. However, satellites are expensive to launch
and cannot be easily maintained once in orbit, making it beneficial to simulate network
performance before launch. Furthermore there is an extensive wealth of research regarding
routing protocols available for terrestrial networks that have not been fully researched for
satellite networks thus creating a need for a satellite network simulator.
Any network has various ways in which its properties can be interpreted, which means
any network metric must be unambiguously defined. Routing protocols can be classified in various ways, showing their inherent advantages, disadvantages, requirements and
limitations. Combining these properties with information on the components of routing
protocols, an analysis of routing protocols can be made and candidate routing protocols
can be chosen. For this research AODV was chosen to allow functional verification and
AntHocNet was chosen to show that the simulator is flexible enough to simulate various
routing protocol functionality.
Satellite networks were manually analysed with attention given to the key differences
between terrestrial and satellite networks. Using this information in conjunction with
previous research findings and recommendations, a vast distributed network similar to
the Iridium network was chosen as a verification scenario for the simulator. A previously
proposed network, called the OuterNet, was chosen to further research the transferability
of AODV and AntHocNet to other satellite constellations.
The expansion of SatSim from a basic point-to-point simulator to a network simulator
capable of handling complex routing protocols was documented in detail, with clear
information given as to which design choices were made and why. The key design drivers
were user-friendliness, modularity and re-usability, and the code was structured to allow
users to easily adjust and expand the simulator as needed. Due to the limited replicatable
results, further testing for the MAC layer channel access for AODV and AntHocNet
implementations was performed.
SatSim was successfully expanded to allow for satellite network simulations. Preliminary
findings regarding the suitability of AODV compared to AntHocNet for two different
satellite constellations are presented.
AFRIKAANSE OPSOMMING: Namate die ruimte meer toeganklik word, verhoog die lewensvatbaarheid van die gebruik van satellietnetwerke en toegewyde dienste wat op daardie netwerk gerig is. Satelliete is steeds relatief duur om te lanseer en kan nie maklik onderhou of herstel word na dit in 'n wentelbaan geplaas is nie, gevolgelik kan die simulasies van die netwerk voor lansering baie nuttig wees. Daar is verder ook heelwat navorsing oor netwerkprotokolle vir aardnetwerke gedoen wat nog nie volledig bestudeer is vir satellietnetwerke nie en wat
dus 'n behoefte skep vir 'n satellietnetwerk simulator.
…
Advisors/Committee Members: Barnard, Arno, Stellenbosch University. Faculty of Engineering. Dept. of Electrical and Electronic Engineering..
Subjects/Keywords: UCTD; Astronautics in navigation; Space simulators; Routing protocols (Computer network protocols)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Merts, A. (2017). Satellite network simulator - design and verifcation using AODV and AntHocNet. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/101241
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Merts, Andre-Jan. “Satellite network simulator - design and verifcation using AODV and AntHocNet.” 2017. Thesis, Stellenbosch University. Accessed March 04, 2021.
http://hdl.handle.net/10019.1/101241.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Merts, Andre-Jan. “Satellite network simulator - design and verifcation using AODV and AntHocNet.” 2017. Web. 04 Mar 2021.
Vancouver:
Merts A. Satellite network simulator - design and verifcation using AODV and AntHocNet. [Internet] [Thesis]. Stellenbosch University; 2017. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/10019.1/101241.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Merts A. Satellite network simulator - design and verifcation using AODV and AntHocNet. [Thesis]. Stellenbosch University; 2017. Available from: http://hdl.handle.net/10019.1/101241
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Michigan State University
3.
Lightfoot, Leron J.
Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks.
Degree: 2015, Michigan State University
URL: http://etd.lib.msu.edu/islandora/object/etd:3796
► Thesis Ph. D. Michigan State University. Electrical Engineering 2015
Wireless sensor networks (WSNs) can provide the world with a technology for real-time event monitoring for…
(more)
▼ Thesis Ph. D. Michigan State University. Electrical Engineering 2015
Wireless sensor networks (WSNs) can provide the world with a technology for real-time event monitoring for both military and civilian applications. One of the primary concerns that hinders the successful deployment of wireless sensor networks is how to provide adequate source and destination nodes location privacy. The privacy of the location is vital and highly jeopardized by the usage of wireless communications. While message content privacy can be ensured through message encryption, it is much more difficult to adequately address the location privacy issue. For WSNs, location privacy service is further complicated by the fact that sensors consist of low-cost and energy efficient radio devices. Therefore, using computationally intensive cryptographic algorithms (such as public-key cryptosystems) and large scale broadcasting-based protocols are not suitable for WSNs.Many protocols have been proposed to provide location privacy but most of them are based on public-key cryptosystems, while others are either energy inefficient or have certain security flaws. After analyzing the security weaknesses of the existing schemes, we propose several creative and secure energy-aware routing protocols that can address the location privacy issue in WSNs. For source-location privacy, we propose 3 schemes. The first scheme routes each message to a randomly selected intermediate node (RSIN) before it is transmitted to the SINK node. However, this scheme can only provide local source-location privacy. In the second scheme, a network mixing ring (NMR) is proposed to provide network-level source-location privacy. The third scheme achieves network-level source-location privacy through a technique we call the Sink Toroidal Region (STaR) routing. For destination-location privacy, we propose the Bubble routing protocol and a series of R-STaR routing protocols. For each of these routing schemes, both security analysis using quantitative measurements and simulation results show that the proposed protocols are secure and energy-efficient.While providing location privacy is vital, prolonging the lifetime of the network can be a very essential component as well. In this dissertation, we propose a cluster-based energy-aware routing scheme, called Quad-Region Cluster-Head Selection (Q-ReCHS), which will prolong the network lifetime by evenly distributing the energy load among all the nodes. Our extensive simulation results on cluster-based routing demonstrates that our proposed Q-ReCHS scheme can out perform many of the existing schemes.
Description based on online resource;
Advisors/Committee Members: Ren, Jian, Pierre, Percy, Biswas, Subir, Hall, Jonathan.
Subjects/Keywords: Routing protocols (Computer network protocols); Wireless sensor networks; Electrical engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lightfoot, L. J. (2015). Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:3796
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Lightfoot, Leron J. “Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks.” 2015. Thesis, Michigan State University. Accessed March 04, 2021.
http://etd.lib.msu.edu/islandora/object/etd:3796.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lightfoot, Leron J. “Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks.” 2015. Web. 04 Mar 2021.
Vancouver:
Lightfoot LJ. Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks. [Internet] [Thesis]. Michigan State University; 2015. [cited 2021 Mar 04].
Available from: http://etd.lib.msu.edu/islandora/object/etd:3796.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lightfoot LJ. Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks. [Thesis]. Michigan State University; 2015. Available from: http://etd.lib.msu.edu/islandora/object/etd:3796
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Massey University
4.
Rusli, Mohd Ezanee.
A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support.
Degree: PhD, Communication and Network Engineering, 2013, Massey University
URL: http://hdl.handle.net/10179/4273
► A wireless sensor network (WSN) provides a platform for embedded sensing and ubiquitous computing. For ad hoc WSNs, multi-hop routing has been adopted in order…
(more)
▼ A wireless sensor network (WSN) provides a platform for embedded sensing and
ubiquitous computing. For ad hoc WSNs, multi-hop routing has been adopted in order to
save communication power consumption. By acknowledging the lossy characteristics of
radio channels on low-power WSNs, the Opportunistic Routing (OR) protocol provides
an efficient method for exploiting the spatial and temporal characteristics of these wireless
networks by considering multiple forwarding relays for each transmission. The main
contribution of this thesis is to provide analysis and modelling for variants of the OR
protocol for WSNs.
Firstly, based on the basic concepts that underpin OR, we propose a new variant of OR
that can be used in WSNs. It is known that communication in WSN is the most power
consuming operation; hence, we propose a variant of OR that specifically reduces the total
number of transmissions required during the coordination step used in OR. We investigate
the effectiveness of this approach and compare it with OR that adopts existing and
common candidate coordination schemes. In addition, we also propose a retransmission
scheme based on provisional reliability constraints for local loss recovery that can be used
in this new variant of OR.
Secondly, we propose a comprehensive new analytical framework that is based on Markov
Chain and Queueing theories that takes into account the key component strategies of OR
(prioritization, selection and coordination) as well as the communication components of
WSN. The proposed framework can be used to model the end-to-end reliability and delay
performances of WSNs using OR.
Thirdly, taking into account the potential deficiencies of OR due to its static coordination
scheme, we introduce a variant of OR that is aware of the online quality of its selected
forwarding relays that we have named as the Adaptive Coordination Opportunistic
Routing (ACOR) protocol. We propose a new local metric to be known as the
Opportunistic Quality Score for ACOR to improve the performance of WSNs and, in
particular, to support Quality of Service delivery of messages in these networks. In
addition, we provide an analytical framework for ACOR that incorporates the adaptive
coordination scheme that has been developed.
Subjects/Keywords: Routing protocols (Computer network protocols);
Opportunistic routing protocol;
Wireless sensor networks;
Design and construction
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rusli, M. E. (2013). A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support. (Doctoral Dissertation). Massey University. Retrieved from http://hdl.handle.net/10179/4273
Chicago Manual of Style (16th Edition):
Rusli, Mohd Ezanee. “A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support.” 2013. Doctoral Dissertation, Massey University. Accessed March 04, 2021.
http://hdl.handle.net/10179/4273.
MLA Handbook (7th Edition):
Rusli, Mohd Ezanee. “A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support.” 2013. Web. 04 Mar 2021.
Vancouver:
Rusli ME. A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support. [Internet] [Doctoral dissertation]. Massey University; 2013. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/10179/4273.
Council of Science Editors:
Rusli ME. A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support. [Doctoral Dissertation]. Massey University; 2013. Available from: http://hdl.handle.net/10179/4273
Ryerson University
5.
Ma, Jason V.
Routing simulation of brain network topology.:.
Degree: 2014, Ryerson University
URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A2684
► The incessant search to understand human cognitive functions has led to the hypothesis that the brain works similar to a packet switched network such as…
(more)
▼ The incessant search to understand human cognitive functions has led to the hypothesis
that the brain works similar to a packet switched
network such as the Internet [28]. In
this thesis, I have developed a top-down simulator of brain-like networks which uses prob-
ability
routing to route data and a distance vector
routing algorithm [21] to propagate
feedback to varying depths. I investigate the impact of the feedback depth on
routing
table metrics. The results indicate that important performance metrics are affected by
the feedback depth of the
routing algorithm but also, to a large extent, by the topological
features of such networks [17, 44]. The results indicate feedback depths from 25 to 30
fill the
routing table most efficiently in terms of
routing table fill percentage,
routing
table fill time and packet rejection ratio. There is also a strong correlation between the
macaque monkey brain and sparse topologies.
Advisors/Committee Members: Misic, Vojislav (Degree supervisor), Ryerson University (Degree grantor).
Subjects/Keywords: Neural networks (Computer science) – Simulation methods.; Neural networks (Computer science) – Simulation methods. – -; Routing protocols (Computer network protocols) – Simulation methods.; Routing protocols (Computer network protocols) – Simulation methods. – -
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ma, J. V. (2014). Routing simulation of brain network topology.:. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A2684
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Ma, Jason V. “Routing simulation of brain network topology.:.” 2014. Thesis, Ryerson University. Accessed March 04, 2021.
https://digital.library.ryerson.ca/islandora/object/RULA%3A2684.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Ma, Jason V. “Routing simulation of brain network topology.:.” 2014. Web. 04 Mar 2021.
Vancouver:
Ma JV. Routing simulation of brain network topology.:. [Internet] [Thesis]. Ryerson University; 2014. [cited 2021 Mar 04].
Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2684.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Ma JV. Routing simulation of brain network topology.:. [Thesis]. Ryerson University; 2014. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2684
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Florida Atlantic University
6.
Alzamzami, Ohoud.
Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks.
Degree: 2018, Florida Atlantic University
URL: http://fau.digital.flvc.org/islandora/object/fau:40776
► Vehicular Ad hoc Networks (VANETs) have the potential to enable various kinds of applications aiming at improving road safety and transportation efficiency. These applications require…
(more)
▼ Vehicular Ad hoc Networks (VANETs) have the potential to enable various
kinds of applications aiming at improving road safety and transportation efficiency.
These applications require uni-cast routing, which remains a significant challenge due
to VANETs characteristics. Given VANET dynamic topology, geographic routing
protocols are considered the most suitable for such network due to their scalability
and low overhead. However, the optimal selection of next-hop nodes in geographic
routing is a challenging problem where the routing performance is highly affected by
the variable link quality and bandwidth availability.
In this dissertation, a number of enhancements to improve geographic routing
reliability in VANETs are proposed. To minimize packet losses, the direction and
link quality of next-hop nodes using the Expected Transmission Count (ETX) are
considered to select links with low loss ratios.
To consider the available bandwidth, a cross-layer enchantment of geographic
routing, which can select more reliable links and quickly react to varying nodes load
and channel conditions, is proposed. We present a novel model of the dynamic behavior of a wireless link. It considers the loss ratio on a link, in addition to transmission
and queuing delays, and it takes into account the physical interference e ect on the
link.
Then, a novel geographic routing protocol based on fuzzy logic systems, which
help in coordinating di erent contradicting metrics, is proposed. Multiple metrics
related to vehicles' position, direction, link quality and achievable throughput are
combined using fuzzy rules in order to select the more reliable next-hop nodes for
packet forwarding.
Finally, we propose a novel link utility aware geographic routing protocol,
which extends the local view of the network topology using two-hop neighbor information.
We present our model of link utility, which measures the usefulness of a
two-hop neighbor link by considering its minimum residual bandwidth and packet
loss rate. The proposed protocol can react appropriately to increased network tra c
and to frequent topology dis-connectivity in VANETs.
To evaluate the performance of the proposed protocols, extensive simulation
experiments are performed using network and urban mobility simulation tools. Results
confirm the advantages of the proposed schemes in increased traffic loads and
network density.
2018
Degree granted: Dissertation (Ph.D.) – Florida Atlantic University, 2018.
Collection: FAU
Advisors/Committee Members: Mahgoub, Imad (Thesis advisor), Florida Atlantic University (Degree grantor), College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science.
Subjects/Keywords: Vehicular ad hoc networks (Computer networks); Traffic safety; Routing protocols (Computer network protocols); Fuzzy logic
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Alzamzami, O. (2018). Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks. (Thesis). Florida Atlantic University. Retrieved from http://fau.digital.flvc.org/islandora/object/fau:40776
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Alzamzami, Ohoud. “Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks.” 2018. Thesis, Florida Atlantic University. Accessed March 04, 2021.
http://fau.digital.flvc.org/islandora/object/fau:40776.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Alzamzami, Ohoud. “Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks.” 2018. Web. 04 Mar 2021.
Vancouver:
Alzamzami O. Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks. [Internet] [Thesis]. Florida Atlantic University; 2018. [cited 2021 Mar 04].
Available from: http://fau.digital.flvc.org/islandora/object/fau:40776.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Alzamzami O. Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks. [Thesis]. Florida Atlantic University; 2018. Available from: http://fau.digital.flvc.org/islandora/object/fau:40776
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Delaware
7.
Fang, Rui.
Stochastic analysis of ant-based routing and probabilistic modeling of medium access control in wireless networks.
Degree: PhD, University of Delaware, Department of Mathematical Sciences, 2015, University of Delaware
URL: http://udspace.udel.edu/handle/19716/17101
► In computer networks, routing determines how data move across a network from a source to a destination, while medium access control (MAC) defines when and…
(more)
▼ In
computer networks,
routing determines how data move across a
network from a source to a destination, while medium access control (MAC) defines when and how to transmit data from one node to another.Ant-based
routing protocols have successfully provided an effective, if not optimal, solution to the
routing problem by using control packets, called "ants", to explore networks, discover routes and reinforce the best routes. However, the modeling of ant-based
routing in the context of wireless local area networks (WLANs) is challenged by the intrinsic complexity of wireless medium access control and its cross-layer interaction. Therefore, this dissertation mainly concerns two problems: improvement of an ant-based algorithm's performance on
routing problem and mathematical characterization of medium access control for wireless local area networks. Our contributions are threefold. First we introduce a novel strategy for ant-based
routing to achieve optimal solutions that have least hop count. Next, we modestly analyze the integrated behaviors of ant-based
routing with medium access control based on the case investigations of a practical MAC protocol MACA (Multiple Access with Collision Avoidance). Finally, we develop a detailed Markov model according to the comprehensive descriptions of the Distributed Coordination Functions (DCF) in IEEE 802.11, an international standard that specifies access scheme for WLANs. This dissertation is organized as follows. Chapter 1 presents the background of
routing and medium access control problems in WLANs, and reviews related research efforts on ant-based
network routing and the IEEE 802.11 DCF. In Chapter 2, we show that our strategy leverages the previous efforts to model and analyze ant-based
routing protocols on wired networks that explained how some critical parameters drive the
network into near optimal route configurations. A simulation study of the strategy on both simple 5-node
network and large 50-node
network demonstrates a significant improvement on the discovery rate of stable single route solutions with minimum distance from a source to a destination as measured by hop count. In Chapter 3, we start by performing case studies to understand the MACA protocol based on a Markov chain analysis. The findings are incorporated into the previous analytical framework of ant-based
routing protocol, and the predicted behaviors of the resulting integration model are validated through realistic simulations. A regression study is also conducted to evaluate MACA performance by packet delivery ratio in multi-hop wireless networks. Finally in Chapter 4, we give the detailed derivation of our new model for the IEEE 802.11 DCF. The validity of our model does not depend on the
network parameters and topology. For steady state calculations, we approximate joint probabilities from marginal probabilities using product approximations. By assessing the model in a variety of representative networks, we find excellent agreement of equilibrium node states with realistic simulations of
network…
Advisors/Committee Members: Rossi, Louis F..
Subjects/Keywords: Ant algorithms.; Routing protocols (Computer network protocols); Wireless LANs.; IEEE 802.11 (Standard)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Fang, R. (2015). Stochastic analysis of ant-based routing and probabilistic modeling of medium access control in wireless networks. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/17101
Chicago Manual of Style (16th Edition):
Fang, Rui. “Stochastic analysis of ant-based routing and probabilistic modeling of medium access control in wireless networks.” 2015. Doctoral Dissertation, University of Delaware. Accessed March 04, 2021.
http://udspace.udel.edu/handle/19716/17101.
MLA Handbook (7th Edition):
Fang, Rui. “Stochastic analysis of ant-based routing and probabilistic modeling of medium access control in wireless networks.” 2015. Web. 04 Mar 2021.
Vancouver:
Fang R. Stochastic analysis of ant-based routing and probabilistic modeling of medium access control in wireless networks. [Internet] [Doctoral dissertation]. University of Delaware; 2015. [cited 2021 Mar 04].
Available from: http://udspace.udel.edu/handle/19716/17101.
Council of Science Editors:
Fang R. Stochastic analysis of ant-based routing and probabilistic modeling of medium access control in wireless networks. [Doctoral Dissertation]. University of Delaware; 2015. Available from: http://udspace.udel.edu/handle/19716/17101
University of Aberdeen
8.
Ayaz, Beenish.
Improving routing performance of underwater wireless sensor networks.
Degree: PhD, 2016, University of Aberdeen
URL: https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12153234930005941
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.731599
► In this research work we propose a 3D node deployment strategy by carefully considering the unique characteristics of underwater acoustic communication as well as 3D…
(more)
▼ In this research work we propose a 3D node deployment strategy by carefully considering the unique characteristics of underwater acoustic communication as well as 3D dynamic nature of UWSN. This strategy targets 3D UWSN and not only improves the routing protocol performance significantly in terms of end to end delay and energy consumption but also provides reliability in data transmission. This strategy has been developed step by step from a single line of vertical communication to an effective 3D node deployment for UWSN. Several simulation experiments were carried out after adding different features to the final design to observe their impact on the overall routing performance. Finally, it is verified that this design strategy improves the routing performance, provides reliability to the network and increases network lifetime. Furthermore, we compared our results to the random node deployment in 3D, which is commonly used for analysing the performance of UWSN routing protocols. The comparison results verified our effective deployment design and showed that it provides almost 150% less end-to-end delay and almost 25% less energy consumption to the random deployment. It also revealed that by increasing the data traffic, our 3D node deployment strategy has no loss of data due to several back-up paths available, which is in contrast to random node deployment, where the packet loss occurs by increasing the data traffic. Improving the routing performance by carefully analysing the impact of 3D node deployment strategy and ensuring full sensing, transmission and back-up coverage in a highly unpredictable underwater environment, is a novel approach. Embedding this strategy with any networking protocol will improve its performance significantly.
Subjects/Keywords: 620; Wireless sensor networks; Signals and signaling; Submarine; Routing protocols (Computer network protocols)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ayaz, B. (2016). Improving routing performance of underwater wireless sensor networks. (Doctoral Dissertation). University of Aberdeen. Retrieved from https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12153234930005941 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.731599
Chicago Manual of Style (16th Edition):
Ayaz, Beenish. “Improving routing performance of underwater wireless sensor networks.” 2016. Doctoral Dissertation, University of Aberdeen. Accessed March 04, 2021.
https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12153234930005941 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.731599.
MLA Handbook (7th Edition):
Ayaz, Beenish. “Improving routing performance of underwater wireless sensor networks.” 2016. Web. 04 Mar 2021.
Vancouver:
Ayaz B. Improving routing performance of underwater wireless sensor networks. [Internet] [Doctoral dissertation]. University of Aberdeen; 2016. [cited 2021 Mar 04].
Available from: https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12153234930005941 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.731599.
Council of Science Editors:
Ayaz B. Improving routing performance of underwater wireless sensor networks. [Doctoral Dissertation]. University of Aberdeen; 2016. Available from: https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12153234930005941 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.731599
9.
Cao, Ning.
Evaluation models for different routing protocols in wireless sensor networks.
Degree: 2017, University College Dublin. School of Computer Science
URL: http://hdl.handle.net/10197/8538
► This thesis aims to introduce the evaluation parameters of Lifetime, Density, Radius, and Reliability for the applications of wireless sensor networks. A series of simulation…
(more)
▼ This thesis aims to introduce the evaluation parameters of Lifetime, Density, Radius, and Reliability for the applications of wireless sensor networks. A series of simulation results have been obtained for the Single-hop, LEACH and Nearest Closer
routing protocols which have been implemented in J-Sim simulation platform. Simulation results have been analyzed and several evaluation models have been proposed respectively. Thus, simulations may not be necessary for the users to choose a suitable
routing protocol.
Advisors/Committee Members: O'Hare, Gregory, Higgs, Russell.
Subjects/Keywords: Evaluation models; Routing protocols; Wireless sensor networks; 0|aWireless sensor networks.; #0|aRouting protocols (Computer network protocols).
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cao, N. (2017). Evaluation models for different routing protocols in wireless sensor networks. (Thesis). University College Dublin. School of Computer Science . Retrieved from http://hdl.handle.net/10197/8538
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Cao, Ning. “Evaluation models for different routing protocols in wireless sensor networks.” 2017. Thesis, University College Dublin. School of Computer Science . Accessed March 04, 2021.
http://hdl.handle.net/10197/8538.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Cao, Ning. “Evaluation models for different routing protocols in wireless sensor networks.” 2017. Web. 04 Mar 2021.
Vancouver:
Cao N. Evaluation models for different routing protocols in wireless sensor networks. [Internet] [Thesis]. University College Dublin. School of Computer Science ; 2017. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/10197/8538.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Cao N. Evaluation models for different routing protocols in wireless sensor networks. [Thesis]. University College Dublin. School of Computer Science ; 2017. Available from: http://hdl.handle.net/10197/8538
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of the Western Cape
10.
Chitedze, Zimani.
Mobility management for Wi-Fi infrastructure and mesh networks
.
Degree: 2012, University of the Western Cape
URL: http://hdl.handle.net/11394/2960
► This thesis shows that mobility management protocols for infrastructure Internet may be used in a wireless mesh network environment. In this research Mobile IPv6 and…
(more)
▼ This thesis shows that mobility management
protocols for infrastructure Internet may be used in a wireless mesh
network environment. In this research Mobile IPv6 and Fast Handover for Hierarchical Mobile IPv6 are successfully implemented in a wireless mesh
network environment. Two experiments were carried out: vertical and horizontal handover simulations. Vertical handover simulation involved a heterogeneous wireless environment comprising both wireless local area and wireless mesh networks. An OPNET Mobile IPv6 model was used to simulate the vertical handover experiment. Horizontal handover simulation involved Mobile IPv6 and Fast Handover for
Hierarchical Mobile IPv6 applied in ns2 wireless mesh
network. The vertical handover results show that MIPv6 is able to manage vertical handover between wireless local area and wireless mesh
network. The horizontal handover results illustrate that in mesh networks, Fast Handover for Hierarchical Mobile IPv6's performance is superior to Mobile IPv6. Fast Handover for Hierarchical Mobile IPv6 generates more throughput and less delay than Mobile IPv6. Furthermore, Fast Handover for Hierarchical Mobile IPv6 drops less data packets than Mobile IPv6. The simulations indicate that even though there are multi-hop communications in wireless mesh networks,
the performance of the multi-hop
routing may not play a big role in the handover performance. This is so because the mesh routers are mostly static and the multi-hop routes are readily available. Thus, the total handover delay is not affected too much by the WMN hops in the paths for signaling message transmission.
Advisors/Committee Members: Tucker, William (advisor).
Subjects/Keywords: Computer-communication networks - Routing protocols;
Wireless Communication /Network Communication
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chitedze, Z. (2012). Mobility management for Wi-Fi infrastructure and mesh networks
. (Thesis). University of the Western Cape. Retrieved from http://hdl.handle.net/11394/2960
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chitedze, Zimani. “Mobility management for Wi-Fi infrastructure and mesh networks
.” 2012. Thesis, University of the Western Cape. Accessed March 04, 2021.
http://hdl.handle.net/11394/2960.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chitedze, Zimani. “Mobility management for Wi-Fi infrastructure and mesh networks
.” 2012. Web. 04 Mar 2021.
Vancouver:
Chitedze Z. Mobility management for Wi-Fi infrastructure and mesh networks
. [Internet] [Thesis]. University of the Western Cape; 2012. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/11394/2960.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chitedze Z. Mobility management for Wi-Fi infrastructure and mesh networks
. [Thesis]. University of the Western Cape; 2012. Available from: http://hdl.handle.net/11394/2960
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Macquarie University
11.
Omer, Sobia.
Multi-channel routing protocols for wireless body area networks.
Degree: 2017, Macquarie University
URL: http://hdl.handle.net/1959.14/1266314
► Empirical thesis.
Bibliography: pages 211-237.
1. Introductionn – 2. Literature review – 3. A multi-channel routing protocol based on RSSI channel selection for wireless body…
(more)
▼ Empirical thesis.
Bibliography: pages 211-237.
1. Introductionn – 2. Literature review – 3. A multi-channel routing protocol based on RSSI channel selection for wireless body area networks – 4. A multi-channel routing protocol based on LQI channel selection for wireless body-area networks with mobile nodes – 5. A multi-channel routing protocol based on a diversity path metric for wireless body-area networks – 6. A multi-channel routing protocol based on remaining energy and link quality for wireless body-area networks – 7. Thesis conclusion and future work – Appendix – References.
Wearable sensors connected through Wireless Body Area Networks (WBANs) have emerged as a promising enabling technology for many healthcare applications in recent years. A WBAN utilises wearable sensors on the human body to route information between a sensor and a central control unit (CCU) which can be connected to remote stations for further analysis. The routing schemes used in WBANs face challenges due to limited energy and excessive traffic overhead constraints. Most routing protocols for WBANs use a single-channel which limits network performance in terms of interference among links, throughput, end-to-end delay, and congestion. As opposed to single-channel communication, multiple channels increase the number of paths that can be active simultaneously between nodes and increase bandwidth capacity with reduced inter and intrachannel interference. Multi-channel routing protocols can overcome many of the limitations mentioned above for single-channel routing protocols improving traffic congestion, energy consumption, network lifetime, and link stability. However, several challenges still need to be solved when utilising multiple channels, such as channel selection methods for multiple routes and optimising routing metric. In this thesis, various multi-channel routing protocols have been proposed for WBANs to improve the performance over traditional single-channel protocols commonly used in WBANs. Firstly, the thesis develops multi-channel versions of existing routing protocols, such as single-path, single-channel AODV (Ad-hoc On-demand Distance Vector) and REL (Routing based on Remaining Energy and Link quality indicator) to overcome bottlenecks at intermediate nodes. Secondly, new performance metrics are proposed such as a channel-diversity metric named Weighted Multi-Channel Hop-Count (WMHC) and a lexical composite metric named Dual-CHannel REL (DCHREL) for route selection combining hop count, link quality, and nodes residual energy. Lastly, channel selection methods based on Link Quality Estimators (LQEs) such as Link Quality Indicator (LQI) and Received Signal Strength Indicator (RSSI) for static as well as mobile nodes are proposed, which outperform random channel selection in WBANs with a small number of channels.
The implementation of the proposed multi-channel routing protocols was carried out in the OMNet++ based Castalia. Simulation results show that the multi-channel routing protocols with the LQE based…
Advisors/Committee Members: Macquarie University. School of Engineering.
Subjects/Keywords: Body area networks (Electronics) – Design and construction; Routing protocols (Computer network protocols); Multichannel communication; multichannel; routing; wireless body area
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Omer, S. (2017). Multi-channel routing protocols for wireless body area networks. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/1266314
Chicago Manual of Style (16th Edition):
Omer, Sobia. “Multi-channel routing protocols for wireless body area networks.” 2017. Doctoral Dissertation, Macquarie University. Accessed March 04, 2021.
http://hdl.handle.net/1959.14/1266314.
MLA Handbook (7th Edition):
Omer, Sobia. “Multi-channel routing protocols for wireless body area networks.” 2017. Web. 04 Mar 2021.
Vancouver:
Omer S. Multi-channel routing protocols for wireless body area networks. [Internet] [Doctoral dissertation]. Macquarie University; 2017. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/1959.14/1266314.
Council of Science Editors:
Omer S. Multi-channel routing protocols for wireless body area networks. [Doctoral Dissertation]. Macquarie University; 2017. Available from: http://hdl.handle.net/1959.14/1266314
Ryerson University
12.
Bamrah, Amarpreet.
A centrality-based history prediction routing protocol for opportunistic networks.
Degree: 2016, Ryerson University
URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A4879
► Opportunistic networks are a subclass of delay tolerant networks based on a novel communication paradigm that aims at transmitting messages by exploiting direct contacts among…
(more)
▼ Opportunistic networks are a subclass of delay tolerant networks based on a novel communication paradigm that aims at transmitting messages by exploiting direct contacts among nodes, without the need of a predefined infrastructure. Typical characteristics of OppNet include high mobility, short radio range, intermittent links, unstable topology, sparse connectivity, to name a few. As such,
routing in such networks is a challenging task since it relies on node cooperation. This thesis focuses on using the concept of centrality to alleviate this task. Unlike other nodes in the
network, central nodes are more likely to act as communication hubs to facilitate the message forwarding. In this thesis, a recently proposed History-Based Prediction
Routing protocol is redesigned using this concept, yielding the so-called centrality-based HBPR protocol. The proposed CHBPR is evaluated by simulations using the ONE simulator, showing superior performance compared to HBPR without centrality and the Epidemic protocol with centrality.
Advisors/Committee Members: Woungang, Isaac (Degree supervisor).
Subjects/Keywords: Computer network protocols – Design.; Ad hoc networks (Computer networks); Routing (Computer network management)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bamrah, A. (2016). A centrality-based history prediction routing protocol for opportunistic networks. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A4879
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Bamrah, Amarpreet. “A centrality-based history prediction routing protocol for opportunistic networks.” 2016. Thesis, Ryerson University. Accessed March 04, 2021.
https://digital.library.ryerson.ca/islandora/object/RULA%3A4879.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Bamrah, Amarpreet. “A centrality-based history prediction routing protocol for opportunistic networks.” 2016. Web. 04 Mar 2021.
Vancouver:
Bamrah A. A centrality-based history prediction routing protocol for opportunistic networks. [Internet] [Thesis]. Ryerson University; 2016. [cited 2021 Mar 04].
Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A4879.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Bamrah A. A centrality-based history prediction routing protocol for opportunistic networks. [Thesis]. Ryerson University; 2016. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A4879
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Missouri – Kansas City
13.
Eswaramurthy, Chockalingam.
SiDR: a Secure inter-Domain Routing protocol for future internet.
Degree: 2011, University of Missouri – Kansas City
URL: http://hdl.handle.net/10355/11457
► Inter-domain routing is a critical functionality that help connect autonomous systems in the Internet. In recent years, there have been concerns in regard to its…
(more)
▼ Inter-domain
routing is a critical functionality that help connect autonomous systems
in the Internet. In recent years, there have been concerns in regard to its vulnerabilities
such as IP prefix hijacking and worm attacks. Many of the problems in the inter
domain
routing arises from the protocol complexity, lack of support for underlying policies,
vulnerabilities, convergence and route stability, scalability and isolation. A number
of approaches have been proposed to address the known vulnerabilities. In this work, we propose an inter-domain
routing protocol for future evolution
of the Internet. Our approach, SiDR (Secure inter Domain
Routing Protocol), addresses
security and benefits from novel technique such as Attribute Based Cryptography (ABE)
for achieving policy
routing and information hiding. SiDR offers a new perspective and
direction for discussions on inter domain
routing. We focus on two aspects of inter domain
routing that is of paramount importance;
routing policies and security.
Advisors/Committee Members: Medhi, Deepankar (advisor).
Subjects/Keywords: Computer networks – Security measures; Routing protocols (Computer network protocols); Thesis – University of Missouri – Kansas City – Computer science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Eswaramurthy, C. (2011). SiDR: a Secure inter-Domain Routing protocol for future internet. (Thesis). University of Missouri – Kansas City. Retrieved from http://hdl.handle.net/10355/11457
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Eswaramurthy, Chockalingam. “SiDR: a Secure inter-Domain Routing protocol for future internet.” 2011. Thesis, University of Missouri – Kansas City. Accessed March 04, 2021.
http://hdl.handle.net/10355/11457.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Eswaramurthy, Chockalingam. “SiDR: a Secure inter-Domain Routing protocol for future internet.” 2011. Web. 04 Mar 2021.
Vancouver:
Eswaramurthy C. SiDR: a Secure inter-Domain Routing protocol for future internet. [Internet] [Thesis]. University of Missouri – Kansas City; 2011. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/10355/11457.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Eswaramurthy C. SiDR: a Secure inter-Domain Routing protocol for future internet. [Thesis]. University of Missouri – Kansas City; 2011. Available from: http://hdl.handle.net/10355/11457
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Ryerson University
14.
Chowdhury, Nasim.
OLSR in android operating system.
Degree: 2013, Ryerson University
URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A2794
► Optimized Link State Routing protocol, an ad-hoc routing protocol, has been popular in wireless devices running on Linux operating system for quite some time. In…
(more)
▼ Optimized Link State
Routing protocol, an ad-hoc
routing protocol, has been popular in wireless devices running on Linux operating system for quite some time. In this project we have outlined the process of preparing Android devices for ad-hoc networking, a way to overcome limitations of the OS for continuous UDP communication, ensure all devices communicate on the same wireless Wi-Fi SSID, Cell-ID, subnet and finally implement the Optimized Links State
Routing (OLSR) in Android Operating System using Google Nexus 7 devices. Using the code base from ProjectSPAN, an open source project, OLSR protocol has been ported to Android Nexus 7 devices. The core application is divided into two major sections, MANET and OLSR. Mobile Ad-hoc
Network portion of the code takes care of setting up the device for ad-hoc mode communication, firewall and peripheral setup while OLSR portion of the code maintains the neighbor tables, MPRs and
routing. The project also describes the process by which a device is prepared to run low level custom codes in Android operating system.
The OLSR implementation has been successfully tested with three nodes test bed, demonstrating the multi-hop ad-hoc networking capabilities of this wireless
routing protocol. With the aid of the Android’s graphical interface the application is able to exhibit the dynamic nature of the OLSR protocol. As nodes and neighbors in the
network moves around with respect to time and relative location, OLSR protocol is able to form new neighbors and elect Multipoint Relay in real time.
Advisors/Committee Members: Ryerson University (Degree grantor).
Subjects/Keywords: Android (Electronic resource); Routing protocols (Computer network protocols); Ad hoc networks (Computer networks); Mobile communication systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chowdhury, N. (2013). OLSR in android operating system. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A2794
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chowdhury, Nasim. “OLSR in android operating system.” 2013. Thesis, Ryerson University. Accessed March 04, 2021.
https://digital.library.ryerson.ca/islandora/object/RULA%3A2794.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chowdhury, Nasim. “OLSR in android operating system.” 2013. Web. 04 Mar 2021.
Vancouver:
Chowdhury N. OLSR in android operating system. [Internet] [Thesis]. Ryerson University; 2013. [cited 2021 Mar 04].
Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2794.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chowdhury N. OLSR in android operating system. [Thesis]. Ryerson University; 2013. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2794
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Florida Atlantic University
15.
Wu, Yueshi.
Channel Assignment in Cognitive Radio Wireless Networks.
Degree: 2016, Florida Atlantic University
URL: http://purl.flvc.org/fau/fd/FA00004750
;
(URL)
http://purl.flvc.org/fau/fd/FA00004750
► Summary: Cognitive radio technology that enables dynamic spectrum access has been a promising solution for the spectrum scarcity problem. Cognitive radio networks enable the communication…
(more)
▼ Summary: Cognitive radio technology that enables dynamic spectrum access has been
a promising solution for the spectrum scarcity problem. Cognitive radio networks
enable the communication on both licensed and unlicensed channels, having the potential
to better solve the interference and collision issues. Channel assignment is of
great importance in cognitive radio networks. When operating on licensed channels,
the objective is to exploit spectrum holes through cognitive communication, giving
priority to the primary users. In this dissertation, we focus on the development of efficient
channel assignment algorithms and protocols to improve network performance
for cognitive radio wireless networks. The first contribution is on channel assignment
for cognitive radio wireless sensor networks aiming to provide robust topology control,
as well as to increase network throughput and data delivery rate. The approach
is then extended to specific cognitive radio network applications achieving improved
performances.
2016
Degree granted: Dissertation (Ph.D.) – Florida Atlantic University, 2016.
Collection: FAU
Advisors/Committee Members: Cardei, Mihaela (Thesis advisor), Florida Atlantic University (Degree grantor), College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science.
Subjects/Keywords: Cognitive radio networks – Technological innovations.; Wireless communication systems – Technological innovations.; Ad hoc networks (Computer networks); Routing protocols (Computer network protocols)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wu, Y. (2016). Channel Assignment in Cognitive Radio Wireless Networks. (Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004750 ; (URL) http://purl.flvc.org/fau/fd/FA00004750
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wu, Yueshi. “Channel Assignment in Cognitive Radio Wireless Networks.” 2016. Thesis, Florida Atlantic University. Accessed March 04, 2021.
http://purl.flvc.org/fau/fd/FA00004750 ; (URL) http://purl.flvc.org/fau/fd/FA00004750.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wu, Yueshi. “Channel Assignment in Cognitive Radio Wireless Networks.” 2016. Web. 04 Mar 2021.
Vancouver:
Wu Y. Channel Assignment in Cognitive Radio Wireless Networks. [Internet] [Thesis]. Florida Atlantic University; 2016. [cited 2021 Mar 04].
Available from: http://purl.flvc.org/fau/fd/FA00004750 ; (URL) http://purl.flvc.org/fau/fd/FA00004750.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wu Y. Channel Assignment in Cognitive Radio Wireless Networks. [Thesis]. Florida Atlantic University; 2016. Available from: http://purl.flvc.org/fau/fd/FA00004750 ; (URL) http://purl.flvc.org/fau/fd/FA00004750
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Michigan State University
16.
Soltani, Soroor.
Stochastic modeling of routing protocols for cognitive radio networks.
Degree: 2013, Michigan State University
URL: http://etd.lib.msu.edu/islandora/object/etd:2047
► Thesis Ph. D. Michigan State University. Electrical Engineering 2013.
Cognitive radios are expected torevolutionize wireless networking because of their ability tosense, manage and share the…
(more)
▼ Thesis Ph. D. Michigan State University. Electrical Engineering 2013.
Cognitive radios are expected torevolutionize wireless networking because of their ability tosense, manage and share the mobile available spectrum.Efficient utilization of the available spectrum could be significantly improved by incorporating different cognitive radio based networks. Challenges are involved in utilizing the cognitive radios in a network, most of which rise from the dynamic nature of available spectrum that is not present in traditional wireless networks. The set of available spectrum blocks(channels) changes randomly with the arrival and departure of the users licensed to a specific spectrum band. These users are known as primary users. If a band is used by aprimary user, the cognitive radio alters its transmission power level ormodulation scheme to change its transmission range and switches to another channel.In traditional wireless networks, a link is stable if it is less prone to interference. In cognitive radio networks, however, a link that is interference free might break due to the arrival of its primary user. Therefore, links' stability forms a stochastic process with OFF and ON states; ON, if the primary user is absent. Evidently, traditional network protocols fail in this environment. New sets of protocols are needed in each layer to cope with the stochastic dynamics of cognitive radio networks.In this dissertation we present a comprehensive stochastic framework and a decision theory based model for the problem of routing packets from a source to a destination in a cognitive radio network. We begin by introducing two probability distributions called ArgMax and ArgMin for probabilistic channel selection mechanisms, routing, and MAC protocols. The ArgMax probability distribution locates the most stable link from a set of available links. Conversely, ArgMin identifies the least stable link. ArgMax and ArgMin together provide valuable information on the diversity of the stability of available links in a spectrum band. Next, considering the stochastic arrival of primary users, we model the transition of packets from one hop to the other by a Semi-Markov process and develop a Primary Spread Aware Routing Protocol (PSARP) that learns the dynamics of the environment and adapts its routing decision accordingly. Further, we use a decision theory framework. A utility function is designed to capture the effect of spectrum measurement, fluctuation of bandwidth availability and path quality. A node cognitively decides its best candidate among its neighbors by utilizing a decision tree. Each branch of the tree is quantified by the utility function and a posterior probability distribution, constructed using ArgMax probability distribution, which predicts the suitability of available neighbors. In DTCR (Decision Tree Cognitive Routing), nodes learn their operational environment and adapt their decision making accordingly. We extend the Decision tree modeling to translate video routing in a dynamic cognitive radio network into a…
Advisors/Committee Members: Mutka, Matt W, Koul, Hira, Radha, Hayder, Xi, Ning.
Subjects/Keywords: Cognitive radio networks – Mathematical models; Routing protocols (Computer network protocols) – Mathematical models; Stochastic models; Electrical engineering; Computer engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Soltani, S. (2013). Stochastic modeling of routing protocols for cognitive radio networks. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:2047
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Soltani, Soroor. “Stochastic modeling of routing protocols for cognitive radio networks.” 2013. Thesis, Michigan State University. Accessed March 04, 2021.
http://etd.lib.msu.edu/islandora/object/etd:2047.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Soltani, Soroor. “Stochastic modeling of routing protocols for cognitive radio networks.” 2013. Web. 04 Mar 2021.
Vancouver:
Soltani S. Stochastic modeling of routing protocols for cognitive radio networks. [Internet] [Thesis]. Michigan State University; 2013. [cited 2021 Mar 04].
Available from: http://etd.lib.msu.edu/islandora/object/etd:2047.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Soltani S. Stochastic modeling of routing protocols for cognitive radio networks. [Thesis]. Michigan State University; 2013. Available from: http://etd.lib.msu.edu/islandora/object/etd:2047
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
17.
Soran, Ahmet.
Multi-Core Parallel Routing.
Degree: 2017, University of Nevada – Reno
URL: http://hdl.handle.net/11714/2027
► The recent increase in the amount of data (i.e., big data) led to higher data volumes to be transferred and processed over the network. Also,…
(more)
▼ The recent increase in the amount of data (i.e., big data) led to higher data volumes to be transferred and processed over the
network. Also, over the last years, the deployment of multi-core routers has grown rapidly. However, such big data transfers are not leveraging the powerful multi-core routers to the extent possible, particularly in the key function of
routing. Our main goal is to find a way so we can use these cores more effectively and efficiently in
routing the big data transfers. In this dissertation, we propose a novel approach to parallelize data transfers by leveraging the multi-core CPUs in the routers. Legacy
routing protocols, e.g. OSPF for intra-domain
routing, send data from source to destination on a shortest single path. We describe an end-to-end method to distribute data optimally on flows by using multiple paths. We generate new virtual topology substrates from the underlying router topology and perform shortest path
routing on each substrate. With this framework, even though calculating shortest paths could be done with well-known techniques such as OSPF's Dijkstra implementation, finding optimal substrates so as to maximize the aggregate throughput over multiple end-to-end paths is still an NP-hard problem. We focus our efforts on solving the problem and design heuristics for substrate generation from a given router topology. Our heuristics' interim goal is to generate substrates in such a way that the shortest path between a source-destination pair on each substrate minimally overlaps with each other. Once these substrates are determined, we assign each substrate to a core in routers and employ a multi-path transport protocol, like MPTCP, to perform end-to-end parallel transfers.
Advisors/Committee Members: Yuksel, Murat (advisor), Gunes, Mehmet H (committee member), Sengupta, Shamik (committee member), Dascalu, Sergiu (committee member), Pekcan, Gokhan (committee member).
Subjects/Keywords: Multi-path Routing; Network; Network Management; Routing; Routing Protocols; Traffic Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Soran, A. (2017). Multi-Core Parallel Routing. (Thesis). University of Nevada – Reno. Retrieved from http://hdl.handle.net/11714/2027
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Soran, Ahmet. “Multi-Core Parallel Routing.” 2017. Thesis, University of Nevada – Reno. Accessed March 04, 2021.
http://hdl.handle.net/11714/2027.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Soran, Ahmet. “Multi-Core Parallel Routing.” 2017. Web. 04 Mar 2021.
Vancouver:
Soran A. Multi-Core Parallel Routing. [Internet] [Thesis]. University of Nevada – Reno; 2017. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/11714/2027.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Soran A. Multi-Core Parallel Routing. [Thesis]. University of Nevada – Reno; 2017. Available from: http://hdl.handle.net/11714/2027
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
18.
Sinky, Hassan Hussein.
Implementation and performance measurement and analysis of OLSR protocol.
Degree: MS, Computer Science, 2010, Oregon State University
URL: http://hdl.handle.net/1957/15012
► This paper provides a measurement-based performance evaluation of the Optimized Link State Routing (OLSR) protocol. Two versions of OLSR, OLSR-ETX and OLSR-ETT, are implemented and…
(more)
▼ This paper provides a measurement-based performance evaluation of the Optimized
Link State
Routing (OLSR) protocol. Two versions of OLSR, OLSR-ETX and
OLSR-ETT, are implemented and evaluated on a mesh
network that we built from
off-the-shelf commercial components. OLSR-ETX uses the Expected Transmission
Count (ETX) metric whereas, OLSR-ETT uses the Expected Transmission Time (ETT)
metric as a means of assessing link quality. The paper describes our implementation
process of the ETT metric using the plug-in feature of OLSRd, and our calculation
method of link bandwidth using the packet-pair technique. A series of measurements
are conducted in our testbed to analyze and compare the performance of ETX and ETT
metrics. Our measurements show that OLSR-ETT outperforms OLSR-ETX
significantly in terms of packet loss, end-to-end delay, and stability, yielding a much
more robust, reliable, and efficient
routing.
Advisors/Committee Members: Hamdaoui, Bechir (advisor), Bose, Bella (committee member).
Subjects/Keywords: Multihop; Routing protocols (Computer network protocols)
…wireless mesh network testbed in Chapter 3. We
then, in Chapter 4, present OLSR and its routing… …random nature of these networks reliable and efficient routing protocols must
be implemented… …optimized and efficient routing protocols are an essential
aspect in wireless networks responsible… …variety of routing protocols specific to wireless mesh networks have been proposed such as… …two general responsibilities carried out by these routing protocols; to form
the topology of…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sinky, H. H. (2010). Implementation and performance measurement and analysis of OLSR protocol. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/15012
Chicago Manual of Style (16th Edition):
Sinky, Hassan Hussein. “Implementation and performance measurement and analysis of OLSR protocol.” 2010. Masters Thesis, Oregon State University. Accessed March 04, 2021.
http://hdl.handle.net/1957/15012.
MLA Handbook (7th Edition):
Sinky, Hassan Hussein. “Implementation and performance measurement and analysis of OLSR protocol.” 2010. Web. 04 Mar 2021.
Vancouver:
Sinky HH. Implementation and performance measurement and analysis of OLSR protocol. [Internet] [Masters thesis]. Oregon State University; 2010. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/1957/15012.
Council of Science Editors:
Sinky HH. Implementation and performance measurement and analysis of OLSR protocol. [Masters Thesis]. Oregon State University; 2010. Available from: http://hdl.handle.net/1957/15012
Rutgers University
19.
Vete, Dipti, 1986-.
Leveraging wireless network virtualizaton for flexible sharing of WLANs.
Degree: MS, Electrical and Computer Engineering, 2010, Rutgers University
URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056850
► Providing air-time guarantees across a group of clients forms a fundamental building block in sharing an access point (AP) across different virtual network service providers.…
(more)
▼ Providing air-time guarantees across a group of clients forms a fundamental building block in sharing an access point (AP) across different virtual
network service providers. Though this problem has a relatively simple solution for downlink group scheduling through traffic engineering at the AP, solving this problem for uplink (UL) traffic presents a challenge for fair sharing of wireless hotspots. Among other issues, the mechanism for uplink traffic control has to scale across a large user base, and provide flexible operation irrespective of the client channel conditions and
network traffic loads. In this thesis the SplitAP architecture is proposed that addresses the problem of sharing uplink airtime across groups of users by extending the idea of
network virtualization. The architecture discussed in this thesis allows different algorithms to be deployed on it for enforcing UL airtime fairness across different client groups. In this thesis, the design features of the SplitAP architecture are highlighted followed by results from evaluation on a prototype deployed with the two algorithms for controlling UL group fairness like: (1) Linear Proportional Feedback Control (LPFC) and (2) Linear Proportional Feedback Control plus (LPFC+). Performance comparisons on the ORBIT testbed show that the proposed algorithms are capable of providing group air-time fairness across wireless clients irrespective of the
network volume, and traffic type. The algorithms show up to 40% improvement with a modified Jain fairness index.
Advisors/Committee Members: Vete, Dipti, 1986- (author), Raychaudhuri, Dipankar (chair), Trappe, Wade (internal member), Zhang, Yanyong (internal member).
Subjects/Keywords: Wireless LANs – Management; Routing protocols (Computer network protocols)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Vete, Dipti, 1. (2010). Leveraging wireless network virtualizaton for flexible sharing of WLANs. (Masters Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056850
Chicago Manual of Style (16th Edition):
Vete, Dipti, 1986-. “Leveraging wireless network virtualizaton for flexible sharing of WLANs.” 2010. Masters Thesis, Rutgers University. Accessed March 04, 2021.
http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056850.
MLA Handbook (7th Edition):
Vete, Dipti, 1986-. “Leveraging wireless network virtualizaton for flexible sharing of WLANs.” 2010. Web. 04 Mar 2021.
Vancouver:
Vete, Dipti 1. Leveraging wireless network virtualizaton for flexible sharing of WLANs. [Internet] [Masters thesis]. Rutgers University; 2010. [cited 2021 Mar 04].
Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056850.
Council of Science Editors:
Vete, Dipti 1. Leveraging wireless network virtualizaton for flexible sharing of WLANs. [Masters Thesis]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056850
Oregon State University
20.
Maiya, Megha.
iMAC : improved medium access control for multi-channel multi-hop
wireless networks.
Degree: MS, Computer Science, 2010, Oregon State University
URL: http://hdl.handle.net/1957/18086
► Trends in wireless networks are increasingly pointing towards a future with multi-hop networks deployed in multi-channel environments. In this thesis, we present the design for…
(more)
▼ Trends in wireless networks are increasingly pointing towards a future with multi-hop
networks deployed in multi-channel environments. In this thesis, we present the design
for iMAC—a protocol targeted at medium access control in such environments. iMAC
uses control packets on a common control channel to faciliate a three-way handshake
between the sender and receiver for every packet transmission. This handshake enables
the sender and receiver to come to consensus on a channel to use for data transmission
and also signals to neighboring nodes about the contention on that channel. iMAC then
uses a mechanism similar to 802.11 for data communication. Our evaluation of iMAC
shows that it provides significant gains in throughput in comparison with uninformed
channel selection, especially when contention for channel bandwidth is neither too low
nor too high; intelligent selection of channels by iMAC is necessary to harness
available bandwidth resources in the presence of medium levels of contention.
Advisors/Committee Members: Hamdaoui, Bechir (advisor), Raich, Raviv (committee member).
Subjects/Keywords: MAC; Computer network protocols
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Maiya, M. (2010). iMAC : improved medium access control for multi-channel multi-hop
wireless networks. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/18086
Chicago Manual of Style (16th Edition):
Maiya, Megha. “iMAC : improved medium access control for multi-channel multi-hop
wireless networks.” 2010. Masters Thesis, Oregon State University. Accessed March 04, 2021.
http://hdl.handle.net/1957/18086.
MLA Handbook (7th Edition):
Maiya, Megha. “iMAC : improved medium access control for multi-channel multi-hop
wireless networks.” 2010. Web. 04 Mar 2021.
Vancouver:
Maiya M. iMAC : improved medium access control for multi-channel multi-hop
wireless networks. [Internet] [Masters thesis]. Oregon State University; 2010. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/1957/18086.
Council of Science Editors:
Maiya M. iMAC : improved medium access control for multi-channel multi-hop
wireless networks. [Masters Thesis]. Oregon State University; 2010. Available from: http://hdl.handle.net/1957/18086
University of Victoria
21.
Pu, Jian.
Reliable routing and its application in MPLS and admission control.
Degree: Department of Computer Science, 2017, University of Victoria
URL: http://hdl.handle.net/1828/7980
► Reliable routing using alternate paths is investigated in this dissertation. We propose precalculated alternate paths as a method for fast recovery from link and node…
(more)
▼ Reliable
routing using alternate paths is investigated in this dissertation. We propose
precalculated alternate paths as a method for fast recovery from link and node failures in
IP networks. We demonstrate that path switching time, and thus failure recovery time are,
as expected, considerably faster than the standard method of recalculating a new path on
the fly. However, to be effective, the alternate paths should share a minimal set of links
and nodes - preferably none - with the failed path. As shared links are considered in this
work, we give a reliability model for this situation (non-disjoint alternate paths) and
develop estimates of reliability as a function of the number of shared links. Alternate path
finding algorithms to calculate suitable alternate paths
subject to predefined constraints
are also developed.
Implementation of these techniques for improving
routing reliability is shown to be
straightforward for explicit
routing protocols such as Multi-Protocol Label Switching
(MPLS) with Explicit
Routing mode. This mode is expected to be the protocol of choice
for applications requiring guaranteed Quality of Service (QoS) carried on the coming
generation of wavelength-switched networks (Internet II, CA Net III, etc.) We propose a
Reliable MPLS (R-MPLS) protocol by applying alternate path
routing to MPLS, using our new algorithms to precalculate appropriate alternate paths. Simulation results show
that R-MPLS can achieve fast recovery from failures.
We also address reliability issues for the problem of optimal Service Level
Agreement (SLA) admission control. To achieve reliable admission control, we apply
alternate path
routing to an existing SLA-based admission controller called SLAOpt. In
the existing Utility Model, SLA admission control is mapped to the Multiple-Choice
Multi-Dimension Knapsack Problem (MMKP), where the aim is to maximize system
utility (i.e., revenue). However, SLAOpt is static in terms of
network topology and does
not consider reliability. Motivated by this, we propose a Reliable SLAOpt (R-SLAOpt), in which utility optimization is
subject to the additional constraint of reliability. A new algorithm was also developed to calculate multiple groups of alternate paths that meet the desired QoS demands and reliability requirement. After QoS adaptation, R-SLAOpt
selects an appropriate path group containing two or three paths for each admitted session
and performs resource reservation on all paths in the group. In the event of node or link
failure, a session can be quickly switched to one of the alternate paths, maintaining the
guaranteed QoS without having to run the full admission algorithm again. In this way, we
have obtained a unified treatment of
routing reliability and optimal SLA admission
control.
Finally, simulations are presented which investigate R-SLAOpt's impact on system
performance and the gains made in reliability.
Advisors/Committee Members: Shoja, Gholamali C (supervisor).
Subjects/Keywords: MPLS standard; Computer network protocols
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pu, J. (2017). Reliable routing and its application in MPLS and admission control. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7980
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Pu, Jian. “Reliable routing and its application in MPLS and admission control.” 2017. Thesis, University of Victoria. Accessed March 04, 2021.
http://hdl.handle.net/1828/7980.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Pu, Jian. “Reliable routing and its application in MPLS and admission control.” 2017. Web. 04 Mar 2021.
Vancouver:
Pu J. Reliable routing and its application in MPLS and admission control. [Internet] [Thesis]. University of Victoria; 2017. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/1828/7980.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Pu J. Reliable routing and its application in MPLS and admission control. [Thesis]. University of Victoria; 2017. Available from: http://hdl.handle.net/1828/7980
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Rutgers University
22.
Krishnamoorthy, Aravind Narayanan, 1990-.
Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms.
Degree: MS, Electrical and Computer Engineering, 2013, Rutgers University
URL: https://rucore.libraries.rutgers.edu/rutgers-lib/41810/
► This thesis presents the results of an experimental study aimed at implementing the MobilityFirst protocol stack on Software-Defined Network platforms. The MobilityFirst protocol involves a…
(more)
▼ This thesis presents the results of an experimental study aimed at implementing the MobilityFirst protocol stack on Software-Defined
Network platforms. The MobilityFirst protocol involves a novel hybrid name/address
routing procedure. Globally Unique Identifiers (GUIDs), which are host names, are first resolved by a Global Name Resolution Service (GNRS) into routable
network addresses, which are then used by the routers to forward data. It also has support for enhanced
network services using in-
network storage and compute. These features have been implemented in an SDN using controller software that learns about the GUIDs and sets up MobilityFirst flows using VLAN tags. The prototype implementation has been done using the Floodlight controller and OpenFlow 1.0 switches. The Floodlight controller has been extended by adding modules that analyze MobilityFirst packets and set up corresponding flows. The prototype has been evaluated by conducting performance experiments on both the control plane and the data plane. Results show that the average processing time at the controller is of the order of 100μs and the data plane throughput for GUID forwarded traffic reaches 800Mbps for mega byte sized chunks. The experiments also highlight potential performance bottlenecks of SDN/OpenFlow networks.
Advisors/Committee Members: Raychaudhuri, Dipankar (chair), Martin, Richard (internal member), Trappe, Wade (internal member).
Subjects/Keywords: Computer network protocols; Software engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Krishnamoorthy, Aravind Narayanan, 1. (2013). Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/41810/
Chicago Manual of Style (16th Edition):
Krishnamoorthy, Aravind Narayanan, 1990-. “Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms.” 2013. Masters Thesis, Rutgers University. Accessed March 04, 2021.
https://rucore.libraries.rutgers.edu/rutgers-lib/41810/.
MLA Handbook (7th Edition):
Krishnamoorthy, Aravind Narayanan, 1990-. “Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms.” 2013. Web. 04 Mar 2021.
Vancouver:
Krishnamoorthy, Aravind Narayanan 1. Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms. [Internet] [Masters thesis]. Rutgers University; 2013. [cited 2021 Mar 04].
Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/41810/.
Council of Science Editors:
Krishnamoorthy, Aravind Narayanan 1. Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms. [Masters Thesis]. Rutgers University; 2013. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/41810/
Florida Atlantic University
23.
Rathod, Monika M.
Context-aware hybrid data dissemination in vehicular networks.
Degree: 2014, Florida Atlantic University
URL: http://purl.flvc.org/fau/fd/FA00004152
;
(URL)
http://purl.flvc.org/fau/fd/FA00004152
► Summary: This work presents the development of the Context-Aware Hybrid Data Dissemination protocol for vehicular networks. The importance of developing vehicular networking data dissemination protocols…
(more)
▼ Summary: This work presents the development of the Context-Aware Hybrid Data Dissemination
protocol for vehicular networks. The importance of developing vehicular networking data
dissemination protocols is exemplified by the recent announcement by the U.S. Department of Transportation (DOT) National Highway Traffic Safety Administration (NHTSA) to enable vehicle-to-vehicle (V2V) communication technology. With emphasis on safety, other useful applications of V2V communication include but are not limited to traffic and routing, weather, construction and road hazard alerts, as well as advertisement and entertainment. The core of V2V communication relies on the efficient dispersion of relevant data through wireless broadcast protocols for these varied applications. The challenges of vehicular networks demand an adaptive broadcast protocol capable of handling diverse applications. This research work illustrates the design of a wireless broadcast protocol that is context-aware and adaptive to vehicular environments taking into consideration vehicle density, road topology, and type of data to be disseminated. The context-aware hybrid data dissemination scheme combines store-and-forward and multi-hop broadcasts, capitalizing on the strengths of both these categories and mitigates the weaknesses to deliver data with maximum efficiency to a widest possible reach. This protocol is designed to work in both urban and highway mobility models. The behavior and performance of the hybrid data dissemination scheme is studied by varying the broadcast zone radius, aggregation ratio, data message size and frequency of the broadcast messages. Optimal parameters are determined and the protocol is then formulated to become adaptive to node density by keeping the field size constant and increasing the number of nodes. Adding message priority levels to propagate safety messages faster and farther than non-safety related messages is the next context we add to our adaptive protocol. We dynamically
set the broadcast region to use multi-hop which has lower latency to propagate
safety-related messages. Extensive simulation results have been obtained using realistic vehicular network scenarios. Results show that Context-Aware Hybrid Data Dissemination Protocol benefits from the low latency characteristics of multi-hop broadcast and low bandwidth consumption of store-and-forward. The protocol is adaptive to both urban and highway mobility models.
2014
Degree granted: Dissertation (Ph.D.) – Florida Atlantic University, 2014.
Collection: FAU
Advisors/Committee Members: Mahgoub, Imad (Thesis advisor), Florida Atlantic University (Degree grantor), College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science.
Subjects/Keywords: Context aware computing; Convergence (Telecommunication); Intelligent transportation systems; Internetworking (Telecommunication); Routing (Computer network management); Routing protocols (Computer network protocols); Vehicular ad hoc networks (Computer networks)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rathod, M. M. (2014). Context-aware hybrid data dissemination in vehicular networks. (Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004152 ; (URL) http://purl.flvc.org/fau/fd/FA00004152
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Rathod, Monika M. “Context-aware hybrid data dissemination in vehicular networks.” 2014. Thesis, Florida Atlantic University. Accessed March 04, 2021.
http://purl.flvc.org/fau/fd/FA00004152 ; (URL) http://purl.flvc.org/fau/fd/FA00004152.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Rathod, Monika M. “Context-aware hybrid data dissemination in vehicular networks.” 2014. Web. 04 Mar 2021.
Vancouver:
Rathod MM. Context-aware hybrid data dissemination in vehicular networks. [Internet] [Thesis]. Florida Atlantic University; 2014. [cited 2021 Mar 04].
Available from: http://purl.flvc.org/fau/fd/FA00004152 ; (URL) http://purl.flvc.org/fau/fd/FA00004152.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Rathod MM. Context-aware hybrid data dissemination in vehicular networks. [Thesis]. Florida Atlantic University; 2014. Available from: http://purl.flvc.org/fau/fd/FA00004152 ; (URL) http://purl.flvc.org/fau/fd/FA00004152
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Colorado State University
24.
Bartlett, Jason D.
Representing BGP and routing flows in XML.
Degree: MS(M.S.), Computer Science, 2013, Colorado State University
URL: http://hdl.handle.net/10217/79008
► Monitoring routing in the Internet is a significant aspect of network security today. Incorrect information that is introduced into the system can result in problems…
(more)
▼ Monitoring
routing in the Internet is a significant aspect of
network security today. Incorrect information that is introduced into the system can result in problems ranging from a particular service or website becoming temporarily inaccessible, to large blocks of
network addresses becoming cut off from the rest of the Internet, to potentially-sensitive user information being redirected to a malicious actor. Current monitoring projects generate a huge dataset for users for sift through. A single collection point collecting
routing data from a dozen routers can archive 1800 update messages every 15 minutes. The largest current monitoring projects have 12-16 collection points, some of which can have several dozen routers feeding data into them, and some of which have been saving data for a decade or more. These archives are stored in a binary format called MRT that appends metadata about the particular
routing session being monitored to the raw data received by a router. They also depend on tools to convert the binary into usable, but rigid, ASCII formats. Ideally, this data could be represented in a standardized ASCII format that both human user and machine application can make use of. Furthermore, such a format ought to be able to be easily extended, whether to represent new features in the underlying data or to transport user-specific annotations, without creating compatibility problems. XML and XSD provide the mechanisms necessary to accomplish this and the framework necessary to do it in such a way that the resulting definitions can become standardized. This work presents an XSD-based generic format for representing the flow of
routing data between arbitrary routers. To provide a concrete realization of this idea, additional schema are defined to describe Border Gateway Protocol messages and several common networking datatypes. All of these schema are defined to provide validation of their underlying data, but are also flexible enough to accommodate extensions within the data and additional datatypes not already included in the schema.
Advisors/Committee Members: Massey, Daniel F. (advisor), Papadopoulos, Christos (committee member), Hayne, Stephen C. (committee member).
Subjects/Keywords: BGP; Internet routing; network security; routing monitoring; routing protocols; XML
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bartlett, J. D. (2013). Representing BGP and routing flows in XML. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/79008
Chicago Manual of Style (16th Edition):
Bartlett, Jason D. “Representing BGP and routing flows in XML.” 2013. Masters Thesis, Colorado State University. Accessed March 04, 2021.
http://hdl.handle.net/10217/79008.
MLA Handbook (7th Edition):
Bartlett, Jason D. “Representing BGP and routing flows in XML.” 2013. Web. 04 Mar 2021.
Vancouver:
Bartlett JD. Representing BGP and routing flows in XML. [Internet] [Masters thesis]. Colorado State University; 2013. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/10217/79008.
Council of Science Editors:
Bartlett JD. Representing BGP and routing flows in XML. [Masters Thesis]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/79008
Ryerson University
25.
Farmani, Behzad.
IMRP: interference-aware multicasting for multiple flows in WMNs.:.
Degree: 2015, Ryerson University
URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A4350
► Multicast is an important routing service for many of fundamental applications such as Webcasting, Video Streaming or Conferencing, Online Games. On the other hand, as…
(more)
▼ Multicast is an important routing service for many of fundamental applications such as Webcasting, Video Streaming or Conferencing, Online Games. On the other hand, as much as Wireless Mesh Networks (WMNs) are growing and become more complex, the need for modification of Multicast Routing for WMNs with different constraints are increased as well. Therefor Researches on multicasting in WMN is still in initial stage.
We focused on Multicasting over Single Channel WMNs with multiple group flows scenario. The main challenge on this scenario is the impact of interference between multiple flows on the performance of multicast flows. By increasing number of receiver nodes in a single channel area, the interference caused by multiple simultaneous flows in the network cannot be fully avoidable, but implementing a proper routing helps to improve the performance of the flows.
In this research, we develop a new interference-aware routing metrics and implement it in our purposed routing scheme (IMRP) for multicasting multiple flows in WMNs. Our purposed metrics takes some new defined attributes of routing path into account. The purposed scheme is evaluated by simulating on Riverbed Modeller 17.5. Simulation and testbed experiments show that our proposed routing significantly improves the total Throughput as well as total Packet Delivery Ratio of multicast flows compared to existing standards.
Subjects/Keywords: Multicasting (Computer networks); Multicasting (Computer networks) – -; Routing (Computer network management); Routing (Computer network management) – -; Routing protocols (Computer network protocol); Routing protocols (Computer network protocol) – -; Wireless communication systems; Wireless communication systems – -; Routers (Computer networks); Routers (Computer networks) – -
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Farmani, B. (2015). IMRP: interference-aware multicasting for multiple flows in WMNs.:. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A4350
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Farmani, Behzad. “IMRP: interference-aware multicasting for multiple flows in WMNs.:.” 2015. Thesis, Ryerson University. Accessed March 04, 2021.
https://digital.library.ryerson.ca/islandora/object/RULA%3A4350.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Farmani, Behzad. “IMRP: interference-aware multicasting for multiple flows in WMNs.:.” 2015. Web. 04 Mar 2021.
Vancouver:
Farmani B. IMRP: interference-aware multicasting for multiple flows in WMNs.:. [Internet] [Thesis]. Ryerson University; 2015. [cited 2021 Mar 04].
Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A4350.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Farmani B. IMRP: interference-aware multicasting for multiple flows in WMNs.:. [Thesis]. Ryerson University; 2015. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A4350
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Missouri – Kansas City
26.
Chandrakant, Sawal Nilesh.
An Energy Efficient Addressing Scheme For a Static Wireless Sensor Network.
Degree: 2011, University of Missouri – Kansas City
URL: http://hdl.handle.net/10355/9614
► In this thesis, we propose architecture for a static wireless sensor network where sensors are arranged into a zones with the nodes at each zone…
(more)
▼ In this thesis, we propose architecture for a static wireless sensor
network where sensors are arranged into a zones with the nodes at each zone interconnected with nodes in sub zones. We also provide an energy efficient
routing algorithm in the
network. In our proposed architecture, every sensor obtains a unique node identifier addressed in a binary addressing fashion. We show that our algorithm can handle addition or deletion of nodes, admits simple and distributed
routing, and is easily extensible. We also present simulation results showing the energy required per packet transmission and overhead analysis in our approach is less as compared to other work. This thesis starts with an introduction to Wireless Sensor Networks and the Directional Source Aware Protocol (DSAP). Then a hierarchical structure and Spatial IP address assignment architecture is studied. We then propose our zone architecture which implements energy efficient addressing scheme.
Advisors/Committee Members: Beard, Cory (advisor).
Subjects/Keywords: Wireless communication systems; Sensor networks; Routing (Computer network management); Computer network protocols; Thesis – University of Missouri – Kansas City – Computer science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chandrakant, S. N. (2011). An Energy Efficient Addressing Scheme For a Static Wireless Sensor Network. (Thesis). University of Missouri – Kansas City. Retrieved from http://hdl.handle.net/10355/9614
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chandrakant, Sawal Nilesh. “An Energy Efficient Addressing Scheme For a Static Wireless Sensor Network.” 2011. Thesis, University of Missouri – Kansas City. Accessed March 04, 2021.
http://hdl.handle.net/10355/9614.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chandrakant, Sawal Nilesh. “An Energy Efficient Addressing Scheme For a Static Wireless Sensor Network.” 2011. Web. 04 Mar 2021.
Vancouver:
Chandrakant SN. An Energy Efficient Addressing Scheme For a Static Wireless Sensor Network. [Internet] [Thesis]. University of Missouri – Kansas City; 2011. [cited 2021 Mar 04].
Available from: http://hdl.handle.net/10355/9614.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chandrakant SN. An Energy Efficient Addressing Scheme For a Static Wireless Sensor Network. [Thesis]. University of Missouri – Kansas City; 2011. Available from: http://hdl.handle.net/10355/9614
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
27.
Santhosh Kumar, G.
Energy-Efficient Cluster based Routing Schemes for Static and Mobile Sensor Networks.
Degree: Computer Science, 2011, Cochin University of Science and Technology
URL: http://dyuthi.cusat.ac.in/purl/2774
► The theme of the thesis is centred around one important aspect of wireless sensor networks; the energy-efficiency.The limited energy source of the sensor nodes calls…
(more)
▼ The theme of the thesis is centred around one important aspect of wireless sensor
networks; the energy-efficiency.The limited energy source of the sensor nodes
calls for design of energy-efficient routing protocols. The schemes for protocol
design should try to minimize the number of communications among the nodes to
save energy. Cluster based techniques were found energy-efficient. In this method
clusters are formed and data from different nodes are collected under a cluster
head belonging to each clusters and then forwarded it to the base station.Appropriate cluster head selection process and generation
of desirable distribution of the clusters can reduce energy consumption of the
network and prolong the network lifetime. In this work two such schemes were
developed for static wireless sensor networks.In the first scheme, the energy wastage due to cluster rebuilding incorporating
all the nodes were addressed. A tree based scheme is presented to alleviate this problem by rebuilding only sub clusters of the network. An analytical model of
energy consumption of proposed scheme is developed and the scheme is compared
with existing cluster based scheme. The simulation study proved the energy
savings observed.The second scheme concentrated to build load-balanced energy efficient clusters
to prolong the lifetime of the network. A voting based approach to utilise
the neighbor node information in the cluster head selection process is proposed.
The number of nodes joining a cluster is restricted to have equal sized optimum
clusters. Multi-hop communication among the cluster heads is also introduced
to reduce the energy consumption. The simulation study has shown that the
scheme results in balanced clusters and the network achieves reduction in energy
consumption.The main conclusion from the study was the routing scheme should pay
attention on successful data delivery from node to base station in addition to the
energy-efficiency. The cluster based protocols are extended from static scenario
to mobile scenario by various authors. None of the proposals addresses cluster
head election appropriately in view of mobility. An elegant scheme for electing
cluster heads is presented to meet the challenge of handling cluster durability
when all the nodes in the network are moving. The scheme has been simulated
and compared with a similar approach.The proliferation of sensor networks enables users with large set of sensor information
to utilise them in various applications. The sensor network programming
is inherently difficult due to various reasons. There must be an elegant
way to collect the data gathered by sensor networks with out worrying about the
underlying structure of the network. The final work presented addresses a way
to collect data from a sensor network and present it to the users in a flexible way.A service oriented architecture based application is built and data collection task
is presented as a web service. This will enable composition of sensor data from
different sensor networks to build interesting applications.…
Subjects/Keywords: Sensor Network; wireless sensor network; Mobile Sensor Network; Routing protocols; Clustering; TAR Protocol; EACM; LEACH Mobile Enhanced protocol; Computer Science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Santhosh Kumar, G. (2011). Energy-Efficient Cluster based Routing Schemes for Static and Mobile Sensor Networks. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/2774
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Santhosh Kumar, G. “Energy-Efficient Cluster based Routing Schemes for Static and Mobile Sensor Networks.” 2011. Thesis, Cochin University of Science and Technology. Accessed March 04, 2021.
http://dyuthi.cusat.ac.in/purl/2774.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Santhosh Kumar, G. “Energy-Efficient Cluster based Routing Schemes for Static and Mobile Sensor Networks.” 2011. Web. 04 Mar 2021.
Vancouver:
Santhosh Kumar G. Energy-Efficient Cluster based Routing Schemes for Static and Mobile Sensor Networks. [Internet] [Thesis]. Cochin University of Science and Technology; 2011. [cited 2021 Mar 04].
Available from: http://dyuthi.cusat.ac.in/purl/2774.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Santhosh Kumar G. Energy-Efficient Cluster based Routing Schemes for Static and Mobile Sensor Networks. [Thesis]. Cochin University of Science and Technology; 2011. Available from: http://dyuthi.cusat.ac.in/purl/2774
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
28.
Praveenkumar, Ramesh.
Investigation of routing protocols in a sensor network.
Degree: MS, 2006, University of Alabama – Birmingham
URL: http://contentdm.mhsl.uab.edu/u?/etd,63
► The objective of this thesis is to model the communication and computation resources of the sensor network, develop a framework for lifetime estimation and performance…
(more)
▼ The objective of this thesis is to model the communication and computation resources of the sensor network, develop a framework for lifetime estimation and performance evaluation of the network, and explore routing schemes so as to extend the functional lifetime of both the individual nodes and the entire network. The sensor network is severely constrained by limited resources, so, energy efficiency is the most important factor in designing the network. Designing an efficient routing protocol in a sensor network is challenging due to various factors, such as limited resources, concentration of a load to a limited portion of the network, and routing of redundant information. For the purpose of studying various exemplary routing protocols, a resource-based model of the sensor network has been developed in MATLAB© employing an Object Oriented Programming (OOP) paradigm. The performances of different exemplary routing protocols under different target speeds and delays was simulated and compared in this work. A concept called localized optimization was introduced and simulated. The results demonstrate a significant improvement in the functional lifetime of the sensor network and a degradation of tracking performance due to delays introduced in the system by the localized optimization algorithm.
M.S.
xi, 90 p. : digital, PDF file
Electrical and Computer Engineering
Engineering
UNRESTRICTED
Advisors/Committee Members: Jannett, Thomas, Grimes, Gary J.<br>, Vaughn, Gregg.
Subjects/Keywords: Sensor networks – Management – Computer programs <; br>; Routing protocols (Computer network protocols) <; br>; Sensor networks – Computer simulation <; br>; Object-oriented programming (Computer science)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Praveenkumar, R. (2006). Investigation of routing protocols in a sensor network. (Masters Thesis). University of Alabama – Birmingham. Retrieved from http://contentdm.mhsl.uab.edu/u?/etd,63
Chicago Manual of Style (16th Edition):
Praveenkumar, Ramesh. “Investigation of routing protocols in a sensor network.” 2006. Masters Thesis, University of Alabama – Birmingham. Accessed March 04, 2021.
http://contentdm.mhsl.uab.edu/u?/etd,63.
MLA Handbook (7th Edition):
Praveenkumar, Ramesh. “Investigation of routing protocols in a sensor network.” 2006. Web. 04 Mar 2021.
Vancouver:
Praveenkumar R. Investigation of routing protocols in a sensor network. [Internet] [Masters thesis]. University of Alabama – Birmingham; 2006. [cited 2021 Mar 04].
Available from: http://contentdm.mhsl.uab.edu/u?/etd,63.
Council of Science Editors:
Praveenkumar R. Investigation of routing protocols in a sensor network. [Masters Thesis]. University of Alabama – Birmingham; 2006. Available from: http://contentdm.mhsl.uab.edu/u?/etd,63
Florida Atlantic University
29.
Arellano, Wilmer.
An Ant Inspired Dynamic Traffic Assignment for VANETs: Early Notification of Traffic Congestion and Traffic Incidents.
Degree: 2016, Florida Atlantic University
URL: http://purl.flvc.org/fau/fd/FA00004566
;
(URL)
http://purl.flvc.org/fau/fd/FA00004566
► Summary: Vehicular Ad hoc NETworks (VANETs) are a subclass of Mobile Ad hoc NETworks and represent a relatively new and very active field of research.…
(more)
▼ Summary: Vehicular Ad hoc NETworks (VANETs) are a subclass of Mobile Ad hoc NETworks
and represent a relatively new and very active field of research. VANETs will enable in
the near future applications that will dramatically improve roadway safety and traffic
efficiency. There is a need to increase traffic efficiency as the gap between the traveled
and the physical lane miles keeps increasing. The Dynamic Traffic Assignment problem
tries to dynamically distribute vehicles efficiently on the road network and in accordance
with their origins and destinations. We present a novel dynamic decentralized and
infrastructure-less algorithm to alleviate traffic congestions on road networks and to fill
the void left by current algorithms which are either static, centralized, or require
infrastructure. The algorithm follows an online approach that seeks stochastic user
equilibrium and assigns traffic as it evolves in real time, without prior knowledge of the traffic demand or the schedule of the cars that will enter the road network in the future.
The Reverse Online Algorithm for the Dynamic Traffic Assignment inspired by Ant
Colony Optimization for VANETs follows a metaheuristic approach that uses reports from
other vehicles to update the vehicle’s perceived view of the road network and change route
if necessary. To alleviate the broadcast storm spontaneous clusters are created around
traffic incidents and a threshold system based on the level of congestion is used to limit
the number of incidents to be reported. Simulation results for the algorithm show a great
improvement on travel time over routing based on shortest distance. As the VANET
transceivers have a limited range, that would limit messages to reach at most 1,000 meters,
we present a modified version of this algorithm that uses a rebroadcasting scheme. This
rebroadcasting scheme has been successfully tested on roadways with segments of up to
4,000 meters. This is accomplished for the case of traffic flowing in a single direction on
the roads. It is anticipated that future simulations will show further improvement when
traffic in the other direction is introduced and vehicles travelling in that direction are
allowed to use a store carry and forward mechanism.
2016
Degree granted: Dissertation (Ph.D.) – Florida Atlantic University, 2016.
Collection: FAU
Advisors/Committee Members: Mahgoub, Imad (Thesis advisor), Florida Atlantic University (Degree grantor), College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science.
Subjects/Keywords: Vehicular ad hoc networks (Computer networks) – Technological innovations.; Routing protocols (Computer network protocols); Artificial intelligence.; Intelligent transportation systems.; Intelligent control systems.; Mobile computing.; Computer algorithms.; Combinatorial optimization.
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Arellano, W. (2016). An Ant Inspired Dynamic Traffic Assignment for VANETs: Early Notification of Traffic Congestion and Traffic Incidents. (Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004566 ; (URL) http://purl.flvc.org/fau/fd/FA00004566
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Arellano, Wilmer. “An Ant Inspired Dynamic Traffic Assignment for VANETs: Early Notification of Traffic Congestion and Traffic Incidents.” 2016. Thesis, Florida Atlantic University. Accessed March 04, 2021.
http://purl.flvc.org/fau/fd/FA00004566 ; (URL) http://purl.flvc.org/fau/fd/FA00004566.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Arellano, Wilmer. “An Ant Inspired Dynamic Traffic Assignment for VANETs: Early Notification of Traffic Congestion and Traffic Incidents.” 2016. Web. 04 Mar 2021.
Vancouver:
Arellano W. An Ant Inspired Dynamic Traffic Assignment for VANETs: Early Notification of Traffic Congestion and Traffic Incidents. [Internet] [Thesis]. Florida Atlantic University; 2016. [cited 2021 Mar 04].
Available from: http://purl.flvc.org/fau/fd/FA00004566 ; (URL) http://purl.flvc.org/fau/fd/FA00004566.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Arellano W. An Ant Inspired Dynamic Traffic Assignment for VANETs: Early Notification of Traffic Congestion and Traffic Incidents. [Thesis]. Florida Atlantic University; 2016. Available from: http://purl.flvc.org/fau/fd/FA00004566 ; (URL) http://purl.flvc.org/fau/fd/FA00004566
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Florida Atlantic University
30.
Alwakeel, Ahmed M.
Implementations Of The DTM, DADCQ And SLAB VANET Broadcast Protocols For The Ns-3 Simulator.
Degree: MS, 2016, Florida Atlantic University
URL: http://purl.flvc.org/fau/fd/FA00004565
;
(URL)
http://purl.flvc.org/fau/fd/FA00004565
► Summary: This work presents the implementations of three adaptive broadcast protocols for vehicular ad hoc networks (VANET) using the Network Simulator 3 (Ns-3). Performing real…
(more)
▼ Summary: This work presents the implementations of three adaptive broadcast protocols for vehicular ad hoc networks (VANET) using the Network Simulator 3 (Ns-3). Performing real life tests for VANET protocols is very costly and risky, so simulation becomes a viable alternative technique. Ns-3 is one of the most advanced open source network simulators. Yet Ns-3 lacks implementations of broadcast protocols for VANET. We first implement the Distance to Mean (DTM) protocol, which uses the distance to mean to determine if a node should rebroadcast or not. We then implement the Distribution-Adaptive Distance with Channel Quality (DADCQ) protocol, which uses node distribution, channel quality and distance to determine if a node should favor rebroadcasting. The third protocol, Statistical Location-Assisted Broadcast protocol (SLAB), is an improvement of DADCQ which automates the threshold function design using machine learning. Our NS-3 implementations of the three protocols have been validated against their JiST/SWANS implementations.
2016
Degree granted: Thesis (M.S.) – Florida Atlantic University, 2016.
Collection: FAU
Advisors/Committee Members: Mahgoub, Imad (Thesis advisor), Florida Atlantic University (Degree grantor), College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science.
Subjects/Keywords: Vehicular ad hoc networks (Computer networks) – Technological innovations.; Wireless communication systems – Technological innovations.; Mobile communication systems – Technological innovations.; Mobile computing.; Intelligent transportation systems – Mathematical models.; Routing protocols (Computer network protocols)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Alwakeel, A. M. (2016). Implementations Of The DTM, DADCQ And SLAB VANET Broadcast Protocols For The Ns-3 Simulator. (Masters Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004565 ; (URL) http://purl.flvc.org/fau/fd/FA00004565
Chicago Manual of Style (16th Edition):
Alwakeel, Ahmed M. “Implementations Of The DTM, DADCQ And SLAB VANET Broadcast Protocols For The Ns-3 Simulator.” 2016. Masters Thesis, Florida Atlantic University. Accessed March 04, 2021.
http://purl.flvc.org/fau/fd/FA00004565 ; (URL) http://purl.flvc.org/fau/fd/FA00004565.
MLA Handbook (7th Edition):
Alwakeel, Ahmed M. “Implementations Of The DTM, DADCQ And SLAB VANET Broadcast Protocols For The Ns-3 Simulator.” 2016. Web. 04 Mar 2021.
Vancouver:
Alwakeel AM. Implementations Of The DTM, DADCQ And SLAB VANET Broadcast Protocols For The Ns-3 Simulator. [Internet] [Masters thesis]. Florida Atlantic University; 2016. [cited 2021 Mar 04].
Available from: http://purl.flvc.org/fau/fd/FA00004565 ; (URL) http://purl.flvc.org/fau/fd/FA00004565.
Council of Science Editors:
Alwakeel AM. Implementations Of The DTM, DADCQ And SLAB VANET Broadcast Protocols For The Ns-3 Simulator. [Masters Thesis]. Florida Atlantic University; 2016. Available from: http://purl.flvc.org/fau/fd/FA00004565 ; (URL) http://purl.flvc.org/fau/fd/FA00004565
◁ [1] [2] [3] [4] [5] … [3992] ▶
. 
Open Access Theses and Dissertations
