Sciweavers

109 search results - page 7 / 22
» comcom 2006
Sort
View
COMCOM
2006
75views more  COMCOM 2006»
14 years 9 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
COMCOM
2006
62views more  COMCOM 2006»
14 years 9 months ago
Self-monitoring of wireless sensor networks
This paper presents an efficient distributed self-monitoring mechanism for a class of wireless sensor networks used for monitoring and surveillance. In these applications, it is i...
Chih-fan Hsin, Mingyan Liu
COMCOM
2006
79views more  COMCOM 2006»
14 years 9 months ago
How many sensors for an acceptable breach detection probability?
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the num...
Ertan Onur, Cem Ersoy, Hakan Deliç
COMCOM
2006
114views more  COMCOM 2006»
14 years 9 months ago
A comparison of epidemic algorithms in wireless sensor networks
We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is nece...
Mert Akdere, Cemal Çagatay Bilgin, Ozan Ger...
COMCOM
2006
80views more  COMCOM 2006»
14 years 9 months ago
A framework for seamless service interworking in ad-hoc networks
Local area wireless networks are becoming commonplace in our everyday lives. It would be beneficial to establish such wireless networks in an ad-hoc manner so that they are infras...
Linda Källström, Simone Leggio, Jukka Ma...