A queuing-theoretic framework for modeling and analysis of mobility in WSNs

Authors:
Harsh Bhatia;R. B. Lenin;Aarti Munjal;S. Ramaswamy;Sanjay Srivastava
Affiliations:
Dhirubhai Ambani Institute of of ICT, Gandhinagar, Gujarat, India;University of Arkansas at Little Rock, Little Rock, AR;Colorado School of Mines, Golden, CO;University of Arkansas at Little Rock, Little Rock, AR;Dhirubhai Ambani Institute of of ICT, Gandhinagar, Gujarat, India
Venue:
PerMIS '08 Proceedings of the 8th Workshop on Performance Metrics for Intelligent Systems
Year:
2008

Citing 7
Cited 3

Data networks

Data networks
Introduction to queueing networks

Introduction to queueing networks
Performance of Computer Communication Systems: A Model-Based Approach

Performance of Computer Communication Systems: A Model-Based Approach
Modeling and Analysis of Telecommunication Networks

Modeling and Analysis of Telecommunication Networks
Queuing network models for delay analysis of multihop wireless ad hoc networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Queuing Theory and Telecommunications: Networks and Applications

Queuing Theory and Telecommunications: Networks and Applications
A mobility-based framework for adaptive clustering in wireless ad hoc networks

IEEE Journal on Selected Areas in Communications

Modeling and Analysis of Mobility in MANeTs for Distributed Applications

ICDCIT '08 Proceedings of the 5th International Conference on Distributed Computing and Internet Technology
Performance Related Security Modelling and Evaluation of RANETs

Wireless Personal Communications: An International Journal
An Exposition of Performance-Security Trade-offs in RANETs Based on Quantitative Network Models

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a complete framework for modeling and analysis of Mobility in Wireless Sensor Networks using OQNs with GI/G/1 nodes and single-class customers. We formalize and present three variations - gated queues, intermittent links and intermittent servers. We suitably modify and use the Queuing Network Analyzer (QNA) to study performance measures including: throughput, average waiting time (end-to-end delay), and packet loss probability. The results are verified by simulation in OMNeT++.