2,208 research outputs found
Wireless industrial monitoring and control networks: the journey so far and the road ahead
While traditional wired communication technologies have played a crucial role in industrial monitoring and control networks over the past few decades, they are increasingly proving to be inadequate to meet the highly dynamic and stringent demands of today’s industrial applications, primarily due to the very rigid nature of wired infrastructures. Wireless technology, however, through its increased pervasiveness, has the potential to revolutionize the industry, not only by mitigating the problems faced by wired solutions, but also by introducing a completely new class of applications. While present day wireless technologies made some preliminary inroads in the monitoring domain, they still have severe limitations especially when real-time, reliable distributed control operations are concerned. This article provides the reader with an overview of existing wireless technologies commonly used in the monitoring and control industry. It highlights the pros and cons of each technology and assesses the degree to which each technology is able to meet the stringent demands of industrial monitoring and control networks. Additionally, it summarizes mechanisms proposed by academia, especially serving critical applications by addressing the real-time and reliability requirements of industrial process automation. The article also describes certain key research problems from the physical layer communication for sensor networks and the wireless networking perspective that have yet to be addressed to allow the successful use of wireless technologies in industrial monitoring and control networks
A Key Establishment Scheme for Mobile Wireless Sensor Networks Using Post-Deployment Knowledge
Establishment of pairwise keys between sensor nodes in a sensor network is a
difficult problem due to resource limitations of sensor nodes as well as
vulnerability to physical captures of sensor nodes by the enemy. Public-key
cryptosystems are not much suited for most resource-constrained sensor
networks. Recently, elliptic curve cryptographic techniques show that public
key cryptosystem is also feasible for resource-constrained sensor networks.
However, most researchers accept that the symmetric key cryptosystems are
viable options for resource-constrained sensor networks. In this paper, we
first develop a basic principle to address the key pre-distribution problem in
mobile sensor networks. Then, using this developed basic principle, we propose
a scheme which takes the advantage of the post-deployment knowledge. Our scheme
is a modified version of the key prioritization technique proposed by Liu and
Ning. Our improved scheme provides reasonable network connectivity and
security. Moreover, the proposed scheme works for any deployment topology.Comment: Published in International Journal of Computer Networks &
Communications (IJCNC) Vol.3, No.4, July 201
Opportunistic P2P Communications in Delay-Tolerant Rural Scenarios
Opportunistic networking represents a promising paradigm for support of communications, specifically in infrastructureless scenarios such as remote areas communications. In principle in opportunistic environments, we would like to make available all the applications thought for traditional wired and wireless networks like file-sharing and content distribution. In this paper, we present a delay-tolerant scenario for file sharing applications in rural areas, where an opportunistic approach is exploited. In order to support communications, we compare two peer-to-peer (P2P) schemes initially conceived for wireless networks and prove their applicability and usefulness to a DTN scenario, where replication of resources can be used to improve the lookup performance and the network can be occasionally connected by means of a data mule. Simulation results show the suitability of the schemes and allow to derive interesting design guidelines on the convenience and applicability of such approaches
Performance of management solutions and cooperation approaches for vehicular delay-tolerant networks
A wide range of daily-life applications supported by vehicular networks attracted the interest,
not only from the research community, but also from governments and the automotive
industry. For example, they can be used to enable services that assist drivers on the roads (e.g.,
road safety, traffic monitoring), to spread commercial and entertainment contents (e.g., publicity),
or to enable communications on remote or rural regions where it is not possible to have
a common network infrastructure. Nonetheless, the unique properties of vehicular networks
raise several challenges that greatly impact the deployment of these networks.
Most of the challenges faced by vehicular networks arise from the highly dynamic network
topology, which leads to short and sporadic contact opportunities, disruption, variable
node density, and intermittent connectivity. This situation makes data dissemination an interesting
research topic within the vehicular networking area, which is addressed by this study.
The work described along this thesis is motivated by the need to propose new solutions to deal
with data dissemination problems in vehicular networking focusing on vehicular delay-tolerant
networks (VDTNs).
To guarantee the success of data dissemination in vehicular networks scenarios it is important
to ensure that network nodes cooperate with each other. However, it is not possible
to ensure a fully cooperative scenario. This situation makes vehicular networks suitable to the
presence of selfish and misbehavior nodes, which may result in a significant decrease of the
overall network performance. Thus, cooperative nodes may suffer from the overwhelming load
of services from other nodes, which comprises their performance.
Trying to solve some of these problems, this thesis presents several proposals and studies
on the impact of cooperation, monitoring, and management strategies on the network performance
of the VDTN architecture. The main goal of these proposals is to enhance the network
performance. In particular, cooperation and management approaches are exploited to improve
and optimize the use of network resources. It is demonstrated the performance gains attainable
in a VDTN through both types of approaches, not only in terms of bundle delivery probability,
but also in terms of wasted resources.
The results and achievements observed on this research work are intended to contribute
to the advance of the state-of-the-art on methods and strategies for overcome the challenges
that arise from the unique characteristics and conceptual design of vehicular networks.O vasto número de aplicações e cenários suportados pelas redes veiculares faz com que
estas atraiam o interesse nĂŁo sĂł da comunidade cientĂfica, mas tambĂ©m dos governos e da indĂşstria
automĂłvel. A tĂtulo de exemplo, estas podem ser usadas para a implementação de serviços
e aplicações que podem ajudar os condutores dos veĂculos a tomar decisões nas estradas, para
a disseminação de conteúdos publicitários, ou ainda, para permitir que existam comunicações
em zonas rurais ou remotas onde nĂŁo Ă© possĂvel ter uma infraestrutura de rede convencional.
Contudo, as propriedades únicas das redes veiculares fazem com que seja necessário ultrapassar
um conjunto de desafios que tĂŞm grande impacto na sua aplicabilidade.
A maioria dos desafios que as redes veiculares enfrentam advĂŞm da grande mobilidade dos
veĂculos e da topologia de rede que está em constante mutação. Esta situação faz com que este
tipo de rede seja suscetĂvel de disrupção, que as oportunidades de contacto sejam escassas e de
curta duração, e que a ligação seja intermitente. Fruto destas adversidades, a disseminação dos
dados torna-se um tópico de investigação bastante promissor na área das redes veiculares e por
esta mesma razão é abordada neste trabalho de investigação. O trabalho descrito nesta tese é
motivado pela necessidade de propor novas abordagens para lidar com os problemas inerentes
à disseminação dos dados em ambientes veiculares.
Para garantir o sucesso da disseminação dos dados em ambientes veiculares é importante
que este tipo de redes garanta a cooperação entre os nós da rede. Contudo, neste tipo de ambientes
nĂŁo Ă© possĂvel garantir um cenário totalmente cooperativo. Este cenário faz com que
as redes veiculares sejam suscetĂveis Ă presença de nĂłs nĂŁo cooperativos que comprometem
seriamente o desempenho global da rede. Por outro lado, os nĂłs cooperativos podem ver o seu
desempenho comprometido por causa da sobrecarga de serviços que poderão suportar.
Para tentar resolver alguns destes problemas, esta tese apresenta várias propostas e estudos
sobre o impacto de estratégias de cooperação, monitorização e gestão de rede no desempenho
das redes veiculares com ligações intermitentes (Vehicular Delay-Tolerant Networks
- VDTNs). O objetivo das propostas apresentadas nesta tese Ă© melhorar o desempenho global
da rede. Em particular, as estratégias de cooperação e gestão de rede são exploradas para
melhorar e optimizar o uso dos recursos da rede. Ficou demonstrado que o uso deste tipo de
estratégias e metodologias contribui para um aumento significativo do desempenho da rede,
não só em termos de agregados de pacotes (“bundles”) entregues, mas também na diminuição
do volume de recursos desperdiçados.
Os resultados observados neste trabalho procuram contribuir para o avanço do estado
da arte em métodos e estratégias que visam ultrapassar alguns dos desafios que advêm das
propriedades e desenho conceptual das redes veiculares
Dtn and non-dtn routing protocols for inter-cubesat communications: A comprehensive survey
CubeSats, which are limited by size and mass, have limited functionality. These miniaturised satellites suffer from a low power budget, short radio range, low transmission speeds, and limited data storage capacity. Regardless of these limitations, CubeSats have been deployed to carry out many research missions, such as gravity mapping and the tracking of forest fires. One method of increasing their functionality and reducing their limitations is to form CubeSat networks, or swarms, where many CubeSats work together to carry out a mission. Nevertheless, the network might have intermittent connectivity and, accordingly, data communication becomes challenging in such a disjointed network where there is no contemporaneous path between source and destination due to satellites’ mobility pattern and given the limitations of range. In this survey, various inter-satellite routing protocols that are Delay Tolerant (DTN) and Non Delay Tolerant (Non-DTN) are considered. DTN routing protocols are considered for the scenarios where the network is disjointed with no contemporaneous path between a source and a destination. We qualitatively compare all of the above routing protocols to highlight the positive and negative points under different network constraints. We conclude that the performance of routing protocols used in aerospace communications is highly dependent on the evolving topology of the network over time. Additionally, the Non-DTN routing protocols will work efficiently if the network is dense enough to establish reliable links between CubeSats. Emphasis is also given to network capacity in terms of how buffer, energy, bandwidth, and contact duration influence the performance of DTN routing protocols, where, for example, flooding-based DTN protocols can provide superior performance in terms of maximizing delivery ratio and minimizing a delivery delay. However, such protocols are not suitable for CubeSat networks, as they harvest the limited resources of these tiny satellites and they are contrasted with forwarding-based DTN routing protocols, which are resource-friendly and produce minimum overheads on the cost of degraded delivery probability. From the literature, we found that quota-based DTN routing protocols can provide the necessary balance between delivery delay and overhead costs in many CubeSat missions
Performance metrics and routing in vehicular ad hoc networks
The aim of this thesis is to propose a method for enhancing the performance of Vehicular Ad hoc
Networks (VANETs). The focus is on a routing protocol where performance metrics are used to
inform the routing decisions made. The thesis begins by analysing routing protocols in a random
mobility scenario with a wide range of node densities. A Cellular Automata algorithm is
subsequently applied in order to create a mobility model of a highway, and wide range of density
and transmission range are tested. Performance metrics are introduced to assist the prediction of
likely route failure. The Good Link Availability (GLA) and Good Route Availability (GRA)
metrics are proposed which can be used for a pre-emptive action that has the potential to give
better performance. The implementation framework for this method using the AODV routing
protocol is also discussed. The main outcomes of this research can be summarised as identifying
and formulating methods for pre-emptive actions using a Cellular Automata with NS-2 to
simulate VANETs, and the implementation method within the AODV routing protocol
Department of Computer Science Activity 1998-2004
This report summarizes much of the research and teaching activity of the Department of Computer Science at Dartmouth College between late 1998 and late 2004. The material for this report was collected as part of the final report for NSF Institutional Infrastructure award EIA-9802068, which funded equipment and technical staff during that six-year period. This equipment and staff supported essentially all of the department\u27s research activity during that period
Effective Route Maintenance and Restoration Schemes in Mobile Ad Hoc Networks
This study proposes a location-based hybrid routing protocol to improve data packet delivery and to reduce control message overhead in mobile ad hoc networks. In mobile environments, where nodes move continuously at a high speed, it is generally difficult to maintain and restore route paths. Therefore, this study suggests a new flooding mechanism to control route paths. The essence of the proposed scheme is its effective tracking of the destination’s location based on the beacon messages of the main route nodes. Through experiments based on an NS-2 simulator, the proposed scheme shows improvements in the data packet delivery ratio and reduces the amount of routing control message overhead compared with existing routing protocols such as AODV, LAR, ZRP and AODV-DFR
- …