I

SSNPrint
: -
Vol
ume
: . I
ssue
: , J
une
 International Journal of Communication and Networking System (IJCNES)
ISSN: 2278-2427
Volume: 01. Issue: 01, June 2012

Contents

1. Performance Evaluation using STP Across Layer 2 VLANs 01-08

1
Nada Al-Balushi, 2Rahma Al-Klabani 3Faizal Hajmohideen

2. A Critical Study of Data Security in Selected Co-Operative Units of 09-15

Warana Udyog Samuha

Prof. Babasaheb J. Mohite

3. Innovative Method of Software Testing Environment Using Cloud Computing Technology 16-22

S. Ravichandran

4. An Efficient Approach for Using the Wireless Sensor Networks in Mobile Computing 23-30

1
V.khanaa, 2 Krishna Mohanta

5. Low Cost Communication Link for Intelligent Public Transport System with Dynamic Protocol 31-35
Ranjana Dinkar Raut,Vineet Kumar Goyal, Nikhil Arora

6. Comparison of Propagation Models for Small Urban Cells in GSM Network 36-42

Naima Bouzera1,Abdelkrime Kheirddine2

7. Multiuser Interface Optical Code Division Multiple Access System 43-45

Shweta Patel1, Mukesh Tiwari 2, Jaikaran Singh 3

8. Wireless Information Security System Via Role Based Access Control Pattern Use Case Design 46-48

K.Subramanian1, V.Kanhaa
 International Journal of Communication and Networking System (IJCNES)
ISSN: 2278-2427
Volume: 01. Issue: 01, June 2012

Editor-In-Chief

Dr. A. Clementking,
Associate Professor, Department of Computer Science, King Khalid University, Abha, Kindom of Saudi Arabia

Associate Editor

Albert Alexander S,
Professor, Department of Electrical and Computer Engineering,
Northeastern University, Boston, MA, USA

Editorial Board Members

Dr. K. P. Yadav
Director (Academic & Research), IIMT College of Engineering , Greater Noida, U.P.

Dr. Angel Latha Mary S

Karpagam College of Engineering(Autonomous),Coimbatore,India

Dr. Kulandaivel M.P,

Al Musanna College of Technology, Oman

Dr. Liau Vui Kien,

UCSI University, Malaysia

Dr. Hoang Do Thanh Tung,

Head of Management Systems Vietnam Academy of Science and Technology, Vietnam

Dr. Kyun-Yong Chung,

Deportment of Computer Information Engineering, Sangji University, Korea

Dr. Tzung-Pei Hong,

National University of Kaohsiung, Taiwan

Dr. Thamer M. Jamel,

University of Technology, Baghdad, Iraq
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.1-8
ISSN: 2278-2427

Performance Evaluation using STP Across Layer 2

VLANs
1
Nada Al-Balushi, 2Rahma Al-Klabani 3Faizal Hajmohideen
1,2
Undergraduates,3Lecturer, Salalah College of Technology, Oman
1
njaalb20@hotmail.com, 2gazal117.ka@gmail.com, 3faizal.h@gmail.com

Abstract-The network security and performance are the major

factors to be considered for end user at usage level in a hybrid
communication network. In terms of security and performance
of network are studied in many cases but it requires being
explored more based on the size of the network and the end
user handling at lower layer of OSI model. There are
voluminous steps taken to consider the issues such as Layer - 2
Exploitation, the inability of a device to perform the required
services at time due to redundant switch loops. This study
evaluates the security issues and the performance issues
VLAN is a virtual LAN and it is a broadcast domain created by
together with the trial of VLAN (Virtual LAN) security
switches. Because switches can talk to each other, you need to
perspective and STP (Spanning Tree Protocol) loop free
configure VLAN when your network gets so large and has so
performance aspect. The real time devices such as router,
much traffic. VLAN logically divide a switch into multiple,
switches are used to carry out experiment and the network
independent switches at Layer-2. They enhance network
behavior observed using wireshark. The different CLI outputs
security by keeping sensitive devices on a separate VLAN.
generated are evaluated the security and performance issues
They increase the number of broadcast domains while
coherently using show commands. This project experiments
decreasing the size of the broadcast domains to reduce
security and performance issues together with help of VLAN
overhead. There are VLAN protocols VTP(VLAN Trunking
and STP and suggests the best practice of VLAN and STP in
Protocols) and its parameters for instance VTP mode, VTP
typical hybrid network environment.
Domain, VTP password, Port security, BPDU guard, STP port
fast and IEEE 802.1q tagging are as considered as security
Keywords: STP, PVST, RPVST, Security, VLAN, Layer-2,
perspectives in this study and evaluated accordingly. The
wireshark
Spanning Tree Protocol (STP) is a network protocol that
ensures a loop-free topology for any bridged Ethernet local
I. INTRODUCTION
area network. STP solves the performance issue in the network
by allowing a network design to include standby links to
In a communication network the security and performance
provide automatic backup paths if an active link fails, without
aspects are the major factors to be considered for usage level.
the danger of bridge loops, or the need for manual
The network security and the performance are the major
enabling/disabling of these backup links. This paper analyses
impact in organizational usage concern. This study carried out
types of STP in relations with PVST (Per VLAN Spanning
in many cases as basic security measures and performance
Tree) and PVST+(Per VLAN Spanning Tree Plus) are
evaluation but it requires being explored more based on the
considered for network performance in a switch based
size of the network and the functional usage at lower layer of
network. The BPDU(Bridge Protocol Data Unit) are monitored
OSI model. There are voluminous steps taken to consider the
between and the data path. It is a message that is exchanged
issues such as Layer-2 Exploitation such as MAC Flooding
across the switches within an extended LAN that uses a
Attack, ARP Attacks, Multicast Brute Force Attack and
spanning tree protocol topology. The figure-1 shows the
Random Frame Stress Attack [1]. These attacks meant for Data
topology used for the experiment.
link Layer. It has to be prevented in a way the network is
giving uninterruptible services to the users. The inability of a
The following are the STP process occur in the switched
device to perform the required services at time due to
network are normally a root bridge is elected and each switch
redundant switch loops. This project is trying to give solution
uses the Spanning Tree Algorithm to determine the shortest
for the basic security issues and the performance issues
path to the root bridge, each switch takes into consideration of
together with the analysis of VLAN (Virtual LAN) security
the port speed against the bandwidth for which port to block
perspective and STP (Spanning Tree Protocol) loop free
and unblock; path cost is calculated using port speeds against
performance aspect.
1
Integrated Intelligent Research(IIR)
bandwidth also, so if there are two paths to single destination,
the path with the lowermost cost is selected, finally port roles
are assigned based on the Spanning Tree Algorithm calculated
path to use for converge into networks. The default IEEE port
costs are 10Gbps = 2, 1Gbps = 4, 100Mbps = 19 and 10Mbps
= 100. The lower the path cost leads the better /shorter the path
to the destination [2]The following passage brings the
fundamental concepts of Layer – 2 VLAN in terms of
performance and security. It includes mainly the STP switch
port states such as blocking, listening learning, forwarding and
disable. There are commands used in the experiment to verify
the spanning tree port states. And also the states indicate the
performance at Layer -2 switch port status. It creates overall
involvement in security as it blocks the unwanted traffic in the
entry level as ingress filter.
The STP blocking states are the state in which a port that
would reason behind a switching loop, no user data is sent or
received. Actually this port may go into forwarding mode if the
other links in use were to fail and the spanning tree algorithm
determines the port may transition to the forwarding state.
BPDU data is still received in blocking state.The STP listening
states make BPDUs and await possible new information that
would cause it to return to the blocking state. It is as
considered as inert state but it heed and does not populate the
MAC address table and it does not forward frames.The STP
learning states are the port that does not yet forward frames it
does learn source addresses from frames received and adds
them to the filtering the switch database. It does populate the
MAC Address table.The STP forwarding states that are
receiving and sending data through a switch port and monitors
incoming BPDUs that would indicate it should return to the
blocking state to prevent a loop. Finally the disable state
indicates STP is not concerned as the port can be disabled at
any stage of Layer – 2 transactions [3].The real time devices
ensured the network security and performance in this study.
Initially this study used cisco simulator packet tracer for the
learning the objectives as shown in the figure -1 to carryout
experiment with network behavior. Due to the limitation in the
simulator this study has been experimented with real time
devices The different CLI outputs generated are evaluated
security purposes and for performance coherently using wire
shark as a tool for observing and monitoring packet flow. This
project assesses security and performance by implementing
STP types PVST and PVST+ then suggests the best possible
basic security features and STP types for the security enhanced
Layer – 2 VLANs.
A. Related work
The network giant cisco has already progressed with layer – 2
security issues in many aspects. They considered VLAN is one
among the major thread involving security weakness such as
VLAN related attacks explained in cisco documents and
portraits the importance of those attacks [4]. Several works
have studied VLAN design in enterprise networks [5].
Characterizes of VLAN usage in one operational network and
2
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.1-8
ISSN: 2278-2427
exposes several degenerate designs. The feasibility of adopting
a systematic approach is shown in the VLAN design of green
field networks that are yet to be deployed[6]. Other works
include the use of traffic data [7, 8] to expose degenerate
design patterns, understand VLAN traffic patterns, and
correlate cross-layer faults. By contrast, this work focuses on
designing systematic algorithms for automating common
VLAN operational tasks. Further, the experience of designing
and implementing the VLAN configuration toolkit, and the
insight from its initial deployment are also unique. QoS-aware
Multiple Spanning Tree Mechanism over a Bridged LAN
Environment, the significant use of use the Multiple Spanning
Tree protocols with regard to QoS, voice and video data
comparison have studied. The Diffserv framework and propose
a novel, simple and yet highly effective enhancement to the
Multiple Spanning Tree protocol to achieve high degree of
QoS by keeping in perspective the different characteristics of
the various straffic types. The Multiple spanning tree protocol
achieves only geographical load balancing, and doesn’t take
into account the varied characteristics of the traffic passing
through it apart from the simple priority queuing
technique[9].To manage with the inadequacy of the inheritance
in IEEE 802.1D/W standard, the IEEE 802.1S [10] working
group investigated the overlay mechanism of multiple trees
instead of a singles panning tree. This additional approach
enhances the facility for IEEE802.1Q encapsulation standard
and tagging method [11] VLAN (Virtual LAN) bridges to use
multiples panning trees, providing for traffic belonging to
different VLANs to flow over hypothetically different paths
within the virtual bridged LAN and give more security. A
VLAN is a group of end stations with a common set of
requirements and it segments a broad cast domain which is the
extent that a broadcast frame propagates through a layer –
2networks, independent of physical location. There also exist
industry efforts like the Cisco VLAN Trunk Protocol [11] to
manage VLANs; however such efforts are limited in
functionality.This paper diverges from the view of other study,
here it discusses and experiments the VLAN and STP
performance in a real time network topology. This
paperrecommends the best possible PVST and the basic
security always required to be installed in the Layer – 2
VLAN.
II. METHODOLOGY
This section discusses the environment and procedures in
which the experiment was carried out.
A. Experimental setup
The core topology designed and configured for the experiment
using the real time high end cisco devices, such as the Switch
C3750 with IOS SoftwareC3750-IPBASE-M, Version
12.2(25), ROM Bootstrap 3750 Boot Loader C3750-HBOOT-
M, Processor WS-C3750G-24PS (PowerPC405), Processor
board ID FOC1041Y13Z with 118784K/12280K bytes of
memory; the Switch C2960 with IOS Software C2960-
Integrated Intelligent Research(IIR)
LANBASE-M, Version 12.2(25),ROM Bootstrap C2960 boot
loader C2960-HBOOT-M, ProcessorWS-C2960G-24TC-
LPowerPC405,processor board's IDs FOC1130W5KV and
FOC1108U1V3 with 61440K/4088K bytes of memories; the
Router 2800 with IOS Software C2800NM-IPBASE-M,
Version 12.4(3h), ROM Bootstrap Version 12.4, Processor
board ID FCZ114473FH with 251904K/10240K bytes of
memory, NVRAM 239K bytes of non-volatile configuration
memory, 62720K bytes of ATA Compact Flash (Read/Write),
DRAM configuration is 64 bits wide with parity enabled.
These devices are interconnected using UTP CAT-6 CABLES.
The PuTTY is used for consoling the router and switches via
management interfaces. PuTTY is a free and open source
terminal emulator application which can act as a client for the
SSH, Telnet, rlogin, and raw TCP computing protocols and as
a serial console client for the cisco router and switches [12].
Figure-2 shows below the configuration of STP and VLAN.
B. The Logical Topology
The logical topology is mull over for the configuration of
secured VLAN and the purpose of analyzing the STP
performance. The VLANs are named VLAN10, VLAN20 and
VLAN30 with VLAN ID 10, 20, 30 respectively. The access
ports are configured between the pcs and the switches. An
access port typically transports traffic for a single VLAN; the
VLAN associated with a port may be either statically
configured or dynamically assigned when the host connects,
based on the host’s MAC address. In either case, the access
port can tag incoming frames with the 12-bit VLAN identifier
and removes the tag from outgoing frames, obviating the need
for the hosts to support VLANs.The switches and the router the
trunk ports are configured for the Inter VLAN communication.
In contrast, a trunk port may carry traffic for multiple VLANs;
for example, switch S1’s port connecting to S2,S3 must
forward traffic for both VLAN10, VLAN20 and VLAN30 and
participate in each VLAN’s spanning tree protocol. The
administrators either manually configure each trunk port with a
list of VLAN identifiers, or run a protocol like VTP (VLAN
Trunking Protocol) [13] to manually determine which VLANs
3
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.1-8
ISSN: 2278-2427
a trunk link should handle. Configuring a VLAN also requires
configuring the gateway router to announce the associated IP
prefixes into the routing protocol; each host interface must be
assigned an IP address from the prefix associated with its
VLAN.The Cross over cables used between the switches to
create loops for the STP to control its performance over the
physically created loop. The virtual interfaces or the sub
interfaces are created as part of VLAN tagging mechanism
usage and gateway to the end user systems.
C. Implemented STP Types
The Spanning Tree Protocols used for the analysis purposes are
listed below in detail and the configuration method in each
analysis also stated in order to understand the performance in
such network. Initially the switch S1, S2 and S3 are configured
with PVST, MST and RPVST at time each mode. The
observation is done on each time the STP mode is configured.
The mixed STP mode strategy used for all the switches S1, S2
and S3 in which switch S1 is used PVST, S2 is used RPVST,
S3 is used MST vice versa. The performance of all the modes
are observed and details of each transaction using FTP is
studied. Based on the performance of each STP mode the best
STP mode is suggested to use for a particular network.
Per-VLAN Spanning Tree Protocol (PVST), it maintains a
spanning-tree instance for each VLAN configured in the
network. It uses ISL trunking protocol that allows a VLAN
trunk to be forwarding for some VLANs while blocking for
other VLANs. Because PVST treats each VLAN as a separate
network, it can load balance traffic at Layer 2 by forwarding
some VLANs on one trunk and other VLANs on another trunk
without causing a loop. For PVST, Cisco developed a number
of proprietary extensions to the original IEEE 802.1D STP,
such as Backbone Fast, Uplink Fast, and Port Fast.Multiple
STP (MSTP), it enables multiple VLANs to be mapped to the
same spanning-tree instance, reducing the number of instances
needed to support a large number of VLANs. MSTP was
inspired by the Cisco-proprietary Multiple Instances STP
(MISTP) and is an advancement of STP and RSTP. It was
introduced in IEEE 802.1s as amendment to 802.1Q, 1998
edition. Standard IEEE 802.1Q-2003 now includes MSTP.
MSTP provides for multiple forwarding paths for data traffic
and enables load balancing. [14]Rapid Per-VLAN Spanning
Tree (R-PVST): It is Cisco's proprietary protocol that
combines the functionalities of RSTP and PVST. It is based on
a per VLAN instance that creates a tree for each VLAN [15].
D. Spanning-Tree Interoperability and Backward
Compatibility
The interoperability and the backward compatibility are
considered for the experiment to pronounce performance in a
better approach. The table-1 lists the interoperability and
compatibility among the supported spanning-tree modes in our
Integrated Intelligent Research(IIR)
network. The table reveals that the cisco has balanced to
provide all the three STP modes together with minor
restrictions which are not as considered as major impact in this
study.
Table 1
Parameters PVST MSTP RST
PVST Yes Yes Yes
MSTP Yes Yes Yes
RST Yes Yes Yes
The few restrictions are further discussed here as a basic
requirement for the switch based network. In a mixed MSTP
and PVST network, the common spanning-tree (CST) root
must be inside the MSTP backbone, and a PVST switch cannot
connect to multiple MST regions.When a network contains
switches running Rapid PVST and switches running PVST, we
recommend that the Rapid-PVST switches and PVST switches
be configured for different spanning-tree instances. In the
Rapid-PVST spanning-tree instances, the root switch must be a
Rapid-PVST switch. In the PVST instances, the root switch
must be a PVST switch. The PVST switches should be at the
edge of the network[16].
E. VLAN Trunking Protocols
In this study, VTP is used as part of managing all VLANs
configured in the switch S1, S2 and S3. When you configure a
new VLAN on one VTP server, the VLAN is distributed
through all switches in the domain. This reduces the need to
configure the same VLAN everywhere. It made an
administration in a switched network easy. The VTP Domain
ZU and VTP password ZU configured as security measures.
The VTP modes server and client are configured in the switch
S1 and S2, S3 respectively and the VTP domain. [17][18]
F. End User
The core topology is conduit with IBM Lenovo pcs for
windows based FTP server, client installed with Core FTP
software for huge file transactions and a personal computer
with wires hark software installed for monitoring and
observing the packet while the packets are transferred between
the FTP server and client. The amount of file transfer in the
network nearly 4 GB size and the packets observed were
pragmatically taken for analysis purpose.
G. The Transfer Tools
The software Core FTP is used as client for transferring the
huge file as it is free, secure FTP client gives you a fast, easy,
reliable way to maintain FTP transaction between server and
client. It also affords a secure method (via SSL, TLS, or SFTP)
to upload / download files to and from FTP server [19].
H. The Observation Tool
Spanning tree protocols performance observed using Wires
hark, which is a unrestricted and open-source packet analyzer
4
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.1-8
ISSN: 2278-2427
is used for network troubleshooting, analysis, software and
communications protocol development, and education. It
allows the user to put the network interfaces in order to see all
traffic visible on that interface. However, when capturing with
a packet analyzer in different STP modes on a port on a
network switch performance via the type of STP, not all of the
traffic traveling through the switch will necessarily be sent to
the port on which the capture is being done. This help the
switched network performance vivaciously observed using
STP protocols [20]
I. Security Testing Scenarios
The cisco switches and routers built into Intelligent Gigabit
Ethernet Switch Module which comprised Bridge protocol data
unit (BPDU) guard for shutting down a Port Fast configured
port when an unenforceable configuration has been
experienced during the transaction. The protected port enables
the forwarding of traffic to restrict to the designated ports on
the same switch. The Password-protected access such as read-
only, write-only access to management console interfaces. The
Port security option for limiting and identifying MAC
addresses of the station allowed accessing the port. Port
security aging to set the aging time for secure addresses on a
Multi-level port security for a choice of security level,
notification, and resulting actions MAC-based, port-level
security for restricting the use of a switch port to a specific
group of source addresses and preventing switch access from
unauthorized stations IEEE 802.1X port-based authentication
to prevent unauthorized devices from gaining, access to the
network, IEEE 802.1X port-based authentication with VLAN
assignment for restricting802.1X-authenticated users to a
specified VLAN, IEEE 802.1X port-based authentication with
port security for authenticating the port and managing network
access for all MAC addresses, including that of the client IEEE
802.1X port-based authentication with voice VLAN to permit
an IP phone access to the voice VLAN irrespective of the
authorized or unauthorized state of the port[12][21][22]Test
suites were constructed using basic commands for basic
security measures. Three Cisco Catalyst switches namely S1,
S2, S3 used in the VLAN configurations supported security
several test configurations, including running difference STPs
of VLAN, VLANs with and without trunk ports enabled. Tests
were conducted with acquaintance of existing weaknesses, and
were focused on identifyinglayer-2 potential vulnerabilities
outside of well-understood issues, such as VLAN hopping
through enabled trunk ports. The following are the basic
security features learned in this study Port Security, 802.1q and
ISL Tagging, Spanning Tree Port fast, Native VLAN
elimination, BPDU Guard, VLAN 1,VTP.
III. RESULT INTERPRETATION
A. Spanning Tree Performance
This section discusses observed and verified experimental
results on Layer – 2 VLAN. To begin with the spanning tree
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.1-8
ISSN: 2278-2427
performance as observed through wires hark packet analyzer in Bytes
on trendy topology using 100 mb archive files between the Data Transfer Min Size 3180 3172 3178 3158
FTP server and client on each STP modes. The statistics of in Bytes
data experimented on PVST, RPVST, MST and mixed modes % Data Transfer Max 95.65 95.65 95.66 95.66
of STP. The table-2 below recorded the observed packets Size in Bytes 235 366 025 673
analyzed based on number of transaction(req, res), time, no of % Data Transfer Min 4.344 4.342 4.334 4.315
packets, no of loops, no of FTP loops, size and percentage of Size in Bytes 915 242 281 505
data used during the file transfer.

Figure - 5

The observed results are considered for the performance

analysis on which the following charts are depicted. The
Figure–3 shows the number of transactions in each STP mode
with regard to time duration between the first requests and to
the last response as the FTP completes 100 mb transactions.
The result inclined as PVSTis marking with less number of
packet transactions and less time taken to complete the FTP
data transfer. The no of packets taken to process in each STP
modes were more than 100 thousand packets as whires hark
tool observed. The variation is depicted on the figure - 4. Still
in all aspects the STP modes covered by PVST are the best to
suggest small as well large scale hybrid network. The scale
measures the network based on the size and device integration
upon its sensitivity.

The Figure - 5 reflects how many loops occur during the

packets transfer from transaction to others. As observed that
Table -2 :STP Protocols Performance Observation
less number of loops occurs in PVST as compare with RPVST,
Parameters PVST RPVS MST MIX MST and MIXED mode. The advantages over each others are
T ED as described in earlier section the implemented STP types. The
No of Transaction(Req, 4 16 12 7 number of loops show the mode that the efficient transactions
Res)) on 100mb archive file between VLANs are using FTP server
Time 9.102 15.18 16.00 24.24 and FTP clients which are assumed functionally different
503 397 644 095 areas. This analysis again goes with PVST as minimum loop
No of Packets(First, 10984 10987 10984 10993 generated STP mode. RPVST has the advantage that it detects
Last) 8 6 7 0 its STP loop at the hasty age of transactions particularly one
No of Loops(Over All 5 6 6 7 loop at 78428 during the course of 109876 packets
Transaction) transactions. Whereas other STP modes conceded at later
FTP Loops (FTP 1 1 1 1 stages of transaction such as RPVST concedes one loop at
Transaction) 11116 during the course of 109876 and MST concedes a loop
Data Transfer Max Size 70007 70008 70007 70007 at 93857 during the course of 109847 packets of transactions.

5
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.1-8
ISSN: 2278-2427
In all aspects, the PVST's performance is interpreted as the best amongst the STP modes.

Table – 3: Data transfer on each STP modes hand shake approach the STP performance shows variations in
Size of PVST RPVST MST Mixed transferring bytes. In this analysis, during the FTP data transfer
the Data the transport layer used TCP for sending data in different sizes
1296 1 3 2 12 such as 1460, 1296, 975 and 648. The PVST mode used more
975 1 1 1 1 of actual 1460 bytes of data than the other STP modes.
648 3180 3172 3178 3158 B. Layer – 2 VLAN Security Mechanism applied and verified
1460 70007 70008 70007 70007 Certain VLAN configurations result in conditions where it is
Total pkts 73189 73184 73188 73178 practicable for frames to be relayed from one VLAN to another
The table – 3 shows the data sizes used for transaction at each by a malicious party influencing frame tags or address tables at
STP modes. Figure – 6&7 shows the comparison results of the switch level. And also there are other threats such as flood
data transfer among the STP modes when 100mb data attack [23], VLAN hopping occur under any circumstances due
transactions made between VLANs across FTP server and to unwanted VTP advertisement. This study suggests some
client. The FTP-DATA size usually ongoing transaction sets basic and effective Layer – 2 VLAN securities mechanism
1460 bytes. Due to the fluctuation on the network and TCP which allows the network runs away from vulnerabilities [24].

Table – 4 : Security Configuration at Layer – 2 VLAN

Experimental Objective to accomplish Important Commands Used for the Verification
Method experiment
Port Security Secure against a MAC flood attack S1(config)#interface fa1/0/1 show port-security
S1(config-if)#switchport mode access interface fa0/19
S1(config-if)#switchport port-security
vlan 10
S1(config-if)#switchport port-security
maximum 1
S1(config-if)#switchport port-security
mac-address sticky
S1(config-if)#switchport security
violation shutdown
802.1q Tagging Ingress filtering S1(config-if)#switchport mode dot1q- S1#show vlan dot1q
tunnel tag native
S1(config)#vlan dot1q tag native
BPDU Guard Provides a secure response to invalid S1(config)#spanning-tree S1#show spantree
configurations portfastbpduguard summary
VTP password Network Attack Mitigation by Avoiding S1(config)#VTP domain ZU S1#show vtp status
unwanted VTP advertisement S1(config)#VTP password ZU

The table – 4 shows the accomplished type of security status of the VLAN configured switch port fastethernet
mechanisms such as port security, 802.1q tagging, BPDU 0/19.The figure – 10 shows the
Guard and VTP password are verified the usage on Layer – 2
VLANs.The following section discusses one of the Layer – 2
VLAN security mechanism port security adopted in this study
as depicted as screenshots.

Intermediate state that the switch is flapping due the MAC

address changes on the specific port which was configured the
port security mechanism. The figure – 11 shows the port
The figure – 8 shows the configuration of port security in security is verified by seeing the port fa0/19 shutdown due to
Layer – 2 VLAN. The figure – 9 shows the initial state of port the MAC changes happened

6
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.1-8
ISSN: 2278-2427
Flooding Attack, ARP Attacks, Multicast Brute Force Attack
and Random Frame Stress Attack, DoS attack suggest the
aptness to be exercised at Layer - 3 VLAN.

ACKNOWLEDGMENTS

The authors express their sincere thankfulness to Dr.Maryam

Abdullah Al Awadi, The Head of the department, Department
of Information technology for encouragement and support
during this work.

REFERENCES
[1] Virtual LAN Security Best Practices, Cisco Systems,
Inc.http://www.cisco.com/warp/public/,cc/pd/si/casi/ca6000/prodlit/Pag
e 5 of 13
[2] Rufus Credle, Yoko Fujiwara, Matt Slavin, Kenichi Tanaka, Mark
Welch, Cisco Systems Intelligent Gigabit Ethernet Switch Module for
IBMEserverBladeCenter , http:// www. redbooks. ibm.com/redpapers/
pdfs/redp3869.pdf, April 2005
[3] Spanning Tree Protocol, Wiki online document, http://en.wikipedia.org/
wiki/ Spanning_ Tree_ Protocol
[4] http://resources.infosecinstitute.com/vlan-hacking/
[5] P. Garimella, Y.-W. E. Sung, N. Zhang, and S. Rao. Characterizing vlan
The figure – 12 shows the state of security Violation on layer – usage in an operational network.In ACM SIGCOMM workshop on
2 VLAN when the switches learned unknown MAC address Internet Network Management (INM’07), Kyoto, Japan, 2007.
via specific ports. It justifies the important of Layer – 2 VLAN [6] A. Mansy, M. B. Tariq, N. Feamster, and M. Ammar. Measuring vlan-
induced dependencies on a campus network.In Proc. ACM SIGCOMM
require a certain security mechanism implemented for flawless IMC, 2009.
communication. [7] K. Sripanidkulchai, C. Issariyapat, and K. Meesublak.Inference of
network-wide vlan usage in small enterprise networks.In Proc.Of IEEE
Workshop on Automated Network Management, 2008.
[8] Y.-W. E. Sung, S. G. Rao, G. G. Xie, and D. A. Maltz. Towards
systematic design of enterprise networks.In Proc. of the ACM CoNEXT
Conference, 2008.
[9] M. J. Karam and F. A. Tobagi.QoS-aware Multiple Spanning Tree
Mechanism over a Bridged LAN Environment, On traffic types and
service classes in the Internet. IEEE GLOBECOM, pp548-554, Nov.
2000.
[10] IEEE 802.1S/D15, Draft standard for local and metropolitan area
networks: amendment 3 to 802.1Q virtual bridged local area networks:
multiple spanning trees, 2002.
IV.CONCLUSION [11] IEEE 802.1Q, Standard for local and metropolitan area networks:
virtual bridged local area networks, 1998.
This study finds that PVST is the best in STP in terms of [12] PuTTY,OnlineDocumenthttp://www.chiark.greenend.org.uk/~sgtatham/
putty/faq.html#faq-meaning
performance based on the study conducted on STP modes, in [13] VLAN Trunking Protocol. Cisco Online Documents,
terms of Performance as per the evaluation of different http://www.cisco.com/en/US/tech/ tk389/ tk689/ technologies tech
parameters No of packet transaction, Time duration, No of note09186a 0080094c52. shtml
loops, FTP loops, Data transfer size in bytes, percentage of [14] Types of STP, Online document, http://www.orbit-computer-
solutions.com/Spanning-Tree-Protocol-Standards-Types.php
data transfer size in bytes, PVST was found to be the best. In [15] Spanning Tree Protocol (STP) is a Layer 2protocol,
security aspects, this study suggests best practices of network http://www.techiebird.com/netstp.html
security through the following techniques such as MAC Flood [16] Cisco,Online Document, http://www.cisco.com/en/US/docs/
Attack, 802.1q Tagging, BPDU Guard, and VTP Password at switches/lan/catalyst2950/ software /release/12.1_14_ea1/
configuration/guide/swstp.html#wp1150848
Layer – 2 VLAN The results are verified and justified at Layer [17] Xin Sun, Yu-Wei E. Sung, Sunil D. Krothapalli, and Sanjay G. Rao,
-2 VLAN. This research work motivates further to evaluate the Systematic Approach for Evolving VLAN Designs, Journal, Purdue
performance of hybrid network using other perspective in University
terms of QoS using different multimedia files and device [18] Understanding vlan trunk protocol (VTP). Cisco online
document.http://www.cisco.com/ application /pdf/ paws/10558/21.pdf,
utilizations. Additionally the implementation of VLAN 2007
performance and security evaluation can be done at Layer–3 [19] Core FTP, online Documents from http://www.coreftp.com/
switches. For the enhancement of Security, this research can be [20] Wireshark, Network packet analyzer and monitoring tool
extended to study and suggest with VACL, Private VLAN, and http://en.wikipedia.org/wiki/ Wireshark.
[21] Lucian Popa, Building Extensible and Secure Networks, Electrical
DHCP Snooping at Layer -2 VLAN. The preventions of MAC Engineering and Computer Sciences, University of California at
7
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.1-8
ISSN: 2278-2427
Berkeley Technical Report No. UCB/EECS-2011-105,
http://www.eecs.berkeley.edu/Pubs/TechRpts/2011/EECS-2011-
105.html, September 23, 2011
[22] IdoDubrawsky, SAFE LAYER 2 SECURITY IN-DEPTH— VERSION
2 Cisoc online document ,
http://www.cisco.com/warp/public/cc/so/cuso/epso/sqfr/sfblu_wp.pdf
[23] Minlan Yu Rexford, J. ;Xin Sun ; Sanjay Rao ; Feamster, N., A
survey of virtual LAN usage in campus networks,Communications
Magazine, IEEEDate of Publication: July 2011, Volume: 49, Issue: 7
,Page(s): 98 - 103
[24] VLAN Security White Paper, Cisoc online document
http://www.cisco.com/warp/public/ cc/pd/ si/casi/ca6000/ tech/ stake
_wp.pdf

8
Integrated Intelligent Research(IIR)
A Critical Study of Data Security in Selected Co-
Operative Units of Warana Udyog Samuha
Prof. Babasaheb J. Mohite
Sinhgad Institute of Business Management,Kamalapur, Sangola.
Email Id. bjmohite@gmail.com
Abstract-In todays rapidly changing scenario, individuals and
organizations are relying heavily on automated computer
systems to store, retrieve, process and exchange information.
Organizations uses the information stored on these systems to
conduct vital business operations. Therefore, organizations
need to protect the information from unauthorized access and
potential destruction. Earlier, an organization, computer system
was developed, used and maintained in isolation from other
areas of business. The rapid growth and widespread use of
electronic data processing and electronic business conducted
through the Internet, along with numerous occurrences of
international terrorism, fueled the need for better methods of
protecting the computers and the information they store,
process and transmit. IT managers, Network Administrators
and Database Administrators face increasing challenges of
managing and protecting information and network resources
from unauthorized access. So to preserve data securely every
IT user must know the benefits and losses about the computer
security. Which are the different threats to computer data and
which are the different security controls and policies required
to maintain data security?
In view of the above, the present research work entitled “A
Critical Study of Data Security in Selected Co-Operative Units
of Warana Udyog Samuha” has come up for further in-depth
study.
Keywords: Threats, Integrity, Virus, Password, Hacking,
Biometrics, Fire extinguisher.
I. INTRODUCTION
Security is a measure or act to prevent any system from any
type of damage. Security measures were taken to prevent or
minimize the loss after the attack of any type of danger with
minimum loss of assets [1].Knowing about major possible
threats to any system is important, but understanding ways to
defend against these threats is equally critical. Defending a
system is not simple or inexpensive mission due to some
reasons [3] like-Hundreds of possible threats exist and the cost
of preventing hazards can be very high,System resources may
be situated in different locations,Many personal use system
assets,Rapid technological changes make some control
absolute/ unused as soon as they are installed,People tend to
violate security procedures because the procedures are
inconvenient,Many criminals who are caught go
9
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.9-15
ISSN: 2278-2427
unpunished.Therefore, organizing an appropriate defense
system is one of the major activities of any functional manager,
who controls any system resources.
II. OBJECTIVES OF THE STUDY
Today‟s booming world is now referred as High Speed
world due to storing data in digital form using computer
system and accessing and processing the data with minimum
cost, effectively efficiently to generate different types of
information. So to preserve that data securely every IT user
must know the benefits and losses about the computer
security. Which are the different threats to computer data and
which are the different security controls and policies
required to maintain data security?
In view of the above, the following has been setout as a
prime objective of the present study.
1. To study and analyze the data security measures adopted
by the organization.
2. To examine the awareness level among users about
benefits or losses of data security.
3. To suggest measures for efficient database & general
security measures.
III. SCOPE OF THE STUDY
The research was focused on selected co-operative units of
Warana Udyog Samuha for collection of data. The sample
size was 69 comprising of three units of Warana Udyog
Samuha, Warananagar. Therefore the scope is limited.
IV. VALIDITY OF THE STUDY
1. Present research focus on the current situation of
computerization and data security measures adopted at
different units of Warana Udyog Samuha.
2. This research will help to know the fact that how
awareness of security plays an important role in
securing valuable assets of organization.
3. This research helps the organization in deciding the
security policies regarding the Data security.
4. This research is also the measurement of the present
scenario of the awareness level of data security to the
users and it will help to improve the same.
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.9-15
ISSN: 2278-2427
V. METHODOLOGIES ADOPTED The sample size is restricted to 69 IT users. The detail
breakup of the sample size is depicted in chart –
In order to study the selected problem in details, the
researcher has made use of different resources to collect the
reliable information pertaining to data security systems used
in following units of Warana Udyog Samuha.
 Warana Co-operative Sugar Factory Ltd. (Sakhar
Karkhana)
 Warana Co-operative Milk Produce Processing Society
Ltd. (Dudh Sangh)
 Warana region Co-operative Grahak Mandal (Bazaar)
The researcher has collected both primary and secondary
data regarding the present study [6].

Primary Data –
Data was collected by administrating two different sets of
VI. LIMITATIONS
questionnaire for Data Entry Operators and Programmers.
a. Conclusion drawn from the survey is limited for three
Researcher has personally conducted interviews with selected
units of Warana Udyog Samuha only.
respondents from the different units of Warana Udyog
b. Researcher was interested in covering more units of
Samuha. In order to obtain more relevant information which is
Warana Udyog Samuha but they have only two to
not covered in structured questionnaire, researcher has made
three stand-alone computers with only two-three
use of personal discussion with the respondents. To facilitate
users, they don‟t have network facility.
easy interpretation of data, multiple choice questions,
c. Many respondents were not able to answer the
Dichotomous questions and five point scales were used as
questions regarding the technical aspects of threats
required.
and measures of security. So the researcher had to
trace out the problem by using some technical
Secondary Data –
knowledge, skill, experience, and by questioning to
The secondary data related to data security was collected from
respondents regarding the required details.
various books, related journals, magazines and web sites. The
secondary data in respect of profile of the company etc.
VII. DATA ANALYSIS AND INTERPRETATION
collected from company files, magazines etc.
Following table and figure shows the current literacy level
5.1 Sampling Method-
regarding computer usage, the data security measures adopted
Presently, the Warana co-operative complex runs successfully
by the organization, awareness level among users about
25 co-operative societies. Out of this researcher has chosen
benefits or losses of data security and security measures
three co-operative societies namely- Warana Dudh Sangh,
adopted from selected units under study.
Warana Sakhar Karkhana, and Warana Bazaar.
Table 1: (Source – Primary Data collected from Operators)
These organizations have been selected on the 17basis of the
Computer Course Completed by Employees through
following parameters-
University/ Private Institutions.
 Organization having more than 20 computers.
 Organization having more than 80% computers in
network.
 Organization having different sections or sub-units. Table 2: (Source – Primary Data collected from Operators)
 Organization having more than 25 computer users.

5.2 Sampling technique-
For the present research work, proportionate convenient
sampling technique [6] is used and accordingly of the total
343 IT users‟ 69 users representing 20% of universe has
been considered as sample. As far as possible researcher has
covered all types of respondents under survey method to
collect the reliable information.

5.3 Breakup of sampling size-

10
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.9-15
ISSN: 2278-2427
From the table, it is observed that, out of total respondents
from Warana Dudh Sangh 26.67% of respondents have
completed computer course from different Universities and
73.33% respondents have completed computer course from
private computer institutes respectively.Similarly, out of total
respondents from Warana Sakhar Karkhana 34.62% of
respondents have completed computer course from different
Universities and 65.38% respondents have completed
computer course from private computer institutes respectively.
At the same time, out of total respondents from Warana Dudh
Sangh 33.33% of respondents have completed computer course Table 3: (Source – Primary Data collected from Operators)
from different Universities and 66.67% respondents have Antivirus Updation Status
completed computer course from private computer institutes
respectively.

It is also significantly noticed that, the proportion of employees

who have completed their computer courses from private
institutes is higher in Warana Dudh Sangh as compared to
other two units who are having near about equal proportion in
the range of 65 to 67%. Contrary to this, it is also noticed that
the proportion of employees who have completed their
computer courses from Universities is low in Warana Dudh
Sangh as compared to other two units who are having near
about equal proportion in the range of 33 to 34%.Table 2
At the same time, out of total respondents from Warana Bazaar
shows that, out of total respondents from Warana Dudh Sangh
66.67% of respondent‟s updates antivirus programs regularly
76.67% of respondents remembers password by memorizing,
and 33.33% respondent‟s updates antivirus programs regularly
20.00% of respondents remembers password by keeping in
up to some extent respectively. It implies that, majority of
written form and 3.33% respondents keeps password in text
respondent‟s updates Antivirus programs regularly.
file respectively.Similarly, out of total respondents from
Warana Sakhar Karkhana 84.62% of respondents remembers
Table 4 shows that, out of total respondents from Warana
password by memorizing, 15.38% of respondents remembers
Dudh Sangh 96.67% of respondents gives importance for
password by keeping in written form and 3.85% respondents
training on maintaining data security and 3.33% respondents
keeps password in text file respectively.At the same time, out
don‟t thinks it is necessary to get training on maintaining data
of total respondents from Warana Bazaar 83.33% of
security respectively.Similarly, out of total respondents from
respondents remembers password by memorizing, 16.67% of
Warana Sakhar Karkhana 96.15% of respondents gives
respondents remembers password by keeping in written form
importance for training on maintaining data security and 3.85%
and not a single respondents keeps password in text file
respondents don‟t thinks it is necessary.
respectivelyFrom the table, it is observed that, out of total
At the same time, all the respondents from Warana Bazaar give
respondents from Warana Dudh Sangh 50.00% of respondents
importance for training on maintaining data security. It implies
updates antivirus programs regularly, 13.33% respondents do
that, majority of employee‟s strongly agree for training on
not updates antivirus programs regularly and 36.67%
maintaining data security is very important and essential.
respondents updates antivirus programs regularly up to some
extent respectively. Similarly, out of total respondents from
Table 4: (Source – Primary Data collected from Operators)
Warana Sakhar Karkhana 61.54% of respondent‟s updates
Necessity of Training on Maintaining Data Security
antivirus programs regularly, 11.54% respondents do not
updates antivirus programs regularly and 26.92% respondent‟s
updates antivirus programs regularly up to some extent
respectively.

Method Used to Remember the Password

Table 5: Disaster Experienced by Employees

11
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.9-15
ISSN: 2278-2427
 Formal disciplinary process for staff that violates security
policies.
 Have not made security plan & policies.
 Use of any biometric measure, Testing of Security control
regularly

Table 7 : (Source – Primary Data collected from EDP heads)

Security Controls Used

Table 5 depicts that, out of total respondents from Warana

Dudh Sangh, Warana Sakhar Karkhana and Warana Bazaar
majority of respondents experienced Virus, Hardware fault and
Human Negligence as a major disaster in their
organizations.Similarly, out of total respondents from Warana
Dudh Sangh, Warana Sakhar Karkhana and Warana Bazaar
very few of respondents experienced Theft of hardware,
Environmental Hazard and data alteration as a major disaster in
their organizations.At the same time, not a single respondent
from Warana Dudh Sangh, Warana Sakhar Karkhana and
Table 8: (Source – Primary Data collected from EDP
Warana Bazaar experienced disaster like Hacking and Theft of
Head)Organisations using different Security facilities
software.

Table 6: (Source – Primary Data collected from

Operators)Media Used For Data Backup

From the table 6, it is observed that, out of total respondents

from Warana Dudh Sangh, Warana Sakhar Karkhana and
Warana Bazaar majority of respondents use CD/DVD as a
main backup media in their organizations.Similarly, out of total Hypothesis: Organizations do not differ significantly in
respondents from Warana Dudh Sangh, Warana Sakhar awareness of different security measures in the vicinity [8]
Karkhana and Warana Bazaar 10 to 25% of respondents use
Zip/USB disk, Pen drive as Backup server on Network as a Tj : T1=12, T2=12, T3=4 :
backup media in their organizations. At the same time, not a T=28
single respondent uses Magnetic tape as a storage media to nj : n1=11, n2=11, n3=11 :
store data backup in their organization.All units of Warana N=33
complex are having facility to validate input data through
: =1.090, =1.090, =0.3636 :
application programs.
=0.8484
On the other hand in all these units, there is negative response
towards the following aspects - SSC =
 Facility to intimate newly logged user, Maintain a log files
=11(1.090-0.8484)2+11(1.090-
for sensitive data.
.8484) +………………+11(0.3636-0.8484)2
2
 Background check on selection of IT staff, Data security
=0.6420+0.6420+2.58534
officer appointment.
=3.870177
12
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.9-15
ISSN: 2278-2427
SSC = 3.870177
Table value for F ratio for (2,30) d.f is 3.32
Sources of d.f s.s M.S.S F Test
Thus calculated value is less than given table value, gives the
Variance
conclusion that Organizations do not differ significantly.

Table 9: Parameters about the Security Measures implemented

Between 2 3.870177 1.935885 by the Users (Source – Primary Data collected from Operators)
1.7945
Error 30 32.3636 1.07878
Hypothesis: - Measurement of the present scenario of the
Total 28 52.2419
awareness level of the data security is not implemented by the
users.
2
SSE =

= (0-1.090)2 + (0-1.090)2+ (3- Using Yale‟s correlation, using the Pooling techniques [8]
1.090) +……………….+(1-0.3636) +(0-1.036)2
2 2

=14.9091+14.9091+2.5454
=32.3636 Table value for for 8 degrees of freedom at 5% level of
SSE = 32.3636
2 significance is 2.73.
SST =
We accept the hypothesis that, Measurement of the present
scenario of the awareness level of the data security is not
= (0-0.8484)2+(0-0.8484)2+……+(1- implemented by the users.
0.8484)2+…..(0-0….)2
=52.2419 VIII. FINDINGS
SST = 52.2419
1.
All the units under study do not have facilities like- Fire alarm
Degrees of Freedom system with emergency power off system, smoke detectors,
dfc = c-1 = 3-1 = 2 dfe = N-C = 33-3 = 30 fireproof ceilings, doors and furniture‟s, access control device,
dft = N-1 = 33-1= 32 motion detectors, intrusion alarms at all accessible openings,
watchman at server & backup room. Also they can‟t maintain
Mean Sum of Squares entry and exit records for visitors to department.
MSC= 2. Most of the organizations have installed Air conditioning,
humidity and dehumidification equipments. And also separate
M S C = 1.935885 arrangement for electricity and Network cable has made.
3. Antivirus programs are installed on almost all machines of
MSE =
different organization, but updation process is carried out
infrequently. Occasionally the secondary storage devices are
M S E = 1.07878
used before checking for viral infection.
Here we use ‘F’ test, since MSC > M SE
4. In most of the organization data from one terminal to
F test = at (2, 30) degrees of another terminal are copied through network as well as through
secondary storage devices.
freedom
5. In all organization only username and password method of
user identification is used, in which most of the user uses more
than 8 character passwords and remember their password by
memorizing. But no special training about importance and
privacy of password, access control rules and rights for each
user clearly stated and documented.
6. Not a single organization has security controls
implemented, such as–
 Auto logoff or lock capability after predetermined
time of inactive.
 Facility to intimate newly logged users.
 Log files for sensitive data.
 Staff signatures on confidential agreement 23 about data
security.
ANOVA Table [8]
13
Integrated Intelligent Research(IIR)
 Background check on selection of IT staff.
 Appointment of data security officer.
 Any formal security plan and policies as well as
disciplinary process for staff that violates data security policies
and procedures.
 Regularly test of security controls.
 Staff attended any data security conference, trainings,
refreshers and seminars.
7. It is found that maximum employees from all organization
agree that the knowledge and training of data security policies
and procedure is very necessary at the same time Information
system audit is important for their organization.
8. All organizations having backup facilities and systems like
disk mirroring, and mainly uses CD/DVD as a backup media.
IX. SUGGESTIONS
Success or failure of any business operation only depends upon
the different factors like- formal order chart, interdependence,
interaction, integration of different components, planed
approach and rigid aims or objective. Along with these
characteristics some indirect characteristics are the faith and
love on work and organization by fostering company
loyalty.From the overall observation it can be concluded that,
the majority of current work is running on the basis of faith on
the corresponding employees rather than different application
or physical security controls to avoid or minimize the scope of
the data alteration or loss due to any reason.
To carryout proper and rigid security plans some suggestions
on the basis of findings are –
1. From findings it is found that, all organizations are having
and installed antivirus, anti-spy ware and anti-span software‟s
on all machines. Hence to increase the security, accuracy and
work capacity some suggestions on the basis of findings are –
a) Regularly schedule for updates to antivirus, anti-spy ware
and anti-span software‟s against the latest viruses and spasm.
b) Install different latest patches and service packs of
system and application software‟s.
c) Delete internet cookies after every visit of Internet.
2. Suggestions for selecting, training and creating user of
system on the basis of findings are-
d) Conduct the background check on selection of IT staff.
a) Select IT staff that has completed at least 1 Years
University / private degree or certificate course in Computer
b) Create separate logins for each user and allocate private
area for data storage.
c) Make compulsory or arrange conferences, refreshers,
trainings or seminars on essentials of data security i.e. data
security policies and procedures.
d) Give training about appropriate use of password and the
need to keep password private.
e) Get signed on confidential agreement about data
security.
f) Give training to use different security or preventive
measures like fire extinguishers, use of antivirus program and
14
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.9-15
ISSN: 2278-2427
its updation facility, data backup facility programs and deletion
of cookies etc.
g) Give training to select password and password
remembering method such that the selected password will be
very difficult to trace for unauthorized user or intruder.
h) Assign the fixed role and responsibility to the selected
user in organization.
3. To secure workstations and servers from intentional or
accidental disclosure some suggestions on the basis of findings
are-
a) Install smoke detectors, air conditioning, humidity and
dehumidification equipments, access control devices, motion
detectors and Intrusion alarms on all accessible openings.
b) Install Dry powder as well as CO2 type fire extinguishers.
c) Maintain entry and exit records for visitors to each
department and also escort the visitor up to the concern
personnel.
d) Set auto logoff or lock pabilities after predetermined time
of inactive.
e) Implement facility to intimate newly logged user or
attempts of unauthorized access.
4. Take daily backup of data in duplicates with encrypted
form using standard cryptographic algorithm. Also retain
minimum 2 generations of backups at offsite safe location
away from magnetic media and server room with relevant label
and number for easily identification.
5.
REFERENCES
[1] Thomas R.Peltier (Book) titled “Information Security Policies,
Procedures and Standards, Guidelines for Effective Information Security
Management”, Auerbach Publications [2002].
[2] Alfred Basta, Wolf Halton (Book) titled “Computer Security- Concepts,
Issues and Implementation”, Cenage Learning India Edition [2009].
[3] Michael E.Whitman and Herbert J. Mattord (Book) titled “Principles of
Information Security”, Thomson Learning- Course Technology, Second
Edition [2007]
[4] Information Security Roles and Responsibilities Made Easy (Book),
Version 2 by Charles Cresson Wood, CISSP, CISM, and CISA. Published
by information Shield, Inc., [2005].
[5] Neena Godbole (Book) titled “Information Security”, Willey Publication,
First Edition [2009]
[6] C.R. Kothari (Book) titled “Research Methodology , Methods and
techniques, New age International (p) Ltd, Second Edition [2004],
[7] Ron Weber (Book), Information Systems Control and Audit, Pearson
Education, Fifth edition [2007]
[8] S.C.Gupta and Indira Gupta (Book) titled “Statistical Techniques”,
Himalaya Publication House, New Delhi, Fifth Edition [2008].
[9] www.information-security-policies-and standards.com/compliance.html
[10] http://www.bitpipe.com/data/tlist?b=ka_bp_security.php
[11] http://www.darkreading.com/security/attacks.html.
BIOGRAPHIES
Mr. Babasaheb J. Mohite working
as Assistant Professor at Sinhgad
Institute of Business Management
(MCA), Kamlapur-Sangola (MS),
India. His area of interest is
Information Security Audit &
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.9-15
ISSN: 2278-2427
Control. Accordingly he has acquired the qualification of
B.Sc., MCM, MCA, M.Sc. (Sub.Com.), M.Phil. and currently
pursuing Ph.D. in Computer Applications from Shivaji
University, Kolhapur. He has more than thirteen years
experience in the field of Industry and Academics. He has
presented & published number of research papers in National
& International conferences and journals. He has authored four
books for BCA & BCS course.

Dr. Dilip M. Kumthekar is a professor

at V. P. Institute of Management Studies
and Research, Sangli (MS), India. He has
completed M.B.A., M.Com- R.M.-II,
M.Com(Sub.Com), Ph.D. He has more
than two decades of experience in the
field of academics. He is resource person
in the subject‟s area of Finance and Research Methodology. He
has coordinated and addressed in many programmes /
seminars/ workshops/ conferences at Regional and National
level. He is acting as a guide for M.Phil & Ph.D. He has
presented & published number of research papers in National
& International conferences and journals.

Dr. Milind J. Joshi is an experienced

Systems programmer in am
multidisciplinary university environment
working at Shivaji University Kolhapur
(MS), India, who can confidently work
across a variety of disciplines ranges from
Science, Social sciences, humanities,
education, engineering & technology, arts, medicine, and
pharmacy. He has having 24 years of experience in the field of
Industry and Academics. He has completed M.Com, MCM and
received Ph.D. in October 2002 from Shivaji University,
Kolhapur. His research area is „Use of Information Systems in
educational administration‟. He has authored book titled „Role
of MIS in University Administration‟ and also published many
research papers in National & International journals. He is
acting as a guide for M.Phil & Ph.D.

15
 Integrated Intelligent Research(IIR)
Innovative Method of Software Testing
Environment Using Cloud Computing Technology
S. Ravichandran
Associate Professor,Department of Information Technology,Sri Krishna Engineering College
Email: ravi17raja@gmail.com
Abstract—various information systems are widely used in
information society era, and the demand for highly dependable
system is increasing year after year. However, software testing for
such a system becomes more difficult due to the enlargement and
the complexity of the system. In particular, it is too difficult to test
parallel and distributed systems sufficiently although dependable
systems such as high-availability servers usually form parallel
and distributed systems. To solve these problems, to propose a
software testing environment for dependable parallel and
distributed system using the cloud computing technology, named
D-Cloud. D-Cloud includes Eucalyptus as the cloud management
software, and FaultVM based on QEMU as the virtualization
software, and D-Cloud frontend for interpreting test scenario. D-
Cloud enables not only to automate the system configuration and
the test procedure but also to perform a number of test cases
simultaneously, and to emulate hardware faults flexibly.I n this
paper, present the concept and design of D-Cloud, and describe
how to specify the system configuration and the test scenario.
Furthermore, the preliminary test example as the software testing
using D-Cloud was presented. Its result shows that D-Cloud
allows to set up the environment easily, and to test the software
testing for the distributed system.
Keywords — D-Cloud, QEMU, Eucalyptus, FaultVM,
FAUmachine
I. INTRODUCTION
According to shifting advanced information society, various
information systems are used everywhere. Since such systems
are closely related to daily life, they must employ highly
dependable facilities to avoid undesirable behavior caused by
the underlying bugs and the interference from the external
environment. I n order to certificate the depend-ability of such
systems, these should be tested sufficiently. However, as recent
information system becomes larger and more complicated,
software testing for such a system be-comes more difficult. I n
order to check whether components work correctly, tremendous
test cases are needed for various input patterns, and environment
to execute a great number of tests immediately should be
provided. Especially, although highly dependable systems such
16
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.16-22
ISSN: 2278-2427
as high-availability servers likely to form parallel and dis-
tributed systems, the testing of large-scale parallel and
distributed system is troublesome job in real world after
deployment. When a failure occurs in parallel and distributed
systems, the reproducibility of the actual system is so poor that
the detection of the defective part has been serious problem. On
the other hand, a highly dependable system should be equipped
with the combination of multiple functions of fault tolerance
against hardware faults. Even though testing of fault tolerant
facilities should be done under hardware fault conditions or
anomaly loads, it is too difficult to destroy a specific part of
actual hardware or to concentrate an unrealistic overload in a
hardware device. To solve these problems, proposed a software
testing environment for reliable distributed systems using cloud
computing technology, named ―D-Cloud‖ I n this paper, to
present the concept and design D-Cloud, discuss the description
of the system configuration and the test scenario, and report the
preliminary test example using D-Cloud.
II. CONCEPT OF D-CLOUD
A large-scale software testing environment using cloud
computing technology for dependable distributed systems,
named ―D-Cloud.‖ I n this section, describe the concept of D-
Cloud including the background of this research.In present
information society, as the system scale enlarges and it
complicates the behavior of the system, sufficient software
testing has become increasingly harder. Since each test
consumes the actual execution time depending on the software
size and complexity, and the only way for speedup of software
testing process is that a lot of tests should be performed in
massively parallel. I n order to manage massive computing
resources, introduce the cloud computing infrastructure to the
software testing. Meanwhile, the demand for highly dependable
system is increasing year after year. I n a highly dependable
system, fault tolerance is important capability so that the
system can tolerate hardware failures and anomaly behaviors.
To realize fault tolerance, the system must be formed by the
redundant configuration. Parallel and distributed systems can
provide the solution by the redundant resources because of
multiprocessor and multiple nodes. However, in this case, the
 Integrated Intelligent Research(IIR)
software testing has several serious problems. First, since each
process runs in parallel independently, the behavior of the
software may become nondeterministic on the actual hardware.
I t means that it is too difficult to reproduce the same failure
after a failure occurred on such a system. Toward this problem,
virtual machine technology helps the reproducibility by adding
the management mechanism for the time synchronization.
Second, in the case of a large-scale distributed system, to build
the test environment becomes impossible. I n order to test such
a system, usually the preliminary test with restriction is done in
the small-scale system, and then the comprehensive test under
the full-scale environment is conducted. However, it may
stretch the time and raise the cost for the system test unless the
test system almost similar to the target environment is prepared.
On this point, the cloud services based on IaaS (Infrastructure
as a Service) also provide an answer, that is, they permit the use
of huge number of computing nodes, and the emulation of
entire system without the modification of the source codes
using a virtual machine on each node. Furthermore, although
testing of fault tolerant facilities is important in the highly
dependable system, it is too difficult to make the specific
hardware fault conditions or to generate anomaly loads in real
world. The solution of this problem is to use virtual machine
technology to provide the fault injection facility, and it can
emulate hardware faults of several devices within the virtual
machine according to the request from the tester.
Based on above discussions, D-Cloud aims for the realization
of the software testing environment as follows:
1) By the use of computing resource provided by the cloud
computing system, a number of test case can be performed
simultaneously, thus software testing can be accelerated.
2) By the description of the system configuration and test
scenario, a series of complex test procedure can be
automated.
3) Hardware fault and anomaly state can be emulated
flexibly as many times as needed.
4) The target parallel and distributed system can be built
onto the cloud computing system, and the execution of the
system on the cloud helps the detection of the timing bug
and the reproduction of the failure.
17
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.16-22
ISSN: 2278-2427
In providing various properties of dependability, since an
operating system plays a key role, to develop a dependable
operating system, which is based on Linux with safe
extension mechanism for adding dependable feature as kernel
modules, and to provide several components as loadable
kernel modules, daemons, and tools. D-Cloud is also useful
for the testing of dependable systems using a dependable
operating system.
III. D-CLOUDSOFTWARE TESTING
ENVIRONMENT
To develop a D-Cloud for software testing environment, D-
Cloud consists of multiple virtual machine nodes, which exe-
cute guest operating systems with fault injection, a controller
node, which controls all of the guest operating systems, and a
frontend, which manages the hardware and software
configurations and the test scenarios. Figure 1 shows the
structure of D-Cloud.
A. Virtual machine with fault injection facility
In D-Cloud, it have been implementing FaultVM based on
QEMU as the virtualization software by adding the fault
injection facility. The advantages of using QEMU are described
below.
 QEMU is open-source software. This allows the
modification to the emulation codes of the device for adding
the fault injection facility, and the improvement for the
reproducibility by adding the management of time
synchronization.
 QEU can support various processor architectures. Especially,
emulators for several embedded processors such as ARM and
SH are already available.
 QEMU can emulate a number of hardware devices. Thus
QEMU may treat several hardware faults in the guest OS.
B. Management of computing resources using Eucalyptus
I n order to execute many tests simultaneously, a large amount
of resources must be managed efficiently and flexibly.
Therefore, introduce Eucalyptus as the cloud management
software. Eucalyptus is a cloud computing infrastructure that
manages machine resources flexibly using a virtual machine,
and an open-source implementation having the same API as
AmazonEC2.
The roles of Eucalyptus in D-Cloud are shown as follows:
 Management of various guest OS images on the controller
node
 Transfer of the specified guest OS images from the
controller node to appropriate QEMU nodes
 Beginning and completion of guest operating systems on
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.16-22
ISSN: 2278-2427
QEMU nodes Cpu Number of CPUs
By these features, the tester does not need to be aware of the Mem Size of memory
allocation for computing resources provided by D-Cloud. Nic Number of NICs
Id ID of the used OS image
C. Automated system configuration and testing
D-Cloud automates the system setup and the test process, Table I I - s y s t e m D e fi n i t i o n E L E M E N T
including the fault injection, based on a scenario written by a
tester. ―D-Cloud frontend‖ manages guest operating systems, Element name Meaning
configures system test environments, transfers various data system Delimiter for definition of
from the tester to guest operating systems for the execution of the software environment
testing, and collects testing results from guest operating name Name of the software
systems. host environment
Delimiter of the testing host
hostname Name of the host
D-Cloud frontend performs the following acts: machinename Name of the used machine
 Reception of a test scenario, a test program, input data, config element
Designation of the configuration
and a script including execution commands from a tester file
 Interpretation of the test scenario written in XML A. Configuration for the hardware environment
 Transfer of the test program, the input data, and the The description of the hardware configuration is given by the
script to the guest operating system ―machineDefinition‖ element. Table I lists the contents of the
 Issue of the request for the startup of a guest operating ―machineDefinition‖ element. All hardware components used
system to the Eucalyptus controller node in the test must be defined by each ―machine‖ element. The
 Issue of the fault injection command for the target guest ―machine‖ element must include five elements, ―name,‖ ―cpu,‖
operating system to the appropriate virtual machine ―mem,‖ ―nic,‖ and ―id.‖ The ―name‖ is refered in the
 Collection of the output data, logs, and snapshots from the ―systemDefinition‖ element described in the following sub-
guest operating system section. The ―cpu‖ and ―nic‖ indicate the number of CPUs and
NICs, respectively, and ―mem‖ represents the allocation size of
IV. DESCRIPTIONOFSYSTEM CONFIGURATION the main memory. The ―id‖ element designates the identifier
AND TEST SCENARIO for the system image to be used. Eucalyptus provides each
system image with a unique identifier in the cloud system, and
As described above, D-Cloud performs preparation and test the identifier is also used in D-Cloud.
according to a scenario written in XML. By providing
multiple scenario files, various systems can be tested simul- B. Setting for the software environment
taneously. Furthermore, since the cloud controller manages the
computing resources appropriately, the tester can submit the The description of the software environment is given by the
test items one after another regardless of available computing ―systemDefinition‖ element containing elements shown in
resources. Table II . A l l the software environment used in the test must
Testing scenario statement consists of four parts as follows. be defined by each ―system‖ element. The ―system‖ element
 m a c h i n e D e f i n i t i o n : Descriptions for the hard-ware must include two elements, ―name‖ and ―host.‖ The ―name‖ is
configuration referred in the ―testDescription‖ element. Moreover, the
―host‖ element contains three elements, ―host-name,‖
 systemDefinition: Descriptions for the software ―machinename,‖ and ―config.‖ The ―hostname‖ determines
environment the name of the host, the ―machine name‖ is selected from the
 injectionDefinition: Definitions of faults for ―name‖ of ―machine‖ within the ―machineDefinition‖
injection element. The ―config‖ designates a file containing the various
 t e s t D e f i n i t i o n : Procedures of the entire test kinds of parameters.

Table I-m a c h i n e D e f i n i t i o n E L E M E N T
TableIII- I n j e c t i o n D e f i n i t i o n E L E M E N T
Element Meaning
name
machine Delimiter for definition of the Element name Meaning
name hardwaredefinition
Name environment
of the hardware injection Delimiter for definition of the fault injection
environment
18
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.16-22
ISSN: 2278-2427
name Name definition of the fault injection ―script‖ element includes four elements, ―on,‖ ―putFile,‖
Fault Delimiter for configuration of the injection ―exec,‖ and ―inject‖ for each needed host. The ―on‖ specifies
location Designation of device type the host name defined in the ―systemDefinition‖ element. The
―putFile‖ and ―exec‖ specify the file name for the transfer to
target Designation of target device
the host and the execute command,
kind Type of fault
t i me Duration of the fault event Table V-T e s t D e f i n i t i o n E L E M E N T
Table IV-TY P E S O F F A U L T I N J E C T I O N Element Meaning
Device Fault Value name
Run Delimiter for definition of the test
Hard Specified sector returns badblock Name scenario
Name of the test scenario
disk error r ead o nly systemnam Name of the used system element
Specified sector is read- ecc e alt
H Ending time of the test
only corrupt Script Delimiter for definition of the execution
Error is detected by ECC slow On script
Execution host
Received data contains putFile File transmitted to the guest OS
Netwo error
1bit error of packet 1bit Exec Designation of the script file
rk Response
2bit error ofofpacket
disk becomes 2bit including the execution commands
slow
Error is detected by CRC crc Inject Execution of the fault injection
Packet loss loss
NIC is not responding nic Respectively, the ―inject‖ is selected from the name defined in
the ―injectionDefinition‖ element. The ―inject‖ element also
Memor Bit error Bit
has ―when‖ attribute, which specifies the duration of the fault
y Byte at specified address B yt e
incidence.I n addition to the description by XML, consider the
contains error
support for building the system environment and for the
execution of the system testing by introducing the dynamic
C. Definition of fault injection scripting language. This supplement helps the tester perform the
The definition of fault injection items is given in the desired test easily and flexibly. Moreover, by the use of the
―injectionDefinition‖ element containing elements shown in scripting language, the stylized description may improve the
Table I I I . I t may have multiple ―injection‖ elements, each of portability of the test process.
which has a ―name‖ element and multiple ―fault‖ elements.
The ―injection‖ element is assigned to each fault injection V. PRELIMINARY TEST EXAMPLE USING D-
event. The ―name‖ is referred in the ―testDescription‖ CLOUD
element. The ―fault‖ element must include four elements,
―location,‖ ―target,‖ ―kind,‖ and ―time.‖ The ―location‖ and Preliminarily evaluate D-Cloud by testing the actual
―target‖ specify the target device type and device name to dependable system. It have proposed and developed a fault
inject a fault, respectively. The ―kind‖ indicates the selection tolerant and high-performance interconnection network based
of fault injection elements listed in Table I V . The ―time‖ on the multi-link of Gigabit Ethernet (GbE) named RI2N
represents the duration of fault injection. (Redundant Interconnection with Inexpensive Network) Here,
to assume simplified system using RI2N. Client1 is connected
D. Description for the automatic test procedures with server1 by two Ethernet links, network0 and network1.
The execution of the test is described in the ―testDefinition‖ In this case, network0 and network1 form the RI2N logical
element using the contents shown in Table V. The ―run‖ link. Network2 is also available for issuing the command from
element is used for the independent test definitions, and D-Cloud frontend to each node and the collection of
multiple ―run‖ elements may exist in a ―testDefinition‖ measurement results to D-Cloud frontend. Moreover, to
element. The ―name‖ element defines the name of the system assume the test scenario as follows;
test to be performed. The output file containing test result is
created with the file name based on the content of ―name‖ 1) Client 1 performs burst data transfer to server 1 using
element. The ―systemname‖ indicates the name in the RI2N continuously. I n this case, throughput is expected
―systemDefinition‖ element. The ―halt‖ element with ―when‖ to be twice as high as single link.
attribute decides the finish time of the entire system test. The 2) After 200 seconds from the power-on, the network
19
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.16-22
ISSN: 2278-2427
interface ―eth0‖ of client1 is down during 60 seconds. and distributed software on a grid computing platform using
RI2N link will be down immediately, however, Condor as a workload management system. Unlike D-Cloud
throughput should recover to the level of the single link concept, uses a cloud computing environment, and enables to
after a few seconds. create and execute VM instances for program tests through a
web portal. Cloud is proposed as a cloud computing facility for
3) After that, ―eth0‖ interface on client1 is alive again.
software testing, and performs parallel symbolic execution
RI2N will detect the link recovery, and throughput
based on the source code.
should recover to the same level as in the beginning
condition.
1 <job Descriptio n>
4) Finally, the system is halted 300 seconds after the 2 <machineDefinition>
power-on. 3 <machine>
4 <name>server</name>
5 <cpu>1</cpu> <mem>512</mem>
<nic>3</nic>
6 <id>emi-1D8C0CAA</id>
7 </machine>
8 <machine>
9 <name>client</name>
10 <cpu>1</cpu> <mem>512</mem>
<nic>3</nic>
11 <id>emi-0ACC0C2D</id>
Figure 2. Simplified system example using RI2N
12 </machine>
Based on this scenario, the description by XML can be denoted.
13 </machineDefinitio n>
It is notable that step 2 can be expressed as the fault injection of
14 <systemDefinitio n>
the packet loss against eth0 of client1.To demonstrate the part
15 <system>
of the web interface for the management of test scenarios in D-
16 <name>systemA</name>
Cloud, and it shows that three test scenarios (nic0.xml,
17 <host>
nic1.xml, and nic2.xml) are running simultaneously on D-
18 <hostname>server1</hostname>
Cloud.To indicate the results obtained by the above scenario.
19 <machinename>server</machinename>
Red arrow indicates the duration of the fault injection (60 sec.).
20 <co n fi g >s er v. co nf</co n fig>
I n this result, when the fault is injected to eth0 of client1,
21 </ho st>
throughput falls transiently, and soon throughput recovers to
22 <host>
lower level than before. After eth0 is alive again, with a few
23 <hostname>client1</hostname>
seconds of delay, the throughput recovers to the same level as
24 <machinename>client</machinename>
in the original condition. The absolute values of the throughput
25 < c o n fi g > c l i e n t . c o n f< / c o n fi g >
are incorrect in current D-Cloud. I t is because each packet
26 </ho st>
transfer is performed via real network while the behaviors of
27 </system>
client1 and server1 are emulated within each virtual machine.
28 </s yste mDe finit io n>
Even though, confirm that the fault tolerant and recovery
29 < i n j e c t i o n D e f i n i t i o n >
detection capability of RI2N work correctly by relative
30 <injection>
tendency of the results.
31 <name>in jectionA</name>
32 <fault>
V I . RELATED WORKS
33 <lo catio n>net wo rk</lo c atio n>
34 <target>eth0 </target>
Recently, Large-scale software testing has been studied.
35 <kind>lo ss</kind >
GridUnit executes software tests automatically on the grid by
36 <time>60</time>
distributing the execution of JUnit test suites with minimum
37 < / f ault>
user intervention. GridUnit is naturally limited to the execution
38 </injection>
of JUnit test code by Java. When test nodes are crashed and
39 < / i n j e c t i o n D e f i n i t i o n >
stopped in GridUnit, they cannot execute remaining program
40 <te st De scr ip t io n>
tests. ETICS also provides automated test environments for grid
41 <run>
20
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.16-22
ISSN: 2278-2427

42 <name>testA</name>
43 <systemname>systemA</systemname>
44 <h al t when="300">down</halt>
45 <script>
46 <on>client1</on>
47 <putFile>test.sh</putFile>
48 <exec> test. sh</exec>
49 < i n j e c t when="2 00">injectio nA</inject>
50 </script>
51 </run> Figure 5. Test results obtained by D-Cloud
52 < / t e s t D e s c ri p t io n >
53 </j o b Desc rip t io n> V I I . CONCLUSION AND FUTURE WORK
To present the concept and design of the software testing
Figure 3. Example test scenario for RI2N by XML environment using the cloud computing technology, named D-
Cloud. D-Cloud permits the automatic configuration, testing
with fault injection along the description of the testing scenario.
On the other hand, fault injection techniques in program tests
It have been developing D - Cloud using Eucalyptus as a cloud
have been proposed. DOCTOR is a software fault injector,
management software and QEMU as a virtualization software.
which supports memory faults, CPU faults, and communication
As the software testing using D-Cloud, the preliminary test
faults. Although software fault injection needs modification of
example was denoted, and the result demonstrated that D-Cloud
the source codes to be tested, this approach need not modify the
allows to set up the environment easily, and to test the software
source codes at all for fault injection. FAUmachine performs a
testing for the distributed system. At present, D-Cloud can
software test using virtual machines for fault injection
obtain the testing results including the virtual console logs and
mechanism. However, since FAUmachine does not provide an
the syslog outputs by the running processes and operating
automated test environment, the tester must configure the test
system in FaultVM/QEMU on each node. In general use, it
environment manually.
should consider more sophisticated way to gather the results and
detect the fault from large amount of logs.In future work, it
should append the management mechanism to D-Cloud for
keeping reproducibility by time synchronization in coarse grain
among related virtual machines without sacrificing the
performance. Further, to intro-duce the model simulator written
by the system description language to D-Cloud in order to test
various systems including embedded systems with proprietary
hardware’s.In proposed DS-Bench as a dependability
benchmarking framework for a dependable operating system.
D-Cloud is so useful as the virtual platform for DS-Bench since
anomaly loads can be generated automatically from the request
given by the scenario file using D-Cloud.
Figure 4. Current management screen of D-cloud
REFERENCES
[1] Large-Scale Software Testing Environment using Cloud Computing
Technology for Dependable Parallel and Distributed Systems. Toshihiro
Hanawa, Takayuki Banzai, Hitoshi Koizumi, Ryo Kanbayashi, Takayuki
Imada, and Mitsuhisa Sato Department of Computer Science Center for
Computational Sciences University of Tsukuba
[2] T. Banzai, H. Koizumi, R. Kanbayashi, T. Imada, H. Kimura, T. Hanawa,
and M. Sato, ―D-Cloud: Design of a software testing environment for
reliable distributed systems using cloud computing technology,‖ in Proc.
2nd International Symposium on Cloud Computing (Cloud 2010) in
conjunction with CCGrid2010, May 2010, (To be appeared).

21
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.16-22
ISSN: 2278-2427
[3] Y. Ishikawa et al., ―Towards an open dependable operating system,‖ in
Proc. 12th International Symposium on Object/Component/Service-
Oriented Real-Time Distributed Computing, Mar. 2009, pp. 20–27.
[4] Nurmi et al., ―The eucalyptus open-source cloud-computing system,‖ in
Proc. 9th IEEE/ACM International Symposium on Cluster Computing and
the Grid (CCGrid ’09), 2009, pp. 124–131.
[5] Amazon elastic compute cloud (Amazon EC2). [Online]. Available:
http://aws.amazon.com/ec2/
[6] S. Miura, T. Hanawa, T. Yonemoto, T. Boku, and M. Sato, ―RI2N/DRV:
Multi-link Ethernet for high-bandwidth and fault-tolerant network on PC
clusters,‖ in Proc. The 9th Workshop on Communication Architecture for
Clusters (CAC) in IPDPS, May 2009, pp. 1–8.
[7] Duarte, W. Cirne, F. Brasileiro, and P. Machado, ―GridUnit: software
testing on the grid,‖ in Proc. 28th international conference on Software
engineering (ICSE ’06), 2006, pp. 779–782.
[8] M.-E. Begin et al., ―Build, configuration, integration and testing tools for
large software projects: ETICS,‖ in Proc. Rapid Integration of Software
Engineering Techniques, ser. Lecture Notes in Computer Science, vol.
4401, Sep. 2007, pp. 81–97.
[9] Open Solaris test farm. [Online]. Available: http://opensolaris.
Org/os/community/testing/testfarm

Author Profile:

S.Ravichandran- S.Ravichandran is an Associate Professor

in Department of Information Technology at Sri Krishna
Engineering College. He received the Master of Computer
Application in Bharathidhasan University at 1996, he received
the Master of Philosophy in Computer science in Madurai
Kamaraj University at 2007, he received the Master of
Engineering in Computer Science and Engineering from Anna
University at 2010 and now he is perusing Doctorate of
philosophy in Computer science at Bharathiar University. He
has 16.5 years of teaching experiences from various
Engineering Colleges. He has published 1 paper in
international journal (IJCSE) and he has presented in 12
International Conferences & presented in 15 National
Conferences in various Engineering Colleges. His area of
interest includes Cloud Computing, Artificial Intelligence,
Networks and Compilers.

22
 Integrated Intelligent Research(IIR)
An Efficient Approach for Using the Wireless
Sensor Networks in Mobile Computing
1
V.khanaa, 2 Krishna Mohanta
1
Research Scholar, Bharath University, Chennai – 600 073, INDIA,
2
Sri Sai Ram Engg. College Chennai 600 044., INDIA,
Email: drvkannan62@yahoo.com,krishnamohanta@gmail.com
Abstract-A sensor network typically comprises a large number of
low-power, low-cost, tiny embedded devices with sensing
capabilities, which are networked together to collect, process,
and deliver information about a physical phenomenon of interest.
The position of the nodes could be engineered or predetermined,
such as in structural health monitoring, where nodes are placed at
optimal locations to maximize the fidelity of measured vibrations
for accurate and reliable diagnosis about the health of the
structure. On other occasions, nodes could be placed randomly,
allowing deployment of networks over inaccessible terrains or in
disaster recovery operations. Wireless Sensor Networks (WSN)
[1] have appeared as one of the most prominent enabling
technologies of Micro-Electro-Mechanical Systems
(MEMS)MEMS, which combines automated sensing, embedded
computing, and wireless capabilities into tiny devices, bringing
promises of understanding and incrementing nature at scales that
were unimaginable before. Just like the invention of microscope
has let us see things that were previously invisible to the naked
eye, wireless sensor networks have enabled us not only to detect
and measure a physical phenomenon with accuracy even at the
microscopic level, but also to communicate the measured
information across distances using the wireless medium.
Wireless Sensor Networks is focused on developing low-power
sensing the devices to enable large-scale, distributed, networked
sensor system through the sense-IT project. This Concept is used
for Data Communication as well as mobile computing is very
purpose to used for wireless sensor networks. Deployment of
sensor networks are increasing either manually or randomly to
monitor physical environments in different applications such as
military, agriculture, medical transport, industry etc. In
monitoring of physical environments, the most important
application of wireless sensor network is monitoring of critical
conditions. The most important in monitoring application like
critical condition is the sensing of information during emergency
state from the physical environment where the network of
sensors is deployed. In order to respond within a fraction of
seconds in case of critical conditions like explosions, fire and
leaking of toxic gases, there must be a system which should be
23
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.23-30
ISSN: 2278-2427
fast enough. A big challenge to sensor networks is a fast, reliable
and fault tolerant channel during emergency conditions to sink
(base station) that receives the events. The main focus of this
thesis is to discuss and evaluate the performance of two different
routing protocols like Ad hoc On Demand Distance Vector
(AODV) and Dynamic Source Routing (DSR) for monitoring of
critical conditions with the help of important metrics like
throughput and end-to-end delay in different scenarios. On the
basis of results derived from simulation a conclusion is drawn on
the comparison between these two different routing protocols
with parameters like end-to-end delay and throughput.
I. MOBILE COMMUNICATION PRINCIPLES
Each mobile uses a separate, temporary radio channel to talk to
the cell site. The cell site talks to many mobiles at once, using
one channel per mobile. Channels use a pair of frequencies for
communication—one frequency (the forward link) for
transmitting from the cell site and one frequency (the reverse
link) for the cell site to receive calls from the users. Radio energy
dissipates over distance, so mobiles must stay near the base
station to maintain communications. The basic structure of
mobile networks includes telephone systems and radio services.
Where mobile radio service operates in a closed network and has
no access to the telephone system, mobile telephone service
allows interconnection to the telephone network
1.2Early Mobile Telephone System Architecture
Traditional mobile service was structured in a fashion similar to
television broadcasting: One very powerful transmitter located at
the highest spot in an area would broadcast in a radius of up to 50
kilometers. The cellular concept structured the mobile telephone
network in a different way.
Instead of using one powerful transmitter, many low-power
transmitters were placed throughout a coverage area. For
example, by dividing a metropolitan region into one hundred
different areas (cells) with low-power transmitters using 12
conversations (channels) each,
 Integrated Intelligent Research(IIR)
Figure-1: Basic Mobile Telephone Service Network
the system capacity theoretically could be increased
from 12 conversations—or voice channels using one
powerful transmitter—to 1,200 conversations
(channels) using one hundred low-power transmitters.
Figure-2: Telephone Network Transmitter
1.2.1 Mobile Telephone System Using the Cellular Concept:
Interference problems caused by mobile units using the same
channel in adjacent areas proved that all channels could not be
reused in every cell. Areas had to be skipped before the same
channel could be reused. Even though this affected the efficiency
of the original concept, frequency reuse was still a viable
solution to the problems of mobile telephony systems.
Engineers discovered that the interference effects were not due to
the distance between areas, but to the ratio of the distance
between areas to the transmitter power (radius) of the areas. By
reducing the radius of an area by 50 percent, service providers
could increase the number of potential customers in an area
fourfold. Systems based on areas with a one-kilometer radius
would have one hundred times more channels than systems with
areas 10 kilometers in radius. Speculation led to the conclusion
that by reducing the radius of areas to a few hundred meters,
millions of calls could be served.The cellular concept employs
variable low-power levels, which allow cells to be sized
according to the subscriber density and demand of a given area.
As the population grows, cells can be added to accommodate that
growth. Frequencies used in one cell cluster can be reused in
other cells. Conversations can be handed off from cell to cell to
maintain constant phone service as the user moves between cells.
24
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.23-30
ISSN: 2278-2427
Figure-3: Mobile Telephone System Using a Cellular
Architecture
The cellular radio equipment (base station) can communicate
with mobiles as long as they are within range. Radio energy
dissipates over distance, so the mobiles must be within the
operating range of the base station. Like the early mobile radio
system, the base station communicates with mobiles via a
channel. The channel is made of two frequencies, one for
transmitting to the base station and one to receive information
from the base station.
1.2.2. Cellular System Architecture:
Increases in demand and the poor quality of existing service led
mobile service providers to research ways to improve the quality
of service and to support more users in their systems. Because
the amount of frequency spectrum available for mobile cellular
use was limited, efficient use of the required frequencies was
needed for mobile cellular coverage. In modern cellular
telephony, rural and urban regions are divided into areas
according to specific provisioning guidelines. Deployment
parameters, such as amount of cell-splitting and cell sizes, are
determined by engineers experienced in cellular system
architecture. Provisioning for each region is planned according to
an engineering plan that includes cells, clusters, frequency reuse,
and handovers.
1.1.4. Benefits of Cells using Sensor Networks:
A cell is the basic geographic unit of a cellular system. The term
cellular comes from the honeycomb shape of the areas into
which a coverage region is divided. Cells are base stations
transmitting over small geographic areas that are represented as
hexagons. Each cell size varies depending on the landscape.
Because of constraints imposed by natural terrain and man-made
structures, the true shape of cells is not a perfect hexagon.
1.1.5. Clusters
Cluster computing is a form of computing in which a group of
computers are linked together so that they can act like a single
 Integrated Intelligent Research(IIR)
entity. There are a number of reasons for people to use cluster
computers for computing tasks, ranging from an inability to
afford a single computer with the computing capability of a
cluster to a desire to ensure that a computing system is always
available. The precise date at which this technique was
developed is unknown, and there are competing claims for the
invention credit, with some people suggesting that individual
users probably developed cluster computing independently to
meet their computing needs long before the technique was used
in industrial settings.A Cluster is a group of Cells. No channels
are reused within a cluster. Figure Illustrates a seven- cell cluster.
Figure-4: A Seven-Cell Cluster
1.1.6. Frequency Reuse:
Only a small number of radio channel frequencies were available
for mobile systems, engineers had to find a way to reuse radio
channels to carry more than one conversation at a time. The
solution the industry adopted was called frequency planning or
frequency reuse. Frequency reuse was implemented by
restructuring the mobile telephone system architecture into the
cellular concept. The concept of frequency reuse is based on
assigning to each cell a group of radio channels used within a
small geographic area. Cells are assigned a group of channels
that is completely different from neighboring cells. The coverage
area of cells is called the footprint. This footprint is limited by a
boundary so that the same group of channels can be used in
different cells that are far enough away from each other so that
their frequencies do not interfere. Cells with the same number
have the same set of frequencies. Here, because the number of
available frequencies is 7, the frequency reuse factor is 1/7. That
is, each cell is using 1/7 of available cellular channels
Figure-5: Frequency Reuse
. and the sink is possible, the most common form of
1.1.7. Cell Splitting
25
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.23-30
ISSN: 2278-2427
Unfortunately, economic considerations made the concept of
creating full systems with many small areas impractical. To
overcome this difficulty, system operators developed the idea of
cell splitting. As a service area becomes full of users, this
approach is used to split a single area into smaller ones. In this
way, urban centers can be split into as many areas as necessary to
provide acceptable service levels in heavy-traffic regions, while
larger, less expensive cells can be used to cover remote rural
regions.
Figure-6 : Cell Splitting
1.1.8. Handoff
The final obstacle in the development of the cellular network
involved the problem created when a mobile subscriber traveled
from one cell to another during a call. As adjacent areas do not
use the same radio channels, a call must either be dropped or
transferred from one radio channel to another when a user
crosses the line between adjacent cells. Because dropping the call
is unacceptable, the process of handoff was created. Handoff
occurs when the mobile telephone network automatically
transfers a call from radio channel to radio channel as mobile
crosses adjacent cells.During a call, two parties are on one voice
channel. When the mobile unit moves out of the coverage area of
a given cell site, the reception becomes weak. At this point, the
cell site in use requests a handoff. The system switches the call to
a stronger-frequency channel in a new site without interrupting
the call or alerting the user. The call continues as long as the user
is talking, and the user does not notice the handoff at all.
II. DATA COMMUNICATION PATTERNS IN
SENSOR NETWORKS
Sensor networks are characterized by ad hoc multi-hop networks
that are capable of self-organizing without the help of any
external infrastructure. Once a network is deployed, the nodes
collect data about a physical phenomenon of interest, process it
locally, and send it toward a common sink node, which can
perhaps fuse all the received data and make intelligent decisions.
The sink node is typically high-powered, such as a laptop, with
larger memory and processing power. Although in small-scale,
single-hop networks, direct communication between the nodes
communication in large-scale, multi-hop networks is peer-to-
 Integrated Intelligent Research(IIR)
peer, i.e., among neighboring nodes. This peer-to-peer
communication over short distances is ideal for low-power,
short-range radios, and allows nodes to cooperate and
collectively work toward a common goal.There are three basic
data communication patterns in sensor networks: (i)
convergecast, (ii) unicast or local broadcast, and (iii) multicast.
We describe each of them in details below.
Convergecast: It is a many-to-one communication pattern [3, 4
], where data flows from a set of nodes toward a common sink
over a tree-based routing topology. This is the most common
form of data communication and constitutes a fundamental
operational primitive in sensor networks. When the sensor
readings are correlated due to spatial/temporal proximity of the
nodes, or when the application requires summarized information,
data is often combined or aggregated at each hop en route to the
sink. Data aggregation [5] has been put forward as an essential
paradigm for wireless routing in sensor networks, where the idea
is to combine the data coming from different sources before
transmitting to the upstream node toward the sink. It has been
shown that aggregation can eliminate redundancy and minimize
the number of transmissions, thus saving energy. This paradigm
shifts the focus from traditional address-centric approaches for
networking (finding short routes between pairs of addressable
end-nodes) to a more data-centric approach, i.e., finding routes
from multiple sources to a single destination that allows in-
network consolidation of redundant data. We refer to the
converge cast process under aggregation as aggregated
convergecast [6,7], and distinguish it from raw-data
convergecast [8,9 ] when there is no aggregation.
Unicast: It is a form of local broadcast where a node exchanges
data with its local neighbors, for instance, to perform
collaborative data processing and fusion instead of transmitting
raw sensor readings
Multicast: It can be considered as opposite to converge cast, i.e.,
one-to-many communication pattern in which data is
disseminated from the sink to a set of nodes. Multicast could be
used, for instance, in reprogrammable sensor networks where the
sink supplies automatic network-wide updates of system
software or reconfiguration information to all the nodes.
2.2Data Acquisition Models in Sensor Networks:
Converge cast or many-to-one communication being the most
fundamental form of data collection in sensor networks, it is
natural to ask what triggers the data collection process; in other
words, what are the data acquisition models in sensor networks.
Here, we present a classification of the most common types of
data acquisition models [10] and give examples of applications to
which they are relevant.
26
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.23-30
ISSN: 2278-2427
• Continuous/Periodic Delivery: This form of data collection
is most relevant for real-time, mission-critical applications
where sensing and collection are performed synchronously, or
for applications where periodic notification of events is
required. Such data collection usually takes place over long
durations of time ranging from low data-rate scenarios, such as
in surveillance and habitat monitoring, to high data-rate
scenarios, such as in structural health and permafrost
monitoring. Since the nodes need to continuously sense and
transmit data, energy efficiency is a big concern for continuous
and periodic data collection.
• Query-Driven Delivery: In this model [11], the nodes send
data only when triggered by an external query fed into the
network by the sink node. Since the nodes could sleep most of
the time and wake up to collect data only when triggered by
the queries, this delivery model is efficient in terms of energy
consumption. Typical application scenarios for query-driven
data delivery includes getting a snapshot view of the network,
or sending back ack/acknowledgments in response to software
reconfigure/upgrade messages sent by the sink. Such data
delivery usually spans over short intervals.
• Event-Driven Delivery: The sensor nodes could be
programmed to deliver data whenever an event of interest
occurs within the network. This mode of data acquisition is
useful when the events are rare but critical. However, such
events could also trigger huge bursts of data that require
immediate delivery. Since the nodes need to sense the
environment continuously for possible occurrence of the
events, but transmit only when an actual event occurs, energy
consumption is a lesser severe concern compared to the case of
continuous/periodic delivery.
2.3Characteristics Wireless Network:
Routing in WSNs is very challenging due to the inherent
characteristics that distinguish these networks from other
wireless networks like mobile ad hoc networks or cellular
networks.
 First, due to the relatively large number of sensor nodes, it is
not possible to build a global addressing scheme for the
deployment of a large number of sensor nodes as the
overhead of ID maintenance is high. Thus, traditional IP-
based protocols may not be applied to WSNs. Furthermore,
sensor nodes that are deployed in an ad hoc manner need to
be self-organizing as the ad hoc deployment of these nodes
requires the system to form connections and cope with the
resultant nodal distribution especially that the operation of
the sensor networks is un-attended. In WSNs, sometimes
getting the data is more important than knowing the IDs of
which nodes sent the data.
 Integrated Intelligent Research(IIR)
 Second, in contrast to typical communication networks,
almost all applications of sensor networks require the flow
of sensed data from multiple sources to a particular BS.
This, however, does not prevent the flow of data to be in
other forms (e.g., multicast or peer to peer).
 Third, sensor nodes are tightly constrained in terms of
energy, processing, and storage capacities. Thus, they
require careful resource management.
 Fourth, in most application scenarios, nodes in WSNs are
generally stationary after deployment except for, may be, a
few mobile nodes. Nodes in other traditional wireless
networks are free to move, which results in unpredictable
and frequent topological changes. However, in some
applications, some sensor nodes may be allowed to move
and change their location (although with very low mobility).
Fourth, sensor networks are application specific, i.e., design
requirements of a sensor network change with application.
For example, the challenging problem of low-latency
precision tactical surveillance is different from that required
for a periodic weather-monitoring task.
 Fifth, position awareness of sensor nodes is important since
data collection is normally based on the location. Currently,
it is not feasible to use Global Positioning System (GPS)
hardware for this purpose. Methods based on triangulation
[17], for example, allow sensor nodes to approximate their
position using radio strength from a few known points. It is
found in [17] that algorithms based on triangulation or
multilateration can work quite well under conditions where
only very few nodes know their positions apriori, e.g., using
GPS hardware. Still, it is favorable to have GPS-free
solutions [18] for the location problem in WSNs.
 Finally, data collected by many sensors in WSNs is typically
based on common phenomena, hence there is a high
probability that this data has some redundancy. Such
redundancy needs to be exploited by the routing protocols to
improve energy and bandwidth utilization. Usually, WSNs
are data-centric networks in the sense that data is requested
based on certain attributes, i.e., attribute-based addressing.
An attribute-based address is composed of a set of attribute-
value pair query. For example, if the query is something like
[temperature > 60F], then sensor nodes that sense
temperature > 60F only need to respond and report their
readings. Due to such differences, many new algorithms
have been proposed for the routing problem in WSNs.
2.4Challenges of wireless Sensor:
There are many underlying characteristics of wireless sensor
networks and the most important ones are considered here.
Exploiting redundancy: Sensor nodes are expected to run out of
27
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.23-30
ISSN: 2278-2427
energy because of limited battery power. They are also prone to
failure because of random placement of nodes in a harsh
environment, presence of unexpected obstacles, unreliable nature
of the wireless link, and nodes in a neighborhood might not be
able to reach each other occasionally. Redundancy and device
density are exploited to ensure full coverage of the intended
terrain and allow the network to self reconfigure when
communication links are disrupted.
Data-Centric Routing: In the data-centric paradigm, sensor
nodes need not be identified by a unique ID. The querying unit
usually called a sink, identifies multiple responding sensors
based on the required and collected data. The query is not
addressed to any specific sensor, but is based on the data
observed by the sensor and hence it is termed as the data-centric
approach. Moreover, as nodes in a locality sense the same
phenomenon, the traditional end-to-end routing used in MANETs
cannot be applied to sensor networks for query processing. Data-
centric routing is eminently suited to perform operations such as
data aggregation in sensor networks.
Data Aggregation: Data implosion and overlap are common
phenomenon in a sensor network as nodes in the proximity
usually hold similar data. Energy is therefore wasted when the
same data value from multiple sources is individually routed to
the sink. It is desirable to process as much data locally as
possible so as to reduce the number of bits transmitted in the air,
particularly over a long distance. Transmitting 1 Kb of data a
distance of 100 m costs the same amount of energy as executing
300 million instructions on a general purpose processor with a
modest computing device rate of 100 million instructions per
second (MIPS).
Localized Algorithms: These can be implemented in a
distributed manner and are therefore attractive in environments
where the delay and communication overhead associated with
collection/dissemination of global information can adversely
affect the overall performance. Local processing and
collaboration among sensor nodes are encouraged for filtering
and combining readings from sensor nodes in a neighborhood.
2.5Routing Challenges and Design Issues in WSNs:
Despite the innumerable applications of WSNs, these networks
have several restrictions, e.g., limited energy supply, limited
computing power, and limited bandwidth of the wireless links
connecting sensor nodes. One of the main design goals of WSNs
is to carry out data communication while trying to prolong the
lifetime of the network and prevent connectivity degradation by
employing aggressive energy management techniques.The design
of routing protocols in WSNs is influenced by many challenging
factors. These factors must be overcome before efficient
communication can be achieved in WSNs. In the following are
 Integrated Intelligent Research(IIR)
some of the routing challenges and design issues that affect
routing process in WSNs.
2.5.1. Node Deployment:
Node deployment in WSNs is application dependent and affects
the performance of the routing protocol. The deployment can be
either deterministic or randomized. In deterministic deployment,
the sensors are manually placed and data is routed through pre-
determined paths. However, in random node deployment, the
sensor nodes are scattered randomly creating an infrastructure in
an ad hoc manner. If the resultant distribution of nodes is not
uniform, optimal clustering becomes necessary to allow
connectivity and enable energy efficient network operation.
Inter-sensor communication is normally within short
transmission ranges due to energy and bandwidth limitations.
Therefore, it is most likely that a route will consist of multiple
wireless hops.
2.5.2. Energy Consumption without losing accuracy:
Sensor nodes can use up their limited supply of energy
performing computations and transmitting information in a
wireless environment. As such, energy conserving forms of
communication and computation are essential. Sensor node
lifetime shows a strong dependence on the battery lifetime [21].
In a multihop WSN, each node plays a dual role as data sender
and data router. The malfunctioning of some sensor nodes due to
power failure can cause significant topological changes and
might require rerouting of packets and reorganization of the
network.Data Reporting Model: Data sensing and reporting in
WSNs is dependent on the application and the time criticality of
the data reporting. Data reporting can be categorized as either
time-driven (continuous), event-driven, query-driven, and hybrid
[22]. The time-driven delivery model is suitable for applications
that require periodic data monitoring. As such, sensor nodes will
periodically switch on their sensors and transmitters, sense the
environment and transmit the data of interest at constant periodic
time intervals. In event-driven and query-driven models, sensor
nodes react immediately to sudden and drastic changes in the
value of a sensed attribute due to the occurrence of a certain
event or a query is generated by the BS. As such, these are well
suited for time critical applications. A combination of the
previous models is also possible. The routing protocol is highly
influenced by the data reporting model with regard to energy
consumption and route stability.
2.5.3. Node/Link Heterogeneity:
In many studies, all sensor nodes were assumed to be
homogeneous, i.e., having equal capacity in terms of
computation, communication, and power. However, depending
28
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.23-30
ISSN: 2278-2427
on the application a sensor node can have different role or
capability. The existence of heterogeneous set of sensors raises
many technical issues related to data routing. For example, some
applications might require a diverse mixture of sensors for
monitoring temperature, pressure and humidity of the
surrounding environment, detecting motion via acoustic
signatures, and capturing the image or video tracking of moving
objects. These special sensors can be either deployed
independently or the different functionalities can be included in
the same sensor nodes. Even data reading and reporting can be
generated from these sensors at different rates, subject to diverse
quality of service constraints, and can follow multiple data
reporting models. For example, hierarchical protocols designate a
cluster- head node different from the normal sensors. These
cluster heads can be chosen from the deployed sensors or can be
more powerful than other sensor nodes in terms of energy,
bandwidth, and memory. Hence, the burden of transmission to
the BS is handled by the set of cluster-heads
2.5.4. Fault Tolerance:
Some sensor nodes may fail or be blocked due to lack of power,
physical damage, or environmental interference. The failure of
sensor nodes should not affect the overall task of the sensor
network. If many nodes fail, MAC and routing protocols must
accommodate formation of new links and routes to the data
collection base stations. This may require actively adjusting
transmit powers and signaling rates on the existing links to
reduce energy consumption, or rerouting packets through regions
of the network where more energy is available. Therefore,
multiple levels of redundancy may be needed in a fault-tolerant
sensor network.
2.5.5. Scalability:
The number of sensor nodes deployed in the sensing area may be
in the order of hundreds or thousands, or more. Any routing
scheme must be able to work with this huge number of sensor
nodes. In addition, sensor network routing protocols should be
scalable enough to respond to events in the environment. Until an
event occurs, most of the sensors can remain in the sleep state,
with data from the few remaining sensors providing a coarse
quality.
2.5.6. Network Dynamics:
Most of the network architectures assume that sensor nodes are
stationary. How-ever, mobility of both BS's or sensor nodes is
sometimes necessary in many applications [23]. Routing
messages from or to moving nodes is more challenging since
route stability becomes an important issue, in addition to energy,
bandwidth etc. Moreover, the sensed phenomenon can be either
 Integrated Intelligent Research(IIR)
dynamic or static depending on the application, e.g., it is
dynamic in a target detection/tracking application, while it is
static in forest monitoring for early ¯re prevention. Monitoring
static events allows the network to work in a reactive mode,
simply generating traffic when reporting. Dynamic events in
most applications require periodic reporting and consequently
generate significant traffic to be routed to the BS.
2.5.7. Transmission Media:
In a multi-hop sensor network, communicating nodes are linked
by a wireless medium. The traditional problems associated with a
wireless channel (e.g., fading, high error rate) may also affect the
operation of the sensor network. In general, the required
bandwidth of sensor data will be low, on the order of 1-100 kb/s.
Related to the transmission media is the design of medium access
control (MAC). One approach of MAC design for sensor
networks is to use TDMA based protocols that conserve more
energy compared to contention based protocols like CSMA (e.g.,
IEEE 802.11). Bluetooth technology [24] can also be used.
2.5.8 Connectivity
High node density in sensor networks precludes them from being
completely isolated from each other. Therefore, sensor nodes are
expected to be highly connected. This, however, may not prevent
the network topology from being variable and the network size
from being shrinking due to sensor node failures. In addition,
connectivity depends on the, possibly random, distribution of
nodes.
2.5.9 Coverage
In WSNs, each sensor node obtains a certain view of the
environment. A given sensor's view of the environment is limited
both in range and in accuracy; it can only cover a limited
physical area of the environment. Hence, area coverage is also an
important design parameter in WSNs.
2.5.10 Data Aggregation
Since sensor nodes may generate significant redundant data,
similar packets from multiple nodes can be aggregated so that the
number of transmissions is reduced. Data aggregation is the
combination of data from different sources according to a certain
aggregation function, e.g., duplicate suppression, minima,
maxima and average. This technique has been used to achieve
energy efficiency and data transfer optimization in a number of
routing protocols. Signal processing methods can also be used for
data aggregation. In this case, it is referred to as data fusion
where a node is capable of producing a more accurate output
signal by using some techniques such as beam forming to
29
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.23-30
ISSN: 2278-2427
combine the incoming signals and reducing the noise in these
signals.
2.5.11 Quality of Service
In some applications, data should be delivered within a certain
period of time from the moment it is sensed, otherwise the data
will be useless. Therefore bounded latency for data delivery is
another condition for time-constrained applications. However, in
many applications, conservation of energy, which is directly
related to network lifetime, is considered relatively more
important than the quality of data sent. As the energy gets
depleted, the network may be required to reduce the quality of
the results in order to reduce the energy dissipation in the nodes
and hence lengthen the total network lifetime. Hence, energy-
aware routing protocols are required to capture this requirement.
2.6Summary
Wireless Sensor Networks (WSNs) have attracted significant
attention over the past few years. A growing list of civilians &
border security force using wireless sensor networks for
increased effectiveness; especially in hostile and remote areas.
Examples includes disaster management, border protection,
combat field surveillance. In these applications a large number of
sensors are expected, requiring careful architecture and
management of the network. Grouping nodes into clusters has
been the most popular approach for support scalability in WSNs.
In this paper, we surveyed lot of research and classifications and
benefits of different schemes. We categorized the different
schemes according to their objectives, the desired cluster
properties and clustering process. We highlighted the effect of
the network model on the pursued approaches and summarized a
number of schemes, stating their strength and limitations of
wireless sensor networks.
REFERENCES
[1] F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. A Survey on
SensorNetworks. IEEE Communications Magazine, 40(8):102–114, 2002.
[2] S. Gandham, Y. Zhang, and Q. Huang. Distributed Minimal Time
Convergecast Scheduling in Wireless Sensor Networks. In 26th IEEE
International Conference on Distributed Computing Systems (ICDCS),
pages 50–57, July 2006.
[3] S. Gandham, Y. Zhang, and Q. Huang. Distributed time-optimal
scheduling for convergecast in wireless sensor networks. Computer
Networks, 52(3):610–629,2008.
[4] DARPA. SensIT Project. http://dtsn.darpa.mil/ixo/sensit.asp
[5] S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. TAG: a Tiny
Aggregation service for ad-hoc sensor networks. SIGOPS Operating
Systems Review,36(SI):131–146, 2002.
[6] A. Ghosh, O. D. Incel, V. S. Anil Kumar, and B. Krishnamachari. Multi-
channel scheduling algorithms for fast aggregated convergecast in sensor
networks. In 6th IEEE International Conference on Mobile Adhoc and
Sensor Systems (MASS),pages 363–372, October 2009
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.23-30
ISSN: 2278-2427

[7] A. Ghosh, O. D. Incel, V. S. Anil Kumar, and B. Krishnamachari. Multi-

Channel Scheduling and Spanning Trees: Throughput-Delay Trade-off for
Fast Data Collection in Sensor Networks (under submission). IEEE/ACM
Transactions on Networking, 2010.
[8] O. D. Incel, A. Ghosh, B. Krishnamachari, and K. Chintalapudi. Fast Data
Collection in Tree-BasedWireless Sensor Networks (under revision). IEEE
Transactions on Mobile Computing, 2009.
[9] O. D. Incel and B. Krishnamachari. Enhancing the Data Collection Rate of
Tree-Based Aggregation in Wireless Sensor Networks. In 5th Annual
IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc
Communications and Networks (SECON), pages 569–577, June 2008.
[10] S. Tilak, N. B. Abu-Ghazaleh, and W. Heinzelman. A taxonomy of
wireless micro-sensor network models. SIGMOBILE Mobile Computing
and Communications Review, 6(2):28–36, 2002.
[11] S. Chatterjea. Distributed and Self-Organizing Data Management
Strategies for Wireless Sensor Networks. A Cross-Layered Approach. PhD
thesis, University of Twente, Enschede, the Netherlands, September 2008.
[12] G. Lu and B. Krishnamachari. Minimum latency joint scheduling and
routing in wireless sensor networks. Ad Hoc Networks, 5(6):832–843,
2007.
[13] W. R. Heinzelman, J. Kulik, and H. Balakrishnan. Adaptive protocols for
information dissemination in wireless sensor networks. In 5th Annual
ACM/IEEE International Conference on Mobile Computing and
Networking (MOBICOM), pages 174–185, 1999.
[14] O. Gnawali, R. Fonseca, K. Jamieson, D. Moss, and P. Levis. Collection
tree protocol. In 7th ACM Conference on Embedded Networked Sensor
Systems (SenSys), pages 1–14, November 2009.
[15] S. Upadhyayula and S. K. S. Gupta. Spanning tree based algorithms for
low latency and energy efficient data aggregation enhanced convergecast
(DAC) in wireless sensor networks. Ad Hoc Networks, 5(5):626–648,
2007.D. B. Johnson, D. A. Maltz, and J. Broch. DSR: The Dynamic Source
Routing Protocol for Multi-Hop Wireless Ad Hoc Networks, pages 139–
172. Addison-Wesley, 2001.
[16] N. Bulusu, J. Heidemann, D. Estrin,\GPS-less low cost outdoor
localization for very small devices", Technical report 00-729, Computer
science department, University of Southern California, Apr. 2000.\
[17] A. Savvides, C-C Han, aind M. Srivastava,\Dynamic ¯ne-grained
localization in Ad-Hoc networks of sensors," Proceedings of the Seventh
ACM Annual International Conference on Mobile Computing and
Networking (MobiCom), July 2001. pp.166-179.
[18] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on
sensor networks," IEEE Communications Magazine, Volume: 40 Issue: 8,
pp.102-114, August 2002.
[19] S. Tilak, N. Abu-Ghazaleh, W. Heinzelman,A taxonomy of wireless
micro-sensor network models", ACM SIGMOBILE Mobile Computing
and Communications Review, Volume 6, Issue 2 (April 2002), pp 28-36.
[20] W. Heinzelman, A. Chandrakasan and H. Balakrishnan, "Energy-Efficient
Communication Protocol for Wireless Micro sensor Networks,"
Proceedings of the 33rd Hawaii International Conference on System
Sciences (HICSS '00), January 2000.
[21] ‘Y. Yao and J. Gehrke, The cougar approach to in-network query
processing in sensor networks", in SIGMOD Record, September 2002.
[22] F. Ye, H. Luo, J. Cheng, S. Lu, L. Zhang, \A Two-tier data dissemination
model for large-scale wireless sensor.

30
 Integrated Intelligent Research(IIR)
Low Cost Communication Link for Intelligent Public
Transport System with Dynamic Protocol
Ranjana Dinkar Raut,Vineet Kumar Goyal, Nikhil Arora
Associate Prof., SGBAU (Amravati) Amravati, Maharashtra, India
E&EC Dept. MJRPU (Jaipur) Jaipur, Rajasthan, India
Scientist/Engineer SD, ISRO (Bangalore) Bangalore, Karnataka, India
Email:rdr24164@rediffmail.com,vineet_eic@yahoo.com,nikhilele@gmail.com
Abstract—This paper is about research to provide the solution
for optimization of use of public transport, better services to
users and various options to management to improve transport
system with cost effective. Many existing models for bus arrival
prediction system, based on vehicle motion tracking with high
cost equipments. Bus arrival Prediction Technology (BAPT) is
the key technology of designing and implementation with low
cost communication link and specialized protocol. With the help
of GPRS based communication, the central station can connect
the each bus station, and receiving all information about the
current status of the every vehicle. Based on analysis of traffic
density at central stand, it will update all bus stands with updated
predicted time within stations. Specialized protocol designs in
such a way that it communicate among buses, bus stands and
central stand. It helps in bus failure detection system which
improves transport management.
Keywords- Bus Stand Module (BSM), Central Stand Module
(CSM), Global Position System (GPS), Bus arrival Prediction
Technology (BAPT).
I. INTRODUCTION
Intelligent Transportation Systems is an application of current
information and communications technologies to the
transportation area. Public transport faces severe problems in
almost all countries of the developing world, perhaps most
important, the lack of efficient transport system resources due to
high investments involves. Developing countries transport
systems desperately lacking the necessary financial resources for
investment in infrastructure, vehicles and new technologies [1].
There are several studies and researches in this field. Most of the
existing system use advances communication system in
technologies like wireless communication, Global Positioning
System (GPS). Automatic Vehicle Location (AVL) systems and
Automatic Passenger Counters (APC) based on global
positioning systems (GPS) have been adopted by many transit
systems to monitor the movements of buses on real time basis.
The geographic information system (GIS) or GPS tools used in a
transit system for monitoring the movement of buses can also be
31
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.31-35
ISSN: 2278-2427
used to create a digital route map [2-5]. Most of the GPS based
intelligent public transport system not feasible in developing
countries due to high cost GPS system. In fact, we need not to be
bothered about the movement process of buses, but focus on the
buses arrival time or the departure time at bus stations. In 2009, a
RFID based system purposed for Bus Management System. This
system can monitor bus traffic inside spacious bus stations, and
can inform administrators whether the bus is arriving on time,
early or late. This information is then displayed on the different
wireless displays inside and outside the bus station [6]. This real-
time schedule tracker system developed only for schedule bus
timing within bus stand. In 2011, a GSM based system
purposed, in which GSM Machine fitted on buses, is used to
transmit a 32-bit binary code, which is received by the receiver
which encodes it. People density value and other data, is
collectively transmitted to the computer connected to server via
SMS system [7]. This system is expensive due to using GSM
machine on all buses and SMS service used for data
transmission.
II. SYSTEM ARCHITECTURE
In the research, develop a cost-effective model to predict the bus
arrival time at stops using historical and analytical bus travel
time information which receives from all bus stands. For
fulfilling this aim, implemented a wireless communication
network, based on low cost and low range RF receiver and
transmitter module.
A. Software Implementation
The main contribution in this paper is to design the
communication protocol and software which helps to
communicate among all BAPT modules. The objective of this
software is to interface between stand to bus, bus to bus, stand to
stand, stand to GPRS device and display.
1) Protocol implementation – In proposed system, one dynamic
communication protocol implemented as shown in figure 1. This
protocol is able to communicate all BAPT modules which is
based on type of communication, to make the system more
reliable. According to type of communication and command
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.31-35
ISSN: 2278-2427
field, system will respond. Protocol field descriptions are
following:
 SF (Start Flag): It is used in all data packet at the beginning,
to indicate the start of some data to be sent. Based on
communication between different modules, the start of frame
can be of either type with unique address as listed table 1:
 Source/Destination Address: Based on the communication the
source/address can either \be a bus or stand. There will be
specific addresses fixed for bus and the stand. This is
necessary for the packets to reach the exact address, and the
destination should know from whom it’s receiving the data
packet. Table 2: Command field description
 Command Field: The command in the data packet of BAPT
determines the type of information being sent to either stand
or bus. The command information being sent from source to
destination can be of types table 2:

Figure 1: BAPT Protocol

Table 1: Start Flag field

 Bytes Field and Check Sum Field: Byte 1, byte 2 and byte 3,
which can be used if necessary in future enhancement of
BAPT. It is XOR of Command and its data bytes (If Command
has no data then checksum is not required).
 EF (End of Frame): This frame is used in the data packet of
BAPT to indicate the end of information being sent from any
source and destination. If the EF frame is not received by the
destination within thespecified time then the data packet will
be sent again by the source.
2) Packet information: In the system following messages are
using for communication:
i. Info Message:
a) Bus to Stand: Contains polling stand ID Bus ID
and seats vacant
b) Stand to Stand: Contains Destination stand ID Bus
ID and seats vacant
ii. Fail Message:
a) Bus to Bus: Contains failed Bus-ID and problem
ID
b) Bus to Stand: Contains polling stand ID, failed
Bus-ID and problem ID
c) Stand to Stand: Contains Destination stand ID,
failed Bus-ID, Nearest Stand ID and problem ID
iii. Maintenance/service message:
a) Stand to Stand: Contains new time predicted
estimation value
b) Bus to Stand: Add/remove any Bus/Stand ID
B. Hardware Implementation
The systems have three major parts: Bus module, Bus Stand
Module and Central station module. All modules contain one
89V51RD2 microcontroller. Bus module have switches panel
with specific problem ID, low cost 433.92/315 MHz RF
transmitter and receiver with 318 series of encoders and decoders,
tactical sensors switches for count number of seated persons in a
bus. In the bus stand module, SIM300 GPRS module use for
stand to stand communication, LCD for display, 433.92/315
MHz RF transmitter and receiver with 318 series of encoders. In
Central Bus station, apart from bus station requirements, only
RTC, EEPROM and server connectivity RS232 are used.
Bus Module: This module is mounted at each bus of the
transportation system with unique ID. Bus driver is provided
with switch panel, if any predefine problem (like tyre puncture,
fuel empty and engine failure etc) occurs in the bus then driver
can press the corresponding switch for help. In the failure case,
failure bus blinks alert signal and it starts broadcasting the id and
problem for help, once any bus that has same module, comes
nearitsrange it will receive the fail message and provide
acknowledge message immediately.

32
 Integrated Intelligent Research(IIR)
Figure 2: Bus Module Flow Diagram
After receiving the acknowledge message the fail bus will stop
blinking alert signal and move to the non-working state. Now
passing bus will store the fail message in its memory and when
any bus stand polls for buses, bus will send it is own information
and fail message also. Bus will wait for acknowledge from the
stand if acknowledge comes it will delete the message from the
memory else during next polling cycle it will send again as
shown in figure 2. Bus module receiver is used to receive polling
packets from stand and fail messages from bus. If polling packet
is received bus module, software reads the vacant seats
information, own id and sends both to the polling stand.
Figure 3: Bus Stand Module Flow Diagram
2) Bus Stand Module: Bus Stand Module consists of two parts:
Main Stand Module (MSM) and Bus Communication Controller
(BCC). MSM is main module which controls all the
communications in the network. It has direct interface with
buses, adjacent bus stands and users. It is equipped with display
which use for showing user the information of buses arrival time,
stops away, seats vacant, cancelled, delayed. It has separate
GPRS device to communicate with previous and next stand and
for getting information of buses near stand or arrived at stand it
uses specialized communication controller using UART link, it is
called bus communication controller (BCC) it scans all buses
near stand communicate with them get information from them
33
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.31-35
ISSN: 2278-2427
and sends all this information in a queue one by one to MSM.
Serially receiving bus arrival of failed bus info from the BCC,
updating bus status for display and pass info packet to next stand
using GPRS device as shown in figure 3. The principle is it sends
a polling/interrogation packet with a low range (150-200meters)
transmitter, and then waits for reply from the buses. If any bus is
in the range then it will send reply with bus-id and other
information like vacant seats. This reply is buffered in the
internal queue as multiple buses may send reply. Once buses
have replied, it starts transmitting the bus information serially to
MSM, which further processes the information, does display
management and pass info to next stand with its exclusive GPRS
packet switching Tx-Rx interface with next stand for updating
current bus information.
3) Central Station Module: This module is placed at central
station where most of the buses start and end. And here all the
messages from the various routes, various stands, and buses are
collected and stored in the server, this server will run special
software which will do statists analysis to find out the traffic
pattern and will update bus stands accordingly. For this task, it is
equipped with RF interface to receive messages from stands, and
RTC to keep track of time, max232 to interface to RS232 port of
the server and microcontroller for reading incoming packets from
the stands and then process it.
III OPERATION OF SYSTEM
IN THE SYSTEM, BUS ARRIVAL TIME ESTIMATION USING TRAFFIC
DENSITY MODELLING IN CCM SERVER, WHICH CAN ESTIMATED
TIMES FROM ONE STOP TO NEXT STOP ARE AUTOMATICALLY
UPDATED USING WIRELESS COMMUNICATION IN ALL THE BUS
STANDS AS SHOWN IN FIGURE 4.
All bus stands are connected to each other using GPRS wireless
communication network and all data including number of
passengers information of bus arrival at particular stop will
finally stored in central station for future statistical analysis like
change of route to avoid traffic congestions, adding of buses if
arrival frequency is too low, deletion of route if it is very slow
moving route. Based on this statistical data, central bus stand unit
can take decision on certain time line basis. Information of seats
vacant, filling, and getting emptied will be send to central station
and based on this data transport management can take an action
and buses will be order from bus depot if buses are running full
or extra buses can be remove from route if buses running empty.
Table 3: Bus Lookup Table
 Integrated Intelligent Research(IIR)
Bus Arrival Prediction system:- When BCC gets the information
of the Bus arrival and after updating bus status in their memory,
MSM propagate the bus information from current stop to next
stand MSM and this will go on and finally the bus info will reach
to central station’s CSM where it will be stored in server
database. As seen example of the system in table 3, bus takes 50
minutes to travel from stand1 to stand2 and so on. If packet is
reaching Stand6, contains the information that Bus1 is at stand2
then Stand6 will add up all times from its location to bus
stoppage location.
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.31-35
ISSN: 2278-2427
with specific reason ID will broadcast. Any ongoing bus which
will having same Tx & Rx module, will receive fault message
packet and this bus will update it to next bus stop with faulty
reason, bus number and bus stop ID where last time it detected.
Bus stand will connect to display of predicted bus arrival time for
user notification. Display management - After Bus stand get
information from Bus about its ID and seats it declares to the
users via display that respective bus has arrived and vacant seats
info is provided. And bus stand also passes this bus information
to next bus stand which on receiving this info inform users that
bus is one stop away and coming is some x1 minutes which is
predefined. Now this bus stand send info of same bus to next bus
stand on getting this info the bus stand displays bus is two stop
away and coming in x2 minutes in both the bus stand timers are
there and countdown goes on which keeps in decrementing
arrival times once it reaches zero in first stop bus status is
changed to arriving soon instead of coming in x minutes. But in
subsequent stops if countdown reaches to zero then bus info is
changed to bus is delayed as it has not reached to next stop itself
target stop is at least one stop after that, from previous stops info
is going to come once bus reaches to those stops. And if bus fail
message is reached to stand, bus stand will display bus is
cancelled. The designed system is first verified via sending
communication protocol packets among all modules as
communication example show in table 4

Figure 4: Bus Arrival Prediction Technology Table 4: Protocol communication example

Let suppose 40+70+60+80 = 250 minutes, and it will display the

Bus1 is four stops away and arriving in 250 mins (4hour
10mins). This lookup table is prefixed and stored prior to the
installation or at first boot up time. This traffic density model is a
statistical model which will be based on bus information data
stored at central station. This data will contain bus arrival time at
all stands in the given route so management can be found out
how much actual time bus is taking to travel using multiple bus
data on same route and refine the model at the end of every day
once the difference between mean travel time between the stands
and newly calculated travel times between the stand will be
greater than some threshold value then it will recommended to
update lookup table at all the stands of the given route. As it is
already known that Bus travel time between the stands, is mainly
dependent on the many traffic conditions.

Bus failure detection system- If bus fails in some route that time
driver will have provision to intimate to next bus stop with
failure reason. Failure bus will broadcast a help/information
packet with failure information and any ongoing bus will listen it
and convey to next bus stop for avoiding delay in help and alert
for passengers. Whenever bus will fail with some reason then bus
driver will press specific reason button and fault message packet
34
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.31-35
ISSN: 2278-2427
IV. SYSTEM EVALUTION AND RESULTS

All modules received messages successfully within time line.

Bus stand to adjacent bus stand communication verification done
with AT command request and response in GPRS module at both
the end. In the test bench (shown in figure 5) performed the first
testing and verification procedure. Bus failure detection system,
bus cancelled, delayed, arrival soon, bus number and seat vacant
in arrival bus information displayed successfully according to
current scenarios. Bus failure detected and informed via passing
bus to near bus station also successful.

Figure 5: System Test Bench

V. CONCLUSION

In this project, the result of the designed system with log cost RF
link and specialized protocol, has accomplished the target. The
proposed system provides the fleet an ability to take decisions
according to real-time information, in addition to historical data.
It ensures that the tracking process is within an accurate and
acceptable range, failure bus detection happened with failure
reason.

REFERENCES
[1] John Pucher and Nisha Korattyswaroopam “The Crisis of Public Transport
in India: Overwhelming Needs but Limited Resources” Rutgers University.

[2] Wei-Hua Lin and Robert L Bertini, “Modeling Schedule Recovery Processes
in Transit Operations for Bus Arrival Time Prediction” IEEE 5, 2002.

[3] Amer Shalaby, Ali Farhan, University of Toronto, Canada, “Bus Travel
Time Prediction Model for Dynamic Operations Control and Passenger
Information Systems” TRB 2003.

[4] Wei-Hua Lin and Jian Zeng, “A Experimental Study On Real time Bus
Arrival Time Prediction With GPS Data” Center for Transportation
Research and Department of Civil and Environmental Engineering.

[5] Bratislav Predic, Dejan Rancic and Aleksandar Milosavljevic “Impacts of

Applying Automated Vehicle Location Systems to Public Bus Transport
Management, May 2010.

[6] Ben Ammar Hatem and Hamam Habib, University of Moncton, NB,
Canada, “Bus Management System Using RFID In WSN” European and
Mediterranean Conference on Information Systems 2010.

[7] KV Natarajan, “GSM Based Bus location tracking and passenger density
detection system” IACSIT,2011.

35
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.36-42
ISSN: 2278-2427

Comparison of Propagation Models for Small Urban

Cells in GSM Network
Naima Bouzera1,Abdelkrime Kheirddine2
1
Geni electric laboratory, faculty of technology,University of Bejaia (06000), Algeria
2
Geni electric laboratory, faculty of technology,University of Bejaia (06000), Algeria
Email:bouzera307@hotmail.com,khier_2000@yahoo.fr

Abstract— It was summed up purpose of this work is to compare
the models of spread for the small urban cells in GSM, with
objective to test their behaviour. Engineering radio constitutes
one of the most important aspects during the deployment of a cell
network as much as it is responsible for the quality level of
service given to the subscribers. In environment to indoor, the
sign is subjected to different weakening that can attain 30 dB. In
effect, the spread in this middle depends on several
characteristics to know the architectural data of buildings, in
other words types of used building materials, the size of the
windows, etc. We are interested in this paper to introduce
different models of prediction of urban spread in environment.
After different comparisons, we concluded that the model of
COST-CNET is the most appropriate to make a prediction of
weakening for a local zone with strong concentration.
Keywords—prediction, propagation model, propagation
measurements, radio propagation, urban area
models are the least accurate but require the least information
about the environment and use much less processing power to
generate predictions. Empirical models can be split into two
subcategories namely, time dispersive and non-time dispersive
[2,5].
II. CELL CONCEPT
A cell network divides the zone to be covered, in general a whole
country, in small zones called cells. Each of the cells is served by
a basic station (BS: Base Station) which accepts a party of
available frequencies.It is with these basic stations that
communicate all active mobile phones being in the concerned
cell. Since two communications radio using the same frequency
interfere the one with other one when they are between both
transmitters, what puts in an obvious place that the same
frequencies cannot be used by two neighbouring basic stations.
Two cells using the same frequencies

I. INTRODUCTION

In wireless communication the losses occurred in between

transmitter and receiver is known as propagation path loss. Path
loss is the unwanted reduction in power single which is
transmitted. We measure this path loss in different area like rural,
urban, and suburban with the help of propagation path loss Cluster of 7 frequencies
models. Wireless communications provide high-speed high-
quality information exchange between portable devices located Figure1. Theoretical example of cellular coverage
anywhere in the world. These models can be broadly categorized
into three types; empirical, deterministic and stochastic. III. MECHANISMS OF SPREAD
Empirical models are those based on observations and
measurements alone. These models are mainly used to predict the The mechanisms of radio-mobile spread in circles Indoor are
path loss, but models that predict rain-fade and multipath have principally linked to cogitation, transmission, and diffraction,
also been proposed [3]. The deterministic models make use of broadcasting and basic structure of scenario. All these
the laws governing electromagnetic wave propagation to phenomena are at the origin of the distorsion and at the
determine the received signal power at a particular location. alleviation of the sign. For any receivers, displacements with
Deterministic models often require a complete 3-D map of the small ladders generate at the level of the potency accepted from
propagation environment. An example of a deterministic model fluctuations since this last is the result of several elements caused
is a ray tracing model [4]. Stochastic models, on the other hand, by the various mechanisms of spread [1].
model the environment as a series of random variables. These
36
 Integrated Intelligent Research(IIR)
IV. SPREAD RADIO
The radio electrical wave is subject to numerous changeability
of temperature, to humidity, electromagnetic characteristics, etc.
In other words of in fluctuations at time and in space. With this
effect, we have the most persistent three phenomena in spread
radio as an environment Indoor: cogitation, diffraction and
broadcasting. It is to maintain at this stadium that the mass media
of communication is uncontrollable. In effect, three types of
variations of the radio-mobile channel come to light. In a first
place, they find variations on a large scale or weakening of
courses (Pathloss) which are losses of spread owed to the
distance gone through by the wave radio. Then, they differentiate
the effect of mask (Shadowing effect) which comes as being
alleviations of potency of the sign owed to meet obstacles. The
last type of variation of the channel mobile radio is linked to
numerous itineraries.
In what follows, we introduce different models of prediction of
spread in middle indoor but we remind of spread in free space
before.
V. THE SPREAD IN FREE SPACE
Spread in free space is a theoretical case which, in practice, is
only seldom proved. In effect, it is cases where no obstacle is
present between the transmitter and the receiver, they speak then
about direct visibility which is determined from the
ellipsoidsofFresnel. The equation of the weakening in free space
is given by following expression [4]:
L  32.4 + 20 log (f) + 20 log(d)
Withf:thefrequencyexpressedinMhz d: distance between the
transmitter and the receiver, expressedinKm. The principle of the
models of spread is to calculate alleviation in free space and add
it a corrective factor. We are interested in what follows in
different models of spread but we limit ourselves to those of
circles indoor as much as our interest aims at environments
inside.
VI. MODELS OF SPREAD
37
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.36-42
ISSN: 2278-2427
Engineering radio constitutes one of the most important aspects
of the deployment of a cell network in quality of service given to
the subscribers.In urban environment, the sign is subjected to
different weakening. In effect, the spread in this middle depends
on several characteristics: the height of LOW VOLTAGES
(foundation transmitter station), their sites, the height of
buildings, the breadth of streets etc. The radioelectrical wave is
subjected of it made to numerous distortions caused by physical
obstacles (building, transports, tree). In the field of
radiocommunications, there are several models of spreads which
can be used for the dimensionnement of the radioelectrical
coverage. We are interested in this chapter to introduce different
models of prediction of spread in urban environment; where we
shall itemize the model of course more. Comprehension and
installation of a mobile network such as GSM network require a
definite characterization of the radio-mobile channel, In effect,
the modelling of the channel radio can be assured by
mathematical models which allow to predict the variation of the
level of accepted sign. These models are also used to help us to
determine the optimum positions of antennae and in the analysis
of the quality of service. So, we can differentiate three big
families:The empirical models (called still model statistical)
which are based on analyses statistics a big number of
experimental measurements and that take into account different
parameters such as the height of buildings, basic stations, the
terminal while taking into consideration various influence of
environment.
-The determinist models which are based on the fundamental
laws of physics, and call complex mathematical relations which
(II.1)
are difficult to use.
-Models semi determinists which combine both approaches. Au
cours de ce papier, nous allons étudier les différents modèles déjà
existants, pour la prédiction en milieu urbain.In the course of this
paper, we are going to study the different already existent
models, for prediction in urban middle. Of such models rest on
the collection of a number mattering enough from data. After a
statistical analysis of these data they extrapolate equations giving
an average pathloss at a given distance. Equations which are
deducted include there in general less dozen parameters. They
are therefore easy to implement and express in implementer in a
program. Their main advantage is that we not need a presentation
specifies of the zone to be covered. [4]
VII. OKUMURA-HATA model [6]
It is the most used empirical model, it acts as foundation in a big
variety of more refined models, he is based on measurements
made by Okumura in Tokyo. The model of Hata was spread in
2GHz to allow planning radio of networks DCS on 1800.
Medium losses are expressed according to: - the height of the
antenna of program (basic station) hsb (there m);
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.36-42
ISSN: 2278-2427
- the height of the antenna of reception motive) h m (there m);-
Distance D between the basic station and the motive - frequency
in MHz. The domain of validity is given as follows: And :

30m hsb 200m

1m hm 10m
1km D 20km Where:
1500MHz f 2000MHz D:distanceinKm.
The weakening is given by following expression: f: frequency in MHz.
d: distance between buildings in (m).
1. In urbain area : hb: the medium height of buildings in (m).
Lu = 46.3 + 33.9 Log (f) – 13.82 Log (hsb) – a (h m) + (44.9 – hsb: the height of the basic station.
6.55 Log (hsb) Log (d) + Cm hm: height of the motive in (m).
A factor of correction is used to take into account the height of This model is applicable to urban areas and suburban. It assumes
the antenna of mobile reception and the environment in which it that the antenna heights of base stations are quite high and
is: a (hm) = (1.1 Log (f) – 0.7) h m – (1.56 Log (f) – 0.8 for a surrounded by rows of buildings of similar height and
city of medium size regularlyspaced apart by a distance d. In other words, it assumes
that streets are perpendicular to the incident rays.
a (hm) = 3.2 (log1.54 h m) 4.97 for a big city (f
>400 MHz) IX. IKEGAMI model[1]

0 dB for the cities of medium size It is based on the theory of geometric perspective, where they
Cm= consider the spread of the wave restricted in two rays. He
3 dB for the big cities assumes moreover, an ideal structure of a city with an uniform
2. Suburbain area : height of buildings. It is expressed by following relation:
Lsu = Lu 2
Aff = Aff0 + Aff1
3. Rural area : With:
Lr = Lu 4.78 (Log f) ² 18.33 Log f 40.94 Aff0: free-space loss given previously (model of BERTONI-
WALFISCH).
VIII. BERTONI-WALFISCH model [1] Aff1: weakening of reflection, diffraction, it is given by:

The model of BERTONI-WALFISCH takes into account

positionings of buildings l 'influence on a communication mobile
radio. He assumes that spread is made in most cases by
diffraction at the top of buildings being in the neighbourhood of
the mobile receiver. It considers that attenuation of course am
composed of three parties:
•Attenuation between two antennae in free space.
• Attenuation sudden by the field at the top of building, who is
owed to the losses of diffraction across a series of rows building.
• The losses of diffraction at the top of building neighbour of the
motive.
The total attenuation is expressed as follows:
Aff = Aff0 +Aff1
With: Aff0: is the attenuation in free space given by relation
With: φ: orientation of the street in comparison with the
incidental ray (in degree)
hb: medium height of buildings.
L: the coefficient of cogitation of buildings is. Ikegami assumes
that buildings introduce weakening of 6dB.
X. SAKAGAMI-KUBOI model [3]
This analysis is based on measurements performed in the Japan
in urban circles. These measurements are analysed by the
procedure of numerous declines to find the influence of
parameters characterizing urban middle on the weakening of
spread, such

Aff0 = 32.4 + 20 log (f) + 20 log (D) Aff  100 - 7,1 Log (w)  0.023   1,4 Log (hmt)  6,1log(hb)  20 Log (f)
Aff1: correction term which takes into account the curvature of
13 f 3.23  2
hst 
  24.37  3.7  logdh   43.42  3.1logdh logD
the earth and the urban environment.
e
 hsb 
38
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.36-42
ISSN: 2278-2427
Where : hsb : height of the basic station..
hb : the medium height of buildings. Ka=
hm : height of the motive.
D : distance between the motive and the basic station.
hst : the height of the building in quoted by the basic
station The first two terms represent losses caused according to the
hmt : height of building along the road. height of the basic station to be known: Ka represents the
W : breadth of roads. increase of weakening when the antenna of the basic station is
located under the niveaudes roofs of the adjacent buildings.Both
terms K d and Kf control the dependency of weakening owed to
With : dh = hsb - hm w = 5- 50 m.
numerous diffraction in function respectively of distance and
hmt = 5-80 m dh = 20- 100 m. frequency.
h st < hsb D = 0.5 -5 Km. .

XI. Model of COST-CNET : [1]

The method of counting of the weakening comes from jobs of

WALFISH and BERTONI on numerous diffraction by lined up
bones and uniformly divided and on those of the IKEGAMI for
  hsb - h b 
the taking into account of the last diffraction at the level of the 18  15   if h s b  h b
motive. Acquired complete losses decompose into four terms Kd    hb 
main representatives successively: 18 if hs b  h b

• losses linked to distance between the transmitter and the
3. Osses from the last scattering and reflection on buildings
receiver.
and behind the mobile (Aff rts)
• losses linked to numerous diffraction on bones.
• losses linked to the last diffraction and to cogitation
Aff rts  -16.9 - 10 log (w)  10 log (f)  20 log (hb - hm)  A
respectively on buildings and behind the motive.
• losses linked to diffraction on a main bone. With :
 -100354 for 0    35
The total attenuation is modeled by the following formula: 
A  250075( - 35) for5    55
Aff  Aff0  Aff msd  Aff rts  Aff deg 40114( - 35)  for55    90


1. Losses linked to distance between the transmitter and Where : w : the breadth of the street
the receiver (Aff0): f : frequency
It is an alleviation owed to spread in free space between the φ : the orientation of the street from the radius.
broadcasting antenna and the motive spaced out by a
distance D. (weakening in free space given before (model of 4. losses due to diffraction of the main stops(Affdeg):
BERTONI-WALFISCH).  h'
0 if 0.5
2. losses linked to numerous diffraction on bones (Aff msd) : r

The counting of this alleviation is based on the method of 612 h'  if
h'
0.5   0.5
 r
BERTONI and WALFISH reviewed by COST-231 [7]:  r
Affdeg  
88  ' 
 h
if
h'
0.5  1
Affbsh =  r r

1620 h'  if 1
h'
 r r

With : h : the height of clearing of the ellipsoid of Fresnel

Aff  Aff  ka  k logD   K logf   9log d  r : the ray of the ellipsoid of Fresnel..
msd bsh d f
These losses augment proportionately with distance between the
basic station and the mobile receiver, and height of buildings.

39
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.36-42
ISSN: 2278-2427
With the intention of making a comparison of the different
XII. RESULTS AND SIMULATIONS models studied in the previous chapter, we are going to take
consideration the parameters of town planning there. So we Shall
To implement the models of prediction of spread chosen, our Compare the models which take count of these parameters to be
approach consists in assuming data which characterize the zone known: Bertoni-Walfish, Ikegami, Sakagami and Cost-Cnet.
nearly to study, to know the height of buildings, the breadth However the model of Hata does not take into account it there,
averages of streets and medium distance which separates two but he can be to apply to the babies or in the big cities, which we
adjacent buildings are going to use as mailman of comparisonconcerningthismodel.
For the work we performed, we will use the following data
Comparison of propagation models according to our prediction:
Table.1 parameter values used in the simulation
Frequency of program f=1880Mhz
Height of antenna of program hub=30 m
Height of antenna of reception hm=2m
Distance between the transmitter and receiver D=3 à 5 km
medium Breadth of streets w=10m
medium Height of buildings hb=15 m
Height of building along the street hmt=20 m
Height of building quoted of the basic station hst=15m
medium Spacing out of buildings d= 12m
Height antenna basic station of the motive h=28.5 m
Coefficient of cogitation L=6 dB
Orientation of the street in comparison with l 'axe principal of the beam Φ=55°

We are going to start the first simulation by the simplest model, such as the orientation of streets, the height of buildings and
that of HATA . spacing out between buildings.
 Comparison without taking into account factors of town
planning 1. Influence of the orientation of streets
165
For this first comparison interest us to us to the first mailman
who is the orientation of streets in comparison with the incidental
160
wave coming from the basic station. Three models take into
155 account this mailman to know COST-CNET, SAKAGAM and
affaiblissement en dB

IKEGAMI.
150

160

145
150

140 140
moyennes villes
grandes villes
affaiblissement en dB

130
135
0 50 100 150 200 250 300 350 400 450
distance(x 0.01 Km)
120

Comparison between the small and big cities in the model of 110

Hata Figure3. Model of OKUMURA HASTENED, (level of 100 20°

55°

variation of the weakening according to distance MS-BTS) 90

75°
100°

0 50 100 150 200 250 300 350 400 450 500

distance(x 0.01 Km)

Comparison by taking into account factors of town planning Figure4.Influence orientation of the street in the model
The models of Bertoni-Walfish, Ikegami, Sakagami and Cost- IKEGAMI
Cnet take into account certain characteristics of the studied city

40
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.36-42
ISSN: 2278-2427
180
Figure8. Influence of distance between buildings in the model
160
BERTONI-Walfish
140

2. Influence of distance between buildings

affaiblissement en dB

120

The second mailman to be taken into account is distance

100
between buildings. It is considered in two models, that of
80
20°
55°
BERTONI-WALFISH and COST-CNET.
75°
60 100°
200 d=10m
d=50m
40 d=100m
0 50 100 150 200 250 300 350 400 450 500 d=200m
distance(x 0.01 Km) 180

Figure5.Influence orientation of the street in the model

affaiblissement en dB
160

SAKAGAMI 140
220

120
200

100
180
affaiblissement en dB

80
0 50 100 150 200 250 300
160
distance(x 0.01 Km)

140

120 20°
55°
75°
150°
Figure9. Influence of distance between buildings in the model
100
0 50 100 150 200 250 300 350 400 450 500
distance(x 0.01 Km)
COST- CNET
Figure6. Influence orientation of the street in the model COST-
3. Influence of the height of roofs
CNET.
The third mailman in considered is the height of buildings, It is
220 introduced into two models which are: COST-CNET and
200 IKEGAMI.
180 240
hb=30m
220
160
hb=15m
affaiblissement en dB

200
affaiblissement en dB

140
180

120 160 hb=30m

140
100 hb=15m
120
80
IKEGAMI
IKEGAMI 100
COST-CNET COST CNET
60
SAKAGAMI 80
0 50 100 150 200 250 300
distance(x 0.01 Km)
40
0 50 100 150 200 250 300 350 400 450 500
distance(x 0.01 Km)

Figure7. Comparison between models SAKAGAMI, IKEGAMI Figure10. Influence of height of buildings in the models of
et COST-CNET(Φ=55°) COST-CNET and IKEGAMI
XIII. CONCLUSION
140
d=10m
120 These results allowed us to assess the models of prediction of the
d=50m
d=100m
studied weakening, which we can divide into two categories,
100
d=200m those who take into account parameters of town planning; And
affaiblissement en dB

80 those who do not take into account it.This last category is not
very dependable owing to the lack of data characterizing
60
environment. On the contrary the first one, due to a better
40 description of the middle of spread across different parameters
introduced into each of the models, gives a better estimate of the
20
weakening. After different comparisons we concluded that the
0 model of COST-CNET is the most appropriate to make a
0 50 100 150 200 250 300
distance(x 0.01 Km) prediction of weakening for a local area with strong
concentration, since it gives A more definite estimate than other

41
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.36-42
ISSN: 2278-2427
models studied in this job, It characterizes at best the
environment of spread.

REFERENCES

[1] R.Charle House, Electronique appliquée : les antennes fondamentaux, 3éme

édition, Dunod, Paris, 2006.
[2] H.R.Anderson,Fixed Broadband Wireless System Design.John Wiley &
co.2003
[3] R.K.Crane ˝Prediction of attenuation by rain,˝ IEEE Transactions on
communications,vol.COM-28,pp.1727-1732,seotember 1980
[4].E.Athanasiadou,A.R.Nix,and, L.P.MeGeehan,˝A Microcellular raytracing
propagation model and evaluation of its narrowband and wideband predictions,˝
IEEE journal on selected areas in comm..,wireless comm., series,vol.18 pp.322-
355,march 2000
[5] Purnima K Sharma, R.K.Singh, ―Comparative Analysis of Propagation Path
Loss Models With Field Measured Data‖ IJEST, Vol.2(6)in 2010 at 2008-2013.
[6] M. Hata, ―Empirical formula for propagation loss in land mobile radio
services,‖ IEEE Trans. Vehic. Technol., Vol VT-29, No. 3, pp.
317–325, Aug. 1980.
[7] COST Action 231, ―Digital mobile radio towards future generation systems,
final report,‖ tech. rep., European Communities, EUR18957, 1999.

42
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.43-45
ISSN: 2278-2427

Multiuser Interface Optical Code Division

Multiple Access System
Shweta Patel1, Mukesh Tiwari 2, Jaikaran Singh 3
Department of Electronics and Communication
Sri Satya Sai Institute of Science and Technology, Sehore M .P. India
Shwetadpatel@gmail.com,mukeshtiari_79@yahoo.co.in,jksingh81@yahoo.co.in

Abstract— CDMA and FIBER OPTICS individually are the
best technologies in their respective zones. We all know that
CDMA (multiple access technology) is the best as compared to
TDMA & FDMA & similar is the case with FIBER OPTICS
also. Fiber optic technology is best compare to all other
communication technologies. In this Paper, the comparative
analysis of a fibre optics CDMA system using Matlab
simulation. By varying numerous parameters of the systems,
we compare the systems in terms of BER. As the number of
active users increases the BER increases.
Keywords— CDMA, BER, FIBER OPTICS
I. INTRODUCTION
II. SYSTEM DESCRIPTION
The broadband signal from the light source is ON-OFF keying
(OOK) modulated through the binary data. The transmitter
sends a pulse through spectral distribution changing with time
if the data bit rate is “1”; otherwise no power is transmitted.
The encoder is a fast TOF controlled with an electrical signal
that signifies the Functional code. Signals transmitted from all
synchronized users will be mixed up in the network before
received by all users.At the receiver, the composite signal is
decoded by a matched TOF. Then, the signals go through a
photo detector, an integrator and a threshold decision to
recuperate the data transmitted.

FO-CDMA or OCDMA systems are offer keys to multiple

access in all optical communication networks. OCDMA
systems make available for users with high security by coding
the data before transmission and recover the data at the
receiver using this coding. Initially, OCDMA systems coded
the incoherent pulses in the time domain and recovered the
Fig 1: Block Diagram of Optical CDMA system
data using taped delay lines. Then OCDMA system
performance is reduced because of the correlation properties of
The Signal to Noise ratio is :-
the special unipolar codes used.In these system use the optical
summation that causes significant losses. CONSTANTLY-
INCREASING demand for higher data-rates and data security SNR (K) =
has moved great interest in optical code-division multiple
access (OCDMA) technology. here we can try to focus on
increased the BER(Bit Error Rate) and reduces the The Probability of Error is thus
MUI(Multiuser Interference) and PIIN(Phase Induced
Intensity Noise). BER(K) = erfc ( )
The performance of OCDMA systems is mainly affected by
interference from other simultaneous users called Multiuser III. PROPOSED SYSTEM
Interference (MUI) or Multiple Access Interference(MAI).MUI
can be negated by using code sequences with fixed in-phase The broad band signal from the light source is ON-OFF keying
cross correlation. Spectral Amplitude Coded-OCDMA (SAC- (OOK) controlled through the binary data. The transmitter
OCDMA) systems have presented extra attention because delivered a pulse with spectral distribution varying with time if
spectral coding can be completely eliminated the MUI. the data bit value is “1”; otherwise, no power is transmitted. So
Another way to reduce the MUI, used Code sequences with the electronic data are changed to broadband optical pulses.
fixed in phase cross correlation such as Hadamard Codes.Then Then, these optical pulses are sends to the two sets of FBGs
the rate of the in phase cross correlation between code and the splitter used for encoding.The spectral coding and the
sequences is large, the phase induced intensity noise (PIIN) spatial encoding are done by using the two sets of FBGs and
caused by non-Coherent broadband light sources of the SAC- splitters, respectively. When the optical pulse is entered into
OCDMA systems, which is decreases the system performance.
43
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.43-45
ISSN: 2278-2427
FBG1, the spectral components matched to “1s” of the spectral
code sequence are returned back and the remaining are filtered
out. However, the matched spectral components are returned
by different gratings. Once spectral encoding done, then the
optical pulses are delivered to the splitter for spatial encoding.
The splitter similarly splits each optical pulse and passed these
split portions to the star couplers according to the spatial code
sequence. The encoder is a fast TOF modulated with an
electrical signal that signifies the functional code. The spectral
and spatial codes are modulated through the Functional codes
by Optical Multiplier. Signals transmitted from every Fig 4:Normalised System
synchronized users will be mixed up in the network before
received through all users. The composite signal is decrypted
through a matched TOF at the receiver. In each balanced
etector have two groups of FBGs and two p-i-n photodiodes.

Fig 2: Block Diagram of Proposed Optical CDMA

system The BER of the proposed system can well be
Fig 5: Proposed System
approximated as
BER= (0.5 erfc (iSNR(k)/2)).(0.5 erfc(iSNR/8))

IV.SIMULATION TOOLS

MATLAB is used as a simulation tools.

V.SIMULATION RESULTS

Parameters Used For Calculation PD quantum efficiency =0.6,

Spectral width of broadband light source= Δλ=30nm, Electrical
Bandwidth=320 MHz, Receiver load resistor= RL=1030 Ω,k1= Fig 6: Proposed System
5,k2=.6,number of active users=1000.
VI.CONCLUSIONS

In this paper, we can conclude from the simulation results

that in the first system transmission the bit error rate first
decreases and than it remains constant for further
users .And for the proposed system the bit error rate is
almost zero for the first 900 users than it starts increasing .
In addition, DOCDMA and Proposed optical CDMA
systems are tested under different effective power from each
user, and it is shown that the system with Proposed scheme
still has a much better performance than the first one
scheme.

REFERENCES
[1] Pooja Yadav, Ravindra Prakash Gupta “WEIGHTED CODE
Fig 3:Normalised System
TRANSMISSION IN OPTICAL CMDA “ International Journal of
Soft Computing and Engineering (IJSCE) ISSN: 2231-2307,
Volume-2, Issue-1, March 2012.

44
Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.43-45
ISSN: 2278-2427
[2] István Frigyes, Senior Member, IEEE Budapest University of
Technology and Economics, Budapest, Hungary “CDMA IN
OPTICS” 2006 IEEE Ninth International Symposium on Spread
Spectrum Techniques and Applications.
[3] Chao-Chin Yang and Jen-Fa Huang “Two-Dimensional M-Matrices
Coding in Spatial/Frequency Optical CDMA Networks”, Ieee
Photonics Technology Letters, Vol. 15, No. 1, January 2003.
[4] TAWFIG Eltaifa*, HOSSAM M. H. Shalabyb, SAHBUDIN Shaaria,
MOHAMMAD M. N.H Amarshehc “Interference Mitigation Using
Successive Interference Cancellation in Optical CDMA Systems”
Proceedings of the 8th WSEAS
InternationalConferenceonMicroelectronics, Nanoelectronics,
Optoelectronics
[5] “Principles of Communication Systems Simulation with Wireless
Applications” by William H. Tranter, K. Sam Shanmugan , Theodore
S Rappaport, Kurt L. Kosbar.

45
Integrated Intelligent Research(IIR)
Wireless Information Security System Via Role
Based Access Control Pattern Use Case Design
K.Subramanian1, V.Kanhaa2,
1
Faculty , Indian Business Academy , Bangalore,
2
Head, Depr of IT ,Bharath University , Chennai
Email: onsubbu@gmail.com, drvkannan62@yahoo.com
Abstract- Business delivery value added more via security
services to the service providers and service users. Organization
system developing various models to achieve the security system
according to the modern development and technology; which
they requires for their own operations and for their interactions
within departments, customers and partners. Business securities
pattern will be aid to establish a powerful methodology to
identify and understand these relationships to maximize the value
of security system. This paper presents a study of important
business patterns in Roles Right Definition Model Use Cases
linking to Object oriented Analysis and Design approach for
Secured Internet Information access.
Keywords: Internet Information Security, RBAC Pattern, Use
case Model
I. INTRODUCTION
In Modern communication system, all applications are being
accessed through wireless systems which includes commerce,
medical, manufacturing, and others. Wireless devices have
become an extension of corporate databases and individuals.
Their security compromises are as serious as any attack to the
corporate database and may have damaging effects on the
privacy of individuals and the protection of assets of an
enterprise. Wireless devices include cellular phones, two-way
radios, PDAs, laptop computers and similar. These are normally
portable devices with limitations of weight, size, memory, and
power. The increase in functions in cellular devices creates new
possibilities for attacks in the service system. Standard attacks
against the Internet may now take new forms. Lists of
vulnerabilities are already available, showing flaws in many
existing products. Communicating in the wireless environment
has its own issues and challenges. It is characterized by relatively
low bandwidth and data rates, as well as higher error rates, and
the need for low power consumption (for mobile devices). The
mobility of the nodes in cases such as ad hoc networks adds
another significant layer of complexity and unpredictability.
II. COMMUNICATION SYSTEM SECURITY
The security of communication systems can be divided into four
sections:
Security of the application: This means the security of user
applications and standard applications such as email.
46
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.46-48
ISSN: 2278-2427
Security of the devices: “How to protect the physical device in
case it is lost or stolen.”
Security of the Wireless Technology: “How to protect messages
in transit. “
Security of the server that connects to the Internet or other wired
network. After this server the information goes to a network with
the usual security problems of a wired network.
III. WIRELESS APPLICATION ON WEB
There are two common approaches for user applications in
wireless devices: WAP (Wireless Application Protocol), and
applications based on the two standard component approaches,
J2ME and .NET. The latter include standard object-oriented
applications or applications using web services. Middleware
software supports wireless applications at both the client and
server sides. Devices using Bluetooth can use Java or.NET.
3. 1 Wireless Application Protocol (WAP)
WAP is a thin-client (micro browser) development protocol,
specifically designed for development of user applications. WAP
uses WML (Wireless Markup Language) and WML Script to
develop applications that can be interpreted at the browser and
accessed at the server using HTTP. WAP requires a gateway to
the wired Internet, and cannot store and process data locally.
WAP uses WTLS (Wireless Transport Layer Security). This
protocol provides confidentiality, integrity, and authentication
and uses RSA cryptography, but can also use Elliptic Curve
Cryptography. It is based on the IETF SSL/TLS protocols.
WTLS provides security for communications between the WAP
wireless device and the WAP gateway (discussed later). Current
WAP devices use Class 2 WTLS, which enforces server-side
authentication using public key certificates similar to the
SSL/TLS protocol. Future Class 3 devices will also allow
client–side authentication using certificates. This level will use a
WAP Identity Module (WIM), with mandatory support for RSA
public keys and optional support for elliptic curve cryptography.
3.2 Web services
Web service is a component or set of functions accessible
through the web that can be incorporated into an application.
Web services expose an XML interface, can be registered and
located through a registry; communicate using XML messages
using standard web protocols, and support loosely coupled
connections between systems. Web services represent the latest
approach to distribution and are considered an important
Integrated Intelligent Research(IIR)
technology for business integration and collaboration.Wireless
devices can access web services using SOAP (Simple Object
Access Protocol). Web services are still not widely used in
portable devices. The limited processing power of portable
devices and the lack of network reliability is a serious obstacle
for a full implementation. There are several toolkits that simplify
the process of building applications using web services. For
example, Java-based client systems can use Sun ONE and
kSOAP . While server-side systems can be built with Sun or
IBM toolkits. There are similar tools for. NET-based systems. In
addition to the specific designs used, security also depends on
the security of these component platforms [Fer04a].It is
important to develop systems where security has been considered
at all stages of design, which not only satisfy their functional
specifications but also satisfy security requirements. To do this
we need to start with high- level models that represent the
security policies of the institution.
IV. USE CASE FOR WIRELESS APPLICATION
DESIGN
The following models are used to design the use cases in general
for business application development
a) Access matrix
b) Role-Based Access Control (RBAC) model,
4.1 Access Matrix Model
These models define security constraints at the highest
architectural level for the applications, which are enforced by the
lower levels. These models have been extensively studied by the
security community and we do not attempt here to add new
the accepted models as object-oriented patterns that can be used
as guidelines in the construction of secure systems. There are
other security models, based on other policies or combinations of
policies. Two important models are the Clark-Wilson model and
the Chinese Wall model .There is a pattern for the Clark-Wilson
model, but none for the Chinese Wall model. When we have a
question of “How do we describe who is authorized to access
specific resources in a system?”, then we wish to solve these by
two methodologies where Role – Based Access Control plays an
important part in it. How to assign rights to users according to
their roles in an institution? Permissions for subjects accessing
protected objects have to be described in a suitable way. A
central authority should be responsible for granting the
authorizations. Furthermore, a convenient administration of the
authorizations should be guaranteed for a large number of
subjects and objects. The principle of least privilege should be
supported. The suggestions are People in institutions have
different needs for access to information, according to their
functions.
i.We must help the institution to define precise access rights for
its members according to a need-to-know policy.
ii.Granting rights to individual users would require storing many
authorization rules and it would also be hard for
administrators to keep track of these rules.
iii.Users may have more than one role and we may want to
enforce policies such as separation of duty, where a user
cannot be in two specific roles in the same session.
47
International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.46-48
ISSN: 2278-2427
iv.We may need to have hierarchies of roles, with inheritance of
rights.
v.A role may be assigned to individual users or to groups of
users.
4.2 Role-Based Access Control (RBAC) pattern use case
design
This model developed based on the current role and
responsibilities of the users. Classes User and Role described in
the registered users and the predefined roles are described here
respectively. Users are assigned to roles; roles are given rights
according to their functions. The association class Right defines
the access types that a user within a role is authorized to apply to
the protection object. In fact, the combination Role, Protection
Object, and Right is an instance of the Authorization pattern.
Roles may correspond to job titles, e.g., manager, secretary. A
finer approach is to make them correspond to tasks, e.g., a
professor has the roles of thesis advisor, teacher, committee
member, researcher, etc. There are many possible ways to
implement roles in a software system. considers the
implementation of the data structures needed to apply an RBAC
model. The model also includes a constraint to enforce a
separation of duties. The administrator has the right to assign
roles to groups and users; he is a special user who can assign
users to roles and rights to a role. Rights for security
administration usually include:
i. Definition of authorization rules for roles.
ii. Creation/deletion of user groups.
iii. Assignment of users to roles.
Our pattern represents in object-oriented form a model described
in set terms in [San96]. That model has been the basis of most
research papers and implementations of this idea . RBAC is
implemented in a variety of commercial systems, including
Sun’s J2EE, Microsoft’s Windows 2000, IBM’s Web Sphere,
and Oracle, among others. The basic security facilities of Java’s
JDK 1.2 have been shown to be able to support a rich variety of
RBAC policies. When a problem arises in deciding access in an
environment with security classifications, the following factors
should be noted down while solving it.
i. The model should protect the confidentiality and integrity of
data based on its sensitivity.
ii. The model should be able to be used at any architectural
level.
iii. There could be different sets of rules to decide access.
iv. There must be a convenient way to assign users and data to
classification levels.
The Role-Based Access Control model is used now in many
systems. However, the different component frameworks (.NET,
J2EE) provide support only to define roles and to write
authorization rules, they don’t say anything about where the
rights come from. It is not easy for system designers or for
administrators to define the needed roles and their corresponding
rights.
 Integrated Intelligent Research(IIR) International Journal of Communication and Networking System
Volume: 01 Issue: 01 June 2012,Pages No.46-48
ISSN: 2278-2427
[10]IBM Corp., AlphaWorks Web Services Toolkit.
V. APPROACH FOR PROPOSED ROLE-BASED
ACCESS CONTROL (RBAC) PATTERN USE
CASE DESIGN

The proposed model highlights with following factors while

determining the role bases and use cases
i. Roles correspond to functional tasks in an institution and we
need to assign to these tasks enough rights to perform their
work.
ii. Rights should be assigned according to the need-to-know
(least privilege) principle, where each role gets only the
rights needed to perform her duties.
iii. New roles appear and some roles may not be needed
anymore; changes to roles and their rights should be easy to
perform.
iv. When Use cases are defined we follow these steps. Define
the use cases of the system. The design of object-oriented
systems always start this way but even systems which use
other methodologies often define use cases as part of the
requirements stage. As use cases define the interactions of
actors with the system, we can interpret actors as roles. The
roles that appear in a use case must be authorized for all the
operations initiated by the role or the role could not perform
its functions. If we collect all the operations performed by a
role over all use cases, they define the necessary rights for
this role. To make this approach more detailed and
systematic, we should build a use case diagram that displays
all the use cases for the system and sequence diagrams that
show the interactions of roles with the system for each use
case.

VI. CONCLUSION

RBAC pattern identifies the rights of the user according to the

user requirements and it only grants people who are having
access privilege rights, etc to access internet Information.. This
model defines the security system, using classes such as User,
Role, and accessibility. This proposed pattern complements by
providing a way to define the specific rights needed in a
particular system.

REFERENCES
[1] W. Arbaugh, “Wireless security is different”, Computer, IEEE, August 2003,
99- 102.
[2] P. Ashley, H. Hinton, and M. Vandenwauver, “Wired versus wireless
security: The Internet, WAP, and iMode for e-commerce”, Procs. 17th Ann.
Comp. Sec. Applications Conference, 2001.
[3] Aventail, “Practical solutions for securing your wireless network”, White
paper,2004.
[4] B. Chee and O. Rist, “The Wi-Fi security challenge”, InfoWorld, May 17,
2004.
[5] J. Cox, “Vendors offer tools to control, secure WLANs”, Network World,
6/7/04,
[6] http://www.dtic.mil/whs/directives/corres/html/81002.htm
[7] [Fer04a] E. B. Fernandez, M. Thomsen, and M.H. Fernandez, "Comparing
the security architectures of Sun ONE and Microsoft .NET"., in
“Information security policies and actions in modern integrated systems”,
book by C. Bellettini and M.G.Fugini (Eds.),2004.
[8] E.B.Fernandez, “A methodology for secure software design”, Procs. of the
2004
[9] The GSM security technical whitepaper for 2002”,
48