Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Determining End-to-End Delay Bounds in Heterogeneous Networks
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Determination of Aggregation Points in Wireless Sensor Networks
EUROMICRO '04 Proceedings of the 30th EUROMICRO Conference
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
A survey of multi-agent organizational paradigms
The Knowledge Engineering Review
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Optimal routing for end-to-end guarantees using Network Calculus
Performance Evaluation
Validating the sensor network calculus by simulations
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Delay-based TCP congestion avoidance: A network calculus interpretation and performance improvements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Sink placement without location information in large-scale wireless sensor networks
AINTEC '09 Asian Internet Engineering Conference
AINTEC '09 Asian Internet Engineering Conference
Dimensioning and worst-case analysis of cluster-tree sensor networks
ACM Transactions on Sensor Networks (TOSN)
Tight performance bounds in the worst-case analysis of feed-forward networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Dynamic demultiplexing in network calculus-Theory and application
Performance Evaluation
A self-adversarial approach to delay analysis under arbitrary scheduling
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Searching for tight performance bounds in feed-forward networks
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
f-MAC: a deterministic media access control protocol without time synchronization
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Time delay performance analysis of sensor allocation strategies on a WSN
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
A calculus for SLA delay properties
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Mathematical formalisms for performance evaluation of networks-on-chip
ACM Computing Surveys (CSUR)
A robust topology control solution for the sink placement problem in WSNs
Journal of Network and Computer Applications
| Hi-index | 0.00 |
To our knowledge, at the time of writing no methodology exists to dimension a sensor network so that a worst case traffic scenario can be definitely supported. In this paper, the well known network calculus is tailored so that it can be used as a tool for worst case traffic analysis in sensor networks. To illustrate the usage of the resulting sensor network calculus, typical example scenarios are analyzed by this new methodology. Sensor network calculus provides the ability to derive deterministic statements about supportable operation modes of sensor networks and the design of sensor nodes.