Professional Documents
Culture Documents
A Delay-Based Routing Protocol For Human-Oriented Delay Tolerant Mobile Sensor Network DTMSN12
A Delay-Based Routing Protocol For Human-Oriented Delay Tolerant Mobile Sensor Network DTMSN12
Abstract—With the vigorous development of IOT (Internet One typical application of DTMSN is human-oriented
of Things), sensor units carried by human beings will form the data gathering, in which the sensors collect the data which
largest DTMSN in the world. However, most of the existing are closely related to human body to achieve certain goal,
DTMSN routing protocols haven’t taken the characteristics
of human mobility into account, and may not work well in such as flu virus tracking to prevent the explosion of
human-oriented data gathering. In this paper, we analyze the devastating flu or air quality monitoring for tracking the
characteristics of human mobility, and propose a novel delay- average toxic gas taken by people everyday [1]. In these
based routing protocol (DRP) for human-oriented DTMSN. In applications, although samples can be collected at specific
DRP, a sensor node calculates the estimated data delivery delay locations, the most accurate and effective way is deploying
and takes it as a measure of the delivery capacity, the smaller
the estimated delay, the higher the delivery capacity of a sensor wearable sensing units at human body, which generates large
node. When two nodes meet, data messages are forwarded to scale human-oriented DTMSN. With the vigorous develop-
the one with smaller estimated delay. To minimize transmission ment of IOT (Internet of Things), sensor units wearing by
overhead, DRP employs the message rank and survival time human beings will form the largest DTMSN in the world.
to decide message’s transmission or dropping. We evaluate the Hence, it’s of great significance to design highly effective
proposed scheme in a real human moving scenario provided
by MIT Reality datasets, which collected the traces of 100 routing protocol for such networks. Among the existing
individuals of MIT over the course of 9 months. Simulation DTMSN routing protocols, most of them [4], [5], [6], [7]
results have shown that the proposed DRP routing protocol cannot adjust to the characteristics of DTMSN and work
achieves a better performance than some other DTMSN data poorly in data gathering. For example, due to the low data
gathering approaches. deliver ratio in direct transmission [4] and the tremendous
Keywords-DTMSN,data gathering,data delivery delay,real amount of energy consumption in epidemic algorithms [5],
human mobility traces these two basic routing schemes work poorly in practical
scenarios. Although mitigating the energy expense, MaxProp
I. I NTRODUCTION [6] and PREP [7], two variants of the epidemic protocol,
Data gathering is the most important function of wire- still have very high transmission overhead. RED [8] and
less sensor network (WSN). The traditional data gathering FAD [4] takes the characteristics of DTMSN into account
schemes usually rely on a large number of densely deployed and make routing decisions based on historic records. They
sensor nodes to form a well connected mesh network. achieve better routing performance compared with other
Sensors in the network collect the target data and jointly works, but their approach to predict delivery capacity is
transmit them to the sink nodes. These schemes, however, error-prone, especially when the source is far away from
may not work well in the scenarios with poor connectivity the sink; In addition, as they are not specially designed for
due to sparse network density and mobility of sensor nodes human-oriented DTMSN, they may not work well in human-
(e.g., air quality monitoring [1], and wildlife tracking [2]). In oriented scenario.
order to collect the data information in the aforementioned In this paper, we analyze the characteristic of human
scenarios effectively, Delay Tolerant Mobile Sensor Network mobility, and propose a novel delay-based routing protocol
(DTMSN)[3] was proposed. A DTMSN generally consists (DRP) for human-oriented DTMSN. The major contributions
of two types of nodes, namely mobile sensor nodes and of our work lie in the following:
sink nodes. The mobile sensor nodes which are intermittent
connected are attached to moving objects (such as human • We propose a new data gathering approach for human-
beings, animals, or vehicles) for data information gathering, oriented DTMSN, which estimates the data transmis-
while the sink nodes are either placed at special locations sion delay of a sensor node according to the history
or taken by mobile objects to collect data from sensors records, and replicates messages selectively to nodes
and forward them to the end user. As the connectivity is that have lower estimated data delivery delay;
intermittent, a certain delay is tolerable in such networks. • We introduce an effective queue management scheme.
202
6% 5%
27%
52%
Community
of each sensor node at the moment, which indicates how learns their current average transmission delay via simple
soon a sensor node could deliver a data message to the sink. handshaking messages and then replicates all the messages
Obviously, it’s difficult for a sensor node to get the data in its queue to a subset of the Z ′ sensors, which have lower
delivery delay without receiving acknowledgement from the estimated delivery delay than that of node i. The pseudo-
sink node. Therefore, we let the sink node broadcast a hello code of the data transmission algorithm is shown as follows:
203
Algorithm1.Message forwarding process
1: ϕ = 0
its own data queue again. Among these messages, we let
2: for z = 1; z <= Z ′ ; z + + do // identify receiving sensors message of sort a have the highest rank, sort b medium, and
3: if Avgdelay(i) > Avgdelay(ψz ) then sort c the lowest rank. That is because messages of sort a
4: ϕ=ϕ ∪ ψz
5: end if
haven’t been transmitted, while that of sort b and sort c have
6: end for been transmitted, with a higher chance of being delivered to
7: for n = 1; n <= |ϕ|; n + + do // |ϕ| represents the number the sink node.
of nodes in ϕ
8: forwardmessage ( i, ϕn ) //ϕn for all n ∈ [1, |ϕ|] Let Ci denotes the clock of sensor i and ξim be the survival
9: end for time of message m in the queue of sensor i. Recall that
in our network model, all the sensor nodes have loosely
synchronized clocks, thus, our strategy for determining a
The data delivery process is shown in Fig.3. Suppose message’s survival time is as follows: when a message is
that S1 → S2 → S3 → S4 → · · · → Sn is the path generated, its survival time is initialized to be zero. Let’s
along which the data messages are successfully forwarded consider a sensor n, which is transmitting a data message
to the sink, where Si represents a sensor node carried by one m to a nearby sensor node i. Since the propagation time
person. If we assume that the persons meeting each other between two adjacent nodes with short distance could be
have a certain social relationship, then this path can be used ignored, thus the initial value of ξim remains the same as
to represent a social relationship chain. In this chain, Sn ξnm . If a source message has transmitted to its next hop and
could communicate with the sink node directly, and it has it is inserted into node’s queue again, its survival time is
the lowest data delivery delay; while S1 is the furthest one also assumed to be equal to the value before transmitting.
with respect to sink node, thus have the longest data delivery Furthermore, each sensor maintains a timer. Once the timer
delay. As is analyzed above, this social relationship changes timeouts, the message’s survival time increases. The general
slowly, and this may also explain why we could use the operations are presented as Algorithm 2, where parameter
history average delivery delay to estimate the delivery delay K denotes the maximum queue size of sensor.
in the future.
Algorithm 2.Survival time updating
1: a[i] ← Ci ; // a[i] keep the current value of Ci
2: if receiving a new generated message m from node i
Sn
S3 S4 3: ξim =0
Sink 4: else
S2
5: if receiving a message m form adjacent node n
6: ξim =ξnm
S1 7: else
8: if receiving a transmitted message m from node i
9: ξim =ξim
10: endif
11: For( m = 1; m <= K; m + +) // m represent messages
Figure 3. Data delivery process maintained by sensor i
12: while m is in the queue of node i
13: ξim =ξim + +
14: endwhile
B. Queue management 15: endfor
1) Message’s rank & survival time: In opportunistic net-
works like DTMSN, multiple copies of the same messages 2) The implementation of queue management scheme:
would be generated and buffered by different sensors, which The queue management scheme is based on both the rank
results in redundancy. The goal of the queue management and the survival time of the message. We believe that
scheme is to determine message’s transmission order in message of higher rank is more important and should be
the buffer queue and to determine which message should forwarded with a higher priority. This is done by arranging
be dropped when the queue is full. The main idea of our the messages in the queue with a decreasing order of their
queue management scheme is to employ the rank as well as rank. Furthermore, for messages with the same rank, priority
survival time to signify the importance of a given message. should be given to those messages that have smaller survival
Each sensor has a data queue that contains data messages time. A message will be dropped in the following two
ready for transmission. The data messages of a sensor come occasions. First, if the queue is full when a message arrives,
from three sources. (a) After the sensor acquires data from its rank is compared with the message at the end of the
its sensing unit, it creates a data message, which is inserted queue. If the rank is equal, but the new message has a larger
into its data queue; (b) When the sensor receives a data survival time, it is dropped. If the rank is equal, but the new
message from other sensors, it inserts the message into its message has a smaller survival time, the message at the end
data queue; (c) After the sensor sends out a data message to of the queue is dropped, and the new message is inserted
a non-sink sensor node, it may also insert the message into into the queue at appropriate position according to its rank
204
and survival time. If the rank of the new message is higher,
the message at the end of the queue is dropped, and the
new message is also inserted into the queue at appropriate
position. Second, once the survival time of a message in
the process of updating exceeds the network’s delay tolerant
threshold, the message is dropped. This is to reduce network
energy consumption, given that the message either has been
delivered to the sink node with a high probability by other
sensors or has been invalid in our application.
205
thus the delivery ratio is very low. For epidemic protocol, delivery ratio, the survival time of data messages mustn’t be
it produces a large amount of copies, which exhausts the too small. In our experiments, we set the network tolerant
buffering resources rapidly, causing serious data dropping delay as 1000 minutes, and the data delivery ratio of DRP
phenomenon and low delivery ratio. is nearly 90%.
70
E. Impact of queue sizes
Data delivery ratio
206
100 10 600
80 8 500
Average copies
Average delay
60 6 400
40 4 300
20 2 200
0 0 100
1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6
(a) data delivery ratio (b) average copies (c) transmission delay
100 15 1200
80 12 1000
DRP
Data delivery ratio(%)
FAD
Average copies
Average delay
60 9 800 Epidemic
DT
40 6 600
DRP
DRP FAD
FAD Epidemic
20 3 400
Epedemic DT
DT
0 0 200
100 200 300 400 500 600 100 200 300 400 500 600 100 200 300 400 500 600
Queue size Queue size Queue size
(a) data delivery ratio (b) average copies (c) transmission delay
This is because too many messages copies exhaust much minimize transmission overhead, we introduce an effective
sensor energy in flooding. Moreover, we also obtain that queue management scheme, which utilizes the message rank
DRP attains longer network life than FAD, demonstrating and survival time to determine message’s transmission or
the effectiveness of the proposed strategy. Though extra dropping. Finally, we evaluate the proposed scheme in a
energy is needed in DRP to disseminate the hello messages real human moving scenario, and the results show that the
broadcasted by the sink node, the total energy consumption proposed DRP achieves a higher delivery ratio at lower
of DRP is a little less than FAD. This is because the size of delivery delay with reasonable overhead.
the hello message is very small and the broadcasting interval
does not need to be very short due to the stable human R EFERENCES
activity.
[1] Y. Wang, H. Wu, H. Dang, and F. Lin, “Analytic, simulation,
Table III and empirical evaluation of delay/fault-tolerant mobile sensor
N ETWORK LIFE WITH DEFAULT PARAMETERS
networks,” IEEE Transactions on Wireless Communications,
2007, 1(11): 3287-3296.
Protocol DRP FAD DT Epedemic
Lifetime 10.71 10.28 7.48 65.6
[2] J. Philo, O. Hidekazu, and W. Yong, “Energy-efficient com-
puting for wildlife tracking: design tradeoffs and early expe-
VI. C ONCLUSION riences with zebranet,” ACM Operating System Review, 2002,
36(5):96-107.
This paper focuses on the data gathering in human-
oriented DTMSN. After analyzing the unique characteristics [3] Y. Wang, F. Lin, and H. Wu, “Poster: efficient data trans-
of human mobility, we propose a delay-based routing pro- mission in delay fault tolerant mobile sensor networks (dft-
tocol (DRP) for human-oriented DTMSN. In DRP, the sink msn),” In: Proceedings of IEEE International Conference on
Network Protocols (ICNP’05), 2005.
node broadcasts a hello message periodically; each sensor
node calculates the estimated data delivery delay based on
[4] Y. Wang and H. Wu, “Delay/fault-tolerant mobile sensor
the received hello message and takes it as a measure of network (dft-msn): a new paradigm for pervasive informa-
the delivery capacity. When two nodes meet, data messages tion gathering,” IEEE Transactions on Mobile Computing,
are forwarded to the one with smaller estimated delay. To 2005,6(8):1021-1034.
207
[5] A. Vahdat and D. Becker, “Epidemic routing for partially con-
nected ad hoc networks,” Technical Report Vol.CS-200006:
Durham, 2000.
208