Advanced SearchSearch Tips
Virtual Euc1idean Point based Multicast routing scheme in Underwater Acoustic sensor networks
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Virtual Euc1idean Point based Multicast routing scheme in Underwater Acoustic sensor networks
Kim, Tae-Sung; Park, Kyung-Min; Kim, Young-Yong;
  PDF(new window)
Multicast has been a key routing service for efficient data dissemination in underwater acoustic sensor networks. In sensor networks, there are several multicast routing protocol which reflects sensor network nature. However, existing routing scheme was not targeted at underwater acoustic sensor networks which is hard to provide battery continually. Therefore, a specialized routing algorithm is essential for acoustic sensor networks. In this paper, we propose angle aided multicast routing algorithm for decreasing routing computation complexity, including virtual Euclidean Steiner point. Simulation results show better performance than exist routing Position Based Multicast, Geographic Multicast Routing. such as low computation capability and limited power consumption.
acoustic sensor;location based;multicast;steiner point;angle information;
 Cited by
M. Mauve. H. Fübler et al. "Position based Multicast Routing for Mobile Ad-hoc Networks" ACM SIGMOBILE Mobile Computing and Communications Vol.7 Issue 3, July 2003.

J. Sanchez, P. Ruiz, X. Liu, and I. Stojmenovic, "GMR: Geographic Multicast Routing for Wireless Sensor networks," in Proc. of IEEE SECON, 2006

S. Wu and K. S. Candan, "Gper: Geographic power efficient routing in sensor netwroks," in ICNP. pp.161-172, 2004

J. E. Beasley, "A heuristic for euclidean and rectilinear steiner problems," EJOR. 58:284-292, 1992 crossref(new window)

M. Minoux, "Efficient greedy heuristics for steiner tree problems using reoptimization and supermodularity," INFOR, 28:221-233, 1990

M. Zachariasen and P. Winter, "Concatenationbased greedy heuristics for the euclidean steiner tree problem," Algorithmica, 25: 418-437, 1999 crossref(new window)

G. Robins and A. Zelikovsky, "Improved steiner tree approximation in graphs," In Proc. Symposium on Discrete Algorithms, 2000

A. Zelikovsky, "Better approximation bounds for the networks and euclidean steiner tree problems," In Technical Report, 1996

R. Hwang, D. Richards et al, "The steiner tree problem," Annals of Discrete Mathematics, 53, 1992

P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad-hoc wireless networks," Wireless Netw., Vol.7, No.6, pp.609-616, 2001 crossref(new window)