• Title/Summary/Keyword: Mobile Node

Search Result 1,313, Processing Time 0.022 seconds

Adaptive Power Control based Efficient Localization Technique in Mobile Wireless Sensor Networks (모바일 무선 센서 네트워크에서 적응적 파워 조절 기반 효율적인 위치인식 기법)

  • Lee, Joa-Hyoung;Jung, In-Bum
    • The KIPS Transactions:PartC
    • /
    • v.16C no.6
    • /
    • pp.737-746
    • /
    • 2009
  • Given the increased interest in ubiquitous computing, wireless sensor network has been researched widely. The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose APL(Adaptive Power Control based Resource Allocation Technique for Efficient Localization Technique), the localization technique for multiple mobile nodes based on adaptive power control in mobile wireless sensor networks. In APL, collision of localization between sensor nodes is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we use RTS(Ready To Send) packet type for localization initiation by mobile node and CTS(Clear To Send) packet type for localization grant by anchor node. NTS(Not To Send) packet type is used to reject localization by anchor node for interference avoidance and STS(Start To Send) for synchronization between 모anchor nodes. At last, the power level of sensor node is controled adaptively to minimize the affected area. The experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and APL provides efficient localization.

mSCTP for Vertical Handover between 3G and WiBro (3G-WiBro 망간 수직핸드오버를 위한 mSCTP 기법)

  • Kim, Dong-Phil;Koh, Seok-Joo
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.355-366
    • /
    • 2008
  • This paper proposes a mobile SCTP (mSCTP) handover scheme for vertical handover between 3G wireless and WiBro networks. To evaluate the proposed mSCTP vertical handover scheme, we implement the mSCTP handover supporting system over Linux platform in which the movement of a mobile node is automatically detected and the mSCTP vertical handover is performed by the mobile node. We analyze and compare the performance of mSCTP handover and Mobile IP handover over the preconfigured testbed. From the numerical results, we can see that the handover latency of mSCTP could be much more reduced, compared to the Mobile IP handover, if the mobile node would sojourn long enough in the overlapping region between the two heterogeneous networks.

Design and Evaluation of ARDG Scheme for Mobility Management in Ad Hoc Networks (에드 혹 네트워크에서 이동성 관리를 위한 적응적 랜덤 데이터베이스 그룹 방안의 설계 및 평가)

  • Bae Ihn-Han;Ha Sook-Jeong
    • 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.

An Investigation into the Applicability of Node.js as a Platform for implementing Mobile Web Apps. (모바일 웹 어플리케이션을 구현하기 위한 Node.js 파일에 대한 조사)

  • Nkenyereye, Lionel;Jang, Jong-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.286-289
    • /
    • 2016
  • In this paper, we propose an architecture that affords mobile app based on nomadic smartphone using not only mobile cloud computing- architecture but also a dedicated web platform called Node.js built-in with the asynchronous, Nonblocking, Event-Driven programming paradigm. Furthermore, the design of the proposed architecture takes document oriented database known as MongoDB to deal with the large amount of data transmit by users of mobile web access application. The Node.js aims to give the programmers the tools needed to solves the large number of concurrent connections problem. We demonstrate the effectiveness of the proposed architecture by implementing an android application responsible of real time analysis by using a vehicle to applications smart phones interface approach that considers the smartphones to acts as a remote users which passes driver inputs and delivers output from external applications.

  • PDF

An Efficient Dynamic Prediction Clustering Algorithm Using Skyline Queries in Sensor Network Environment (센서 네트워크 환경에서 스카이라인 질의를 이용한 효율적인 동적 예측 클러스터링 기법)

  • Cho, Young-Bok;Choi, Jae-Min;Lee, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.7
    • /
    • pp.139-148
    • /
    • 2008
  • The sensor network is applied from the field which is various. The sensor network nodes are exchanged with mobile environment and they construct they select cluster and cluster headers. In this paper, we propose the Dynamic Prediction Clustering Algorithm use to Skyline queries attributes in direction, angel and hop. This algorithm constructs cluster in base mobile sensor node after select cluster header. Propose algorithm is based made cluster header for mobile sensor node. It "Adv" reduced the waste of energy which mobile sensor node is unnecessary. Respects clustering where is efficient according to hop count of sensor node made dynamic cluster. To extend a network life time of 2.4 times to decrease average energy consuming of sensor node. Also maintains dynamic cluster to optimize the within hop count cluster, the average energy specific consumption of node decreased 14%.

  • PDF

A Method to Support Mobile Sink Node in a Hierarchical Routing Protocol of Wireless Sensor Networks (무선 센서 네트워크를 위한 계층적 라우팅 프로토콜에서의 이동 싱크 노드 지원 방안)

  • Kim, Dae-Young;Cho, Jin-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1B
    • /
    • pp.48-57
    • /
    • 2008
  • Wireless sensor networks are composed of a lot of sensor nodes and they are used to monitor environments. Since many studies on wireless sensor networks have considered a stationary sink node, they cannot provide fully ubiquitous applications based on a mobile sink node. In those applications, routing paths for a mobile sink node should be updated while a sink node moves in order to deliver sensor data without data loss. In this paper, we propose a method to continuously update routing paths for a mobile sink node which can be extended on hierarchical multi-hop routing protocols in wireless sensor networks. The efficiency of the proposed scheme has been validated through comparing existing method using a location based routing protocol by extensive computer simulation.

Design of MBB System for provide Mobility continuity in Environment IPSec (IPSec 환경에서 연속적인 이동성 제공을 위한 MBB 시스템 설계)

  • Kim, Seon-Young;Jo, In-June
    • 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.

A Nested Network Mobility Support Scheme in a Proxy MIPv6 Domain (Proxy MIPv6 도메인에서 중첩 네트워크 이동성 지원 방안)

  • Park, Hee-Dong;Kim, Do-Hyeon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.10
    • /
    • pp.1385-1391
    • /
    • 2008
  • The network-based IP mobility solution - Proxy MIPv6 provides a mobile node with local mobility support without requiring MIPv6 functionality of the mobile node by using two principle functional entities, LMA (Local Mobility Anchor) and MAG (Mobile Access Gateway) located in a Proxy MIPv6 domain. Yet, in case that a mobile node moves into a mobile network located in the domain, the mobile node can't receive the local mobility support any more because it can't communicate with the MAG. This paper proposes a scheme to support nested network mobility in a Proxy MIPv6 domain by adding MAG functionality to a mobile router in the mobile network and evaluates the performance of the proposed scheme. Performance analysis shows that the proposed scheme can increase the performance of handover delay, signaling costs, and packet loss ratio.

  • PDF

A Study on Routing Protocol using C-NODE for Mobile Ad-Hoc Networking (Mobile Ad-hoc Networking에서의 C-NODE를 이용한 Routing Protocol에 관한 연구)

  • Choi, Bong-Han
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.195-201
    • /
    • 2006
  • This thesis proposes hybrid routing protocol that mix proactive routing protocol and reactive routing protocol used in Ad hoc network. Proposed method is that establish special node offering network service of nods which construct Ad hoc network and do routing different from existing hybrid routing protocol, ZRP. Special node doing these parts is called C-node. Routing using C-node can accompany efficient routing by decreasing path institution time and flooding time than existing routing protocol.

  • PDF

Enhancement of Fast Handover for Mobile IPv6 based on IEEE 802.11 Network (IEEE 802.11 네트워크 기반 Mobile IPv6 Fast Handover 성능 향상 방안)

  • Ryu, Seong-Geun;Mun, Young-Song
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.46-55
    • /
    • 2008
  • As a mobility support for IP have studied, Internet Engineering Task Force(IETF) standardized the Mobile IPv6(MIPv6) protocol. When a mobile node moves between subnets, MIPv6 maintains connectivity to network and supports seamless communication, and these processes are called a Handover. Whenever the mobile node moves between subnets, the Handover is performed. The mobile node can not communicate during the Handover. This period is Galled Handover latency. To reduce this latency, mipshop working group standardizes Fast Handovers for Mobile IPv6(FMIPv6), but latency which the mobile node registers its new care-of address to a home agent and a correspondent node is still long. To solve this problem, we propose a scheme that the mobile node registers the new care-of address to the home agent and initiates Return Routability procedure in advance during layer 2 handover, based on FMIPv6 and IEEE 802.11. We analyze MIPv6, FMIPv6 and the proposed scheme in term of packet transmission cost during the Handover. Compared to MIPv6 the proposed scheme gains 79% improvement, while it gains 31% improvement compared to FMIPv6.