Time Schedule

The 1st Conference on Telematics System, Services, and Applications 2004 (TSSA2004)
Institut Teknologi Bandung, 15 Mei 2004
No Time Activity
1 07:30-08:30 Pendaftaran dan registrasi
2 08:30-09:00 Pembukaan:
- Sambutan dari panitia
- Sambutan dari Departemen Teknik Elektro ITB
- Sambutan dari Dewan Pengarah
3 09:00-09:15 Coffee Break
4 09:15-10:45 Seminar Sesi 1
Ruang 1 Ruang 2 Ruang 3
No Waktu
Paper Mod Paper Mod Paper Mod
1 09:15-09:30 A2 M1 B10 M2 C12 M5
2 09:30-09:45 A9 M1 B6 M2 C1 M5
3 09:45-10:00 A11 M1 B1 M2 C13 M5
4 10:00-10:15 A16 M4 B12 M3 C10 M6
5 10:15-10:30 A29 M4 B3 M3 C3 M6
6 10:30-10:45 A8 M4 B2 M3 C16 M6
5 10:45-11:00 Break
6 11:00-12:30 Seminar Sesi 2
Ruang 1 Ruang 2 Ruang 3
No Waktu
Paper Mod Paper Mod Paper Mod
7 11:00-11:15 A18 M7 B7 M9 C19 M11
8 11:15-11:30 A21 M7 B9 M9 C2 M11
9 11:30-11:45 A31 M7 B13 M9 C7 M11
10 11:45-12:00 A1 M8 B14 M10 C5 M12
11 12:00-12:15 A5 M8 B5 M10 C6 M12
12 12:15-12:30 A24 M8 B15 M10 C9 M12
7 12:30-13:15 ISHOMA (Istirahat, Sholat dan Makan Siang)
8 13:15-15:00 Seminar Sesi 3
Ruang 1 Ruang 2 Ruang 3
No Waktu
Paper Mod Paper Mod Paper Mod
13 13:15-13:30 A20 M7 B17 M9 C8 M11
14 13:30-13:45 A23 M7 B16 M9 C11 M11
15 13:45-14:00 A17 M7 B8 M9 C14 M11
16 14:00-14:15 A28 M8 B11 M10 C15 M12
17 14:15-14:30 A10 M8 B4 M10 C17 M12
18 14:30-14:45 A14 M8 A6 M10 C18 M12
19 14:45-15:00 A22 M8 A19 M10 C21 M12
9 15:00-15:30 Coffee Break
10 15:30-16:45 Seminar Sesi 4
Ruang 1 Ruang 2 Ruang 3
No Waktu
Paper Mod Paper Mod Paper Mod
20 15:30-15:45 A3 M1 A15 M2 C22 M5
21 15:45-16:00 A4 M1 A12 M2 C4 M5
22 16:00-16:15 A30 M1 A13 M2 C20 M6
23 16:15-16:30 A25 M2 A7 M3 C23 M6
24 16:30-16:45 A26 M2 A27 M3
11 16:45-17:00 Penutupan
Moderator (Mod)
No Nama Kode No Nama Kode
1 Asep Barnas Simanjuntak M1 7 M7
2 F.X. Ary Wibowo M2 8 M8
3 Azhari M3 9 M9
4 Suharlin M4 10 M10
5 Sofyan Basuki M5 11 M11
6 Indarto M6 12 M12
 Paper (and Author)
No Kode Paper
 A
SYSTEMS & NETWORKS
1 A-1 An Architectural Design of a Rural Next Generation Network (R-NGN)
Armein Z. R. Langi, ITB Bandung
langi@ieee.org
2 A-2 An Iterative Estimation of Data Window Size for Anomaly Detection using Self-Similar Feature in Network Traffic
Mohd Yazid Idris, Abdul Hanan Abdullah, Mohd Aizaini Maarof, Universiti Teknologi Malaysia, Johor
yazid@fsksm.utm.my, hanan@fsksm.utm.my, maarofma@fsksm.utm.my
3 A-3 Penerapan Sistem Picocell Pada Jaringan GSM
Rd. Rohmat Saedudin, STTTelkom Bandung
roh@stttelkom.ac.id
4 A-4 Analisa Skema Softhandoff Dalam Sistem Seluler CDMA
Sofia Naning H, STT Telkom Bandung; Hendrawan, Adit Kurniawan, ITB Bandung
sofia@ee.itb.ac.id, hend@telecom.ee.itb.ac.id
5 A-5 Analisis Phase Noise Pada Penerima Optik PSK Heterodin
Avon Budiyono, STT Telkom Bandung
avo@stttelkom.ac..id
6 A-6 Analisis Sistem Komunikasi Wireless Optik Line of Sight Untuk Penggunaan Luar-Ruangan
Sigit Haryadi, Martinius Hadi Satria, ITB Bandung
sigit@telecom.ee.itb.ac.id
7 A-7 Analysis Backoff Rule pada CSMA/CA IEEE 802.11 untuk Menurunkan Collision Probability
Ahmad Taqwa, Politeknik Negeri Sriwijaya Palembang
a_taqwa@yahoo.com
8 A-8 Disain Pengirim Teledata Pada Radio FM Stereo
Rokhmadi, Dwi Aji Manuhara, Institut Teknologi Indonesia Serpong
rokhm@yahoo.com
9 A-9 Estimasi Reliabilitas Jaringan Backbone Menggunakan Metode Monte Carlo
Sunardi, Universitas Ahmad Dahlan Yogyakarta
Ahmadi Djajasugita, Hendrawan, ITB Bandung
hend@telecom.ee.itb.ac.id
10 A-10 Evaluasi Kinerja Power Control Pada Cdma Sistem Berdasarkan Sir Dan Signal Strength
E. Nirwan, A Kurniawan, ITB Bandung
orcapro@bdg.centrin.net.id, adit@ltrgm.ee.itb.ac.id
11 A-11 Optimasi Topologi Jaringan Telekomunikasi MenggunakanAlgoritma Genetika
Jarot Sugiharto, PT Dirgantara Indonesia, Bandung
Ahmadi Djajasugita, Hendrawan, ITB Bandung
jsugi@indonesian-aerospace.com , j-sugih@yahoo.com
12 A-12 Kajian Forecasting dan Dimensioning Jaringan Studi Kasus : Telkom SMS
Hardi Nusantara, Priyo Wisaksono, ITB Bandung
hardi@telecom.ee.itb.ac.id
13 A-13 Kajian Identifikasi Trafik Short Message Services Untuk Perfomansi Jaringan Studi Kasus : Telkom SMS
Hardi Nusantara, Lydia Oktarini, ITB Bandung
hardi@telecom.ee.itb.ac.id
14 A-14 Kinerja Power Control Dengan StepsizeAdaptif Menggunakan Satu Bit Perintah Pada Sistem CDMA
W. Kusprasetyo, A Kurniawan, ITB Bandung
willy99@students.ee.itb.ac.id , adit@radar.ee.itb.ac.id
15 A-15 Antena Susun Discone Omnidireksional Untuk Base Stasiun Seluler Pada Frekuensi 890-960 MHz
Asep Barnas Simanjuntak, Politeknik Negeri Bandung
Adit Kurniawan, Endon Bharata, ITB Bandung
asepbs17@yahoo.com , adit@radar.ee.itb.ac.id
16 A-16 Pemakaian Kriptografi Kunci Publik denganAlgoritma RSAuntuk Keamanan Data XML
Budi Hartono, Universitas Stikubank Semarang
Jazi Eko Istiyanto, UGM Yogyakarta
pakbudi@yahoo.com , jazi@ugm.ac.id
17 A-17 Pengaruh AWGN dan Frame Loss pada Kanal terhadap Kinerja Federal Standard 2,4 Kbps MELP Vocoder
Amin Suharjono, Politeknik Negeri Semarang
 aminsj_polines@yahoo.com
18 A-18 Pengelolaan Data Pada Alat Komunikasi Bergerak
Jazi Eko Istiyanto, L Harryadhi, UGM Yogyakarta
jazi@ugm.ac.id , lharryadhi@yahoo.com
19 A-19 Pengukuran Dan Analisis Frame Latency Pada Switch ATM
Sigit Haryadi, Ridar Candradi, ITB Bandung
sigit@telecom.ee.itb.ac.id
20 A-20 Pengukuran danAnalisis Performansi Pelayanan Jasa Telekomunikasi ( Studi Kasus PT. TelkomArea Pelayanan "X")
Avon Budiyono, Ni Made Dwi Puspayanti, STT Telkom Bandung
Avo@stttelkom.ac.id , madedot@yahoo.com
21 A-21 Perbandingan Unjuk Kerja Sistem Frequency Diversity/Frequency Hopping Spread Spectrum Dengan Sistem Direct Sequence Spread
Spectrum
Aditya Umbu Tana Amah, UK Petra Surabaya
Barkah Sancoyo, F. Dalu Setiaji, UKSW Salatiga

Aamah@petra.ac.id
22 A-22 Perencanaan Jaringan SDHMenggunakanAlgoritma Genetik
Ridwansyah, Universitas Negeri Makassar
Nana Rachmana, Hendrawan, ITB Bandung
ridwansyah_94@yahoo.com
23 A-23 Perumusan Kebijakan Perawatan Untuk Meningkatkan Quality Of Service (Qos) Pada PSTN
Rino Andias, Sutrisno, Rd. Rohmat, Harfelia Desti, STT Telkom Bandung
rno@stttelkom.ac.id , roh@stttelom.ac.id
24 A-24 Point-to-Point 23 GHz Radio Link System Design For Tropical Region Implementation
Yusnita Rahayu, Jafri Din, Tharek Abdul Rahman, Universiti Teknologi Malaysia, Johor
Vannebula2001@yahoo.com
25 A-25 TCP-Friendly Congestion Control: Survei dan Taksonomi
Heru Sukoco, IPB Bogor
hsrkom@yahoo.com
26 A-26 Traffic Grooming Pada Jaringan WDM (Suatu Survey)
Beby H. A. Manafe, Johanis F. M. Bowakh, UNDANA Kupang
bebymanafe@yahoo.com , jbowakh@yahoo.com
27 A-27 Trafik Grooming pada Jaringan Optik Ring Bidirectional
Thomas Agung Setyawan, Politeknik Negeri Semarang
Thomas_agung_s@yahoo.com
28 A-28 Softswitch-based Telephony System for Rural Next Generation Network (R-NGN)
Yoanes Bandung, Armein Z.R. Langi, ITB Bandung
bandung@dsp.ee.itb.ac.id , langi@paume.itb.ac.id
29 A-29 Traffic Model of Internet and Mobile Communication
Setyawan Widyarto, Muhammad Shafie Abdul Latif, Universiti Teknologi Malaysia, Johor
swidyarto@lycos.co.uk , shafie@fsksm.utm.my
30 A-30 Optimasi Topologi Jaringan Telekomunikasi SDH Menggunakan Algoritma Greedy
Suharlin, Unjani Bandung
harlin@students.ee.Itb.ac.Id
31 A-31 Bit Error Rate Evaluation on WCDMA Systems
Thomas Sri Widodo, UGM Yogyakarta
thomas@mti.gadjahmada.edu
B DISTRIBUTED SYSTEMS
32 B-1 AData Analysis for Intrusion Detection Using Principal Component
Dahliyusmanto Dahlan,Abdul Hanan Abdullah, Universiti Teknologi Malaysia, Johor
yoes_mantho@hotmail.com , hanan@fsksm.utm.my
33 B-2 APasswordAuthentication Scheme With Secure Password Updating
Faisal. RM, Ab Rahman Ahmad, Universiti Teknologi Malaysia, Johor
faisalrm2003@hotmail.com , ahmadar@fsksm.utm.my
34 B-3 Analisis Kelemahan Cross Site Scripting pada PHP Nuke untuk Keamanan Website
 Imam Riadi, Universitas Ahmad Dahlan Yogyakarta
Jazi Eko Istiyanto, UGM Yogyakarta
imam_riadi@softhome.net , jazi@ugm.ac.id
35 B-4 Membangun Server Internet Menggunakan Open Source Software Berbasis GNU General Public License
Sigit Haryadi, Risna S Jatnika, ITB Bandung Sigit Haryadi, Risna S Jatnika, ITB Bandung
sigit@telecom.itb..ac.id
36 B-5 Pencarian Jalur Teroptimal dengan AlgoritmaA* pada Pencarian Spasial dan Join Spasial
Mochammad Zuliansyah, Universitas ARS Internasional Bandung
Kudrat Soemintapoera, Suhono Harso Supangkat, Yoga Priyana , ITB Bandung
mzazka@yahoo.com
37 B-6 Pengaruh Pembobotan Kata terhadap Kinerja Search-Engine
Rila Mandala, ITB Bandung
rila@if.itb.ac.id
38 B-7 Implementasi XML Firewall Untuk Keamanan Web Service
Tawar, Universitas Ahmad Dahlan Yogyakarta
Jazi Eko Istiyanto, UGM Yogyakarta
tawar@telkom.net , jazi@ugm.ac.id
39 B-8 Peningkatan Kinerja Load Balancing Dinamis Web-Server Cluster
Hendrawan, ITB Bandung
hend@telecom.itb.ac.id
40 B-9 The Optimization of Stepping Stone Detection: Comparison Steps
Mohd Nizam Omar, Mohd Aizaini Maarof, Anazida Zainal, Universiti Teknologi Malaysia, Johor
mc023003@siswa.utm.my , maarofma@fsksm.utm.my , anazida@fsksm.utm.my
41 B-10 Perbandingan Performansi Search-Engine antara Model Ruang-Vektor dengan Model Probabilistik
Rila Mandala, ITB Bandung
rila@if.itb.ac.id
42 B-11 Evaluasi Performansi Throughput / Delay pada MAC Protokol IEEE 802.11
Ahmad Taqwa,Politeknik Negeri Sriwijaya
Hendrawan,ITB Bandung
a_taqwa@yahoo.com , hend@telecom.itb.ac.id
43 B-12 Session Variable Techniques for E-Security Pass Management System
Mohd Taib Wahid, Muzahar Mohd Mukhtar, A.Z.M Kamruzzaman,University Technology of Malaysia, Johor
taib@fsksm.utm.my , muzahar@tm.net.my , akzaman@hotmail.com
44 B-13 Studi Sistem Visi Cerdas untuk Kendali Mutu Menggunakan Modular Automation Production System (MAPS)
Anton Satria Prabuwono, Universitas Budi Luhur Jakarta
Yuwaldi Away, Universiti Kebangsaan Malaysia
prabuwono@yahoo.com , yuwaldi@ftsm.ukm.my
45 B-14 Sistem Otomasi Bergerak Berbasis PLC Melalui SMS (Short Message Service) dan WAP (Wireless pplication Protocol)
Dr. Bambang Riyanto, Junko JJ Hutahaean, ST, ITB Bandung
briyanto@lskk.ee.itb.ac.id , jj.hutahaean@lycos.com
46 B-15 Network Intrusion Detection System BerbasisAgen
Iman Nurman, Sarwono Sutikno, Bambang Riyanto, ITB Bandung
iman@vlsi.itb.ac.id , ssarwono@ieee.org , briyanto@lskk.ee.itb.ac.id
47 B-16 AnAdaptive LQ Controller for TCP/AQM Networks
IDP. Eka Suwartadi, Carmadi Machbub, ITB Bandung
eka98@dsp.itb.ac.id , carmadi@lskk.ee.itb.ac.id
48 B-17 Implementasi IntegrasiAplikasi Terdistribusi Dengan Web Service
Ni Nyoman Victoria, Bambang Riyanto, ITB Bandung
victoria_inyo@yahoo.com , briyanto@lskk.ee.itb.ac.id
C TELEMATIC SERVICES & APPLICATIONS
49 C-1 Shadow Techniques in Computer Graphics for Real-Time
Lee Kong Weng, Daut Daman, Shafry Rahim, Universiti Teknologi Malaysia, Johor
kongweng79@hotmail.com , saandilian@hotmail.com
50 C-2 ATestbed for Low Cost Multimedia Telecommunication Networks For Tropical Environments
Armein Z. R. Langi, ITB Bandung
 langi@ieee.org
51 C-3 Aplikasi Optical Character Recognition Untuk Pendukung Bermain Gitar
Resmana Lim, Irwan K. J., Irwantoro, UK Petra Surabaya
resmana@peter.petra.ac.id
52 C-4 Application Layer Security System for M-Commerce Using J2ME™
Bambang Susilo, Suyanto, Fazmah Arif, STT Telkom Bandung
bambang_sso@yahoo.com , fay@stttelkom.ac.id , suy@stttelkom.ac.id
53 C-5 Membangun Webservice dengan Simple Object Acces Protocol (SOAP)
Jazi Eko Istiyanto,UGM Yogyakarta
Siti Imsyawati Maulidya, AKPRIND Yogyakarta
lia@akprind.ac.id , jazi@ugm.ac.id
54 C-6 Optimasi Pengkodean Sinyal Suara Berbasis MELP pada DSK TMS320VC5402
Hendrick Lambok, Yoanes Bandung, Bobby Wijaya, Armein Z.R Langi, ITB Bandung
lambok@dsp.itb.ac.id , bobby@dsp.ee.itb.ac.id , bandung@dsp.ee.itb.ac.id , langi@paume.itb.ac.id
55 C-7 Pengembangan Sistem Informasi ITB: menuju Smart Campus
Armein Z. R. Langi, ITB Bandung
langi@paume.itb.ac.id
56 C-8 Penurunan Laju Bit Federal Standard 2,4 Kbps MELP Vocoder dengan Metode Interpolasi Parameter Frame
Amin Suharjono,Tulus Pramuji,Politeknik Negeri Semarang
aminsj_polines@yahoo.com
57 C-9 Simple Chaos Based Image Encryption Menggunakan Satu Kunci Dan Dua Kunci
Susany Soplanit,Universitas Tarumanagara Jakarta
Retantyo Wardoyo,UGM Yogyakarta
susany@tarumanagara.ac.id , r_wardoyo@lycos.com
58 C-10 Animation Of Deformable Objects in Virtual Reality
Abdullah Bade,Saandilian Devadas,Daut Daman,Norhaida Mohd Suaib, Universiti Teknologi Malaysia, Johor
abd-lah@fsksm.utm.my , saandilian@hotmail.com , daut@fsksm.utm.my , haida@fsksm.utm.my
59 C-11 Penyembunyian Kunci Enkripsi Citra Pada Cipher-image
Susany Soplanit, Universitas Tarumanagara Jakarta
susany@tarumanagara.ac.id
60 C-12 Sistem Pengklasifikasian E-mail Otomatis dengan Metode Pembelajaran-Mesin
Rila Mandala, ITB Bandung
rila@if.itb.ac.id
61 C-13 Texture Defect Detection in Low Quality Images Using Wavelet Extension Transform and Gray Level Co-occurrence Matrix
Nazori Agani, Universitas Budi Luhur Jakarta
Syed Abd Rahman Al-Attas, Sheikh Hussain Sheikh Salleh, Universiti Teknologi Malaysia, Johor
nazori_agani@yahoo.com
62 C-14 Unjuk Kerja Kode Turbo Dalam Sistem CDMA2000 MenggunakanAlgoritma Dekoding Log Map
Sugihartono, Nana Rahmana, ITB Bandung
Sigit Yatmono, UNY Yogyakarta
63 C-15 Aplikasi SMS Broadcasting Untuk Penyebaran Informasi Melalui Telepon Seluler
Andreas Handojo, Candra Gunawan, Resmana Lim, UK Petra Surabaya
handojo@petra.ac.id , resmana@petra.ac.id
64 C-16 AReview of Visibility for Walkthrough Applications
Baldeve Paunoo,Daut Daman, Universiti Teknologi Malaysia, Johor
baldeve@msn.com , daut@fsksm.utm.my
65 C-17 Pengaruh Jumlah State Metode Hidden Markov Model Pada Proses Pengenalan Ucapan Dalam Bahasa Indonesia
Warih Maharani, STT Telkom Bandung
wrh@stttelkom.ac.id
66 C-18 Pengaruh Tahap Ekstraksi Ciri Dan Besar Buku Kode Terhadap Keberhasilan Pengenalan Ucapan Dengan Metode Hmm Diskrit
Warih Maharani, STT Telkom Bandung
wrh@stttelkom.ac.id
67 C-19 Digital Image Watermarking Using The Discrete Cosine TransformAnd The MD5 Cryptographic Hash Function
Wahyu Prakosa Adi,Volker Müller, UKDW Yogyakarta
wpadhi@ukdw.ac.id , vmueller@ukdw.ac.id
68 C-20 DSP System Rapid Prototyping on TMS320C54x Diginal Signal Processor
Bobby Wijaya, Jimmy Kurniawan, Erwin Cahyadi, Richson Untung, ITB Bandung
bobby@dsp.ee.itb.ac.id , jims_nsr@yahoo.com , erwin@dsp.itb.ac.id , richson@dsp.itb.ac.id
69 C-21 Proses Pengenalan Ucapan Berbahasa Indonesia Dengan Metoda Hidden Markov Models (HMM)
Warih Maharani, Gunawan Adi, STT Telkom Bandung
wrh@stttelkom.ac.id
70 C-22 Riset Masa Depan Telematika
Yuyu Wahyu, Rustini S. Kayatmo, LIPI Bandung
yuyuwahyusr@yahoo.com
71 C-23 Aplikasi Mobile Internet Berbasis Arsitektur Microsoft .Net Studi Kasus Aplikasi Layanan Akademik Online ITB
Moh Alwi Hasan, Tutun Juhana ITB Bandung
tutun@telecom.ee.itb.ac.id
 The 1st Conference on Telematics System, Services, and Applications 2004
Traffic Model of Internet and Mobile Communication
Setyawan Widyarto,1) Muhammad Shafie Abdul Latif 2)
Faculty of Computer Science and Information System, Universiti Teknologi Malaysia, 81310 UTM Skudai,
Johor,
Email: S.Widyarto@spymac.com, shafie@fsksm.utm.my
Summary
In this paper, some different approaches will be
described: a gas kinetic model or a fluid dynamics
model, a stochastic model e.g. model based on the
dynamics of individual agents, and cellular
automata (CA). Some different approaches based on
them will be discussed. An understanding of the
relation of concentration (density) and flow is the
basis for describing the traffic. The flow
concentration curve is called the fundamental
diagram of the traffic or the equation of state of
traffic theory.
Keywords
Traffic, macroscopic, microscopic models, Internet,
mobile communication.
1.Introduction
The traffic simulation models can be
categorized into macroscopic [1, 2, 3], microscopic
traffic simulation models [4, 5] which include
cellular automaton models [6, 7, 8, 9, 10, 11, 12],
and mixtures of both [13].
The discussion of traffic in this paper refers to
the traffic of Internet and mobile communication. An
agent represents calling or connection that occurred
in a network. The network in this paper focuses on a
wireless network. Since wireless communication is
becoming more popular, there is an increasing need
for mathematical models to help understand system
dynamics and analyze the performance of wireless
networks.
The mathematical models will be differentiated
into two main models i.e. a macroscopic model and
a microscopic model. Both models will be reviewed
and applied in the traffic control in communications
industry. Klar et al. [14] have surveyed different
types of mathematical models for vehicular traffic.
The macroscopic models treat agents as if they
are dynamically flowing or continuous and base on
equations for collective quantities. On the other hand
176
A-29
in the microscopic model, each agent is described by
its own equation(s) of motion. Therefore, the
microscopic models are more stochastic than the
macroscopic model.
2.Problem Statement
The motivation for this research is the traffic
congestion problem and then discussing the remedial
measures. The congestion of the traffic of Internet
and mobile communication may be preceded by
slow connection speed, failed to be connected or
delivered, and failed to make a call. In fact, it has
been realized that many traffic problems can be
resolved by influencing (controlling) traffic flow by
using various traffic control measures. However, an
excellence performance of the traffic will be only
achieved when we are able to control the traffic.
Before we manage to control the traffic we may need
some simulation of control variables and to make a
simulation we need a model. Therefore, knowing a
traffic flow model is a must.
3.Traffic Control in Communications
Industry: Internet and Mobile
Communication as a Case Study
There is a trend that the future of the Internet is
increasingly wireless. The wireless increase includes
devices that go beyond today's PCs. As explosive
growth of the Internet can be witnessed the growth
has been a prelude for an emerging phase with even
more impressive potential. Predictably, the future of
the Internet is predominantly pervasive and no
longer centered on the traditional connection line
and traditional PCs. The present developing trend,
which has started in some countries, is that Mobile
Internet Server (MIS) and Personal Digital Assistant
(PDA) are becoming more common. An illustration
of MIS is shown in Figure1
A-29 The 1st Conference on Telematics System, Services, and Applications 2004
Fig. 1 Mobile Internet Server (MIS).
According to the UMTS Forum [15], an
industry consortium, there is currently
approximately 340 megahertz (MHz) of spectrum
available for use over GSM and 3G networks.
However, the UMTS Forum predicts that demand
for high-speed data and voice services will begin to
exceed available 3G spectrums by 2005. This
limited spectrum will lead to a perturbation or
congestion when it is full.
4.Approaches of Traffic Models and
Their Characteristics
We categorize liquid and gas are both fluids: in
contrast to solids they lack the ability to resist
deformation. A fluid cannot resist the deformation
force, it moves, it flows under the action of the
force. Its shape will change continuously as long as
the force is applied Figure 2. On the other hand, a
solid can resist a deformation force while at rest, this
force may cause some displacement but the solid
does not continue to move indefinitely. From
features of both fluids and solids, usually models are
inspired.
Fig 2. Shearing force, F, acting on a 3d fluid
element.
4.1Macroscopic Models
The macroscopic models base on equations for
collective quantities and treat agents as if they are
dynamically flowing or continuous (streams of fluid
without a beginning or end). So that, they are not
suitable for capturing the discrete dynamics that may
177
arise from the interaction of individual agents. Thus,
the overall flow rate that is influenced by density and
velocity becomes the main feature.
There are some important variables in this
model. They are the average spatial density ρ(r; t)
per lane (at place r and time t), the average velocity
V (r; t), and maybe also the velocity variance Θ(r;
t). Their simulation time and memory requirements
mainly depend on the discretization Δr and Δt of
space r and time t, but not on the number N of
agents. Therefore, macroscopic traffic models are
suitable for real-time traffic simulations. The quality
and reliability of the simulation results mainly
depend on the correctness of the applied
macroscopic equations and the choice of a suitable
numerical integration method.
4.1.1A Gas kinetic Model
This model is to express of some traffic system
in such a way that the idealization of reality follows
gas kinetic features.
A statistical description of a system can be made in
terms of the distribution function f(r,c,t) where
f(r,c,t) is defined such that f(r,c,t)drdc is the number
of molecules at time t positioned between r and r+dr
which have velocities in the range c → c+dc.
Consider a gas in which an external force mF acts
and assume initially that no collision take place
between the gas molecules. In time dt the velocity c
of any molecule will change to c+Fdt and its
position r will change to r+cdt. Buick [17] derived
the classical Boltzmann equation defined the
macroscopic quantities of mass, velocity and energy
in terms of distribution function which described
fluid.
The Boltzmann equation (1)
∂ t f + c α ∂ α f + Fα ∂ cα f = Ω ( f ) (1)
where, Ω ( f ) is the collision operator and
∂ ∂ ∂
∂t = ,∂ α = , ∂ cα = (2)
∂t ∂ rα ∂ cα
The fluid density ρ, velocity u and internal energy e
can be found from the distribution function f as
follows:
ρ (r,t ) = ∫ mf(r,c,t)dc (3)
ρ(r,t)u(r,t) = ∫ mcf(r,c,t)dc (4)
The 1st Conference on Telematics System, Services, and Applications 2004 A-29

1 rate of avoiding maneuvers/ collision and stopping

2∫
ρ(r,t)e(r,t) = mu 20 f(r,c,t)dc (5) processes/ deadlock) becomes minimal, if flow of
agents with opposite desired directions of motion
where m is the molecular mass and u0 is the peculiar use separate lanes. The width of the lanes can again
velocity with respect to the fluid flow. The internal be evaluated with the equilibrium condition for the
energy can be shown to be mutual pressure of both flows [20]. The width of the
lane is counterpart with the width of the spectrum.
3 Günther [21] was able to avoid the
e= k BT (6)
2m inconsistencies, in particular the appearance of
negative velocities, observed for the original
where T is the temperature and kB is the Payne/Whitham models.
Boltzmann’s constant.
The (gas) kinetic equations have been 4.1.2A Fluid Dynamics Model
developed for the description of vehicular traffic
flow [17, 18]. Waldeer [19] made simulation Monte Fluid motion can be simple flows such as
Carlo method applied to a Boltzmann-like vehicular laminar flow in a pipe, to more complex flows such
traffic flow model. as vortex shedding behind cylinders, wave motion
In the developed model [19] all traffic flow and turbulence. Fluid motion is governed by the
features are calculated from the single agent state continuity equation (Equation 1) and the Navier-
probability density f, where f (r, u, a, t) dr du da is Stokes equation.
the probability of finding an agent between r and r + m = ρ 1A1 U1 = ρ 2 A 2 U 2 = C (8)
dr with velocity between u and u + du and for a fluid with mass flow rate m  , density ρ,
acceleration value between a and a + da. For a velocity U , and the area of the pipe cross section A
spatial homogeneous traffic flow, the time (Fig 3).
propagation of the r-independent function f (u, a, t)
then reduces the basic master equation into a
Boltzmann equation.
∂f ∂f
+ a =
∂t ∂u
∫ (∑ (a u, a ) ( ) ∑ (a
, u , a f a l , u, t − )
u, a, u , a f ( a, u, t ) )
l l

f ( a , u , t ) du da da l
(7)
Here ( u , a ) is the kinematic state of the
Fig. 3 Continuity equation illustration
leading agent and Σ is the weighted interaction rate The Navier-Stokes equations are used to
function of the process. describe fluid motion. They are valid for
The left part of the equation is the total change incompressible, Newtonian fluids in both laminar
of f in time, which equals the total change rate on the and turbulent flow. In the latter, velocity
right side. Changes only occur due to interactions, components [i.e. u, v, w] fluctuate randomly with
producing jumps in the acceleration value of the respect to time. Navier-Stokes in cartesian co-
following agent. Assuming that the duration of such ordinates in the x, y, z -direction:
an acceleration change is small against all other  ∂u ∂u ∂u ∂u ∂P  ∂ 2u ∂ 2u ∂ 2u 
process intrinsic timescales, the total change rate can ∂  + u + v + w  = − + ρ g x + µ  2 + 2 + 2 
be expressed by the Boltzmann-like interaction  ∂t ∂x ∂y ∂z ∂x  ∂x ∂y ∂z 

integral mentioned in Eq. (7).  ∂v ∂v ∂v ∂ v ∂P  ∂ 2v ∂ 2v ∂ 2v 

The gas kinetic formulation has some analogies ∂  + u + v + w  = − + ρ g x + µ  2 + + 
 ∂t ∂x ∂y ∂z ∂y  ∂x ∂ y 2 ∂ z 2 
with the description of ordinary gases, but it takes
 ∂w ∂w ∂w ∂w ∂P  ∂ 2w ∂ 2w ∂ 2w 
into account the effect of agent intentions and ∂  + u + v + w  = − + ρ g x + µ  2 + 2 + 2 
interactions. Some similarities and differences  ∂t ∂x ∂y ∂z ∂z  ∂x ∂y ∂z 
between traffic and ordinary gases shall be (9)
illustrated by an example of the separation of
Leung et al. [22] have developed the
opposite directions of motion.
deterministic fluid model. The model has two
In a traffic area, at least two opposite directions
versions: a time-nonhomogeneous model and a time-
of motion/flows can be normally found. In a
homogeneous model. The two partial differential
communication, the opposite directions are sending
and receiving status. The interaction rate (i.e. the
178
A-29 The 1st Conference on Telematics System, Services, and Applications 2004

equations PDE’s become ordinary differential 7]. However, although they reproduce the main
equations (ODE’s) in the time homogeneous model. effects of traffic flow, they are not very suitable for
Helbing [23] showed that Paveri-Fontana's detailed predictions because of their coarse-grained
traffic equation allows the derivation of macroscopic description.
moment equations which build a system of non- Therefore, some authors prefer macroscopic
closed equations. This system can be closed by the traffic models [24, 25, 26, 27, 28, 29].
well proved method of Chapman and Enskog which
leads to Euler-like traffic equations in zeroth-order 4.2.1Cellular Automata (CA)
approximation and to Navier-Stokes-like traffic
CAs are dynamical systems in which time and
equations in first-order approximation (Eq.10).
space are discrete. A cellular automaton consists of a
regular grid of cells (sites), each of which can be in
∂ ρ ∂ ( ρV )
+ = 0, one of a finite number of k possible states, updated
∂t ∂r synchronously in discrete time steps according to a
∂V ∂V 1 ∂P 1
+V = − + [Ve ( ρ,V,Θ ) − V ], local, identical interaction rule. The state of a
∂t ∂r ρ ∂r τ cellular automaton is completely specified by the
∂Θ ∂Θ 2P ∂ V 1 ∂  ∂Θ  values of the variables at each cell. The variables at
+V = − + K  each cell are updated simultaneously, based on the
∂t ∂r ρ ∂r ρ ∂r  ∂r 
values of the variables in their neighborhood at the
2 ∂Θ
+ ( C − Θ ) + (1 − p ) K preceding time step, and controlled stochastically by
τ ∂r
a definite set of rules. In other word, the state of a
(10) cell is determined by the previous states of a
surrounding neighborhood of cells. [30, 31]. Cellular
Equations (10) are the Navier-Stokes-like automata (CA) were originally conceived by Ulam
traffic equations. Compared with the Navier-Stokes and von Neumann in the 1940s to provide a formal
equations for ordinary fluids they possess the framework for investigating the behavior of
additional terms (Ve-V)/τ and 2(Θe-Θ)/τ with Θe complex, extended systems [32].
=C+( τ/2)(1-p)K ∂ which are due to acceleration and A one-dimensional CA is illustrated in Figure 4
interaction processes. Because of the spatial one- (based on [33]).
dimensionality of the considered traffic equations,
the velocity equation (10b) does not include a shear
viscosity term (1/ρ) ∂ / ∂ r(vo ∂ V/ ∂ r). The variance
equation (10c) is related to the equation of heat
conduction. However, Θ does not have the
interpretation of `heat' but only of velocity variance,
here.
4.2Microscopic models
The microscopic model treat agents as if they
independently move as an individual. Each agent is
described by its own equation(s) of motion. This Figure 4: Illustration of a one-dimensional, 2-state
model strongly corresponds with the number N of CA (based on. Each cell can be in one of two states,
simulated agents. In general, this model assumes denoted 0 and 1. The connectivity radius is r=1,
uniform velocities for all agents Therefore, the meaning that each cell has two neighbors, one to its
individual characteristics of agents have big effect of immediate left and one to its immediate right. Grid
group behavior, for example if an agent felt down. size is N=15. The rule table for updating the grid is
The microscopic models are more stochastic than the shown on top. The grid configuration over one time
macroscopic model. step is shown at the bottom. The grid is viewed as a
In microscopic traffic models each agent is circle, with the leftmost and rightmost cells each
described by its own equation(s) of motion. acting as the other's neighbor.
Consequently, computer time and memory
requirements of corresponding traffic simulations
increase proportional to the number N of simulated
agents. Therefore, this kind of models is mainly
suitable for off-line traffic simulations.
For this reason, micro simulation models that
allow bit-handling have been developed for the
simulation of large freeways or freeway networks [6,

179
The 1st Conference on Telematics System, Services, and Applications 2004
5.Research Development Overview and
on Going Research Result
From a fictitious data the result shown in Fig 5.
Under conditions of normal communicating, the time
for number simulated agents to leave a certain
spectrum of GSM or 3G network decreases with
growing initial velocity (Fig 5.a). For example,
determined velocity is 1.5 agent per unit time, if the
velocities higher than 1.5 reduce the efficiency of
leaving. This becomes particularly clear when the
flow rate is divided by the desired velocity (Fig.
5.b).
Fig 5.a. Velocity - time leaving
Fig 5.b. Velocity - Flow/determined velocity
6.Conclusion
Different types of mathematical models for
traffic flow have been surveyed. This paper has
given overview of several models for the flow and
also given some results leading to the conclusion
that ‘speeding’ will initiate congestion. In other
words, when the spectrum cannot stand for higher
capacity the congestion will occur.
Acknowledgments
We wish to acknowledge with gratitude the
special communicating email with Tamas Vicsek
one of the writers Simulating dynamical features of
escape panic (Nature, Vol 407, 28 September 2000 |
www.nature.com)
180
A-29
References
[1] M. Cremer and A. D. May, ‘An Extended Traffic
Model for Freeway Control’ (Research Report UCB-
ITS-RR-85-7, Institute of Transportation Studies,
University of California, Berkeley), 1985
[2] R.D. Kühne and M.B. Rödiger. ‘Macroscopic
simulation model for freeway traffic with jams and
stop-start waves”. In B.L. Nelson, W.D. Kelton, and
G.M. Clark, editors, Proceedings of the 1991 Winter
Simulation Conference, page 762, 1991.
[3] B. S. Kerner and P. Konhäuser, “Cluster effect in
initially homogeneous traffic flow”, Phys. Rev. E 48,
2335-2338 (1993).
[4] A. Alvarez, J. J. Brey, and J. M. Casado, “A
simulation model for traffic flowwith passing,”
Transportation Research B 24, 193-202 (1990).
[5] Rathi, A.K. and Santiago, A.J. "The new NETSIM
simulation program,” Traff. Engng. Control, 31(5),
pp 317-320, 1990
[6] M. Cremer and J. Ludwig. “A fast simulation model
for traffic flow on the basis of boolean operations”,
Mathematics and Computers in Simulation,
(28):297–303, 1986
[7] K. Nagel, A. Schleicher: “Microscopic Traffic
Modeling on Parallel High Performance Computers,”
Parallel Computing 20(1): 125-146 (1994)
[8] K. Nagel and S. Rasmussen, "Traffic at the edge of
chaos," pages 222-235 in Proceedings of the
Artificial Life IV meeting, edited by R. A. Brooks
and P.Maes, MIT Press, 1994.
[9] K. Nagel and M. Schreckenberg. “Cellular
automaton model for freeway traffic,” J. Physique I
(France), 2:2221, 1992
[10] J. A. Cuesta, F. C. Martínez, J. M. Molera, and A.
Sánchez, “Phase transitions in two-dimensional
traffic-flow models,” Phys. Rev. E 48, R4175–R4178
1993
[11] T. Nagatani, “Jamming transition in the traffic-flow
model with two-level crossings,” Phys. Rev. E 48,
3290 –3294, 1993.
[12] O. Biham, A. A. Middleton, and D. Levine, “Self-
organization and a dynamical transition in traffic-
flow models,” Phys. Rev. A 46, R6124 -R6127,
1992.
[13] R. Wiedemann and T. Schwerdtfeger, Straßenbau
und Straßenverkehrstechnik (Bundesminister für
Verkehr, Abteilung Straßenbau, Bonn, Germany),
Vol. 500,. 1987
[14] A. Klar, R. Kuehne, and R. Wegener, “Mathematical
models for vehicular traffic,” Surv. Math. Ind., 6, p.
215. 1996,
[15] http://www.umts-forum.org/ (last accessed: Thursday
29 | 04 | 2004)
[16] James Maxwell Buick, “Lattice Boltzmann Methods
in Interfacial Wave Modelling” Ph D Thesis, the
University of Edinburg, 1997.
[17] R. Wegener and A. Klar, “A kinetic model for
vehicular traffic derived from a stochastic
microscopic model,” Transport Theory and Statistical
Physics, 25 (1996), p. 785.
[18] Serge P. Hoogendoorn and Piet H. L. Bovy, “Generic
gas-kinetic traffic systems modeling with
A-29 The 1st Conference on Telematics System, Services, and Applications 2004

applications to vehicular traffic flow,” Transportation flow model,” Computer Physics Communications,
Research Part B: Methodological, Volume 35, Issue Volume 156, Issue 1, Pages 1-12, 1 December-15
4, Pages 317-336,. May 2001 December 2003
[19] K. T. Waldeer, “The direct simulation Monte Carlo
method applied to a Boltzmann-like vehicular traffic
[20] Helbing, D. “A Fluid Dynamic Model for the Setyawan Widyarto received
Movement of Pedestrians”. Complex Systems 6, the M.Sc. degrees in
391-415, 1992. Manufacturing and Systems
[21] M. Günther, A. Klar and T. Materne R. Wegener, Engineering from the University
“An explicitly solvable kinetic model for vehicular of Bradford in 1998 and
traffic and associated macroscopic equations”, continued for advanced studied
Mathematical and Computer Modelling Volume Automation and Control System
35, Issues 5-6, Pages 591-606, 2002 Engineering in the University of
[22] K. K. Leung, W. A. Massey and W. Whitt, “Traffic Shefield till 2000. Now he is
models for wireless communication networks,” doing research for PhD in
IEEE J. Sel. Areas Commun. 12, 1353—1364, Computer Science and
1994. Information System, Universiti
[23] Helbing D, “ Gas-kinetic derivation of Navier- Teknologi Malaysia
Stokes-like traffic equations,” Journal-ref: Physical
Review E 53, 2366-2381, 1996.
[24] M. Papageorgiou, “Applications of Automatic
Control Concepts to Traffic Flow Modeling and Muhammad Shafie Abdul
Control,” Springer, Heidelberg, Germany, 1983. Latif received Diploma, BSc,
[25] S. A. Smulders,”Modelling and Simulation of and MSc degrees in Computer
Freeway Traffic Flow,” (Report OS-R8615, Centre Science from Universiti
for Mathematics and Computer Science, Teknologi Malaysia in 1984,
Amsterdam, 1986); in Proceedings of the 10th 1986 and 1995, respectively.
International Symposium on Transportation and PhD in Modelling, Simulation
Traffic Theory,ed. N. H. Gartner and N. H. M. and Animation in Virtual
Wilson (Elsevier, New York, 1987). Environments (Bradford
[26] D. Helbing,, “Improved fluid-dynamic model for University, United Kingdom)
vehicular traffic,”D. Phys. Rev. E 51, pp. 3164- February 2002
3169, 1995.
[27] M. Hilliges and W. Weidlich, “A
phenomenological model for dynamic traffic flow
in networks,” Transportation Research B 29, 407-
431, 1995.
[28] M. Hilliges, R. Reiner, and W. Weidlich, “A
simulation model of dynamic traffic flow in
networks,” in Proceedings of the 1993 European
Modelling and Simulation Multiconference,
pp.505-510 edited by A. Pave (Society for
Computer Simulation International, Ghent,
Belgium, 1993.
[29] B. S. Kerner and P. Konhäuser, “Structure and
parameters of clusters in traffic flow,” Phys. Rev. E
50, 54 –83, 1994.
[30] Wolfram. S. “Universality and complexity in
cellular automata,”. Physica D, 10:1-35, 1984.
[31] Nagel, K., "Particle Hopping Models and Traffic
Flow Theory," Physical Review E,Vol.53, No. 5,
pp. 4655-4672, 1996.
[32] M. Sipper, “Machine Nature: The Coming Age of
Bio-Inspired Computing,” McGraw-Hill, New
York, 2002
[33] M. Mitchell. “An Introduction to Genetic
Algorithms,”. MIT Press, Cambridge, MA, 1996.

181