• Title/Summary/Keyword: Internet Ad

Search Result 412, Processing Time 0.023 seconds

A Computationally Inexpensive Radio Propagation Model for Vehicular Communication on Flyovers and Inside Underpasses

  • Ahsan Qureshi, Muhammad;Mostajeran, Ehsan;Noor, Rafidah Md;Shamim, Azra;Ke, Chih-Heng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4123-4144
    • /
    • 2016
  • Vehicular Ad Hoc Networks (VANETs) utilize radio propagation models (RPMs) to predict path loss in vehicular environment. Modern urban vehicular environment contains road infrastructure units that include road tunnels, straight roads, curved roads flyovers and underpasses. Different RPMs were proposed in the past to predict path loss, but modern road infrastructure units especially flyovers and underpasses are neglected previously. Most of the existing RPMs are computationally complex and ignore some of the critical features such as impact of infrastructure units on the signal propagation and the effect of both static and moving radio obstacles on signal attenuation. Therefore, the existing RPMs are incapable of predicting path loss in flyovers and underpass accurately. This paper proposes an RPM to predict path loss for vehicular communication on flyovers and inside underpasses that considers both the static and moving radio obstacles while requiring only marginal overhead. The proposed RPM is validated based upon the field measurements in 5 GHz frequency band. A close agreement is found between the measured and predicted values of path loss.

Theory of Comparison Value and Online Comparison Challenge Advertising (비교가치이론과 온라인 비교도전 광고)

  • 이재원;이재규
    • Korean Management Science Review
    • /
    • v.20 no.2
    • /
    • pp.197-204
    • /
    • 2003
  • Comparison challenge approach is proposed as a form of challenger-activated. just-in-time Internet advertising. To develop a framework for a comparison challenge, we propose a theory of comparison value. A comparison is regarded valuable if a comparison opportunity is available and if the comparison is relevant and informative, has an appropriate level of detail, and is advantageous and trustworthy. Based on this theory, the CompareMe and CompareThem strategies are devised, and comparable objects are classified in terms of price and performance dominance as well as the scope of proximity. The idea is demonstrated with a comparison of PCs from five leading manufacturers. To assist in the planning of the comparison challenge, a mathematical programming model was formulated to maximize the value of comparison under the constraints of the comparison opportunity and budget. The model is applied to eight scenarios in terms of the range of comparing objects. The models under various scenarios are tested and contrasted with the real-world example of PCs. We found the ad effect of comparison challenge to be substantially better than banners (4.75 times) and similarity-based comparisons (2.77 times), providing customers with better performance and reduced prices.

SVC: Secure VANET-Assisted Remote Healthcare Monitoring System in Disaster Area

  • Liu, Xuefeng;Quan, Hanyu;Zhang, Yuqing;Zhao, Qianqian;Liu, Ling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1229-1248
    • /
    • 2016
  • With the feature of convenience and low cost, remote healthcare monitoring (RHM) has been extensively used in modern disease management to improve the quality of life. Due to the privacy of health data, it is of great importance to implement RHM based on a secure and dependable network. However, the network connectivity of existing RHM systems is unreliable in disaster area because of the unforeseeable damage to the communication infrastructure. To design a secure RHM system in disaster area, this paper presents a Secure VANET-Assisted Remote Healthcare Monitoring System (SVC) by utilizing the unique "store-carry-forward" transmission mode of vehicular ad hoc network (VANET). To improve the network performance, the VANET in SVC is designed to be a two-level network consisting of two kinds of vehicles. Specially, an innovative two-level key management model by mixing certificate-based cryptography and ID-based cryptography is customized to manage the trust of vehicles. In addition, the strong privacy of the health information including context privacy is taken into account in our scheme by combining searchable public-key encryption and broadcast techniques. Finally, comprehensive security and performance analysis demonstrate the scheme is secure and efficient.

A New Traffic Congestion Detection and Quantification Method Based on Comprehensive Fuzzy Assessment in VANET

  • Rui, Lanlan;Zhang, Yao;Huang, Haoqiu;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.41-60
    • /
    • 2018
  • Recently, road traffic congestion is becoming a serious urban phenomenon, leading to massive adverse impacts on the ecology and economy. Therefore, solving this problem has drawn public attention throughout the world. One new promising solution is to take full advantage of vehicular ad hoc networks (VANETs). In this study, we propose a new traffic congestion detection and quantification method based on vehicle clustering and fuzzy assessment in VANET environment. To enhance real-time performance, this method collects traffic information by vehicle clustering. The average speed, road density, and average stop delay are selected as the characteristic parameters for traffic state identification. We use a comprehensive fuzzy assessment based on the three indicators to determine the road congestion condition. Simulation results show that the proposed method can precisely reflect the road condition and is more accurate and stable compared to existing algorithms.

Delay Tolerant Packet Forwarding Algorithm Based on Location Estimation for Micro Aerial Vehicle Networks

  • Li, Shiji;Hu, Guyu;Ding, Youwei;Zhou, Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1377-1399
    • /
    • 2020
  • In search and rescue mission, micro aerial vehicles (MAVs) are typically used to capture image and video from an aerial perspective and transfer the data to the ground station. Because of the power limitation, a cluster of MAVs are required for a large search area, hence an ad-hoc wireless network must be maintained to transfer data more conveniently and fast. However, the unstable link and the intermittent connectivity between the MAVs caused by MAVs' movement may challenge the packet forwarding. This paper proposes a delay tolerant packet forwarding algorithm based on location estimation for MAV networks, called DTNest algorithm. In the algorithm, ferrying MAVs are used to transmit data between MAVs and the ground station, and the locations of both searching MAVs and ferrying MAVs are estimated to compute the distances between the MAVs and destination. The MAV that is closest to the destination is selected greedy to forward packet. If a MAV cannot find the next hop MAV using the greedy strategy, the packets will be stored and re-forwarded once again in the next time slot. The experiment results show that the proposed DTNest algorithm outperforms the typical DTNgeo algorithm in terms of packet delivery ratio and average routing hops.

Design and Evaluation of Fuzzy-Logic based Quorum System considering the Gravity of Locality of Mobile in MANETs (애드-혹 망에서 모바일의 지역 중요도를 고려한 퍼지로직 기반 쿼럼의 설계 및 평가)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.9-14
    • /
    • 2008
  • Mobile Ad-Hoc network is the network of mobile nodes which has no fixed infrastructure, and mobile node in MANET can move freely and communicate with each other. The location management is an important issue because location information of a mobile node is frequently changed in MANET. In this paper, we propose new quorum system applying the gravity of locality of mobile nodes adaptively by using the fuzzy-logic for the mobility of mobile nodes in order to manage location information of mobile nodes in MANET efficiently. The performance of the proposed scheme is evaluated by an analytical model and compared with those of existing UQS and DQS schemes.

  • PDF

Design and Performance Analysis of Welfare Management System based on WSN (WSN 기반 복지 관리 시스템 설계 및 성능분석)

  • Kim, Ji-Seong;Kim, Kang-Hee;Hwang, Ho-Young;Suh, Hyo-Joong
    • Journal of Internet Computing and Services
    • /
    • v.9 no.6
    • /
    • pp.99-107
    • /
    • 2008
  • Wireless sensor networks (WSN) based on low-power technologies become important portion of ubiquitous systems. In this paper, we introduce a WSN-based welfare management system as one of the WSN applications. Especially, we implement S-MAC (Sensor Medium Access control) protocol on our system that saves both cost and power consumption, and we evaluate system performances using the TOSSIM simulator. Sensors and a small database server are placed in the house of participant, which collects and stores some environment conditions of the house. The small servers are connected to each others by wireless ad-hoc network.

  • PDF

Position-based Routing Algorithm for Improving Reliability of Inter-Vehicle Communication

  • Ryu, Min-Woo;Cha, Si-Ho;Koh, Jin-Gwang;Kang, Seok-Joong;Cho, Kuk-Hyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.8
    • /
    • pp.1388-1403
    • /
    • 2011
  • A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

RNG-based Scatternet Formation Algorithm for Small-Scale Ad-Hoc Network (소규모 분산망을 위한 RNG 기반 스캐터넷 구성 알고리즘)

  • Cho, Chung-Ho
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.17-29
    • /
    • 2007
  • This paper addresses a RNG based scatternet topology formation, self-healing, and routing path optimization for small-scale distributed environment, which is called RNG-FHR(Scatternet Formation, self-Healing and self-Routing path optimization) algorithm. We evaluated the algorithm using ns-2 and extensible Bluetoothsimulator called blueware to show that RNG-FHR does not have superior performance, but is simpler and more practical than any other distributed algorithms from the point of depolying the network in the small-scale distributed dynamic environment due to the exchange of fewer messages and local control. As a result, we realized that even though RNG-FHR is unlikely to be possible for deploying in large-scale environment, it surely can be deployed for performance and practical implementation in small-scale environment.

  • PDF

Distributed task allocation of mobile robotic sensor networks with guaranteed connectivity

  • Mi, Zhenqiang;Yu, Ruochen;Yi, Xiangtian;Yang, Yang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4372-4388
    • /
    • 2014
  • Robotic sensor network (RSN) contains mobile sensors and robots providing feasible solution for many multi-agent applications. One of the most critical issues in RSN and its application is how to effectively assign tasks. This paper presents a novel connectivity preserving hybrid task allocation strategy to answer the question particularly for RSN. Firstly, we model the task allocation in RSN to distinguish the discovering and allocating processes. Secondly, a fully distributed simple Task-oriented Unoccupied Neighbor Algorithm, named TUNA, is developed to allocate tasks with only partial view of the network topology. A connectivity controller is finally developed and integrated into the strategy to guarantee the global connectivity of entire RSN, which is critical to most RSN applications. The correctness, efficiency and scalability of TUNA are proved with both theoretical analysis and experimental simulations. The evaluation results show that TUNA can effectively assign tasks to mobile robots with the requirements of only a few messages and small movements of mobile agents.