Sciweavers

17 search results - page 2 / 4
» The (k, l) Coredian Tree for Ad Hoc Networks
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
13 years 12 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
GLOBECOM
2006
IEEE
13 years 11 months ago
Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
Guofeng Deng, Sandeep K. S. Gupta
ICDCS
2002
IEEE
13 years 10 months ago
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
Thiagaraja Gopalsamy, Mukesh Singhal, Dhabaleswar ...
IPPS
2007
IEEE
13 years 11 months ago
Energy-Aware Self-Stabilization in Mobile Ad Hoc Networks: A Multicasting Case Study
Dynamic networks, e.g. Mobile Ad Hoc Networks (MANETs), call for adaptive protocols that can tolerate topological changes due to nodes’ mobility and depletion of battery power. ...
Tridib Mukherjee, Ganesh Sridharan, Sandeep K. S. ...
AINA
2010
IEEE
13 years 10 months ago
RBP: Reliable Broadcasting Protocol in Large Scale Mobile Ad Hoc Networks
—Conventional broadcasting protocols suffer from network congestion, frequent message losses and corruption of broadcast messages due to a vast number of duplicate packets transm...
Subrata Saha, Syed Rafiul Hussain, A. K. M. Ashiku...