• Title/Summary/Keyword: Node Mobility Pattern

Search Result 19, Processing Time 0.018 seconds

Design of Geocasting in MANET using the Improved LBM

  • Lee, Cheol-Seung;Lee, Joon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.2 no.2
    • /
    • pp.99-105
    • /
    • 2007
  • MANET(Mobile Ad-hoc network) have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of MANET in routing, we consider, in this paper, how to efficiently support applications such as variable geocasting basd on MANET. The goal of a geocasting protocol is deliver data packet to a group of nodes that are located within a specified geocasting region. Previous research that support geocast service in mobilie computing based on MANET have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the mobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance of Accessibility & Network Overhead than previous research.

  • PDF

Proposal of a mobility management scheme for sensor nodes in IoT(Internet of Things) (사물인터넷(IoT)환경에서 센서 노드들의 이동성 관리 방안에 관한 제안)

  • Park, Seung-Kyun
    • Journal of Convergence Society for SMB
    • /
    • v.6 no.4
    • /
    • pp.59-64
    • /
    • 2016
  • 6LoWPAN (IPv6 over Low Power Wireless Sensor Network) standardized by IETF does not support the mobility of wireless sensor nodes. Since the wireless sensor node, subject to a lot of constraints in the CPU, memory, a battery is not easy to apply to existing protocols such as Mobile IPv6. In this paper, we propose a novel mobility management architecture and methods to work with 6LoWPAN based on the analysis on FPMIPv6 (Fast PMIPv6) the host is not a handover procedure performed in order to support the mobility of such sensor nodes. It was suggested the use of a dispatch code pattern that is not currently used in 6LoWPAN for inter-working, MAG and MAC, MAC in order to reduce packet loss caused as the authentication delay in the handover process to minimize the power consumption of a sensor node that is caused by the re-transmission the new concept of temporary guarantee (temporary guarantee) and trust relationships (trust relationship) between AAA and introduced.

Swarm Group Mobility Model for Ad Hoc Wireless Networks

  • Kim, Dong-Soo S.;Hwang, Seok-K.
    • Journal of Ubiquitous Convergence Technology
    • /
    • v.1 no.1
    • /
    • pp.53-59
    • /
    • 2007
  • This paper proposes a new group mobility model for wireless communication. The mobility model considers the psychological and sociological behavior of each node and the perception of other nodes for describing interactions among a set of nodes. The model assumes no permanent membership of a group, capable of capturing natural behaviors as fork and join. It emulates a cooperative movement pattern observed in mobile ad hoc networks of military operation and campus, in which a set of mobile stations accomplish a cooperative motion affected by the individual behavior as well as a group behavior. The model also employs a physic model to avoid a sudden stopping and a sharping turning.

  • PDF

Handover Mobility Scenario Classification and Fast Handover Performance Analysis in NEMO Network (NEMO에서의 이동 시나리오 분류 및 빠른 핸드오버 성능 분석)

  • Choi, Seung-Joon;Su, Dong;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11B
    • /
    • pp.987-996
    • /
    • 2006
  • In NEMO scenarios, mobile node's variety of movements and mobile router's point of attachment changes can result in handover. This handover process needs additional time to finish due to the multiple levels of indirection involved in NEMO. And the performance issues of mobile node's handover such as handover delay and packet loss in above cases haven't been studied thoroughly. So, in this paper, we define fast handover failure cases in hierarchical mobile IPv6 network based NEMO. We briefly described NEMO architecture and handover procedures of FMIPv6 and HMIPv6. And then, we classified mobile node or mobile router's movement pattern into several scenarios. Analysis for the fast handover classified NEMO scenarios, in terms of handover latency and packet delivery cost have been performed.

Performance of Mobility Models for Routing Protocol in Wireless Ad-hoc Networks

  • Singh, Madhusudan;Lee, Sang-Gon;Lee, Hoon-Jae
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.610-614
    • /
    • 2011
  • Nowadays Mobile Ad Hoc Networks (MANETs) are a very popular and emerging technology in the world. MANETs helps mobile nodes to communicate with each other anywhere without using infrastructure. For this purpose we need good routing protocols to establish the network between nodes because mobile nodes can change their topology very fast. Mobile node movements are very important features of the routing protocol. They can have a direct effect on the network performance. In this paper, we are going to discuss random walk and random waypoint mobility models and their effects on routing parameters. Previously, mobility models were used to evaluate network performance under the different routing protocols. Therefore, the network performance will be strongly modeled by the nature of the mobility pattern. The routing protocols must rearrange the changes of accurate routes within the order. Thus, the overheads of traffic routing updates are significantly high. For specific network protocols or applications, these mobility patterns have different impacts.

Performance Analysis of HMIPv6 applying Adaptive MAP Domain Size (적응적 MAP도메인 크기를 적용한 HMIPv6의 성능분석)

  • ;Choe Jongwon
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.625-632
    • /
    • 2005
  • Recently, real time services have been demanding a lot and the number of mobile devices is increasing extremely. Many researchers are focusing on decreasing handoff or signaling cost, produced when mobile devices are moving around. With these efforts, HMIPv6(Hierarchical Mobile Internet Protocol Version 6) was proposed. Mobile nodes do not need to register their locations to Home Agents whenever crossing over subnets within a MAP domain. In HMIPv6, mobile nodes choose the farthest MAP without considering node mobility pattern. However, a large MAP domain is not always efficient for a slow moving node and required additional work to choose a MAP in HMIPv6. Hence, this paper proposes 'Performance Analysis of HMIPv6 applying adaptive MAP Domain Site'.

A Campus Community-based Mobility Model for Routing in Opportunistic Networks

  • Pan, Daru;Fu, Min;Sun, Jiajia;Zou, Xin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1034-1051
    • /
    • 2016
  • Mobility models are invaluable for determining the performance of routing protocols in opportunistic networks. The movement of nodes has a significant influence on the topological structure and data transmission in networks. In this paper, we propose a new mobility model called the campus-based community mobility model (CBCNM) that closely reflects the daily life pattern of students on a real campus. Consequent on a discovery that the pause time of nodes in their community follows a power law distribution, instead of a classical exponential distribution, we abstract the semi-Markov model from the movement of the campus nodes and analyze its rationality. Then, using the semi-Markov algorithm to switch the movement of the nodes between communities, we infer the steady-state probability of node distribution at random time points. We verified the proposed CBCNM via numerical simulations and compared all the parameters with real data in several aspects, including the nodes' contact and inter-contact times. The results obtained indicate that the CBCNM is highly adaptive to an actual campus scenario. Further, the model is shown to have better data transmission network performance than conventional models under various routing strategies.

MUVIS: Multi-Source Video Streaming Service over WLANs

  • Li Danjue;Chuah Chen-Nee;Cheung Gene;Yoo S. J. Ben
    • Journal of Communications and Networks
    • /
    • v.7 no.2
    • /
    • pp.144-156
    • /
    • 2005
  • Video streaming over wireless networks is challenging due to node mobility and high channel error rate. In this paper, we propose a multi-source video streaming (MUVIS) system to support high quality video streaming service over IEEE 802.1l-based wireless networks. We begin by collocating a streaming proxy with the wireless access point to help leverage both the media server and peers in the WLAN. By tracking the peer mobility patterns and performing content discovery among peers, we construct a multi-source sender group and stream video using a rate-distortion optimized scheme. We formulate such a multi-source streaming scenario as a combinatorial packet scheduling problem and introduce the concept of asynchronous clocks to decouple the problem into three steps. First, we decide the membership of the multisource sender group based on the mobility pattern tracking, available video content in each peer and the bandwidth each peer allocates to the multi-source streaming service. Then, we select one sender from the sender group in each optimization instance using asynchronous clocks. Finally, we apply the point-to-point rate-distortion optimization framework between the selected sender-receiver pair. In addition, we implement two different caching strategies, simple caching simple fetching (SCSF) and distortion minimized smart caching (DMSC), in the proxy to investigate the effect of caching on the streaming performance. To design more realistic simulation models, we use the empirical results from corporate wireless networks to generate node mobility. Simulation results show that our proposed multi-source streaming scheme has better performance than the traditional server-only streaming scheme and that proxy-based caching can potentially improve video streaming performance.

Energy-Efficient Mobility Management Schemes in HMIPv6 (HMIPv6환경에서 에너지 효율적인 이동성 관리 기법)

  • Yang Sun Ok;Kim SungSuk;Hwang Chong-Sun
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.615-624
    • /
    • 2005
  • In Mobile IP, several types of messages - binding update, binding request and binding acknowledgement - are used to support user mobility. It is necessary to exchange those messages frequently for seamless mobility but it incurs both the increase of network overhead and poor usage of mobile node battery power Thus, we need a mechanism that the server detects users location and also copes with the problems effectively, which is our main concern in this paper Each user records all moving logs locally and periodically makes out profile based on them in HMIPv6. By using profile, estimated resident time can be computed whenever he enters an area and the time is set up as the binding update message lifetime. Of course, the more correct lifetime nay be obtained IP arrival time as well as average resident time Is considered in profile. Through extensive experiments, we measure the bandwidth usage for binding update messages by comparing the proposed schemes with that in HMIPv6. From the results, Gain gets over $80\%$ when mobile node stays more than 13 minutes in a subnet. Namely, we come to know that our schemes improve network usage and energy usage in mobile node by decreasing the number of messages while they also manage users locations like that in HMIPv6.

A Smart DTMC-based Handover Scheme Using Vehicle's Mobility Behavior Profile (차량의 이동성 행동 프로파일을 이용한 DTMC 기반의 스마트 핸드오버 기법)

  • Han, Sang-Hyuck;Kim, Hyun-Woo;Choi, Yong-Hoon;Park, Su-Won;Rhee, Seung-Hyuong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6B
    • /
    • pp.697-709
    • /
    • 2011
  • For improvement of wireless Internet service quality at vehicle's moving speed, it is advised to reduce the service disruption time by reducing the handover frequency on vehicle's moving path. Particularly, it is advantageous to avoid the handover to cell whose dwell time is short or can be ignored in terms of service continuity and average throughput. This paper proposes the handover scheme that is suitable for vehicle in order to improve the wireless Internet service quality. In the proposed scheme, the handover process continues to be learned before being modeled to Discrete-Time Markov Chain (DTMC). This modeling reduces the handover frequency by preventing the handover to cell that could provide service sufficiently to passenger even when vehicle passed through the cell but there was no need to perform handover. In order to verify the proposed scheme, we observed the average number of handovers, the average RSSI and the average throughput on various moving paths that vehicle moved in the given urban environment. The experiment results confirmed that the proposed scheme was able to provide the improved wireless Internet service to vehicle that moved to some degree of consistency.