Address Configuration Research Articles

체형에 따른 골프 어드레스 동작의 주요 관절각도 비교

This study was aimed at comparing selected joint angles at the golf address stance by categorizing three different body types. 43 elite male golfers were selected and 9 of them turned out to be the ectoderm while 24 of them to be the mesoderm. The remaining 10 subjects were the endoderm. The measurement was carried out at the address stance with the number 7 iron and the driver. The result showed that the angle of trunk flexion did not different among body types. The trunk tilting angle became more inclined to the right side, which confirmed the guidelines from most of golf lesson books, for bigger people since they tended to put more weight on the right foot. The angle of both knees showed similar but the right knee was bent more than the left knee. The target direction and body alignment faced more to the left side than the target spot because of the influence of open stance and natural aiming position. It seems that pelvis and knees turned a little bit more to the right side than the target direction in order to maintain the parallel. Overall, significant differences among body types were found at the trunk tilting angle and pelvis-target alignment and golf address configuration can be differentiate by these factors.

The seamless vertical handover between (universal mobile telecommunications system) UMTS and (wireless local area network) WLAN by using hybrid scheme of Bi-mSCTP in Mobile IP

Nowadays many different types of networks communicate among themselves to form heterogeneous wireless networks (HWN). Seamless vertical handover (VHO) between a Universal Mobile Telecommunications System (UMTS) and a Wireless Local Area Network (WLAN) is necessary to provide continuous internet access for mobile node (MN) as roaming across these networks is to be without interruption. To support the seamless VHO and smooth mobility in the HWN, a network layer protocol mobile IP (MIP) is exploited. MIP has several attendant issues such as hybrid routing, registration delay, data session disruption during VHO, and packet overhead. These issues occur when the data packets of the MIP are sent from a foreign agent (FA) to a home agent (HA) via a tunnel when a MN moves to a new network which will cause a triangle routing. In this paper, we propose a hybrid scheme of mobile stream control transmission protocol (mSCTP) with a bicasting mechanism or so- called Bi-mSCTP under the MIP to overcome the abovementioned triangle routing. When an MN is in the area of VHO, the proposed scheme relies on the generated mSCTP signals to allocate a new care-of- address (CoA) to the corresponding node (CN) dynamically before the link layer handover. At the same time, it inserts a bicasting flag inside the address configuration (ASCONF) data chunk to inform the CN to start the transmission over both WLAN and UMTS links. The system performances were analyzed by using the NS-2 simulation tool. The results showed that the hybrid scheme introduces approximately 1.02 and 2.64 seconds reduction in delay performance over both mSCTP and MIP schemes respectively. It also reduces the packet loss rate by more than 21.7 and 45% compared to mSCTP and MIP respectively.

Research on IPv6 address configuration for wireless sensor networks

AbstractThe paper proposes an IPv6 address configuration scheme for wireless sensor networks. In the scheme, one wireless sensor network is divided into multiple clusters and the scheme creates the IPv6 address formats for the cluster heads and the cluster members respectively. Based on the proposed IPv6 address format, the scheme proposes to adopt the division method of the hash function to allocate the IPv6 addresses for the cluster heads and cluster members and to utilize linear probing to deal with assigned address collision. From the perspectives of duplicate address detection cost, address configuration cost and address configuration delay time, the paper analyzes and compares the performances of Strong DAD, MANETConf and the proposed scheme. Analytical results demonstrate the effectiveness and efficiency of the proposed scheme. Copyright © 2010 John Wiley & Sons, Ltd.

Generic and automatic address configuration for data center networks

Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address configuration protocols such as DHCP require huge amount of manual input, leaving them error-prone. In this paper, we present DAC, a generic and automatic Data center Address Configuration system. With an automatically generated blueprint which defines the connections of servers and switches labeled by logical IDs, e.g., IP addresses, DAC first learns the physical topology labeled by device IDs, e.g., MAC addresses. Then at the core of DAC is its device-to-logical ID mapping and malfunction detection. DAC makes an innovation in abstracting the device-to-logical ID mapping to the graph isomorphism problem, and solves it with low time-complexity by leveraging the attributes of data center network topologies. Its malfunction detection scheme detects errors such as device and link failures and miswirings, including the most difficult case where miswirings do not cause any node degree change. We have evaluated DAC via simulation, implementation and experiments. Our simulation results show that DAC can accurately find all the hardest-to-detect malfunctions and can autoconfigure a large data center with 3.8 million devices in 46 seconds. In our implementation, we successfully autoconfigure a small 64-server BCube network within 300 milliseconds and show that DAC is a viable solution for data center autoconfiguration.

Performance analysis of movements detection with RA beaconing in wireless IP networks

In networks supporting Mobile IP (MIP), the address configuration of a Mobile Node (MN) is an important part of the handoff process, which is based on the detection of movement between different subnetworks. The movement detection in wireless IP network is usually performed by means of Router Advertisement (RA) messages which are sent with a fixed and constant period. The higher is the rate of these messages, the lower the handoff delay is and the higher is the bandwidth occupation on the wireless medium. To trade off these values, we propose a method to decrease the bandwidth occupation of movement detection messages while confining part of the L3 handoff setup latency under acceptable values, for instance 15 ms ÷ 40 ms. The benefit on the bandwidth occupation with respect to the constant rate technique is between 25% ÷ 40%, depending on the interval of advertisement messages. Our technique is based on the windowing of the RA messages trains, each window being placed at the predicted time instants of handoff arrivals.

MANET 환경에서 주소 영역기반 주소할당 분산기법

시간과 장소에 상관없이 인터넷 서비스를 제공 받고자 하는 인터넷 사용자들의 요구가 증가함에 따라 MANET(Mobile Ad-Hoc Network) 환경에서도 인터넷 연결성을 제공하기 위한 연구들이 주목을 받고 있다. 기존 DHCP(Dynamic Host Configuration Protocol) 기반 방식의 경우는 망 내 노드들에게 주소를 할당하기 위하여 다중 홉 거리에 있는 DHCP 서버와 메시지를 교환해야 하기 때문에 메시지 손실이 쉽게 발생할 수 있으며, 이로 인해 주소 설정의 안정성이 감소하고 주소 설정 시간이 증가하는 문제점이 있다. 따라서 본 논문에서는 노드가 DHCP 서버로부터 하나의 주소만을 할당 받는 것이 아니라 일정 크기의 주소 영역을 할당 받을 수 있게 하였다. 또한 주소 영역을 할당 받은 노드가 이웃의 주소 요청 노드들에게 자신의 주소 영역 중 일부를 할당할 수 있도록 하는 새로운 주소 설정 기법을 제안하였다. 모의 실험을 통하여 제안 기법이 기존 DHCP 기법에 비하여 주소 설정 시간과 제어 메시지 수 측면에서 각기 77%와 61%의 성능을 향상시킬 수 있음을 보였다. As it becomes increasingly important that Internet access is available anywhere at any time, providing MANET (Mobile Ad-Hoc Network) with the Internet access attracts more attention. The existing DHCP (Dynamic Host Configuration Protocol) address configuration schemes require message exchanges between MANET nodes and the DHCP server through multi-hop routes. Messages can be easily dropped in the wireless multi-hop communication environment and the address configuration may be instable and need long delay. In this paper, we propose a new address configuration scheme using the concept of address pool allocation. In the proposed scheme, the DHCP server assigns a part of its address pool to a node instead of a single address and the node can assign a part of its own address pool to its neighbor nodes. Through simulation studies, we show that our scheme yields about 77% of the address configuration delay and 61% of the control message overhead of the existing DHCP based mechanism.

Distributed address auto configuration protocol for Manet networks

Mobile ad hoc networks are wireless networks characterized by: limited bandwidth, shared transmission channel and the lack of central processing unit of administration and configuration. Most research related to Manet assures that host IP address is configured as the node joins the network. However, it is impossible to ensure that because there is no infrastructure. Therefore, an auto configuration scheme is needed to perform network management and to attribute connection parameters. Hence, we present a new distributed IP address configuration approach for Manet networks. Our solution provides a unique address allocation for each node in the network. The address assignment is assured under different network conditions including node failures, network partitioning and merging.

Route Optimization in Nested NEMO: Classification, Evaluation, and Analysis from NEMO Fringe Stub Perspective

Mobile IP is the basic solution to providing host mobility, whereas network mobility (NEMO) refers to the concept of the collective mobility of a set of nodes. The NEMO basic support protocol has been proposed in IETF as a first solution to the problem of network mobility. The main limitation of this basic solution is that it forces triangular routing, i.e., packets are always forwarded through the home agent (HA), following a suboptimal path. This is because each sub-NEMO obtains a care of address (CoA) that belongs to the home prefix of its parent mobile router. Such a CoA is not topologically meaningful in the current location, since the parent mobile router could also be away from home, and hence, packets addressed to the CoA are forwarded through the HA of the parent NEMO. To solve this problem, various extended proposals, with differing approaches and goals, exist for route optimization (RO) in NEMO applications. Their influences on the RO performance have been evaluated by classifying the detailed operations performed within the nested NEMO network, and then each category is analyzed in detail. The modeling of the detailed RO operation is intended to quantify the tradeoffs between the different approaches in order to provide a basis for the selection decision. In particular, the proposed grouping of the different proposals, based on their address configuration strategy, clarifies their similarities and differences, and provides some useful insights into the various methods that have been developed. In conclusion, it is suggested that, when choosing a solution for deploying NEMO, the designer has to balance his choices between the different pros and cons, and the different cases of application that are derived in this paper.

The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks

A number of IEEE 802.15.4 devices can form a tree topology as proposed by ZigBee specification. The ability to confine the shape and extent of the tree serves as the basis for address configuration and packet routing. This paper identifies the room shortage problem in tree-based ZigBee networks, which refers to the phenomenon that some devices are unable to get addresses while many addresses are still left unused. Room shortage problem occurs when pre-allocated address space does not well match the underlying physical topology. To alleviate the problem, we developed three alternatives to the standard addressing mechanism. These approaches manage address space with flexibility yet still support tree-based routing. Performance evaluations indicate that proposed approaches provide different levels of tradeoff between the ratio of addressable devices and storage overhead.

Building an IP-based community wireless mesh network: Assessment of PACMAN as an IP address autoconfiguration protocol

Wireless mesh networks are experiencing rapid progress and inspiring numerous applications in different scenarios, due to features such as autoconfiguration, self-healing, connectivity coverage extension and support for dynamic topologies. These particular characteristics make wireless mesh networks an appropriate architectural basis for the design of easy-to-deploy community or neighbourhood networks. One of the main challenges in building a community network using mesh networks is the minimisation of user intervention in the IP address configuration of the network nodes. In this paper we first consider the process of building an IP-based mesh network using typical residential routers, exploring the options for the configuration of their wireless interfaces. Then we focus on IP address autoconfiguration, identifying the specific requirements for community mesh networks and analysing the applicability of existing solutions. As a result of that analysis, we select PACMAN, an efficient distributed address autoconfiguration mechanism originally designed for ad-hoc networks, and we perform an experimental study – using off-the-shelf routers and assuming worst-case scenarios – analysing its behaviour as an IP address autoconfiguration mechanism for community wireless mesh networks. The results of the conducted assessment show that PACMAN meets all the identified requirements of the community scenario.

Seamless Mobility Management in IP-based Wireless/Mobile Networks with Fast Handover

The challenges of rapidly growing numbers of mobile nodes in IPv6-based networks are being faced by mobile computing researchers worldwide. Recently, IETF has standardized Mobile IPv6 and Fast Handover for Mobile IPv6 (FMIPv6) for supporting IPv6 mobility. Even though existing literatures have asserted that FMIPv6 generally improves MIPv6 in terms of handover speed, they did not carefully consider the details of the whole handover procedures. Therefore, in conventional protocols, the handover process reveals numerous problems manifested by a time-consuming network layer based movement detection and latency in configuring a new care of address with confirmation. In this article, we study the impact of the address configuration and confirmation procedure on the IP handover latency. To mitigate such effects, we propose a new scheme which can reduce the latency taken by the movement detection, address configuration and confirmation from the whole handover latency. Furthermore, a mathematical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with the current procedures, while our approach is focused on the reduction of handover latency. Finally, we demonstrate total handover scenarios for the proposed techniques and discussed the major factors which contribute to the handover latency.

Scheme on implementing interconnection between wireless sensor networks and IPv6 networks

The author proposed and designed a model to implement a seamless communication between a Wireless Sensor Network(WSN) and an IPv6 network.This model creates an automatic address configuration algorithm in a sensor network and based on the algorithm this model performs automatic routing and addressing.In addition,this model puts forward a reduced IPv6 protocol stack to save a sensor node's power.This model was implemented on an experimental platform and in a simulation environment respectively,and its performance was analyzed.The experimental results prove the validity and correctness of this model.

Improving peer connectivity in wide-area overlays of virtual workstations

Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized hole-punching to establish bi-directional communication links among nodes behind network address translators, and dynamic configuration of virtual IP addresses. Our experiences with deployments of virtual networks in support of wide-area overlays of virtual workstations (WOWs) reveal that connectivity constraints imposed by symmetric NATs and by Internet route outages often hinder P2P overlay structure maintenance and routability, subsequently limiting the ability of WOWs to deliver high-throughput computing through aggregation of resources in different domains.In this paper, we describe and evaluate two novel approaches which are generally applicable and fully decentralized, and show that they improve routability of structured P2P networks in such connectivity constrained environments: (1) a fault-tolerant routing algorithm based on simulated annealing from optimization theory, and (2) tunneling of connections between adjacent nodes (in the P2P identifier space) over common neighbors when direct communication is not possible. Simulation-based analyses show that (1) when pairs of nodes only have 70% chance of being able to communicate directly, the described approaches improve all-to-all routability of the network from 90% to 99%, and (2) even when only 70% of the nodes are behind NATs that include symmetric NATs, these techniques improve the all-to-all connectivity of the network from less than 95% to more than 99%. We have implemented these techniques in the IP-over-P2P (IPOP) virtual network and have conducted experiments with a 180-node WOW Condor pool, demonstrating that, at 81% probability of establishing a pair-wise connection, annealing and tunneling combined allow all nodes to be connected to the pool, compared to only 160 nodes in the absence of these techniques.

Energy efficient node addressing scheme in self-organised sensor networks

Sensor networks are envisioned to support autonomous and spontaneous networking for a wide range of applications such as environment monitoring. Due to energy constraints, it is difficult for wireless sensor nodes to handle heavy protocol stacks with a large protocol overhead. In this paper, we present a novel address auto configuration scheme, which we call SMallest-size sensor AddRess auToconfiguration scheme (SMART), to configure potential shortest-size local unique addresses for sensor networks with energy efficiency. SMART achieves energy efficiency in three ways. First, it automatically configures node address within a potential smallest address space for a number of sensor nodes, in order to achieve the small address size. Second, it avoids address conflicts during the address configuration. Third, it configures addresses with a small configuration overhead and achieves load balance among sensor nodes.

ADIP: an improved authenticated dynamic IP configuration scheme for mobile ad hoc networks

Dynamic IP configuration is a major requirement for mobile ad hoc networks that grows from one node to many. Recently, a number of schemes for such IP assignments have been proposed in the literature. But very few of them consider security aspects while assigning the addresses among the nodes. In this paper, we propose an authenticated dynamic IP configuration scheme that can securely allocate IP addresses to the individual nodes of a MANET. In this scheme, each node of a MANET can generate new unique IP address from its own IP address for a new authenticated host. The authentication for address configuration is done with the help of a trusted third party and as such it is capable of handling the security threats associated with a general dynamic IP configuration. Performance analysis and simulation results show that, even while deploying the security attributes, the communication overhead and addressing latency of our proposed addressing scheme are at par with and in some cases much better than some popular similar existing schemes.

Dynamic address autoconfiguration in hybrid ad hoc networks

The use of ad hoc networking technologies is emerging as a viable and cost-effective solution to extend the range of traditional wireless local area networks (WLANs). In these networks, mobile client traffic reaches the access points through multi-hop wireless paths that are established by using an ad hoc routing protocol. However, several technical challenges have to be faced in order to construct such an extended WLAN. For instance, traditional autoconfiguration protocols commonly used in infrastructure-based WLANs, such as DHCP or Zeroconf, are not directly applicable in multi-hop wireless networks. To address this problem, in this paper we propose extensions to DHCP to enable the dynamic allocation of globally routable IPv4 addresses to mobile stations in hybrid ad hoc networks, which transparently integrate conventional wired technologies with wireless ad hoc networking technologies. Some of the attractive features of our solution are its ability to cope with node mobility, the introduction of negligible protocol overheads, and the use of legacy DHCP servers. We have implemented a prototype of our scheme, and tested its functionalities considering various topology layouts, network loads and mobility conditions. The experimental results show that our solution ensures short address configuration delays and low protocol overheads.

An Enhanced Multihoming Support Scheme with Proxy Mobile IPv6 for Convergent Networks

This paper analyzes the limitations of the multihoming support in the Proxy Mobile IPv6 protocol, then proposes an enhanced multihoming support scheme based on a per-interface address configuration method. The proposed scheme can provide a more flexible multihoming support and also maintain application session continuity during a handoff between two interfaces by using IPv6 extension headers. Plus, flow distribution with filters is also used to realize the advantages of multihoming. Simulation results with the OPNET validate the proposed multihoming support scheme for convergent networks.

Hybrid Address Configuration for Tree-based Wireless Sensor Networks

This letter proposes a new scheme to alleviate the issue on address acquisition failure in wireless sensor networks (WSNs). The basic idea is to use a hierarchical address structure to make the proposed scheme less susceptible to physical distribution of WSN devices. Simulation results show that the new scheme significantly reduces the failure probability.

IPv6 네트워크 환경에서 MCGA를 고려한 통합적인 보안관리 방안

32비트의 IPv4 주소고갈의 문제를 해결하고 보안과 QoS를 확실히 보장해 주기 위해 등장한 IPv6는 특성상 128비트로 증가된 주소공간과 네트워크를 효율적으로 관리하기 위한 주소체계, 이웃 탐색 및 주소 자동 설정 등 다양한 서비스 제공을 위해 노드와 라우터간의 주고받는 새로운 메시지들이 많이 추가되었다. 결과 IPv4에서 존재하던 공격은 물론 예측하지 못했던 새로운 공격들이 많이 등장하게 된다. IPv4에서 성공적으로 IPv6로 전환하기 위해 무엇보다 필요한 것은 안전하고 체계적인 보안 정책기반 아래 기존에 동작되고 있는 IPv4 호스트 및 라우터와 IPv6의 안전한 호환성이다. 따라서 관리자는 앞으로 도래 할 IPv6 네트워크 환경을 효율적으로 관리하기 위해서 다양한 측면에서 보안 문제를 도출하여 통합적인 보안 대응 방안을 설계해야 한다. 본 논문에서는 IPv4와 IPv6의 특성을 파악하고, IPv4/IPv6에서의 공격 측면에서 보안 취약성 분석 및 보안 문제를 도출하여 시스템 측면, IPv6 특성별 측면, 개선된 CGA인 MCGA (Modified Cryptographically Generated Address)의 제안을 통해 IPv6에서의 효율적인 보안 관리를 위한 통합적인 대응방안을 제시한다. IPv6 has appeared for solving the address exhaustion of IPv4 and for guaranteeing the problems of security and QoS. It occurs the unexpected new attacks of IPv6 as well as the existing attacks of IPv4 because of the increasing address space to 128bits and the address hierarchies for efficient network management and additions of the new messages between nodes and routers like neighbor discovery and auto address configuration for the various comfortable services. For the successful transition from IPv4 to IPv6, we should get the secure compatibility between IPv4 hosts or routers working based on secure and systematic policy and IPv6. Network manager should design security technologies for efficient management in IPv4/IPv6 co-existence network and IPv6 network and security management framework designation. In this paper, we inspected the characteristics of IPv4 and IPv6, study on security requirement for efficient security management of various attacks, protocol, service in IPv4/IPv6 co-existence and IPv6 network, and finally suggest integrated solution about security vulnerability of IPv6 network in considering of analysis of IPv6 system, host and application, IPv6 characteristics, modified CGA(MCGA).

Taxonomy and Analysis of IP Micro‐Mobility Protocols in Single and Simultaneous Movements Scenarios

The micro‐mobility is an important aspect in mobile communications, where the applications are anywhere and used anytime. One of the problems of micro‐mobility is the hand‐off latency. In this paper, we analyse two solutions for IP micro‐mobility by means of a general taxonomy. The first one is based on the Stream Control Transmission Protocol (SCTP), which allows the dynamic address configuration of an association. The second one is based on the Session Initiation Protocol (SIP), which is the most popular protocol for multimedia communications over IP networks. We show that for the SCTP solution, there is room for further optimisations of the hand‐off latency by adding slight changes to the protocol. However, as full end‐to‐end solution, SCTP is not able to handle simultaneous movement of hosts, whose probability in general cannot be neglected. On the other hand, the SIP can handle both single and simultaneous movements cases, although the hand‐off latency can increase with respect to the SCTP solution. We show that for a correct and fast hand‐off, the SIP server should be statefull.