Sciweavers

592 search results - page 84 / 119
» Scalable ant-based routing algorithm for ad-hoc networks
Sort
View
ECRTS
2007
IEEE
14 years 3 months ago
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
Shashi Prabh, Tarek F. Abdelzaher
EUC
2007
Springer
14 years 2 months ago
A Selective Push Algorithm for Cooperative Cache Consistency Maintenance over MANETs
Cooperative caching is an important technique to support efficient data dissemination and sharing in Mobile Ad hoc Networks (MANETs). In order to ensure valid data access, the cach...
Yu Huang 0002, Beihong Jin, Jiannong Cao, Guangzho...
ADHOC
2007
108views more  ADHOC 2007»
13 years 8 months ago
Hop-distance based addressing and routing for dense sensor networks without location information
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
Serdar Vural, Eylem Ekici
OPODIS
2010
13 years 6 months ago
Biased Selection for Building Small-World Networks
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
Andrés Sevilla, Alberto Mozo, M. Araceli Lo...
INFOCOM
1997
IEEE
14 years 25 days ago
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...
Ehud Aharoni, Reuven Cohen