• 제목/요약/키워드: Random Waypoint Mobility Model

검색결과 4건 처리시간 0.021초

영역별 탐색수를 고려한 그룹 무인기 정찰용 Random Waypoint 이동성 모델 (Random Waypoint Mobility Model for UAV Group Reconnaissance based on Regional Arrival Count)

  • 조용일;정용민;하옥균;김경훈
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2016년도 제54차 하계학술대회논문집 24권2호
    • /
    • pp.7-8
    • /
    • 2016
  • Ad-hoc 네트워크 기술이 발달함에 따라 FANET(Flying Ad-Hoc Notworks)을 이용한 그룹 무인기 정찰이 요구되고 있다. 본 논문에서는 자율비행을 위한 효율적인 그룹 무인기 정찰을 위하여 새로운 이동성 모델을 제안한다. 제안하는 모델은 Random Waypoint에 기반 하는 모델로써 정찰되지 않은 구역의 선택 확률을 높여 균형적 탐색을 유도한다. 시뮬레이션을 이용하여 제안하는 모델이 기존의 Random Waypoint 에 비해 80% 정찰비율 시간 향상 면에서 우수함을 보인다.

  • PDF

Stationary Distribution for the Mobilities in Catastrophe Rescue Scenario

  • Wang, Yong;Peng, Wei;Dou, Qiang;Gong, Zhenghu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권2호
    • /
    • pp.308-326
    • /
    • 2013
  • Mobility Model has drawn more and more attentions since its critical role in Mobile Wireless Networks performance evaluation. This paper analyzes the mobility patterns in the catastrophe rescue scenario, and proposes the Random Waypoint with Base Point mobility model to model these characteristics. We mathematically analyze the speed and spatial stationary distributions of the nodes and derive explicit expressions for the one dimensional case. In order to keep the stationary distribution through the entire simulation procedure, we provide strategies to initialize the speed, location and destination of the nodes at the beginning of the simulation. The simulation results verify the derivations and the proposed methods in this paper. This work gives a deep understanding of the properties of the Random Waypoint with Base Point mobility model and such understanding is necessary to avoid misinterpretation of the simulation results. The conclusions are of practical value for performance analysis of mobile wireless networks, especially for the catastrophe rescue scenario.

Hierarchical Coloured Petri Net based Random Direction Mobility Model for Wireless Communications

  • Khan, Naeem Akhtar;Ahmad, Farooq;Hussain, Syed Asad;Naseer, Mudasser
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권8호
    • /
    • pp.3656-3671
    • /
    • 2016
  • Most of the research in the area of wireless communications exclusively relies on simulations. Further, it is essential that the mobility management strategies and routing protocols should be validated under realistic conditions. Most appropriate mobility models play a pivotal role to determine, whether there is any subtle error or flaw in a proposed model. Simulators are the standard tool to evaluate the performance of mobility models however sometimes they suffer from numerous documented problems. To accomplish the widely acknowledged lack of formalization in this domain, a Coloured Petri nets (CPNs) based random direction mobility model for specification, analysis and validation is presented in this paper for wireless communications. The proposed model does not suffer from any border effect or speed decay issues. It is important to mention that capturing the mobility patterns through CPN is challenging task in this type of the research. Further, an appropriate formalism of CPNs supported to analyze the future system dynamic status. Finally the formal model is evaluated with the state space analysis to show how predefined behavioral properties can be applied. In addition, proposed model is evaluated based on generated simulations to track origins of errors during debugging.

A Prediction-based Energy-conserving Approximate Storage and Query Processing Schema in Object-Tracking Sensor Networks

  • Xie, Yi;Xiao, Weidong;Tang, Daquan;Tang, Jiuyang;Tang, Guoming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권5호
    • /
    • pp.909-937
    • /
    • 2011
  • Energy efficiency is one of the most critical issues in the design of wireless sensor networks. In object-tracking sensor networks, the data storage and query processing should be energy-conserving by decreasing the message complexity. In this paper, a Prediction-based Energy-conserving Approximate StoragE schema (P-EASE) is proposed, which can reduce the query error of EASE by changing its approximate area and adopting predicting model without increasing the cost. In addition, focusing on reducing the unnecessary querying messages, P-EASE enables an optimal query algorithm to taking into consideration to query the proper storage node, i.e., the nearer storage node of the centric storage node and local storage node. The theoretical analysis illuminates the correctness and efficiency of the P-EASE. Simulation experiments are conducted under semi-random walk and random waypoint mobility. Compared to EASE, P-EASE performs better at the query error, message complexity, total energy consumption and hotspot energy consumption. Results have shown that P-EASE is more energy-conserving and has higher location precision than EASE.