Sciweavers

523 search results - page 96 / 105
» Algorithms for Message Ferrying on Mobile ad hoc Networks
Sort
View
AICCSA
2006
IEEE
126views Hardware» more  AICCSA 2006»
14 years 2 months ago
Restricted Shortest Path Routing with Concave Costs
Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the i...
Pejman Khadivi, Shadrokh Samavi, Hossein Saidi
ECRTS
2007
IEEE
14 years 2 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
AISADM
2005
Springer
14 years 2 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
COMCOM
2007
94views more  COMCOM 2007»
13 years 8 months ago
Adaptive backup routing for ad-hoc networks
The network topology changes frequently in ad-hoc networks. Some on-demand protocols with multi-paths or backup routes have been proposed to improve the performance in ad-hoc netw...
Wei Kuang Lai, Sheng-Yu Hsiao, Yuh-Chung Lin
ICPPW
2003
IEEE
14 years 1 months ago
Perfect Secrecy in Wireless Networks
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The ...
Phillip G. Bradford, Olga V. Gavrylyako, Randy K. ...