![](bg4.png)
10 12 14 16 18 20 22 24 26 28 30
0.0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.0
Deadline Succes Ratio
The Number of Destinations
GMP
GMR
MPRD
Figure 4: Deadline success ratio in respect of the number
of destinations.
all destinations along paths shorter than or equal to
the critical distance. Since end-to-end delay is
dependent on the physical distance a packet travels
in wireless sensor networks, MPRD has higher
chance of satisfying the real-time constraint.
Figure 4 shows the deadline success ratio in
respect of the number of destinations. As the number
of destinations increases, the deadline success ratio
of GMP decreases. In GMP, more paths from the
source node to destinations are longer than the
critical distance as the number of destinations
increase, since the multicast tree becomes more
complicated. In addition to the reason, GMR spends
more time in order to forward data as the number of
destinations increases, since computation complexity
of every forwarding node increases exponentially.
MPRD however is unaffected by the number of
destinations, since MPRD delivers data to all
destinations along paths shorter than or equal to the
critical distance.
0 200 400 600 800 1000 1200 1400 1600 1800 2000 2200 2400 2600 2800 3000 3200 3400
0.0
0.5
1.0
1.5
2.0
Average Energy Consumption (J/node)
Simulation time (sec)
GMP
GMR
MPRD
Figure 5: Energy consumption on the simulation time.
Figure 5 shows total energy consumption on the
simulation time. Since three multicast protocols has
no signaling overhead, energy consumption is
dependent on total hop counts for data
dissemination. Total tree length of MPRD is little
longer than that of GMP and GMR in order to make
each path shorter than the critical distance. Since the
distance packet travels is proportional to the hop
count as mentioned above, the total number of
packet transmission in MPRD is more than that in
GMP and GMR. Therefore total energy consumption
of MPRD is little higher than GMP and GMR.
4 CONCLUSIONS
We propose a new multicast protocol for real-time
data dissemination in wireless sensor networks. To
deliver data to multiple destinations with real-time
constraint, MPRD utilizes the property that data
delivery delay is dependent on the distance a packet
travels in wireless sensor networks. We refer to
linear distance between the source node and the
furthest destination as a critical distance. MPRD
constructs multicast tree that every delivery distance
from the source to each destination on the multicast
tree is shorter than the critical distance and apply the
spatiotemporal approach. Simulation results show
that MPRD has better performance than traditional
multicast protocols in terms of real-time data
dissemination.
REFERENCES
He, T., Stankovic, J. A., Abdelzaher, T. F., and Lu, C.,
2005, A spatiotemporal communication protocol for
wireless sensor networks. IEEE Transaction on
Parallel and Distributed Systems, vol. 16, no. 10, pp.
995-1006.
Akyildiz, I. F. and Vuran, M. C., 2010. Wireless Sensor
Networks. John Wiley and Sons, Ltd.
Wu, S. and Candan, K. S., 2007. Demand-scalable
geographic multicasting in wireless sensor networks.
Computer Communications, vol. 30, pp. 2931-2953.
Sanchez, J., Ruiz, P., Liu, J., and Stojmenovic, I., 2007.
Bandwidth-Efficient Geographic Multicast Routing
for Wireless Sensor Networks. IEEE Sensors Journal,
vol.7, no. 5, pp. 627-636.
Liu, D., Stojmenovic, I., and Jia, X., 2006. A scalable
quorum based location service in ad hoc and sensor
networks. In MASS’06, IEEE International
Conference on Mobile Ad-Hoc and Sensor System.
PECCS 2012 - International Conference on Pervasive and Embedded Computing and Communication Systems
410