Collision avoidance slot allocation scheme for multi-cluster wireless sensor networks

This paper introduces a collision avoidance slot allocation scheme for Time Division Multiple Access (TDMA) based Medium Access Control (MAC) in multi-cluster wireless sensor networks. TDMA MAC protocols have built-in active-sleep duty cycle that can be leveraged for limiting idle listening. Also, they can overcome the overhearing problem, thus have better energy efficiency. Enabling concurrent intra-cluster communications using a single radio channel is a key issue in TDMA MAC protocols. Using orthogonal frequency channels or different Code Division Multiple Access codes for different adjacent clusters can solve the problem at the expense of cost. In this paper, we propose a new distributed slot allocation protocol called  Coordinated   Time   Slot   Allocation (CTSA) that can reduce collisions significantly using a single radio channel. We use simulations to study the effects of different system parameters on the performance of our proposed protocol. Simulation results show that applying CTSA over clustering protocols can significantly reduce collisions. It also shows fast convergence for our proposed CTSA protocol. In this paper we apply our CTSA scheme to the Low Energy Adaptive Clustering Hierarchy protocol which forms the basis for many cluster based routing protocols. CTSA is also compared with the SRSA algorithm proposed by Wu and Biswas (Wirel Netw 13(5):691–703, 2007) by means of simulation.     

Cooperative caching for content dissemination in vehicular networks

The explosive growth of mobile data traffic has made cellular operators to seek low‐cost alternatives for cellular traffic off‐loading. In this paper, we consider a content delivery network where a vehicular communication network composed of roadside units (RSUs) is integrated into a cellular network to serve as an off‐loading platform. Each RSU subjecting to its storage capacity caches a subset of the contents of the central content server. Allocating the suitable subset of contents in each RSU cache such that maximizes the hit ratio of vehicles requests is a problem of paramount value that is targeted in this study. First, we propose a centralized solution in which, we model the cache content placement problem as a submodular maximization problem and show that it is NP‐hard. Second, we propose a distributed cooperative caching scheme, in which RSUs in an area periodically share information about their contents locally and thus update their cache. To this end, we model the distributed caching problem as a strategic resource allocation game that achieves at least 50% of the optimal solution. Finally, we evaluate our scheme using simulation for urban mobility simulator under realistic conditions. On average, the results show an improvement of 8% in the hit ratio of the proposed method compared with other well‐known cache content placement approaches.     

Effects of Augmented Reality Display Settings on Human Wayfinding Performance

Augmented reality (AR) entails overlaying the real world with information from computer-generated displays. Current AR technologies support limited mobility, although this is expected to change in the future. This paper presents experimental results of effects of various AR display strategies on human performance in a simulation-based analog of a ldquosearch and rescuerdquo navigation task. The augmentation scheme was a spatially and temporally registered map that was overlaid onto a corresponding real-world maze. The experiment required the participants to traverse the maze, periodically answer orientation questions, obtain a target object, and exit the maze as quickly as possible. One hundred twenty participants were evaluated in six different conditions. There were two control conditions (paper map or compass prior to entering the maze), and four experimental conditions (combinations of egocentric and exocentric maps, and continuously on or on-demand map display). Performance measures consisted of duration of time to traverse the maze and percentage of maze covered. AR resulted in better performance than the control conditions in terms of accuracy by facilitating the participants' coverage of the maze. Results show that the better performance with respect to time was in the map control condition. This result may be due to the small size of the maze, which could be memorized. However, AR is expected to exhibit better performance compared to a paper map, when more complex environments are employed. These results demonstrate promising benefits in mobile AR usage in specific navigation tasks. Design guidelines were extracted to guide future AR systems continued progress in enhancing performance.     

A wide axial-ratio beamwidth circularly-polarized oval patch antenna with sunlight-shaped slots for gnss and wimax applications

Wireless Networks - This paper proposes a quadruple band stacked oval patch antenna with sunlight-shaped slots supporting L1/L2/L5 GNSS bands and the 2.3 Ghz WiMAX band. The antenna produces...     

Correction to: Enhanced TOA Estimation Using OFDM over Wide-Band Transmission Based on a Simulated Model

Wireless Personal Communications -     

A reliable energy-efficient pressure-based routing protocol for underwater wireless sensor network

Recently, Underwater Wireless Sensor Networks (UWSNs) has witnessed significant attention from both academia and industries in research and development, due to the growing number of applications for wide range of purposes including commercial, scientific, environmental and military. Some of the major applications include pollution monitoring, tactical surveillance, tsunami warnings and offshore exploration. Efficient communication among sensors in UWSNs is a challenging task due to the harsh environments and peculiar characteristics of UWSNs. Therefore, design of routing protocol for efficient communication among sensors and sink is one of the fundamental research themes in UWSNs. In this context, this paper proposes a location-free Reliable and Energy efficient Pressure-Based Routing (RE-PBR) protocol for UWSNs. RE-PBR considers three parameters including link quality, depth and residual energy for balancing energy consumption and reliable data delivery. Specifically, link quality is estimated using triangle metric method. A light weight information acquisition algorithm is developed for efficient knowledge discovery of the network. Multi-metric data forwarding algorithm is designed based on route cost calculation which utilizes residual energy and link quality. Simulations are carried out in NS-2 with Aqua-Sim package to evaluate the performance of RE-PBR. The performance of the proposed protocol is compared with the stat-of-the-art techniques: DBR and EEDBR. The comprehensive performance evaluation attests the benefit of RE-PBR as compared to the state-of-the-art techniques in terms of network lifetime, energy consumption, end-to-end delay and packet delivery ratio.     

Fabrication of a <Emphasis Type="Italic">p</Emphasis>–<Emphasis Type="Italic">n</Emphasis> Heterojunction Using Topological Insulator Bi<Subscript>2</Subscript>Te<Subscript>3</Subscript>–Si and Its Annealing Response

A junction device has been fabricated by growing p-type Bi₂Te₃ topological insulator (TI) film on an n-type silicon (Si) substrate using a thermal evaporation technique. Annealing using different temperatures and durations was employed to improve the quality of the film, as confirmed by microstructural study using x-ray diffraction (XRD) analysis and atomic force microscopy (AFM). The p–n diode characteristics of the junction devices were studied, and the effect of annealing investigated. An improved diode characteristic with good rectification ratio (RR) was observed for devices annealed for longer duration. Reduction in the leakage or reverse saturation current (\( I_{\rm{R}} \)) was observed with increase in the annealing temperature. The forward-bias current (\( I_{\rm{F}} \)) dropped in devices annealed above 400°C. The best results were observed for the sample device annealed at 450°C for 3 h, showing figure of merit (FOM) of 0.621 with RR ≈ 504 and \( I_{\rm{R}} \) = 0.25 μA. In terms of ideality factor, the sample device annealed at 550°C for 2 h was found to be the best with \( n \) = 6.5, RR ≈ 52.4, \( I_{\rm{R}} \) = 0.61 μA, and FOM = 0.358. The majority-carrier density \( \left( {N_{\rm{A}} } \right) \) in the p-Bi₂Te₃ film of the heterojunction was found to be on the order of 10⁹/cm³ to 10¹¹/cm³, quite close to its intrinsic carrier concentration. These results are significant for fundamental understanding of device applications of TI materials as well as future applications in solar cells.     

MDP-Based Network Selection Scheme by Genetic Algorithm and Simulated Annealing for Vertical-Handover in Heterogeneous Wireless Networks

The hybrid algorithm for real-time vertical handover using different objective functions has been presented to find the optimal network to connect with a good quality of service in accordance with the user’s preferences. Markov processes are widely used in performance modelling of wireless and mobile communication systems. We address the problem of optimal wireless network selection during vertical handover, based on the received information, by embedding the decision problem in a Markov decision process (MDP) with genetic algorithm (GA), we use GA to find a set of optimal decisions that ensures the best trade-off between QoS based on their priority level. Then, we emerge improved genetic algorithm (IGA) with simulated annealing (SA) as leading methods for search and optimization problems in heterogeneous wireless networks. We formulate the vertical handoff decision problem as a MDP, with the objectives of maximizing the expected total reward and minimizing average number of handoffs. A reward function is constructed to assess the QoS during each connection, and the AHP method are applied in an iterative way, by which we can work out a stationary deterministic handoff decision policy. As it is, the characteristics of the current mobile devices recommend using fast and efficient algorithms to provide solutions near to real-time. These constraints have moved us to develop intelligent algorithm that avoid the slow and massive computations. This paper compares the formulation and results of five recent optimization algorithms: artificial bee colony, GA, differential evolution, particle swarm optimization and hybrid of (GA–SA). Simulation results indicated that choosing the SA rules would minimize the cost function, and also that, the IGA–SA algorithm could decrease the number of unnecessary handovers, and thereby prevent the ‘Ping-Pong’ effect.