• Title/Summary/Keyword: Average Distance(AD)

Search Result 25, Processing Time 0.031 seconds

Traffic Management in Mobile Ad-hoc Network (이동 애드 혹 네트워크에서의 트래픽 관리)

  • Kang, Kyung-In;Park, Gyong-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.9
    • /
    • pp.29-35
    • /
    • 2009
  • In this paper we propose a mobile ad-hoc routing protocal based on AODV(Ad hoc On demand Distance Vector) with traffic management support and evaluate the performance through simulation. The average reception rate is increased by establishing the shortest route, considering in advance the usable communication resources at each node. For performance evaluation, we analyze the average data reception rate, considering the node mobility.

Routing Protocol Supporting QoS in Mobile Ad-hoc Network (이동 애드 혹 네트워크에서 QoS를 지원하는 라우팅 프로토콜)

  • Kang, Kyung-In;Park, Kyung-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.2 s.46
    • /
    • pp.189-196
    • /
    • 2007
  • In this paper, we proposed a mobile ad hoc routing protocol based on AODV(Ad hoc On demand Distance Vector) with QoS(Quality of Service) support and evaluated the performance through simulation. The waste of communication resources is reduced by establishing the shortest route suitable to QoS support, considering in advance the usable communication resources at each node. For performance evaluation, we analyzed the average data reception rate, considering the node mobility and the number of best effort/QoS data flows. We found that in the mobile Ad Hoc networks the QoS service for some specific data flows increased the average data reception rate for the QoS data flows.

  • PDF

Performance Evaluation of Position-based and Non-position-based Routing Protocols in a Vehicular Ad-Hoc Network (VANET에 있어서 위치기반과 비위치기반 라우팅프로토콜의 성능 평가)

  • Jo, Jun-Mo;Choi, Dae-Woo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.2
    • /
    • pp.213-218
    • /
    • 2006
  • In this paper, we evaluate and compare performance between position-based and non-position-based routing protocols in a vehicular ad-hoc network. The protocols evaluated in this paper for many performance evaluation aspects are a position-based routing protocol, GPSR (Greedy Perimeter Stateless Routing), and the non-position-based such as AODV (Ad-hoc On-Demand Distance Vector) and DSR (Dynamic Source Routing) protocols. The three protocol characteristics such as Packet Delivery Ratio, Latency of first packet per connection, and Average number of hops depending on distance are compared and evaluated. As the result of simulation, the AODV performed better than the DSR. However, due to the high mobility characteristic of a vehicular ad-hoc network, GPSR, the position-based routing performs better than the non-position-based routing protocols such as AODV and DSR in a vehicular ad-hoc network environment.

  • PDF

Dementia Classification by Distance Analysis from the Central Coronal Plane of the Brain Hippocampus (뇌 해마의 관상면 중심점으로부터 거리분석에 따른 치매분류)

  • Choi, Boo-Kyeong;So, Jae-Hong;Son, Young-Ju;Madusanka, Nuwan;Choi, Heung-Kook
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.2
    • /
    • pp.147-157
    • /
    • 2018
  • Alzheimer's disease has the significant factors for the both specific and characteristic features according to the disease progressing that are the volumetry and surface area by the brain hippocampus shrinking and thinning. However, we have suggested a shape analysis to calculate the variance by the roughness, coarseness or uneven surface on 3D MR images. For the reasons we have presented two methods: the first method is the distance calculation from major axis to edge points and the second method is the distance calculation from centroidal point to edge points on a coronal plane. Then we selected the shortest distance and the longest distance in each slice and analyzed the ANOVA and average distances. Consequently we obtained the available and great results by the longest distance of the axial and centroidal point. The results of average distances were 44.85(AD), 45.04(MCI) and 49.31(NC) from the axial points and 39.30(AD), 39.58(MCI) and 44.78(NC) from centroidal points respectively. Finally the distance variations for the easily recognized visualization were shown by the color mapping. This research could be provided an indicator of biomarkers that make diagnosis and prognosis the Alzheimer's diseases in the future.

Comparison of Topology Based-Routing Protocols in Wireless Network

  • Sharma, Vikas;Ganpati, Anita
    • Journal of Multimedia Information System
    • /
    • v.6 no.2
    • /
    • pp.61-66
    • /
    • 2019
  • VANET (Vehicular Ad-hoc Network) is a mobile Ad-hoc Network which deals with the moving vehicles. VANET supports Intelligent Transport Systems (ITS) which is related to different modes of transport and traffic management techniques. VANETs enabled users to be informed and make them safer. VANET uses IEEE 802.11p standard wireless access protocol for communication. An important and necessary issue of VANET is to design routing protocols. In a network, communication takes place by the use of the routing protocols. There are mainly two types of communications used such as Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) in VANET. Vehicles can send and receive messages among them and also to and from infrastructure used. In this paper, AODV, DSR and DSDV are compared by analysing the results of simulation on various metrics such as average throughput, instant throughput, packet delivery ratio and residual energy. Findings indicates utilization of AODV and DSR is more applicable for these metrics as compared to DSDV. A network simulator (NS2) is used for simulation.

A Tree Scatternet Formation Algorithm for Reducing Average Hop Count Between Bluetooth Devices (블루투스 장치 간의 평균 홉 수를 줄이기 위한 트리 스캐터넷 형성 알고리즘)

  • Kang, Seung-Ho;Kang, Dae-Wook;Lim, Hyeong-Seok
    • The KIPS Transactions:PartC
    • /
    • v.11C no.3
    • /
    • pp.401-408
    • /
    • 2004
  • The Bluetooth Scatternet based on tree structure has several merits such as small numb of links and simple routing method. This paper proposes an algorithm which satisfies the constraints of Bluetooth Specification and forms the topology of scatternet as close as the tree structure that has the shortest average inter-node distance among trees. Also we show that the proposed method reduces the average hop count between any two devices compared to early works without higher formation delay by a simulation.

A MAC Protocol for Transmission Power Control in Ad Hoc Networks (애드 혹 네트워크에서 전송파워 제어를 위한 MAC 프로토콜)

  • Hwang, Sungho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.2
    • /
    • pp.878-884
    • /
    • 2013
  • This paper presents a transmission power control MAC protocol that allows terminals to vary transmit power level on data frame basis in ad hoc network. Unlike the IEEE 802.11 approach, we do not use the RTS/CTS packets to silence the neighboring nodes. Instead, channel gain and distance information between transmitter and receiver terminal are inserted in the RTS/CTS packets. These informations are used to dynamically bound the transmission power. Simulation results indicate that, compared to the GMAC, the proposed MAC protocol achieves a increase in the average frame delivery ratio and a decrease in the average frame delay.

SINR-Based Multipath Routing for Wireless Ad Hoc Networks

  • Park, Ji-Won;Moh, Sang-Man;Chung, Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.849-864
    • /
    • 2010
  • This paper proposes a multipath routing protocol called cross-layer multipath AODV (CM-AODV) for wireless ad hoc networks, which selects multiple routes on demand based on the signal-to-interference plus noise ratio (SINR) measured at the physical layer. Note that AODV (Ad hoc On-demand Distance Vector) is one of the most popular routing protocols for mobile ad hoc networks. Each time a route request (RREQ) message is forwarded hop by hop, each forwarding node updates the route quality which is defined as the minimum SINR of serialized links in a route and is contained in the RREQ header. While achieving robust packet delivery, the proposed CM-AODV is amenable to immediate implementation using existing technology by neither defining additional packet types nor increasing packet length. Compared to the conventional multipath version of AODV (which is called AOMDV), CM-AODV assigns the construction of multiple paths to the destination node and makes it algorithmically simple, resulting in the improved performance of packet delivery and the less overhead incurred at intermediate nodes. Our performance study shows that CM-AODV significantly outperforms AOMDV in terms of packet delivery ratio and average end-to-end delay, and results in less routing overhead.

A Design of ETWAD(Encapsulation and Tunneling Wormhole Attack Detection) based on Positional Information and Hop Counts on Ad-Hoc (애드 혹 네트워크에서 위치 정보와 홉 카운트 기반 ETWAD(Encapsulation and Tunneling Wormhole Attack Detection) 설계)

  • Lee, Byung-Kwan;Jeong, Eun-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.11
    • /
    • pp.73-81
    • /
    • 2012
  • This paper proposes an ETWAD(Encapsulation and Tunneling Wormhole Attack Detection) design based on positional information and hop count on Ad-Hoc Network. The ETWAD technique is designed for generating GAK(Group Authentication Key) to ascertain the node ID and group key within Ad-hoc Network and authenticating a member of Ad-hoc Network by appending it to RREQ and RREP. In addition, A GeoWAD algorithm detecting Encapsulation and Tunneling Wormhole Attack by using a hop count about the number of Hops within RREP message and a critical value about the distance between a source node S and a destination node D is also presented in ETWAD technique. Therefore, as this paper is estimated as the average probability of Wormhole Attack detection 91%and average FPR 4.4%, it improves the reliability and probability of Wormhole Attack Detection.

Coverage and Energy Modeling of HetNet Under Base Station On-Off Model

  • Song, Sida;Chang, Yongyu;Wang, Xianling;Yang, Dacheng
    • ETRI Journal
    • /
    • v.37 no.3
    • /
    • pp.450-459
    • /
    • 2015
  • Small cell networks, as an important evolution path for next-generation cellular networks, have drawn much attention. Different from the traditional base stations (BSs) always-on model, we proposed a BSs on-off model, where a new, simple expression for the probabilities of active BSs in a heterogeneous network is derived. This model is more suitable for application in practical networks. Based on this, we develop an analytical framework for the performance evaluation of small cell networks, adopting stochastic geometry theory. We derive the system coverage probability; average energy efficiency (AEE) and average uplink power consumption (AUPC) for different association strategies; maximum biased received power (MaBRP); and minimum association distance (MiAD). It is analytically shown that MaBRP is beneficial for coverage but will have some loss in energy saving. On the contrary, MiAD is not advocated from the point of coverage but is more energy efficient. The simulation results show that the use of range expansion in MaBRP helps to save energy but that this is not so in MiAD. Furthermore, we can achieve an optimal AEE by establishing an appropriate density of small cells.