Professional Documents
Culture Documents
ABSTRACT
A Temporal Information System, that incorporates temporal information into the
traditional Information System of Rough Set Theory (RST) and Variable Precision
Rough Sets (VPRS), is presented. Mobile Ad hoc Networks (MANETs)
dynamically form a network without an existing infrastructure. The Dynamic
Source Routing (DSR) protocol of MANETs is modified in this paper to use recent
routes. Weighted elementary sets are introduced in temporal information systems
and used to route packets in mobile ad hoc networks. Notions from VPRS are also
brought into weighted temporal information systems and used in routing. The
performance of these proposed routing protocols is studied.
1.3 Routing in Mobile Ad Hoc Networks This paper presents a Temporal Information
System that brings temporal information into the
Sending data from a source mobile node to traditional Information System of Rough Set Theory
a destination mobile node through a route (or and Variable Precision Rough Sets. The DSR
sequence of intermediate mobile nodes) is routing. protocol is modified to study the use of recent routes.
Routing is one of the most difficult issues in mobile The paper then introduces the notion of weighted
ad hoc networks. Each node in an ad hoc network is elementary sets in temporal information systems and
responsible for routing. Hence each node should uses this to route packets in mobile ad hoc networks.
maintain the information necessary for routing, that This paper then uses VPRS in weighted temporal
is, the next hop or the path through which the data information systems and uses this in routing. The
has to be routed to the destination. This information performance of these proposed routing protocols are
is either available even before it is needed studied.
(proactive) or is got only when necessary (reactive).
2 TEMPORAL INFORMATION SYSTEMS
Proactive routing is usually done using table
driven protocols where tables are formed initially, 2.1 Information Systems and Decision Systems
and are updated either periodically or when some
change is known. Consider a universe U of elements. An
information system I is defined as I = (U, A, V, ρ),
Reactive routing protocols are also known where
as on-demand routing protocols. In this kind of A is a non-empty, finite set of attributes;
protocols, a route is found for a destination only is the set of attribute values
when there is a need to send information to the of all attributes,
destination. Each node does not have knowledge of where is the set of possible values of
the location of all other nodes in the network. All attribute ;
nodes when they learn or use routes, store the routes is an information function,
to the destinations in a routing table or a cache. such that for every element ,
is the value of attribute for
Most of the on-demand routing protocols element .
[5], [25], [9], discover routes when needed by The information system can also be viewed as an
flooding route request packets in the network. A information table, where each element
route reply is sent back to the source node by either corresponds to a row, and each attribute
an intermediate node that has a route to the corresponds to a column.
destination or by the destination.
I = (U, A, V, ρ), is known as a decision
system, when an attribute is specified as the
The conditional probability that the element 2.4 Information System in a Mobile Node
in the elementary set is negative is
The use of an information system in mobile
ad hoc routing was introduced in [26]. The
information system was modified in [27] to represent
When the context is clear, the conditional probability the route better, by using the link information rather
of an elementary set is taken to be . than the node information. A threshold was used in
the identification of a good next hop.
The -positive region is the union of the
findRecentRoute() {
besttime = 0;
Packet Delivery Ratio (%)
18
Average hop count
16
14 4.1 Routing Based on WTIS
12
10 DSR
8
Here, the route cache of the mobile node is
DSRrec used as the WTIS. Routes that are learnt and used are
6
4 added to the cache of the mobile node. When routes
2
0 are added, the time stamp of each link is added along
with the routes. However, unlike DSR, even if the
5 10 20 30 40
same route is present in the cache earlier, the new
Number of connections route is added with the new stamp stamps. So, the
cache now has the same route multiple times, but
with different time stamps.
Figure 3: Average hop count vs. number of
connections for DSR and DSRrecent In the source node, initially, as in DSR, a
shortest route in the route cache, if available, is
placed as the source route in the data packet. If not
available, route discovery is done.
Average end-to-end delay
10
9
8 Then in the source node, and in any
7 intermediate forwarding node, the WTIS is used to
6 DSR
5 determine the best next hop (using algorithm
4 DSRrec
3 findWeightBasedHop). If the next hop is found, and
2 does not result in a loop, the data packet will be
1
0 forwarded to this next hop. If this next hop is
different from the one in the source route that is
5 10 20 30 40
already in the data packet, this new next hop is
Number of Connections appended to the source route in the data packet at the
current node and the route is invalidated by setting a
flag in the data packet.
Figure 4: Average end-to-end delay vs. number of
connections for DSR and DSRrecent If a next hop cannot be determined from the
WTIS, or if the next hop results in a loop, if the
source route in the data packet has not been
4 MOBILE AD HOC ROUTING USING invalidated earlier, the data packet is forwarded
WEIGHTED TEMPORAL INFORMATION according to the source route. Else, a route discovery
SYSTEMS (WTIS) is done.
In Temporal Information Systems, each The total time is divided into time intervals.
elementary set is associated with a particular time The list of next hops to the destination that are
interval. In Weighted Temporal Information present in the route cache is found. For each possible
Systems, elementary sets in different time intervals next hop, from the current time interval till the initial
have weights. Since it is seen in the previous section time interval, a weighted sum of the number of times
that the recent route in the route cache is useful, that the particular next hop is used is found. More
4
DSR
3
TIME_WT
The ratio of the weighted sum of the usage 2
of the node to the total weight is found. The node for 1
which the ratio is greater than a threshold $\beta'$ is 0
chosen as the next hop. 5 10 20 30 40
Number of connections
4.2 Performance Evaluation
Figure 8: Average end-to-end delay vs. number of The proposed protocol used in this section
connections for DSR and TIME_WT is referred to as VPRS_WT. The packet delivery
ratio for VPRS_WT is less than that for DSR for 5
and 10 connections. When the number of
5 MOBILE AD HOC ROUTING USING connections is increased from 20 to 40 there is a
BETA-POSITIVE REGIONS IN WTIS slight improvement in the packet delivery ratio from
2% to 6% (Fig. 9).
5.1 Routing Based on Beta-Positive Regions
The normalized control overhead for
The experiment described in this section VPRS_WT is more than that for DSR when the
determines the predicted next hop as that value of the number of sources is 5, 10. With increase in the
decision attribute where the union of these number of connections from 20 to 40, there is an
elementary sets is in the $\beta$-positive region, as average improvement of 14% to 19% over DSR (Fig.
described in section 2.5. 10).
14
12
002.
10 DSR
[2] A. Skowron and P. Synak. Reasoning Based on
8 Information Changes in Information Maps. In Rough
6 VPRS_WT
Sets, Fuzzy Sets, Data Mining, and Granular
4
Computing, volume 2639 of Lecture Notes in
2
0 Artificial Intelligence, pages 229 – 236. Springer
2003.
5 10 20 30 40
[3] A. Wieczorkowska, J. Wroblewski, P. Synak and
Number of connections D. Slezak. Application of temporal descriptors to
musical sound recognition. Journal of Intelligent
Information Systems, 21(1):71 – 93, 2003.
Figure 11: Average hop count vs. number of [4] J.K. Baltzersen. An attempt to predict stock
connections for DSR and VPRS_WT market data: a rough sets approach. Master’s thesis.
1996.
[5] David B.Johnson and David A. Maltz. Dynamic
source routing in ad hoc wireless networks. In
Average end-to-end delay
7
Imielinski and Korth, editors, Mobile Computing,
6
volume 353. Kluwer Academic Publishers, 1996.
5
4 DSR [6] Zhongmin Cai, Xiaohong Guan, Ping Shaoa, and
3
Guoji Sun. A rough set theory based method for
VPRS_WT
2 anomaly intrusion detection in computer network
1 systems. In Expert Systems, volume 20, pages 251 –
0 259, 2003.
5 10 20 30 40 [7] Frank Chiang and Robin Braun. Intelligent
failure domain prediction in complex
Number of Connections
telecommunication networks with hybrid rough sets
and adaptive neural nets. In 3rd International
Information and Telecommunication Technologies
Figure 12: Average end-to-end delay vs. number of Symposium, 2004.
connections for DSR and VPRS_WT [8] Slezak D., Synak P., Wieczorkowska A., and
Wroblewski J. Kdd-based approach to musical
instrument sound recognition. In Proc. of the 13th
6 CONCLUSIONS International Symposium on Foundations of
Intelligent Systems, Vol. 2366, Lecture Notes in
This paper presents temporal extensions to Artificial Intelligence, Springer, pages 28 – 36, 2002.
Rough Set Theory and Variable Precision Rough [9] Rohit Dube, Cynthia D. Rais, Kuang-Yeh Wang,
Sets. These extensions are applied to Mobile Ad hoc and Satish K. Tripathi. Signal stability-based
routing. Illustrative experiments are described and adaptive routing (SSA) for ad hoc mobile networks.
the results are presented. IEEE Personal Communications, 4(1):36{45, 1997.
[10] K. Fall and K. Varadhan. The ns manual