Sciweavers

403 search results - page 61 / 81
» Merging Clustering Algorithms in Mobile Ad Hoc Networks
Sort
View
ICN
2005
Springer
15 years 5 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
PADS
2004
ACM
15 years 5 months ago
Simulation Validation Using Direct Execution of Wireless Ad-Hoc Routing Protocols
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
Jason Liu, Yougu Yuan, David M. Nicol, Robert S. G...
PEWASUN
2006
ACM
15 years 5 months ago
Wave propagation using the photon path map
In wireless network planning, much effort is spent on the improvement of the network and transport layer – especially for Mobile Ad Hoc Networks. Although in principle realworl...
Arne Schmitz, Leif Kobbelt
CCS
2008
ACM
15 years 1 months ago
Revocation games in ephemeral networks
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
Maxim Raya, Mohammad Hossein Manshaei, Márk...
JNW
2008
124views more  JNW 2008»
14 years 11 months ago
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
Shahab Kamali, Jaroslav Opatrny