You searched for subject:(network delay)
.
Showing records 1 – 30 of
230 total matches.
◁ [1] [2] [3] [4] [5] [6] [7] [8] ▶

Clemson University
1.
Wu, Bo.
Complex Network Analysis and the Applications in Vehicle Delay-Tolerant Networks.
Degree: PhD, Electrical and Computer Engineering (Holcomb Dept. of), 2016, Clemson University
URL: https://tigerprints.clemson.edu/all_dissertations/2312
► Vehicle Delay Tolerant Networks (VDTNs) is a particular kind of Delay Tolerant Networks (DTNs), where vehicles equipped with transmission capabilities are interconnected to form…
(more)
▼ Vehicle
Delay Tolerant Networks (VDTNs) is a particular kind of
Delay Tolerant Networks (DTNs), where vehicles equipped with transmission capabilities are interconnected to form Vehicle NETworks (VNETs). Some applications and services on the top of VDTNs have raised a lot of attention, especially by providing information about weather conditions, road safety, traffic jams, speed limit, and even video streamings without the need of infrastructures. However, due to features such as high vehicle mobility, dynamic scenarios, sparsity of vehicles, short contact durations, disruption and intermittent connectivity and strict requirements for latency, many VDTNs do not present satisfactory performance, because no path exists between a source and its target. In this dissertation, we propose three routing methods to solve the problem as follows.
Our first VDTN system focuses on the multi-copy routing in Vehicle
Delay Tolerant Networks (VDTNs). Multi-copy routing can balance the
network congestion caused by broadcasting and the efficiency limitation in single-copy routing. However, the different copies of each packet search the destination node independently in current multi-copy routing algorithms, which leads to a low utilization of copies since they may search through the same path repeatedly without cooperation. To solve this problem, we propose a fractal Social community based efficient multi-coPy routing in VDTNs, namely SPread. First, we measure social
network features in Vehicle NETworks (VNETs). Then, by taking advantage of weak ties and fractal structure feature of the community in VNETs, SPread carefully scatters different copies of each packet to different communities that are close to the destination community, thus ensuring that different copies search the destination community through different weak ties. For the routing of each copy, current routing algorithms either fail to exploit reachability information of nodes to different nodes (centrality based methods) or only use single-hop reachability information (community based methods), e.g., similarity and probability. Here, the reachability of node i to a destination j (a community or a node) means the possibility that a packet can reach j through i. In order to overcome above drawbacks, inspired by the personalized PageRank algorithm, we design new algorithms for calculating multi-hop reachability of vehicles to different communities and vehicles dynamically. Therefore, the routing efficiency of each copy can be enhanced. Finally, extensive trace-driven simulation demonstrates the high efficiency of SPread in comparison with state-of-the-art routing algorithms in DTNs.
However, in SPread, we only consider the VNETs as complex networks and fail to use the unique location information to improve the routing performance. We believe that the complex
network knowledge should be combined with special features of various networks themselves in order to benefit the real application better. Therefore, we further explore the possibility to…
Advisors/Committee Members: Haiying Shen, Adam Hoover, Ilya Safro, Yongqiang Wang.
Subjects/Keywords: complex network; delay tolerant network; vehicle network
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, B. (2016). Complex Network Analysis and the Applications in Vehicle Delay-Tolerant Networks. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/2312
Chicago Manual of Style (16th Edition):
Wu, Bo. “Complex Network Analysis and the Applications in Vehicle Delay-Tolerant Networks.” 2016. Doctoral Dissertation, Clemson University. Accessed March 05, 2021.
https://tigerprints.clemson.edu/all_dissertations/2312.
MLA Handbook (7th Edition):
Wu, Bo. “Complex Network Analysis and the Applications in Vehicle Delay-Tolerant Networks.” 2016. Web. 05 Mar 2021.
Vancouver:
Wu B. Complex Network Analysis and the Applications in Vehicle Delay-Tolerant Networks. [Internet] [Doctoral dissertation]. Clemson University; 2016. [cited 2021 Mar 05].
Available from: https://tigerprints.clemson.edu/all_dissertations/2312.
Council of Science Editors:
Wu B. Complex Network Analysis and the Applications in Vehicle Delay-Tolerant Networks. [Doctoral Dissertation]. Clemson University; 2016. Available from: https://tigerprints.clemson.edu/all_dissertations/2312

University of Melbourne
2.
Halstead, Imogen Cara.
Learning in social networks.
Degree: 2014, University of Melbourne
URL: http://hdl.handle.net/11343/42042
► People learn from their social networks - through watching one another's behaviour and listening to one another's advice. This dissertation explores several key features of…
(more)
▼ People learn from their social networks - through watching one another's behaviour and listening to one another's advice. This dissertation explores several key features of social learning mechanisms, motivated by a case-study of pineapple farming communities in Ghana, West Africa. First, I revisit the Ghanaian setting originally studied by Conley & Udry (2010), and I present empirical evidence that works to recast existing understanding of the social learning mechanisms at play in this context. My findings suggest that novice pineapple farmers indiscriminately imitate the behaviour of their information contacts - farmers with whom they share advice - rather than adopting successful behaviours exclusively. Second, I present a theoretical model of Bayesian sequential social learning in a setting where agents observe other adopters' behaviour, and then outcomes after a time-lag (as is the case with pineapple cultivation). In equilibrium, earlier agents each successively wait to act in order to observe their immediate predecessor's outcome, while later agents act as soon as possible, instigating a run of herd-like behaviour (in an environment where output signals are only locally observed). I show that equilibrium behaviour is socially optimal when output signals are only locally observed, but that delays can lead to welfare inefficiencies when output signals are observed by the public at large. Third, I present a theoretical model of endogenous network formation in the context of Bayesian learning. Agents can establish multiple links (as evidenced in the Ghanaian farmers' information networks) and are equipped to reconcile different renditions of relayed advice. I show that generalised core-periphery structures are an equilibrium outcome of agents' dynamic best-response link formation decisions.
Subjects/Keywords: learning; delay; network formation; Ghana
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):
Halstead, I. C. (2014). Learning in social networks. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/42042
Chicago Manual of Style (16th Edition):
Halstead, Imogen Cara. “Learning in social networks.” 2014. Doctoral Dissertation, University of Melbourne. Accessed March 05, 2021.
http://hdl.handle.net/11343/42042.
MLA Handbook (7th Edition):
Halstead, Imogen Cara. “Learning in social networks.” 2014. Web. 05 Mar 2021.
Vancouver:
Halstead IC. Learning in social networks. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/11343/42042.
Council of Science Editors:
Halstead IC. Learning in social networks. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/42042

Northeastern University
3.
Koh, Min Hyong.
Effects of delays and network graphs on multi-agent network dynamics stability and performance.
Degree: PhD, Department of Mechanical and Industrial Engineering, 2018, Northeastern University
URL: http://hdl.handle.net/2047/D20294219
► Dynamics of multi-agent systems (MAS) is influenced by communication/activation delays as well as network characteristics. Here, the aim is to design network graphs and develop…
(more)
▼ Dynamics of multi-agent systems (MAS) is influenced by communication/activation delays as well as network characteristics. Here, the aim is to design network graphs and develop control algorithms for a class of MAS considering critical the interplay between network delays and network graphs. Specifically, the network graphs influence not only the stability of MAS guaranteed when delay is less than a certain margin, delay margin, but also the performance, reaching speed of agents to a common steady state (consensus).
Subjects/Keywords: delay margin; multi-agent system; network graph; time-delay system
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):
Koh, M. H. (2018). Effects of delays and network graphs on multi-agent network dynamics stability and performance. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20294219
Chicago Manual of Style (16th Edition):
Koh, Min Hyong. “Effects of delays and network graphs on multi-agent network dynamics stability and performance.” 2018. Doctoral Dissertation, Northeastern University. Accessed March 05, 2021.
http://hdl.handle.net/2047/D20294219.
MLA Handbook (7th Edition):
Koh, Min Hyong. “Effects of delays and network graphs on multi-agent network dynamics stability and performance.” 2018. Web. 05 Mar 2021.
Vancouver:
Koh MH. Effects of delays and network graphs on multi-agent network dynamics stability and performance. [Internet] [Doctoral dissertation]. Northeastern University; 2018. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/2047/D20294219.
Council of Science Editors:
Koh MH. Effects of delays and network graphs on multi-agent network dynamics stability and performance. [Doctoral Dissertation]. Northeastern University; 2018. Available from: http://hdl.handle.net/2047/D20294219

University of Alberta
4.
Wang, Zhiyu.
Exploiting periodicity within mobile data for routing in
delay tolerant mobile networks.
Degree: PhD, Department of Computing Science, 2013, University of Alberta
URL: https://era.library.ualberta.ca/files/sf268595p
► Delay Tolerant Mobile Networks (DTMNs) provide communication despite the occasional presence of disconnected subnetworks. They rely on finding a set of sequential opportunistic encounters between…
(more)
▼ Delay Tolerant Mobile Networks (DTMNs) provide
communication despite the occasional presence of disconnected
subnetworks. They rely on finding a set of sequential opportunistic
encounters between pairs of mobile nodes. In this context,
understanding mobile node behaviour is essential to design
effective and efficient network protocols. Previous studies aimed
to predict future encounters where predictions depend on exploring
the probability/age of encounters and integrated interactions in
the mobile data. However, those previous solutions suffer from
unstable predicted encounters with lack of routing information such
as encounter times. As an alternative to prediction, we propose to
exploit periodicity within mobile data to find stable (periodic)
encounters for routing in DTMNs. In this thesis, we first present a
generic methodology to model and find periodic encounter patterns
by using the auto-persistence function and detection techniques
derived from it. Secondly, we propose a novel graph model to
capture periodic encounter patterns where routing problems can be
modelled and solved as optimization problems. Lastly, to connect
disconnected subnetworks that are strongly connected inside, e.g.,
by periodic encounters, in the networks we introduce stationary
relay nodes whose deployment is modelled as various k-connectivity
problems. Taking advantage of our studies, the experimental results
demonstrate that in the environment of DTMNs with the presence of
disconnected sub-networks, message delivery can benefit greatly
from the underlying periodicity within mobile data. In addition,
exploiting periodicity opens up new research frontiers in several
aspects such as designing novel routing protocols, query
dissemination and collection, and preserving privacy and security
in environments with the presence of periodic
behaviours.
Subjects/Keywords: periodicity; mobile networks; patterns; delay tolerant network
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):
Wang, Z. (2013). Exploiting periodicity within mobile data for routing in
delay tolerant mobile networks. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/sf268595p
Chicago Manual of Style (16th Edition):
Wang, Zhiyu. “Exploiting periodicity within mobile data for routing in
delay tolerant mobile networks.” 2013. Doctoral Dissertation, University of Alberta. Accessed March 05, 2021.
https://era.library.ualberta.ca/files/sf268595p.
MLA Handbook (7th Edition):
Wang, Zhiyu. “Exploiting periodicity within mobile data for routing in
delay tolerant mobile networks.” 2013. Web. 05 Mar 2021.
Vancouver:
Wang Z. Exploiting periodicity within mobile data for routing in
delay tolerant mobile networks. [Internet] [Doctoral dissertation]. University of Alberta; 2013. [cited 2021 Mar 05].
Available from: https://era.library.ualberta.ca/files/sf268595p.
Council of Science Editors:
Wang Z. Exploiting periodicity within mobile data for routing in
delay tolerant mobile networks. [Doctoral Dissertation]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/sf268595p

Vanderbilt University
5.
Zhan, Zihao.
Network-based Hardware-in-the-loop Simulation for Quadcopter.
Degree: MS, Electrical Engineering, 2018, Vanderbilt University
URL: http://hdl.handle.net/1803/12881
► Hardware-in-the-loop (HIL) simulation is an effective technique for testing an embedded system. An HIL simulation includes a plant model run in a real-time simulator, a…
(more)
▼ Hardware-in-the-loop (HIL) simulation is an effective technique for testing an embedded system. An HIL simulation includes a plant model run in a real-time simulator, a controller run in the embedded system under test, and an interface used for communication between the simulator and the embedded system. The simulation and interfaces parts influence the HIL simulation's reliability and accuracy. Using a
network as the HIL simulation's interface introduces problems like
network delay and packet loss. Moreover the clocks in the simulator and the embedded system may not be synchronized. In this thesis, we include an assumption of latency in HIL simulation. By building in a latency model and comparing simulation results with actual measurement results, we were able to verify the latency assumption. From an analysis of the results, we found queuing
delay to be responsible for the simulator's latency most of the time. By evaluating performance via software-in-the-loop (SIL) simulation, in which both plant and controller are run in simulation, we were able to estimate the latency's effect on SIL simulation. Through comparison of HIL and SIL simulation results, we verified that latency has the most significant influence on control performance.
Advisors/Committee Members: Gabor Karsai (committee member), Richard Alan Peters (committee member).
Subjects/Keywords: quadcopter; network delay; hardware-in-the-loop
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):
Zhan, Z. (2018). Network-based Hardware-in-the-loop Simulation for Quadcopter. (Thesis). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/12881
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):
Zhan, Zihao. “Network-based Hardware-in-the-loop Simulation for Quadcopter.” 2018. Thesis, Vanderbilt University. Accessed March 05, 2021.
http://hdl.handle.net/1803/12881.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhan, Zihao. “Network-based Hardware-in-the-loop Simulation for Quadcopter.” 2018. Web. 05 Mar 2021.
Vancouver:
Zhan Z. Network-based Hardware-in-the-loop Simulation for Quadcopter. [Internet] [Thesis]. Vanderbilt University; 2018. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/1803/12881.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhan Z. Network-based Hardware-in-the-loop Simulation for Quadcopter. [Thesis]. Vanderbilt University; 2018. Available from: http://hdl.handle.net/1803/12881
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of New South Wales
6.
Zhao, Qichao.
Medium Access Control in Distributed Networks with Large Propagation Delay.
Degree: Engineering & Information Technology, 2015, University of New South Wales
URL: http://handle.unsw.edu.au/1959.4/55248
;
https://unsworks.unsw.edu.au/fapi/datastream/unsworks:36871/SOURCE02?view=true
► Most of the Earth is covered by water, so underwater acoustic networks (UWANs) are becoming increasingly popular in a variety of undersea applications. The needs…
(more)
▼ Most of the Earth is covered by water, so underwater acoustic networks (UWANs) are becoming increasingly popular in a variety of undersea applications. The needs to understand the underwater environment and exploit rich undersea resources have motivated a further development of UWANs.Underwater acoustic signals suffer from more difficult physical channel phenomena than terrestrial radio signals due to the harsh underwater environment, such as sound absorption, time-varying multipath spread, man-made and ambient noise, temperature and pressure dependent refraction, scattering and Doppler shift. Among all the challenges, the large ratio of propagation
delay to packet duration (relative propagation
delay (a)) is arguably the most difficult one to address in the Medium Access Control (MAC) layer. In this dissertation we focus on the examination and improvement of the MAC layer function in UWANs, based on a critical examination of existing techniques.Many MAC techniques have been proposed in recent years, however most of them assume the ratio of the propagation
delay to the packet duration is negligibly small (a<<1). When the relative propagation
delay a increases (a>>1), these protocols perform poorly. This is because the large a leads to both a large negotiation
delay in handshaking based protocols and the space-time uncertainty problem as the packets do not arrive at each node contemporarily. Some underwater-oriented protocols have been proposed which attempt to address these issues but the more successful rely on master nodes or a common understanding of geometry or time. We show by analysis and simulation that it is possible to eliminate collisions in ad-hoc networks with large relative propagation
delay (a>>1) as well as improving the channel utilisation, without a common understanding of geometry or time. This technique is generally applicable, even for truly ad-hoc homogeneous peer-to-peer networks with no reliance on master nodes or other heterogeneous features. The mechanism is based on future scheduling with the inclusion of overhearing of RTS messages and allowing third-party objections to proposed transmissions. This MAC mechanism is immediately applicable in underwater acoustic networks (UWANs), and may find other uses, such as in space or very high rate terrestrial wireless networks.In summary, the key contributions of this study are: investigating the causes of the poor performance of existing MAC protocols in ad-hoc UWANs with large relative propagation
delay, fully detailing the problem in order to propose analytic solutions, demonstrating how the MAC layer of an ad-hoc UWAN can eliminate packet collisions as well as improve channel utilisation without time synchronization or a network’s self-configuring phase to gain knowledge of the geometry, and verifying the utility of the proposals via both theoretical analysis and simulations.
Advisors/Committee Members: Benson, Craig, Engineering & Information Technology, UNSW Canberra, UNSW, Lambert, Andrew, Engineering & Information Technology, UNSW Canberra, UNSW.
Subjects/Keywords: Ad-Hoc Network; MAC; Large Propagation Delay
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):
Zhao, Q. (2015). Medium Access Control in Distributed Networks with Large Propagation Delay. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/55248 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:36871/SOURCE02?view=true
Chicago Manual of Style (16th Edition):
Zhao, Qichao. “Medium Access Control in Distributed Networks with Large Propagation Delay.” 2015. Doctoral Dissertation, University of New South Wales. Accessed March 05, 2021.
http://handle.unsw.edu.au/1959.4/55248 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:36871/SOURCE02?view=true.
MLA Handbook (7th Edition):
Zhao, Qichao. “Medium Access Control in Distributed Networks with Large Propagation Delay.” 2015. Web. 05 Mar 2021.
Vancouver:
Zhao Q. Medium Access Control in Distributed Networks with Large Propagation Delay. [Internet] [Doctoral dissertation]. University of New South Wales; 2015. [cited 2021 Mar 05].
Available from: http://handle.unsw.edu.au/1959.4/55248 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:36871/SOURCE02?view=true.
Council of Science Editors:
Zhao Q. Medium Access Control in Distributed Networks with Large Propagation Delay. [Doctoral Dissertation]. University of New South Wales; 2015. Available from: http://handle.unsw.edu.au/1959.4/55248 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:36871/SOURCE02?view=true

North Carolina State University
7.
Xu, Yi.
Understanding the Performance and Resilience of Large-Scale Multi-Hop Wireless Networks.
Degree: PhD, Computer Engineering, 2010, North Carolina State University
URL: http://www.lib.ncsu.edu/resolver/1840.16/6204
► Wireless networks are becoming an important supplementary technology to the traditional wired networks. They offer convenient and flexible network access for the users to communicate…
(more)
▼ Wireless networks are becoming an important supplementary technology to the traditional wired networks. They offer convenient and flexible
network access for the users to communicate with each other. However, wireless networks confront many technical challenges that limit their full utilization. Especially in large-scale multi-hop networks, the communication quality received by each user depends highly on the cooperation of other users in the
network, which is constrained by many factors such as the heterogeneity of user communication devices, the limited availability of radio bandwidth, the difficulty in user coordinations, the mobility of users, and the failure of user devices.
We intend to understand the performance and resilience of large-scale multi-hop wireless networks in this dissertation, which will help us utilize the wireless networks effectively, efficiently and reliably. We identify four fundamental performance and resilience aspects to investigate, namely, the information propagation speed, the communication capacity, the topological stability, and the failure resilience. The study on the first two perspectives attempts to minimize the
delay and maximize the capacity of large wireless networks, while the study on the last two perspectives evaluates and mitigates the impact of user mobility and failure on the
network structure.
Specifically, we make the following contributions toward improving the utilization of large-scale wireless networks. First, we have determined the maximum information propagation speed in wireless networks and designed a new routing algorithm to identify the minimum transmission
delay path for fastest information delivery. Second, we have demonstrated that the maximum
network capacity can be obtained by scheduling user transmissions in localized areas and proposed a practical solution for capacity maximization. Third, we have analyzed the
network topological stability with presence of user mobility and developed methods to extend the
network topology lifetime. Last, we have characterized the spread of correlated user failures and suggested strategies to prevent failures from wide spreading in large wireless networks. The work in this disseration advances our understanding and enhances our utilization of large-scale multi-hop wireless networks.
Advisors/Committee Members: Dr. Khaled Harfoush, Committee Member (advisor), Dr. Yannis Viniotis, Committee Member (advisor), Dr. Arne A. Nilsson, Committee Member (advisor), Dr. Wenye Wang, Committee Chair (advisor).
Subjects/Keywords: failure spread; network performance; wireless network; random mobility; network capacity; transmission delay; network resilience
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):
Xu, Y. (2010). Understanding the Performance and Resilience of Large-Scale Multi-Hop Wireless Networks. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/6204
Chicago Manual of Style (16th Edition):
Xu, Yi. “Understanding the Performance and Resilience of Large-Scale Multi-Hop Wireless Networks.” 2010. Doctoral Dissertation, North Carolina State University. Accessed March 05, 2021.
http://www.lib.ncsu.edu/resolver/1840.16/6204.
MLA Handbook (7th Edition):
Xu, Yi. “Understanding the Performance and Resilience of Large-Scale Multi-Hop Wireless Networks.” 2010. Web. 05 Mar 2021.
Vancouver:
Xu Y. Understanding the Performance and Resilience of Large-Scale Multi-Hop Wireless Networks. [Internet] [Doctoral dissertation]. North Carolina State University; 2010. [cited 2021 Mar 05].
Available from: http://www.lib.ncsu.edu/resolver/1840.16/6204.
Council of Science Editors:
Xu Y. Understanding the Performance and Resilience of Large-Scale Multi-Hop Wireless Networks. [Doctoral Dissertation]. North Carolina State University; 2010. Available from: http://www.lib.ncsu.edu/resolver/1840.16/6204

Virginia Tech
8.
Liu, Qingyu.
Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications.
Degree: PhD, Computer Engineering, 2019, Virginia Tech
URL: http://hdl.handle.net/10919/90405
► We consider a network modeled as a directed graph, where it takes time for data to traverse each link in the network. It models many…
(more)
▼ We consider a
network modeled as a directed graph, where it takes time for data to traverse each link in the
network. It models many critical applications both in the communication area and in the transportation field. For example, both the European education
network and the US national highway
network can be modeled as directed graphs. We consider a scenario where a source node is required to send multiple (a set of) data packets to a destination node through the
network as fast as possible, possibly using multiple source-to-destination paths. In this dissertation we study four problems all of which try to figure out routing solutions to send the set of data packets, with an objective of minimizing experienced travel time or
subject to travel time constraints. Although all of our four problems are NP-hard, we design approximation algorithms to solve them and obtain solutions with theoretically bounded gaps as compared to the optimal. The first three problems are in the communication area, and the last problem is in the transportation field. We claim the following specific contributions. Minimize maximum
delay and average
delay. First, we consider the setting of simultaneously minimizing the average travel time and the worst (largest) travel time of sending the set of data packets from source to destination. Existing results say that the two metrics of travel time cannot be minimized to be both within bounded-ratio gaps to the optimal. As a comparison, we design three different routing solutions, each of which can minimize the two metrics of travel time simultaneously within a constant bounded ratio-gap to the optimal, but at a cost of only delivering a portion of the data. Minimize Age-of-Information (AoI). Second, we consider the problem of minimizing a newly proposed travel-time-sensitive performance metric, i.e., AoI, which is the elapsed time since the generation of the last received data. Our AoI study differs from existing ones in that we are the first to consider a set of data and multi-path routing. We develop both an optimal algorithm with a pseudo-polynomial time complexity and an approximation framework with a polynomial time complexity. Maximize
network utility. Third, we consider a more general setting with multiple source destination pairs. Each source incurs a utility that is a function of the experienced travel time or the achieved throughput to send data to its destination. Our objective is to maximize the aggregate utility under throughput requirements and travel time constraints. We develop a polynomial-time approximation algorithm, at the cost of violating constraints by up to constant-ratios. It is non-trivial to design such algorithms, as we prove that it is NPcomplete either to construct an optimal solution under relaxed
delay constraints or relaxed throughput requirements, or to figure out a feasible solution with all constraints satisfied. Minimize fuel consumption for a heavy truck to timely fulfill multiple transportation tasks. Finally, we consider a truck and multiple transportation…
Advisors/Committee Members: Zeng, Haibo (committeechair), Yang, Yaling (committee member), Rakha, Hesham A. (committee member), Hsiao, Michael S. (committee member), Park, Jung-Min (committee member).
Subjects/Keywords: Delay-Aware Network Flow; Delay-Aware Multi-Path Routing; Multi-Hop Network; Network Resource Allocation; Polynomial-Time Approximation Algorithm
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):
Liu, Q. (2019). Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/90405
Chicago Manual of Style (16th Edition):
Liu, Qingyu. “Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications.” 2019. Doctoral Dissertation, Virginia Tech. Accessed March 05, 2021.
http://hdl.handle.net/10919/90405.
MLA Handbook (7th Edition):
Liu, Qingyu. “Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications.” 2019. Web. 05 Mar 2021.
Vancouver:
Liu Q. Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications. [Internet] [Doctoral dissertation]. Virginia Tech; 2019. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10919/90405.
Council of Science Editors:
Liu Q. Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications. [Doctoral Dissertation]. Virginia Tech; 2019. Available from: http://hdl.handle.net/10919/90405

Anna University
9.
Shanthi N.
Some studies on security issues in multicast mobile ad
hoc network;.
Degree: 2013, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/13659
► Wireless ad-hoc networks are suitable and sometimes the only solution for several applications. Many applications, particularly those in military and critical civilian domains, require that…
(more)
▼ Wireless ad-hoc networks are suitable and sometimes
the only solution for several applications. Many applications,
particularly those in military and critical civilian domains,
require that ad-hoc networks be secure and stable. In fact,
security is one of the main barriers to the extensive use of ad-hoc
networks in many operations. Performance of the multicast Mobile
Ad-hoc NETwork (MANET) is analyzed against these attacks.
Specifically, analyzing how the number of attackers and the number
of receivers affects the performance of a multicast session is the
thrust area of this study. Performance metrics used are Packet
Delivery Ratio (PDR), Endto-End delay, Delay jitter and Throughput.
The results enable the researchers to suggest measures to minimize
the impacts of these attacks on multicast in MANET. The proposed
method uses asymmetric key algorithms such as RSA and MD5.
Confidentiality and Integrity are the basis of any secure
communication. Both keys (Public and Private) are generated by RSA
cryptographic algorithm. Integrity is ensured by appending a hash
value, generated from the input message given to the network, using
MD5 algorithm. Forward and backward secrecy is also ensured by the
proposed batch re-keying scheme. The proposed re-keying scheme can
improve communication cost and reduce the number of re-key
messages, when the members join or leave the network. When many of
the members join or leave at the same time, the proposed batch
re-keying scheme improves the rekeying performance. The factors
include computation complexity, storage capacity, and number of
re-key messages generated, efficiency and so on. No specific
security method is the best solution for all applications. This
report discusses various security attacks, security enhancement
methods and key distribution methods in multicast MANET. Security
enhancement is achieved through RSA and MD5 algorithms. The keys
required for secure group communication is generated by using MDS
codes and with the proposed new batch re-keying concepts. newline
newline
Advisors/Committee Members: Ganesan, L..
Subjects/Keywords: Mobile ad hoc network; Packet Delivery Radio; Endto-End
delay; Delay Jitter; cryptographic algorithm.
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):
N, S. (2013). Some studies on security issues in multicast mobile ad
hoc network;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/13659
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):
N, Shanthi. “Some studies on security issues in multicast mobile ad
hoc network;.” 2013. Thesis, Anna University. Accessed March 05, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/13659.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
N, Shanthi. “Some studies on security issues in multicast mobile ad
hoc network;.” 2013. Web. 05 Mar 2021.
Vancouver:
N S. Some studies on security issues in multicast mobile ad
hoc network;. [Internet] [Thesis]. Anna University; 2013. [cited 2021 Mar 05].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13659.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
N S. Some studies on security issues in multicast mobile ad
hoc network;. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13659
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

KTH
10.
Ismailov, Alexej.
Network Monitoring in Delay Tolerant Network.
Degree: Computer Science and Communication (CSC), 2015, KTH
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-174053
► A Disruption Tolerant Network (DTN) is a sparse network where connectivity is regulated by the proximity of mobile nodes. Connections are sporadic and the…
(more)
▼ A Disruption Tolerant Network (DTN) is a sparse network where connectivity is regulated by the proximity of mobile nodes. Connections are sporadic and the delivery rate is closely related to node movement. As network resources often are limited in such settings, it is useful to monitor the network in order to make more efficient communication decisions. This study investigates existing routing protocols and monitoring tools for DTN that best cope with the requirements of a tactical military network. A model is proposed to estimate source to destination delay in DTN. This model is evaluated in a Java-based software simulator called The ONE. In order to match the tactical military environment, two scenarios are constructed. The squad scenario simulates the formation movement pattern of several squads and the hierarchical communication scheme that is maintained in a military context. The other scenario simulates a convoy line movement of a military group during transportation. The results of this study show that the proposed mechanism can improve delivery rate and reduce network overhead in settings with strict buffer limitations. The estimation worked best in scenarios that contained some patterns of movement or communication. These patterns are resembled in the model's collected data and the model can provide the user with rough estimates of end-to-end delays in the network. Primary use of this model has been to reduce number of old messages in the network, but other applications like anomaly detection are also discussed in this work.
Ett avbrottstolerant nätverk (DTN) är ett glest nät där konnektiviteten avgörs av närheten bland de rörliga noderna i nätverket. Avbrotten i ett sådant nät förekommer ofta och sporadiskt. Eftersom nätverksresurserna oftast är begränsade i sådana sammanhang, så är det lämpligt att övervaka nätverket för att göra det möjligt att fatta mer effektiva kommunikationsbeslut. Det här arbetet undersöker olika routingalgoritmer och övervakningsvektyg för DTN med hänsyn till de krav som ställs av ett taktiskt nät. En modell för att uppskatta fördröjningen från källa till destination är framtagen i arbetet. Modellen är utvärderad med hjälp av en Javabaserad mjukvarusimulator som heter The ONE. För att bäst representera den miljö som uppstår i militära sammanhang är två scenarion framtagna. Det första är ett truppscenario där nodernar rör sig i fromationer och nättrafiken följer den hierarkiska modellen som används i militär kommunikation. Det andra scenariot är ett konvojscenario där enheter marcherar på led. Resultaten från denna studie visar att den föreslagna modellen kan öka andelen levererade meddelanden och minska nätverksbelastningen i en miljö där bufferstorleken hos noderna är begränsad. Uppskattningen visade sig fungera bäst i scenarion som innehöll någon form av mönster bland nodernas rörelse eller deras kommunikation. Dessa mönster återspeglas i modellens insamlade data och modellen kan förse användaren med en grov estimering av slutfördröjningen till…
Subjects/Keywords: DTN; Delay Tolerant Network; Disruption tolerant network; Prophet; Epidemic routing; The ONE; DTN simulation; network monitoring; tactical network; movement model; markov; delay estimation; Computer Engineering; Datorteknik
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):
Ismailov, A. (2015). Network Monitoring in Delay Tolerant Network. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-174053
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):
Ismailov, Alexej. “Network Monitoring in Delay Tolerant Network.” 2015. Thesis, KTH. Accessed March 05, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-174053.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Ismailov, Alexej. “Network Monitoring in Delay Tolerant Network.” 2015. Web. 05 Mar 2021.
Vancouver:
Ismailov A. Network Monitoring in Delay Tolerant Network. [Internet] [Thesis]. KTH; 2015. [cited 2021 Mar 05].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-174053.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Ismailov A. Network Monitoring in Delay Tolerant Network. [Thesis]. KTH; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-174053
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU
11.
Wei, Chia-Ting.
Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks.
Degree: Master, Computer Science and Engineering, 2014, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515
► In many applications and scenarios, sensors have to regularly report what they monitor from the environment and quickly notify the sink node of event occurrence…
(more)
▼ In many applications and scenarios, sensors have to regularly report what they monitor from the environment and quickly notify the sink node of event occurrence in the sensing field. In-
network data reduction technique such as data aggregation and data compression can help diminish the amount of data sent from sensors, which not only saves
network bandwidth but also preserves sensor energy. However, such technique does not consider packet latency due to the aggregation or compression operation. When some sensors generate regular reports in lower data rates, their packets have to spend longer time to be aggregated or compressed, resulting in higher packet delays. Besides, when events occur, the
network could suffer from instant congestion due to the generation of numerous event notifications. Motivating from the above observations, the paper develops a lightweight, latency-aware routing for data compression (L2DC) scheme to reduce packet latency when applying the compression technique to reduce the amount of data generated from sensors. L2DC gives event notifications a higher priority over regular reports and eliminates unnecessary notifications to avoid bursty
network congestion. In addition, L2DC facilitates the data compression process by allowing each sensor to determine whether to keep packets for compression locally or to send them to a neighbor to be compressed in a distributed manner.
Our L2DC scheme can be applied to most on-demand routing protocols that select the next-hop neighbor to relay packets, such as AODV. Experimental results demonstrate that L2DC outperforms other methods in terms of reducing packet latency.
Advisors/Committee Members: Chun-Hung Lin (chair), Bing-Hong Liu (chair), Wei Kuang Lai (chair), You-Chiun Wang (committee member).
Subjects/Keywords: Packet delay; Wireless sensor network; Routing protocol; In-network data processing; Data aggregation and compression
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):
Wei, C. (2014). Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515
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):
Wei, Chia-Ting. “Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks.” 2014. Thesis, NSYSU. Accessed March 05, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wei, Chia-Ting. “Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks.” 2014. Web. 05 Mar 2021.
Vancouver:
Wei C. Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks. [Internet] [Thesis]. NSYSU; 2014. [cited 2021 Mar 05].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wei C. Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0608114-161515
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Pretoria
12.
Engelbrecht, Nico.
Analysis of RED
packet loss performance in a simulated IP WAN.
Degree: Electrical, Electronic and
Computer Engineering, 2013, University of Pretoria
URL: http://hdl.handle.net/2263/31567
► The Internet supports a diverse number of applications, which have different requirements for a number of services. Next generation networks provide high speed connectivity between…
(more)
▼ The Internet supports a diverse number of applications,
which have different requirements for a number of services. Next
generation networks provide high speed connectivity between hosts,
which leaves the service provider to configure
network devices
appropriately, in order to maximize
network performance. Service
provider settings are based on best recommendation parameters,
which give an opportunity to optimize these settings even further.
This dissertation focuses on a packet discarding algorithm, known
as random early detection (RED), to determine parameters which will
maximize utilization of a resource. The two dominant traffic
protocols used across an IP backbone are UDP and TCP. UDP traffic
flows transmit packets regardless of
network conditions, dropping
packets without changing its transmission rates. However, TCP
traffic flows concern itself with the
network condition, reducing
its packet transmission rate based on packet loss. Packet loss
indicates that a
network is congested. The sliding window concept,
also known as the TCP congestion window, adjusts to the amount of
acknowledgements the source node receives from the destination
node. This paradigm provides a means to transmit data across the
available bandwidth across a
network. A well known and widely
implemented simulation environment, the
network simulator 2 (NS2),
was used to analyze the RED mechanism. The
network simulator 2
(NS2) software gained its popularity as being a complex networking
simulation tool.
Network protocol traffic (UDP and TCP)
characteristics comply with theory, which verifies that the traffic
generated by this simulator is valid. It is shown that the
autocorrelation function differs between these two traffic types,
verifying that the generated traffic does conform to theoretical
and practical results. UDP traffic has a short-range dependency
while TCP traffic has a long-range dependency. Simulation results
show the effects of the RED algorithm on
network traffic and
equipment performance. It is shown that random packet discarding
improves source transmission rate stabilization, as well as node
utilization. If the packet dropping probability is set high, the
TCP source transmission rates will be low, but a low packet drop
probability provides high transmission rates to a few sources and
low transmission rates to the majority of other sources. Therefore,
an ideal packet drop probability was obtained to complement TCP
source transmission rates and node utilization. Statistical
distributions were fitted to sampled data from the simulations,
which also show improvements to the
network with random packet
discarding. The results obtained contribute to congestion control
across wide area networks. Even though a number of queuing
management implementation exists, RED is the most widely used
implementation used by service providers.
Advisors/Committee Members: Engelbrecht, Andries P. (advisor).
Subjects/Keywords: Network
simulation; Quality of
service; Differentiated
services; Network
delay; Packet
discarding; Packet
loss;
RED;
UCTD
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):
Engelbrecht, N. (2013). Analysis of RED
packet loss performance in a simulated IP WAN. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/31567
Chicago Manual of Style (16th Edition):
Engelbrecht, Nico. “Analysis of RED
packet loss performance in a simulated IP WAN.” 2013. Masters Thesis, University of Pretoria. Accessed March 05, 2021.
http://hdl.handle.net/2263/31567.
MLA Handbook (7th Edition):
Engelbrecht, Nico. “Analysis of RED
packet loss performance in a simulated IP WAN.” 2013. Web. 05 Mar 2021.
Vancouver:
Engelbrecht N. Analysis of RED
packet loss performance in a simulated IP WAN. [Internet] [Masters thesis]. University of Pretoria; 2013. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/2263/31567.
Council of Science Editors:
Engelbrecht N. Analysis of RED
packet loss performance in a simulated IP WAN. [Masters Thesis]. University of Pretoria; 2013. Available from: http://hdl.handle.net/2263/31567

Michigan Technological University
13.
Li, Jialiang.
MODELING AND PROTOCOL DESIGN FOR EMERGING WIRELESS SYSTEMS.
Degree: PhD, Department of Electrical and Computer Engineering, 2012, Michigan Technological University
URL: https://digitalcommons.mtu.edu/etd-restricted/217
► Mobile Mesh Network based In-Transit Visibility (MMN-ITV) system facilitates global real-time tracking capability for the logistics system. In-transit containers form a multi-hop mesh network…
(more)
▼ Mobile Mesh
Network based In-Transit Visibility (MMN-ITV) system facilitates global real-time tracking capability for the logistics system. In-transit containers form a multi-hop mesh
network to forward the tracking information to the nearby sinks, which further deliver the information to the remote control center via satellite. The fundamental challenge to the MMN-ITV system is the energy constraint of the battery-operated containers. Coupled with the unique mobility pattern, cross-MMN behavior, and the large-spanned area, it is necessary to investigate the energy-efficient communication of the MMN-ITV system thoroughly.
First of all, this dissertation models the energy-efficient routing under the unique pattern of the cross-MMN behavior. A new modeling approach, pseudo-dynamic modeling approach, is proposed to measure the energy-efficiency of the routing methods in the presence of the cross-MMN behavior. With this approach, it could be identified that the shortest-path routing and the load-balanced routing is energy-efficient in mobile networks and static networks respectively. For the MMN-ITV system with both mobile and static MMNs, an energy-efficient routing method,
energy-threshold routing, is proposed to achieve the best tradeoff between them.
Secondly, due to the cross-MMN behavior, neighbor discovery is executed frequently to help the new containers join the MMN, hence, consumes similar amount of energy as that of the data communication. By exploiting the unique pattern of the cross-MMN behavior, this dissertation proposes energy-efficient neighbor discovery wakeup schedules to save up to 60% of the energy for neighbor discovery.
Vehicular Ad Hoc Networks (VANETs)-based inter-vehicle communications is by now growingly believed to enhance traffic safety and transportation management with low cost. The end-to-end
delay is critical for the time-sensitive safety applications in VANETs, and can be a decisive performance metric for VANETs.
This dissertation presents a complete analytical model to evaluate the end-to-end
delay against the transmission range and the packet arrival rate. This model illustrates a significant end-to-end
delay increase from non-saturated networks to saturated networks. It hence suggests that the distributed power control and admission control protocols for VANETs should aim at improving the real-time capacity (the maximum packet generation rate without causing saturation), instead of the
delay itself.
Based on the above model, it could be determined that adopting
uniform transmission range for every vehicle may hinder the
delay performance improvement, since it does not allow the coexistence of the short path length and the low interference. Clusters are proposed to configure
non-uniform transmission range for the vehicles. Analysis and simulation confirm that such configuration can enhance the real-time capacity. In addition, it provides an improved trade off between the end-to-end…
Advisors/Committee Members: Chunxiao (Tricia) Chigan.
Subjects/Keywords: delay; energy-efficient; mobile mesh network; power control; vehicle ad hoc network; 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):
Li, J. (2012). MODELING AND PROTOCOL DESIGN FOR EMERGING WIRELESS SYSTEMS. (Doctoral Dissertation). Michigan Technological University. Retrieved from https://digitalcommons.mtu.edu/etd-restricted/217
Chicago Manual of Style (16th Edition):
Li, Jialiang. “MODELING AND PROTOCOL DESIGN FOR EMERGING WIRELESS SYSTEMS.” 2012. Doctoral Dissertation, Michigan Technological University. Accessed March 05, 2021.
https://digitalcommons.mtu.edu/etd-restricted/217.
MLA Handbook (7th Edition):
Li, Jialiang. “MODELING AND PROTOCOL DESIGN FOR EMERGING WIRELESS SYSTEMS.” 2012. Web. 05 Mar 2021.
Vancouver:
Li J. MODELING AND PROTOCOL DESIGN FOR EMERGING WIRELESS SYSTEMS. [Internet] [Doctoral dissertation]. Michigan Technological University; 2012. [cited 2021 Mar 05].
Available from: https://digitalcommons.mtu.edu/etd-restricted/217.
Council of Science Editors:
Li J. MODELING AND PROTOCOL DESIGN FOR EMERGING WIRELESS SYSTEMS. [Doctoral Dissertation]. Michigan Technological University; 2012. Available from: https://digitalcommons.mtu.edu/etd-restricted/217

University of Southern California
14.
Huang, Longbo.
Deterministic mathematical optimization in stochastic
network control.
Degree: PhD, Electrical Engineering, 2011, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900
► In this thesis, we extend the recently developed Lyapunov optimization technique (also known as Max-Weight or Backpressure) for stochastic queueing networks in two important directions:…
(more)
▼ In this thesis, we extend the recently developed
Lyapunov optimization technique (also known as Max-Weight or
Backpressure) for stochastic queueing networks in two important
directions: (1) guaranteeing small
network delay; and (2) resolving
underflows. ❧ To achieve our objective, we first establish an
explicit connection between the Lyapunov technique and a randomized
dual subgradient method. Based on this connection, we develop a
novel exponential attraction result, which states that the
network
queue backlog under a Lyapunov algorithm deviates from a certain
fixed point with a probability that decreases exponentially in the
deviation distance. Inspired by the exponential attraction result,
we develop three
delay-efficient algorithms and show that they
achieve near-optimal utility-
delay tradeoffs for a general class of
multi-hop communication networks. One of the algorithms has also
been implemented on a sensor
network testbed and was shown to be
able to guarantee very small
network delay in practical systems. ❧
We later consider the problem of resolving underflows in general
complex
network scheduling problems. In this case, we propose the
weight perturbation technique and develop the Perturbed Max-Weight
algorithm (PMW). We show that PMW effectively resolves underflow
constraints without sacrificing utility performance. We then apply
the perturbation technique to construct utility optimal scheduling
algorithms for two important classes of networks – stochastic
processing networks and energy harvesting networks. ❧ The results
developed in this thesis highlight the importance of Lagrange
multiplier engineering in queueing networks. Specifically, our
results show that the queues under the Lyapunov technique indeed
correspond to the Lagrange multiplier values under the randomized
dual subgradient method. This not only helps us better understand
the Lyapunov technique, but also gives us general guidelines on how
should one design its algorithm to achieve the desire properties of
the queues.
Advisors/Committee Members: Neely, Michael J. (Committee Chair), Caire, Giuseppe (Committee Member), Jain, Rahul (Committee Member), Kempe, David (Committee Member), Krishnamachari, Bhaskar (Committee Member), Wierman, Adam (Committee Member).
Subjects/Keywords: stochastic network control; network delay; queueing; Lyapunov analysis; processing networks; energy harvesting 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):
Huang, L. (2011). Deterministic mathematical optimization in stochastic
network control. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900
Chicago Manual of Style (16th Edition):
Huang, Longbo. “Deterministic mathematical optimization in stochastic
network control.” 2011. Doctoral Dissertation, University of Southern California. Accessed March 05, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900.
MLA Handbook (7th Edition):
Huang, Longbo. “Deterministic mathematical optimization in stochastic
network control.” 2011. Web. 05 Mar 2021.
Vancouver:
Huang L. Deterministic mathematical optimization in stochastic
network control. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Mar 05].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900.
Council of Science Editors:
Huang L. Deterministic mathematical optimization in stochastic
network control. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900

University of California – Santa Cruz
15.
Wood, Samuel Bennett.
Social Network Coding Rate Control In Information Centric Delay Tolerant Networks.
Degree: Computer Engineering, 2014, University of California – Santa Cruz
URL: http://www.escholarship.org/uc/item/2xq4x3q7
► Tactical and emergency-response networks require efficient communication without a managed infrastructure in order to meet the requirements of mission critical applications. In these networks, mobility,…
(more)
▼ Tactical and emergency-response networks require efficient communication without a managed infrastructure in order to meet the requirements of mission critical applications. In these networks, mobility, disruption, limited network resources, and limited host resources are the norm instead of the exception. Despite these constraints, applications must quickly and reliably share data collected from their environment to allow users to coordinate and make critical decisions. Our previous work demonstrates that applying information-centric paradigms to the tactical edge can provide performance benefits over traditional address centric approaches. We expand on this work and investigate how social relationships can be inferred and exploited to improve network performance in volatile networks.As a result of our investigation, we propose SOCRATIC (SOCial RATe control for Information Centric networks), a novel approach to dissemination that unifies replication and network coding, which takes advantage of social content and context heuristics to improve network performance. SOCRATIC replicates network encoded blocks according to a popularity index metric that captures social relationships, and is shared during neighbor discovery. The number of encoded blocks that is relayed to a node depends on its interest in the data object and its popularity index, i.e., how often and for how long it meets other nodes. We observe that nodes with similar interests tend to be co-located and we exploit this information through use of a generalization of a data object-to-interest matching function that quantifies this similarity. Encoded blocks are subsequently replicated towards the subscriber if a stable path exists. We evaluate an implementation of SOCRATIC through a detailed network emulation of a tactical scenario and demonstrate that it can achieve better performance than the existing socially agnostic approaches.
Subjects/Keywords: Computer engineering; delay tolerant networks; information centric networks; network coding
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):
Wood, S. B. (2014). Social Network Coding Rate Control In Information Centric Delay Tolerant Networks. (Thesis). University of California – Santa Cruz. Retrieved from http://www.escholarship.org/uc/item/2xq4x3q7
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):
Wood, Samuel Bennett. “Social Network Coding Rate Control In Information Centric Delay Tolerant Networks.” 2014. Thesis, University of California – Santa Cruz. Accessed March 05, 2021.
http://www.escholarship.org/uc/item/2xq4x3q7.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wood, Samuel Bennett. “Social Network Coding Rate Control In Information Centric Delay Tolerant Networks.” 2014. Web. 05 Mar 2021.
Vancouver:
Wood SB. Social Network Coding Rate Control In Information Centric Delay Tolerant Networks. [Internet] [Thesis]. University of California – Santa Cruz; 2014. [cited 2021 Mar 05].
Available from: http://www.escholarship.org/uc/item/2xq4x3q7.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wood SB. Social Network Coding Rate Control In Information Centric Delay Tolerant Networks. [Thesis]. University of California – Santa Cruz; 2014. Available from: http://www.escholarship.org/uc/item/2xq4x3q7
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of North Texas
16.
Liu, Zhonghao.
Interference Alignment through Propagation Delay.
Degree: 2020, University of North Texas
URL: https://digital.library.unt.edu/ark:/67531/metadc1703337/
► With the rapid development of wireless communication technology, the demands for higher communication rates are increasing. Higher communication rate corresponds to higher DoF. Interference alignment,…
(more)
▼ With the rapid development of wireless communication technology, the demands for higher communication rates are increasing. Higher communication rate corresponds to higher DoF. Interference alignment, which is an emerging interference management technique, is able to substantially increase the DoF of wireless communication systems. This thesis mainly studies the
delay-based interference alignment technique. The key problem lies in the design of the transmission scheme and the appropriate allocation of the propagation
delay, so as to achieve the desired DoF of different wireless networks. In addition, through
delay-based interference alignment, the achievability of extreme points of the DoF region of different wireless networks can be proved.
Advisors/Committee Members: Sun, Hua, Fu, Shengli, Li, Xinrong.
Subjects/Keywords: $X$ network; interference alignment; degrees of freedom; propagation delay; extreme point.
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share






University of Wollongong
17.
Brun, Jeremy Pascal.
Network aspects of playability and fairness: Improving user experience in online games.
Degree: PhD, 2012, University of Wollongong
URL: 0805
DISTRIBUTED
COMPUTING,
080503
Networking
and
Communications,
1005
COMMUNICATIONS
TECHNOLOGIES,
100503
Computer
Communications
Networks
;
https://ro.uow.edu.au/theses/3658
► Born only a few decades ago, the video game industry has now surpassed the revenue of the movie business and shows no sign of…
(more)
▼ Born only a few decades ago, the video game industry has now surpassed the revenue of the movie business and shows no sign of decline in its expansion rate. In addition to the large number of exclusively online titles operating today, most regular recent game also provide a networked multiplayer mode. Despite their success, the online experience of online games is extremely sensitive to network conditions.
Network games are realtime and highly interactive. For these reasons they are more affected by the imperfections of the telecommunication network than most other Internet applications. In particular, geographical distances introduce unavoidable delays which degrades the experience of players. This objective of this thesis is to models the impact of network imperfections on game playability and propose novel solutions to improve the quality of experience of participants in online games.
There is no consistent analysis across different game research groups on how network delays affect game users. In order to understand the impacts of network delays on game quality, we introduce a generic framework which can analyse the propagation of network disturbances in a game as a three steps process. First, measurable inconsistencies are derived from the game's network topology and synchronisation scheme. Next, we determine the violations of the ideal laws of the virtual environment generated by these inconsistencies. Finally, the perceptual impact of these violations on players is estimated using fuzzy logic utility functions.
Game quality metrics proposed in the literature either suit a particular setup or do not capture every aspects of the players' experience. Using our framework, we introduce a measurable and objective definition of network playability as the collection of all inconsistencies endured by a player. As fairness is a function of the relative playability amongst game users, we define the network unfairness of a game as the variation coefficient of the participants' playability and validate this definition in an experimental setup.
The thesis also investigates the potential to trade-off different aspects of the playability of participants through the alteration of (the) game synchronisation. We demonstrate that absolutely conservative and fully optimistic synchronisation schemes are the extremes of a continuum of possible strategies. Using a specialised game simulator, we search and find the optimum synchronisation parameters within this continuum of trade-offs. Instead of using the same synchronisation for all actions, a second improvement consists of tuning the synchronisation parameters used for different actions independently and according to the specific requirements of each action type.
After studying and proposing enhancements to the synchronisation scheme of online games, this thesis formulates an integer programming problem aiming at optimising the selection of game servers in a cloud of potential sites. We introduce the notion of critical inconsistency and…
Subjects/Keywords: delay; latency; online games; network games; synchronisation; playability; fairness
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):
Brun, J. P. (2012). Network aspects of playability and fairness: Improving user experience in online games. (Doctoral Dissertation). University of Wollongong. Retrieved from 0805 DISTRIBUTED COMPUTING, 080503 Networking and Communications, 1005 COMMUNICATIONS TECHNOLOGIES, 100503 Computer Communications Networks ; https://ro.uow.edu.au/theses/3658
Chicago Manual of Style (16th Edition):
Brun, Jeremy Pascal. “Network aspects of playability and fairness: Improving user experience in online games.” 2012. Doctoral Dissertation, University of Wollongong. Accessed March 05, 2021.
0805 DISTRIBUTED COMPUTING, 080503 Networking and Communications, 1005 COMMUNICATIONS TECHNOLOGIES, 100503 Computer Communications Networks ; https://ro.uow.edu.au/theses/3658.
MLA Handbook (7th Edition):
Brun, Jeremy Pascal. “Network aspects of playability and fairness: Improving user experience in online games.” 2012. Web. 05 Mar 2021.
Vancouver:
Brun JP. Network aspects of playability and fairness: Improving user experience in online games. [Internet] [Doctoral dissertation]. University of Wollongong; 2012. [cited 2021 Mar 05].
Available from: 0805 DISTRIBUTED COMPUTING, 080503 Networking and Communications, 1005 COMMUNICATIONS TECHNOLOGIES, 100503 Computer Communications Networks ; https://ro.uow.edu.au/theses/3658.
Council of Science Editors:
Brun JP. Network aspects of playability and fairness: Improving user experience in online games. [Doctoral Dissertation]. University of Wollongong; 2012. Available from: 0805 DISTRIBUTED COMPUTING, 080503 Networking and Communications, 1005 COMMUNICATIONS TECHNOLOGIES, 100503 Computer Communications Networks ; https://ro.uow.edu.au/theses/3658

NSYSU
18.
Kuan, Chih-yuan.
Power Enlargement and Reverse Transmission for Underwater Acoustic Sensor Networks.
Degree: Master, Electrical Engineering, 2018, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0612118-010400
► In the current underwater acoustic sensor network, the sensor is located in the deep sea and has the disadvantages of being easily damaged and difficult…
(more)
▼ In the current underwater acoustic sensor
network, the sensor is located in the deep sea and has the disadvantages of being easily damaged and difficult to replace the battery. Therefore, this paper proposes a triangular topology in the underwater acoustic sensing
network, and in this architecture, a mechanism to increase the power transmission and reverse transmission in the same direction is proposed. When the sensor transmits the packet, it encounters a situation in which the packet cannot be transmitted normally. The sensor retransmits and waits for the next node to return the packet. If reaching the retransmission upper limit value, the sensor still does not receive the returned Ack, indicating that the next node cannot work normally. At this time, the sensor will calculate the energy consumption between jump and opposite,choose the way that the energy consumption is smaller direction and transmitting the data package.We derive the mathematical formula to calculate the energy consumption and packet
delay of the jump and opposite direction transmission. We use Matlab for numerical analysis, and derived mathematical formulas. In the numerical analysis, we change the total number of nodes, the distance, and the length of packets to analyze Energy consumption and packet
delay in the underwater acoustic sensor
network.
Advisors/Committee Members: Zi-Tsan Chou (chair), Tsang-Ling Sheu (committee member), Chung-Nan Lee (chair), Ben-shung Chow (chair).
Subjects/Keywords: Underwater Acoustic Network; Jump; Opposite; Energy; Consumption; Packet Delay
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):
Kuan, C. (2018). Power Enlargement and Reverse Transmission for Underwater Acoustic Sensor Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0612118-010400
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):
Kuan, Chih-yuan. “Power Enlargement and Reverse Transmission for Underwater Acoustic Sensor Networks.” 2018. Thesis, NSYSU. Accessed March 05, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0612118-010400.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kuan, Chih-yuan. “Power Enlargement and Reverse Transmission for Underwater Acoustic Sensor Networks.” 2018. Web. 05 Mar 2021.
Vancouver:
Kuan C. Power Enlargement and Reverse Transmission for Underwater Acoustic Sensor Networks. [Internet] [Thesis]. NSYSU; 2018. [cited 2021 Mar 05].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0612118-010400.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kuan C. Power Enlargement and Reverse Transmission for Underwater Acoustic Sensor Networks. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0612118-010400
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Australian National University
19.
Yu, Mingchao.
Throughput and Delay Optimization of Linear Network Coding in Wireless Broadcast
.
Degree: 2016, Australian National University
URL: http://hdl.handle.net/1885/110677
► Linear network coding (LNC) is able to achieve the optimal throughput of packet-level wireless broadcast, where a sender wishes to broadcast a set of data…
(more)
▼ Linear network coding (LNC) is able to achieve the optimal
throughput of packet-level wireless broadcast, where a sender
wishes to broadcast a set of data packets to a set of receivers
within its transmission range through lossy wireless links. But
the price is a large delay in the recovery of individual data
packets due to network decoding, which may undermine all the
benefits of LNC. However, packet decoding delay minimization and
its relation to throughput maximization have not been well
understood in the network coding literature.
Motivated by this fact, in this thesis we present a comprehensive
study on the joint optimization of throughput and average packet
decoding delay (APDD) for LNC in wireless broadcast. To this end,
we reveal the fundamental performance limits of LNC and study the
performance of three major classes of LNC techniques, including
instantly decodable network coding (IDNC), generation-based LNC,
and throughput-optimal LNC (including random linear network
coding (RLNC)).
Various approaches are taken to accomplish the study, including
1) deriving performance bounds, 2) establishing and modelling
optimization problems, 3) studying the hardness of the
optimization problems and their approximation, 4) developing new
optimal and heuristic techniques that take into account practical
concerns such as receiver feedback frequency and computational
complexity.
Key contributions of this thesis include:
- a necessary and sufficient condition for LNC to achieve the
optimal throughput of wireless broadcast;
- the NP-hardness of APDD minimization;
- lower bounds of the expected APDD of LNC under random packet
erasures;
- the APDD-approximation ratio of throughput-optimal LNC, which
has a value of between 4/3 and 2. In particular, the ratio of
RLNC is exactly 2;
- a novel throughput-optimal, APDD-approximation, and
implementation-friendly LNC technique;
- an optimal implementation of strict IDNC that is robust to
packet erasures;
- a novel generation-based LNC technique that generalizes some of
the existing LNC techniques and enables tunable throughput-delay
tradeoffs.
Subjects/Keywords: wireless broadcast;
network coding;
throughput;
decoding delay;
combinatorial optimization;
complexity analysis
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):
Yu, M. (2016). Throughput and Delay Optimization of Linear Network Coding in Wireless Broadcast
. (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/110677
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):
Yu, Mingchao. “Throughput and Delay Optimization of Linear Network Coding in Wireless Broadcast
.” 2016. Thesis, Australian National University. Accessed March 05, 2021.
http://hdl.handle.net/1885/110677.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yu, Mingchao. “Throughput and Delay Optimization of Linear Network Coding in Wireless Broadcast
.” 2016. Web. 05 Mar 2021.
Vancouver:
Yu M. Throughput and Delay Optimization of Linear Network Coding in Wireless Broadcast
. [Internet] [Thesis]. Australian National University; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/1885/110677.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yu M. Throughput and Delay Optimization of Linear Network Coding in Wireless Broadcast
. [Thesis]. Australian National University; 2016. Available from: http://hdl.handle.net/1885/110677
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
20.
Deleskog, Viktor.
Sensor Localization Calibration of Ground Sensor Networks with Acoustic Range Measurements.
Degree: The Institute of Technology, 2012, Linköping UniversityLinköping University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81655
► Advances in the development of simple and cheap sensors give new possibilities with large sensor network deployments in monitoring and surveillance applications. Commonly, the…
(more)
▼ Advances in the development of simple and cheap sensors give new possibilities with large sensor network deployments in monitoring and surveillance applications. Commonly, the sensor positions are not known, specifically, when sensors are randomly spread in a big area. Low cost sensors are constructed with as few components as possible to keep price and energy consumption down. This implies that self-positioning and communication capabilities are low. So the question: “How do you localize such sensors with good precision with a feasible approach?” is central. When no information is available a stable and robust localization algorithm is needed. In this thesis an acoustic sensor network is considered. With a movable acoustic source a well-defined and audible signal is transmitted at different spots. The sensors measure the time of arrival which corresponds to distance. A two-step sensor localization approach is applied that utilizes the estimated distances. A novel approach in the first step is presented to incorporate more measurements and gain more position information. Localization and ranging performance is evaluated with simulations and data collected at field trials. The results show that the novel approach attains higher accuracy and robustness.
Subjects/Keywords: sensor network; calibration; sensor localization; multidimensional scaling; ranging; time delay estimation
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):
Deleskog, V. (2012). Sensor Localization Calibration of Ground Sensor Networks with Acoustic Range Measurements. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81655
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):
Deleskog, Viktor. “Sensor Localization Calibration of Ground Sensor Networks with Acoustic Range Measurements.” 2012. Thesis, Linköping UniversityLinköping University. Accessed March 05, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81655.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Deleskog, Viktor. “Sensor Localization Calibration of Ground Sensor Networks with Acoustic Range Measurements.” 2012. Web. 05 Mar 2021.
Vancouver:
Deleskog V. Sensor Localization Calibration of Ground Sensor Networks with Acoustic Range Measurements. [Internet] [Thesis]. Linköping UniversityLinköping University; 2012. [cited 2021 Mar 05].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81655.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Deleskog V. Sensor Localization Calibration of Ground Sensor Networks with Acoustic Range Measurements. [Thesis]. Linköping UniversityLinköping University; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81655
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
21.
Mehraban, Maysam.
Measuring of One-Way Delay in Wireless Mesh Networks.
Degree: 2012, , School of Computing
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4227
► Wireless mesh networks are multi-hop networks which consist of radio nodes in mesh topology. These networks can use different wireless technologies such as IEEE…
(more)
▼ Wireless mesh networks are multi-hop networks which consist of radio nodes in mesh topology. These networks can use different wireless technologies such as IEEE 802.11, IEEE 802.16, and cellular technology. In recent years, wireless Internet broadband access has become an important aspect for current and future business. Cellular networks often deliver this service with low data rates, high coverage, and expensive cost. Also other types of wireless networks suffer from lack of mobility and the line of sight in the metropolitan areas. Lately, wireless mesh networks have appeared as an alternative to mitigate these problems and provide wireless Internet broadband access with low cost, high data rates, and satisfactory QoS. Consequently the amount of studies on network performance of these networks has been rapidly increased. One-way delay, as one of the key network performance parameters, has become more important Since SLA contracts consider it to guarantee QoS levels. Moreover, accurate one-way delay measurements are difficult to achieve due to challenges in proper synchronization of clocks and existence of asymmetric links. Recently, new methods and infrastructures have been proposed to mitigate this issue. In this thesis, we have investigated the impact of packet rate, payload size, and number of hop counts on measurement accuracy of a tool named TOM. To do so, we used real one-way delay results obtained from DPMI as reference for comparison. To evaluate TOM measurement accuracy, TOM and DPMI were adapted to each other via source code modifications in order to deliver same measurable delay. Also, an experimental setup was also designed for this purpose. Additionally we computed theoretical lower band for one-way delays to evaluate reliability of DPMI and TOM. In the other part of this thesis, we analyzed the effect of TCP and UDP traffic flow on one-way delay performance with respect to data rate, packet size, and number of hop count, while network traces were captured with DPMI. From the results, we concluded that TOM does not have acceptable accuracy in low packet rates, and its accuracy increases linearly as the packet rate increase. Moreover, varying payload size does not have noticeable effect on TOM accuracy compared to packet rate. Absolute error of TOM measurements for single hop scenario is accumulated as number of passing hop increases. From TCP and UDP experiments, we observed that TCP has higher one-way delay compared to UDP due to existing acknowledgements and retransmissions. Interestingly, TCP and UDP are more sensitive to packet size in multi hop tests rather than single hop tests. Also, for a fixed packet size UDP performs better in high data rates.
Subjects/Keywords: Wireless mesh network; One-way delay; QoS; TOM; TCP; and UDP
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):
Mehraban, M. (2012). Measuring of One-Way Delay in Wireless Mesh Networks. (Thesis). , School of Computing. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4227
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):
Mehraban, Maysam. “Measuring of One-Way Delay in Wireless Mesh Networks.” 2012. Thesis, , School of Computing. Accessed March 05, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4227.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Mehraban, Maysam. “Measuring of One-Way Delay in Wireless Mesh Networks.” 2012. Web. 05 Mar 2021.
Vancouver:
Mehraban M. Measuring of One-Way Delay in Wireless Mesh Networks. [Internet] [Thesis]. , School of Computing; 2012. [cited 2021 Mar 05].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4227.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Mehraban M. Measuring of One-Way Delay in Wireless Mesh Networks. [Thesis]. , School of Computing; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4227
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University
22.
Miller, David Anton.
On delay stable communications in asynchronous networks.
Degree: 2012, Iowa State University
URL: https://lib.dr.iastate.edu/etd/12571
► This dissertation defines a frame forwarding technique offering a fixed delay to a subclass of traffic in closed industrial control networks. In these networks bandwidth…
(more)
▼ This dissertation defines a frame forwarding technique offering a fixed delay to a subclass of traffic in closed industrial control networks. In these networks bandwidth is dedicated to periodic traffic supporting tight inter-process control and control loop communication. Ideally periodic traffic arrival will have minimal delay-jitter with constant realized delays. This simplifies the implementation of connected control devices. Furthermore networks are simplified with asynchronous node and switch operation. Switch designs are simplified as there is no dependence on adjacent switch clock operation. Correct network function only relies on switches directly traversed by each flow and is not dependent on complex clock synchronization mechanisms. Existing packet scheduling schemes that attempt to minimize delay-jitter, suffer from either requiring inter-switch clock coordination (i.e. RCSP-DJ), or maintain a fixed priority so that the highest priority flows must contend without regard to past frame arrival treatment (i.e. RCSP-RJ). In this dissertation the FlexTDMA protocol is defined which supports closed network communication. FlexTDMA will be enhanced to accommodate real-world networking conditions (FlexTDMA+) and will be enhanced to support simultaneous multicast (FlexTDMA++). The FlexTDMA scheduling algorithm delivers frame data on each flow nearly at the maximal delay bound with minimal delay-jitter in an asynchronous network. Industrial control switching network systems will benefit from FlexTDMA when the complexity of system level synchronization is unacceptable, but the component switches must operate independently. FlexTDMA does not require synchronous network clock coordination and preserves the data content of frames. FlexTDMA+ includes three improvements: baseline preemption, partial baselining and baseline deadline density control, which are used to support real-world conditions of node periodic on-off transmission, clock drift, frame loss and bandwidth load. FlexTDMA++ supports simultaneous multicast under real-world conditions of switch failures, node periodic on-off transmission, clock drift, frame loss and bandwidth load.
Subjects/Keywords: Asynchronous; Delay; Jitter; Network; switch; Computer Engineering; Engineering; Industrial 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):
Miller, D. A. (2012). On delay stable communications in asynchronous networks. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/12571
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):
Miller, David Anton. “On delay stable communications in asynchronous networks.” 2012. Thesis, Iowa State University. Accessed March 05, 2021.
https://lib.dr.iastate.edu/etd/12571.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Miller, David Anton. “On delay stable communications in asynchronous networks.” 2012. Web. 05 Mar 2021.
Vancouver:
Miller DA. On delay stable communications in asynchronous networks. [Internet] [Thesis]. Iowa State University; 2012. [cited 2021 Mar 05].
Available from: https://lib.dr.iastate.edu/etd/12571.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Miller DA. On delay stable communications in asynchronous networks. [Thesis]. Iowa State University; 2012. Available from: https://lib.dr.iastate.edu/etd/12571
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech
23.
Myers, Eric Jonathan.
A Low-cost and flexible platform for global asset monitoring.
Degree: MS, Electrical and Computer Engineering, 2018, Georgia Tech
URL: http://hdl.handle.net/1853/60278
► Conventional approaches to asset monitoring involve high-priced sensors paired with a dedicated radio. These implementations work well when dealing with high-valued property but are not…
(more)
▼ Conventional approaches to asset monitoring involve high-priced sensors paired with a dedicated radio. These implementations work well when dealing with high-valued property but are not economically viable when the value of the asset approaches the cost of monitoring. Alternative low-cost connectivity solutions, such as IoT, assume the presence of an internet access point which may not be a given for remote locations. These solutions cannot accommodate locations with sparse connectivity and low-cost assets; thus, creating a communication gap. The research proposed suggests the implementation of a low-cost and intelligent sensor ecosystem which utilizes a Bluetooth based
delay-tolerant
network. The
network functions by leveraging the hardware and internet access of smart devices to bridge the gap between the cloud and devices without internet connection. The hardware for Bluetooth is low-cost and energy efficient, which is crucial for applications that would not otherwise be economically viable. By consolidating core aspects of the platform technology into a compact and flexible module, new and preexisting designs can readily incorporate
delay tolerant
network into their systems. Only specific application-based circuitry needs to be implemented externally, which can offload the burden of complex or sensitive design. These provisions can dramatically reduce development time and cost. The
network can be made more robust, by incorporating secondary
network structures, such as GSM, to work in tandem granting communication flexibility.
Advisors/Committee Members: Beyah, Raheem A. (committee member), Durgin, Gregory D. (committee member).
Subjects/Keywords: Wireless; Sensor networks; Delay tolerant network; Bluetooth low energy
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):
Myers, E. J. (2018). A Low-cost and flexible platform for global asset monitoring. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60278
Chicago Manual of Style (16th Edition):
Myers, Eric Jonathan. “A Low-cost and flexible platform for global asset monitoring.” 2018. Masters Thesis, Georgia Tech. Accessed March 05, 2021.
http://hdl.handle.net/1853/60278.
MLA Handbook (7th Edition):
Myers, Eric Jonathan. “A Low-cost and flexible platform for global asset monitoring.” 2018. Web. 05 Mar 2021.
Vancouver:
Myers EJ. A Low-cost and flexible platform for global asset monitoring. [Internet] [Masters thesis]. Georgia Tech; 2018. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/1853/60278.
Council of Science Editors:
Myers EJ. A Low-cost and flexible platform for global asset monitoring. [Masters Thesis]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60278

University of Waterloo
24.
Son, Giyeong.
Experimental Performance Evaluation of Bit-Rate Selection Algorithms in Multi-Vehicular Networks.
Degree: 2011, University of Waterloo
URL: http://hdl.handle.net/10012/5774
► IEEE 802.11 PHY supports multiple transmission rates according to multiple different modulations and coding schemes. Each WiFi station selects its own transmission rate according to…
(more)
▼ IEEE 802.11 PHY supports multiple transmission rates according to multiple different modulations and coding schemes. Each WiFi station selects its own transmission rate according to its own
algorithm; in particular, the IEEE 802.11 standards do not specify the bit-rate selection method. Although many adaptive bit-rate selection algorithms have been proposed, there is limited research
and evaluation on the performance of such algorithms for roadside networks, especially in cases with multi-vehicle roadside multi-vehicular WiFi networks.
In this thesis we propose an opportunistic highest bit-rate algorithm, Opportunistic Highest Bit-Rate Multi-Vehicular WiFi Networks (OHBR-MVN), specifically for roadside multi-vehicular WiFi networks. Our proposal is based on three key characteristics of such networks: (1) vehicles will drive closer to, and eventually pass, the roadside WiFi station, experiencing a progressively better
transmission environment; (2) the vast majority of data transmitted in single-vehicle drive-by downloading scenarios occurs at the maximum transmission rate; (3) vehicles that transmit at less than the maximum rate do so at the expense of those that could send more data at a higher
transmission rate. We therefore believe that transmitting only at the highest possible bit-rate is the preferred algorithm for such networks. Further, this approach keeps the bit-rate selection extremely simple, avoiding the complexity and resulting problems of adaptive approaches.
Through a series of experiments that compare the throughput of both fixed and adaptive bit-rate
selection algorithms we show that our approach yields both higher throughput and better fairness characteristics, while being significantly simple, and thus more robust.
Subjects/Keywords: 802.11; wireless performance; delay-tolerant network; drive-by downloading
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):
Son, G. (2011). Experimental Performance Evaluation of Bit-Rate Selection Algorithms in Multi-Vehicular Networks. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5774
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):
Son, Giyeong. “Experimental Performance Evaluation of Bit-Rate Selection Algorithms in Multi-Vehicular Networks.” 2011. Thesis, University of Waterloo. Accessed March 05, 2021.
http://hdl.handle.net/10012/5774.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Son, Giyeong. “Experimental Performance Evaluation of Bit-Rate Selection Algorithms in Multi-Vehicular Networks.” 2011. Web. 05 Mar 2021.
Vancouver:
Son G. Experimental Performance Evaluation of Bit-Rate Selection Algorithms in Multi-Vehicular Networks. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10012/5774.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Son G. Experimental Performance Evaluation of Bit-Rate Selection Algorithms in Multi-Vehicular Networks. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/5774
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo
25.
Wang, Zhen.
Clustering behaviour in networks with time delayed all-to-all coupling.
Degree: 2017, University of Waterloo
URL: http://hdl.handle.net/10012/12283
► Networks of coupled oscillators arise in a variety of areas. Clustering is a type of oscillatory network behavior where elements of a network segregate into…
(more)
▼ Networks of coupled oscillators arise in a variety of areas. Clustering is a type of oscillatory network behavior where elements of a network segregate into groups. Elements within a group oscillate synchronously, while elements in different groups oscillate with a fixed phase difference. In this thesis, we study networks of N identical oscillators with time delayed, global circulant coupling with two approaches.
We first use the theory of weakly coupled oscillators to reduce the system of delay differential equations to a phase model where the time delay enters as a phase shift. We use the phase model to determine model independent existence and stability results for symmetric cluster solutions. We show that the presence of the time delay can lead to the coexistence of multiple stable clustering solutions.
We then perform stability and bifurcation analysis to the original system of delay differential
equations with symmetry. We first study the existence of Hopf bifurcations induced by coupling time delay, and then use symmetric Hopf bifurcation theory to determine how these bifurcations lead to different patterns of symmetric cluster oscillations.
We apply our results to two specfi c examples: a network of FitzHugh-Nagumo neurons with diffusive coupling and a network of Morris-Lecar neurons with synaptic coupling. In the case studies, we show how time delays in the coupling between neurons can give rise to switching between different stable cluster solutions, coexistence of multiple stable cluster solutions and solutions with multiple frequencies.
Subjects/Keywords: neural network; time delay; symmetric cluster oscillation; stability analysis; bifurcation
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):
Wang, Z. (2017). Clustering behaviour in networks with time delayed all-to-all coupling. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12283
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):
Wang, Zhen. “Clustering behaviour in networks with time delayed all-to-all coupling.” 2017. Thesis, University of Waterloo. Accessed March 05, 2021.
http://hdl.handle.net/10012/12283.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wang, Zhen. “Clustering behaviour in networks with time delayed all-to-all coupling.” 2017. Web. 05 Mar 2021.
Vancouver:
Wang Z. Clustering behaviour in networks with time delayed all-to-all coupling. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10012/12283.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wang Z. Clustering behaviour in networks with time delayed all-to-all coupling. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12283
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech
26.
Chugh, Sarabjeet Singh.
Impact of Network Address Translation on Router Performance.
Degree: MS, Electrical and Computer Engineering, 2003, Virginia Tech
URL: http://hdl.handle.net/10919/35307
► Network Address Translation (NAT) is a method by which Internet Protocol (IP) addresses are ranslated from one group to another, in a manner transparent to…
(more)
▼ Network Address Translation (NAT) is a method by which Internet Protocol (IP) addresses are ranslated from one group to another, in a manner transparent to the end users. It translates the source and destination addresses and ports in the Internet Protocol datagram. There are several benefits for using NAT. NAT can be installed without changes to hosts or routers, it allows reuse of globally routable addresses, it facilitates easy migration or addition of new networks and it provides a method to keep private
network addresses hidden from the outside world.
NAT, however, is a processor- and memory-intensive activity for any device that implements it. This is because NAT involves reading from and writing to the header and payload information of every IP packet to do the address translation, a performance-intensive activity. It causes an increase in Central Processing Unit (CPU) and memory utilization and may impair throughput and increase the latency experienced by a packet. Thus, understanding the performance impact of NAT on a
network device (in particular, a router) becomes an important factor when implementing NAT in any live
network.
This thesis aims to understand and quantify the impact of
Network Address Translation on a
network router by doing a series of performance tests after specifying the performance parameters to measure and, then, clearly defining the performance testing methodology that is used to study each of the performance parameters. After a discussion of previous research, the measurement system and subsequent measurement results are described.
Advisors/Committee Members: DaSilva, Luiz A. (committeechair), Midkiff, Scott F. (committee member), Annamalai, Annamalai Jr. (committee member).
Subjects/Keywords: Utilization; Network; Delay; CPU; Throughput
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):
Chugh, S. S. (2003). Impact of Network Address Translation on Router Performance. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/35307
Chicago Manual of Style (16th Edition):
Chugh, Sarabjeet Singh. “Impact of Network Address Translation on Router Performance.” 2003. Masters Thesis, Virginia Tech. Accessed March 05, 2021.
http://hdl.handle.net/10919/35307.
MLA Handbook (7th Edition):
Chugh, Sarabjeet Singh. “Impact of Network Address Translation on Router Performance.” 2003. Web. 05 Mar 2021.
Vancouver:
Chugh SS. Impact of Network Address Translation on Router Performance. [Internet] [Masters thesis]. Virginia Tech; 2003. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10919/35307.
Council of Science Editors:
Chugh SS. Impact of Network Address Translation on Router Performance. [Masters Thesis]. Virginia Tech; 2003. Available from: http://hdl.handle.net/10919/35307

Virginia Tech
27.
Xu, Hao.
Safety of Self-driving Cars: A Case Study on Lane Keeping Systems.
Degree: MS, Computer Engineering, 2020, Virginia Tech
URL: http://hdl.handle.net/10919/99292
► Self-driving cars is a hot topic nowadays. Machine learning is a popular method to achieve self-driving cars. Machine learning constructs a neural network, which imitates…
(more)
▼ Self-driving cars is a hot topic nowadays. Machine learning is a popular method to achieve self-driving cars. Machine learning constructs a neural
network, which imitates a human driver's behavior to drive the car. However, a neural
network is not necessarily reliable. Many things can mislead the neural
network into making wrong decisions, such as insufficient training data or a complex driving environment. Thus, we need to guarantee the safety of self-driving cars. We are inspired to use formal language to specify the safety properties of the self-driving system. A system should always follow those specifications. Then the specifications are synthesized into an enforcer called the shield. When the system's output violates the specifications, the shield will modify the output to satisfy the specifications. Nevertheless, there is a problem with state-of-the-art research on specifications. When the specifications are synthesized into a shield, it does not consider the
delay to compute the output. As a result, the specifications may not be always satisfied during the period of the
delay. To solve such a problem, we propose a
delay-aware shielding mechanism to continually protect the self-driving system. We use a lane keeping system as a small self-driving case study. We evaluate the effectiveness of our approach both on the simulation platform and the hardware platform. The experiments show that the safety of our self-driving car is enhanced. We intend to study more comprehensive driving scenarios and safety features in the future.
Advisors/Committee Members: Zeng, Haibo (committeechair), Hsiao, Michael S. (committee member), Abbott, Amos L. (committee member).
Subjects/Keywords: Self-driving; Neural Network; Lane Detection; Specification; Enforcement; Delay; Prediction.
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):
Xu, H. (2020). Safety of Self-driving Cars: A Case Study on Lane Keeping Systems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/99292
Chicago Manual of Style (16th Edition):
Xu, Hao. “Safety of Self-driving Cars: A Case Study on Lane Keeping Systems.” 2020. Masters Thesis, Virginia Tech. Accessed March 05, 2021.
http://hdl.handle.net/10919/99292.
MLA Handbook (7th Edition):
Xu, Hao. “Safety of Self-driving Cars: A Case Study on Lane Keeping Systems.” 2020. Web. 05 Mar 2021.
Vancouver:
Xu H. Safety of Self-driving Cars: A Case Study on Lane Keeping Systems. [Internet] [Masters thesis]. Virginia Tech; 2020. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10919/99292.
Council of Science Editors:
Xu H. Safety of Self-driving Cars: A Case Study on Lane Keeping Systems. [Masters Thesis]. Virginia Tech; 2020. Available from: http://hdl.handle.net/10919/99292

University of Texas – Austin
28.
Enderle, Justin Wayne.
A routing architecture for delay tolerant networks.
Degree: MSin Engineering, Electrical and Computer Engineering, 2011, University of Texas – Austin
URL: http://hdl.handle.net/2152/ETD-UT-2011-05-3075
► As the field of Delay Tolerant Networking continues to expand and receive more attention, a new class of routing algorithms have been proposed that are…
(more)
▼ As the field of
Delay Tolerant Networking continues to expand and receive more attention, a new class of routing algorithms have been proposed that are specifically tailored to perform in a
network where no end to end paths between devices are assumed to exist. As the number of proposed routing algorithms has grown, it has become difficult to fully understand their similarities and differences. Although published results clearly show different performance results between algorithms, it can be difficult to pinpoint which of their characteristics are most responsible for their performance differences. This thesis proposes an architectural framework to define the underlying features that
Delay Tolerant
Network routing algorithms are composed of. Popular routing algorithms from research are discussed and shown to be compositions of the proposed architectural features, thereby validating the architecture itself. The architectural framework is also shown to be a useful guide to developing a modular and configurable simulation platform. Algorithms from literature were implemented as a composition of features, which can easily be modified and combined later to define and implement new algorithms. Better understanding the underlying structure and similarities between different routing algorithm approaches is key to truly analyzing their performance and obtaining a deep understanding of which components of an algorithm have the most influence, both positively and negatively, on the results. Armed with this knowledge, designers of
Delay Tolerant Networks can more easily determine the proper composition of routing algorithm features to best fit their needs.
Advisors/Committee Members: Julien, Christine, D. Sc. (advisor), Vishwanath, Sriram (committee member).
Subjects/Keywords: Delay tolerant networking; Routing architecture; Network simulation; DTN; Routing algorithms
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):
Enderle, J. W. (2011). A routing architecture for delay tolerant networks. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-05-3075
Chicago Manual of Style (16th Edition):
Enderle, Justin Wayne. “A routing architecture for delay tolerant networks.” 2011. Masters Thesis, University of Texas – Austin. Accessed March 05, 2021.
http://hdl.handle.net/2152/ETD-UT-2011-05-3075.
MLA Handbook (7th Edition):
Enderle, Justin Wayne. “A routing architecture for delay tolerant networks.” 2011. Web. 05 Mar 2021.
Vancouver:
Enderle JW. A routing architecture for delay tolerant networks. [Internet] [Masters thesis]. University of Texas – Austin; 2011. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3075.
Council of Science Editors:
Enderle JW. A routing architecture for delay tolerant networks. [Masters Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3075

The Ohio State University
29.
Zha, Xiao.
Topological Data Analysis on Road Network Data.
Degree: Master of Mathematical Sciences, Mathematical Sciences, 2019, The Ohio State University
URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu155563664988436
► Many problems in science and engineering involve signal analysis. Engineers and scientists came up with many approaches to study signals. Recently, researchers propose a new…
(more)
▼ Many problems in science and engineering involve
signal analysis. Engineers and scientists came up with many
approaches to study signals. Recently, researchers propose a new
frame- work, combining the time-
delay embedding with the tools from
computational topology, for the study of periodic signals. By
applying time-
delay embedding to the periodic signals, the periodic
behaviors express themselves as topological cycles and we can use
persistent homol- ogy to detect these topological features. In this
thesis, we apply this method to analyze road
network data,
specifically vehicle flow data recorded by detectors placed on
highways. First, we apply time-
delay embedding to project the
vehicle flow data into point cloud data in a high dimensional
space. Then, we use persistent homology tools to detect the
topological features and get persistence digram. Next, we can
repeat the same experiment to vehicle flow data of different
period. Fox example, in our experiment, we use the vehicle flow
data of different weeks and months. Therefore, we get persistence
diagrams corresponding to the vehicle flow data of different
period. Finally, we calculate the bottleneck distance and
wasserstein distance between these persistence diagrams and do
hierarchical clustering. The dendrograms of the hierarchical
clustering show us the patterns behind these vehicle flow
data.
Advisors/Committee Members: Mémoli, Facundo (Advisor), Wang , Yusu (Advisor).
Subjects/Keywords: Mathematics; TDA; road network data; time-delay embedding; persistent homology
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):
Zha, X. (2019). Topological Data Analysis on Road Network Data. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu155563664988436
Chicago Manual of Style (16th Edition):
Zha, Xiao. “Topological Data Analysis on Road Network Data.” 2019. Masters Thesis, The Ohio State University. Accessed March 05, 2021.
http://rave.ohiolink.edu/etdc/view?acc_num=osu155563664988436.
MLA Handbook (7th Edition):
Zha, Xiao. “Topological Data Analysis on Road Network Data.” 2019. Web. 05 Mar 2021.
Vancouver:
Zha X. Topological Data Analysis on Road Network Data. [Internet] [Masters thesis]. The Ohio State University; 2019. [cited 2021 Mar 05].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu155563664988436.
Council of Science Editors:
Zha X. Topological Data Analysis on Road Network Data. [Masters Thesis]. The Ohio State University; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu155563664988436
30.
Ferreira, Bruno Filipe Aguiar Durães.
Towards a network management solution for vehicular delay-tolerant networks.
Degree: 2012, RCAAP
URL: http://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3710
► Vehicular networks appeared as a new communication solution where vehicles act as a communication infrastructure, providing data communications through vehicle-to-vehicle (V2V) or vehicle-to-infrastructure (V2I) communications.…
(more)
▼ Vehicular networks appeared as a new communication solution where vehicles act as a communication infrastructure, providing data communications through vehicle-to-vehicle (V2V) or vehicle-to-infrastructure (V2I) communications. Vehicular
Delay-Tolerant Networks (VDTNs) are a new disruptive
network architecture assuming
delay tolerant networking paradigm where there are no end-to-end connectivity. In this case the incial node transmits the data to a closed node, the data will be carried by vehicles, hop to hop until the destination.
This dissertation focuses on a proposal of a
network management solution, based standard protocol Simple
Network Management Protocol (SNMP) to VDTN networks. The developed solution allows control a VDTN netowork through a
Network Management System (NMS) with the objective to detect and, if it’s possible, anticipate, possible errors on
network.
The research methodology used was the prototyping. So, it was built a
network management module to the laboratorial prototype, called
[email protected] The system built include a MIB (Management Information Base) placed in all vehicular
network nodes. The solution was built, demonstrated, validated and evaluated their performance, being ready for use.
Advisors/Committee Members: Rodrigues, Joel José Puga Coelho.
Subjects/Keywords: Delay-Tolerant Networks; Vehicular delay-tolerant networks; Monitorização de redes; Gestão de redes - Simple network managemnt protocol (SNMP)
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):
Ferreira, B. F. A. D. (2012). Towards a network management solution for vehicular delay-tolerant networks. (Thesis). RCAAP. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3710
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):
Ferreira, Bruno Filipe Aguiar Durães. “Towards a network management solution for vehicular delay-tolerant networks.” 2012. Thesis, RCAAP. Accessed March 05, 2021.
http://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3710.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Ferreira, Bruno Filipe Aguiar Durães. “Towards a network management solution for vehicular delay-tolerant networks.” 2012. Web. 05 Mar 2021.
Vancouver:
Ferreira BFAD. Towards a network management solution for vehicular delay-tolerant networks. [Internet] [Thesis]. RCAAP; 2012. [cited 2021 Mar 05].
Available from: http://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3710.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Ferreira BFAD. Towards a network management solution for vehicular delay-tolerant networks. [Thesis]. RCAAP; 2012. Available from: http://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3710
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] [6] [7] [8] ▶
.