Sciweavers

403 search results - page 67 / 81
» Merging Clustering Algorithms in Mobile Ad Hoc Networks
Sort
View
ICC
2011
IEEE
257views Communications» more  ICC 2011»
14 years 1 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
SPAA
2005
ACM
15 years 7 months ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...
TON
2008
109views more  TON 2008»
15 years 1 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
148
Voted
SIGCOMM
1994
ACM
15 years 5 months ago
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers
An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an inno...
Charles E. Perkins, Pravin Bhagwat
AISADM
2005
Springer
15 years 7 months ago
Multi-agent Approach for Community Clustering Based on Individual Ontology Annotations
The paper presents peer-to-peer multi-agent framework for community clustering based on contact propagation in the global network of contacts with individual ontology-based descrip...
Dmitri Soshnikov