Sciweavers

1783 search results - page 144 / 357
» Low-Complexity Distributed Scheduling Algorithms for Wireles...
Sort
View
JVA
2006
IEEE
15 years 9 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
IPSN
2007
Springer
15 years 9 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
MOBIHOC
2008
ACM
16 years 2 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
ICC
2007
IEEE
146views Communications» more  ICC 2007»
15 years 9 months ago
Optimally Mapping an Iterative Channel Decoding Algorithm to a Wireless Sensor Network
–Retransmission based schemes are not suitable for energy constrained wireless sensor networks. Hence, there is an interest in including parity bits in each packet for error cont...
Saad B. Qaisar, Shirish S. Karande, Kiran Misra, H...
IPSN
2010
Springer
15 years 9 months ago
Distributed genetic evolution in WSN
Wireless Sensor Actuator Networks (WSANs) extend wireless sensor networks through actuation capability. Designing robust logic for WSANs however is challenging since nodes can aï¬...
Philip Valencia, Peter Lindsay, Raja Jurdak