• Title/Summary/Keyword: mobile communication network

Search Result 2,173, Processing Time 0.075 seconds

Implementation of QoS Provisioning Model in VANET (VANET에서 QoS Provisioning모델의 구현)

  • Huh, Jee-Wan;Song, Wang-Cheol
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.884-888
    • /
    • 2009
  • Vehicular Adhoc Networks (VANET), a Vehicle-to-Infrastucture or Vehicle-to-Vehicle communication technology, is an area that makes more specific use of Mobile Adhoc Networks(MANET). VANET's Quality of Service(QoS) focuses on preventing possible emergencies like car crash from happening by immediately transmitting information to the cars around, while MANET's QoS is being studied for the quality of multimedia data such as Video on Demand(VoD), Video streaming, Voice over IP(VoIP), etc. In this paper, I structure the actual network configuration using Link State Routing(LSR), implement QoS Provisioning Model using Common Open Policy Service(COPS), and suggest more effective k-hop Cluster and inter-domain policy negotiation which fit better to the characteristics of VANET.

  • PDF

A Study of Connectivity in MIMO Fading Ad-Hoc Networks

  • Yousefi'zadeh, H.;Jafarkhani, H.;Kazemitabar, J.
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.47-56
    • /
    • 2009
  • We investigate the connectivity of fading wireless ad-hoc networks with a pair of novel connectivity metrics. Our first metric looks at the problem of connectivity relying on the outage capacity of MIMO channels. Our second metric relies on a probabilistic treatment of the symbol error rates for such channels. We relate both capacity and symbol error rates to the characteristics of the underlying communication system such as antenna configuration, modulation, coding, and signal strength measured in terms of signal-to-interference-noise-ratio. For each metric of connectivity, we also provide a simplified treatment in the case of ergodic fading channels. In each case, we assume a pair of nodes are connected if their bi-directional measure of connectivity is better than a given threshold. Our analysis relies on the central limit theorem to approximate the distribution of the combined undesired signal affecting each link of an ad-hoc network as Gaussian. Supported by our simulation results, our analysis shows that (1) a measure of connectivity purely based on signal strength is not capable of accurately capturing the connectivity phenomenon, and (2) employing multiple antenna mobile nodes improves the connectivity of fading ad-hoc networks.

DTCF: A Distributed Trust Computing Framework for Vehicular Ad hoc Networks

  • Gazdar, Tahani;Belghith, Abdelfettah;AlMogren, Ahmad S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1533-1556
    • /
    • 2017
  • The concept of trust in vehicular ad hoc networks (VANETs) is usually utilized to assess the trustworthiness of the received data as well as that of the sending entities. The quality of safety applications in VANETs largely depends on the trustworthiness of exchanged data. In this paper, we propose a self-organized distributed trust computing framework (DTCF) for VANETs to compute the trustworthiness of each vehicle, in order to filter out malicious nodes and recognize fully trusted nodes. The proposed framework is solely based on the investigation of the direct experience among vehicles without using any recommendation system. A tier-based dissemination technique for data messages is used to filter out non authentic messages and corresponding events before even going farther away from the source of the event. Extensive simulations are conducted using Omnet++/Sumo in order to investigate the efficiency of our framework and the consistency of the computed trust metrics in both urban and highway environments. Despite the high dynamics in such networks, our proposed DTCF is capable of detecting more than 85% of fully trusted vehicles, and filtering out virtually all malicious entities. The resulting average delay to detect malicious vehicles and fraudulent data is showed to be less than 1 second, and the computed trust metrics are shown to be highly consistent throughout the network.

An Efficient Code Assignment Algorithm in Wireless Mesh Networks (무선 메쉬 네트워크에서의 효율적인 코드할당 알고리즘에 대한 연구)

  • Yeo, Jae-Hyun
    • Journal of Information Technology Applications and Management
    • /
    • v.15 no.1
    • /
    • pp.261-270
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

  • PDF

A Virtual-Queue based Backpressure Scheduling Algorithm for Heterogeneous Multi-Hop Wireless Networks

  • Jiao, Zhenzhen;Zhang, Baoxian;Zheng, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.4856-4871
    • /
    • 2015
  • Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

A study on the capacity analysis of wide area radio trunking system (광역 무선 Trunking 시스템의 통신용량 분석에 관한 연구)

  • 김낙명
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.4
    • /
    • pp.1-11
    • /
    • 1997
  • In this paper, modeling of the communication channel occupancy characteristics at the base station in the wide area radio trunking syste has been performed. Using the results, mathematical analysis for the switching capacity at the network switch has also been done. Specificatlly, we propose a G/M/m queueing model for the single service area modeling, and analyze changes in call blockingprobabilities accoridng to changes in the burstness characteristics of group paging calls. As a result, we have observe dthat the channel occupancy variations become larger as the burstness characteristics become more apparent, to make the call blocking probability higher. Next, based on the single service area analysis, we have anayzed mathematically the average switching capacity required to serve mobile subscribers for a wide area radio trunking sytem, where multiple switching port assignments are required when the people in the same group are distributed over several base stations. Accordingly, we have observed that the average and the variance of switching channel occupancy are closely related to the mobility characteristics of subscribers, and that we need a netowrk switch having bigger capacity as subscribers show wider distribution. Especially, with the call dropping probability within 0.2%, a switch having about 5 to 6 times bigger can be required, compared with the one when the mobility of subscribers is mostly restricte dto a single service area.

  • PDF

Why Dynamic Security for the Internet of Things?

  • Hashemi, Seyyed Yasser;Aliee, Fereidoon Shams
    • Journal of Computing Science and Engineering
    • /
    • v.12 no.1
    • /
    • pp.12-23
    • /
    • 2018
  • The Internet of Things (IoT) ecosystem potentially includes heterogeneous devices with different processing mechanisms as well as very complicated network and communication models. Thus, analysis of data associated with adverse conditions is much more complicated. Moreover, mobile things in the IoT lead to dynamic alteration of environments and developments of a dynamic and ultra-large-scale (ULS) environment. Also, IoT and the services provided by that are mostly based on devices with limited resources or things that may not be capable of hosting conventional controls. Finally, the dynamic and heterogeneous and ULS environment of the IoT will lead to the emergence of new security requirements. The conventional preventive and diagnostic security controls cannot sufficiently protect it against increasing complication of threats. The counteractions provided by these methods are mostly dependent on insufficient static data that cannot sufficiently protect systems against sophisticated and dynamically evolved attacks. Accordingly, this paper investigates the current security approaches employed in the IoT architectures. Moreover, we define the dynamic security based on dynamic event analysis, dynamic engineering of new security requirements, context awareness and adaptability, clarify the need for employment of new security mechanism, and delineate further works that need to be conducted to achieve a secure IoT.

Implementation of ISO/IEEE 11073-10404 Monitoring System Based on U-Health Service (유헬스 서비스 기반의 ISO/IEEE 11073-10404 모니터링 시스템 구현)

  • Kim, Kyoung-Mok
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.6
    • /
    • pp.625-632
    • /
    • 2014
  • The u-health service is using portable device such as smart device and it consists of small computing device. The u-health service carry out same performance with desktop computer. We designed message structure based on Bluetooth HDP. This message structure is used to transmit patient's biometric data on the smart device of medical team, patient and family over the mobile network environment. ISO/IEEE 11073 PHD standard was defined based on the method of communication between the agent and the manager. And We are confirmed the reliable transmission of biometric data at the smart device by implementing the android OS based patient information monitoring application to check the status of patient for medical team, patient and family.

Design and Implementation of a Hybrid-type Video Conference System using SIP Protocol (SIP 프로토콜을 이용한 하이브리드형 화상회의 시스템의 설계 및 구현)

  • Jung TaeUn;Kim YoungHan
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.51-59
    • /
    • 2005
  • In this paper, we propose and implement a hybrid-type video conference system using SIP protocol proposed in IEFT. This conference system, all signaling is controled by the server, while the media communication can be managed either by UAs or by the server. as a result, the complexity of its routing and user state management is reduced and it is applicable to the mobile environment of the ad-hoc models. The implemented server is scale enough to be used in a large conference because it only takes charge of signaling part. And also we see that UAs are only suitable in the small conference where less than ten people can join.

Methods of WAP Gateway Capacity Dimensioning and Traffic Forecasting (WAP 게이트웨이 용량 산출과 트래픽 예측 기법)

  • Park, Chul-Geun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4B
    • /
    • pp.576-583
    • /
    • 2010
  • Wireless Internet is the network which provides wireless access in order to serve the Internet connections and data communication through the mobile handsets. To get efficient wireless access to the Internet, we need the WAP (Wireless Application Protocol) gateway that performs protocol translation and contents conversion between two different networks. We need the capacity dimensioning of the WAP gateway system in order to provide the wireless Internet service stably and cost-effectively. We also need the traffic engineering methods including traffic modelling and forecasting for the economical facility investment. The existing method of WAP gateway capacity dimensioning was intuitive and qualitative. But in this paper, we deal with the capacity dimensioning analytically and quantitatively on the basis of WAP traffic description parameters and traffic forecasting method.