Panichpapiboon, Sooksan

Preferred name

Main Affiliation

School of Information Technology

sooksan.pa@kmitl.ac.th

Now showing 1 - 9 of 9

Some of the metrics are blocked by your
consent settings
Connectivity requirements for vehicular networks with single-hop broadcasting
(2009-12-01)
Panichpapiboon, Sooksan
;
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
consent settings
Connectivity requirements for a self-organizing vehicular network
(2008-12-24)
Panichpapiboon, Sooksan
;
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
consent settings
Efficient broadcasting in IEEE 802.11 networks through irresponsible forwarding
(2009-12-01)
Busanelli, Stefano
;
Ferrari, Gianluigi
;
Panichpapiboon, Sooksan
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
consent settings
Evaluation of a neighbor-based vehicle density estimation scheme
(2008-12-01)
Panichpapiboon, Sooksan
;
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
consent settings
Adaptive frame length selection scheme for RFID object identification
(2007-01-01)
Panichpapiboon, Sooksan
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
consent settings
Route reservation in ad hoc wireless networks
(2007-01-01)
Panichpapiboon, Sooksan
;
Ferrari, Gianluigi
;
Wisitpongphan, Nawaporn
;
Tonguz, Ozan K.
This paper investigates whether and when route reservation-based (RB) communication can yield better delay performance than non-reservation-based (NRB) communication in ad hoc wireless networks. In addition to posing this fundamental question, the requirements (in terms of route discovery, medium access control (MAC) protocol, and pipelining, etc.) for making RB switching superior to NRB switching are also identified. A novel analytical framework is developed and the network performance under both RB and NRB schemes is quantified. It is shown that if the aforementioned requirements are met, then RB schemes can indeed yield better delay performance than NRB schemes. This advantage, however, comes at the expense of lower throughput and goodput compared to NRB schemes. © 2007 IEEE.
Some of the metrics are blocked by your
consent settings
An analysis of GPS sampling rates required in travel time estimation
(2009-12-01)
Panichpapiboon, Sooksan
;
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.
Some of the metrics are blocked by your
consent settings
Connectivity requirements for self-organizing traffic information systems
(2008-12-05)
Panichpapiboon, Sooksan
;
Pattara-Atikom, Wasan
To facilitate the dissemination of a time-critical information in a vehicular ad hoc network (VANET), immediate network connectivity is needed. In other words, a time-critical message from a source should be able to propagate and reach all of the vehicles on the road segment without any delay due to the unavailability of the vehicles to forward the message. Clearly, this requires the road segment to have a certain number of vehicles equipped with communication devices. It is the 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 the traffic information in a self-organizing vehicular network. One- and two-way street scenarios are considered. In addition to the conventional perspective on connectivity, where the characteristics of the wireless channel are often neglected, our analysis offers a new view by taking important physical-layer parameters, such as fading, propagation path loss, transmit power, and transmission data rate, into consideration. © 2008 IEEE.
Some of the metrics are blocked by your
consent settings
Irresponsible forwarding
(2008-12-01)
Panichpapiboon, Sooksan
;
Ferrari, Gianluigi
In a self-organizing traffic information system, vehicles share and distribute the traffic information by rebroadcasting a received information packet to their neighbors. However, it is inefficient to let every vehicle rebroadcast the information packet, since the redundant packets waste the valuable (finite) radio channel bandwidth. Reducing the number of redundant packets, while still ensuring good coverage and reachability, is one of the main objectives in multi-hop broadcasting. In this paper, we propose a new probabilistic-based rebroadcast scheme, denoted as Irresponsible Forwarding, where each vehicle rebroadcasts a received information on the basis of (i) its distance from the source and (ii) the density of its neighbors. The key idea is that a node implicitly evaluates the probability that there is another node which can rebroadcast more successfully: if this probability is sufficiently high, then the node "irresponsibly" does not rebroadcast. Unlike the other existing probability assignment schemes, our scheme also takes the statistical distribution of the vehicles on the road into consideration. Moreover, it will be shown that, for sufficiently large values of the vehicle spatial density, the average number of rebroadcast packets can be regulated by properly tuning a single parameter. © 2008 IEEE.

Panichpapiboon, Sooksan

Filters

Settings

Sort By

Results per page