Sciweavers

2571 search results - page 456 / 515
» Approximation schemes for wireless networks
Sort
View
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
15 years 11 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
DCOSS
2008
Springer
15 years 7 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
JPDC
2007
112views more  JPDC 2007»
15 years 5 months ago
CHEMAS: Identify suspect nodes in selective forwarding attacks
Selective forwarding attacks may corrupt some mission-critical applications such as military surveillance and forest fire monitoring in wireless sensor networks. In such attacks,...
Bin Xiao, Bo Yu, Chuanshan Gao
TKDE
2002
140views more  TKDE 2002»
15 years 5 months ago
Transaction Processing in Mobile, Heterogeneous Database Systems
As technological advances are made in software and hardware, the feasibility of accessing information "any time, anywhere" is becoming a reality. Furthermore, the diversi...
James B. Lim, Ali R. Hurson
PERCOM
2007
ACM
16 years 5 months ago
A Scalable Geographic Service Provision Framework for Mobile Ad Hoc Networks
Supporting scalable and efficient routing and service provision in Mobile Ad Hoc Networks (MANET) has been a big research challenge. Conventional topology-based unicast and multic...
Xiaojing Xiang, Xin Wang