A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Assigning labels in unknown anonymous networks (extended abstract)
2000
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing - PODC '00
Preserved Fulltext
The quality of a labeling algorithm is measured by the range from which the algorithm picks the labels, or alternatively, the length of the assigned labels. ...
Natural efficiency measures are the time, i.e., the number of rounds required for the label assignment, and the message and bit complexities of the label assignment protocol, i.e., the total number of ...
INTRODUCTION 1.1 The problem Designing network algorithms without complete information about the network is an important problem whose many (Stephane. ...
doi:10.1145/343477.343527
dblp:conf/podc/FraigniaudPPP00
fatcat:zokd4p2d2bbwzajsdpfsnozcpa
The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract
1999
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This extended abstract is an introduction to the full paper that can be obtained by ftp ...
The paper announces an incremental mechanically-verified design of the algorithm of Gallager, Humblet, and Spira for the distributed determination of the minimum-weight spanning tree in a graph of processes ...
how to extend the forest. ...
doi:10.1007/s001650050035
fatcat:xmyo7avv6bhd5pldthcgaid7zu
Language Emptiness of Continuous-Time Parametric Timed Automata
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. ...
On the one hand, we show that the problem remains undecidable for parametric timed automata with three clocks and one parameter. ...
We acknowledge a funding from the EU FP7 grant agreement nr. 318490 (SENSATION) and grant agreement nr. 601148 (CASSTING) and from the Sino-Danish Basic Research Center IDEA4CPS. ...
doi:10.1007/978-3-662-47666-6_6
fatcat:kv7bga4ddfcvjluxfw3vkmieri
PAWiS: TOWARDS A POWER AWARE SYSTEM ARCHITECTURE FOR A SoC/SiP WIRELESS SENSOR AND ACTOR NODE IMPLEMENTATION
2005
IFAC Proceedings Volumes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These aspects include all layers of the communication system, the targeted class of the application itself, the power supply and energy management, the digital processing unit and the sensor-actor interface ...
in every aspect of the system. ...
The following technical problems of state of the art designs have been identified which have to be solved: • Wakeup Problem: How to contact a sleeping node? ...
doi:10.3182/20051114-2-mx-3901.00019
fatcat:gruxusk7gnc5pbmpadjm2yuv2e
Pawis: Towards a Power Aware System Architecture for a SoC/SiP Wireless Sensor and Actor Node Implementation
[chapter]
2006
Fieldbus Systems and Their Applications 2005
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These aspects include all layers of the communication system, the targeted class of the application itself, the power supply and energy management, the digital processing unit and the sensor-actor interface ...
in every aspect of the system. ...
The following technical problems of state of the art designs have been identified which have to be solved: • Wakeup Problem: How to contact a sleeping node? ...
doi:10.1016/b978-008045364-4/50058-7
fatcat:hedu4mmkfja3pco66gjnss6kea
Design and analysis of asynchronous wakeup for wireless sensor networks
2009
IEEE Transactions on Wireless Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Second, based on the proposed model, we formulate the problem of tuning the wakeup interval with the following two objectives: to minimize total energy consumption and to maximize network lifetime. ...
We show that these two problems can be optimally solved by an iterative algorithm with global information by virtue of the convexity of the problem structure. ...
The dual channel idea of STEM was further extended with a wakeup radio in [21] , [22] . An extensive survey on sensor network MAC algorithms can be found in [1] , [23] , [24] . ...
doi:10.1109/twc.2009.080814
fatcat:zon25x2nf5h37mlsviuehxwroq
Energy-efficient low power listening for wireless sensor networks in noisy environments
2013
Proceedings of the 12th international conference on Information processing in sensor networks - IPSN '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In empirical studies in residential environments, we observe that the false wakeup problem can significantly increase a node's duty cycle, compromising the benefit of LPL. ...
In empirical studies in residential environments, we observe that the false wakeup problem can significantly increase a node's duty cycle, compromising the benefit of LPL. ...
Although AEDP and receiver-initiated MAC protocols approach the false wakeup problem from different directions, they share the same goal of extending network lifetime by reducing duty cycle in the face ...
doi:10.1145/2461381.2461415
dblp:conf/ipsn/ShaHL13
fatcat:omtdaigscnhjbgjch4rytjwhy4
CORMOS: a communication-oriented runtime system for sensor networks
2005
Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
CORMOS is tailored: (i) to provide easy-to-use abstractions and treat communication as a first class citizen rather than an extension, (ii) to be highly modular with unified application and system interfaces ...
On the specific devices we use, the system is able to process events at a rate of 2500 events/sec. When communicating over the radio transceiver, CORMOS achieves a maximum rate of 20 packets/sec. ...
We would like to acknowledge the support of the General Secretariat for Research and Technology (GSRT), Greece through the ARISTEIA program at ICS-FORTH. ...
doi:10.1109/ewsn.2005.1462026
dblp:conf/ewsn/YannakopoulosB05
fatcat:z6b4m35jarhzzb6orlgt7cyxmi
Utilizing Path Diversity via Asynchronous and Asymmetric Wakeups in Sensor Networks
2008
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Abstract-We present an asynchronous wakeup policy for wireless sensor networks that exploits the available path diversity for maximizing the expected network lifetime. ...
The simulations show that allowing asymmetry can extend the network lifetime by effectively exploiting the available path diversity. ...
The simulations show that the asymmetry does indeed buy us a lot of leverage for extending the network lifetime. ...
doi:10.1109/glocom.2008.ecp.65
dblp:conf/globecom/RawatS08
fatcat:6h6bte32xfbp3f2uxuwuuyyvxi
Specification of Synchronizing Processes
1983
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper is concerned with the application of temporal logic to the specification of factors affecting the synchronization of concurrent ...
The formalism of temporal logic has been suggested to be an appropriate tool for expressing the semantics of concurrent programs. ...
For example, in the alarm clock problem, time constitutes the state of the alarm clock and determines when a wakeup operation is serviced. ...
doi:10.1109/tse.1983.235435
fatcat:7ihjkbp5dbdkvj75v33pd6v77q
OSC-MAC: Duty cycle scheduling and cooperation in multi-hop wireless sensor networks
2013
2013 IEEE Wireless Communications and Networking Conference (WCNC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
to conserve energy and extend the life of a WSN. This paper
The CT SNR advantage can be used to extend range. ...
Ingram, “SCT-MAC: A Scheduling Duty Cycle
problem in multi-hop WSNs. ...
doi:10.1109/wcnc.2013.6554677
dblp:conf/wcnc/LinI13
fatcat:xbrncus4nbe4nlf2lyx5fbjmom
Design and evaluation of a versatile and efficient receiver-initiated link layer for low-power wireless
2010
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems - SenSys '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A-MAC's versatility stems from layering unicast, broadcast, wakeup, pollcast, and discovery above a single, flexible synchronization primitive. ...
is faster and far more channel efficient than LPL; and (v) collection routing performance exceeds the state-of-the-art. ...
This work paves the way for new research in the design of radio hardware, MAC sublayer primitives, MAC-layer services, and performance studies to assess the utility and performance of this approach for ...
doi:10.1145/1869983.1869985
dblp:conf/sensys/DuttaDCLT10
fatcat:qo4nri446jeqvpu7vc3eorvp5e
Model Checking For Fault Explanation
2006
Proceedings of the 45th IEEE Conference on Decision and Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The notion of fault seed is introduced to characterize the cause of a fault. The identification of the fault seed is further reduced to a model checking problem. ...
An algorithm is obtained for the fault seed identification. An example is provided to demonstrate the effectiveness of the approach developed. ...
There has also been an attempt ( [2] ) to generate abstract explanations for the faults by using the predicates involved in the abstraction instead of the actual values of the atomic propositions in each ...
doi:10.1109/cdc.2006.377556
dblp:conf/cdc/JiangFJ06
fatcat:zi5z2k5eh5h6zepa2urbmr7r5y
Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks
2010
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The cqs-pair design provides an optimal solution in terms of energy saving ratio for asynchronous wakeup scheduling. ...
We propose to further improve the energy efficiency of quorum-based asynchronous wakeup scheduling mechanisms/protocols by asymmetric design. ...
They formulate the problem of generating wakeup schedules as a block design problem and derive theoretical bounds under different communication models. ...
doi:10.1109/tc.2010.20
fatcat:2l6ec2hna5hxjgmh6qixzxapwa
Query-enabled sensor networks using the cyclic symmetric wakeup design
2010
Wireless networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We propose a network architecture based on the cyclic symmetric block design class of wakeup schemes. ...
The problem of conserving energy under multiple constraints of query waiting delays and sensing coverage preservation in query-based wireless sensor networks is addressed. ...
The main idea is to use declarative queries to abstract the user from the physical details of query processing (such as node selection for data collection). ...
doi:10.1007/s11276-010-0259-x
fatcat:ktimuvlj2vhj5irropsocz64aa
« Previous
Showing results 1 — 15 out of 1,669 results