Sciweavers

429 search results - page 12 / 86
» Group Routing without Group Routing Tables
Sort
View
ICNP
1998
IEEE
13 years 11 months ago
Receiver-based Multicast Scoping: A New Cost-Conscious Join/Leave Paradigm
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
George F. Riley, Mostafa H. Ammar, Lenitra M. Clay
MOBICOM
2004
ACM
14 years 4 days ago
A structured group mobility model for the simulation of mobile ad hoc networks
Realistic models for node movement are essential in simulating mobile ad hoc networks. Many MANET scenarios are most realistically represented using group movement, but existing g...
Ken Blakely, Bruce Lowekamp
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 7 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
GLOBECOM
2007
IEEE
14 years 1 months ago
Two Energy-Saving Schemes for Cooperative Transmission with Opportunistic Large Arrays
— An opportunistic large array (OLA) is a form of cooperative diversity in which a large group of simple, inexpensive relays or forwarding nodes operate without any mutual coordi...
Lakshmi V. Thanayankizil, Aravind Kailas, Mary Ann...
FGCN
2007
IEEE
173views Communications» more  FGCN 2007»
13 years 8 months ago
Preventing Cooperative Black Hole Attacks in Mobile Ad Hoc Networks: Simulation Implementation and Evaluation
A black hole attack is a severe attack that can be easily employed against routing in mobile ad hoc networks. A black hole is a malicious node that falsely replies for any route r...
Hesiri Weerasinghe, Huirong Fu