Modeling Enhancements in DSR, FSR, OLSR under Mobility and Scalability Constraints in VANETs

Frequent topological changes due to high mobility is one of the main issues in Vehicular Ad-hoc NETworks (VANETs). In this paper, we model transmission probabilities of 802.11p for VANETs and effect of these probabilities on average transmission time. To evaluate the effect of these probabilities of VANETs in routing protocols, we select Dynamic Source Routing (DSR), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). Framework of these protocols with respect to their packet cost is also presented in this work. A novel contribution of this work is enhancement of chosen protocols to obtain efficient behavior. Extensive simulation work is done to prove and compare the efficiency in terms of high throughput of enhanced versions with default versions of protocols in NS-2. For this comparison, we choose three performance metrics; throughput, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) in different mobilities and scalabilities. Finally, we deduce that enhanced DSR (DSR-mod) outperforms other protocols by achieving 16% more packet delivery for all scalabilities and 28% more throughput in selected mobilities than original version of DSR (DSR-orig)

Vortex phase diagram in BSCCO with damage tracks created by 30 MeV fullerene irradiation

Using 30 MeV C60 fullerene irradiation, we have produced latent tracks of diameter 20 nm and length 200 nm, near the surface of single crystalline BSCCO. A preliminary transmission electron microscopy study shows evidence for a very high density of deposited energy, and the ejection of material from the track core in very thin specimens. The latent tracks reveal themselves to be exceptionally strong pinning centers for vortices in the superconducting mixed state. Both the critical current density and magnetic irreversibility line are significantly enhanced. The irradiated crystals present salient features of the (B,T) phase diagram of vortex matter both of pristine crystals, such as the first order vortex phase transition, and the exponential Bose-glass line characteristic of heavy ion-irradiated crystals. We show that the latter is manifestly independent of the pinning potential.Comment: 10 pages, 13 figure

Priority Based Routing for Forest Fire Monitoring in Wireless Sensor Network

Recently, forest fire monitoring system in wireless sensor networks has received much attention. The conventional scheme receives fire alert data quickly to inform about fire forest event. However, since two or more nodes may detect a fire, high priority fire detection data frequently collide. In this paper, a new forest fire monitoring system is proposed in order to reduce high priority fire detection data dropped rate, by specifying a high priority received data immediately after fire detection and just before the destruction by fire. Furthermore, the node only transmits high priority data to a node, which has a low possibility of destruction by fire for low end-to-end delay of high priority fire detection data. The simulation results show that proposed scheme can reduce high priority data dropped ratio and the end-to-end delay, and have less effect of wind direction compared with the conventional scheme

Dijkstra-Based Higher Capacity Route Selection Algorithm Using Bounded Length and State Change for Automobiles

In general, automobiles travel from the origin to the destination using a shortest route. However, the shortest route may not be a highest wireless connection-capacity route, because of availability of wireless services (base station and access points etc.) along the route. To the best of our knowledge, currently no algorithm exists for selecting a route that maximizes wireless connection-capacity, while keeping route length shortest and close to shortest. In this paper, we propose two modified version of Dijkstra route selection algorithms: one for selecting a maximum connection capacity shortest route, and the other is for discovering higher wireless connection-capacity routes; the length of the route could be larger than a shortest route, but no larger than predetermined bound. The second proposed algorithm exploits the state change of the intersection to broaden the search range of possible routes. Results from our extensive simulation for a Manhattan-street type grid network with the heterogeneous IEEE 802.11a wireless access, show that for a 50% increase in route length and 15 Access Points (APs), the proposed algorithm can increases wireless connection-capacity by 35.67% and 31.27% compared to the shortest and random route selection algorithms, respectively

A Novel Blockchain-Based Product Ownership Management System (POMS) for Anti-Counterfeits in the Post Supply Chain

For more than a decade now, radio frequency identification (RFID) technology has been quite effective in providing anti-counterfeits measures in the supply chain. However, the genuineness of RFID tags cannot be guaranteed in the post supply chain, since these tags can be rather easily cloned in the public space. In this paper, we propose a novel product ownership management system (POMS) of RFID-attached products for anti-counterfeits that can be used in the post supply chain. For this purpose, we leverage the idea of Bitcoin's blockchain that anyone can check the proof of possession of balance. With the proposed POMS, a customer can reject the purchase of counterfeits even with genuine RFID tag information, if the seller does not possess their ownership. We have implemented a proof-of-concept experimental system employing a blockchain-based decentralized application platform, Ethereum, and evaluated its cost performance. Results have shown that, typically, the cost of managing the ownership of a product with up to six transfers is less than U.S. 1. © 2013 IEEE

RPL-based tree construction scheme for target-specific code dissemination in wireless sensors networks

Distributing codes to specific target sensors in order to fix bugs and/or install a new application is an important management task in WSNs (Wireless Sensor Networks). For the energy efficient dissemination of such codes to specific target sensors, it is required to select the minimum required number of forwarders with the fewest control messages. In this paper, we propose a novel RPL (Routing Protocol for Low-power and lossy networks)-based tree construction scheme for target-specific code dissemination, which is called R-TCS. The main idea of R-TCS is that by leveraging the data collection tree created by a standard routing protocol RPL, it is possible to construct the code dissemination tree with the minimum numbers of non-target sensors and control messages. Since by creating a data collection tree each sensor exchanges RPL messages with the root of the tree, every sensor knows which sensors compose its upwards route, i.e. the route towards the root, and downwards route, i.e. the route towards the leaves. Because of these properties, a target sensor can select the upward route that contains the minimum number of non-target sensors. In addition, a sensor whose downward routes do not contain a target sensor is not required to transmit redundant control messages which are related to the code dissemination operation. In this way, R-TCS can reduce the energy consumption which typically happens in other target-specific code dissemination schemes by the transmission of control messages. In fact, various performance evaluation results obtained by means of computer simulations show that R-TCS reduces by at least 50% energy consumption as compared to the other previous known target-specific code dissemination scheme under the condition where ratio of target sensors is 10% of all sensors. © 2020 The Institute of Electronics

An energy-efficient defense against message flooding attacks in delay tolerant networks

Delay Tolerant Networks (DTNs) are vulnerable to message flooding attacks in which a very large number of malicious messages are sent so that network resources are depleted. To address this problem, previous studies mainly focused on constraining the number of messages that nodes can generate per time slot by allowing nodes to monitor the other nodes' communication history. Since the adversaries may hide their attacks by claiming a false history, nodes exchange their communication histories and detect an attacker who has presented an inconsistent communication history. However, this approach increases node energy consumption since the number of communication histories increases every time a node communicates with another node. To deal with this problem, in this paper, we propose an energy-efficient defense against such message flooding attacks. The main idea of the proposed scheme is to time limit the communication history exchange so as to reduce the volume while ensuring the effective detection of inconsistencies. The advantage of this approach is that, by removing communication histories after they have revealed such inconsistencies, the energy consumption is reduced. To estimate such expiration time, analytical expressions based upon a Markov chain based message propagation model, are derived for the probability that a communication history reveals such inconsistency in an arbitrary time. Extensive performance evaluation results obtained by means of computer simulations and several performance criteria verify that the proposed scheme successfully improves the overall energy efficiency. For example, these performance results have shown that, as compared to other previously known defenses against message flooding attacks, the proposed scheme extends by at least 22% the battery lifetime of DTN nodes, while maintaining the same levels of protection. © 2021 The Institute of Electronics

Monetary Fair Battery-based Load Hiding Scheme for Multiple Households in Automatic Meter Reading System

Automatic Meter Reading (AMR) system is expected to be used for real time load monitoring to optimize power generation and energy efficiency. Recently, it has been a serious problem that user’s lifestyle may be revealed by a tool to estimate consumer’s lifestyle from a real-time load profile. In order to solve this issue, Battery-based Load Hiding ( BLH ) algorithms are proposed to obfuscate an actual load profile by charging and discharging. Although such BLH algorithms have already been studied, it is important to consider multiple households case where one battery is shared among them due to its high cost. In this paper, a monetary fair BLH algorithm for multiple households is proposed. In presented scheme, the core unit calculates the difference between the charged amount and discharged one for each household. If the difference is bigger than the predefined threshold (monetary unfair occurs), the most disadvantageous and advantageous households are given priority to discharge and charge the battery and other households should charge to achieve monetary fairness. The efficiency of the scheme is demonstrated through the computer simulation with a real dataset