The integration of VANETs with Internet is required if vehicles are to access IP-based applications. A vehicle must have an IP address, and the IP mobility service should be supported during the movement of the vehicle. VANET standards such as WAVE or C-ITS use IPv6 address auto configuration to allocate an IP address to a vehicle. In C-ITS, NEMO-BS is used to support IP mobility. The vehicle moves rapidly, so reallocation of IP address as well as binding update occurs frequently. The vehicle' communication, however, may be disrupted for a considerable amount of time, and the packet loss occurs during these events. Also, the finding of the home address of the peer vehicle is not a trivial matter. We propose a network based identifier locator separation scheme for VANETs. The scheme uses a vehicle identity based address generation scheme. It eliminates the frequent address reallocation and simplifies the finding of the peer vehicle IP address. In the scheme, a network entity tracks the vehicles in its coverage and the vehicles share the IP address of the network entity for their locators. The network entity manages the mapping between the vehicle's identifier and its IP address. The scheme excludes the vehicles from the mobility procedure, so a vehicle needs only the standard IPv6 protocol stack, and mobility signaling does not occur on the wireless link. The scheme also supports seamlessness, so packet loss is mitigated. The results of a simulation show that the vehicles experience seamless packet delivery.

Three representative protocols are proposed to support mobility for IPv6 in IETF: Mobile IPv6, Hierarchical Mobile IPv6, and Fast Handovers for Mobile IPv6. Recently, IEEE 802.11 network has been widely deployed in public areas for mobile Internet services. In the near future, IPv6 mobility support over IEEE 802.11 network is expected to be a key function to actualize the pure IP-based mobile multimedia service. The IPv6 mobility support protocols have their characteristics in terms of signaling, handover latency, lost packets, and required buffer size. In this paper, we analyze the performance of the protocols over IEEE 802.11 network. We define a packet-level traffic model and a system and mobility model. Then, we construct a framework for the performance analysis. We also make cost functions to formalize each protocol's performance. Lastly, we investigate the effect of varying parameters used to show diverse numerical results.

In this paper, Proxy Mobile IPv6 (PMIPv6), which is a network-based mobility management protocol, is adapted to the OpenFlow architecture. Mobility-related signaling is generally performed by network entities on behalf of a mobile node, but in standard PMIPv6, the control and data packets are delivered and processed over the same network entities, which prevents the separation of the control and the data planes. In addition, IP tunneling inherent to PMIPv6 imposes excessive overhead for the network entities. In order to adapt PMIPv6 to the OpenFlow architecture, the mobility management function is separated from the PMIPv6 components, and components are reconstructed to take advantage of the offerings of the OpenFlow architecture. The components configure the flow table of the switches located in a path, which comprise the OpenFlow controller. Mobility-related signaling can then be performed at the dedicated secure channel, and all of the data packets can be sent normally in accordance with the flow table of the OpenFlow switches. Consequently, the proposed scheme eliminates IP tunneling when user traffic is forwarded and separates the data and the control planes. The performance analysis revealed that the proposed scheme can outperform PMIPv6 in terms of the signaling cost, packet delivery cost, and handover latency.

Target Q coverage is needed to secure the stability of data collection in WSN. The targets may have different level of importance then the multiple-target coverage scheme must schedule sensors according to each target's weight to increase the network lifetime. The schedule scheme previously proposed for weighted coverage uses an iterative solution to solve the problem but it has long computation time. We propose a heuristic greedy-TQC algorithm to use the residual energy of sensors to generate multiple scheduling cover sets. A simulation shows a dramatic reduction in computation time. The greedy-TQC algorithm is suitable for the frequently topology-changing WSN and for the often changing targets' weights in WSN.

The TMN that appears to operate the various communication networks generally and efficiently is developed under the different platform environment such as the different hardware and the different operating system. One of the main problems is that all the agents of the TMN system must be duplicated and maintain the software and the data blocks that perform the identical function. Therefore, the standard of the Q3 interface development cannot be defined and the multi-platform cannot be supported in the development of the TMN agent. In order to overcome these problems, the Farming methodology that is based on the Farmer model has been suggested. The main concept of the Farming methodology is that the software and the data components that are duplicated and stored in each distributed object are saved in the Platform Independent Class Repository (PICR) by converting into the format of the independent componentware in the platform, so that the componentwares that are essential for the execution can be loaded and used statically or dynamically from PICR as described in the framework of each distributed object. The distributed TMN agent of the personal communication network is designed and developed by using the Farmer model.

Most routing protocols in MANET use IP addresses as one of the most important routing information. To implement the routing protocol of MANET, the IP assignment in MANET should be solved. Allocating IP addresses is one of current key issues in the MANET, due to the absence of a centralized agent server. Previous methods require a large address space or can not use all the IP addresses of the given IP address space. For that reason, many IP addresses remain unused. To resolve this, we propose an IP address assignment protocol that uses the contiguous IP address assignment strategy without unused IP addresses. Simulations perform on ns-2 and confirm the viability of our protocol.

Proxy Mobile IPv6 (PMIPv6) is proposed as a new network-based local mobility protocol which does not involve the Mobile Node (MN) in mobility management. PMIPv6, which uses link-layer attachment information, reduces the movement detection time and eliminates duplicate address detection procedures in order to provide faster handover than Mobile IPv6 (MIPv6). To eliminate packet loss during the handover period, the Local Mobility Anchor (LMA) buffering scheme is proposed. In this scheme, the LMA buffers lost packets of the Mobile Access Gateway (MAG) and the MN during the handover and recovers them after handover. A new Automatic Repeat reQuest (ARQ) handler is defined which efficiently manages the LMA buffer. The ARQ handler relays ARQ result between the MAG and the MN to the LMA. The LMA removes any buffered packets which have been successfully delivered to the MN. The ARQ handler recovers the packet loss during the handover using buffered packets in the LMA. The ARQ information, between the MAG and LMA, is inserted in the outer header of IP-in-IP encapsulated packets of a standard PMIPv6 tunnel. Since the proposed scheme simply adds information to the standard operation of an IP-in-IP tunnel between the LMA and the MAG, it can be implemented seamlessly without modification to the original PMIPv6 messages and signaling sequence. Unlike other Fast Handovers for Mobile IPv6 (FMIPv6) based enhancement for PMIPv6, the proposed scheme does not require any handover related information before the actual handover.

To access Internet services supported in a home network, a mobile node must obtain the right to use an access network, and it must be able to contact a home network gateway to access the Internet in the home network. This means that the device must be authenticated by an AP to use the access network, and it must additionally be authenticated by the home network gateway to access its home network. EAP-PEAP is currently the most commonly used authentication protocol in access networks, and IKEv2 is common security protocol for mutual authentication on the Internet. As the procedures in EAP-PEAP and IKEv2 are quite similar, EAP-PEAP can be replaced by IKEv2. If the access network authentication uses IKEv2-based protocols and the home network authentication also uses IKEv2, the IKEv2 messages exchanged in each authentication become duplicated. However, it should be noted that EAP-IKEv2 is not able to carry EAP exchanges. We propose a hybrid authentication mechanism that can be used to authenticate a mobile node for both networks simultaneously. The proposed mechanism is based on the IKEv2-EAP exchanges instead of the EAP exchanges currently used to authenticate the access network, but our scheme adopts the encapsulation method defined by EAP-IKEv2 to transport the IKEv2 message over IEEE 802.11 so as not to change the current access network authentication architecture and the message format used by the authentication protocols. The scheme authenticates both networks through a single IKEv2 authentication, rather than two authentication procedures - one for the access network and one for the home network. This reduces the number of exchanged messages and authentication time.

Enforcing access control policies in Information-Centric Networking (ICN) is difficult due to there being multiple copies of contents in various network locations. Traditional Access Control List (ACL)-based schemes are ill-suited for ICN, because all potential content distribution servers should have an identical access control policy or they should contact a centralized ACL server whenever their contents are accessed by consumers. To address these problems, we propose a distributed capability access control scheme for ICN. The proposed scheme is composed of an internal capability and an external capability. The former is included in the content and the latter is added to a request message sent from the consumer. The content distribution servers can validate the access right of the consumer through the internal and external capabilities without contacting access control policies. The proposed model also enhances the privacy of consumers by keeping the content name and consumer identification anonymous. The performance analysis and implementation show that the proposed scheme is feasible and more efficient than other access control schemes.

Named Data Networking (NDN) has emerged as an alternative to traditional IP-based networking for the achievement of Information-Centric Networking (ICN). Currently, most NDN is deployed over IP networks, but such an overlay deployment increases the transport network overhead due to the use of dual network control planes (NDN routing and IP routing). Software-Defined Networking (SDN) can be used to mitigate the network overhead by forwarding NDN packets without the use of IP routing. However, to deploy NDN over SDN, a variable NDN content name needs to be mapped to a fixed-size match field in an OpenFlow switch flow table. For efficient support of such a mapping task, we propose a new architecture that uses dual name for content: content name and Name Tag. The Name Tag is derived from the corresponding content name and is a legitimate IPv6 address. By using the proposed Name Tag, the SDN with an NDN control application can transport an IPv6 packet that encapsulates an NDN packet for an NDN name-based routing. We emulate the proposed architecture using Mininet and verify that it is feasible.

Random scattering of sensors may cause some location not to be covered. In such a case, it is useful to make use of mobile sensors that can move to eliminate the coverage holes. Wang et al [1]. proposed self-deployment schemes of mobile sensors by using Voronoi polygon. However, some coverage holes still remain after the execution of the schemes. We propose a new self-deployment scheme using the centroid (geometric center) of each sensor's Voronoi polygon as the moving target position. The performance evaluation shows that the proposed scheme achieves better results than the existing schemes in terms of fast coverage expansion.

As the active safety of vehicles has become essential, vehicular communication has been gaining attention. The IETF IPWAVE working group has proposed the shared prefix model-based vehicular link model. In the shared prefix model, a prefix is shared among RSUs to prevent changes in IPv6 addresses of a vehicle within a shared prefix domain. However, vehicle movement must be tracked to deliver packets to the serving RSU of the vehicle within a shared prefix domain. The Identifier/Locator Separation Protocol (ILSP) is one of the techniques used to handle vehicle movement. It has several drawbacks such as the inability to communicate with a standard IPv6 module without special components and the requirement to pass signaling messages between end hosts. Such drawbacks severely limit the service availability for a vehicle in the Internet. We propose an ILSP for a shared prefix model over IEEE WAVE IPv6 networks. The proposed protocol supports IPv6 communication between a standard IPv6 node in the Internet and a vehicle supporting the proposed protocol. In addition, the protocol hides vehicle movement within a shared prefix domain to peer hosts, eliminating the signaling between end hosts. The proposed protocol introduces a special NDP module based on IETF IPWAVE vehicular NDP to support vehicular mobility management within a shared prefix domain and minimize link-level multicast in WAVE networks.