• Physical Therapy Rehabilitation Science
• /
• v.11 no.4
• /
• pp.464-470
• /
• 2022

Objective: Axillary web syndrome (AWS) is a condition comprising fibrous band-like cords that appear in the axilla of patients after axillary lymph node dissection (ALND) during breast cancer surgery and result in pain and reduced mobility. The cords appearing with AWS are hardened veins or lymphatic vessels. Manual therapy and stretching are recommended for pain control and mobility improvement. Therefore, this study investigated the effect of cytoskeletal manual therapy (CMT), which is a new soft tissue mobilization technique. Design: A case report Methods: A 41-year-old woman with AWS after breast cancer surgery and ALND visited a physical therapy clinic because of shoulder pain, decreased function, and decreased mobility. The cords were palpable and pain occurred 2 weeks after surgery. CMT was performed three times per week for a total of 6 weeks. Her pain intensity, range of motion (ROM), and shoulder function were measured. Results: Measurements were performed after 2 weeks and 6 weeks of CMT and evaluated using the numeric pain rating scale (NPRS). Her pain intensity largely decreased after 2 weeks (4-point score reduction) and after 6 weeks (5-point score reduction) of CMT. After CMT, her full ROM was restored and her shoulder function was improved (7-point score reduction). Conclusions: CMT is effective for pain control, mobility improvement, and functional improvement of patients with AWS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.659-667
• /
• 2009

Mobile Ad-hoc Network consists of mobile nodes without immobile base station. In mobile ad-hoc network, network cutting has occurred frequently in node because of energy restriction and frequent transfer of node. Therefore, it requires research for certain techniques that react softly in topology alteration in order to improve reliability of transmission path. This paper proposes path selection techniques to consider mobility of node that respond when search path using AOMDV routing protocol. As applying proposed techniques, We can improve reliability and reduce re-searching number of times caused by path cutting.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.917-922
• /
• 2004

Mobile ad hoc networks (MANETs) are networks of mobile nodes that have no fixed network infrastructure. Since the mobile node's location changes frequently, it is an attractive area to maintain the node's location efficiently. In this paper, we present an adaptive randomized database group (ARDG) scheme to manage the mobile nodes mobility in MHANETs. The proposed scheme stores the network nodes' location in location databases to manage the nodes' mobility. When a mobile node changes its location or needs a node's location, the node randomly select some databases to update or que교 the location information. The number of the selected databases is fixed in the case of querying while the number of the databases is determined according to the node's popularity in the case of updating. We evaluated the performance of the proposed scheme using an analytical model, and compared the performance with that of the conventional randomized database group (RDG) scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.3
• /
• pp.478-484
• /
• 2008

When a mobile node moves, MIPv6 operates an authentication process for the new connection. These kinds of frequent binding update and authentication processes cause much traffic and delay the service. To solve this problem, PMIPv6 provides a network-based mobility protocol in order to lessen the load on a mobile node. However, when it is moved from a domain to a domain or in a domain, there still lies a need fDr a new address, so MIPv6's demerit still exists. In IPsec, too, a new negotiation should be made when it is moved to WAN(Wide Area Network). This causes load to the mobile node. In this paper suggests MBB(Make Before Break) system to eliminate disconnections or delays resulted from the address change or renegotiation for security. When the mobile node receives a CoA address, IPsec negotiation gets operated. Its identity is authenticated by sending the identifier used for the prior negotiation to CN(Correspondent Node) through the BID message suggested. After that, negotiation Bets simplified that disconnections can be eliminated, and in the IPsec negotiation, the load on the mobile node can be lessened as well; moreover, two addresses are used for the communication simultaneously, so the probability of packet loss can be reduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8B
• /
• pp.738-749
• /
• 2003

Mobile IP protocol introduced in RFC3344 provides a node of the mobility service through IP tunneling mechanism in the IP networks. In this paper, we describe a method to provide a mobility service for VPN(Virtual Private Network) nodes on the MPLS(Multiprotocol Label Switching) network. The MPLS VPN considered here is based on "BGP/MPLS VPNs" presented in RFC2547. PE(Provider′s Edge) routers, which are able to provide VPN services on the MPLS network, are associated with mobility agents to support Mobile IP This proposed mechanism applies when a VPN node moves to other site of the same VPN, or when it moves to other site of a different VPN, or to the ordinary Internet site. We implemented this mechanism in PE routers and analyzed the performance of the MPLS VPN with mobility support on the testbed.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.202-214
• /
• 2003

The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1189-1193
• /
• 2010

Mobility management is one of the most important research issues in 6LoWPAN, Since the IP-WSN application domain is expanded to real-time applications such as healthcare and surveillance systems, a fast and seamless handover becomes an important criterion in 6LoWPAN. However, a draft of IETF 6LoWPAN WG for mobility support does not decrease handover delay. Although LoWMob supports a fast intra-PAN handover. it can be supported when the infrastructure node has the location information of the other nodes in the mobile node's moving direction. In this paper, we propose a fast and seamless mobility protocol to support intra-PAN handover, named intra-MARIO. In intra-MARIO, a parent node of the mobile node preconfigures its handover to the PAN when the parent node detects its movement, thereby reducing the handover delay. Since intra-MARIO also supports route optimization, the mobile node can communicate with its corresponding nodes through the optimal route. In this paper, we analysis the signaling cost and evaluates that the handover can be completed in 20ms by simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.552-559
• /
• 2012

In this paper, we introduce a frame structure of the satellite TDMA network and the synchronization method thereof. The primary station transmits a special burst called reference burst which provides reference time to network. By using this reference burst all nodes achieve initial acquisition and synchronization. We consider time drift due to the node and satellite mobility, time shift due to the node position, Doppler shift due to the node mobility and frequency offsets as important factors of the frame structure. Simulation results show that the proposed frame structure and synchronization method guarantee accurate synchronization performance when the node is even in low SNR as well as 25 kHz frequency offsets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.526-535
• /
• 2010

In this paper, we propose the fault-tolerant network-based mobility management scheme for supporting multimedia services of broadcasting & communications convergence in fixed mobile convergence (FMC) networks. The proposed scheme is based on AIMS (Access Independent Mobility Service) which is developed for the mobility support among heterogeneous access networks. To support stable location management and handover control for a MN, the proposed scheme supports stable management of binding information by sensing network attachment and detachment of a mobile node (MN). In addition, the proposed fault-tolerant (FT) AIMS supports a function of message retransmission for the support of handover control message and a function of heartbeat message transmission for the support of stable access network environments to a mobile node. We evaluate and analyze the performance of the proposed scheme through the implementation of AIMS system test-bed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.1001-1008
• /
• 2015

Mobile Ad hoc Network(MANET) consists of a node that has mobility. In MANET, the node has routing, the node builds a network of their own, no dependent infrastructure. Topology are exchanged due to node mobility in MANET. For reducing the change of topology, hierarchical network algorithm has been investigated. In hierarchical network, cluster member node communicates through cluster head node. When the load-balancing of cluster head node is exceed, assigned cluster member node can't communicate with base station. To solve this problem, we proposed Load Tolerance algorithm. The proposed algorithm, when cluster member node can't send a message by cluster head node that exceed load-balancing, then the cluster member node sends a message by selected load tolerance node. Through a simulation, the proposed algorithm improves packet delivery ratio in cluster routing.