Sciweavers

18 search results - page 3 / 4
» The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic...
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
13 years 8 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 7 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
AINTEC
2006
Springer
13 years 10 months ago
A Topology-Aware Overlay Multicast Approach for Mobile Ad-Hoc Networks
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
Mohamed Ali Kâafar, Cyrine Mrabet, Thierry T...
LCN
2006
IEEE
14 years 1 months ago
Protecting Multicast Sessions in Wireless Mesh Networks
To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast ses...
Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha
COMCOM
2007
136views more  COMCOM 2007»
13 years 7 months ago
Demand-scalable geographic multicasting in wireless sensor networks
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...
Shibo Wu, K. Selçuk Candan