Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/14690
Title: Capacity evaluation for ad hoc networks with end-to-end delay constraints
Authors: ZHANG JUNXIA
Keywords: Ad hoc network, Capacity, End-to-end delay, Adjacency matrix, IEEE 802.11, Average hop count
Issue Date: 28-Apr-2005
Source: ZHANG JUNXIA (2005-04-28). Capacity evaluation for ad hoc networks with end-to-end delay constraints. ScholarBank@NUS Repository.
Abstract: The objective of study in this thesis is to analyze the capacity of ad hoc networks serving delay sensitive applications. The network capacity metric is defined as the number of sessions that can be supported in the network simultaneously subject to the end-to-end delay constraints. The ad hoc networks are modeled as an undirected graph G(V,E,A), where V is the set of nodes, E is set of links between nodes, and A is the adjacency matrix that describes the topology of the network. The upper and lower bound of the capacity are determined using algorithms designed based on one-hop and multi-hop adjacency matrices. The algorithms obtain the network capacity through a set of a??selecta?? and a??deletea?? operations, and are scalable, run in polynomial time and use easily obtained information to satisfy the requirement of real-time services. The maximum end-to-end delay of the flows running in a network adopting IEEE 802.11 as the MAC protocol is estimated by applying the end-to-end delay constraints. In addition, two supplementary algorithms are also designed: one for the average hop count of the network estimation, and the other for the queuing delay calculation.
URI: http://scholarbank.nus.edu.sg/handle/10635/14690
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis_zhangjunxia_ECE.pdf749.43 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

221
checked on Dec 2, 2017

Download(s)

148
checked on Dec 2, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.