You searched for subject:(In Network Data Aggregation).
Showing records 1 – 30 of
167938 total matches.
◁ [1] [2] [3] [4] [5] … [5598] ▶
NSYSU
1.
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 April 15, 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. 15 Apr 2021.
Vancouver:
Wei C. Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks. [Internet] [Thesis]. NSYSU; 2014. [cited 2021 Apr 15].
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
George Mason University
2.
Roy, Sankardas.
Secure Data Aggregation in Wireless Sensor Networks
.
Degree: 2008, George Mason University
URL: http://hdl.handle.net/1920/3360
► Wireless sensor networks have proved to be useful in several applications, such as environment monitoring and perimeter surveillance. In a large sensor network, in-network data…
(more)
▼ Wireless sensor networks have proved to be useful in several applications, such as environment monitoring and perimeter surveillance. In a large sensor network, in-network data
aggregation (i.e., combining partial results at intermediate nodes during message routing)
significantly reduces the amount of communication and energy consumption. Recently, the
research community has proposed a robust aggregation framework called synopsis diffusion
which combines multi-path routing schemes with duplicate-insensitive algorithms to accurately compute aggregates (e.g., Count, Sum) in spite of message losses resulting from node
and transmission failures. However, this aggregation framework does not address the problem of false sub-aggregate values contributed by compromised nodes resulting in large errors
in the aggregate computed at the base station, which is the root node in the aggregation
hierarchy. This is an important problem since sensor networks are highly vulnerable to node
compromises due to the unattended nature of sensor nodes and the lack of tamper-resistant
hardware.
In this dissertation, we make the synopsis diffusion approach secure against attacks in
which compromised nodes contribute false sub-aggregate values. In particular, we present
two classes of algorithms to securely compute Count or Sum. First, we propose a lightweight
verification algorithm which enables the base station to determine if the computed aggregate
includes any false contribution. Second, we present attack-resilient computation algorithms
which can be used to compute the true aggregate by filtering out the contributions of compromised nodes in the aggregation hierarchy. Thorough theoretical analysis and extensive
simulation study show that our algorithms outperform other existing approaches.
This dissertation also addresses the security issues of in-network computation of Median
and presents verification algorithms and attack-resilient computation algorithms to securely
compute an approximate estimate of this aggregate. To the best of our knowledge, prior to
this dissertation there was no other work related to the security of in-network computation
of Median. We evaluate the performance and cost of our algorithms via both analysis and
simulation. The results show that our approach is scalable and efficient.
Subjects/Keywords: Sensor Networks;
Data Aggregation;
Security;
In-network Aggregation
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):
Roy, S. (2008). Secure Data Aggregation in Wireless Sensor Networks
. (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/3360
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):
Roy, Sankardas. “Secure Data Aggregation in Wireless Sensor Networks
.” 2008. Thesis, George Mason University. Accessed April 15, 2021.
http://hdl.handle.net/1920/3360.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Roy, Sankardas. “Secure Data Aggregation in Wireless Sensor Networks
.” 2008. Web. 15 Apr 2021.
Vancouver:
Roy S. Secure Data Aggregation in Wireless Sensor Networks
. [Internet] [Thesis]. George Mason University; 2008. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/1920/3360.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Roy S. Secure Data Aggregation in Wireless Sensor Networks
. [Thesis]. George Mason University; 2008. Available from: http://hdl.handle.net/1920/3360
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Indian Institute of Science
3.
Shukla, Samta.
Wireless Sensor Networks : Bit Transport Maximization and Delay Efficient Function Computation.
Degree: MSc Engg, Faculty of Engineering, 2018, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/3314
► We consider a wireless sensor network, in which end users are interested in maximizing the useful information supplied by the network till network partition due…
(more)
▼ We consider a wireless sensor
network, in which end users are interested in maximizing the useful information supplied by the
network till
network partition due to inevitable node deaths. Neither throughput maximization nor
network lifetime maximization achieves the objective: A
network with high throughput provides information at a high rate, but can exhaust the nodes of their energies quickly; similarly, a
network can achieve a long lifetime by remaining idle for most of the time.
We propose and seek to maximize a new metric: “Aggregate bit transported before
network partition” (a product of throughput and lifetime), which precisely captures the usefulness of sensor networks. We model the links in the wireless sensor
network as wired links with reduced equivalent capacities, formulate and solve the problem of maximizing bits transported before
network partition on arbitrary networks.
To assess the benefits that
network coding can yield for the same objective, we study a scenario where the coding-capable nodes are placed on a regular grid. We propose an optimal algorithm to choose the minimum number of coding points in the grid to ensure energy efficiency. Our results show that, even with simple XOR coding, the bits transported can increase up to 83 % of that without coding.
Further, we study the problem of in-
network data aggregation in a wireless sensor
network to achieve minimum delay. The nodes in the
network compute and forward
data as per a query graph, which allows operations belonging to a general class of functions. We aim to extract the best sub-
network that achieves the minimum delay. We design an algorithm to schedule the sub-
network such that the computed
data reaches sink at the earliest. We consider directed acyclic query graphs as opposed to the existing work which considers tree query graphs only.
Advisors/Committee Members: Kuri, Joy (advisor).
Subjects/Keywords: Wireless Sensor Networks; Wireless Sensor Networks - Computation; Wireless Sensor Networks - Delay Minimization; Network Coding; Network Coded Bit Maximization; Arbitrary Wireless Sensor Networks; In-Network Data Aggregation; Arbitrary Wireless Network; Arbitrary Wireless Sensor Network; Wireless Sensor Networks - Bit Transport Maximization; Wireless Sensor Network; Communication 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):
Shukla, S. (2018). Wireless Sensor Networks : Bit Transport Maximization and Delay Efficient Function Computation. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3314
Chicago Manual of Style (16th Edition):
Shukla, Samta. “Wireless Sensor Networks : Bit Transport Maximization and Delay Efficient Function Computation.” 2018. Masters Thesis, Indian Institute of Science. Accessed April 15, 2021.
http://etd.iisc.ac.in/handle/2005/3314.
MLA Handbook (7th Edition):
Shukla, Samta. “Wireless Sensor Networks : Bit Transport Maximization and Delay Efficient Function Computation.” 2018. Web. 15 Apr 2021.
Vancouver:
Shukla S. Wireless Sensor Networks : Bit Transport Maximization and Delay Efficient Function Computation. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2021 Apr 15].
Available from: http://etd.iisc.ac.in/handle/2005/3314.
Council of Science Editors:
Shukla S. Wireless Sensor Networks : Bit Transport Maximization and Delay Efficient Function Computation. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3314
University of Cincinnati
4.
JHAVER, RISHI.
DISCOVERY OF LINEAR TRAJECTORIES IN GEOGRAPHICALLY
DISTRIBUTED DATASETS.
Degree: MS, Engineering : Computer Science, 2003, University of Cincinnati
URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1069437745
► We work with temporal data stored in distributed databases that are spread over a region. We have considered a sensor network where a lot of…
(more)
▼ We work with temporal
data stored in distributed
databases that are spread over a region. We have considered a
sensor
network where a lot of sensor nodes are spread in a grid
like manner. These sensor nodes are capable of storing
data and
thus act as a separate dataset. The entire
network of these sensors
act as a set of distributed datasets. An algorithm is introduced
that mines global temporal patterns from these datasets and results
in the discovery of linear trajectories of moving objects under
supervision. Each of these datasets has its local temporal dataset
along with spatial
data and the geographical coordinates of a given
object or target. The main objective here is to perform in-
network
aggregation between the
data contained in the various datasets to
discover global spatio-temporal patterns; the main constraint is
that there should be minimal communication among the participating
nodes. We present the algorithm and analyze it in terms of the
communication costs. The cost of our algorithm is much smaller than
that of the alternative in which the
data must be transferred to a
single site and then mined. In addition to this, we vary the
requirements of our algorithm slightly and present a variant of it
that enhances its performance in terms of the overall complexity of
computations. We go on to show that the while the efficiency of the
algorithm increases in terms of the number of messages exchanged
between nodes, the amount of information available to all the nodes
in the system decrease. The advantages and drawbacks of this
variant of our algorithm is also presented.
Advisors/Committee Members: Bhatnagar, Dr. Raj (Advisor).
Subjects/Keywords: Computer Science; distributed data sets; data aggregation; in-network aggregation; temporal databases; sensor data sets
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):
JHAVER, R. (2003). DISCOVERY OF LINEAR TRAJECTORIES IN GEOGRAPHICALLY
DISTRIBUTED DATASETS. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1069437745
Chicago Manual of Style (16th Edition):
JHAVER, RISHI. “DISCOVERY OF LINEAR TRAJECTORIES IN GEOGRAPHICALLY
DISTRIBUTED DATASETS.” 2003. Masters Thesis, University of Cincinnati. Accessed April 15, 2021.
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1069437745.
MLA Handbook (7th Edition):
JHAVER, RISHI. “DISCOVERY OF LINEAR TRAJECTORIES IN GEOGRAPHICALLY
DISTRIBUTED DATASETS.” 2003. Web. 15 Apr 2021.
Vancouver:
JHAVER R. DISCOVERY OF LINEAR TRAJECTORIES IN GEOGRAPHICALLY
DISTRIBUTED DATASETS. [Internet] [Masters thesis]. University of Cincinnati; 2003. [cited 2021 Apr 15].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1069437745.
Council of Science Editors:
JHAVER R. DISCOVERY OF LINEAR TRAJECTORIES IN GEOGRAPHICALLY
DISTRIBUTED DATASETS. [Masters Thesis]. University of Cincinnati; 2003. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1069437745
North Carolina State University
5.
Park, Sangjoon.
Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks.
Degree: PhD, Computer Science, 2006, North Carolina State University
URL: http://www.lib.ncsu.edu/resolver/1840.16/5744
► Wireless sensor networks are suitable for applications in which sensors detect moving targets in the area of interest. In such applications, one of the key…
(more)
▼ Wireless sensor networks are suitable for applications in which sensors detect moving targets in the area of interest. In such applications, one of the key challenges is how to design efficient
data aggregation protocols which reduce redundant packet transmissions in the sensor
network. Towards this goal, centralized, tree-based, static-cluster, and dynamic-cluster
aggregation schemes have been proposed. However, each scheme has its share of benefits and corresponding costs, and it is difficult to say with certainty whether a particular scheme is always better than others. In this paper, our goal is to compare all of the above mentioned
aggregation schemes with comprehensive theoretical analysis, simulation and real experiments and attempt to give clear scenarios where a particular scheme may be more beneficial compared to others. Along the way, we also propose two cluster-based
aggregation algorithms, which are simple enough to be implemented on resource-constrained sensor networks. As a first step towards this goal, we model the sensor
network environment under certain simplifying assumptions and then derive closed form expressions for the total number of packet transmissions incurred by each
aggregation scheme. Next, we complement the assumptions made for the analysis by performing extensive simulations under different environmental conditions, such as channel capacity (1Mbps, 250Kbbps) and MAC (B-MAC, IEEE 802.11) protocol. Finally, we test the
aggregation schemes on a real sensor
network testbed comprising of 31 Mica2 sensors. Various metrics, such as total number of packet transmissions,
aggregation ratio, average energy consumption,
network lifetime, average end-to-end delay, and packet delivery ratio, are used to evaluate the performance of
aggregation schemes.
The results show that the performance of
data aggregation is highly dependant on setup overhead, node density, sensing range, and the distance from sources to the sink. When the sources are close to the sink and the sensing range is short, tree-based
aggregation, with long
aggregation delay, achieves better performance in all metrics, except end-to-end delays. However, as the distance from sources to the sink and the sensing range increase, dynamic-cluster
aggregation shows the best performance over other schemes, because a large number of generated packets are reduced by the local
data aggregation.
Advisors/Committee Members: Injong Rhee, Committee Chair (advisor).
Subjects/Keywords: Mica2; data aggregation; sensor 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):
Park, S. (2006). Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/5744
Chicago Manual of Style (16th Edition):
Park, Sangjoon. “Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks.” 2006. Doctoral Dissertation, North Carolina State University. Accessed April 15, 2021.
http://www.lib.ncsu.edu/resolver/1840.16/5744.
MLA Handbook (7th Edition):
Park, Sangjoon. “Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks.” 2006. Web. 15 Apr 2021.
Vancouver:
Park S. Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks. [Internet] [Doctoral dissertation]. North Carolina State University; 2006. [cited 2021 Apr 15].
Available from: http://www.lib.ncsu.edu/resolver/1840.16/5744.
Council of Science Editors:
Park S. Performance Analysis of Data Aggregation Schemes for Wireless Sensor Networks. [Doctoral Dissertation]. North Carolina State University; 2006. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5744
University of New Mexico
6.
Groat, Michael.
Energy conserving privacy enhancing algorithms for resource-constrained devices.
Degree: Department of Computer Science, 2012, University of New Mexico
URL: http://hdl.handle.net/1928/22043
► Resource-constrained devices such as wireless sensor networks, body area networks, or smart phones collect confidential and sensitive information about their users. Traditional solutions to protect…
(more)
▼ Resource-constrained devices such as wireless sensor networks, body area networks, or smart phones collect confidential and sensitive information about their users. Traditional solutions to protect these
data, such as encryption, consume a significant amount of resources to be viable. In this dissertation, I present two energy efficient information collection protocols based on the notion that by relaxing the definition of privacy, such as using indistinguishability, energy use can be reduced. The first protocol, multi-dimensional negative surveys (MDNSs), protects multivariate categorical
data by perturbing sensed values to something other than what was actually sensed, and transmits the perturbed values to a central information collection server, providing privacy protection for information such as location. The second protocol, k-indistinguishable privacy-preserving
data aggregation (KIPDA), protects the privacy of
data that are aggregated in wireless sensor networks. It is specialized for the maximum and minimum
aggregation functions and is one of the first techniques to provide protection from other adversarial nodes in the
network. Sensitive
data are obfuscated by hiding them among a set of camouflage values. Because the sensitive
data are not encrypted, they can be aggregated easily and efficiently with minimal in-
network processing delay. While radio usage is expensive, I show through analysis, simulations, and implementations that broadcasting a modest amount of camouflage
data is more energy efficient when encryption is eliminated. Simulations and implementations on physical devices illustrate how both approaches can protect the privacy of a participant's
data, while reducing energy use and allowing useful aggregate information to be collected.
Advisors/Committee Members: Forrest, Stephanie, He, Wenbo, Darlington, Carlos Fernando Esponda, Lane, Terran, Saia, Jared.
Subjects/Keywords: Multidimensional Negative Surveys; Concealed Data Aggregation; Wireless Sensor Network Security
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):
Groat, M. (2012). Energy conserving privacy enhancing algorithms for resource-constrained devices. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/22043
Chicago Manual of Style (16th Edition):
Groat, Michael. “Energy conserving privacy enhancing algorithms for resource-constrained devices.” 2012. Doctoral Dissertation, University of New Mexico. Accessed April 15, 2021.
http://hdl.handle.net/1928/22043.
MLA Handbook (7th Edition):
Groat, Michael. “Energy conserving privacy enhancing algorithms for resource-constrained devices.” 2012. Web. 15 Apr 2021.
Vancouver:
Groat M. Energy conserving privacy enhancing algorithms for resource-constrained devices. [Internet] [Doctoral dissertation]. University of New Mexico; 2012. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/1928/22043.
Council of Science Editors:
Groat M. Energy conserving privacy enhancing algorithms for resource-constrained devices. [Doctoral Dissertation]. University of New Mexico; 2012. Available from: http://hdl.handle.net/1928/22043
University of Guelph
7.
Karim, Lutful.
An Integrated Framework for Wireless Sensor Network Management.
Degree: PhD, Department of Computing and Information Science, 2012, University of Guelph
URL: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3741
► Wireless Sensor Networks (WSNs) have significant potential in many application domains, and are poised for growth in many markets ranging from agriculture and animal welfare…
(more)
▼ Wireless Sensor Networks (WSNs) have significant potential in many application domains, and are poised for growth in many markets ranging from agriculture and animal welfare to home and office automation. Although sensor
network deployments have only begun to appear, the industry still awaits the maturing of this technology to realize its full benefits. The main constraints to large scale commercial adoption of sensor networks are the lack of available
network management and control tools for determining the degree of
data aggregation prior to transforming it into useful information, localizing the sensors accurately so that timely emergency actions can be taken at exact location, and scheduling
data packets so that
data are sent based on their priority and fairness. Moreover, due to the limited communication range of sensors, a large geographical area cannot be covered, which limits sensors application domain. Thus, we investigate a scalable and flexible WSN architecture that relies on multi-modal nodes equipped with IEEE 802.15.4 and IEEE 802.11 in order to use a Wi-Fi overlay as a seamless gateway to the Internet through WiMAX networks. We focus on
network management approaches such as sensors localization,
data scheduling, routing, and
data aggregation for the WSN plane of this large scale multimodal
network architecture and find that most existing approaches are not scalable, energy efficient, and fault tolerant. Thus, we introduce an efficient approach for each of localization,
data scheduling, routing, and
data aggregation; and compare the performance of proposed approaches with existing ones in terms of
network energy consumptions, localization error, end-to-end
data transmission delay and packet delivery ratio. Simulation results, theoretical and statistical analysis show that each of these approaches outperforms the existing approaches. To the best of our knowledge, no integrated
network management solution comprising efficient localization,
data scheduling, routing, and
data aggregation approaches exists in the literature for a large scale WSN. Hence, we e±ciently integrate all
network management components so that it can be used as a single
network management solution for a large scale WSN, perform experimentations to evaluate the performance of the proposed framework, and validate the results through statistical analysis. Experimental results show that our proposed framework outperforms existing approaches in terms of localization energy consumptions, localization accuracy,
network energy consumptions and end-to-end
data transmission delay.
Advisors/Committee Members: Mahmoud, Qusay H. (advisor).
Subjects/Keywords: Wireless Sensor Network; Routing Protocol; Localization; Data Aggregation; Packet Scheduling; Energy Efficiency; Large Scale
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):
Karim, L. (2012). An Integrated Framework for Wireless Sensor Network Management. (Doctoral Dissertation). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3741
Chicago Manual of Style (16th Edition):
Karim, Lutful. “An Integrated Framework for Wireless Sensor Network Management.” 2012. Doctoral Dissertation, University of Guelph. Accessed April 15, 2021.
https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3741.
MLA Handbook (7th Edition):
Karim, Lutful. “An Integrated Framework for Wireless Sensor Network Management.” 2012. Web. 15 Apr 2021.
Vancouver:
Karim L. An Integrated Framework for Wireless Sensor Network Management. [Internet] [Doctoral dissertation]. University of Guelph; 2012. [cited 2021 Apr 15].
Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3741.
Council of Science Editors:
Karim L. An Integrated Framework for Wireless Sensor Network Management. [Doctoral Dissertation]. University of Guelph; 2012. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3741
University of Miami
8.
Yessembayev, Anes.
Secure Data Aggregation for Sensor Networks in the Presence of Collusion Attack using Local Outlier Factor.
Degree: MS, Computer Science (Arts and Sciences), 2015, University of Miami
URL: https://scholarlyrepository.miami.edu/oa_theses/589
► Aggregation of data from multiple sensor nodes is usually done by simple methods such as averaging or, more sophisticated, iterative filtering methods. However, such aggregation…
(more)
▼ Aggregation of
data from multiple sensor nodes is usually done by simple methods such as averaging or, more sophisticated, iterative filtering methods. However, such
aggregation methods are highly vulnerable to malicious attacks. In this work, algorithms that remove false readings before estimating of true values are developed and evaluated. For detection of false readings local outlier factor (LOF) technique is used.
Advisors/Committee Members: Dilip Sarkar, Geoff Sutcliffe, Subramanian Ramakrishnan.
Subjects/Keywords: sensor network; outlier; lof; local outlier factor; detection of outliers; secure data aggregation
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):
Yessembayev, A. (2015). Secure Data Aggregation for Sensor Networks in the Presence of Collusion Attack using Local Outlier Factor. (Thesis). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_theses/589
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):
Yessembayev, Anes. “Secure Data Aggregation for Sensor Networks in the Presence of Collusion Attack using Local Outlier Factor.” 2015. Thesis, University of Miami. Accessed April 15, 2021.
https://scholarlyrepository.miami.edu/oa_theses/589.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yessembayev, Anes. “Secure Data Aggregation for Sensor Networks in the Presence of Collusion Attack using Local Outlier Factor.” 2015. Web. 15 Apr 2021.
Vancouver:
Yessembayev A. Secure Data Aggregation for Sensor Networks in the Presence of Collusion Attack using Local Outlier Factor. [Internet] [Thesis]. University of Miami; 2015. [cited 2021 Apr 15].
Available from: https://scholarlyrepository.miami.edu/oa_theses/589.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yessembayev A. Secure Data Aggregation for Sensor Networks in the Presence of Collusion Attack using Local Outlier Factor. [Thesis]. University of Miami; 2015. Available from: https://scholarlyrepository.miami.edu/oa_theses/589
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Kansas State University
9.
Kallumadi, Surya Teja.
Data
aggregation in sensor networks.
Degree: MS, Department of Computing and
Information Sciences, 2010, Kansas State University
URL: http://hdl.handle.net/2097/2387
► Severe energy constraints and limited computing abilities of the nodes in a network present a major challenge in the design and deployment of a wireless…
(more)
▼ Severe energy constraints and limited computing
abilities of the nodes in a
network present a major challenge in
the design and deployment of a wireless sensor
network. This thesis
aims to present energy efficient algorithms for
data fusion and
information
aggregation in a sensor
network. The various
methodologies of
data fusion presented in this thesis intend to
reduce the
data traffic within a
network by mapping the sensor
network application task graph onto a sensor
network topology.
Partitioning of an application into sub-tasks that can be mapped
onto the nodes of a sensor
network offers opportunities to reduce
the overall energy consumption of a sensor
network. The first
approach proposes a grid based coordinated incremental
data fusion
and routing with heterogeneous nodes of varied computational
abilities. In this approach high performance nodes arranged in a
mesh like structure spanning the
network topology, are present
amongst the resource constrained nodes. The sensor
network protocol
performance, measured in terms of hop-count is analysed for various
grid sizes of the high performance nodes. To reduce
network traffic
and increase the energy efficiency in a randomly deployed sensor
network, distributed clustering strategies which consider
network
density and structure similarity are applied on the
network
topology. The clustering methods aim to improve the energy
efficiency of the sensor
network by dividing the
network into
logical clusters and mapping the fusion points onto the clusters.
Routing of
network information is performed by inter-cluster and
intra-cluster routing.
Advisors/Committee Members: Gurdip Singh.
Subjects/Keywords: Sensor
Networks; In-Network
Processing; Data
Fusion; Task Graph
Mapping; Data
Aggregation;
Energy-Efficient Algorithms; Computer Science (0984)
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):
Kallumadi, S. T. (2010). Data
aggregation in sensor networks. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/2387
Chicago Manual of Style (16th Edition):
Kallumadi, Surya Teja. “Data
aggregation in sensor networks.” 2010. Masters Thesis, Kansas State University. Accessed April 15, 2021.
http://hdl.handle.net/2097/2387.
MLA Handbook (7th Edition):
Kallumadi, Surya Teja. “Data
aggregation in sensor networks.” 2010. Web. 15 Apr 2021.
Vancouver:
Kallumadi ST. Data
aggregation in sensor networks. [Internet] [Masters thesis]. Kansas State University; 2010. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/2097/2387.
Council of Science Editors:
Kallumadi ST. Data
aggregation in sensor networks. [Masters Thesis]. Kansas State University; 2010. Available from: http://hdl.handle.net/2097/2387
Georgia State University
10.
Yan, Mingyuan.
Data Aggregation Scheduling in Wireless Networks.
Degree: PhD, Computer Science, 2015, Georgia State University
URL: https://scholarworks.gsu.edu/cs_diss/100
► Data aggregation is one of the most essential data gathering operations in wireless networks. It is an efficient strategy to alleviate energy consumption and…
(more)
▼ Data aggregation is one of the most essential
data gathering operations in wireless networks. It is an efficient strategy to alleviate energy consumption and reduce medium access contention. In this dissertation, the
data aggregation scheduling problem in different wireless networks is investigated. Since Wireless Sensor Networks (WSNs) are one of the most important types of wireless networks and
data aggregation plays a vital role in WSNs, the minimum latency
data aggregation scheduling problem for multi-regional queries in WSNs is first studied. A scheduling algorithm is proposed with comprehensive theoretical and simulation analysis regarding time efficiency. Second, with the increasing popularity of Cognitive Radio Networks (CRNs),
data aggregation scheduling in CRNs is studied. Considering the precious spectrum opportunity in CRNs, a routing hierarchy, which allows a secondary user to seek a transmission opportunity among a group of receivers, is introduced. Several scheduling algorithms are proposed for both the Unit Disk Graph (UDG) interference model and the Physical Interference Model (PhIM), followed by performance evaluation through simulations. Third, the
data aggregation scheduling problem in wireless networks with cognitive radio capability is investigated. Under the defined
network model, besides a default working spectrum, users can access extra available spectrum through a cognitive radio. The problem is formalized as an Integer Linear Programming (ILP) problem and solved through an optimization method in the beginning. The simulation results show that the ILP based method has a good performance. However, it is difficult to evaluate the solution theoretically. A heuristic scheduling algorithm with guaranteed latency bound is presented in our further investigation. Finally, we investigate how to make use of cognitive radio capability to accelerate
data aggregation in probabilistic wireless networks with lossy links. A two-phase scheduling algorithm is proposed, and the effectiveness of the algorithm is verified through both theoretical analysis and numerical simulations.
Advisors/Committee Members: Dr. Yingshu Li, Dr. Zhipeng Cai, Dr. Raj Sunderraman, Dr. Anu Bourgeois, Dr. Xin Qi.
Subjects/Keywords: Data aggregation; Scheduling; Connected dominate set; Delay analysis; Wireless sensor network; Cognitive radio network; Probabilistic wireless 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):
Yan, M. (2015). Data Aggregation Scheduling in Wireless Networks. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_diss/100
Chicago Manual of Style (16th Edition):
Yan, Mingyuan. “Data Aggregation Scheduling in Wireless Networks.” 2015. Doctoral Dissertation, Georgia State University. Accessed April 15, 2021.
https://scholarworks.gsu.edu/cs_diss/100.
MLA Handbook (7th Edition):
Yan, Mingyuan. “Data Aggregation Scheduling in Wireless Networks.” 2015. Web. 15 Apr 2021.
Vancouver:
Yan M. Data Aggregation Scheduling in Wireless Networks. [Internet] [Doctoral dissertation]. Georgia State University; 2015. [cited 2021 Apr 15].
Available from: https://scholarworks.gsu.edu/cs_diss/100.
Council of Science Editors:
Yan M. Data Aggregation Scheduling in Wireless Networks. [Doctoral Dissertation]. Georgia State University; 2015. Available from: https://scholarworks.gsu.edu/cs_diss/100
University of Houston
11.
Kundooru, Shyam Sunder Reddy 1991-.
Generalized Framework for Time-Sensitive Decision Support Systems.
Degree: MS, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/1739
► The University of Houston has various monitoring systems that feed information to Emergency Operations Centers for emergency decisions. Emergency decisions must be made utilizing the…
(more)
▼ The University of Houston has various monitoring systems that feed information to Emergency Operations Centers for emergency decisions. Emergency decisions must be made utilizing the information available to Emergency Operations Center which is received from different sensors feeding the information. The information systems in the University are disparate and do not communicate with each other. These enterprise systems are independent with no integrated view. Most of the systems operate on and store the same information about the campus and people while using various models appropriate to operational needs. As the monitoring systems are not integrated with each other, it becomes difficult to estimate the level of emergency by considering the incidents identified by the individual systems.
In this Thesis, we realized a
data model design to enable an
aggregation framework in time-sensitive decision support systems. We propose a framework for aggregating the
data available through the information sources towards achieving an integrated view. The standard used for integrating the various systems is IF-MAP (Interface for Metadata Access Point) Standard. Using the Publish – Subscribe communication paradigm and aggregating the
data based on time window and location, disparate
data sources can be integrated and effective communication between the systems can be achieved, which helps in making the emergency decisions. The decision can now be based on effective utilization of all the systems involved in the particular incident.
Aggregation has been performed on various sources of information like Police Dispatch system, card access system, video feeds and general facilities system at University of Houston.
Advisors/Committee Members: Subhlok, Jaspal (advisor), Subhlok, Jaspal (committee member), Gurkan, Deniz (committee member), Chapman, Barbara M. (committee member).
Subjects/Keywords: Data Integration; Data Aggregation
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):
Kundooru, S. S. R. 1. (2015). Generalized Framework for Time-Sensitive Decision Support Systems. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1739
Chicago Manual of Style (16th Edition):
Kundooru, Shyam Sunder Reddy 1991-. “Generalized Framework for Time-Sensitive Decision Support Systems.” 2015. Masters Thesis, University of Houston. Accessed April 15, 2021.
http://hdl.handle.net/10657/1739.
MLA Handbook (7th Edition):
Kundooru, Shyam Sunder Reddy 1991-. “Generalized Framework for Time-Sensitive Decision Support Systems.” 2015. Web. 15 Apr 2021.
Vancouver:
Kundooru SSR1. Generalized Framework for Time-Sensitive Decision Support Systems. [Internet] [Masters thesis]. University of Houston; 2015. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/10657/1739.
Council of Science Editors:
Kundooru SSR1. Generalized Framework for Time-Sensitive Decision Support Systems. [Masters Thesis]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/1739
University of California – Merced
12.
Cheng, Yu.
In-situ Data Processing Over Raw File.
Degree: Electrical Engineering and Computer Science, 2016, University of California – Merced
URL: http://www.escholarship.org/uc/item/6d97234f
► Traditional databases incur a significant data-to-query delay due to the requirement to load data inside the system before querying. Since this is not acceptable in…
(more)
▼ Traditional databases incur a significant data-to-query delay due to the requirement to load data inside the system before querying. Since this is not acceptable in many domains generating massive amounts of raw data, e.g., genomics, databases are entirely discarded. External tables, on the other hand, provide instant SQL querying over raw files. Their performance across a query workload is limited though by the speed of repeated full scans, tokenizing, and parsing of the entire file.In this paper, we analyze the shortcomings of the traditional database under different configuration and propose several novel solutions to overcome these problems. We firstly propose SCANRAW, an innovate database meta-operator for in-situ processing over raw files that integrates data loading and external tables seamlessly, while preserving their advantages: optimal performance across a query workload and zero time-to-query. We decompose loading and external table processing into atomic components to identify common functionality. We analyze alternative implementations and discuss possible optimization for each stage. Our primary contribution is a parallel superscalar pipeline design that allows SCANRAW to take advantage of the current many- and multi-core processors by overlapping the execution of independent stages. Moreover, SCANRAW overlaps query processing with loading by speculatively using the additional I/O bandwidth arising during the conversion process for storing data in the database, such that subsequent queries execute faster. As a result, SCANRAW makes optimal use of the available system resources – CPU cycles and I/O bandwidth – by switching dynamically between tasks to achieve optimal performance. We implement SCANRAW in a state-of-the-art database system and evaluate its performance across a variety of synthetic and real-world datasets. Our results show that SCANRAW with speculative loading achieves optimal performance for a query sequence at any point in the processing. Moreover, SCANRAW maximizes resource utilization for the entire workload execution, while speculatively loading data, and without interfering with normal query processing.Besides, incorporate query workload in raw data processing allows us to model raw data processing with partial loading as fully-replicated binary vertical partitioning. We model loading as binary vertical partitioning with full replication. We design a two-stage heuristic that combines the concepts of query coverage and attribute usage frequency. The heuristic comes within close range of the optimal solution in a fraction of the time. We extend the optimization formulation and the heuristic to a restricted type of pipeline raw data processing. The results confirm the superior performance of the proposed heuristic over related vertical partitioning algorithms and the accuracy of the formulation in capturing the execution details of a real operator.Online aggregation (OLA) is an efficient method for data exploration that identifies uninteresting patterns faster by continuously estimating…
Subjects/Keywords: Computer science; database system; In-situ data process; online aggregation; query optimization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cheng, Y. (2016). In-situ Data Processing Over Raw File. (Thesis). University of California – Merced. Retrieved from http://www.escholarship.org/uc/item/6d97234f
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):
Cheng, Yu. “In-situ Data Processing Over Raw File.” 2016. Thesis, University of California – Merced. Accessed April 15, 2021.
http://www.escholarship.org/uc/item/6d97234f.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Cheng, Yu. “In-situ Data Processing Over Raw File.” 2016. Web. 15 Apr 2021.
Vancouver:
Cheng Y. In-situ Data Processing Over Raw File. [Internet] [Thesis]. University of California – Merced; 2016. [cited 2021 Apr 15].
Available from: http://www.escholarship.org/uc/item/6d97234f.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Cheng Y. In-situ Data Processing Over Raw File. [Thesis]. University of California – Merced; 2016. Available from: http://www.escholarship.org/uc/item/6d97234f
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Southern California
13.
Yoon, SunHee.
Efficient and accurate in-network processing for monitoring
applications in wireless sensor networks.
Degree: PhD, Computer Science, 2008, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/92479/rec/2242
► In-network processing has long been considered a fundamental mechanism to improve energy efficiency in various monitoring applications in wireless sensor networks. This thesis proposes in-network…
(more)
▼ In-
network processing has long been considered a
fundamental mechanism to improve energy efficiency in various
monitoring applications in wireless sensor networks. This thesis
proposes in-
network processing algorithms which leverage the
spatial and temporal correlations in sensor
data and the geometric
properties in the
network topologies to enable monitoring
applications to efficiently produce accurate results. We
demonstrate this by designing and implementing three
application-specific in-
network processing techniques.; First, we
investigate the efficient and approximate in-
network aggregation
algorithm called Clustered
AGgregation (CAG) for environmental
monitoring. CAG reduces the number of transmissions by leveraging
both spatial and temporal correlations of sensor
data to perform
in-
network aggregation. The CAG algorithm forms clusters with
sensor nodes sensing similar values by exploiting spatial
correlation of sensor readings, and efficiently adjust those
clusters over time under the
data or
network dynamics. CAG is a
novel algorithm in that it provides approximate results with
bounded error performing in-
network aggregation.; Second, we design
autonomous detection, identification, and localization algorithms
which reduce false alarms in applications that monitor steam and
water pipeline in oilfields. We formulate detection and
identification problems in oilfield as a decision making problem
based on information with uncertain errors and build a decision
tree to capture the salient pressure and flow characteristics of
each problem and distinguish them from false alarms. The proposed
Steam and WAter Tracking System (SWATS) utilizes multi-modal
sensing and multi-sensor collaboration and exploits spatial and
temporal patterns of the sensed phenomena.; Third, we introduce
spatial skyline operation to wireless sensor networks and suggest
potential applications which can benefit from this operation.
Subsequently, we design and implement three flavors of Distributed
Spatial Skyline (DSS) algorithms in wireless sensor networks based
on different partitioning strategies: 1) TDSS: Triangulation-based
DSS, 2) RDSS: Rendezvous-based DSS, and 3) TRDSS: Triangulation and
Rendezvous-based DSS. Our algorithms utilize geometric properties
in two layers of the protocol stack: 1) geographic routing
techniques such as GPSR, GHT-based routing, and Voronoi-based
geographic flooding in the routing layer, and 2) geometric notions
such as convex hull and Voronoi diagram to compute spatial skyline
in the application layer. The proposed DSS algorithms are novel in
that they provide accurate and progressive spatial skyline results
with modest delay while performing in-
network processing
efficiently.
Advisors/Committee Members: Shahabi, Cyrus (Committee Chair), Govindan, Ramesh (Committee Member), Krishnamachari, Bhaskar (Committee Member).
Subjects/Keywords: in-network aggregation; data correlation; oilfield monitoring; steam and waterflood monitoring; spatial skyline; distributed 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):
Yoon, S. (2008). Efficient and accurate in-network processing for monitoring
applications in wireless sensor networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/92479/rec/2242
Chicago Manual of Style (16th Edition):
Yoon, SunHee. “Efficient and accurate in-network processing for monitoring
applications in wireless sensor networks.” 2008. Doctoral Dissertation, University of Southern California. Accessed April 15, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/92479/rec/2242.
MLA Handbook (7th Edition):
Yoon, SunHee. “Efficient and accurate in-network processing for monitoring
applications in wireless sensor networks.” 2008. Web. 15 Apr 2021.
Vancouver:
Yoon S. Efficient and accurate in-network processing for monitoring
applications in wireless sensor networks. [Internet] [Doctoral dissertation]. University of Southern California; 2008. [cited 2021 Apr 15].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/92479/rec/2242.
Council of Science Editors:
Yoon S. Efficient and accurate in-network processing for monitoring
applications in wireless sensor networks. [Doctoral Dissertation]. University of Southern California; 2008. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/92479/rec/2242
Brno University of Technology
14.
Důbrava, Marek.
Řízení datového toku v ISP síti: Data flow control in ISP network.
Degree: 2019, Brno University of Technology
URL: http://hdl.handle.net/11012/59825
► The thesis focuses on the control of data flow in networks of Internet service providers. The problem of aggregation and related overload network elements are…
(more)
▼ The thesis focuses on the control of
data flow in networks of Internet service providers. The problem of
aggregation and related overload
network elements are shown. Theoretical section describes the standardized methods for managing
data flow. The parameters associated with managing
data flow are described for devices selected devices. The thesis displays measurements depicting to which extent the ECN algorithm occurs in practice. In the thesis is theoretically described HTB program, which is complemented by a newly described algorithm. The new algorithm is implemented into the program and tested on a real
network ISP.
Advisors/Committee Members: Koton, Jaroslav (advisor), Jeřábek, Jan (referee).
Subjects/Keywords: ISP; zahlcení sítě; řízení datového toku; agregace; ECN; HTB; ISP; network congestion; data flow control; aggregation; ECN; HTB
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):
Důbrava, M. (2019). Řízení datového toku v ISP síti: Data flow control in ISP network. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/59825
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):
Důbrava, Marek. “Řízení datového toku v ISP síti: Data flow control in ISP network.” 2019. Thesis, Brno University of Technology. Accessed April 15, 2021.
http://hdl.handle.net/11012/59825.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Důbrava, Marek. “Řízení datového toku v ISP síti: Data flow control in ISP network.” 2019. Web. 15 Apr 2021.
Vancouver:
Důbrava M. Řízení datového toku v ISP síti: Data flow control in ISP network. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/11012/59825.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Důbrava M. Řízení datového toku v ISP síti: Data flow control in ISP network. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/59825
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
15.
Jovilyn Therese Baco Fajardo.
Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ.
Degree: 博士(工学), Nara Institute of Science and Technology / 奈良先端科学技術大学院大学
URL: http://hdl.handle.net/10061/9241
Subjects/Keywords: data aggregation
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):
Fajardo, J. T. B. (n.d.). Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/9241
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Fajardo, Jovilyn Therese Baco. “Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed April 15, 2021.
http://hdl.handle.net/10061/9241.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Fajardo, Jovilyn Therese Baco. “Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ.” Web. 15 Apr 2021.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Vancouver:
Fajardo JTB. Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2021 Apr 15].
Available from: http://hdl.handle.net/10061/9241.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.
Council of Science Editors:
Fajardo JTB. Information Collection in Disaster Areas Using Participatory Sensing and Delay Tolerant Network : 参加型センシングとDTNを用いた災害地での情報収集; サンカガタ センシング ト DTN オ モチイタ サイガイチ デノ ジョウホウ シュウシュウ. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/9241
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.
University of Pretoria
16.
[No author].
A cross-layer approach for optimizing the efficiency of
wireless sensor and actor networks
.
Degree: 2009, University of Pretoria
URL: http://upetd.up.ac.za/thesis/available/etd-06252009-124552/
► Recent development has lead to the emergence of distributed Wireless Sensor and Actor Networks (WSAN), which are capable of observing the physical environment, processing the…
(more)
▼ Recent development has lead to the emergence of
distributed Wireless Sensor and Actor Networks (WSAN), which are
capable of observing the physical environment, processing the
data,
making decisions based on the observations and performing
appropriate actions. WSANs represent an important extension of
Wireless Sensor Networks (WSNs) and may comprise a large number of
sensor nodes and a smaller number of actor nodes. The sensor nodes
are low-cost, low energy, battery powered devices with restricted
sensing, computational and wireless communication capabilities.
Actor nodes are resource richer with superior processing
capabilities, higher transmission powers and a longer battery life.
A basic operational scenario of a typical WSAN application follows
the following sequence of events. The physical environment is
periodically sensed and evaluated by the sensor nodes. The sensed
data is then routed towards an actor node. Upon receiving sensed
data, an actor node performs an action upon the physical
environment if necessary, i.e. if the occurrence of a disturbance
or critical event has been detected. The specific characteristics
of sensor and actor nodes combined with some stringent application
constraints impose unique requirements for WSANs. The fundamental
challenges for WSANs are to achieve low latency, high energy
efficiency and high reliability. The latency and energy efficiency
requirements are in a trade-off relationship. The communication and
coordination inside WSANs is managed via a Communication Protocol
Stack (CPS) situated on every node. The requirements of low latency
and energy efficiency have to be addressed at every layer of the
CPS to ensure overall feasibility of the WSAN. Therefore, careful
design of protocol layers in the CPS is crucial in attempting to
meet the unique requirements and handle the abovementioned
trade-off relationship in WSANs. The traditional CPS, comprising
the application,
network, medium access control and physical layer,
is a layered protocol stack with every layer, a predefined
functional entity. However, it has been found that for similar
types of networks with similar stringent
network requirements, the
strictly layered protocol stack approach performs at a sub-optimal
level with regards to
network efficiency. A modern cross-layer
paradigm, which proposes the employment of interactions between
layers in the CPS, has recently attracted a lot of attention. The
cross-layer approach promotes
network efficiency optimization and
promises considerable performance gains. It is found that in
literature, the adoption of this cross-layer paradigm has not yet
been considered for WSANs. In this dissertation, a complete
cross-layer enabled WSAN CPS is developed that features the
adoption of the cross-layer paradigm towards promoting optimization
of the
network efficiency. The newly proposed cross-layer enabled
CPS entails protocols that incorporate information from other
layers into their local decisions. Every protocol layer provides
information identified as beneficial to another layer(s)…
Advisors/Committee Members: Prof G P Hancke (advisor).
Subjects/Keywords: Cross-layering;
Wireless sensor actor network;
Cross-layer framework;
Latency;
Preamble sampling;
Energy efficient;
Medium access control;
Data prioritization;
Aggregation;
Hierarchical routing;
Clustering;
Distributed control;
Network centric;
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):
author], [. (2009). A cross-layer approach for optimizing the efficiency of
wireless sensor and actor networks
. (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-06252009-124552/
Chicago Manual of Style (16th Edition):
author], [No. “A cross-layer approach for optimizing the efficiency of
wireless sensor and actor networks
.” 2009. Masters Thesis, University of Pretoria. Accessed April 15, 2021.
http://upetd.up.ac.za/thesis/available/etd-06252009-124552/.
MLA Handbook (7th Edition):
author], [No. “A cross-layer approach for optimizing the efficiency of
wireless sensor and actor networks
.” 2009. Web. 15 Apr 2021.
Vancouver:
author] [. A cross-layer approach for optimizing the efficiency of
wireless sensor and actor networks
. [Internet] [Masters thesis]. University of Pretoria; 2009. [cited 2021 Apr 15].
Available from: http://upetd.up.ac.za/thesis/available/etd-06252009-124552/.
Council of Science Editors:
author] [. A cross-layer approach for optimizing the efficiency of
wireless sensor and actor networks
. [Masters Thesis]. University of Pretoria; 2009. Available from: http://upetd.up.ac.za/thesis/available/etd-06252009-124552/
University of Pretoria
17.
Kohlmeyer, Eckhard
Bernhard.
A cross-layer
approach for optimizing the efficiency of wireless sensor and actor
networks.
Degree: Electrical, Electronic and
Computer Engineering, 2009, University of Pretoria
URL: http://hdl.handle.net/2263/25831
► Recent development has lead to the emergence of distributed Wireless Sensor and Actor Networks (WSAN), which are capable of observing the physical environment, processing the…
(more)
▼ Recent development has lead to the emergence of
distributed Wireless Sensor and Actor Networks (WSAN), which are
capable of observing the physical environment, processing the
data,
making decisions based on the observations and performing
appropriate actions. WSANs represent an important extension of
Wireless Sensor Networks (WSNs) and may comprise a large number of
sensor nodes and a smaller number of actor nodes. The sensor nodes
are low-cost, low energy, battery powered devices with restricted
sensing, computational and wireless communication capabilities.
Actor nodes are resource richer with superior processing
capabilities, higher transmission powers and a longer battery life.
A basic operational scenario of a typical WSAN application follows
the following sequence of events. The physical environment is
periodically sensed and evaluated by the sensor nodes. The sensed
data is then routed towards an actor node. Upon receiving sensed
data, an actor node performs an action upon the physical
environment if necessary, i.e. if the occurrence of a disturbance
or critical event has been detected. The specific characteristics
of sensor and actor nodes combined with some stringent application
constraints impose unique requirements for WSANs. The fundamental
challenges for WSANs are to achieve low latency, high energy
efficiency and high reliability. The latency and energy efficiency
requirements are in a trade-off relationship. The communication and
coordination inside WSANs is managed via a Communication Protocol
Stack (CPS) situated on every node. The requirements of low latency
and energy efficiency have to be addressed at every layer of the
CPS to ensure overall feasibility of the WSAN. Therefore, careful
design of protocol layers in the CPS is crucial in attempting to
meet the unique requirements and handle the abovementioned
trade-off relationship in WSANs. The traditional CPS, comprising
the application,
network, medium access control and physical layer,
is a layered protocol stack with every layer, a predefined
functional entity. However, it has been found that for similar
types of networks with similar stringent
network requirements, the
strictly layered protocol stack approach performs at a sub-optimal
level with regards to
network efficiency. A modern cross-layer
paradigm, which proposes the employment of interactions between
layers in the CPS, has recently attracted a lot of attention. The
cross-layer approach promotes
network efficiency optimization and
promises considerable performance gains. It is found that in
literature, the adoption of this cross-layer paradigm has not yet
been considered for WSANs. In this dissertation, a complete
cross-layer enabled WSAN CPS is developed that features the
adoption of the cross-layer paradigm towards promoting optimization
of the
network efficiency. The newly proposed cross-layer enabled
CPS entails protocols that incorporate information from other
layers into their local decisions. Every protocol layer provides
information identified as beneficial to another layer(s)…
Advisors/Committee Members: Prof G P Hancke (advisor).
Subjects/Keywords: Cross-layering; Wireless
sensor actor network; Cross-layer
framework;
Latency; Preamble
sampling; Energy
efficient; Medium access
control; Data
prioritization;
Aggregation; Hierarchical
routing;
Clustering; Distributed
control; Network
centric;
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):
Kohlmeyer, E. (2009). A cross-layer
approach for optimizing the efficiency of wireless sensor and actor
networks. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/25831
Chicago Manual of Style (16th Edition):
Kohlmeyer, Eckhard. “A cross-layer
approach for optimizing the efficiency of wireless sensor and actor
networks.” 2009. Masters Thesis, University of Pretoria. Accessed April 15, 2021.
http://hdl.handle.net/2263/25831.
MLA Handbook (7th Edition):
Kohlmeyer, Eckhard. “A cross-layer
approach for optimizing the efficiency of wireless sensor and actor
networks.” 2009. Web. 15 Apr 2021.
Vancouver:
Kohlmeyer E. A cross-layer
approach for optimizing the efficiency of wireless sensor and actor
networks. [Internet] [Masters thesis]. University of Pretoria; 2009. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/2263/25831.
Council of Science Editors:
Kohlmeyer E. A cross-layer
approach for optimizing the efficiency of wireless sensor and actor
networks. [Masters Thesis]. University of Pretoria; 2009. Available from: http://hdl.handle.net/2263/25831
18.
IOANNOU, ANDRIANA.
Enhancing Network Performance and Consumer Experience in Named Data Networking (NDN).
Degree: School of Computer Science & Statistics. Discipline of Computer Science, 2020, Trinity College Dublin
URL: http://hdl.handle.net/2262/92967
► Named Data Networking (NDN) is an Information-Centric Networking (ICN) architecture proposed as an alternative to the current Internet infrastructure. Using the publish-subscribe paradigm and a…
(more)
▼ Named
Data Networking (NDN) is an Information-Centric Networking (ICN) architecture proposed as an alternative to the current Internet infrastructure. Using the publish-subscribe paradigm and a standardised naming scheme, ICN allows the components of a publish-subscribe solution to interact without tight coupling between them.
NDN supports a hierarchical naming scheme that identifies chunks of an object resource such as a service, web page, file, etc., using a content identifier. Content identifiers should be location-free and all identical contents should share the same content identifier. This way, content can be freely distributed and cached within the infrastructure utilising the capacity of routers on the path from a source to a destination, called on-path caching. A hierarchical naming scheme may also enable the functionality of request
aggregation at routers. The purpose of this mechanism is to aggregate close-in-time requests for the same content and to propagate only the first of them to a content source(s).
This thesis focuses on the exploration of the on-path caching feature and the request
aggregation mechanism of NDN to enhance the
network performance and the consumer experience within an Internet Service Provider (ISP)/Autonomous System (AS)
network by reducing the intra and inter-
network traffic and the content delivery times of consumers. By reducing the intra and inter-
network traffic of an ISP/AS
network, a reduction of the content delivery times of consumers is also expected.
Popularity and Location-based Caching (PLbC) is a lightweight caching algorithm that utilises the criterion of content popularity and the criterion of the location of routers on delivery paths by incorporating them into the caching decision process to construct a probability. PLbC has been shown to outperform the caching policy proven to perform the best among a number of caching policies evaluated in this thesis, i.e. PC+. PLbC has been shown to yield a 3-6% higher probability of retrieving the content locally from the caches of routers compared to PC+, while caching 11-15% less content within the local ISP/AS
network. Yet, PLbC is unable to fully utilise the cache capacity of routers as this approaches the catalog size, i.e. the number of object resources within a
network.
Content Sharing-Extended Request
Aggregation (CS-ERA) is a mechanism that focuses on content sharing between consumers that request to retrieve the same object resource. For this purpose, CS-ERA exploits the mechanism of request
aggregation to bound successive requests to be satisfied within the boundaries of the local ISP/AS
network, if a local replica exists. To increase the number of successive requests to be bounded, CS-ERA extends the naming granularity to which request
aggregation is ap- plied from a chunk to an object resource. CS-ERA has been shown to outperform the original request
aggregation mechanism by aggregating 11-17% more object requests within an ISP/AS
network, while satisfying 52-81% more chunks of an object resource locally. The…
Advisors/Committee Members: Weber, Stefan.
Subjects/Keywords: Named Data Networking (NDN); Information Centric Networking (ICN); On-path Caching; Request Aggregation; Network Performance; Consumer Experience; Intra and Inter-network Traffic; Content Delivery Times; Taxonomy; Quantitative Comparison
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):
IOANNOU, A. (2020). Enhancing Network Performance and Consumer Experience in Named Data Networking (NDN). (Thesis). Trinity College Dublin. Retrieved from http://hdl.handle.net/2262/92967
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):
IOANNOU, ANDRIANA. “Enhancing Network Performance and Consumer Experience in Named Data Networking (NDN).” 2020. Thesis, Trinity College Dublin. Accessed April 15, 2021.
http://hdl.handle.net/2262/92967.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
IOANNOU, ANDRIANA. “Enhancing Network Performance and Consumer Experience in Named Data Networking (NDN).” 2020. Web. 15 Apr 2021.
Vancouver:
IOANNOU A. Enhancing Network Performance and Consumer Experience in Named Data Networking (NDN). [Internet] [Thesis]. Trinity College Dublin; 2020. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/2262/92967.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
IOANNOU A. Enhancing Network Performance and Consumer Experience in Named Data Networking (NDN). [Thesis]. Trinity College Dublin; 2020. Available from: http://hdl.handle.net/2262/92967
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
19.
Kiepert, Joshua C.
WSNFS: A Distributed Data Sharing System for In-Network Processing.
Degree: 2014, Boise State University
URL: https://scholarworks.boisestate.edu/td/807
► Wireless sensor networks (WSNs) have emerged as versatile platforms for a wide range of scientific data acquisition applications. Wireless sensor network systems are used in…
(more)
▼ Wireless sensor networks (WSNs) have emerged as versatile platforms for a wide range of scientific data acquisition applications. Wireless sensor network systems are used in many applications including: surveillance, environmental monitoring, target tracking, wildlife tracking, personal health monitoring, machinery monitoring, and many others. Current research efforts in WSN system designs are moving toward approaches that enable direct in-network processing of acquired sensor data to avoid the high energy costs associated with the bulk transmission of data to outside systems for processing. Implementation of collaborative in-network processing algorithms is a non-trivial issue for WSN system development. Design complexity for in-network processing algorithms is compounded by the fact that there are few frameworks available to enable general purpose, energy-aware, data sharing within WSN environments. This dissertation presents a novel WSN communications and data sharing framework called WSNFS (Wireless Sensor Network File System), which is designed to enable general purpose collaborative in-network sensor data processing. WSNFS presents a common symbolic distributed file system that provides virtual views that uniquely display sensor data, node characteristics, and network topology to each sensor node in the network. These features significantly simplify the development and implementation of in-network collaborative processing algorithms in WSNs.
Subjects/Keywords: Wireless sensor networks; WSN; in-network processing; data aggregation; distributed file system; collaborative processing; Digital Communications and Networking
…Continuous Data Aggregation with WSNFS . . . . . . . . . . . . . . . 169
6.3.3
In-Network… …natural application of data aggregation
algorithms such as min, max, avg, etc. In-network query… …directories per node in a WSNFS network system
CN
Average number of WSNFS data view categories for… …categories in a WSNFS network data view during in-network
processing
hCC
Number of hop categories… …in a WSNFS network data view for nC nodes during
in-network processing
cC (u)
The…
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):
Kiepert, J. C. (2014). WSNFS: A Distributed Data Sharing System for In-Network Processing. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/807
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):
Kiepert, Joshua C. “WSNFS: A Distributed Data Sharing System for In-Network Processing.” 2014. Thesis, Boise State University. Accessed April 15, 2021.
https://scholarworks.boisestate.edu/td/807.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kiepert, Joshua C. “WSNFS: A Distributed Data Sharing System for In-Network Processing.” 2014. Web. 15 Apr 2021.
Vancouver:
Kiepert JC. WSNFS: A Distributed Data Sharing System for In-Network Processing. [Internet] [Thesis]. Boise State University; 2014. [cited 2021 Apr 15].
Available from: https://scholarworks.boisestate.edu/td/807.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kiepert JC. WSNFS: A Distributed Data Sharing System for In-Network Processing. [Thesis]. Boise State University; 2014. Available from: https://scholarworks.boisestate.edu/td/807
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
NSYSU
20.
Chen, Chien-Lung.
Adaptive Linked-List Routing Algorithm with Wormhole Mechanism.
Degree: Master, Electrical Engineering, 2015, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724115-101923
► Due to Low-Rate Wireless Personal Area Networks(LR-WPANs) is universally used in Internet of Things(IOT) in recent years, Chiu and Wang proposed a linked list routing…
(more)
▼ Due to Low-Rate Wireless Personal Area Networks(LR-WPANs) is universally used in Internet of Things(IOT) in recent years, Chiu and Wang proposed a linked list routing algorithm with wormhole mechanism. The algorithm includes the manner of construction linked list
network,
data jumping for routing broken, a new node join mechanism, the manner of construction wormhole
network and aim at the modbus protocol as application layer, set up suitable Modbus extension instructions for
data collection. Itâs an algorithm for IOT
data collection. However, there are still a lot of non-adaptive in algorithm. First, on
network initialization problem, because exchange address information packet with offline nodes and interrupt nodes which are exchanging address information, nodes must turn on respectively to finish construction
network. When numerous nodes existing in
network, the algorithm without nodes turn on simultaneously mechanism is non-adaptive. Second, the problem on continuous nodes broken, chain scission nodes will broadcast ask and join packet randomly for adding back to the
network. The broadcast storm will be occurred and interference the nodes which are still working on
network leads to the collapse of the entire
network. Third, on node outliers problem, node exits without stabling routing first will cause
data packets loss. Finally is packet processing problem, without planning a complete resend packet queue and establishing packet processing flag, will cause resend packet extracting error and packet race condition.
In this paper, we proposed an adaptive linked-list routing algorithm with wormhole mechanism. Included implementation the manner of turn on nodes simultaneously with Lock-address mechanism. Let the initialization of the routing more adaptive in a large number of nodes environment. Then the algorithm proposed the stable chain scission, reset sequentially and cutting timer mechanism for broken nodes determination. So that chain scission nodes can stable routing first then brocast join packet sequentially when continuous nodes broken occurred to avoid broadcast storm and linked error happen. Third we proposed the node outliers mechanism. Nodes will follow the node outliers mechanism to stable routing first, and then executing reset when node in sensoring
data abnormally for a long time to avoid
data packets loss. Finally, the algorithm planned a complete resend packet queue and established packet processing flag to solve resend packet extracting error and packet race condition.
In simulation, the performance of
network initialization of adaptive linked-list routing algorithm with wormhole mechanism and flooding is compared and simulated by NS3 in this paper. The simulations results reveal that the initialization of adaptive linked-list routing algorithm with wormhole mechanism is more efficient than flooding when nodes are 5 meters apart and a matrix model of nodes number from 7*7 to 15*15. In the future, we expect that adaptive linked-list routing algorithm with wormhole mechanism not only implement in…
Advisors/Committee Members: Jih-Ching Chiu (committee member), Zi-Tsan Chou (chair), Tong-Yu Hsieh (chair), Shiann-Rong Kuang (chair).
Subjects/Keywords: LR-WPANs; Linked list network; data collecting; turn on nodes simultaneously in construction network; Wormhole
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):
Chen, C. (2015). Adaptive Linked-List Routing Algorithm with Wormhole Mechanism. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724115-101923
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):
Chen, Chien-Lung. “Adaptive Linked-List Routing Algorithm with Wormhole Mechanism.” 2015. Thesis, NSYSU. Accessed April 15, 2021.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724115-101923.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chen, Chien-Lung. “Adaptive Linked-List Routing Algorithm with Wormhole Mechanism.” 2015. Web. 15 Apr 2021.
Vancouver:
Chen C. Adaptive Linked-List Routing Algorithm with Wormhole Mechanism. [Internet] [Thesis]. NSYSU; 2015. [cited 2021 Apr 15].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724115-101923.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chen C. Adaptive Linked-List Routing Algorithm with Wormhole Mechanism. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724115-101923
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
21.
kakani, phani priya.
Data Aggregation and Gathering Transmission in Wireless Sensor Networks: A Survey.
Degree: Computer and Electrical Engineering, 2013, Jönköping University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-23667
► Wireless sensor networks have many sensor devices that send their data to the sink or base station for further processing. This is called direct…
(more)
▼ Wireless sensor networks have many sensor devices that send their data to the sink or base station for further processing. This is called direct delivery. But this leads to heavy traffic in the network and as the nodes are limited with energy, this decreases the lifetime of the network. So data aggregation technique is introduced to improve the lifetime. This technique aggregates or merges the multiple incoming packets in to single packet and forwards it to sink. There is different data aggregation techniques based on the topology of the network. This report clearly explains the purpose of data aggregation and gathering in WSN, data aggregation in flat networks and data aggregation in hierarchical networks, different data aggregation techniques in cluster based networks, chain based, tree based and grid based networks. Data aggregation technique can successfully minimize the data traffic and energy consumption only when it is carried out in a secure manner. Part2 of the survey explains the possible attacks that affect data aggregation in wireless sensor network. The secure data aggregation techniques in wireless sensor networks are also discussed in this report.
Subjects/Keywords: Data aggregation in hierarchical networks; Secure data aggregation; Purpose of data aggregation and gathering in wireless sensor networks
…transfer the data from one sensor node to another.
In-network aggregation is one of the important… …been carried out to further extent
network lifetime.
2.3. Data Aggregation in Wireless… …data centric routing [22]. In data aggregation the sensor network is
generally… …being discussed based on the network topology. In this topology, the data aggregation… …23
3. Survey1: In-network Data
Aggregation
3.1. Overview
This section gives a clear idea…
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):
kakani, p. p. (2013). Data Aggregation and Gathering Transmission in Wireless Sensor Networks: A Survey. (Thesis). Jönköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-23667
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):
kakani, phani priya. “Data Aggregation and Gathering Transmission in Wireless Sensor Networks: A Survey.” 2013. Thesis, Jönköping University. Accessed April 15, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-23667.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
kakani, phani priya. “Data Aggregation and Gathering Transmission in Wireless Sensor Networks: A Survey.” 2013. Web. 15 Apr 2021.
Vancouver:
kakani pp. Data Aggregation and Gathering Transmission in Wireless Sensor Networks: A Survey. [Internet] [Thesis]. Jönköping University; 2013. [cited 2021 Apr 15].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-23667.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
kakani pp. Data Aggregation and Gathering Transmission in Wireless Sensor Networks: A Survey. [Thesis]. Jönköping University; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-23667
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
22.
Smith, Brandon.
Aggregated Reverse Time Transfer.
Degree: MS, 2020, University of New Hampshire
URL: https://scholars.unh.edu/thesis/1354
► Monitoring mechanisms are a critical component of the security and maintenance of high precision timing networks. Any and all guarantees of determinism and correctness…
(more)
▼ Monitoring mechanisms are a critical component of the security and maintenance of high precision timing networks. Any and all guarantees of determinism and correctness are invalidated if a synchronous
network malfunctions or is compromised by an attacker. Existing mechanisms allow for a comprehensive view of the distribution of time throughout a
network, but they do not scale to large networks. I propose a new method called aggregated reverse time transfer (ARTT), which redefines the existing mechanisms to include a new
aggregation scheme that serves the dual purpose of distributed
data summarization and anomaly detection for networks of any size. With this thesis I provide a full specification and implementation of the ARTT mechanism, test both the outlier detection and model accuracy on a real timing
network, and detail the steps necessary to perform stable-state outlier detection and
aggregation on large-scale networks.
Advisors/Committee Members: Radim Bartos, Robert Noseworthy, Marek Petrik.
Subjects/Keywords: 1588; aggregation; clock; network; synchronization; time
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):
Smith, B. (2020). Aggregated Reverse Time Transfer. (Thesis). University of New Hampshire. Retrieved from https://scholars.unh.edu/thesis/1354
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):
Smith, Brandon. “Aggregated Reverse Time Transfer.” 2020. Thesis, University of New Hampshire. Accessed April 15, 2021.
https://scholars.unh.edu/thesis/1354.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Smith, Brandon. “Aggregated Reverse Time Transfer.” 2020. Web. 15 Apr 2021.
Vancouver:
Smith B. Aggregated Reverse Time Transfer. [Internet] [Thesis]. University of New Hampshire; 2020. [cited 2021 Apr 15].
Available from: https://scholars.unh.edu/thesis/1354.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Smith B. Aggregated Reverse Time Transfer. [Thesis]. University of New Hampshire; 2020. Available from: https://scholars.unh.edu/thesis/1354
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Brno University of Technology
23.
Pavela, Radek.
Využití neuronových sítí pro predikaci síťového provozu: Neural network utilization for etwork traffic predictions.
Degree: 2019, Brno University of Technology
URL: http://hdl.handle.net/11012/10309
► In this master’s thesis are discussed static properties of network traffic trace. There are also addressed the possibility of a predication with a focus on…
(more)
▼ In this master’s thesis are discussed static properties of
network traffic trace. There are also addressed the possibility of a predication with a focus on neural networks. Specifically, therefore recurrent neural networks. Training
data were downloaded from freely accessible on the internet link. This is the captured packej of traffic of LAN
network in 2001. They are not the most actual, but it is possible to use them to achieve the objective results of the work. Input
data needed to be processed into acceptable form. In the Visual Studio 2005 was created program to aggregate the intensities of these
data. The best combining appeared after 100 ms. This was achieved by the input vector, which was divided according to the needs of
network training and testing part. The various types of networks operate with the same input
data, thereby to make more objective results. In practical terms, it was necessary to verify the two principles. Principle of training and the principle of generalization. The first of the nominated designs require stoking training and verification training by using gradient and mean square error. The second one represents unknown designs application on neural
network. It was monitored the response of
network to these input
data. It can be said that the best model seemed the Layer recurrent neural
network (LRN). So, it was a solution developed in this direction, followed by searching the appropriate option of recurrent
network and optimal configuration. Found a variant of topology is 10-10-1. It was used the Matlab 7.6, with an extension of Neural
Network toolbox 6. The results are processed in the form of graphs and the final appreciation. All successful models and
network topologies are on the enclosed CD. However, Neural
Network toolbox reported some problems when importing networks. In creating this work wasn’t import of
network functions practically used. The
network can be imported, but the majority appear to be non-trannin. Unsuccessful models of networks are not presented in this master’s thesis, because it would be make a deterioration of clarity and orientation.
Advisors/Committee Members: Kacálek, Jan (advisor), Mačák, Jaromír (referee).
Subjects/Keywords: rekurentní neuronová síť; predikce síťového provozu; agregace intenzit provozu; statické vlastnosti; trénovací data; Neural network toolbox; recurrent neural network; prediction of traffic trace; aggregation of intensits of traffic trace; static properties; training data; Neural Network toolbox
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):
Pavela, R. (2019). Využití neuronových sítí pro predikaci síťového provozu: Neural network utilization for etwork traffic predictions. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/10309
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):
Pavela, Radek. “Využití neuronových sítí pro predikaci síťového provozu: Neural network utilization for etwork traffic predictions.” 2019. Thesis, Brno University of Technology. Accessed April 15, 2021.
http://hdl.handle.net/11012/10309.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Pavela, Radek. “Využití neuronových sítí pro predikaci síťového provozu: Neural network utilization for etwork traffic predictions.” 2019. Web. 15 Apr 2021.
Vancouver:
Pavela R. Využití neuronových sítí pro predikaci síťového provozu: Neural network utilization for etwork traffic predictions. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/11012/10309.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Pavela R. Využití neuronových sítí pro predikaci síťového provozu: Neural network utilization for etwork traffic predictions. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/10309
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
KTH
24.
Girondi, Massimo.
Efficient traffic monitoring in 5G Core Network.
Degree: Electrical Engineering and Computer Science (EECS), 2020, KTH
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-280098
► 5G is an enabler to several new use cases. To support all of them, the network infrastructure must be flexible and it should adapt…
(more)
▼ 5G is an enabler to several new use cases. To support all of them, the network infrastructure must be flexible and it should adapt to the different situations. This feature is powered by SDN, NFV, and Automation, three of the main pillars on which the 5G network is built.Traditional network management approaches may not be suitable for the 5G Core Network User Plane, which holds strict requirements in terms of latency and throughput. Therefore, Artificial Intelligence agents have been proposed to manage the 5G in a more efficient manner, delivering a more optimized allocation of the resources. This approach requires real-time monitoring of the data passing by the Core Network, a feature not standardized by the current protocols. In this thesis, the design of a monitoring protocol for the 5G Core Network User Plane has been studied, focusing on precise measurement of latencies. Then, a In-band Network Telemetry (INT) framework has been implemented on top of a User Plane Function prototype. The prototype is built on top of a novel User Plane implementation, based on chaining of atomic functions called micro-UPFs (µUPFs).While the main focus of this work has been latency measurement, packet counters, byte counters and Inter Packet Gap values can be collected from the framework, proving the main KPIs of a 5G User Plane. The INT framework has been implemented through two new µUPFs, one for updating the INT metadata and one for collecting them. These metadata are attached to the user packets as GTP-U extended header, maintaining compatibility with the standard protocol. Moreover, the implemented framework allows high flexibility through dynamic tuning of the parameters, providing mechanisms to reduce the amount of telemetry data generated and, thus, the system overhead.The framework has been tested on a physical setup of four server machines, abstracting a Core Network User Plane, connected with 10 Gbps NICs. In all the tests performed, the performances of the User Plane are affected by the new functionalities only when INT metadata are inserted very frequently. The results show that is possible to monitor the three main KPIs of a 5G User Plane without heavily limiting the system performances.
5G är en möjliggörare för flera nya användningsfall: för att stödja dem alla måste nätverksinfrastrukturen vara flexibel och den ska anpassa sig till de olika situationerna. Denna funktion drivs av SDN, NFV och Automation, tre av de viktigaste pelarna som 5G-nätverket är byggt på.Traditionella nätverkshanteringsstrategier kanske inte passar för 5G Core Network, som har strikta krav när det gäller latens och genomströmning. Därför har Artificial Intelligence-agenter föreslagits att hantera 5G på ett mer effektivt sätt, vilket ger en mer optimerad fördelning av resurserna. Detta tillvägagångssätt kräver realtidsövervakning av data som passerar via Core Network, en funktion som inte standardiseras med de aktuella protokollen.I denna avhandling har utformningen av ett övervakningsprotokoll för 5G Core Network User Plane…
Subjects/Keywords: 5G; Core Network; Network Monitoring; In-band Network Telemetry; Latency measurement; Computer and Information Sciences; Data- och informationsvetenskap
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):
Girondi, M. (2020). Efficient traffic monitoring in 5G Core Network. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-280098
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):
Girondi, Massimo. “Efficient traffic monitoring in 5G Core Network.” 2020. Thesis, KTH. Accessed April 15, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-280098.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Girondi, Massimo. “Efficient traffic monitoring in 5G Core Network.” 2020. Web. 15 Apr 2021.
Vancouver:
Girondi M. Efficient traffic monitoring in 5G Core Network. [Internet] [Thesis]. KTH; 2020. [cited 2021 Apr 15].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-280098.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Girondi M. Efficient traffic monitoring in 5G Core Network. [Thesis]. KTH; 2020. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-280098
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
IUPUI
25.
Zare Afifi, Saharnaz.
Securing sensor network.
Degree: 2014, IUPUI
URL: http://hdl.handle.net/1805/6186
► Indiana University-Purdue University Indianapolis (IUPUI)
A wireless sensor network consists of lightweight nodes with a limited power source. They can be used in a variety…
(more)
▼ Indiana University-Purdue University Indianapolis (IUPUI)
A wireless sensor network consists of lightweight nodes with a limited power source. They can be used in a variety of environments, especially in environments for which it is impossible to utilize a wired network. They are easy/fast to deploy. Nodes collect data and send it to a processing center (base station) to be analyzed, in order to detect an event and/or determine information/characteristics of the environment. The challenges for securing a sensor network are numerous. Nodes in this network have a limited amount of power, therefore they could be faulty because of a lack of battery power and broadcast faulty information to the network. Moreover, nodes in this network could be prone to different attacks from an adversary who tries to eavesdrop, modify or repeat the data which is collected by other nodes. Nodes may be mobile. There is no possibility of having a fixed infrastructure. Because of the importance of extracting information from the data collected by the sensors in the network there needs to be some level of security to provide trustworthy information. The goal of this thesis is to organize part of the network in an energy efficient manner in order to produce a suitable amount of integrity/security. By making nodes monitor each other in small organized clusters we increase security with a minimal energy cost. To increase the security of the network we use cryptographic techniques such as: public/ private key, manufacturer signature, cluster signature, etc. In addition, nodes monitor each other's activity in the network, we call it a "neighborhood watch" In this case, if a node does not forward data, or modifies it, and other nodes which are in their transmission range can send a claim against that node.
Advisors/Committee Members: King, Brian, Rizkalla, Maher E., Salama, Paul.
Subjects/Keywords: Cluster-Base Network; Threshold Signature; Data Aggregation; Wireless Network; Ad-hoc Network; Neighborhood Watch; Ad hoc networks (Computer networks) – Research; Threshold signatures – Research; Data encryption (Computer science) – Research; Computer networks – Security measures; Wireless communication systems; Wireless LANs; Group signatures (Computer security); Data protection; Computer security – Management; Sensor networks – Research; Pattern recognition systems; Computers – Access control; Computer network protocols
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zare Afifi, S. (2014). Securing sensor network. (Thesis). IUPUI. Retrieved from http://hdl.handle.net/1805/6186
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):
Zare Afifi, Saharnaz. “Securing sensor network.” 2014. Thesis, IUPUI. Accessed April 15, 2021.
http://hdl.handle.net/1805/6186.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zare Afifi, Saharnaz. “Securing sensor network.” 2014. Web. 15 Apr 2021.
Vancouver:
Zare Afifi S. Securing sensor network. [Internet] [Thesis]. IUPUI; 2014. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/1805/6186.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zare Afifi S. Securing sensor network. [Thesis]. IUPUI; 2014. Available from: http://hdl.handle.net/1805/6186
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
26.
Schiper, Nicole.
Traffic data sampling for air pollution estimation at different urban scales : Échantillonnage des données de trafic pour l’estimation de la pollution atmosphérique aux différentes échelles urbaines.
Degree: Docteur es, Génie Civil, 2017, Lyon
URL: http://www.theses.fr/2017LYSET008
► La circulation routière est une source majeure de pollution atmosphérique dans les zones urbaines. Les décideurs insistent pour qu’on leur propose de nouvelles solutions, y…
(more)
▼ La circulation routière est une source majeure de pollution atmosphérique dans les zones urbaines. Les décideurs insistent pour qu’on leur propose de nouvelles solutions, y compris de nouvelles stratégies de management qui pourraient directement faire baisser les émissions de polluants. Pour évaluer les performances de ces stratégies, le calcul des émissions de pollution devrait tenir compte de la dynamique spatiale et temporelle du trafic. L’utilisation de capteurs traditionnels sur route (par exemple, capteurs inductifs ou boucles de comptage) pour collecter des données en temps réel est nécessaire mais pas suffisante en raison de leur coût de mise en oeuvre très élevé. Le fait que de telles technologies, pour des raisons pratiques, ne fournissent que des informations locales est un inconvénient. Certaines méthodes devraient ensuite être appliquées pour étendre cette information locale à une grande échelle. Ces méthodes souffrent actuellement des limites suivantes : (i) la relation entre les données manquantes et la précision de l’estimation ne peut être facilement déterminée et (ii) les calculs à grande échelle sont énormément coûteux, principalement lorsque les phénomènes de congestion sont considérés. Compte tenu d’une simulation microscopique du trafic couplée à un modèle d’émission, une approche innovante de ce problème est mise en oeuvre. Elle consiste à appliquer des techniques de sélection statistique qui permettent d’identifier les emplacements les plus pertinents pour estimer les émissions des véhicules du réseau à différentes échelles spatiales et temporelles. Ce travail explore l’utilisation de méthodes statistiques intelligentes et naïves, comme outil pour sélectionner l’information la plus pertinente sur le trafic et les émissions sur un réseau afin de déterminer les valeurs totales à plusieurs échelles. Ce travail met également en évidence quelques précautions à prendre en compte quand on calcul les émissions à large échelle à partir des données trafic et d’un modèle d’émission. L’utilisation des facteurs d’émission COPERT IV à différentes échelles spatio-temporelles induit un biais en fonction des conditions de circulation par rapport à l’échelle d’origine (cycles de conduite). Ce biais observé sur nos simulations a été quantifié en fonction des indicateurs de trafic (vitesse moyenne). Il a également été démontré qu’il avait une double origine : la convexité des fonctions d’émission et la covariance des variables de trafic.
Road traffic is a major source of air pollution in urban areas. Policy makers are pushing for different solutions including new traffic management strategies that can directly lower pollutants emissions. To assess the performances of such strategies, the calculation of pollution emission should consider spatial and temporal dynamic of the traffic. The use of traditional on-road sensors (e.g. inductive sensors) for collecting real-time data is necessary but not sufficient because of their expensive cost of implementation. It is also a disadvantage that such technologies, for…
Advisors/Committee Members: Leclercq, Ludovic (thesis director).
Subjects/Keywords: Emissions de véhicules; Echantillonage de données de trafic; Agrégation spatio-temporelle; Echelles de réseau; Modèle d'émission; Vehicle emissions; Traffic data selection; Spatial-temporal aggregation; Network scales; Emission model
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):
Schiper, N. (2017). Traffic data sampling for air pollution estimation at different urban scales : Échantillonnage des données de trafic pour l’estimation de la pollution atmosphérique aux différentes échelles urbaines. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSET008
Chicago Manual of Style (16th Edition):
Schiper, Nicole. “Traffic data sampling for air pollution estimation at different urban scales : Échantillonnage des données de trafic pour l’estimation de la pollution atmosphérique aux différentes échelles urbaines.” 2017. Doctoral Dissertation, Lyon. Accessed April 15, 2021.
http://www.theses.fr/2017LYSET008.
MLA Handbook (7th Edition):
Schiper, Nicole. “Traffic data sampling for air pollution estimation at different urban scales : Échantillonnage des données de trafic pour l’estimation de la pollution atmosphérique aux différentes échelles urbaines.” 2017. Web. 15 Apr 2021.
Vancouver:
Schiper N. Traffic data sampling for air pollution estimation at different urban scales : Échantillonnage des données de trafic pour l’estimation de la pollution atmosphérique aux différentes échelles urbaines. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2021 Apr 15].
Available from: http://www.theses.fr/2017LYSET008.
Council of Science Editors:
Schiper N. Traffic data sampling for air pollution estimation at different urban scales : Échantillonnage des données de trafic pour l’estimation de la pollution atmosphérique aux différentes échelles urbaines. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSET008
Loughborough University
27.
Alhmiedat, Tareq Ali.
Tracking mobile targets through Wireless Sensor Networks.
Degree: PhD, 2009, Loughborough University
URL: http://hdl.handle.net/2134/5524
► In recent years, advances in signal processing have led to small, low power, inexpensive Wireless Sensor Network (WSN). The signal processing in WSN is different…
(more)
▼ In recent years, advances in signal processing have led to small, low power, inexpensive Wireless Sensor Network (WSN). The signal processing in WSN is different from the traditional wireless networks in two critical aspects: firstly, the signal processing in WSN is performed in a fully distributed manner, unlike in traditional wireless networks; secondly, due to the limited computation capabilities of sensor networks, it is essential to develop an energy and bandwidth efficient signal processing algorithms. Target localisation and tracking problems in WSNs have received considerable attention recently, driven by the necessity to achieve higher localisation accuracy, lower cost, and the smallest form factor. Received Signal Strength (RSS) based localisation techniques are at the forefront of tracking research applications. Since tracking algorithms have been attracting research and development attention recently, prolific literature and a wide range of proposed approaches regarding the topic have emerged. This thesis is devoted to discussing the existing WSN-based localisation and tracking approaches. This thesis includes five studies. The first study leads to the design and implementation of a triangulation-based localisation approach using RSS technique for indoor tracking applications. The presented work achieves low localisation error in complex environments by predicting the environmental characteristics among beacon nodes. The second study concentrates on investigating a fingerprinting localisation method for indoor tracking applications. The proposed approach offers reasonable localisation accuracy while requiring a short period of offline computation time. The third study focuses on designing and implementing a decentralised tracking approach for tracking multiple mobile targets with low resource requirements. Despite the interest in target tracking and localisation issues, there are few systems deployed using ZigBee network standard, and no tracking system has used the full features of the ZigBee network standard. Tracking through the ZigBee is a challenging task when the density of router and end-device nodes is low, due to the limited communication capabilities of end-device nodes. The fourth study focuses on developing and designing a practical ZigBee-based tracking approach. To save energy, different strategies were adopted. The fifth study outlines designing and implementing an energy-efficient approach for tracking applications. This study consists of two main approaches: a data aggregation approach, proposed and implemented in order to reduce the total number of messages transmitted over the network; and a prediction approach, deployed to increase the lifetime of the WSN. For evaluation purposes, two environmental models were used in this thesis: firstly, real experiments, in which the proposed approaches were implemented on real sensor nodes, to test the validity for the proposed approaches; secondly, simulation experiments, in which NS-2 was used to evaluate the power-consumption issues of the two…
Subjects/Keywords: 621.382; Wireless Sensor Network; Tracking; Localisation; Fingerprinting; ZigBee; Data aggregation; Prediction; Power consumption
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):
Alhmiedat, T. A. (2009). Tracking mobile targets through Wireless Sensor Networks. (Doctoral Dissertation). Loughborough University. Retrieved from http://hdl.handle.net/2134/5524
Chicago Manual of Style (16th Edition):
Alhmiedat, Tareq Ali. “Tracking mobile targets through Wireless Sensor Networks.” 2009. Doctoral Dissertation, Loughborough University. Accessed April 15, 2021.
http://hdl.handle.net/2134/5524.
MLA Handbook (7th Edition):
Alhmiedat, Tareq Ali. “Tracking mobile targets through Wireless Sensor Networks.” 2009. Web. 15 Apr 2021.
Vancouver:
Alhmiedat TA. Tracking mobile targets through Wireless Sensor Networks. [Internet] [Doctoral dissertation]. Loughborough University; 2009. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/2134/5524.
Council of Science Editors:
Alhmiedat TA. Tracking mobile targets through Wireless Sensor Networks. [Doctoral Dissertation]. Loughborough University; 2009. Available from: http://hdl.handle.net/2134/5524
University of Cincinnati
28.
SHARMA, ANURAG.
EXPLOITING SPATIAL CORRELATION USING TREE BASED POLYNOMIAL
REGRESSION IN A THREE DIMENSIONAL WIRELESS SENSOR NETWORK.
Degree: MS, Engineering : Computer Engineering, 2007, University of Cincinnati
URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1175107970
► A Wireless Sensor Network (WSN) consists of a large number of sensor nodes dispersed over a chosen area for monitoring purposes. Information about an event…
(more)
▼ A Wireless Sensor
Network (WSN) consists of a large
number of sensor nodes dispersed over a chosen area for monitoring
purposes. Information about an event can be captured by the
surrounding sensor nodes. Observations from the sensor nodes which
are in close proximity are highly correlated. This is called
Spatial Correlation. In this thesis, we propose a scheme to exploit
the spatial correlation of
data in a three dimensional sensor
network by using polynomial regression technique. The scheme
involves creation of a binary tree in the
network, such that the
network has two types of nodes viz., Tree nodes and Sensing nodes.
The sensing nodes sense the physical attribute and report their
position coordinates (x, y, z) and the sensed value to the nearest
tree node. The tree nodes, on the other hand, fit a polynomial
function on the received values and transmit the coefficients of
regression to the parent tree node. The process starts with the
leaf tree nodes and stops at the root. At the end of the process,
the root has the polynomial function (Attribute value as a function
of space coordinates) for the entire sensor
network. When the sink
queries the root, instead of flooding the entire
network, the root
can use the polynomial function to compute the attribute value at
any location within the boundary. This saves a lot of energy in the
sensor
network. Simulations have been performed for different tree
heights and different sensor nodes density. Results presented in
graphical form indicate that a tree with a depth of four provides
accurate values, with minimum error. Concluding remarks and plans
for future work have also been presented.
Advisors/Committee Members: Agrawal, Dr. Dharma (Advisor).
Subjects/Keywords: Computer Science; three dimensional wireless sensor network; data aggregation; polynomial regression
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):
SHARMA, A. (2007). EXPLOITING SPATIAL CORRELATION USING TREE BASED POLYNOMIAL
REGRESSION IN A THREE DIMENSIONAL WIRELESS SENSOR NETWORK. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1175107970
Chicago Manual of Style (16th Edition):
SHARMA, ANURAG. “EXPLOITING SPATIAL CORRELATION USING TREE BASED POLYNOMIAL
REGRESSION IN A THREE DIMENSIONAL WIRELESS SENSOR NETWORK.” 2007. Masters Thesis, University of Cincinnati. Accessed April 15, 2021.
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1175107970.
MLA Handbook (7th Edition):
SHARMA, ANURAG. “EXPLOITING SPATIAL CORRELATION USING TREE BASED POLYNOMIAL
REGRESSION IN A THREE DIMENSIONAL WIRELESS SENSOR NETWORK.” 2007. Web. 15 Apr 2021.
Vancouver:
SHARMA A. EXPLOITING SPATIAL CORRELATION USING TREE BASED POLYNOMIAL
REGRESSION IN A THREE DIMENSIONAL WIRELESS SENSOR NETWORK. [Internet] [Masters thesis]. University of Cincinnati; 2007. [cited 2021 Apr 15].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1175107970.
Council of Science Editors:
SHARMA A. EXPLOITING SPATIAL CORRELATION USING TREE BASED POLYNOMIAL
REGRESSION IN A THREE DIMENSIONAL WIRELESS SENSOR NETWORK. [Masters Thesis]. University of Cincinnati; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1175107970
University of Minnesota
29.
Nickodem, Kyle.
Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data.
Degree: PhD, Educational Psychology, 2020, University of Minnesota
URL: http://hdl.handle.net/11299/216126
► Propensity score methods can be used to reduce selection bias and improve causal inferencing with nonrandomized data. However, there is little guidance for implementing a…
(more)
▼ Propensity score methods can be used to reduce selection bias and improve causal inferencing with nonrandomized data. However, there is little guidance for implementing a propensity score analysis when treatment exposure is a property of clusters rather than subjects. For example, education policies and practices are often implemented by school or district rather than by individual student. The three studies in this dissertation strive to clarify procedural quandaries for a propensity score analysis with cluster-level treatment exposure and subject-level outcomes. Additionally, omission of a true confounder from a propensity score analysis can bias treatment effect estimation. My dissertation also explores the utility of aggregated covariates as replacements for missing true cluster-level confounders. The first simulation study compared four procedures for generating aggregated covariates. The results highlight that: 1) researchers need to verify the comparability of generated samples to real world contexts; 2) a propensity score analysis with cluster-level treatment exposure requires at least 60 clusters. The second simulation compared covariate balance and treatment effect estimation when appraising treatment exposure by subjects or by clusters and including aggregated covariates of varying quality. Treatment appraisal by subjects outperformed appraisal by clusters under certain conditions. When highly correlated (r = .92 - .98) with the missing true confounders, aggregated covariates were viable replacements. The last study applied the guidance from the simulations to statewide survey data. The investigation found no association between the presence of a school resource officer and students’ social-emotional well-being and academic performance. A critical caveat is the results may not generalize to student populations that have historically been targeted by discrimination and school violence.
Subjects/Keywords: Aggregation; Clustered Data; Propensity Scores; Selection Bias
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):
Nickodem, K. (2020). Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/216126
Chicago Manual of Style (16th Edition):
Nickodem, Kyle. “Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data.” 2020. Doctoral Dissertation, University of Minnesota. Accessed April 15, 2021.
http://hdl.handle.net/11299/216126.
MLA Handbook (7th Edition):
Nickodem, Kyle. “Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data.” 2020. Web. 15 Apr 2021.
Vancouver:
Nickodem K. Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data. [Internet] [Doctoral dissertation]. University of Minnesota; 2020. [cited 2021 Apr 15].
Available from: http://hdl.handle.net/11299/216126.
Council of Science Editors:
Nickodem K. Use of Aggregated Covariates In Propensity Score Analysis of Clustered Data. [Doctoral Dissertation]. University of Minnesota; 2020. Available from: http://hdl.handle.net/11299/216126
Delft University of Technology
30.
Dekker, F.W. (author).
Privacy-Preserving Data Aggregation with Probabilistic Range Validation.
Degree: 2020, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268
► Privacy-preserving data aggregation protocols have been researched widely, but usually cannot guarantee correctness of the aggregate if users are malicious. These protocols can be extended…
(more)
▼ Privacy-preserving
data aggregation protocols have been researched widely, but usually cannot guarantee correctness of the aggregate if users are malicious. These protocols can be extended with zero-knowledge proofs and commitments to work in the malicious model, but this incurs a significant computational cost on the end users, making adoption of such protocols less likely. We propose a privacy-preserving
data aggregation protocol for calculating the sum of user inputs. Our protocol gives the aggregator confidence that all inputs are within a desired range. Instead of zero-knowledge proofs, our protocol relies on an asynchronous probabilistic hypergraph-based detection algorithm with which the aggregator can quickly pinpoint malicious users. Our protocol is robust to user dropouts and is non-interactive apart from the registration phase. We describe several optional extensions to our protocol for temporal
aggregation, dynamic user joins and leaves, and differential privacy. We analyse our protocol in terms of security, privacy, and detection rate. Finally, we compare the runtime complexity of our protocol with a selection of related protocols.
Advisors/Committee Members: Erkin, Z. (mentor), Picek, S. (graduation committee), Finavaro Aniche, M. (graduation committee), Delft University of Technology (degree granting institution).
Subjects/Keywords: Privacy; Data aggregation; Applied cryptography; Hypergraphs
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):
Dekker, F. W. (. (2020). Privacy-Preserving Data Aggregation with Probabilistic Range Validation. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268
Chicago Manual of Style (16th Edition):
Dekker, F W (author). “Privacy-Preserving Data Aggregation with Probabilistic Range Validation.” 2020. Masters Thesis, Delft University of Technology. Accessed April 15, 2021.
http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268.
MLA Handbook (7th Edition):
Dekker, F W (author). “Privacy-Preserving Data Aggregation with Probabilistic Range Validation.” 2020. Web. 15 Apr 2021.
Vancouver:
Dekker FW(. Privacy-Preserving Data Aggregation with Probabilistic Range Validation. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Apr 15].
Available from: http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268.
Council of Science Editors:
Dekker FW(. Privacy-Preserving Data Aggregation with Probabilistic Range Validation. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268
◁ [1] [2] [3] [4] [5] … [5598] ▶
. 
Open Access Theses and Dissertations
