10,362 research outputs found
Efficient Cooperative Anycasting for AMI Mesh Networks
We have, in recent years, witnessed an increased interest towards enabling a
Smart Grid which will be a corner stone to build sustainable energy efficient
communities. An integral part of the future Smart Grid will be the
communications infrastructure which will make real time control of the grid
components possible. Automated Metering Infrastructure (AMI) is thought to be a
key enabler for monitoring and controlling the customer loads. %RPL is a
connectivity enabling mechanism for low power and lossy networks currently
being standardized by the IETF ROLL working group. RPL is deemed to be a
suitable candidate for AMI networks where the meters are connected to a
concentrator over multi hop low power and lossy links. This paper proposes an
efficient cooperative anycasting approach for wireless mesh networks with the
aim of achieving reduced traffic and increased utilisation of the network
resources. The proposed cooperative anycasting has been realised as an
enhancement on top of the Routing Protocol for Low Power and Lossy Networks
(RPL), a connectivity enabling mechanism in wireless AMI mesh networks. In this
protocol, smart meter nodes utilise an anycasting approach to facilitate
efficient transport of metering data to the concentrator node. Moreover, it
takes advantage of a distributed approach ensuring scalability
Towards Distributed and Adaptive Detection and Localisation of Network Faults
We present a statistical probing-approach to distributed fault-detection in networked systems, based on autonomous configuration of algorithm parameters. Statistical modelling is used for detection and localisation of network faults. A detected fault is isolated to a node or link by collaborative fault-localisation. From local measurements obtained through probing between nodes, probe response delay and packet drop are modelled via parameter estimation for each link. Estimated model parameters are used for autonomous configuration of algorithm parameters, related to probe intervals and detection mechanisms. Expected fault-detection performance is formulated as a cost instead of specific parameter values, significantly reducing configuration efforts in a distributed system. The benefit offered by using our algorithm is fault-detection with increased certainty based on local measurements, compared to other methods not taking observed network conditions into account. We investigate the algorithm performance for varying user parameters and failure conditions. The simulation results indicate that more than 95 % of the generated faults can be detected with few false alarms. At least 80 % of the link faults and 65 % of the node faults are correctly localised. The performance can be improved by parameter adjustments and by using alternative paths for communication of algorithm control messages
An initial approach to distributed adaptive fault-handling in networked systems
We present a distributed adaptive fault-handling algorithm applied in networked systems. The probabilistic approach that we use makes the proposed method capable of adaptively detect and localize network faults by the use of simple end-to-end test transactions. Our method operates in a fully distributed manner, such that each network element detects faults using locally extracted information as input. This allows for a fast autonomous adaption to local network conditions in real-time, with significantly reduced need for manual configuration of algorithm parameters. Initial results from a small synthetically generated network indicate that satisfactory algorithm performance can be achieved, with respect to the number of detected and localized faults, detection time and false alarm rate
Efficient Machine-type Communication using Multi-metric Context-awareness for Cars used as Mobile Sensors in Upcoming 5G Networks
Upcoming 5G-based communication networks will be confronted with huge
increases in the amount of transmitted sensor data related to massive
deployments of static and mobile Internet of Things (IoT) systems. Cars acting
as mobile sensors will become important data sources for cloud-based
applications like predictive maintenance and dynamic traffic forecast. Due to
the limitation of available communication resources, it is expected that the
grows in Machine-Type Communication (MTC) will cause severe interference with
Human-to-human (H2H) communication. Consequently, more efficient transmission
methods are highly required. In this paper, we present a probabilistic scheme
for efficient transmission of vehicular sensor data which leverages favorable
channel conditions and avoids transmissions when they are expected to be highly
resource-consuming. Multiple variants of the proposed scheme are evaluated in
comprehensive realworld experiments. Through machine learning based combination
of multiple context metrics, the proposed scheme is able to achieve up to 164%
higher average data rate values for sensor applications with soft deadline
requirements compared to regular periodic transmission.Comment: Best Student Paper Awar
QoS routing in ad-hoc networks using GA and multi-objective optimization
Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling
Traditionally, routing in wireless sensor networks consists of
two steps: First, the routing protocol selects a next hop,
and, second, the MAC protocol waits for the intended destination
to wake up and receive the data. This design makes
it difficult to adapt to link dynamics and introduces delays
while waiting for the next hop to wake up.
In this paper we introduce ORW, a practical opportunistic
routing scheme for wireless sensor networks. In a dutycycled
setting, packets are addressed to sets of potential receivers
and forwarded by the neighbor that wakes up first
and successfully receives the packet. This reduces delay and
energy consumption by utilizing all neighbors as potential
forwarders. Furthermore, this increases resilience to wireless
link dynamics by exploiting spatial diversity. Our results
show that ORW reduces radio duty-cycles on average
by 50% (up to 90% on individual nodes) and delays by 30%
to 90% when compared to the state of the art
- …