Improved yoking proof protocols for preserving anonymity

International Journal of Information Security - In emerging RFID applications, the yoking proof provides a method not only to ensure the physical proximity of multiple objects but also to verify...     

Improving the performance of cell-loss recovery in ATM networks

A new method for improving the performance of cell-loss recovery using FEC (forward error correction) in ATM networks is proposed. This method provides more correcting coverage than existing methods     

An energy-efficient interface selection for multi-mode terminals by utilizing out-of-band paging channels

With the advent of a number of wireless network technologies such as WCDMA and WLAN, current mobiles are equipped with multiple network interfaces, so called Multi-Mode Terminal (MMT). MMTs are capable to access different kinds of networks by performing a vertical handover between heterogeneous wireless networks, where during the idle state, the MMTs consume a lot of energy since their WLAN interface must wake up for listening to periodical beacons. However, previous studies on the vertical handover did not address how to select the optimal interface taking into account the characteristics of MMTs, especially energy consumption. Therefore, in this paper, we propose an energy-efficient interface selection scheme for MMTs in the integrated WLAN and cellular networks. The proposed interface selection scheme takes advantage of existing out-of-band paging channel of cellular networks, so that the WLAN interface can be completely turned off during the idle state leading to reduction in energy consumption. Simulation results show that the proposed scheme outperforms conventional approaches in terms of energy consumption with reduced signaling overhead and handover delay.     

A Study on Deflection Routing in Optical Burst-Switched Networks

A major concern in optical burst-switched networks is contention,which occurs when multiple bursts contend for the same link. While a deflection routing protocol is proposed as one of the contention resolution techniques,there has been no appropriate deflection routing algorithm to find an alternate route. In this paper, we formulate a deflection routing problem based on the burst blocking rate resulting from resource contention in an optical burst-switched network. This algorithm minimizes the contention on the alternate path with the minimum distance. Furthermore, in this paper, we develop an analytical model for the deflection routing time when deflection routing is performed to resolve contention. In this model, we investigate the expected deflection routing time considering that the burst could be dropped even with deflection routing due to another contention on the alternate path. Simulations are conducted to show that there is an improvement in terms of burst loss rate and network throughput.     

A Novel Robust Routing Scheme Against Rushing Attacks in Wireless Ad Hoc Networks

Standard on-demand routing protocols in wireless ad hoc networks were not originally designed to deal with security threats. Because of that, malicious users have been finding ways to attack networks. Rushing attacks represent one of such possibilities. In these attacks, malicious nodes forward the Route Request (RREQ) packets, asking for a route, to the destination node quicker than the legitimate nodes do. This is possible because the legitimate nodes only forward the first received RREQ packet for a given route discovery. Besides, the attackers can tamper with either the Medium Access Control or routing protocols to get faster processing. As a result, the path through the malicious nodes is chosen, which renders throughput degradation. We propose here a novel, robust routing scheme to defend ad hoc networks against rushing attacks. Our scheme utilizes the “neighbor map mechanism” to establish robust paths as far as rushing attacks are concerned. The proposed scheme also improves path recovery delay by using, whenever it is possible, route maintenance rather than route discovery. Yet, it is energy efficient. The simulation results show that our proposal is indeed viable.     

Dynamic Deflection Routing with Virtual Wavelength Assignment in Optical Burst-Switched Networks

In optical burst-switched networks, one of the most significant issues is contention resolution. There have been several deflection routing techniques as contention resolution. While contention is resolved by traditional deflection routing, it cannot guarantee that the control packet will reserve all the wavelengths successfully to the destination on the alternate path, especially when traffic load in a network is high. Therefore, in this paper, we propose a Deflection Routing with Virtual Wavelength Assignment (DR-VWA) algorithm in order to provide a higher resource guarantee for loss-sensitive traffic bursts. The proposed DR-VWA scheme (1) dynamically decides the alternate path with the least traffic load and (2) allows high-priority bursts in terms of loss to be assigned available wavelengths over the path virtually. The proposed scheme is evaluated through simulation, and it is shown that significant improvement with regard to burst loss and wavelength conversion cost can be achieved.This work was supported in part by the Korea Science and Engineering Foundation (KOSEF) through OIRC project and by the US National Communications System (NCS).     

A dynamic load-aware congestion control scheme in optical burst switching networks

The most important design goal in Optical Burst Switching (OBS) networks is to reduce burst loss resulting from resource contention. Especially, the higher the congestion degree in the network is, the higher the burst loss rate becomes. The burst loss performance can be improved by employing an appropriate congestion control. In this paper, to actively avoid contentions, we propose a dynamic load-aware congestion control scheme that operates based on the highest (called ‘peak load’) of the loads of all links over the path between each pair of ingress and egress nodes in an OBS network. We also propose an algorithm that dynamically determines a load threshold for adjusting burst sending rate, according to the traffic load in a network. Further, a simple signalling method is developed for our proposed congestion control scheme. The proposed scheme aims to (1) reduce the burst loss rate in OBS networks and (2) maintain reasonable throughput and fairness. Simulation results show that the proposed scheme reduces the burst loss rate significantly, compared to existing OBS protocols (with and without congestion control), while maintaining reasonable throughput and fairness. Simulation results also show that our scheme keeps signalling overhead due to congestion control at a low level.     

Dropping Policy with Burst Retransmission to Improve the Throughput of TCP Over Optical Burst-switched Networks

A major concern in optical burst-switched (OBS) networks is contention, which occurs when more than one bursts contend for the same data channel at the same time. Due to the bufferless nature of OBS networks, these contentions randomly occur at any degree of congestion in the network. When contention occurs at any core node, the core node drops bursts according to its dropping policy. Burst loss in OBS networks significantly degrades the throughput of TCP sources in the local access networks because current TCP congestion control mechanisms perform a slow start phase mainly due to contention rather than heavy congestion. However, there has not been much study about the impact of burst loss on the performance of TCP over OBS networks. To improve TCP throughput over OBS networks, we first introduce a dropping policy with burst retransmission that retransmits the bursts dropped due to contention, at the ingress node. Then, we extend the dropping policy with burst retransmission to drop a burst that has experienced fewer retransmissions in the event of contention at a core node in order to reduce the number of events that a TCP source enters the slow start phase due to contention. In addition, we propose to limit the number of retransmissions of each burst to prevent severe congestion. For the performance evaluation of the proposed schemes, we provide an analytic throughput model of TCP over OBS networks. Through simulations as well as analytic modeling, it is shown that the proposed dropping policy with burst retransmission can improve TCP throughput over OBS networks compared with an existing dropping policy without burst retransmission.