Now showing 1 - 10 of 17
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Connectivity requirements for vehicular networks with single-hop broadcasting
    (2009-12-01) ;
    Pattara-Atikom, Wasan
    In a vehicular ad hoc network (VANET), an information can generally be disseminated by using either a multi-hop broadcasting protocol or a single-hop broadcasting protocol. While in our earlier work we analyze the connectivity requirements in a network that employs a multi-hop broadcasting protocol, in this paper we extend our analysis to model the connectivity in a network that uses a single-hop broadcasting protocol. Our goal is to develop a model that is able to describe the relationship among the flow rate, the broadcast rate, and the network connectivity. As an initial step, in this paper, we determine the fundamental relation between the flow rate and the network connectivity. ©2009 IEEE.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Irresponsible forwarding under general inter-vehicle spacing distributions
    (2011-08-12)
    Typically, vehicles in a self-organizing traffic information system distribute the information by rebroadcasting. Rebroadcasting results in redundant retransmission of the same information packet, leading to a useless occupation of the radio channel. Minimizing redundancy, while still guaranteeing complete reachability throughout the network, is a challenging task in multi-hop broadcasting. In our previous work, we introduced a new probabilistic-based broadcasting scheme, called Irresponsible Forwarding (IF), which could reduce the redundancy effectively. However, in the previous work, we only considered the scenario where the inter-vehicle spacing was exponentially distributed. In this paper, we generalize the concept of IF such that it can be applied to any inter-vehicle spacing distribution. © 2011 IEEE.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Connectivity requirements for a self-organizing vehicular network
    (2008-12-24) ;
    Pattara-Atikom, Wasan
    In order to facilitate the traffic information dissemination in a self-organizing vehicular network, the network connectivity is required. In other words, a message from a source vehicle should be able to propagate and reach all of the vehicles on the road segment. Clearly, this requires the road segment to have a certain number of vehicles equipped with communication devices. It is a task of a system designer to determine the minimum number of vehicles (i.e., the minimum penetration) necessary to form a connected network as well as the critical transmission range required to provide such connectivity. In this paper, we present an analytical framework for determining the connectivity requirements in distributing traffic information in a self-organizing vehicular network. Both one-way and two-way street scenarios are considered. © 2008 IEEE.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Efficient broadcasting in IEEE 802.11 networks through irresponsible forwarding
    (2009-12-01)
    Busanelli, Stefano
    ;
    Ferrari, Gianluigi
    ;
    In a self-organizing vehicular network, vehicles share and distribute information by rebroadcasting a received information packet to their neighbors. An efficient broadcast technique can offer a high reactivity without sacrificing the communication reliability. Therefore, broadcast techniques are particularly suitable for safety-related vehicular transmissions, whose goal is reaching reliably the widest area in the shortest time. Among the numerous solutions appeared in the literature, the probabilistic broadcast approaches seem to be promising and not yet accurately analyzed. Since the interaction between a high level broadcasting protocol with the lower layers cannot be ignored, in this work we analyze the behavior of a recently proposed broadcast technique, denoted as the Irresponsible Forwarding (IF), in IEEE 802.11 networks. Our attention concentrates on the Medium Access Control (MAC) layer, which is affected by some critical impairments for broadcasting, such as the hidden terminal problem and self-interference. In this work, we evaluate the benefits brought by the use of IF to perform efficient broadcasting in IEEE 802.11 networks.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Effective variables for urban traffic incident detection
    (2016-01-18)
    Siripanpornchana, Chaiyaphum
    ;
    ;
    Chaovalit, Pimwadee
    Past studies on automatic traffic incident detection have mainly focused on the incidents on freeways, which are controlled-access roads. There are not many works on urban traffic incident detection. In addition, the traffic data used in detecting an incident are still mostly collected from fixed sensors such as loop detectors. With the advances in mobile sensing and vehicular technology, it is foreseeable that mobile sensors will be used increasingly in the near future. In fact, traffic data will be collected directly by vehicles. Detecting traffic incidents in an urban road network with the traffic data collected by mobile sensors poses several challenges. First, the urban roads are uncontrolled-access roads, which are typically full of flow-disruptive entities such as traffic signals, intersections, crossings, bus stops, etc. These entities can disrupt the traffic flow in a similar way that an incident does, making it more difficult to detect an incident. Second, it is still not clear which traffic variables, collected by mobile sensors, can be used in detecting an incident in an urban environment. In this paper, we investigate and identify the traffic variables that are effective in detecting an incident in an urban road network. Particularly, speed, acceleration, lane-change ratio and travel time are studied. The results show that these four traffic variables are generally effective for traffic incident detection. However, among the four variables, the least effective one is the travel time.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Evaluation of a neighbor-based vehicle density estimation scheme
    (2008-12-01) ;
    Pattara-Atikom, Wasan
    Vehicle density is one of the main metrics used for assessing the road traffic condition. A high vehicle density usually indicates that the traffic is congested. Currently, most of the vehicle density estimation approaches are designed for the infrastructure-based traffic information systems. These approaches require detecting devices such as inductive loop detectors or traffic surveillance cameras to be installed at various locations. Consequently, they are not suitable for an emerging self-organizing vehicular traffic information system, where the vehicles have to collect and process the traffic information without relying on any fixed infrastructure. In this paper, we consider a method for estimating the vehicle density based on the number of vehicles in the vicinity of the probe vehicle and evaluate its performance. © 2008 IEEE.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Color-Aware Structured Parsing and Self-Consistent Reasoning for Chart Question Answering
    (2025-01-01)
    Vorathammathorn, Supasate
    ;
    Sintarasirikulchai, Wassana
    ;
    Sakdejayont, Theerat
    ;
    Colors are critical elements in charts. They allow us to visualize data in different series or categories effectively. Currently, generative artificial intelligence such as vision language models (VLMs) and large language models (LLMs) can be combined together to form a pipeline for extracting information and answering questions regarding the data presented on a given chart. However, most chart question answering pipelines still treat every chart as if it were rendered in grayscale, ignoring the valuable chromatic attributes. This paper introduces ColorAware Structured Parsing (CASP) with Self-Consistent Reasoning, a two-stage pipeline that extracts both numerical and chromatic information to improve chart understanding. On a 2,500 question Chart Question Answering (ChartQA) benchmark, CASP attains 91.12% exact-match accuracy, a significant gain over the strongest structured baseline. The answers produced by CASP are also auditable. They include explicit pointers to the table cells used for reasoning. By exploiting both numerical and chromatic information on the chart and enforcing agreement across reasoning paths, CASP turns colors into usable evidence, delivering accurate and transparent answers regarding the information embedded in the chart.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Incidents detection through mobile sensing
    (2016-09-06)
    Siripanpornchana, Chaiyaphum
    ;
    ;
    Chaovalit, Pimwadee
    Currently, most automatic traffic incident detection systems rely heavily on data collected from fixed sensors such as inductive loop detectors and surveillance cameras. However, fixed sensors are difficult to install and maintain. Moreover, it is quite costly to deploy a large number of fixed sensors to cover a broad area. It is potentially more efficient to use vehicles as mobile sensors to collect traffic data. In this paper, we introduce a new traffic incident detection algorithm which takes advantage of mobile sensors. This algorithm assesses the likelihood of an incident based on the speed data collected by the mobile sensors. Its performance is evaluated thoroughly, in terms of detection rate, false-alarm ratio, and mean time-to-detection, at various combinations of penetration rates and data sampling periods. The results show that the proposed detection algorithm is potentially promising. For a practical scenario with 10% penetration rate and 30-second sampling period, the algorithm is able to achieve around 80% detection rate.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Adaptive frame length selection scheme for RFID object identification
    (2007-01-01)
    The frame length is a significant factor which affects the performance of the framed ALOHA-based anti-collision protocols for RFID systems. Using a large frame length can reduce the number of collision slots. However, it also increases the number of wasteful slots. In order to optimize the performance, the frame length must be chosen carefully. In this paper, we present an optimal frame length selection scheme, which maximizes the system throughput. Our scheme requires only minimal information obtained from the tags' responses in the current frame, as opposed to relying on the past information collected in the previous frames. It is shown that the performance of our scheme is close to that of the ideal best-case scheme where the reader has completely accurate knowledge of the number of tags transmitting in each frame. © 2007 IEEE.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    An analysis of GPS sampling rates required in travel time estimation
    (2009-12-01) ;
    Pattara-Atikom, Wasan
    With an emergence of vehicular ad hoc networks, it is highly likely that in the near future vehicles on the road will be used as mobile probes for collecting and distributing traffic information such as the travel time. Generally, the travel time on a road section can be estimated from the global positioning data collected by a mobile probe. The more frequent the positioning data are collected or sampled, the more accurate the travel time estimation is. However, the accuracy comes at the expense of a large storage space for keeping the data. In addition, in some systems where a mobile probe needs to send its positioning data to a server or other vehicles in real-time, using an overly high sampling rate can waste the radio channel bandwidth unnecessarily since excessive amount of data will be transmitted. In this paper, we determine the minimum collection rate of positioning data required to achieve the desired level of travel time estimation accuracy. Copyright © 2009 IEEE.