Sciweavers

522 search results - page 87 / 105
» Connected k-Hop Clustering in Ad Hoc Networks
Sort
View
IPPS
1996
IEEE
13 years 12 months ago
Benefits of Processor Clustering in Designing Large Parallel Systems: When and How?
Advances in multiprocessor interconnect technologyare leading to high performance networks. However, software overheadsassociated with message passing are limiting the processors ...
Debashis Basak, Dhabaleswar K. Panda, Mohammad Ban...
ICN
2005
Springer
14 years 1 months ago
An Energy Constrained Multi-hop Clustering Algorithm for Wireless Sensor Networks
A wireless sensor network is a new kind of wireless Ad-Hoc network consisting of a large number of small low cost, power constrained sensors deployed in a large area for gathering...
Navin Kumar Sharma, Mukesh Kumar
ICST
2010
IEEE
13 years 5 months ago
GraphSeq: A Graph Matching Tool for the Extraction of Mobility Patterns
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
Minh Duc Nguyen, Hélène Waeselynck, ...
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
13 years 11 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
ISCC
2007
IEEE
126views Communications» more  ISCC 2007»
14 years 1 months ago
VoIP Communications in Wireless Ad-hoc Network with Gateways
In this paper, we investigate some of the issues that arise when mobile nodes engage voice connections with remote peers by using a wireless ad hoc network (MANET–cell) to acces...
Elena Fasolo, Federico Maguolo, Andrea Zanella, Mi...