SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "L773:1536 1233 srt2:(2010-2014)"

Search: L773:1536 1233 > (2010-2014)

  • Result 1-10 of 11
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Alpcan, Tansu, et al. (author)
  • Security Games for Vehicular Networks
  • 2011
  • In: IEEE Transactions on Mobile Computing. - 1536-1233 .- 1558-0660. ; 10:2, s. 280-290
  • Journal article (peer-reviewed)abstract
    • Vehicular networks (VANETs) can be used to improve transportation security, reliability, and management. This paper investigates security aspects of VANETs within a game-theoretic framework where defensive measures are optimized with respect to threats posed by malicious attackers. The formulations are chosen to be abstract on purpose in order to maximize applicability of the models and solutions to future systems. The security games proposed for vehicular networks take as an input centrality measures computed by mapping the centrality values of the car networks to the underlying road topology. The resulting strategies help locating most valuable or vulnerable points (e.g., against jamming) in vehicular networks. Thus, optimal deployment of traffic control and security infrastructure is investigated both in the static (e.g., fixed roadside units) and dynamic cases (e. g., mobile law enforcement units). Multiple types of security games are studied under varying information availability assumptions for the players, leading to fuzzy game and fictitious play formulations in addition to classical zero-sum games. The effectiveness of the security game solutions is evaluated numerically using realistic simulation data obtained from traffic engineering systems.
  •  
2.
  •  
3.
  • Fiedler, Markus, et al. (author)
  • Estimating performance of mobile services from comparative output-input analysis of end-to-end throughput
  • 2013
  • In: IEEE Transactions on Mobile Computing. - : IEEE. - 1536-1233 .- 1558-0660. ; 12:9, s. 1761-1773
  • Journal article (peer-reviewed)abstract
    • Mobile devices with ever-increasing functionality and the ubiquitous availability of wireless communication networks are driving forces behind innovative mobile applications enriching our daily life. One of the performance measures for a successful application deployment is the ability to support application-data flows by heterogeneous networks within certain delay boundaries. However, the quantitative impact of this measure is unknown and practically infeasible to determine at real-time due to the mobile device resource constraints. We research practical methods for measurement-based performance evaluation of heterogeneous data communication networks that support mobile application-data flows. We apply the lightweight Comparative Output-Input Analysis (COIA) method estimating an additional delay based on an observation interval of interest (e.g., one second) induced on the flow. An additional delay is the amount of delay that exceeds non-avoidable, minimal end-to-end delay caused by the networks propagation, serialization and transmission. We propose five COIA methods to estimate additional delay and we validate their accuracy with measurements obtained from the existing healthcare and multimedia streaming applications. Despite their simplicity, our methods prove to be accurate in relation to an observation interval of interest, and robust under a variety of network conditions. The methods offer novel insights into application-data delays with regards to the performance of heterogeneous data communication networks.
  •  
4.
  • Fiore, Marco, et al. (author)
  • Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks
  • 2013
  • In: IEEE Transactions on Mobile Computing. - 1536-1233 .- 1558-0660. ; 12:2, s. 289-303
  • Journal article (peer-reviewed)abstract
    • A growing number of ad hoc networking protocols and location-aware services require that mobile nodes learn the position of their neighbors. However, such a process can be easily abused or disrupted by adversarial nodes. In absence of a priori trusted nodes, the discovery and verification of neighbor positions presents challenges that have been scarcely investigated in the literature. In this paper, we address this open issue by proposing a fully distributed cooperative solution that is robust against independent and colluding adversaries, and can be impaired only by an overwhelming presence of adversaries. Results show that our protocol can thwart more than 99 percent of the attacks under the best possible conditions for the adversaries, with minimal false positive rates.
  •  
5.
  • Fotouhi, Hossein, et al. (author)
  • Reliable and fast hand-offs in low-power wireless networks
  • 2014
  • In: IEEE Transactions on Mobile Computing. - 1536-1233 .- 1558-0660. ; 13:11, s. 2620-2633
  • Journal article (peer-reviewed)abstract
    • Hand-off (or hand-over), the process where mobile nodes select the best access point available to transfer data, has been well studied in wireless networks. The performance of a hand-off process depends on the specific characteristics of the wireless links. In the case of low-power wireless networks, hand-off decisions must be carefully taken by considering the unique properties of inexpensive low-power radios. This paper addresses the design, implementation and evaluation of smart-HOP, a hand-off mechanism tailored for low-power wireless networks. This work has three main contributions. First, it formulates the hard hand-off process for low-power networks (such as typical wireless sensor networks - WSNs) with a probabilistic model, to investigate the impact of the most relevant channel parameters through an analytical approach. Second, it confirms the probabilistic model through simulation and further elaborates on the impact of several hand-off parameters. Third, it fine-tunes the most relevant hand-off parameters via an extended set of experiments, in a realistic experimental scenario. The evaluation shows that smart-HOP performs well in the transitional region while achieving more than 98 percent relative delivery ratio and hand-off delays in the order of a few tens of a milliseconds.
  •  
6.
  • Helgason, Ólafur, et al. (author)
  • Opportunistic Communication and Human Mobility
  • 2014
  • In: IEEE Transactions on Mobile Computing. - 1536-1233 .- 1558-0660. ; 13:7, s. 1597-1610
  • Journal article (peer-reviewed)abstract
    • Many mobility models currently used for evaluating wireless communication systems have weak resemblance to reality and there is a lack of understanding on which characteristics of human mobility affect system performance. In particular, most current mobility models assume a free flow of nodes and do not consider how mobility is affected by interactions with other persons and with the physical environment. They also assume a closed system, not considering the effect of node arrival and departure. The structure of space in which the mobility occurs is either not considered at all, or only in a limited way. In this work, we address human pedestrian mobility for evaluation of wireless communication to determine which of the aforementioned aspects need to be captured and to what level of detail. We focus on opportunistic communication in the form of ad-hoc and delay-tolerant networks. For the evaluation, we use mobility models from the field of transportation and urban planning that are used for designing and dimensioning public spaces for comfort and safety of pedestrians in rush hour and emergency evacuation. The models capture micro-mobility of pedestrians better than most mobility models used in mobile networking since the application domain requires realistic representation of node interactions with the physical environment and with other nodes. Our results show that the free flow assumption used in most models does not have a significant performance impact. We also conclude that performance is not very sensitive to accurate estimation of the probability distributions of mobility parameters such as speed and arrival process. Our results, however, suggest that it is important to capture the scenario and space in which mobility occurs since these may affect performance significantly.
  •  
7.
  • Muller, Philipp, et al. (author)
  • UWB Positioning with Generalized Gaussian Mixture Filters
  • 2014
  • In: IEEE Transactions on Mobile Computing. - 1536-1233. ; 13:10, s. 2406-2414
  • Journal article (peer-reviewed)abstract
    • Low-complexity Bayesian filtering for nonlinear models is challenging. Approximative methods based on Gaussian mixtures (GM) and particle filters are able to capture multimodality, but suffer from high computational demand. In this paper, we provide an in-depth analysis of a generalized GM (GGM), which allows component weights to be negative, and requires significantly fewer components than the traditional GM for ranging models. Based on simulations and tests with real data from a network of UWB nodes, we show how the algorithm's accuracy depends on the uncertainty of the measurements. For nonlinear ranging the GGM filter outperforms the extended Kalman filter (EKF) in both positioning accuracy and consistency in environments with uncertain measurements, and requires only slightly higher computational effort when the number of measurement channels is small. In networks with highly reliable measurements, the GGM filter yields similar accuracy and better consistency than the EKF.
  •  
8.
  • Park, Pangun, 1980-, et al. (author)
  • Breath: an Adaptive Protocol for Industrial Control Applications using Wireless Sensor Networks
  • 2011
  • In: IEEE Transactions on Mobile Computing. - : IEEE. - 1536-1233 .- 1558-0660. ; 10:6, s. 821-838
  • Journal article (peer-reviewed)abstract
    • An energy-efficient, reliable and timely data transmission is essential for Wireless Sensor Networks (WSNs) employed in scenarios where plant information must be available for control applications. To reach a maximum efficiency, cross-layer interaction is a major design paradigm to exploit the complex interaction among the layers of the protocol stack. This is challenging because latency, reliability, and energy are at odds, and resource-constrained nodes support only simple algorithms. In this paper, the novel protocol Breath is proposed for control applications. Breath is designed for WSNs where nodes attached to plants must transmit information via multihop routing to a sink. Breath ensures a desired packet delivery and delay probabilities while minimizing the energy consumption of the network. The protocol is based on randomized routing, medium access control, and duty-cycling jointly optimized for energy efficiency. The design approach relies on a constrained optimization problem, whereby the objective function is the energy consumption and the constraints are the packet reliability and delay. The challenging part is the modeling of the interactions among the layers by simple expressions of adequate accuracy, which are then used for the optimization by in-network processing. The optimal working point of the protocol is achieved by a simple algorithm, which adapts to traffic variations and channel conditions with negligible overhead. The protocol has been implemented and experimentally evaluated on a testbed with off-the-shelf wireless sensor nodes, and it has been compared with a standard IEEE 802.15.4 solution. Analytical and experimental results show that Breath is tunable and meets reliability and delay requirements. Breath exhibits a good distribution of the working load, thus ensuring a long lifetime of the network. Therefore, Breath is a good candidate for efficient, reliable, and timely data gathering for control applications.
  •  
9.
  • Rossi, Michele, et al. (author)
  • SYNAPSE plus plus : Code Dissemination in Wireless Sensor Networks Using Fountain Codes
  • 2010
  • In: IEEE Transactions on Mobile Computing. - 1536-1233 .- 1558-0660. ; 9:12, s. 1749-1765
  • Journal article (peer-reviewed)abstract
    • This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to previous solutions, which implement plain negative acknowledgment-based ARQ strategies, SYNAPSE++ adopts a more sophisticated error recovery approach exploiting rateless fountain codes (FCs). This allows it to scale considerably better in dense networks and to better cope with noisy environments. In order to speed up the decoding process and decrease its computational complexity, we engineered the FC encoding distribution through an original genetic optimization approach. Furthermore, novel channel access and pipelining techniques have been jointly designed so as to fully exploit the benefits of fountain codes, mitigate the hidden terminal problem and reduce the number of collisions. All of this makes it possible for SYNAPSE++ to recover data over multiple hops through overhearing by limiting, as much as possible, the number of explicit retransmissions. We finally created new bootloader and memory management modules so that SYNAPSE++ could disseminate and load program images written using any language. At the end of this paper, the effectiveness of SYNAPSE++ is demonstrated through experimental results over actual multihop deployments, and its performance is compared with that of Deluge, the de facto standard protocol for code dissemination in WSNs. The TinyOS 2 code of SYNAPSE++ is available at http://dgt.dei.unipd.it/download.
  •  
10.
  • van de Beek, Jaap, et al. (author)
  • TV white space in Europe
  • 2012
  • In: IEEE Transactions on Mobile Computing. - 1536-1233 .- 1558-0660. ; 11:2, s. 178-188
  • Journal article (peer-reviewed)abstract
    • In this paper, we study the availability of TV white spaces in Europe. Specifically, we focus on the 470-790 MHz UHF band, which will predominantly remain in use for TV broadcasting after the analog-to-digital switch-over and the assignment of the 800 MHz band to licensed services have been completed. The expected number of unused, available TV channels in any location of the 11 countries we studied is 56 percent when we adopt the statistical channel model of the ITU-R. Similarly, a person residing in these countries can expect to enjoy 49 percent unused TV channels. If, in addition, restrictions apply to the use of adjacent TV channels, these numbers reduce to 25 and 18 percent, respectively. These figures are significantly smaller than those recently reported for the United States. We also study how these results change when we use the Longley-Rice irregular terrain model instead. We show that while the overall expected availability of white spaces is essentially the same, the local variability of the available spectrum shows significant changes. This underlines the importance of using appropriate system models before making far-reaching conclusions.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-10 of 11

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view