Experimentation and performance analysis of multi-interfaced mobile router scheme

Network mobility (NEMO) aims providing seamless Internet connectivity of the whole mobile network that consists of mobile routers (MRs) and mobile network nodes (MNNs). The network moves around along with vehicles as a whole. According to NEMO basic support protocol (NEMO BSP), only one primary care of address (CoA) of MR can be registered with home agent, which will affect the handover performance. As an extension of NEMO BSP, multiple care of addresses (MCoA) registration scheme was proposed as Internet-draft and has received extensive researches.This paper studies the Internet connectivity of mobile router (MR) on the basis stated above; MR is equipped with WLAN, CDMA and GPRS interfaces simultaneously. Concretely, a smooth handover algorithm is proposed and experimented on our platform successfully; round trip time (RTT) of each link and the handover process between different interfaces are analyzed, respectively. Furthermore, the service disruption time and packet loss ratio performances are also compared between uni-interfaced MR scheme of NEMO BSP and scheme proposed in this paper, and the results indicate that multi-interfaced scheme not only supports large area movement across heterogeneous networks of MR, it also provides a seamless handover with no packet loss and little service disruption time.     

Design and implementation of light-weight mobile multicast for fast MIPv6

Mobile multicast is a research hotspot and can provide many applications. Some mobile multicast schemes have been proposed, but most of them introduce new entities and study construction algorithms of the dynamic multicast delivery structure which is heavyweight for wireless devices. In this paper, we propose a light-weight mobile multicast (LMM) scheme for Fast Mobile IPv6 which reduces the redundant operational overhead by simplifying multicast listener discovery (MLD) proxying. The LMM scheme implements simplified MLD proxying function on home agent to reduce the complicated multicast routing protocol and modifies MLD host part function on mobile node to reduce the multicast membership messages interaction. In order to solve the tunnel convergence problem, LMM also introduces a multicast tunnel combination and reconstruction algorithm. We set up a test-bed to evaluate the performance of LMM, and compare it with other mobile multicast schemes. The experimental results show that LMM reduces the multicast disruption time at handover. Based on the experimental results, we analyze the cost of LMM, and the results show that it has lower protocol cost than other schemes.     

Managing Clouds, Smart Networks and Services: A Report on APNOMS 2011

This article presents a report on APNOMS 2011, which was held September 21–23, 2011 in Taipei, Taiwan. The theme of APNOMS 2011 was “Managing Clouds, Smart Networks and Services.”     

Secure centralized spectrum sensing for cognitive radio networks

Spectrum utilization becomes more and more important while new communication techniques keep increasing and the spectrum bands remain finite. Cognitive radio is a revolutionary technology to make use of the spectrum more effectively. In order to avoid the interference to the primary user, spectrum sensing must be sensitive and reliable. Cooperative spectrum sensing (CSS) is one of the ways to increase the reliability of spectrum sensing. The information fusion technique is a key component of CSS. In this paper, we proposed a novel fusion scheme based on spatial correlation technique. We utilize geographical information with reputational weights to propose a two-level fusion scheme called secure centralized spectrum sensing (SCSS). The simulation results show that as the attackers present high density aggregation at some areas, the correct sensing ratio of SCSS is increasing as well even when the number of attackers is very large.     

An Architecture and Communication Protocol for IPv6 Pack-Based Picocellular Networks

In this paper, micro mobility problems in handoff binding latency in Mobile IPv6 and the enhanced Cellular Mobile IPv6 (CMIv6) are investigated using a new extension protocol. Frequent and fast movements usually characterize micro mobility. An enhanced handoff extension is adopted to solve the Mobile IPv6 handoff break in a micro mobility environment. The basic idea involves using the new field in the IPv6 header, flow label, to assist the foreign router delivering packets to the mobile node. The Foreign Home Agent (FHA) is a new defined node in this proposition. FHA can accurately deliver packets according to the mobile node IP address even though the new binding messages have not arrived at the CN. The simulations shown in this paper prove that the enhanced CMIv6 scheme can minimize packet loss during handoffs.     

Constructing secure group communication over wireless ad hoc networks based on a virtual subnet model

Recently, more and more people have begun using mobile devices such as PDAs and notebooks. Our lives have been profoundly affected by such devices. A MANET, a mobile ad hoc network, is an effective networking system facilitating an exchange data between mobile devices, without the support of wireless access points and base stations. A MANET is not restricted to unicast or multicast communication, but can also provide "many-to-many" transmission, which can be treated as a group communication. Until recently, however, the way in which such groups are formed had not drawn much attention. Because communication in wireless networks is broadcast and a certain amount of devices can receive transmitted messages, the risk of unsecured sensitive information being intercepted by unintended recipients is a real concern. Consequently, efforts to ensure the security of group communications in MANETs are essential. This article proposes a virtual subnet model to construct secure group communication over a MANET. With the model, the composition of groups is established as the forming of group keys. Our results show that this approach can completely satisfy the needs for both security and efficiency.     

Threshold jumping and wrap-around scan techniques toward efficient tag identification in high density RFID systems

With the emergence of wireless RFID technologies, the problem of Anti-Collision has been arousing attention and instigated researchers to propose different heuristic algorithms for advancing RFID systems operated in more efficient manner. However, there still have challenges on enhancing the system throughput and stability due to the underlying technologies had faced different limitation in system performance when network density is high. In this paper, we present a Threshold Jumping (TJ) and a Wrap-Around Scan (WAS) techniques, which are query tree based approaches, aiming to coordinate simultaneous communications in high density RFID environments, to speedup tag identification, to increase the overall read rate and to improve system throughput in large-scale RFID systems. The main idea of the Threshold Jumping is to limit the number of collisions. When the number of collisions exceeds a predefined threshold, it reveals that tag density in RF field is too high. To avoid unnecessary enquiry messages, the prefix matching will be moved to next level of the query tree, alleviating the collision problems. The method of setting frequency bound indeed improves the efficiency in high density and randomly deployed RFID systems. However, in irregular or imbalanced RFID networks, inefficient situation may happen. The problem is that the prefix matching is performed in single direction level-order scheme, which may cause an imbalance query tree on which the right sub-tree always not been examined if the identification process goes to next level before scan the right sub-tree due to threshold jumping. By scanning the query tree from right to left in alternative levels, i.e., wrap-around, this flaw cold be ameliorated. To evaluate the performance of proposed techniques, we have implemented the TJ and the WAS method along with the query tree protocol. The simulation results show that the proposed techniques provide superior performance in high density environments. It is shown that the TJ and WAS are effective in terms of increasing system throughput and minimizing identification delay.     

A novel user’s authentication scheme for pervasive on-line media services

Due to the explosive growth of the Internet and the pervasion of multimedia, protection of intellectual property (IP) rights of digital content in transactions induces people’s concerns. Current security requirements and copyright protection mechanisms especially need to work in real-time and on-line for communication and networking. For media service systems in the Internet, user’s authentication is most essential in association with the access control of the media system. The authentication scheme is a trivial but crucial issue for maintaining user’s information. Up to now, many one-time password-based authentication schemes have been proposed. However, none is secure enough. The purpose of a one-time password (OTP) is to make it more difficult to gain unauthorized access to restricted resources. Traditionally static passwords can more easily be obtained by an unauthorized intruder given enough attempts and time. By constantly altering the password, as is done with a one-time password, this risk can be greatly reduced. These schemes are specially fit for media services in the Internet since they will frustrate the attacker’s attempt. Lin, Shen and Hwang proposed a strong-password authentication scheme in association with one-time password by using smart cards, and claimed their scheme can resist guess attack, replay attack, impersonation attack and stolen attack. Later, Ku, Tsai, and Chen showed that Lin-Shen-Hwang’s scheme suffers from a replay attack and a denial-of-service attack. Furthermore, Ku proposed a hash-based strong-password authentication scheme to enhance the security. In this paper, we show the weaknesses and devise some attacks against Ku’s scheme. Then, we revise Ku’s scheme and propose a novel user’s authentication scheme in pervasive on-line media services for current communication and networking.     

A Collision Alleviation Scheme for IEEE 802.11p VANETs

IEEE 802.11p protocol, also known as Wireless Access for the Vehicular Environment provides dedicated short range communication for future Vehicular Ad Hoc Networks (VANETs). According to the IEEE 802.11p standard, the highest priority traffic transmission often suffers from the consecutive collisions in bursty arrival or congested scenarios because of the naive pre-assumption of a low level of congestion in the system, and thus results in emergent messages delayed. In this paper, we propose a simple, but yet well performing collision alleviation scheme to alleviate intensive collisions between highest priority access categories which usually used to schedule emergency message since safety is the most critical and promising issue in VANET. In addition to theoretical analysis, simulations are conducted to evaluate its performance. The simulation results show that the proposed scheme can not only increase the achievable channel throughput of the legacy protocol at most 15%, but also reduce the average packet access delay of the legacy protocol at least 5% and the packet collision probability at most 60% in congested VANET environments.