A comparative analysis of video codecs for multihop wireless video sensor networks

Wireless video sensor networks (WVSNs) have drawn significant attention in recent years due to the advent of low-cost miniaturized cameras, which makes it feasible to realize large-scale WVSNs for a variety of applications including security surveillance, environmental tracking, and health monitoring. However, the conventional video coding paradigms are not suitable for WVSNs due to resource constraints such as limited computation power, battery energy, and network bandwidth. In this paper, we evaluated and analyzed the performance of video codecs based on emerging video coding paradigms such as distributed video coding and distributed compressive video sensing for multihop WVSNs. The main objective of this work was to provide an insight into the computational (encoding/decoding) complexity, energy consumption, node and network lifetime, processing and memory requirements, and the quality of reconstruction of these video codecs. Based on the findings, this paper also provides some guidelines for the selection of appropriate video codecs for a given WVSN application.     

Performance updating of concrete bridges using proactive health monitoring methods

Uncertainties associated with modelling of deteriorating bridges strongly affect management decisions, such as inspection, maintenance and repair actions. These uncertainties can be reduced by the effective use of health monitoring systems, through which information regarding in situ performance can be incorporated in the management of bridges.The objectives of this paper are twofold; first, an improved chloride induced deterioration model for concrete bridges is proposed that can quantify degradation in performance soon after chlorides are deposited on the bridge, rather than when initiation of corrosion at the reinforcement level takes place. As a result, the implications of introducing proactive health monitoring can be assessed using probabilistic durability criteria. Thus, the second objective of the paper is to present a methodology for performance updating of deteriorating concrete bridges fitted with a proactive health monitoring system.This methodology is illustrated via a simple example of a typical bridge element, such as a beam or a part of a slab. The results highlight the benefits from introducing ‘smart’ technology in managing bridges subject to deterioration, and quantify the reduction in uncertainties and their subsequent effect on predictions of future bridge performance.     

Analysis of the decoupled uplink downlink technique for varying path loss exponent in multi-tier HetNet

In this paper, the impact of varying path loss exponent (PLE) on user association probability, decoupled uplink coverage probability as well as decoupled uplink average spectral efficiency in downlink uplink decoupled (DUDe) multi-tier heterogeneous networks, is investigated. We investigate the effect of the difference in path loss exponents in both macro and small cell environments over uplink network performance. It is assumed that the mobile user connected to the macro base station experience different path loss exponent as compared to when connected to small base station. It is observed that the difference of path loss exponents in both cases has significant effect on the user association probability, decoupled uplink coverage probability as well as decoupled uplink average spectral efficiency. Moreover, in order to further support key findings and make sound comparison between coupled and DUDe performance in varying PLE environment, generalized analytical expressions for coupled association probabilities, along with coupled uplink coverage probability and coupled uplink average spectral efficiency have been derived. The analytical results evaluated in this paper are compared with the computer simulation and found in good agreement. Our analysis shows that decoupling technique performs suboptimal for cases where the environments around macro and small base stations are different with respect to each other. The work explained in this paper highlights the limitation of applying DUDe technique in realistic conditions where the PLEs of cellular tiers are not exactly equal to one another.

     

Distance and clustering‐based energy‐efficient pseudonyms changing strategy over road network

To improve the fairness, the energy consumption changing pseudonyms needs to be taken into account. Existing works focus on changing velocity‐based pseudonyms changing strategy and short changes interval with limited coverage, but due to similar velocity and short changes, internal attacker guesses easily known communication and location information due to location information of vehicle on tracking, which may expose adversary private information, and frequently, pseudonyms changing occurs due to movement of vehicles' similar velocity and short coverage, which may cause serious attack of vehicle. To overcome this problem, distance and cluster can be performed. In this work, we proposed distance and cluster‐based energy pseudonyms changing method for road network. We proposed distance and energy‐based clustering routing service over road network, the cluster head elected to depend on random number of distance and energy to change pseudonyms of vehicles. An each interval to be establish cluster head vehicle deployed while selects the operation mode and informs the cluster members of the selected mode through beacon signal. The cluster head vehicle node performs the pseudonyms changing based on the predicted distance and energy of the cluster member to use clustering optimization. The data of whole network send to report server through these nodes while near the RSU, and the vehicles in this area will use less energy to change the pseudonyms. The simulation results show that the proposed method enhances pseudonyms changing strategy less consumption and delays sufficient privacy level each vehicle also our method has outperform compare with existing methods than we use Sumo simulation and Matlab tools to verify our proposed method. Our proposed method outperformed in terms of pseudonym changing energy efficiency to careful attention during the cluster formation process, stable and balanced clusters that prolong the network lifetime, increases distances to more CH vehicles connectivity to makes clustering group and changing their pseudonyms in terms of high level privacy and finally, CH nodes use Dijkstra's algorithm use MST among the vehicles nodes depend on existing road networks to follow shortest path selection roads in terms of high connectivity probability of CH and stable structure of the network decreases the topology changes and thus,the clustering overhead is reduced.     

An adaptive and efficient buffer management scheme for resource-constrained delay tolerant networks

Provisioning buffer management mechanism is especially crucial in resource-constrained delay tolerant networks (DTNs) as maximum data delivery ratio with minimum overhead is expected in highly congested environments. However, most DTN protocols do not consider resource limitations (e.g., buffer, bandwidth) and hence, results in performance degradation. To strangle and mitigate the impact of frequent buffer overflows, this paper presents an adaptive and efficient buffer management scheme called size-aware drop (SAD) that strives to improve buffer utilization and avoid unnecessary message drops. To improve data delivery ratio, SAD exactly determines the requirement based on differential of newly arrived message(s) and available space. To vacate inevitable space from a congested buffer, SAD strives to avoid redundant message drops and deliberate to pick and discard most appropriate message(s) to minimize overhead. The performance of SAD is validated through extensive simulations in realistic environments (i.e., resource-constrained and congested) with different mobility models (i.e., Random Waypoint and disaster). Simulation results demonstrate the performance supremacy of SAD in terms of delivery probability and overhead ratio besides other metrics when compared to contemporary schemes based on Epidemic (DOA and DLA) and PRoPHET (SHLI and MOFO).     

Netted radar: Network communications design and optimisation

Networks of phased array radars are generally able to provide better counter stealth target detection and classification. Each radar sensor (or node) generates information which requires transmission to a central authority that is able to evaluate the information. This requires a communications network to be established to allow transmission of information to and from any node. Each radar node is limited by range and degree and relies on the formation of a multi-hop network to facilitate these transmissions.This paper presents a model whereby the radar beam itself is used in the formation of a multi-hop network. The phased array’s multi-functional nature allows rapid switching between communications and radar function. A model of how the communication system could operate is presented, and an evolutionary optimisation algorithm based upon the concept of Pareto optimality is used for the topological design of the network. Finally, a simulation environment is presented to show the simulated performance of the communication model and designed networks.     

SER and throughput analysis of space–time analog network coded relaying system over shadowed Rician fading channels

Wireless Networks - This research article presents an innovative approach based on analog network coding (ANC) in conjunction with space time block coding (STBC) which is termed as space time...