@INPROCEEDINGS{Aalt0604:Mean,
AUTHOR="Samuli Aalto and Urtzi Ayesta",
TITLE="Mean delay analysis of Multi Level Processor Sharing disciplines",
BOOKTITLE="IEEE INFOCOM 2006",
ADDRESS="Barcelona, SPAIN",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="Multilevel Processor-Sharing (MLPS) scheduling disciplines permit to model
a wide variety of non-anticipating scheduling disciplines. Such disciplines
have recently attracted attention in the context of the Internet as an
appropriate flow-level model for the bandwidth sharing obtained when
priority is given to short TCP connections. In this paper, we compare the
mean delay in an M/G/1 queue among MLPS disciplines under the assumption
that the service time distribution belongs to class Decreasing Hazard Rate
(DHR). Our main new result states that, given an MLPS discipline, the mean
delay is reduced whenever a level is added by splitting an existing one.
Furthermore, we characterize the effect on the mean delay of changing
internal disciplines within levels. By numerical means, we demonstrate that
the mean delay of an MLPS discipline can get close to the minimum optimal
delay with just a few levels. As the number of levels increases in an MLPS
discipline, the MLPS queue mimics closer and closer the behavior of a
Foreground-Background queue, which is known to minimize the mean delay
among all disciplines. Thus, our result provides a constructive way to
proof the optimality of FB."
}

@INPROCEEDINGS{Aass0609:First,
AUTHOR="Ali Aassie-Ali and Van Duc Nguyen and Kyandoghere Kyamakya and Abbas Omar",
TITLE="First arrival detection based on channel estimation for positioning in
wireless {OFDM} systems",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="Based on the estimated channel, this paper presents a new method for first
arrival estimation for positioning application in OFDM mobile communication
systems. In the new method, the characteristics of the information
theoretic criteria is exploited to estimate the time of arrival (TOA). The
information theoretic criteria is established on the basic of the different
statistical characteristics of noise and the mobile channel. In the
proposed algorithm, the calculation of the autocorrelation matrix and their
eigenvalues are not required. Therefore, the complexity of the proposed
method is low. Simulation results show that the performance of system in
terms of the detection rate is very high An accurate estimation of the
first arrival path (or the time of arrival) can be obtained even though the
first arrival path is strongly attenuated and the system suffers from
strong additive noise."
}

@INPROCEEDINGS{Aawa0604:Spatial,
AUTHOR="Aawatif Hayar",
TITLE="On the Spatial and Temporal Degrees of Freedom of {UWB} communications",
BOOKTITLE="European Wireless 2006",
ADDRESS="Athens, Greece",
DAYS=2,
MONTH=apr,
YEAR=2006,
ABSTRACT="Ultra-Wide Band (UWB) were presented as a promising radio technology.
Because of their large bandwidth, these networks are supposed able to
deliver high data rates at short ranges. But after analyzing measurements
many works observed saturation of the number of channel Degrees of Freedom
(DoF) versus bandwidth. This motivates the work presented in this paper
where we focus on sub space behavior to analyze the relationship between
spatial and temporal resolution for UWB channel. This work presents also a
study of the UWB propagation mechanism and its impact on the limitation of
the maximum number of channel degrees of freedom."
}

@INPROCEEDINGS{Aïss0609:Iterative,
AUTHOR="Abdeldjalil {Aïssa-El-Bey} and Karim Abed-Meraim and Yves Grenier",
TITLE="Iterative blind source separation by decorrelation: algorithm and
performance analysis",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="This paper presents an iterative blind source separation method using
second order statistics (SOS) and natural gradient technique. The SOS of
observed data is shown to be sufficient for separating mutually
uncorrelated sources provided that the considered temporal coherence
vectors of the sources are pairwise linearly independent. By applying the
natural gradient, an iterative algorithm is derived that has a number of
attractive properties including its simplicity and 'easy' generalization to
adaptive or convolutive schemes. Asymptotic performance analysis of the
proposed method is performed. Several numerical simulations are presented
to demonstrate the effectiveness of the proposed method and to validate the
theoretical expression of the asymptotic performance index."
}

@INPROCEEDINGS{Abar0609:Use,
AUTHOR="David Abarca and David Hattox and Yan Xu",
TITLE="The Use of Active and Collaborative Learning Methods: A Training Model for
the Collegiate Cyber Defense Competition",
BOOKTITLE="First Annual Conference on Education in Information Security",
ADDRESS="Ames, IA, USA",
DAYS=17,
MONTH=sep,
YEAR=2006,
ABSTRACT="Active learning and collaborative learning are proven to be effective
methods in modern education. This paper describes a training model and the
application of active and collaborative training methods used to prepare
college students for the Collegiate Cyber Defense Competition.  This
training model helps students learn, develop, practice and test their
computer and information security knowledge and skills individually and as
a member of a team. Faculty members also experienced and recognized the
value of active learning in a collaborative team-based environment."
}

@INPROCEEDINGS{Abba0601:Mitigating,
AUTHOR="Ash Mohammad Abbas",
TITLE="Mitigating Overheads and Path Correlation in {Node-Disjoint} Multipath
Routing for Mobile Ad hoc Networks",
BOOKTITLE="COMmunication Systems softWAre and middlewaRE",
DAYS=8,
MONTH=jan,
YEAR=2006,
ABSTRACT="Finding independent node-disjoint paths is a challenging task in an ad hoc
environment. In this paper, we study the impact of employing directional
antennas on node-disjoint multipath routing in mobile ad hoc networks. We
focus on routing overheads and correlation among node-disjoint multipaths
between a given pair of nodes. We have proposed schemes to mitigate routing
overheads and path correlation using semi-directional and directional
antennas. We have shown analytically that routing overheads as well as path
correlation are reduced using proposed schemes which utilize directional
antennas in comparison to existing schemes where omni-directional antennas
are used."
}

@INPROCEEDINGS{Abba0601:Path,
AUTHOR="Ash Mohammad Abbas",
TITLE="Path Diminution is Unavoidable in {Node-Disjoint} Multipath Routing with
Single Route Discovery",
BOOKTITLE="COMmunication Systems softWAre and middlewaRE",
DAYS=8,
MONTH=jan,
YEAR=2006,
ABSTRACT="In an ad hoc network, identification of all node-disjoint paths between a
given pair of nodes is a challenging task. The phenomena that a protocol is
not able to identify all node-disjoint paths that exist between a given
pair of nodes is called path diminution. In this paper, we discuss that
path diminution is inevitable to occur when a protocol discovers multiple
node-disjoint paths in a single route discovery. We discuss schemes to
mitigate path diminution. However, no such scheme is guaranteed to discover
all node-disjoint paths that exist between a given pair of nodes."
}

@INPROCEEDINGS{Abba0605:Environmental,
AUTHOR="Abdelgadir Abbas and Fathifazl Gholamreza and Burkan Isgor and Ghani
Razaqpur and Benoit Fournier and Simon Foo",
TITLE="Environmental Benefits of Green Concrete",
BOOKTITLE="EIC Climate Change Technology Conference",
ADDRESS="Ottawa, Ontario, Canada",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Of the approximately 11 million tonnes of annual solid concrete and
demolition waste, concrete accounts for about 52\% by weight. However, most
of this concrete is used as highway base or sent to landfills for disposal;
only a very small portion of the concrete waste is reused in building
construction. Considering the fact that usable natural aggregate (NA)
supplies are diminishing, there will be a high demand for recycled concrete
aggregates (RCA) to be used in the so called ?green concrete (GC).? Using
recycled concrete as aggregates will help reducing the total cost of
concrete production because aggregates need not be hauled from remote
locations, but obtained locally. The combination of RCA with significant
quantities of fly ash or slag as replacement for Portland cement is
particularly attractive from both economic and environmental perspectives.
GC will reduce the demand for natural resources, the associated energy
consumption, and green house gas (GHG) emission required to produce
aggregates and cement. These reductions can be considered as one of the
construction industry?s major contributions to Canada?s GHG emission
reduction objective. Currently, there are no established guidelines for
producing GC in Canada. This paper presents the environmental and economic
benefits of increasing the use of GC in the construction industry and
highlights the objectives of an ongoing research by the authors on GC."
}

@INPROCEEDINGS{Abda0605:Analysis,
AUTHOR="Ahmed Abdallah",
TITLE="Analysis of Distributed Noise Canceling",
BOOKTITLE="Second International Conference on Distributed Frameworks for Multimedia
applications",
DAYS=14,
MONTH=may,
YEAR=2006,
ABSTRACT="This paper tackles the issues which arise when the process of porting
conventional algorithms, especially signal processing ones, from their
normal centralized form to a parallel distributed form is undertaken. It
deals specifically with those all too familiar issues particular to
wireless sensor networks of limited power, memory, computational
capabilities, and bandwidth. What is the proper approach one should take to
ensure that goals of efficiency and performance are met, and to what degree
of granularity should the parallelism available within an algorithm be
exploited are some of the questions which will be addressed here. The issue
of modeling the communication and computation scheme for the distributed
version of the algorithm is introduced here along with the preliminary
prototype for doing so."
}

@INPROCEEDINGS{Abda0607:Analysis,
AUTHOR="Ahmed Abdallah",
TITLE="Analysis of Distributed Noise Canceling",
BOOKTITLE="IWCMC 2006 Multimedia over Wireless",
ADDRESS="Vancouver, Canada",
DAYS=3,
MONTH=jul,
YEAR=2006,
ABSTRACT="This paper tackles the issues which arise when the process of porting
conventional algorithms, especially signal processing ones, from their
normal centralized form to a parallel distributed form is undertaken. It
deals specifically with those all too familiar issues particular to
wireless sensor networks of limited power, memory, computational
capabilities, and bandwidth. What is the proper approach one should take to
ensure that goals of efficiency and performance are met, and to what degree
of granularity should the parallelism available within an algorithm be
exploited are some of the questions which will be addressed here. The issue
of modeling the communication and computation scheme for the distributed
version of the algorithm is introduced here along with the preliminary
prototype for doing so."
}

@INPROCEEDINGS{Abde0601:Allocating,
AUTHOR="Sobhy Abdelkader",
TITLE="Allocating generation to loads and line flows for transmission open access",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="This paper presents a new method for calculating the individual generators
shares in line flows, line losses and loads. The method is described and
illustrated on active power flows, but it can be applied in the same way to
reactive power flows. Starting from a power flow solution, the line flow
matrix is formed. This matrix is used for identifying node types, tracing
the power flow from generators downstream to loads, and to determine
generators participation factors to lines and loads. Neither exhaustive
search nor matrix inversion is required. Hence, the method is claimed to be
the least computationally demanding amongst all of the similar methods."
}

@INPROCEEDINGS{Abde0604:Multiple,
AUTHOR="Layeb Abdesslem",
TITLE="Multiple Sequence Alignment by Quantum Genetic Algorithm",
BOOKTITLE="The 7th Workshop on Parallel and Distributed Scientific and Engineering
Computing at IPDPS 2006",
ADDRESS="Rhodes Island, Greece",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this paper we describe a new approach for the well known problem in
bioinformatics: Multiple Sequence Alignment (MSA). MSA is fundamental task
as it represents an essential platform to conduct other tasks in
bioinformatics like the construction of phylogenetic trees and the
structural and functional prediction of proteins to name just a few. Our
approach merges between the classical genetic algorithm and some principles
of the quantum computing like interference, measure, superposition, etc. It
differs from other genetic methods of the literature by using a small
population size and a less iteration required to find good quality
alignments thanks to the used quantum principles: state superposition,
interference, quantum mutation and quantum crossover. Another attractive
feature of this method is its ability to provide an extensible platform for
evaluating different objective functions. Experiments on a wide range of
data sets have shown the effectiveness of the proposed approach and its
ability to achieve good quality solutions comparing to those given by other
popular multiple alignment programs."
}

@INPROCEEDINGS{Abde0604:Parity,
AUTHOR="Khaled Abdel-Ghaffar and Jos Weber",
TITLE="On {Parity-Check} Matrices with Optimal Stopping and/or {Dead-End} Set
Enumerators",
BOOKTITLE="4 th International Symposium on Turbo Codes in connection with 6th
International ITG-Conference on Source and Channel Coding",
ADDRESS="Munich, Germany",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="The performance of iterative decoding techniques for linear block codes
correcting erasures depends very much on the sizes of the stopping sets
associated with the underlying Tanner graph, or, equivalently, the
parity-check matrix representing the code. In this paper, we introduce the
notion of dead-end sets to explicitly demonstrate this dependency. The
choice of the parity-check matrix entails a trade-off between performance
and complexity. We give bounds on the complexity of iterative decoders
achieving optimal performance in terms of the sizes of the underlying
parity-check matrices. Further, we fully characterize codes for which the
optimal stopping set enumerator equals the weight enumerator."
}

@INPROCEEDINGS{Abde0605:Proposal,
AUTHOR="Hachani Abderrazak and Belhadj Saheddine",
TITLE="A Proposal for a pseudo deterministic anticollision algirithm for
contactless identification (rfid)",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="In recent years radio frequency identification becomes a reliable
technology in every day applications; access control, electronic
immobilizers, etc. If numerous transponders are available in the
interrogation zone of the base station, messages will collide and cancel
each other. This problem will make necessary to come up a strategy to
identify all present tags. In this paper we propose a pseudo deterministic
anti-collision algorithm. The corner stone of our solution is based on a
scheme allowing all tags to track activities on the channel. Furthermore
the anti-collision algorithm explores spatial and time domains. All these
algorithms capabilities lead to a low collision probability which results
in a fast identification time delay. The reader (base station) is equipped
with directive antennas allowing space division multiplexing access.
Transponders are split into subsets according to their position in the
pattern magnetic field of one base station antenna. The reader selects one
subset by the activation of the appropriate antenna (transponders of other
subsets will not take part in the identification process since they are not
in the active antennas field and thus they are not powered) then
communication between the base station and transponders is established over
time slot."
}

@INPROCEEDINGS{Abde0605:Test1,
AUTHOR="Chehri Abdellah and Paul Fortier and Hasnaa Aniss and Pierre-Martin Tardif",
TITLE="{UWB} spatial fading and small scale characterization in underground mines",
BOOKTITLE="23rd Queen's Biennial Symposium on Communications",
ADDRESS="Kingston, Ontario, Canada",
DAYS=29,
MONTH=may,
YEAR=2006,
ABSTRACT="This paper reports on experimental results of UWB channel propagation in
underground mines. Because the mine architecture and topology is often
irregular and composed of interconnected corridors, two cases were treated,
namely LOS and NLOS. The goal of this work is not to formulate a channel
model for UWB systems or to provide a universal model for all environments
in which UWB devices will be operating, but rather to provide a set of
tools that can be used to fairly evaluate the performance of different UWB
physical layer proposals in real channels such as underground mines. This
work was carried out by the Underground Communications Research Laboratory,
LRCS(\), in the MMSL-CANMET experimental mine (Mining and Mineral
Sciences Laboratories - Canadian Center for Minerals and Energy Technology)
in Val-dOr, Canada."
}

@INPROCEEDINGS{Abde0609:Multimodal,
AUTHOR="Mohamed Abdel-Mottaleb",
TITLE="A Multimodal Approach for 3d Face Modeling and Recognition Using Deformable
Mesh Model",
BOOKTITLE="Biometrics Symposium 2006",
ADDRESS="Baltimore, Maryland, USA",
DAYS=19,
MONTH=sep,
YEAR=2006,
ABSTRACT="We present a multimodal approach for 3D face modeling and recognition from
two frontal and one profile view stereo images of the face. Once the images
are captured, the algorithm starts by extracting selected 2D facial
features from one of the frontal views and computes a dense disparity map
from the two frontal images. We then align a low resolution mesh model to
the selected features, adjust its vertices at the selected features and
along the profile line using the profile view, increase its vertices to a
higher resolution, and re-project them back on the frontal image. Using the
coordinates of the re-projected vertices and their corresponding
disparities, we capture and compute the 3D facial shape variations using
triangulation. The final result is a deformed 3D model specific to a given
subject’s face. Application of the model in 3D face recognition
validates the algorithm with a high recognition rate."
}

@TECHREPORT{Abde0610:Bridging,
AUTHOR="Fehmi Abdesslem and Luigi Iannone and Marcelo {de Amorim} and Katia
Obraczka and Ignacio Solis and Serge Fdida",
TITLE="Bridging the Gap between Theory and Practice in the Design of Wireless
Communication Protocols and Applications",
TYPE="arXiv report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0610078",
MONTH=oct,
YEAR=2006,
ABSTRACT="In wireless networks, bringing together theory and practice, i.e., going
all the way from designing a protocol or application, evaluating it
analytically and through simulations to having a working implementation, is
far from trivial. This is due especially to the challenges raised by the
spatially and time variant nature of the wireless channel. As a
consequence, wireless protocol research typically stops at the simulation
level when testing and evaluating solutions to the many problems raised by
wireless networks. In this
paper, we introduce Prawn (Prototyping Architecture for Wireless
Networks), an environment for rapid prototyping of wireless network
protocols. Prawn has been designed to provide: (i) a set of simple building
blocks that implement common functions needed by a wide range of wireless
protocols (e.g., neighbor discovery, link quality assessment, message
transmission and reception), and (ii) a standard API that allows protocol
designers easy access to the Prawn primitives. Prawn proves to be a simple,
yet powerful, tool to design wireless network protocols, as we showcase
through a number of examples. Prawn's performance is thoroughly evaluated,
stand-alone as well as in the context of
the various case studies.",
URL="http://arXiv.org/abs/cs/0610078"
}

@INPROCEEDINGS{Abde0611:Lowering,
AUTHOR="Charbel {Abdel Nour} and Catherine Douillard",
TITLE="On lowering the error floor of high order turbo {BICM} schemes over fading
channels",
BOOKTITLE="IEEE Globecom 2006 - Communications Theory",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="A new approach for the association of the well
known turbo codes to modulation schemes is presented. This
method is designed for flat fading channels. It presents the
advantage of lowering the error floor when compared to the
classical pragmatic turbo BICM approach. The improvement
in performance comes at the price of a relatively small added
complexity without sacrificing the iterative process
convergence. The proposed modifications address mainly the
modulator and the corresponding demodulator. In the light of
these modifications, new design guidelines are proposed for the
BICM interleaver. An improvement exceeding 0.75 dB is
observed at BER rates lower than 10-7 for turbo coded 16-QAM."
}

@INPROCEEDINGS{Abde0611:Measurement,
AUTHOR="Chehri Abdellah and Paul Fortier and Pierre-Martin Tardif",
TITLE="Measurement and modeling of line-of-sight {UWB} channel in underground
mines",
BOOKTITLE="IEEE Globecom 2006 - Communications Theory",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="The necessity for wireless communications in underground mines is well
understood. Some companies have started to deploy modern wireless system
networks in mine galleries with the objective of increasing safety and
productivity. In the last decade, ultra-wideband (UWB) technology has
gained much interest for its applications in wireless communications. A
number of UWB channel measurement have been published in the literature.
However, all these works treated environments such as office buildings,
residential or industrial. This paper reports on experimental results of
UWB channel characterization in underground mines. The communication
channel is still not well modelled in these environments. Important channel
parameters such as path loss exponent, shadow fading, spatial correlation,
small-scale fading, rms delay spread and mean excess delay are
investigated. This work has been carried out at the CANMET (Canadian Center
for Minerals and Energy Technology) experimental mine by the underground
communications research laboratory (LRCS) in Val-d'Or, Canada."
}

@INPROCEEDINGS{Abde0612:Application,
AUTHOR="Chehri Abdellah",
TITLE="Application of Ad-hoc sensor networks for localization in underground mines",
BOOKTITLE="8th Annual IEEE WIRELESS AND MICROWAVE TECHNOLOGY CONFERENCE",
ADDRESS="Clearwater, Florida, USA",
DAYS=4,
MONTH=dec,
YEAR=2006,
ABSTRACT="Underground mining is a hazardous industrial activity. The harsh physical
environment and distinct topology that make mining dangerous act as a
hindrance or constraint to the very techniques and technologies that could
improve safety and productivity. Workers safety is of paramount importance
and is certainly a moral obligation for any business. Wireless sensor
networks monitoring is an application that is very crucial for the safety
of mine workers. These sensors can monitor vital life signs of workers
which may be very useful during emergency situations. Localization and
tracking of moving objects is an essential capacity for a sensor network in
many applications. This paper studies the problem of localization in
underground mines using ad-hoc sensor networks. We use the DV-Hop algorithm
to estimate the distance between a mobile node and a fixed anchor and we
apply the bounding box technique to estimate the location."
}

@INPROCEEDINGS{Abde0612:Comparison,
AUTHOR="Chehri Abdellah",
TITLE="A comparison between different fhss techniques for use in a multiple access
secure wireless sensor",
BOOKTITLE="8th Annual IEEE WIRELESS AND MICROWAVE TECHNOLOGY CONFERENCE",
ADDRESS="Clearwater, Florida, USA",
DAYS=4,
MONTH=dec,
YEAR=2006,
ABSTRACT="A wireless sensor network is composed of a set of small sensor nodes
deployed in an ad hoc fashion that cooperate for sensing a physical
phenomenon (e.g., temperature, humidity, luminosity,…). Each sensor
node plays a dual role as a data
originator and a data router. Therefore a node is likely to communicate
with a varying number of its peers. Communications receivers in these
peer-to-peer networks must offer robust performance when receiving signals
from multiple
nodes and must offer resistance to hostile jamming and interferences. In
this paper, we analyse the performance of frequency hopping multiple access
for sensor networks. We use different type of detectors. The first is based
on the Fuzzy
Rank Order Detector (FROD), and the others are a conventional detector
using the Maximum Rank Sum Receiver (MRSR) and a Hard Decision Majority
Vote (HDMV) detector. We make a quantitative comparison between the three
detectors in terms of error probability for wireless sensor networks."
}

@INPROCEEDINGS{Abde0612:Geolocation,
AUTHOR="Chehri Abdellah",
TITLE="Geolocation for {UWB} Networks in underground mines",
BOOKTITLE="8th Annual IEEE WIRELESS AND MICROWAVE TECHNOLOGY CONFERENCE",
ADDRESS="Clearwater, Florida, USA",
DAYS=4,
MONTH=dec,
YEAR=2006,
ABSTRACT="Ultra Wideband technology is regarded by many as one of the future key
technologies in communications and positioning. Even though the basic
principles of UWB have been studied for decades, there is still a great
demand for research,
especially in the field of precise local positioning. Techniques have to
be further developed to cope with for example varying line of sight (LOS) /
non line of sight (NLOS) or severe multipath conditions. In this paper we
give an experimental measurement and modeling of ultra wideband radio
propagation in underground mines for indoor geolocation. This work was
carried out by the underground communications research laboratory LRCS, and
the CANMET (Canadian Center for Minerals and Energy Technology)
experimental mine in Val-d’Or, Canada."
}

@INPROCEEDINGS{Abdo0605:Test,
AUTHOR="Jamal Abdo and Nicolas Georganas and Hussein Mouftah",
TITLE="Test-bed for Sensor Network Management Protocols",
BOOKTITLE="23rd Queen's Biennial Symposium on Communications",
ADDRESS="Kingston, Ontario, Canada",
DAYS=29,
MONTH=may,
YEAR=2006,
ABSTRACT="An implementation of a sensor network test-bed is presented in this paper.
This test-bed will be used for performance benchmarking of existing and
novel management protocols. The sensor networks are unique as much as they
are common. From one point of view, we see that sensor networks share many
attributes with other networks having the same architecture or
communication type. Thus a study of sensor networks can not but overlap
with other areas of research. From another point of view, there are certain
characteristics of sensor networks that differentiate them from others such
as the high density of sensor nodes that can surpass the 20 nodes/m3 in
some of the cases and lead to the need for appropriate management protocols
for cooperation of these nodes. This paper deals with building a test-bed
using Mica2 sensor nodes from Crossbow Technology. It consists of a PC
which manages the network through Sensor Management Graphical User
Interface (GUI) and communicates with the sensor nodes through a Base
Station, which is implemented by combining a FPGA-based Nios II Development
kit, Cyclone Edition serially connected to a MIB510 equipped with a MICA2
node with ID0."
}

@INPROCEEDINGS{Abdr0606:Position,
AUTHOR="Atef Abdrabou and Weihua Zhuang",
TITLE="A {Position-Based} {QoS} Routing Scheme for {UWB} {Ad-Hoc} Networks",
BOOKTITLE="ICC 2006  Wireless Ad Hoc and Sensor Networks",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Ultra-wideband (UWB) wireless communication is a promising spread spectrum
technology that supports very high data rates and provides precise position
information of mobile users. In this paper, we present a position-based
quality-of-service (QoS) routing scheme for UWB ad-hoc networks. The scheme
applies call admission control and temporary bandwidth reservation for
discovered routes, taking into consideration the medium access control
(MAC) interactions. Via cross-layer design, it exploits UWB advantages by
using the position information in routing and bandwidth reservation.
Simulation results demonstrate that the proposed routing scheme is
effective in end-to-end QoS support."
}

@INPROCEEDINGS{Abdu0605:Fast,
AUTHOR="Nuraini AbdulRashid and Rosni Abdulla and Abdullah Zawawi Haji Talib
AbdullahZawawi and Zalila Ali Ali",
TITLE="Fast Dynamic Programming Based Sequence Alignment Algorithm",
BOOKTITLE="Second International Conference on Distributed Frameworks for Multimedia
applications",
DAYS=14,
MONTH=may,
YEAR=2006,
ABSTRACT="Abstract Protein Sequence Alignment is the basic operation mostly used in
protein sequence analysis. The most optimal algorithm used in sequence
alignment is dynamic programming method. Smith-Waterman algorithm
(Smith-Waterman, 1981) is the most commonly used dynamic programming based
sequence alignment. However the algorithm uses quadratic time and space.
Heuristic algorithm such as FASTA (Pearson and Lipman ,1988)and BLAST
(Altschul et. al., 1990) introduced to speed up the sequence alignment
algorithm. FASTA is based on word search whereas BLAST is based on Maximum
Segment Pairs. In word search algorithm, lists of words from the query and
database sequence are being compared to determine if two sequences have a
region of sufficient similarity to merit further alignment using
Smith-Waterman Algorithm. All the different algorithms use the
substitutions matrix based on the twenty alphabet amino acids. However
research (Regan and Degrado, 1998; Kamtekear et al., 1993; Davidson et
al.,1995;Riddle et al.,1997) showed that reducing the number of amino acids
to 10 did not affect the similarity measure. Our proposed algorithm used
the reduced amino acids alphabet to transform the protein sequences into a
sequence of integer and uses n-gram to reduce the length of the sequence.
Then Smith-Waterman algorithm is then used to get the similarity measure
between two sequences. Results show that the new proposed algorithm is as
sensitive as the Smith-Waterman algorithm yet uses less space and performs
better."
}

@INPROCEEDINGS{Abdu0611:Dealing,
AUTHOR="Kulsoom Abdullah and John Copeland",
TITLE="Dealing with high alarm count in {IDS} {RainStorm}",
BOOKTITLE="VizSEC 2006 - Effective Internet Security Situational Awareness",
ADDRESS="FairFax County, Virginia, USA",
DAYS=3,
MONTH=nov,
YEAR=2006,
ABSTRACT="We developed a tool to help network administrators deal with the large
amount of alarms generated from network security
appliances.  It efficiently uses screen space representing a high number
of IP addresses along
with time sequence so that general alarm activity for a network can be
visualized along with details, if desired. 
The tool was useful but encountered problems when there was a significant
increase in the amount of alarms.  Some of the
issues that resulted are addressed in this paper along with methods
implemented to tackle them.  Results from our user
feedback are given along with potential future work."
}

@INPROCEEDINGS{Abe0604:Comparison,
AUTHOR="Tetsushi Abe and Gerhard Bauch",
TITLE="Comparison of {MIMO} Receivers: From {APP} or {MMSE} ?",
BOOKTITLE="4 th International Symposium on Turbo Codes in connection with 6th
International ITG-Conference on Source and Channel Coding",
ADDRESS="Munich, Germany",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="Reduced-complexity a posteriori probability (APP) and minimum mean-square
error (MMSE) with interference cancellation (IC) are two promising
techniques to design a receiver for multiple-input and multiple-output
(MIMO) systems with spatial multiplexing. An aim of this paper is to
clarify which of the two approaches can achieve better
performance-complexity trade-off in MIMO/OFDM transmission. For this aim,
we conduct a comparison of several MIMO receivers based on these approaches
in terms of performance and computational complexity. Computer simulation
results show that both approaches lead to similar performance with
comparable complexity for QPSK and 16QAM modulation. However, the reduced
complexity APP detection structure would be more flexible because its
complexity and performance can be adjusted parametrically by varying the
number of candidate symbol vectors."
}

@INPROCEEDINGS{Abed0601:Non,
AUTHOR="Kambiz Abedi and Vahid Ahmadi and Mohammad Kazem {Moravvej Farshi} and
Mohammad Hossein Sheikhi and Farzan Gity",
TITLE="Non-physical Model of Lossy Transmission Line for Circuit Modeling of
Segmented Traveling Wave Electroabsorption Modulators",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="A HSPICE equivalent-circuit model for analyzing the frequency response of
segmented traveling wave electroabsorption modulators (STEAM) is presented.
This model is based on non-physical model for lossy transmission line. The
analysis indicates that STEAM can achieve much wider bandwidth than the
lumped electroabsorption modulator (LEAM) and TWEAM counterparts, with a
small penalty in E/O conversion gain, if low loss passive optical waveguide
is available."
}

@INPROCEEDINGS{Abed0603:Low,
AUTHOR="Mohammed Abedin and Mohammod Ali",
TITLE="A Low Profile Dipole Antenna Backed by a Planar {EBG} Structure",
BOOKTITLE="2006 IEEE International Workshop on Antenna Technology:  Small Antennas and
Novel Metamaterials",
ADDRESS="White Plains, Nw York",
DAYS=6,
MONTH=mar,
YEAR=2006,
ABSTRACT="A low-cost smaller unit-cell planar EBG structure operating at the lower
GHz frequencies (below 6 GHz) is proposed. A numerical simulation model is
developed to predict the reflection phase stopband of such structures. A
highly directional dipole antenna placed on top of our proposed planar EBG
structure with an overall height of 0.02 lambda is demonstrated."
}

@INPROCEEDINGS{Abed0604:New,
AUTHOR="Ali Abedi and Amir K. Khandani",
TITLE="A New Method for Performance Evaluation of Bit Decoding Algorithms Using
Statistics of the Log Likelihood Ratio",
BOOKTITLE="4 th International Symposium on Turbo Codes in connection with 6th
International ITG-Conference on Source and Channel Coding",
ADDRESS="Munich, Germany",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="This paper presents a new method for the performance evaluation of bit
decoding algorithms. The method is based on estimating the Probability
Density Function (pdf) of the bit Log Likelihood Ratio (LLR) by using an
exponential model. It is widely known that the pdf of the bit LLR is close
to the normal density. The proposed approach takes advantage of this
property to present an efficient algorithm for the pdf estimation. The
moment matching method is combined with the maximum entropy principle to
estimate the underlying parameters. We present a simple method for
computing the probabilities of the point estimates for the estimated
parameters, as well as for the bit error rate. The corresponding results
are used to compute the number of samples that are required for a given
precision of the estimated values. It is demonstrated that this method
requires significantly fewer samples as compared to the conventional
Monte-Carlo simulation."
}

@INPROCEEDINGS{Abei0612:MobiSplit,
AUTHOR="Julien Abeillé and Rui Aguiar and Telemaco Melia and Patrick Stupar and
Ignacio Soto",
TITLE="{MobiSplit:} a scalable approach to emerging mobility networks",
BOOKTITLE="The First IEEE/ACM International Workshop on Mobility in the Evolving
Internet Architecture",
ADDRESS="San Francisco, California, USA",
DAYS=1,
MONTH=dec,
YEAR=2006,
ABSTRACT="This paper presents a novel architecture, MobiSplit, to manage mobility in
future IP based networks. The proposed architecture separates mobility
management in two levels, local and global, that are managed in completely
independent ways. The paper describes the flexibility advantages that this
architecture brings to operators, and how it is appropriate for the current
trend to multiple and very different access providers and operators.
Heterogeneity, support for seamless handovers and multihoming, and
scalability issues are analyzed in the paper."
}

@INPROCEEDINGS{Abel0604:SAMIE,
AUTHOR="Jaume Abella and Antonio Gonzalez",
TITLE="{SAMIE-LSQ:} {Set-Associative} {Multiple-Instruction} Entry {Load/Store}
Queue",
BOOKTITLE="20th IEEE International Parallel \& Distributed Processing Symposium",
ADDRESS="Rhodes Island, Greece",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="The load/store queue (LSQ) is one of the most complex parts of contemporary
processors. Its latency is critical for the processor performance and it is
usually one of the processor hotspots. This paper presents a highly banked,
set-associative, multiple-instruction entry LSQ (SAMIE-LSQ) that achieves
high performance with small energy requirements. The SAMIE-LSQ classifies
the memory instructions (loads and stores) based on the address to be
accessed, and groups those instructions accessing the same cache line in
the same entry. Our approach relies on the fact that many in-flight memory
instructions access the same cache lines. Each SAMIE-LSQ entry has space
for several memory instructions accessing the same cache line. This
arrangement has a number of advantages. First, it significantly reduces the
address comparison activity needed for memory disambiguation since there
are less addresses to be compared. It also reduces the activity in the data
TLB, the cache tag and cache data arrays. This is achieved by caching the
cache line location and address translation in the corresponding SAMIE-LSQ
entry once the access of one of the instructions in an entry is performed,
so instructions that share an entry can reuse the translation, avoid the
tag check and get the data directly from the concrete cache way without
checking the others. Besides, the delay of the proposed scheme is lower
than that required by a conventional LSQ. We show that the SAMIE-LSQ saves
82\% dynamic energy for the load/store queue, 42\% for the L1 data cache
and 73\% for the data TLB, with a negligible impact on performance (0.6\%)."
}

@INPROCEEDINGS{Aber0604:Miniature,
AUTHOR="Lyazid Aberbour and Christophe Craeye and Danielle Vanhoenacker",
TITLE="Miniature bent folded planar monopole antenna",
BOOKTITLE="LAPC - Loughborough Antennas \& Propagation Conference",
ADDRESS="Burleigh Court Conference Centre, Loughborough University",
DAYS=11,
MONTH=apr,
YEAR=2006,
ABSTRACT="This paper introduces a miniature planar bent folded monopole antenna,
designed for Wireless Local Area Network (WLAN) applications in the
Industrial Scientific and Medical (ISM) 2.45 GHz band. The proposed antenna
occupies an area as small as 0.74 cm2 , corresponding to"
}

@INPROCEEDINGS{Abia0609:How,
AUTHOR="Ramzi Abiantun and Marios Savvides and Vijayakumar Bhagavatula",
TITLE="How Low Can You Go? Low Resolution Face Recognition Study Using Kernel
Correlation Feature Analysis on {FRGC} dataset",
BOOKTITLE="Biometrics Symposium 2006",
ADDRESS="Baltimore, Maryland, USA",
DAYS=19,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper we analyze the effect of varying the image resolution of the
FRGC dataset and the resulting performance on our Kernel Correlation
Feature Analysis (KCFA) method. Examining performance on low-resolution
image data is an important practical aspect of any face recognition system
such as surveillance footage, where the resolution of face images is
typically very low. We show that our algorithm works reliably even at very
low resolutions on the FRGC dataset experiment 4 using the pure one-to-one
matching protocol (greater than 70\% verification at 0.1\%FAR). We show
reasonable performance is still possible with resolution as low as 16x16
face images. However performance degrades significantly afterwards, but
still outperforms the PCA baseline algorithm of 12\% at 0.1\% FAR."
}

@INPROCEEDINGS{Abic0606:Scalable,
AUTHOR="Zakhia Abichar and J. Morris Chang and Daji Qiao",
TITLE="A Scalable {MAC} Protocol for {Next-Generation} Wireless {LANs}",
BOOKTITLE="IEEE Symposium on a World of Wireless, Mobile and Multimedia Networks
(WoWMoM 2006)",
ADDRESS="Buffalo, Niagara Falls, USA",
DAYS=26,
MONTH=jun,
YEAR=2006,
ABSTRACT="Recently, there has been extensive research interest in increasing the data
rates supported by IEEE 802.11 WLANs (Wireless LANs). For this purpose,
IEEE 802.11 formed TGn (Task Group~N) to produce standard specifications
for high-data-rate WLANs while maintaining the inter-operability with
legacy 802.11 devices. The legacy 802.11 MAC does not scale well when the
network size increases due to large number of collisions. In addition, the
802.11 MAC does not scale with high data rates due to the large control
overhead. In this paper, we propose a new scalable MAC protocol, called
gMAC, under which (1) stations are grouped based on their locations such
that groups are free of hidden nodes. Each group has a group leader and
only group leaders contend on behalf of stations in their group, thus
achieving scalability with respect to network size; (2) once a group leader
wins the contention, it polls stations within its group, which can then
transmit in a contention-free, hidden-node-free environment, thus reducing
overhead and achieving scalability with respect to data rates. The proposed
gMAC protocol mitigates the hidden nodes problem and is inter-operable with
legacy 802.11 devices. Simulation results show that gMAC achieves high
throughput for high data rates and large network size."
}

@INPROCEEDINGS{Aboa0608:Pathlet,
AUTHOR="Olusegun Aboaba",
TITLE="Pathlet: A new wavelet for resolving the constituent components in a
multipath channel",
BOOKTITLE="12th Asia-Pacific Conference on Communications",
ADDRESS="Busan, Republic of Korea",
DAYS=31,
MONTH=aug,
YEAR=2006,
ABSTRACT="This paper presents the construction of a novel set of finite filter
coefficients with symmetric impulse response, resulting in the development
of a wavelet family which is named Pathlet, for use in multipath channel
parameter estimation. It makes use of digital filter design techniques. The
generated Pathlet family is subsequently used as analyzing wavelets in the
resolution of constituent multipath components in simulated multipath delay
profiles. In particular, it is shown that the new wavelet family can be
successfully used to resolve the different paths in a multipath delay
profile."
}

@INPROCEEDINGS{Aboe0604:Wireless,
AUTHOR="Emad Aboelela and William Edberg and Christos Papakonstantinou and Vinod
Vokkarane",
TITLE="Wireless Sensor Network Based Model for Secure Railway Operations",
BOOKTITLE="First International Workshop on eSafety and Convergence of Heterogeneous
Wireless Networks (eSCo-Wi)",
ADDRESS="Phoenix, Arizona",
DAYS=10,
MONTH=apr,
YEAR=2006,
ABSTRACT="The current state of the art in detecting immediate and long-term railway
track problems involves both inspectors walking the track lines and train
cars instrumented with accelerometers and ultrasonic sensors that are
capable of detecting wear of the rail and breakages. Additionally, a
widespread practice of sensing rail continuity by using the tracks to
complete simple circuits is in place. In this paper, we propose a
fundamentally different approach to improve the current practices in
railway operations using wireless sensor network (WSN). The primary
technical and scientific objectives of the system introduced in this paper
are to generate innovative solutions for a number of the issues facing the
railroad community through the development of a system based on WSN. The
objectives from a railroad perspective include finding new approaches to
reduce the occurrence rate of accidents and improving the efficiency of
railroad maintenance activities."
}

@INPROCEEDINGS{Aboe0606:Reliability,
AUTHOR="Hosam Aboelfotoh and Ehab Elmallah and Hossam Hassanein",
TITLE="On The Reliability of Wireless Sensor Networks",
BOOKTITLE="ICC 2006  Wireless Ad Hoc and Sensor Networks",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="In wireless sensor networks (WSN), reliable monitoring of a phenomenon (or
event detection) depends on the collective data provided by the target
cluster of sensors and not on any individual node. In this paper we define
a WSN reliability measure that considers the aggregate flow of sensor data
into a sink node (gateway or cluster head). Given an estimation of the data
generation rate and the failure probability of each sensor, we formulate
the reliability measure and show that computing this measure for an
arbitrary WSN is #P-hard. We present an exponential algorithm for arbitrary
WSN. We then consider some special cases where we can either compute or
approximate (bound) the reliability using an efficient algorithm. Finally,
we present some numerical results that demonstrate some of the applications
of our algorithms. Reliability evaluation tools are important in the
context of design and analysis of sensitive information gathering sensor
networks."
}

@INPROCEEDINGS{Abou0604:Multilevel,
AUTHOR="Amine Abou-Rjeili and George Karypis",
TITLE="Multilevel Algorithms for Partitioning {Power-Law} Graphs",
BOOKTITLE="20th IEEE International Parallel \& Distributed Processing Symposium",
ADDRESS="Rhodes Island, Greece",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="Graph partitioning is an enabling technology for parallel processing as it
allows for the effective decomposition of unstructured computations whose
data dependencies correspond to a large sparse and irregular graph. Even
though the problem of computing high-quality partitionings of graphs
arising in scientific computations is to a large extent
well-understood,this is far from being true for emerging HPC applications
whose underlying computation involves graphs whose degree distribution
follows a power-law curve. This paper presents new multilevel graph
partitioning algorithms that are specifically designed for partitioning
such graphs. It presents new clustering-based coarsening schemes that
identify and collapse together groups of vertices that are highly
connected. An experimental evaluation of these schemes on 10 different
graphs show that the proposed algorithms consistently and significantly
outperform existing state-of-the-art approaches."
}

@INPROCEEDINGS{Abou0604:Mutual,
AUTHOR="Abdulla Abouda and Hassan El-Sallabi and Gustav Haggman",
TITLE="Mutual Coupling Effect on Capacity of {MIMO} Wireless Channels in High
{SNR} Scenario",
BOOKTITLE="LAPC - Loughborough Antennas \& Propagation Conference",
ADDRESS="Burleigh Court Conference Centre, Loughborough University",
DAYS=11,
MONTH=apr,
YEAR=2006,
ABSTRACT="Results on the effect of mutual coupling on capacity of multiple-input
multiple-output (MIMO) wireless channels are presented with particular
emphasis on the case of high signal to noise ratio (SNR) scenario. It is
shown that the effect of mutual coupling on MIMO channel capacity can be
positive or negative depending on the channel correlation properties in
absence of coupling effect and the characteristics of the receiver and
transmitter mutual coupling correlation matrices."
}

@INPROCEEDINGS{Abou0605:Enable,
AUTHOR="Omar Abouabdalla",
TITLE="Enable communications between the {RSW} control criteria and {SIP} using
{R2SP}",
BOOKTITLE="Second International Conference on Distributed Frameworks for Multimedia
applications",
DAYS=14,
MONTH=may,
YEAR=2006,
ABSTRACT="Various standards organizations have considered signaling for voice and
video over IP from different approaches. There are currently more than one
standard for signaling and control of Internet telephone calls. Some of
them, which widely used are RSW control protocol and the IETF Session
Initiation Protocol (SIP). Both protocols provide comparable functionality
using different mechanisms and provide similar quality of service. Although
there are numerous industry debates about the merits of the two protocols,
the truth is that both of them, along with other complementary protocols,
are necessary to provide universal access and to support IP-based enhanced
services. Both protocols have been widely deployed, so interworking between
RSW and SIP is essential to ensure full end-to-end connectivity. Because of
the inherent differences between RSW and SIP, accommodation must be made to
allow interworking between the two protocols. The work reported in this
paper proposes a communication translation protocol to bridge the RSW
control protocol and SIP control protocol. This communication translation
protocol has to provide a set of rules to enable communications between the
RSW control criteria and SIP standards. The communication translation
entity defined can be called translator server."
}

@INPROCEEDINGS{Abou0606:BENCHManet,
AUTHOR="Mohamed {Abou El Saoud} and Samy Mahmoud and Thomas Kunz",
TITLE="{BENCHManet:} An Evaluation Framework for Service Discovery Protocols in
{MANET}",
BOOKTITLE="International Workshop on Wireless Ad Hoc and Sensor Networks",
DAYS=28,
MONTH=jun,
YEAR=2006,
ABSTRACT="In the world of wireless ad-hoc networking, the problem of service
discovery is essential and important in order to detect and access services
between mobile computers. This has hence led to the advent of numerous
Service Discovery Protocols (SDPs). We recognize the need for a legitimate
framework for the qualitative and quantitative evaluation of SDPs in mobile
networking contexts such Mobile Ad Hoc Networks (MANETs). This paper
presents Benchmark for MANET (BENCHManet), an initiative development of a
comprehensive and sophisticated benchmark composed of reference tests, each
of which reflects the configuration found in various realistic MANET
applications. The presented benchmark allows for a more practical and
comprehensive evaluation, as well as a fair comparison of SDPs."
}

@INPROCEEDINGS{Abou0609:Amplify,
AUTHOR="Chadi Abou-Rjeily and Norbert Daniele and Jean-Claude Belfiore",
TITLE="{Amplify-and-Forward} Cooperative Diversity with {Space-Time} Coded {UWB}
Systems",
BOOKTITLE="International Conference on Ultra Wideband 2006",
ADDRESS="Westin Hotel, Waltham, Massachusetts",
DAYS=24,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper, we examine the impact of spatial diversity on ultra wideband
(UWB) systems. This diversity is exploited by deploying two antennas at the
UWB terminals. For single-antenna systems, spatial diversity is exploited
in a distributed manner where a neighboring node can help the source in
delivering its message to a destination. In particular, two space-time (ST)
coding schemes are proposed. The first one is optimal among all
totally-real codes having a constant transmitted energy per antenna. Unlike
the classical approach of constructing ST codes over infinite fields, the
second construction takes the structure of 2-dimensional constellations
into consideration in order to propose an appropriate modulation-specific
code. These schemes are associated with multi-antenna arrays and with
virtual arrays based on the amplify-and-forward (AF) strategy."
}

@INPROCEEDINGS{Abou0609:Decode,
AUTHOR="Chadi Abou-Rjeily and Norbert Daniele and Jean-Claude Belfiore",
TITLE="On the {Decode-and-Forward} Cooperative Diversity with Coherent and
{Non-Coherent} {UWB} Systems",
BOOKTITLE="International Conference on Ultra Wideband 2006",
ADDRESS="Westin Hotel, Waltham, Massachusetts",
DAYS=24,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper, we extend the Decode-and-Forward cooperative
diversity scheme to the context of impulse radio ultra-wideband
(IR-UWB). We develop coherent and non-coherent schemes to exploit
the spatial diversity in a distributed manner among the different
terminals of a wireless network. These schemes are specific to
IR-UWB and they take advantage of the pulse repetitions used to
convey each information symbol. If N\_f is the number of pulses per
symbol, the coherent scheme is based on joint symbol and pulse
coding and achieves full diversity with any number of relays for
N\_f>1. The non-coherent scheme is based on pulse coding and
achieves full diversity with a maximum number of N\_f-1 relays."
}

@INPROCEEDINGS{Abou0609:Diversity,
AUTHOR="Chadi Abou-Rjeily and Norbert Daniele and Jean-Claude Belfiore",
TITLE="{Diversity-Multiplexing} Tradeoff of {Single-Antenna} and {Multi-Antenna}
Indoor {Ultra-Wideband} Channels",
BOOKTITLE="International Conference on Ultra Wideband 2006",
ADDRESS="Westin Hotel, Waltham, Massachusetts",
DAYS=24,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper, we study the achievable diversity-multiplexing gain
(D-MG) tradeoffs over the IEEE 802.15.3a channel model. In
particular, we give an exact expression of the D-MG tradeoff for
single antenna systems. This expression is based on a statistical
model of the integrated energy of the considered channels. At a
second time, we evaluate lower and upper bounds on the D-MG
tradeoffs of multi-antenna systems. This formulation gives us more
insights on the real potential of multi-antenna techniques with UWB
systems. It is shown that even though the asymptotical diversity
gain has an infinite value, the multi-antenna techniques can be very
beneficial in the practical range of signal-to-noise ratios"
}

@INPROCEEDINGS{Abou0609:Hybrid,
AUTHOR="Elias Aboutanios and Bernard Mulgrew",
TITLE="A Hybrid {STAP} Approach for Radar Target Detection in Heterogeneous
Environments",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="We address the problem of radar target detection under clutter
heterogeneity. Traditional approaches, or two-data set (TDS) algorithms,
require a training data set in order to estimate the interference
covariance matrix and implement the adaptive lter. When the training data
exhibits statistical heterogeneity with respect to the test data, the TDS
detectors su er from a degradation in their performance. The singledata set
(SDS) detectors have been proposed to deal with this problem by operating
solely on the test data. In this paper, we propose a novel hybrid approach
that combines the SDS and TDS algorithms, taking the degree of
heterogeneity into account. We derive the hybrid detectors and propose the
use of the generalised inner product as a heterogeneity measure. We also
give expressions for their probabilities of false alarm and detection under
heterogeneous assumptions. Simulation results show that new detectors
outperform the other algorithms both in homogeneous and heterogeneous
interfere"
}

@INPROCEEDINGS{Abra0601:AGC,
AUTHOR="Rajesh {Joseph Abraham}",
TITLE="{AGC} of a Hydrothermal System with {SMES} unit",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="In this paper, the AGC improvement of a two area interconnected
hydrothermal system along with a Superconducting Magnetic Energy Storage
(SMES) unit is proposed. Generation Rate Constraints are also considered.
Integral Squared Error (ISE) technique is used to obtain the optimum values
of the integral gain settings. Analysis reveals that the dynamic responses
are considerably improved in the presence of the SMES unit. A comparison
and analysis of the dynamic performances without and with SMES unit in the
presence of GRC brings out the superior performance of the SMES unit in
suppressing the frequency and inter-area tie-power deviations from their
nominal values followed by a step load disturbance."
}

@INPROCEEDINGS{Abra0604:Kinetic,
AUTHOR="Zoe Abrams and Ho-Lin Chen and Leonidas Guibas and Jie Liu and Feng Zhao",
TITLE="Kinetically Stable Task Assignment for Networks of Microservers",
BOOKTITLE="Fifth International Conference on Information Processing in Sensor Networks",
ADDRESS="Nashville, TN",
DAYS=19,
MONTH=apr,
YEAR=2006,
ABSTRACT="This paper studies task migration in a network of resource constrained
servers (called \emph{microservers}). A task is an abstraction of a moving
physical object or phenomenon that we are interested in monitoring, such as
a vehicle, and the microserver is a computational device that can receive
sensor data pertaining to the object of interest. Due to motion, the
microservers that can observe a particular task change over time and there
is overhead involved in migrating tasks among microservers. Furthermore,
communication, processing, or memory constraints, allow a microserver to
only serve a limited number of tasks at the same time. Our overall goal is
to allocate tasks to microservers so as to minimize the number of
migrations, while guaranteeing that as many tasks as possible are monitored
at all times. When the task trajectories are known in advance, we show that
this problem is NP-Complete (even over just two time steps), has an
integrality gap of at least $2$, and can be solved optimally in polynomial
time if we allow tasks to be assigned fractionally. When only probabilistic
information about future movement of the tasks is known, we propose two
algorithms: a multi-commodity flow based algorithm and a maximum matching
algorithm. We use simulations to compare the performance of these
algorithms against the optimum task allocation strategy."
}

@INPROCEEDINGS{Abre0611:Accurate,
AUTHOR="Giuseppe Abreu",
TITLE="Accurate Simulation of Piecewise Continuous Arbitrary Nakagami-$m$ Phasor
Processes",
BOOKTITLE="IEEE Globecom 2006 - Communications Theory",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="The accurate simulation of piecewise continuous complex-valued (phasor)
Nakagami-$m$ random processes with arbitrary fading figure is considered.
Two solutions to the problem are discussed. The first is based on the
decomposition of the process with arbitrary $m$ onto a pair a process with
positive integer and half-integer $m$, and derives from the extension of a
known technique to the case of complex-valued Nakagami-$m$ processes. The
second is a entirely novel method based on the random mixture of
Nakagami-$m$ processes with positive integer and half-integer $m$ with
mixture probability computed from the joint (envelope and phase) $n$-th
moments of the Nakagami-$m$ processes, which is also derived exactly and in
closed-form, for all $n,m$ and $\Omega$. The proposed random mixture method
is far superior to the decomposition method not only in terms of accuracy
of envelope and phase pdfs, but also in terms of higher order statistics.
The random mixture method has yet the additional advantage of being less
computationally demanding."
}

@INPROCEEDINGS{Abu-0610:Application,
AUTHOR="Nael Abu-Ghazaleh and Kyoung-Don Kang and E. Sabbah {E. Sabbah}",
TITLE="An {Application-Driven} Perspective on Wireless Sensor Network Security",
BOOKTITLE="2nd ACM International Workshop on QoS and Security for Wireless and Mobile
Networks",
ADDRESS="Torremolinos, (Malaga), Spain",
DAYS=2,
MONTH=oct,
YEAR=2006,
ABSTRACT="E. Sabbah or dangerous. Wireless sensors have limited energy and
computational Wireless sensor networks (WSNs) have recently attracted
capabilities, making many traditional security methodolo- a lot of interest
from b oth academia and industry due to gies di\fficult or imp ossible
to utilize. Also, they are often the numerous applications they enable in a
wide range of deployed in op en areas, allowing physical attacks such as
areas. Unfortunately, WSNs are exp osed to numerous secu- jamming or node
capture and tamp ering. To address the rity threats that can adversely
a\ffect the success of imp or- problem, a lot of research work
including (but are not lim- tant applications. Securing WSNs is challenging
due to their ited to) [27, 13, 19, 17, 16, 21, 28, 35, 7, 6, 31, 8, 5, 29]
have unique nature as an application and a network, and due to recently b
een done to make WSNs more secure. Although their limited capabilities. In
this pap er, we argue that the their contributions are invaluable, most
existing work do not WSN security research generally considers mechanisms
that provide any guidelines to help application designers or de- are often
modeled after and evaluated against abstract ap- velop ers to choose
appropriate security mechanisms for their plications and WSN organizations.
Instead, we prop ose that applications (or help them sp ecify the required
new security an e\ffective solution for WSNs must b e sensitive to
the ap- schemes for the applications). plication. We prop ose to consider
the application-sp eci\fic The main premise of this pap er is that
the large variety security context as the combination of a p otential
attackers of application typ es and conditions in which WSNs op erate (exp
ected) motivation and vulnerability that is a function make it
di\fficult to discuss security without an application- of the
application and a function of the WSN infrastructure, sp eci\fic
context. It is known that security is not only a protocols, and the
accessibility to the deployed sensors, re- technical problem. For example,
the integral relationships sp ectively. To reduce the vulnerability, we
argue that WSN b etween economics and security [24]/privacy [25] and the
design must balance traditional ob jectives such as energy implications on
system design in traditional systems are ac- e\fficiency, cost, and
application level p erformance with se- cepted. Given the wide range of WSN
applications with curity to a degree prop ortional to the attackers
motivation. di\fferent levels of imp ortance, scale, and structure,
keeping We illustrate this argument via four example applications. these
relationships in mind is essential. We present this ap- plication driven p
ersp ective in more detail in Section 2. In this pap er, we argue that the
design of secure WSNs should consider the application-speci\fic
security context. Fur- ther, the set of assumptions made by security
research in WSNs must be closely tied to the target application. Our
contribution is to suggest a set of factors that can b e used to formalize
this security relevant context and show how they apply to di\fferent
applications. These factors include the environment in which the
application runs, expected threats in the environment, criticality of
sensor data, expected gain of an attack, and the scale of the WSN to be
deployed. Our hop e is that this work will b e a step towards
de\fining rea- sonable WSN security scenarios and enabling WSN
security research with grounded and realistic assumptions. Most existing
WSN security work consider an abstract sensor network and select
assumptions and organizations that are decoupled from application details.
Much of the other work in WSN security tend to consider one or more
theoretic vulnerabilities of an abstract sensor network model, rarely
considering application-sp eci\fic security threats and requirements.
A review of existing work on WSN security is given in Section 3.1 We argue
that this existing work"
}

@INPROCEEDINGS{Abua0604:Throughput,
AUTHOR="Ibrahim Abualhaol and Mustafa Matalgah",
TITLE="Throughput Optimization of Cooperative {UAVs} Using Adaptive Channel
Assignment",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Services and
applications",
ADDRESS="Las Vegas, NV, USA",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="The wireless link represents the bottleneck in the communication of a group
of cooperative unmanned airborne vehicles (UAVs). Due to the high speed of
the UAVs, the nature of the environments where they are usually deployed
and the possible intentional jamming that might exist, the effect of
phenomena such as multipath propagation and Doppler spread is more
pronounced. In this paper, we propose an adaptive channel assignment (ACA)
strategy for allocating the available bandwidth, which is divided into a
number of sub-channels, over a number of communications links in a network
of UAVs. The proposed ACA algorithm has two main advantages over the static
channel assignment (SCA) approach. First, it maximizes the overall
throughput of the UAVs network and second, it significantly reduces the
probability of outage in the system defined as the percentage of time the
links are incapable of supporting a minimum required transmission rate that
is determined by the application. The ACA approach is formulated in terms
of a binary optimization problem that is solved using the branch-and-bound
method. We assume that the links in the network are Rayleigh faded, and we
use a finite state Markov chain (FSMC) for modeling the channels state
transitions. Using Monte Carlo simulations, we show that the proposed
channel assignment approach provides a significant gain in the overall
throughput and reduction in the outage probability compared to the SCA."
}

@INPROCEEDINGS{AbuA0611:Statistical,
AUTHOR="Najah {Abu Ali} and Hossam Hassanein",
TITLE="Statistical Delay Budget Partitioning in Wireless Mesh Networks",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Wireless Mesh Networks (WMNs) attracted researchers attentions since
WMNs can support multimedia applications with real time transport
for last mile Internet access. The multimedia transmission require
Quality of Service (QoS) guarantees for end-to-end transmission
delay, delay jitter, packet loss and flow rate, which is a non
trivial task. Mapping the end to end QoS requirements into link QoS
requirements is an important step for providing QoS in WMNs. In
spite of the fact that this problem is not addressed in multihop
wireless networks, different algorithms are proposed to solve the
problem of end-to-end QoS partitioning in connection oriented wired
networks. However, these algorithms are near optimal or heuristic
algorithms and provide a solution for just a single end-to-end QoS
requirement. In this paper, we propose a partitioning algorithm,
which is capable of partitioning multiple end-to-end QoS
requirements simultaneously. We define the QoS as the pair of the
required end-to-end delay and the violation probability of meeting
the required end-to-end delay. Our approach is motivated by
experiments which conclude that the delay probability distribution
is accurately characterized by a gamma distribution. This conclusion
is used to formulate a mathematical linear programm that optimally
partitions the end-to-end delay and the logarithm of the end-to-end
violation probability into the link delays and the logarithm of the
link violation probabilities. Extensive simulation verified the
effectiveness of the algorithm compared to two QoS partitioning
algorithms. The proposed algorithm outperforms the other algorithms
for loose and stringent QoS requirements and over different path
lengths."
}

@INPROCEEDINGS{Abue0601:Bridging,
AUTHOR="Omar Abuelmaatti and Madjid Merabti and Bob Askwith and Anirach Mingkhwan",
TITLE="A Bridging Architecture for Wireless Networked Appliances",
BOOKTITLE="International Symposium on Wireless Pervasive Computing 2006",
ADDRESS="Phuket, Thailand",
DAYS=16,
MONTH=jan,
YEAR=2006,
ABSTRACT="The ultimate objective of networking is to enable the provision and
interaction of network services. Therefore, any effort that addresses
interworking in any layer should consider the enhancement of the way
services are provided to the end user. To be able to realise such a vision
in the networked appliances and home networking domain and indeed in any
domain, a common interworking layer needs to be adopted. This can best be
achieved by providing an interworking functionality in the lower layers of
the protocol stack. That would ultimately provide a common networking layer
for the applications. This allows all the devices to use the same IP
addressing domain and therefore be considered as operating on one network.
In doing so, we would enable services to interact seamlessly without the
needs of provision for roaming and handover functionalities. The major
intention of this paper is to provide solutions the will enable such
functionality. The architecture design of the Bridge includes both hardware
and software developments and implementation. We detail these design issues
and provide results of NS-2 simulations that proves the feasibility of
using a bridging functionality in this interworking situation."
}

@INPROCEEDINGS{Abue0601:Wireless,
AUTHOR="Omar Abuelmaatti and Madjid Merabti and Bob Askwith",
TITLE="A Wireless Networked Appliances Interoperability Architecture",
BOOKTITLE="International Symposium on Wireless Pervasive Computing 2006",
ADDRESS="Phuket, Thailand",
DAYS=16,
MONTH=jan,
YEAR=2006,
ABSTRACT="In recent years, advances in multimedia applications, services and
intelligent networked appliances have been making ubiquitous home
environments a reality. Broadband is becoming a part of our household
infrastructure, in the same way we receive water, gas and electricity. It
is envisaged that every device will have a network interface that allows it
to be accessed and controlled from anywhere in the world. This idea is
generating a great deal of interest where sound business models are being
developed to realise such applications based on market and user needs. That
will map the future direction of Internet and home technologies. However,
despite the long list of advantages of enabling these choices, they
produced many other consequences and challenges; notably, interoperability
and the difficulties associated with the integration of combined
functionalities. The wireless interoperability challenge, especially in the
case of home networked appliances and consumer devices, is one that needs
further investigation and solutions in order to enhance the operation of
the networked domains, and that of their users. The major intention of this
paper is to present such approach. We present the results obtained from our
solution detailed in the Wireless Networked Appliances Interoperability
Architecture and detail our prototype implementation that proves the
functionality of the architecture."
}

@INPROCEEDINGS{Abur0608:Proposal,
AUTHOR="Kentaro Aburada and Kanako Morita and Naonobu Okazaki and Shigeyuki Tomita
and Mirang Park",
TITLE="Proposal of a Robust Zone-based Hierarchical Routing Method for Ad Hoc
Networks",
BOOKTITLE="12th Asia-Pacific Conference on Communications",
ADDRESS="Busan, Republic of Korea",
DAYS=31,
MONTH=aug,
YEAR=2006,
ABSTRACT="Ad hoc routing protocols can be divided into two categories. One is
proactive schemes, the other is reactive schemes. Two schemes have
advantage and disadvantage each other. There are hybrid schemes which are
good mix of proactive schemes and reactive schemes. In hybrid schemes,
nodes maintain the complete routing information of particular area only.
Outside of this area, a node search for a route only when it needs to
forward a packet. In consequence, the communication overhead is reduced.
Zone-based Hierarchical Link State (ZHLS) routing protocol is proposed as a
hybrid scheme. However, ZHLS take time to search new route when route is
disconnected because it search only one route. In particular, real-time
application is severely-impacted by this delay. For this reason, it is
necessary to construct multiple routes as backup route. In this paper, we
propose Multiple-Route Zone-based Hierarchical Source Routing (called
MR-ZHSR) scheme that extends ZHLS routing protocol to construct multi-path
routes."
}

@INPROCEEDINGS{Abus0601:Online,
AUTHOR="David Abusch-Magder and Allen Yuyin Chen and Krysta Mirzayans and Harish
Viswanathan",
TITLE="Online {PN} Offset Planning: An Example of Cellular Network
Autoconfiguration",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Networking",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="The growth and evolution in wireless networks continues to increase the
importance of operational expenditures by service providers, which in turn
creates demand for network solutions that will reduce operator intervention
such as autoconfiguration. In this paper we study PN offset assignment as
an example of the autoconfiguration of a shared resource in a wireless
network. We explore various types of data that might be available for
autoconfiguration, and propose several online planning algorithms. We study
how these data influence the choice of algorithm and impact the quality of
the PN offset plan obtained. We also explore how these algorithms and the
PN offset plans generated can be changed if we relax the online requirement
and allow in-service base stations to change their PN offsets."
}

@INPROCEEDINGS{Abus0607:TARP,
AUTHOR="Loay Abusalah and Ashfaq Khokhar and Ala Al-Fuqaha",
TITLE="{TARP:} Trust- Aware Routing Protocol",
BOOKTITLE="IWCMC 2006 Wireless Ad Hoc and Sensor Networks",
DAYS=3,
MONTH=jul,
YEAR=2006,
ABSTRACT="Security is a critical issue in a mobile ad hoc network (MANET). In most of
the previous protocols security is an added layer above the routing
protocol. We propose a Trust-Aware Routing Protocol (TARP) for
secure-trusted routing in mobile ad hoc networks. In TARP, security is
inherently built into the routing protocol where each node evaluates the
trust level of its neighbors based on a set of attributes and determines
the route based on these attributes. This paper evaluates the proposed TARP
protocols on two important attributes, the battery power and the software
configuration. A secure route between a source and destination is
established based on a confidence level prescribed by a user or application
in terms of these attributes. Our performance evaluation shows that TARP is
a robust and adaptive trust routing algorithm that reacts quickly and
effectively to the dynamics of the network while still finding the shortest
path to the destination. TARP is able to improve security and at the same
time reduce the total routing traffic sent and received in the network by
directing the traffic based on the attributes of the requested sender."
}

@INPROCEEDINGS{Abus0611:Access,
AUTHOR="Murad Abusubaih and Adam Wolisz",
TITLE="On Access Point Selection in {IEEE} {802.11} Wireless Local Area Networks",
BOOKTITLE="The 6th IEEE Workshop on Wireless Local Networks",
DAYS=14,
MONTH=nov,
YEAR=2006,
ABSTRACT="In wireless local area networks often a station can potentially associate
with more than one access point. Therefore, a relevant question is which
access point to select “best” from a list of candidate ones. In
IEEE 802.11, the user simply associates to the access point with the
strongest received signal strength.
However, this may result in a significant load imbalance between several
access points, as some accommodate a large number of stations while others
are lightly loaded or even idle. Moreover, the multi-rate flexibility
provided by several IEEE 802.11 variants can cause low bit rate stations to
negatively affect high bit rate ones and consequently degrades the overall
network throughput. This paper investigates the various aspects of
“best” access point selection for IEEE 802.11 systems. In
detail, we first derive a decision metric the selection can be based on.
Using this metric we propose two new selection mechanism which are
decentralized in the sense that the decision is performed by each station,
given
appropriate status information of each access point. In fact, only few
bytes of status information have to be added to the beacon and probe
response frames which does not impose significant overhead. In addition, we
show that our mechanism improves station quality of service and better
utilizes network resources compared to the conventional one implemented
today in IEEE
802.11 devices."
}

@INPROCEEDINGS{AbuS0611:Cross,
AUTHOR="Osama Abu-Sharkh and Ahmed Tewfik",
TITLE="Cross-layer-based Modeling of {IEEE} {802.11} Wireless {LANs} with {MIMO}
Links",
BOOKTITLE="IEEE Globecom 2006 - Quality, Reliability and Performance Modeling for
Emerging Network Services",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Multiple-Input Multiple-Output (MIMO) is the new technology that has the
potential of increasing the transmission speeds and extending the range in
wireless LANs. While MIMO links has been extensively researched in the PHY
layer research community, very few studies has been done on the MAC level.
In this paper we perform cross-layer analysis to study the impact of
spatial multiplexing using MMSE and ZF on the MAC layer. We introduce an
analytical model that takes into account the Packet Error Rate (PER) as a
loss factor in calculating the MAC throughput. The model is built on the
legacy IEEE 802.11 DCF access mechanism. Expressions for throughput and
average service time of packets are provided. The analytical expressions
are solved using MATLAB and the results are validated by simulations."
}

@INPROCEEDINGS{Abus0611:Trust,
AUTHOR="Loay Abusalah and Ashfaq Khokhar and Mohsen Guizani",
TITLE="Trust Aware Routing in Mobile Adhoc Networks",
BOOKTITLE="IEEE Globecom 2006 - Network and Information Security Systems",
ADDRESS="San Francisco, USA",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="In most MANET routing protocols security is an added layer above the
routing layer. We propose a Trust-Aware Routing Protocol (TARP) for
secure-trusted Ad-hoc routing. In TARP security is inherently built into
the routing protocol where each node evaluates the trust level of its
neighbors based on a set of attributes. TARP is based on three new
concepts. First, for route establishment, a new secure ad-hoc routing
mechanism is used. Second, six security parameters are considered in
computing the trust-level of a node in a given route and include: software
configuration, hardware configuration, battery power, credit history,
exposure and organizational hierarchy. A secure route is established based
on a confidence level prescribed by a user in terms of these attributes.
Third, we present TARP reputation system and trust metric. Our performance
evaluation shows that TARP is a robust trust routing algorithm that reacts
quickly to the dynamics of the network."
}

@INPROCEEDINGS{Acca0605:Fractal,
AUTHOR="Agostino Accardo and Gianni D'addio and GraziaMaria Corbi",
TITLE="Fractal analysis of heart rate variability in stroke patients",
BOOKTITLE="ESGCO 2006",
ADDRESS="Jena, Germany",
DAYS=15,
MONTH=may,
YEAR=2006,
ABSTRACT="Non linear parameters obtained from HRV analysis has recently been
recognized to provide valuable information for physiological interpretation
of heart rate fluctuation. Among the numerous non-linear parameters related
to the fractal behaviour of the HRV signal, two classes have gained wide
interest in the last years: the beta exponent based on the 1/f-like
relationship, starting from the spectral power, and that based on fractal
dimension. In order to evaluate the relationship between lesions severity
and fractal behaviour, 20 first-ever stroke subjects and 10 healthy
subjects were studied. Patients were divided in two groups according to
single or multiple medium cerebral artery lesion. All subjects underwent
24-hour Holter recording analysed by fractal and 1/f-like techniques.
Differently from methods usually used in literature to evaluate the fractal
dimension (FD), in this work the FD was extracted by using the Higuchi's
algorithm that permits to calculate the parameter directly from the HRV
sequences in the time domain. Results show that fractal analysis contains
relevant information related to different HRV dynamics that permits to
separate normal subjects from stroke patients. FD is also able to
distinguish between normal and stroke subjects with different lesions
severity."
}

@INPROCEEDINGS{Acem0604:Price,
AUTHOR="Daron Acemoglu and Asuman Ozdaglar",
TITLE="Price Competition in Communication Networks",
BOOKTITLE="IEEE INFOCOM 2006",
ADDRESS="Barcelona, SPAIN",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this paper, we present an analysis of competition in congested networks.
We consider the problem of routing flows across multiple paths controlled
by serial and parallel service providers that charge prices for
transmission. We study the efficiency properties of oligopoly equilibria.
Our measure of efficiency is the difference between users' willingness to
pay and delay costs. Under the assumption that delay costs without
transmission (latencies at zero) are equal to zero, we show that,
irrespective of the number of serial and parallel providers, the efficiency
of oligopoly equilibria in pure strategies is no worse than 1/2 times the
efficiency of the social optimum. When latencies at zero can be positive,
the efficiency of oligopoly equilibria can be arbitrarily low."
}

@INPROCEEDINGS{Acha0606:Traffic,
AUTHOR="Subrata Acharya",
TITLE="{Traffic-Aware} Firewall Optimization Strategies",
BOOKTITLE="ICC 2006  Network Security and Information Assurance",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="The overall performance of a firewall is crucial in enforcing and
administrating security, especially when the network is under attack. The
continuous growth of the Internet, coupled with the increasing
sophistication of the attacks, is placing stringent demands on firewall
performance. In this paper, we describe a traffic-aware optimization
framework to improve the operational cost of firewalls. Based on this
framework, we design a set of tools that inspect and analyze both
multi-dimensional firewall rules and traffic logs and construct the optimal
equivalent firewall rules based on the observed traffic characteristics.To
the best of our knowledge, this work is the first to use traffic
characteristics in firewall optimization. Furthermore, we develop a novel
adaptation mechanism that dynamically detects anomalous traffic behavior
and adaptively alters the firewall rules to avoid serious performance
degradation due to the traffic anomaly. To evaluate the performance of our
approaches, we collected a large set of firewall rules and traffic logs at
tens of enterprise networks managed by a Tier-1 service provider. Our
evaluation results find these approaches very effective. In particular, we
achieve more than 10 fold performance improvement by using the proposed
traffic-aware firewall optimization."
}

@ARTICLE{Acha0608:DCMA,
AUTHOR="Arup Acharya and Sachin Ganu and Archan Misra",
TITLE="{DCMA:} A Label Switching {MAC} for efficient packet forwarding in
multi-hop wireless networks",
JOURNAL="IEEE Journal on Selected Areas in Communications MULTI-HOP WIRELESS MESH
NETWORKS",
DAYS=1,
MONTH=aug,
YEAR=2006,
ABSTRACT="This paper addresses the problem of efficient packet forwarding in a
multi-hop, wireless mesh network . We present an efficient interface
contained forwarding (ICF) architecture for a wireless router, i.e. a
forwarding node with a single wireless NIC in a multi-hop wireless network
that allows a packet to be forwarded entirely within the network interface
card of the forwarding node without requiring per-packet intervention by
the nodes CPU. To effectively forward packets in a pipelined fashion
without incurring the 802.11-related overheads of multiple independent
channel accesses, we specify a slightly modified version of the 802.11 MAC,
called Data Driven Cut-through Multiple Access (DCMA) that uses MPLS-like
labels in the control packets, in conjunction with a combined ACK/RTS
packet, to reduce 802.11 channel access latencies. Our proposed technique
can be used in combination with frame bursting as specified by the IEEE
802.11e standard to provide an end-to-end cut-through channel access. Using
extensive simulations, we compare the performance of DCMA with 802.11 DCF
MAC with respect to throughput and latency and suggest a suitable operating
region to get maximum benefits using our mechanism as compared to 802.11"
}

@INPROCEEDINGS{Achi0607:Queuing,
AUTHOR="Robert Achieng and H Anthony Chan",
TITLE="A {QoS} Enabling Queuing Scheme and its Performance for {4G} Wireless
Access Networks",
BOOKTITLE="IWCMC 2006 Mobile Computing",
DAYS=3,
MONTH=jul,
YEAR=2006,
ABSTRACT="There will be heterogeneous wireless access networks in 4G systems, e.g.,
WLAN, UTRAN etc. The networks will need to support QoS and full mobility.
For each connection request by a mobile user in such networks, there will
be need for a scheme for selecting the best network from among the
available networks. This paper proposes a scheme that enhances existing
approaches to addressing this challenge. The scheme models the radio access
network as a network of queuing nodes. With this model, we determine the
end-to-end QoS parameter statistics of user traffic flow in each available
path through the network. We postulate that the statistics indicate the QoS
capabilities of the network and can therefore be used to select the best
network to serve the mobile user."
}

@TECHREPORT{Achl0603:Bias,
AUTHOR="Dimitris Achlioptas and Aaron Clauset and David Kempe and Cristopher Moore",
TITLE="On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in
Regular Graphs",
TYPE="arXiv report",
INSTITUTION=arxiv,
NUMBER="cond-mat/0503087",
MONTH=mar,
YEAR=2006,
ABSTRACT="Understanding the structure of the Internet graph is a crucial step for
building accurate network models and designing efficient algorithms for
Internet applications. Yet, obtaining its graph structure is a
surprisingly
difficult task, as edges cannot be explicitly queried. Instead, empirical
studies rely on traceroutes to build what are essentially single-source,
all-destinations, shortest-path trees. These trees only sample a fraction
of
the network's edges, and a recent paper by Lakhina et al. found
empirically
that the resuting sample is intrinsically biased. For instance, the
observed
degree distribution under traceroute sampling exhibits a power law even
when
the underlying degree distribution is Poisson.
In this paper, we study the bias of traceroute sampling systematically,
and, for a very general class of underlying degree distributions, calculate
the likely observed distributions explicitly. To do this, we use a
continuous-time realization of the process of exposing the BFS tree of a
random graph with a given degree distribution, calculate the expected
degree distribution of the tree, and show that it is sharply concentrated.
As example applications of our machinery, we show how traceroute sampling
finds power-law degree distributions
in both delta-regular and Poisson-distributed random graphs. Thus, our
work puts the observations of Lakhina et al. on a rigorous footing, and
extends them to nearly arbitrary degree distributions.",
URL="http://arXiv.org/abs/cond-mat/0503087"
}

@INPROCEEDINGS{Achu0605:Detection,
AUTHOR="Anusha Achuthan and Mandava Rajeswari and Dhanesh Ramachandram",
TITLE="Detection of Secondary Structure in Medical Images using Wavelet and
Watershed",
BOOKTITLE="Second International Conference on Distributed Frameworks for Multimedia
applications",
DAYS=14,
MONTH=may,
YEAR=2006,
ABSTRACT="Image segmentation is the most essential and crucial process in order to
facilitate the delineation, characterization and visualization of
structures of interests in medical images. In recent years, various methods
of medical image segmentation have been employed depending on the type of
tissues, anatomy of object of interest and imaging modality being used. In
this paper, a novel problem specific segmentation method is proposed to
detect secondary structures in medical images incorporating wavelet
transform and watershed transformation. The proposed method consists of 5
stages: wavelet transformation, inter scale linking, feature calculation
and clustering, morphological processing and watershed transformation. This
paper presents the proposed method and preliminary results tested using
Computed Tomography (CT) images of human anatomy. The preliminary
experimental results of this research have shown encouraging results with
elimination of over segmentation problem frequently faced in watershed
transformation."
}

@INPROCEEDINGS{Acos0604:Model,
AUTHOR="Guillermo Acosta",
TITLE="Model Development for the Wideband Vehicle-to-vehicle {2.4} {GHz} Channel",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Phy/MAC",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="Statistical channel models are presented for a frequency selective
vehicle-to-vehicle or mobile-to-mobile wireless communications link in an
expressway environment in Atlanta, Georgia, where both vehicles travel in
the same direction. The models were developed from measurements taken using
the direct sequence spread spectrum (DSSS) technique at 2.45 GHz. The
models imply a non-separable channel with a persistent Rician behavior
across multiple model taps"
}

@INPROCEEDINGS{Acqu0605:Optimizing,
AUTHOR="Pascal Acquaah and H Anthony Chan",
TITLE="A Variable Timer-based Assembly Algorithm for Optical Burst Switched
Networks",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="We introduce a new burst assembly scheme to address the issue of improving
QoS in an optical burst switched core network. This new way of assembling
packets is based on packet delay constraints and supports service class
differentiation. Through simulations, we evaluate the performance of the
assembly algorithm in terms of transmission delay and throughput. We
observe that the combination of the service class differentiation and a
variable burst assembly time that is based on the delay tolerance of
packets, contributes to meeting packet delay constraints and sustaining
good throughput at heavy traffic loads in an optical burst switched
network."
}

@INPROCEEDINGS{Adac0610:Theoretical,
AUTHOR="Koichi Adachi and Masao Nakagawa",
TITLE="Theoretical Analysis of Decision Directed Block Iterative Channel
Estimation for {OFDM} Mobile Radio",
BOOKTITLE="10th IEEE International Conference on Communication Systems 2006",
ADDRESS="Singapore, Singapore",
DAYS=30,
MONTH=oct,
YEAR=2006,
ABSTRACT="Orthogonal frequency division multiplexing (OFDM) is one of the promising
transmission techniques for next generation mobile communication systems.
Accurate channel estimation is essential for coherent OFDM signal
transmissions. So far, many pilot-assisted channel estimation schemes have
been proposed. In the case of packet transmission, channel estimation on
the same received packet can be repeated many times using the decision
feedback to improve the channel estimation accuracy, resulting in decision
directed block iterative channel estimation (DD-BICE). However, decision
feedback of erroneously detected data symbols degrades the resulting bit
error rate (BER) performance. A 2-dimensional (2D) averaging filter can be
used for reducing the impact of decision feedback errors. In this paper, a
theoretical analysis is presented for DD-BICE taking into account the
decision feedback errors assuming quadrature phase shift keying (QPSK) data
modulation. The impact of 2D averaging filter is discussed and the validity
of the theoretical analysis is confirmed by computer simulation."
}

@INPROCEEDINGS{Adai0604:Discovery,
AUTHOR="Raman Adaikkalavan and Sharma Chakravarthy",
TITLE="{Discovery-Based} Role Activations in {Role-Based} Access Control",
BOOKTITLE="Workshop on Information Assurance (WIA 2006)",
ADDRESS="Phoenix, Arizona",
DAYS=10,
MONTH=apr,
YEAR=2006,
ABSTRACT="In role-based access control (RBAC), users and objects are assigned to one
or more roles. Users should be active in the role that has the required
permissions before access is granted. Thus, users should be aware of the
role-permission assignments for activating the required roles. In general,
with respect to role activations, current systems follow the human-active,
system-passive model. Users often get swamped with role activations due to
numerous factors that include increase in the number of objects, multiple
role assignments, and shifting roles often, and lean toward activating all
the assigned roles violating the principle of least privilege (PLP). In
this paper we introduce SmartAccess, a system based on the system-active,
human-passive model,that allows users to concentrate on what objects they
need, rather than what role should be activated in order to carry on their
work efficiently. Furthermore, it provides access control by preserving the
PLP and without any information leak. We provide algorithms for discovering
roles and analyze various associated factors."
}

@INPROCEEDINGS{Adam0604:Intelligent,
AUTHOR="Evgenia Adamopoulou and Konstantinos Demestichas and Artemis Koutsorodi",
TITLE="Intelligent Access Network Selection in Heterogeneous Networks",
BOOKTITLE="European Wireless 2006",
ADDRESS="Athens, Greece",
DAYS=2,
MONTH=apr,
YEAR=2006,
ABSTRACT="This paper presents a mobile terminal architecture for devices operating in
heterogeneous environments, which incorporates intelligence for supporting
mobility and roaming across legacy access networks. It focuses on the
structure and functionality of the proposed scheme that supports
terminal-initiated and terminal-controlled access network selection in
heterogeneous networks. It discusses the decomposition of the proposed
Terminal Management System into separate modules, responsible for
retrieving link-layer measurements from the attachment points in the
terminals neighborhood, for handling the users profile and for performing
intelligent access network selection. This latter function aims at
independently determining the optimal local interface and attachment point
through which applications can be obtained as efficiently as possible, by
taking into account network status and resource availability, user
preferences and service requirements."
}

@INPROCEEDINGS{Adam0604:TMS,
AUTHOR="William Adams and Nathaniel Davis",
TITLE="{TMS:} A Trust Management System for Access Control in Mobile {Ad-Hoc}
Networks",
BOOKTITLE="25th IEEE International Performance Computing and Communications Conference",
ADDRESS="Phoenix, Arizona",
DAYS=10,
MONTH=apr,
YEAR=2006,
ABSTRACT="As mobile computing platforms make ad-hoc collaborative environments more
common, the need for access control becomes more imperative. Centralized
access control determination fails to work in mobile ad-hoc networking
environments, as the information necessary for pre-configuration is not
available. This situation is exacerbated by the dynamic nature of the
environments membership, so that the time and resources expended in
off-line management are largely wasted. This paper presents a decentralized
access control system that implements sociological trust constructs in a
quantitative system to evaluate potential associates for collaborative
interaction. A distributed, node-centric approach to reputation management
processes nodal behavior feedback and provides a reputation index that
nodes use to determine trustworthiness their peers before establishing
associations. The application of a reputation index against a dynamic risk
assessment gives a measure of expectation of a peers behavior, based on
past performance and current the network environment. These safeguards work
together to make a MANET a safer distributed operational environment."
}

@INPROCEEDINGS{Adam0606:,
AUTHOR="Davide Adami and Christian Callegari and Daniele Ceccarelli and Stefano
Giordano and Michele Pagano",
TITLE="Design, development and validation of an {NS2} module for dynamic {LSP}
rerouting",
BOOKTITLE="11th International Workshop on Computer-Aided Modeling, Analysis and Design
of Communication Links and Networks",
ADDRESS="Trento, Italy",
DAYS=8,
MONTH=jun,
YEAR=2006,
ABSTRACT="The widespread use of multimedia applications over the Internet requires
advanced network architectures offering Quality of Service (QoS)
guarantees. At the same time, service providers demand for effective
network resources utilization. 
In this framework, different levels of QoS can be provided by the Diffserv
architecture, while Multiprotocol Label Switching (MPLS) introduces Traffic
Engineering (TE) capabilities, such as resource allocation, resource usage
optimization and recovery techniques. 
A major goal of Internet TE is to facilitate efficient and reliable
network operations while simultaneously optimizing network resource
utilization and traffic performance. In order to enable TE, extensions to
Interior Gateway Protocols (IGPs) are necessary since further information,
such as link status and administrative policies must be distributed among
routers. 
The paper discusses the design and development of a new software module to
support the CSPF algorithm and TE extensions to OSPF in the Network
Simulator 2 (NS2).
This module enables NS2 with new fundamental functionalities, such as
dynamically rerouting Label Switched Paths (LSPs) in case of link failures,
taking into account TE metrics.  
Moreover, to assess the OSPF-TE module, the results of some simulations,
aimed at evaluating the recovery time in MPLS networks, are shown."
}

@INPROCEEDINGS{Adam0610:Browsing,
AUTHOR="Brett Adams and Stewart Greenhill and Svetha Venkatesh",
TITLE="Browsing personal media archives with spatial context using panoramas",
BOOKTITLE="ACM Multimedia - Short Papers and Posters",
DAYS=22,
MONTH=oct,
YEAR=2006,
ABSTRACT="This paper presents novel techniques for using panoramas as spatial context
to enhance browsing of personal media archives. This context, locations
where frequent media capture takes place, is present in the disparate
photos and videos, but not leveraged by traditional browsing techniques
(e.g. thumbnails or zoomable interfaces). In particular, coarse
geo-positioning is often an insufficient index at such media capture
hotspots. We experiment with panoramic video, which presents archive video
organically blended with panorama of a media capture hotspot; Immersive
browsing and filtering with media items projected onto spherical panoramas,
and; Detection and representation of links between panoramas to enable
browsing of situated media in quasi-3D. We present proof-of-concept
implementations and observations of their effectiveness, limitations, and
open problems. Experiments confirm the initial intuition that each holds
promise for augmenting traditional browsing environments."
}

@INPROCEEDINGS{Adam0610:Extraction,
AUTHOR="Brett Adams and Dinh Phung and Svetha Venkatesh",
TITLE="Extraction of social context and application to personal multimedia
exploration",
BOOKTITLE="ACM Multimedia - Content Track",
DAYS=22,
MONTH=oct,
YEAR=2006,
ABSTRACT="Personal media collections are often viewed and managed along the social
dimension, the places we spend time at and the people we see, thus tools
for extracting and using this information are required. We present novel
algorithms for identifying socially significant places termed social
spheres unobtrusively from GPS traces of daily life, and label them as one
of Home, Work, or Other, with quantitative evaluation of 9 months taken
from 5 users. We extract locational co-presence of these users and
formulate a novel measure of social tie strength based on frequency of
interaction, and the nature of spheres it occurs within. Comparative user
studies of a multimedia browser designed to demonstrate the utility of
social metadata indicate the usefulness of a simple interface allowing
navigation and filtering in these terms. We note the application of social
context is potentially much broader than personal media management,
including context-aware device behaviour, life logs, social networks, and
location-aware information services."
}

@INPROCEEDINGS{Adam0611:Development,
AUTHOR="Davide Adami and Christian Callegari and Daniele Ceccarelli and Stefano
Giordano and Michele Pagano",
TITLE="Design and development of {MPLS-based} recovery strategies in {NS2}",
BOOKTITLE="IEEE Globecom 2006 - Quality, Reliability and Performance Modeling for
Emerging Network Services",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="In a multi-service IP network, it is a key challenge to provide QoS to
end-user applications while effectively using network resources. 
Traffic Engineering support in MPLS networks allows operators to carry
traffic with strict QoS requirements by means of advanced network
capabilities, such as resource reservation, fault-tolerance and
optimization of transmission resources.  
To deliver a reliable service, MPLS exploits a set of procedures that
protect traffic flows carried on different paths. Therefore, Label
Switching Routers have to support mechanisms for fault detection,
notification and recovery, whereas MPLS  has to enable the configuration of
different recovery techniques.
In this paper, we present the design and the development of some software
modules for the simulation of different MPLS-based recovery strategies in
the discrete event simulator NS2. Moreover, the paper discusses some
simulation results that show a performance comparison between path
protection and path restoration strategies in a simulation scenario
matching the Géant network."
}

@INPROCEEDINGS{Adam0611:Experimental,
AUTHOR="Davide Adami and Stefano Giordano and Fabio Mustacchio and Saverio
Niccolini and Michele Pagano",
TITLE="Experimental Validation of {SLAs} in Operational Networks through
Hash-based Packet Sampling",
BOOKTITLE="IEEE Globecom 2006 - Quality, Reliability and Performance Modeling for
Emerging Network Services",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="In operational networks, services are delivered according to specific
Service Level Agreements (SLAs). To ensure the SLAs stipulated with the
users, providers make use of traffic monitoring and measurement tools
controlling their high-speed IP networks. In order to improve the
scalability of the measurement systems, techniques which allow to reduce
the total amount of data to be collected and processed are currently being
standardized in the IETF Packet Sampling (PSAMP) Working Group. Among
packet sampling techniques, hash-based one is the only capable of providing
a feasible framework to monitor One-Way Delays (OWDs). This paper is
focused on the experimental validation of SLAs conformance in operational
networks using hash-based packet sampling techniques. The results presented
hereafter are obtained from the analysis of  traffic traces collected at
two different points of operational networks. Such results are fundamental
to validate the whole hash-based packet sampling framework, because they
complement the already available results on the uniformity of distribution,
computation speed and statistical properties of the hash functions
calculated by using single point traces."
}

@INPROCEEDINGS{ADEB0603:Comparisons,
AUTHOR="Bamidele Adebisi and Honary Bahram",
TITLE="Comparisons of Indoor {PLC} Emissions Measurement Results and Regulation
Standards",
BOOKTITLE="IEEE International Symposium on Powerline Communications and Its
Applications",
ADDRESS="Disney Coronado Springs Resort, Orlando, FL USA",
DAYS=26,
MONTH=mar,
YEAR=2006,
ABSTRACT="Measurements of emissions are carried out over a power line system in the
frequency rage of 1MHz 30MHz. In the measurement setups, efforts are made
to comply with the setup specified in the existing standards. The results
obtained are compared to the current regulations/proposed limits. It is
shown that the measured emissions do not currently meet all the specified
limits. It is also suggested that future power line communications systems
will have to transmit at lower radiation power levels in order to meet
those limits."
}

@INPROCEEDINGS{Adia0612:Family,
AUTHOR="Mehdi Adian",
TITLE="A family of {LMS} adaptive bemaforming algorithm for {WCDMA} systems in
uplink",
BOOKTITLE="8th Annual IEEE WIRELESS AND MICROWAVE TECHNOLOGY CONFERENCE",
ADDRESS="Clearwater, Florida, USA",
DAYS=4,
MONTH=dec,
YEAR=2006,
ABSTRACT="Smart antenna technology is gaining more and more interest in wireless
community. Smart antenna compared to conventional antenna, significantly
improves channel capacity, spectral efficiency, and coverage area. In a
WCDMA system, since all users share the same frequency, the interference
reduction is a major criterion to improve capacity and performance. In this
study, we focus on adaptive beamforming algorithms with smart antenna at
the CDMA base station for interference reduction and multipath suppression
in the uplink. Adaptive beamforming is a key feature of WCDMA systems that
leads to interference mitigation and capacity increase of wireless
networks. This paper presents a family of LMS adaptive beamforming
algorithm for WCDMA systems in uplink. This family includes conventional
LMS, Normalized LMS, Signed LMS, Signed-Regressor LMS and Sign-Sign LMS
algorithms"
}

@INPROCEEDINGS{Adia0612:FDNLMS,
AUTHOR="Mehdi Adian",
TITLE="{FDNLMS} with active tap detection as adaptive beamforming algorithm for
{WCDMA} systems(uplink)",
BOOKTITLE="8th Annual IEEE WIRELESS AND MICROWAVE TECHNOLOGY CONFERENCE",
ADDRESS="Clearwater, Florida, USA",
DAYS=4,
MONTH=dec,
YEAR=2006,
ABSTRACT="In the realization of adaptive beamforming algorithms, the
least-mean-squares (LMS) algorithm had been the most popular scheme used
for Smart Antenna systems. This Paper proposes an alternate scheme in the
form of the Normalized LMS (NLMS) algorithm with active tap detection for
WCDMA systems. By taking advantage of spatial filtering, the proposed
scheme promises to reduce the bandwidth required for transmitting data by
improving convergence rate. The performance of the Frequency Domain NLMS
algorithm in the presence of multipath effects and multiple users is
analyzed using simulations. This analysis is compared to that of LMS
algorithm and suggests improvement in the convergence rate and number of
active taps used, which leads to better system efficiency."
}

@INPROCEEDINGS{Adib0601:Multipath,
AUTHOR="Sasan Adibi and Shervin Erfani",
TITLE="A Multipath Routing Survey for Mobile {Ad-Hoc} Networks",
BOOKTITLE="CCNC2006 Special session technical papers",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="Mobile ad hoc networks (MANETs) pose particular challenges in terms of
Quality of Service (QoS) and performance. This is due to the effect of
numerous parameters such as; bandwidth and power constrains, delays,
security issues etc. On there hand, the degree of freedom enables the
wireless mobile nodes to enter and leave the network dynamically. The
latter offers redundant paths and dynamic coverage. Particular attention is
given to the multipath transmission capability as well as load balancing to
have efficient routing possible for heavy multimedia traffics. In this
paper, the issues of multipath routing in MANETs are surveyed and
performances of such MANETs are compared to discuss the application of
multipath routing and its effects on different layers to support QoS."
}

@INPROCEEDINGS{Adin0604:Multi,
AUTHOR="Abdulkareem Adinoyi and Halim Yanikomeroglu",
TITLE="{Multi-Antenna} Aspects of Wireless Fixed Relays",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Phy/MAC",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="The capability of multi-antenna schemes is well known. Since the small size
requirements of terminals preclude the use of these schemes on the
terminals, the use of network resources (e.g., neighbor's antennas, network
relays) in a cooperative manner has become imperative. First, this paper
investigates cooperative two-hop networks with single antenna at each
cooperating node (terminal and relay station). Second, infrastructure-based
fixed relays may have the capability to carry multiple antennas. Therefore,
the paper also examines distributed cooperative fixed relays with multiple
antennas. Threshold maximal ratio combining and threshold selection
combining of these multiple antenna signals are studied and analyzed. The
following results are derived. For a given performance requirement, the
multiple antennas at relays can tremendously reduce the number of relays
required in a network area, ultimately, reducing system deployment cost. In
addition, threshold selection combining at the relays represents an
excellent performance-cost tradeoff. The analysis performed uses the
versatile Nakagami fading channel model. Finally, simulations are used to
validate the expressions derived."
}

@INPROCEEDINGS{Adin0611:Performance,
AUTHOR="Abdulkareem Adinoyi and Halim Yanikomeroglu",
TITLE="On the Performance of Cooperative Wireless Fixed Relays in Asymmetric
Channels",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="In many scenarios the commonly assumed symmetry in multiple relay
channels is unrealistic. Therefore, this paper, through analytical
and simulation efforts,  investigates asymmetric relay deployment
where the links of cooperating nodes to destination could
experience unequal signal strength. An analysis of the cooperative
error rate at the destination node in such networks is presented.
Using the derived expression for the cooperative error, in
conjunction with the approaches used in earlier works,  the
end-to-end (E2E) performance of a two-hop network can be obtained.
Moreover, the derived expression represents, in certain scenarios,
a tight bound for the E2E error rate of the two-hop network such
as when relay adopts threshold decode-and-forward strategy and/or
multi-antenna processing to improve the reliability of its
detection."
}

@INPROCEEDINGS{Adla0606:Multiuser,
AUTHOR="Sachin Adlakha and R. K. Mallik and Anshu Vazirani",
TITLE="Multiuser Detection Techniques for {TH-PPM} Systems",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="This paper investigates detection mechanisms for time hopping pulse
position modulated multiple access systems in both additive white Gaussian
noise environment and fading environment. In such systems, the raw data is
not linearly related to the received signal. One technique is to express
the pulse position modulated signal as the sum of linearly modulated
signals with the input being a nonlinear function of the raw data. This
reduces the system to an equivalent pulse amplitude modulated system with
significant increase in complexity. We present two new lower complexity
detectors. The first detector uses the properties of the pulse correlation
matrix to develop a lower complexity detector. The second detector relies
on the knowledge of the time-hopping sequence to despread the received
signal. The detection is then done on chip-by-chip basis. The performance
of these detectors is compared in terms of the probability of at least one
user being in error, the average number of correctly decoded users, and the
pairwise error probability."
}

@INPROCEEDINGS{Adna0606:Blind,
AUTHOR="Rubyet Adnan and Lee Garth",
TITLE="Blind Equalization Bounds for {Tomlinson-Harashima} Precoded Systems",
BOOKTITLE="ICC 2006  Signal Processing for Communications",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Tomlinson-Harashima precoding (THP) and blind equalization are often viewed
as incompatible equalization techniques. In this paper, we give multiple
scenarios where the THP-blind equalization combination might arise. With
this motivation we set out to answer the question, can a blind equalizer
successfully acquire a THP-shaped signal? By bounding the kurtosis of the
THP-shaped signal, we show that THP actually aids the initial convergence
of blind equalization. We find that, as the symbol constellation size
increases, the THP-shaped signal kurtosis approaches that of a uniform
distribution, not a Gaussian. We then verify our analytical results using a
Monte Carlo simulation of a terrestrial microwave channel."
}

@INPROCEEDINGS{Adol0605:High,
AUTHOR="Marcus Wahl and Markus Adolph and Kristina Biller and Ulrich Hackenberg and
Ralf Rieger and Bernhard Schweizer and Bernd Adelseck and Hans Brugger and
Michael Loercher",
TITLE="High Precision {T/R-Module} for {SAR} Earth Observations",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="The paper will discuss the design, the main features and the measured
performance of a T/R-Module for a Synthetic Aperture Radar. The internal
temperature drift compensation over a wide temperature range as well as the
low noise amplification during receive operation are the key features of
the module including polarisation agility, high gain- and phase accuracy.
The module is a qualified product. The 'Standardised Modular T/R-Module'
(SMTR-Module) is the core unit together with two further physical building
blocks 'Front-end Electronics' and the 'Control Electron-ics', all of them
are assembled in one common housing."
}

@INPROCEEDINGS{Adra0604:EXIT,
AUTHOR="Marc Adrat and Thorsten Clevorn and Bjoern Korall and Peter Vary and Markus
Antweiler",
TITLE="{EXIT-Optimized} Quantizer Design for Iterative {Source-Channel} Decoding",
BOOKTITLE="4 th International Symposium on Turbo Codes in connection with 6th
International ITG-Conference on Source and Channel Coding",
ADDRESS="Munich, Germany",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="In digital mobile communications the input speech, audio, or video signal
has to be quantized before transmission. In this paper, we propose a novel
quantizer design strategy which is optimized for the case that iterative
source-channel decoding (ISCD) is applied at the receiver site. The
combination of the new quantizer with the ISCD scheme reveals a
substantially increased error robustness in bad channel conditions at the
cost of a tolerable loss of baseline performance in almost error-free
situations. This trade-off can smoothly be adjusted."
}

@INPROCEEDINGS{Adri0609:Optimal,
AUTHOR="Jacob Adriaens and Seapahn Megerian and Miodrag Potkonjak",
TITLE="Optimal {Worst-Case} Coverage of Directional {Field-of-View} Sensor
Networks",
BOOKTITLE="Third Annual IEEE Communications Society Conference on Sensor, Mesh, and Ad
Hoc Communications and Networks",
ADDRESS="Reston, Virginia, USA",
DAYS=25,
MONTH=sep,
YEAR=2006,
ABSTRACT="Sensor coverage is a fundamental sensor networking design and use issue
that in general tries to answer the questions about the quality of sensing
(surveillance) that a particular sensor network provides. Although
isotropic sensor models and coverage formulations have been studied and
analyzed in great depth recently, the obtained results do not easily extend
to, and address the coverage of directional and field-of-view sensors such
as imagers and video cameras. In this paper, we present an optimal
polynomial time algorithm for computing the worst-case breach coverage in
sensor networks that are comprised of directional ``field-of-view'' (FOV)
sensors. Given a region covered by video cameras, a direct application of
the presented algorithm is to compute ``breach'', which is defined as the
maximal distance that any hostile target can maintain from the sensors
while traversing through the region. Breach translates to ``worst-case
coverage'' by assuming that in general, targets are more likely to be
detected and observed when they are closer to the sensors (while in the
field of view). The approach is amenable to the inclusion of any sensor
detection model that is either independent of, or inversely proportional to
distance from the targets. Although for the sake of discussion we mainly
focus on square fields and model the sensor FOV as an isosceles triangle,
we also discuss how the algorithm can trivially be extended to deal with
arbitrary polygonal field boundaries and sensor FOVs, even in the  presence
of rigid obstacles. We also present several simulation-based studies of the
scaling issues in such coverage problems and analyze the statistical
properties of breach and its sensitivity to node density, locations, and
orientations. A simple grid-based approximation approach is also analyzed
for comparison and validation of the implementation."
}

@INPROCEEDINGS{Aert0609:Wigner,
AUTHOR="Sven Aerts and Dirk Aerts and Franklin Schroeck and Jürgen Sachs",
TITLE="A {Wigner-Ville,} time-frequency approach to {TNT} detection in nuclear
quadrupole resonance experiments.",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="To minimize the risks involved in humanitarian demining requires a
sensitivity setting close to unity, resulting in a very high false alarm
rate. Nuclear quadrupole resonance detection, based on the spin echoes from
nuclear spin relaxation, is a promising example of a highly specific
detector that directly addresses the properties of the explosive rather
than the mine casing. However, the data aquisition time necessary to obtain
a sufficiently high sensitivity is long due to the extremely poor SNR of
the spin echoes. Besides improvements in the hardware, it is important to
pursue better signal analytic techniques. We present a time-frequency
approach based on the Wigner-Ville quasi-distribution for the analysis of
nuclear quandrupole resonance. We calculate ROC curves for real data
obtained under laboratory conditions and show the technique presents a
susbtantial improvement over the popular demodulation technique."
}

@INPROCEEDINGS{Afer0604:Repeated,
AUTHOR="Michael Afergan and Rahul Sami",
TITLE="{Repeated-Game} Modeling of Multicast Overlays",
BOOKTITLE="IEEE INFOCOM 2006",
ADDRESS="Barcelona, SPAIN",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="This paper studies multicast application overlay networks in a
repeated-game framework. In these overlays, users have both the motivation
and the means to alter their position in the overlay tree. We introduce a
repeated-game model of user behavior that captures the practical tradeoff
between a user's short-term desire for quality and long-term desire for the
network's continued existence. We simulate overlay tree-formation protocols
with this model to study their robustness to selfish users. We show that
this model can explain user cooperation and provide insight into how
overlay systems scale in the absence of heavyweight mechanisms or identity
systems. We also use the model to derive practical guidance on how to make
multicast overlay protocols more robust to selfish users."
}

@INPROCEEDINGS{Afer0604:Using,
AUTHOR="Michael Afergan",
TITLE="Using Repeated Games to Design {Incentive-Based} Routing Systems",
BOOKTITLE="IEEE INFOCOM 2006",
ADDRESS="Barcelona, SPAIN",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="Incorporating pricing information in routing systems has been explored in
various contexts and fashions. In this paper we examine certain fundamental
properties important in the design of such a routing protocol. The
importance of these properties is derived from the underlying economic
factors governing the behavior of the autonomous players. We view the
exchange of pricing information at an interconnect as a \emph{repeated
game} between the relevant players. For example, multiple ISPs competing
for the business of a CDN. With this model, we see that that various
protocol parameters -- such as protocol period, minimum bid size, and unit
of measure -- have a significant and important impact on the equilibrium
outcome. We show how these parameters can be use to address the problem of
the repeated dynamic and further that these conclusions are robust to a
variety of practical assumptions. These often surprising results enable
protocol designers to appreciate and leverage these seemingly benign
parameters, a result that has direct practical importance."
}

@INPROCEEDINGS{Afsa0604:Power,
AUTHOR="Ahmad Afsahi",
TITLE="{Power-Performance} Efficiency of Asymmetric Multiprocessors for
Multi-threaded Scientific Applications",
BOOKTITLE="High-Performance Power-Aware Computing 2006",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="Recently, under a fixed power budget, asymmetric multiprocessors (AMP) have
been proposed to improve the performance of multi-threaded applications
compared to symmetric multiprocessors.  An AMP is a multiprocessor system
in which its processors are not operating at the same frequency.  
Power consumption has become an important design constraint in servers and
high-performance server clusters.  This paper explores the
power-performance efficiency of Hyper-Threaded (HT) AMP servers, and
proposes a new scheduling algorithm that can be used to reduce the overall
power consumption of a server while maintaining a high level of
performance. Prototyping AMPs on a commercial 4-way SMP server, we show
that on average 15.6\% energy savings and 6.1\% slowdown for the
HT-disabled case, and 7.1\% energy savings and 4.8\% slowdown for the
HT-enabled case can be achieved across NAS and SPEC OpenMP applications."
}

@INPROCEEDINGS{Agar0605:Intelligent,
AUTHOR="Sachin Agarwal",
TITLE="Intelligent content caching for mobile devices",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Newer mobile devices are equipped with multiple network interfaces that can
be used to preemptively download multimedia content in an efficient and
cost effective manner. We propose a content selection algorithm for such
push-based multimedia content caching scenarios. Our approach improves
cache hit rates by exploiting correlations between users who request
similar content: we use this information to select cache content
intelligently. Using real data collected from an Internet movie ratings
web-site, we experimentally verify the superiority of our approach over the
widely used technique of pushing the most popular content onto all mobile
devices. We also propose a distributed version of our approach suitable for
ad hoc mobile device networks that is useful for peer-to-peer content
exchange."
}

@INPROCEEDINGS{Agar0610:NetMure,
AUTHOR="Shubham Agarwal",
TITLE="{NetMure:} A Self Configuring Dynamic Firewall for Load Reduction of
Network Administrator",
BOOKTITLE="10th IEEE International Conference on Communication Systems 2006",
ADDRESS="Singapore, Singapore",
DAYS=30,
MONTH=oct,
YEAR=2006,
ABSTRACT="In this paper we propose a system that shall enable Network administrator
to manage things with ease. The fire wall called NetMure proposed by us is
a dynamically configurable firewall which configures itself according to
user needs. Firewalls protect internal networks from outside attacks.
However, to maintain integrity and order in a network, we need some
mechanism to control unwarranted traffic that spreads from and within that
network. We call this mechanism “NetMure stands for “A dynamic
firewall configuration with each user inside a virtual prison and with
services being allocated dynamically” Since all users in the network
are members of the authenticated user group, NetMure uses the central
authentication system to authorize particular traffic for particular hosts.
If all traffic from internal hosts is authenticated, chances of stray
traffic polluting the network shall be minimized. Unlike AI-based systems
however, NetMure relies on the axiom that humans far exceed computers in
the game of determining right things from wrong. Thus, instead of taking
decisions on its own, it generates a list of options and solicits manual
intervention for choice."
}

@INPROCEEDINGS{Agba0612:Tactical,
AUTHOR="Basile L. Agba and Francois Gagnon and Ammar Kouki",
TITLE="Tactical ad hoc scenarios generator coupled with channel modeling",
BOOKTITLE="8th Annual IEEE WIRELESS AND MICROWAVE TECHNOLOGY CONFERENCE",
ADDRESS="Clearwater, Florida, USA",
DAYS=4,
MONTH=dec,
YEAR=2006,
ABSTRACT="Simulation tools are very helpful for cost-effective design of wireless
networks and useful to have better understanding of many phenomena. Ad hoc
networks are one of the complex wireless systems because of the difficult
to have good prediction in their topology changing. Our contribution in
this paper is to provide as well as possible the best description of ad hoc
scenarios in order to have a better analysis of the physical layer, and
finally to improve performances of the whole network. We have created a
scenarios generator to be able to generate a large number of scenarios with
the same set of parameters or various scenarios. To meet some requirements
of military use (which is our main application) we have proposed some
improvements of classic mobility models. Many figures are depicted to
illustrate our approach. And finally, we present the results in term of
channel behaviour while coupling the generator with a semi-deterministic
propagation model."
}

@INPROCEEDINGS{Agga0606:Optimal,
AUTHOR="Alok Aggarwal and Erik Stauffer and Teresa H. Meng",
TITLE="Optimal {Peak-to-Average} Power Ratio Reduction in {MIMO-OFDM} Systems",
BOOKTITLE="ICC 2006  Signal Processing for Communications",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Recent work has used convex optimization to minimize the peak-to-average
power ratio (PAR) of OFDM signals subject to a constraint on the
constellation error vector magnitude (EVM). This paper extends the PAR
optimization technique to multiple-input multiple-output (MIMO) OFDM
systems with channel precoding. In MIMO systems with a large OFDM symbol
size, it is infeasible to solve the optimization problem by direct methods
such as Cholesky factorization. Instead, we propose an iterative
conjugate-gradient (CG) method to find an approximate solution with far
lower memory and latency requirements. Simulation results are presented for
a MIMO-OFDM system with 4 antennas and 1024 carriers. The PAR can be
reduced from 11.5 dB to 4.3 dB for QPSK with -20 dB EVM, and from 11.5 dB
to 5.5 dB for 16-QAM with -30 dB EVM. The tradeoff between PAR reduction
and computational complexity is also examined to determine the number of CG
iterations needed to reach within 1 dB of the globally optimal solution."
}

@INPROCEEDINGS{Agha0606:Slope,
AUTHOR="Farshid Agharebparast and Victor Leung",
TITLE="Slope Domain Modeling and Analysis of Data Communication Networks: A
Network Calculus Complement",
BOOKTITLE="ICC 2006 Communications QoS, Reliability and Performance Modeling",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Min-plus filtering theory (or it dual, max-plus), commonly called Network
Calculus (NC), is a sophisticated modern framework for modeling and
analysis of data communication networks. In this paper, we complement NC
theory by proposing the novel application of slope domain analysis in NC
using the slope transform, which is analogous to frequency domain analysis
based on the Fourier transform in traditional system theory. We describe
the principles and properties of slope domain analysis, and how it can be
effectively applied in analysis of computer networks. We illustrate the
application of the proposed method in system identification and priority
scheduling to demonstrate that slope domain analysis is a much more
convenient and efficient, and in some cases, the only viable approach to
solving NC problems. We conclude the paper by presenting the Legendre and
Fenchel as special cases of the slope transform that facilitate fast
calculations."
}

@INPROCEEDINGS{Agha0610:Smart,
AUTHOR="Hamid Aghajan and Ali {Maleki Tabar} and Arezou Keshavarz",
TITLE="Smart Home Care Network using Sensor Fusion and Distributed {Vision-Based}
Reasoning",
BOOKTITLE="ACM Multimedia Workshop On Video Surveillance and Sensor Networks",
ADDRESS="Santa Barbara, USA",
DAYS=27,
MONTH=oct,
YEAR=2006,
ABSTRACT="A wireless sensor network employing multiple sensing and event
detection modalities and distributed processing is proposed for
smart home monitoring applications. Image sensing and vision-based
reasoning are employed to verify and further analyze events reported
by other sensors. The system has been developed to address the
growing application domain in caregiving to the elderly and persons
in need of monitored living, who care to live independently while
enjoying the assurance of timely access to caregivers when needed.
An example of sensed events is the accidental fall of the person
under care. A wireless badge node acts as a bridge between the user
and the network. The badge node provides user-centric event sensing
functions such as detecting falls, and also provides a voice
communication channel between the user and the caregiving center
when the system detects an alert and dials the center. The voice
connection is carried over an IEEE 802.15.4 radio link between the
user badge and another node in the network that acts as a modem.
Using signal strength measurements, the network nodes keep track of
the approximate location of the user in the monitoring environment.
The network also includes wall-mounted image sensor nodes, which are
triggered upon detection of a fall to analyze their field-of-view
and provide the caregiving center with further information about the
user's status. A description of the developed network and several
examples of the vision-based reasoning algorithm are presented in
the paper."
}

@INPROCEEDINGS{Aghv0605:Wireless,
AUTHOR="Hamid Aghvami",
TITLE="Wireless Access Network Design",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="This talk will first describe the concepts of convergence, integration and
inter-working of multiple heterogeneous radio access networks.  It will
then discuss the associated degrees of coupling between these networks. 
The talk will give two different approaches for the design of next
generation broadband wireless networks. It will also address how to ensure
the establishment, maintenance and termination of end-to-end QoS for these
two approaches.  As an example, the design of a wireless access network in
the context of end-to-end networking will then be given. The suitability of
the IP layer model as a glue to interconnect multiple heterogeneous radio
access networks will next be addressed.  Following on from this, the NSF
initiative on Future Internet Design (FIND) will be described as a means to
re-invent the Internet architecture"
}

@INPROCEEDINGS{Agos0609:Model,
AUTHOR="Marie Andrée Agostini and Marc Antonini and Michel Barlaud",
TITLE="Model-based bit allocation between wavelet subbands and motion information
in {MCWT} video coders",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="In motion-compensated wavelet based video coders (MCWT), a precise motion
estimation is necessary to minimize the wavelet coefficients energy.
However, a motion vectors field of high precision is expensive in binary
resources compared to wavelet subbands and it is thus necessary to optimize
the rate-distortion trade-off between motion information and wavelet
coefficients. To this end, we have proposed in previous works to quantize
the motion vectors using a scalable and open-loop lossy coder and we have
established a theoretical distortion model of the motion coding error which
evaluates the impact of this lossy motion coding on the decoded sequence.
We present in this paper an approach to realize an optimal model-based
bit-rate allocation between motion and wavelet subbands. This method is
based on the total distortion model of coding error on several
decomposition levels, including both motion information and subbands
quantization noise. First experimental validations are satisfactory."
}

@INPROCEEDINGS{Agra0604:Ultra,
AUTHOR="Deepak Agrawal and Mario Baldi and Michele Corrà and Giorgio Fontana and
Guido Marchetto and Viet Thang Nguyen and Yoram Ofek and Danilo Severina
and Olga Zadedyurina",
TITLE="Ultra Scalable {UTC-based} Pipeline Forwarding Switch for Streaming {IP}
Traffic",
BOOKTITLE="IEEE INFOCOM 2006 Poster and Demo Session",
ADDRESS="Barcelona, Spain",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="We are proposing to exhibit the Ultra Scalable UTC-based Pipeline
Forwarding Switch testbed for Streaming IP Traffic. The unique feature of
this testbed is that it deploys pipeline forwarding to carry video streams
from a video server to video receivers. Pipeline forwarding is particularly
suitable to carry streaming media over the Internet since it offers (i)
high scalability of network switches and (ii) deterministic quality of
service. 
The heart of the testbed is an IP switch that features the lowest cost per
Gb/s and is based on a design with switching capacity that can scale to 40
T/s and beyond with deterministic performance guarantees. The switch is
fabricated using commercially available switching components."
}

@INPROCEEDINGS{Agra0611:Lightpath,
AUTHOR="Gaurav Agrawal and Deep Medhi",
TITLE="Lightpath Topology Configuration for Wavelength-routed {IP/MPLS} Networks
for {Time-Dependent} Traffic",
BOOKTITLE="IEEE Globecom 2006 - Control and Management of High Performance Networks",
ADDRESS=", USA",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="The integration of lightpath topology design and IP/MPLS traffic
engineering provides greater flexibility for next generation
networks. In this paper, we consider the  integrated design
problem of configuration of lightpath topology and optimal routing
of IP/MPLS tunnels on this lightpath topology for time-varying
traffic. A mixed integer linear programming model is proposed to
design an optimal configuration of lightpath topology, which takes
time-dependent traffic demand as an input to the model for IP/MPLS
traffic engineering. We consider two variants of the problem: in
the first variant, re-routing of IP/MPLS tunnels is not allowed
from one-time period to another while reconfiguration rerouting is
allowed in the second variation. We also consider various traffic
engineering objectives and study their impact on different
performance measures. In particular, we propose a composite
objective function to combine the benefits of various objectives.
Through computational results, we quantify the benefit of the
configurable option over the static option."
}

@INPROCEEDINGS{Agra0611:UTC,
AUTHOR="Deepak Agrawal and Michele Corrà and Viet Thang Nguyen and Yoram Ofek",
TITLE="{UTC} based Controller for Scalable Time Driven Switching",
BOOKTITLE="IEEE Globecom 2006 - Advanced Technologies and Protocols for Optical
Networks",
ADDRESS="San Francisco, CA, USA",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="As data traffic on the Internet continues to grow exponentially, there is a
real need to solve the switch bottleneck by developing ultra-scalable
switching fabrics. Recently proposed solutions have been very expensive,
complex, and have large electronic switching fabric and limited
scalability. To help remedies these situations a novel optoelectronic
switching architecture is implemented and tested. It is a low cost FPGA
based switch controller which uses UTC from Global Positioning System. TDS
architecture is especially suitable to support high capacity streaming
media applications over the Internet. This paper discusses design,
implementation and experimental prototype of the physical layer circuit for
dynamic configuration of high speed switch for providing quality of service
in the Internet. The FPGA based switch controller is the foundation of
ultra scalable switch prototype. The switch prototype has successfully
demonstrated high quality, jitter free streaming media transmission over
the optical network.As data traffic on the Internet continues to grow
exponentially, there is a real need to solve the switch bottleneck by
developing ultra-scalable switching fabrics and their control. Although in
recent years there have been a lot of efforts to solve the switching fabric
scalability problem, in the optical domain, the proposed solutions have
been (very) expensive, (very) complex and (much) larger than electronic
switching fabric alternatives. In order to increase scalability a UTC-based
(coordinated universal time) time driven switching (TDS) is proposed. This
novel low-complexity switching architecture capitalizes on the ubiquitous
of UTC from GPS and Galileo. This work focuses on UTC-based FPGA (field
programmable gate-array) controller that was implemented for controlling
the TDS switch prototype at the University of Trento. The switch controller
facilitate dynamic configuration of ultra scalable switch. The prototype is
implemented using off-the-shelf components. TDS architecture is especially
suitable to support high capacity streaming media applications over the
Internet."
}

@INPROCEEDINGS{Agui0604:Daidalos,
AUTHOR="Rui Aguiar and Hans Einsiedler and Roger Karrer",
TITLE="Daidalos: the operator's vision of the next-generation Internet",
BOOKTITLE="IEEE INFOCOM 2006 Poster and Demo Session",
ADDRESS="Barcelona, Spain",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="Telecom operators are challenged by the increasing user demand for
mobility, quality of service and security on one hand, and the constraints
imposed by economy and regulatory bodies. Daidalos, an EU funded Integrated
Project, addresses the vision of a seamlessly integrated heterogeneous
network architecture based on an IPv6 infrastructure. Daidalos architecture
addresses conceptual issues of operators, customers and identities, as well
as integrated aspects, such as service interfaces, layered approach and
broadcast integration."
}

@INPROCEEDINGS{Agui0611:Comparative,
AUTHOR="Ana Aguiar and Adam Wolisz",
TITLE="Comparative Evaluation of Prediction Heuristics for Wireless Channels",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Impairments in wireless data communication due to time and location
dependent errors can be overcome by using channel-adaptive techniques, like
channel-aware scheduling or  adaptive modulation. These techniques require
information about channel behaviour obtained from channel predictors. In
this paper, we propose and compare the performance of three heuristics for
channel prediction with a reference predictor.

For a more realistic evaluation, we conducted a measurement campaign in
several indoor and outdoor environments typical for WLAN and used the
traces to assess the accuracy of the prediction, additionally to
theoretical Rayleigh channels.

Although the reference algorithm is more accurate is theoretical
scenarios, it is not usable at all in realistic scenarios due to noisy
samples and error propagation.  For the realistic WLAN scenarios, one of
the proposed heuristics is a much simpler and accurate way to predict the
channel behaviour."
}

@INPROCEEDINGS{Agui0611:Utility,
AUTHOR="Ana Aguiar and Adam Wolisz and Horst Lederer",
TITLE="Utility-based Packet Scheduler for Wireless Communications",
BOOKTITLE="The 6th IEEE Workshop on Wireless Local Networks",
DAYS=14,
MONTH=nov,
YEAR=2006,
ABSTRACT="Following widespread availability of wireless Internet, a wide range of
applications with differing QoS requirements must share the wireless
access. The objective of this work is to provide QoS support to different
applications
delivered over a wireless link shared by different users. We propose a
link-layer packet scheduler following the cross layer concept: the
channel-aware scheduling approach is extended by information about the
importance of individual packets for the application. For this purpose we
use utility curves, which map network service delivered to a given data
flow to application-perceived quality. We define a single scheduling metric
which expresses, for each packet, the balance between the quality increase
of the flow
served and the quality loss of the flows that are not.

We evaluated our concept through extensive simulations with mixes of VoIP
and file download flows. The results show that our MaxSum utility-based
scheduler
clearly improves the quality seen by the VoIP flows when compared to a
channel-aware Round Robin (caRR)/Proportional Fair scheduler (PFS),
respectively. Further, this is achieved while delivering similar amount of
data to file download users. We also show how different forms of the
utility curves can be used to achieve differentiated QoS provisioning to
users/applications with different priorities/requirements."
}

@INPROCEEDINGS{Ahdi0601:Vertical,
AUTHOR="Farshad Ahdi and Babak Hossein Khalaj",
TITLE="Vertical Handoff Initiation Using Road Topology and Mobility Prediction",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Networking",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="Interworking in heterogeneous wireless networks is one of the key
objectives in the Next Generation Networks (NGN). Handoff between cellular
and Wireless Local Area Networks (WLANs) can help achieve this aim. In this
paper, a new method for decision-making on vertical handoff initiation is
proposed which is on the basis of road topology information and mobility
prediction. The main distinction between the proposed algorithm and
previous research is exploitation of road topology map of the destination
hotspot within a cellular network. Mobile terminal speed, WLAN dynamic
traffic in the destination hotspot, and topology information are used to
decide on suitability of vertical handoff depending on users current
situation. Simulation results verified that this method outperforms the
conventional algorithm in which topology information is not used."
}

@INPROCEEDINGS{Ahlb0610:Router,
AUTHOR="Michael Ahlberg and Vladimir Vlassov and Terumasa Yasui",
TITLE="Router Placement in Wireless Sensor Networks",
BOOKTITLE="The Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems",
ADDRESS="Vancouver, BC, Canada",
DAYS=7,
MONTH=oct,
YEAR=2006,
ABSTRACT="In this paper we propose and evaluate algorithms
for placement of routers in a wireless sensor
network. There are two major requirements on router
placement. First, a placement must guarantee connectivity,
i.e. every sensor must be able to communicate through
routers with a predefined computer-connected gateway
node. Second, a placement must provide robust communication
in the case of router failures. This is achieved
by placing redundant routers that increase the number
of possible routes. Both requirements should be met by
placing as few routers as possible. The proposed algorithms
compute placement in an efficient and reasonably fast way."
}

@INPROCEEDINGS{Ahlu0611:Port,
AUTHOR="Christer Ahlund and Robert Brannstrom and Karl Andersson and Orjan
Tjernstrom",
TITLE="Port-based Multihomed Mobile {IPv6} for Heterogeneous Networks",
BOOKTITLE="The 31st Annual IEEE Conference on Local Computer Networks (LCN)",
ADDRESS="Tampa, Florida, USA",
DAYS=14,
MONTH=nov,
YEAR=2006,
ABSTRACT="Future wireless networks are expected to be based on coexistence of
multiple different access network technologies. Mobile devices will then be
equipped with multiple wireless interfaces enabling connectivity via
multiple architectures. Different wireless technologies differ widely
considering their capabilities and coverage. This requires a mobile node to
maintain multiple active connections depending on the applications used and
available access networks. To enable this, a mobile node needs to be
multihomed and able to direct traffic flows via different interfaces. This
paper describes a proposal extending Mobile IPv6 with multihoming
functionality. Multhoming is managed using IP address, protocol and port
number."
}

@INPROCEEDINGS{Ahma0604:Biconnected,
AUTHOR="Mazda Ahmadi and Peter Stone",
TITLE="Biconnected Structure for Robotic Sensor Networks",
BOOKTITLE="Fifth International Conference on Information Processing in Sensor Networks
(Work-in-progress track)",
DAYS=19,
MONTH=apr,
YEAR=2006,
ABSTRACT="Like sensor networks, for many distributed autonomous robotic systems, it
is important to maintain communication connectivity among the robots.  That
is, each robot must be able to communicate with each other robot, perhaps
through a series of other robots.  Ideally, this property should be robust
to the removal of any single robot from the system.  In this
work, we define a property of a team's communication graph that
ensures this property, called biconnectivity.  We present a
distributed algorithm to check if a team of robots is biconnected,
prove its correctness, and analyze it theoretically.  We also
provide distributed algorithms to add and remove robots to/from a
multi-robot team while maintaining the biconnected property.  These
two algorithms are implemented and tested in the Player/Stage
simulator."
}

@INPROCEEDINGS{Ahma0605:Performance,
AUTHOR="Javad Ahmadi-Shokouh and Sasan Nikneshan and S. Hamidreza Jamali and
Safieddin Safavi-Naeini",
TITLE="Performance Study of the {VBLAST-Based} {MIMO} System with Smart Passive
Receive Antennas",
BOOKTITLE="23rd Queen's Biennial Symposium on Communications",
ADDRESS="Kingston, Ontario, Canada",
DAYS=29,
MONTH=may,
YEAR=2006,
ABSTRACT="In this paper, we examine the improvements in the performance of a
VBLAST-based Multiple-Input Multiple-Output (MIMO) system equipped with a
recently proposed Smart Passive Receive Antenna Selection (SPRAS) technique
and compare it with the other existing antenna
selection schemes. The simulation results show the superiority
of SPRAS compared to the other selection techniques. Specifically,
when the smart passive receive antenna aperture size increases beyond a
limit, the Bit-Error-Rate (BER) improves significantly. Furthermore, SPRAS
performs as well as a fullcomplexity MIMO structure but with fewer RF
chains."
}

@INPROCEEDINGS{Ahma0609:Extended,
AUTHOR="Rehan Ahmad and Andy Khong and Md. Hasan and Patrick Naylor",
TITLE="An Extended Normalized Multichannel {FLMS} Algorithm for Blind Channel
Identification",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="Blind channel estimation algorithms for acoustic channels have generated
much interest in recent years due to the innovations in consumer products
including, but not limited to, tele- and video-conferencing. The direct
path constrained NMCFLMS algorithm was proposed to enhance noise robustness
of the conventional NMCFLMS algorithm. In this paper, we propose to extend
the direct path constrained NMCFLMS algorithm with the aim of achieving a
higher rate of convergence. This objective is achieved by introducing a
penalty component to the multichannel blind adaptive cost function and we
further derive the proposed extended-NMCFLMS algorithm from first
principles. Simulation results show an improvement, both in convergence
rate and noise robustness, compared to existing NMCFLMS algorithms."
}

@INPROCEEDINGS{Ahma0609:Stereo,
AUTHOR="Jawad {Elsayed Ahmad} and Yoshitate Takakura",
TITLE="{Stereo-Polarimetric} Measurement of pair of Mueller images for Three
Dimensional Partial Reconstruction",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="Stereoscopy is well adapted tool for performing three dimensional partial
reconstruction. Classical stereoscopy uses conventional scalar images for
representing three dimensional objects. Thus all the necessary tasks
(segmentation, classification, edge detection, correspondence matching) are
performed on the classical scalar images. For some particular cases like
improperly illuminated scenes, camera blindness by a bright edge response
and for transparent objects detection, scalar images do not provide us with
the reliable foundation from which precise three dimensional partial
reconstruction can be performed (bad segmentation, hidden contour,
undetected region, false classification). The object of this paper is to
show how, very simply, by controlling the polarization state of the imaging
system we can overcome the above mentioned problems. On the conceptual
level, the contribution of polarimetry to the stereoscopy will be
highlighted by a quantitative analysis of the precision of threedimensional
reconstruction of objects."
}

@INPROCEEDINGS{Ahma0611:Channel,
AUTHOR="Javad Ahmadi-Shokouh and S. Hamidreza Jamali and Safieddin Safavi-Naeini",
TITLE="Channel Estimation for {OFDM-Based} {SPRAS-MIMO} System",
BOOKTITLE="IEEE Globecom 2006 Signal Processing for Communication",
ADDRESS="San Francisco, California, USA",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Multiple input multiple output (MIMO) systems
equipped with Smart Passive Receive Antenna Selection
(SPRAS) technique [2] need the Channel State Information
at Receiver side (CSIR) to optimally and adaptively provide
the same performance as full-complexity MIMO structure. In
this paper, a frequency domain channel estimation method
is proposed for Orthogonal Frequency-Division Multiplexing
(OFDM)-based SPRAS-MIMO system in generalized condition,
and a mathematical method is provided to deduce
both the training sequence and beamformer structure design
during channel estimation. The channel estimation method
is realized in an IEEE 802.l6 based MIMO system and the
simulation results show that this method works well for
different estimation criteria."
}

@INPROCEEDINGS{Ahma0611:Secure,
AUTHOR="Waseem Ahmad and Ashfaq Khokhar",
TITLE="Secure Aggregation in Large Scale Overlay Networks",
BOOKTITLE="IEEE Globecom 2006 - Network and Information Security Systems",
ADDRESS="San Francisco, USA",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Overlay networks have been very useful in solving
large scale data dissemination problems. In this paper, we
consider the case of data gathering which is the inverse of
dissemination problem. In particular, we focus on a scenario
where an organization or a constellation of organizations is
interested in gathering data from large number of nodes spread
across the administrative boundaries. Providing individual nodes
with full assurance that the privacy of their data won’t be
compromised is a critical problem in achieving the true benefits
of this collaborative process. We provide a novel solution to the
problem by employing a threshold homomorphic cryptosystem
which allows processing of encrypted data without revealing
anything about the underlying private data. The threshold
property of the cryptosystem ensures that no single node is able
to decrypt the aggregate results. The proposed solution provides
excellent scale-up properties while preserving privacy and secrecy
of the data even among malicious adversarial constraints."
}

@INPROCEEDINGS{Ahme0601:Successive,
AUTHOR="Nabeel Ahmed and Srinivasan Keshav",
TITLE="A Successive Refinement Approach to Wireless Infrastructure Network
Deployment",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Networking",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="There has been a recent proliferation in wireless infrastructure network
deployments. In a typical deployment, an installer uses either a one-time
site survey or rules of thumb to place wireless access points and allocate
them channels and power levels. Because the access point location problem
is inherently complex and one that requires tradeoffs among competing
requirements, these approaches can result in either dead spots or
significant unintended interference among wireless access points. This
degrades network performance for end clients, with throughput reduction
factors of 4x found in field measurements \cite{autocell}. In this paper,
we take a first step towards improving client performance by coordinating
choices of channels and power levels at wireless access points using a
\emph{successive refinement} approach. Our contributions are two-fold:
First, we develop a mathematical model that crisply defines the solution
space and identifies the characteristics of an optimal channel and
power-level configuration. Second, we present heuristics that, under some
simplifying assumptions, yield near-optimal configurations. We use Monte
Carlo simulations to evaluate the performance of our heuristics. We find
that the choice of heuristics for transmit power control impacts
performance more than the channel allocation strategy, especially at high
densities. Also, surprisingly, randomly assigning channels to access points
appears to be an effective strategy at higher deployment densities. Taken
together, we believe that this study paves the way to designing rapidly
deployable real-world infrastructure networks that also have good
performance"
}

@INPROCEEDINGS{Ahme0606:Design,
AUTHOR="Tansir Ahmed and Kyandoghere Kyamakya and Markus Ludwig",
TITLE="Design, Implementation and Evaluation of a {Context-Aware} Decision
Algorithm",
BOOKTITLE="11th IEEE Symposium on Computers and Communications",
ADDRESS="Pula-Cagliari, Sardinia, Italy",
DAYS=26,
MONTH=jun,
YEAR=2006,
ABSTRACT="Wireless networks and mobile terminals are evolving towards being
heterogeneous. In this environment, intelligent handover decision, beyond
traditional ones that are based on only signal strength, is needed so that
terminals can select the best option available from diverse networks and
services as per user requirements. In the process, it would enable user
applications to switch automatically between active interfaces that best
suit them based on application requirements and interface capabilities and
to use multiple radio interfaces simultaneously ensuring the optimum usage
of the network resources available to the terminal. To fulfill the above
requirements, this paper describes and evaluates a context-aware vertical
handover decision algorithm based on the Analytic Hierarchy Process (AHP)
suitable for multimode mobile devices in heterogeneous networks."
}

@INPROCEEDINGS{Ahme0606:Performance,
AUTHOR="Mubashar Mushtaq and Toufik Ahmed",
TITLE="Adaptive Packet Video Streaming over {P2P} Networks using Active
Measurements",
BOOKTITLE="11th IEEE Symposium on Computers and Communications",
ADDRESS="Pula-Cagliari, Sardinia, Italy",
DAYS=26,
MONTH=jun,
YEAR=2006,
ABSTRACT="In this paper we consider the problem of real-time streaming of IP video
packet over Peer-to-Peer networks (P2P) from multiple senders to a single
receiver. P2P networks are characterized by a potentially large and highly
dynamic population of hosts that join and leave the network frequently. We
present the design and evaluation of a quality adaptation streaming
mechanism in a multi-source streaming to a single receiver. The main
challenge in the design of this mechanism is (1) selection of senders peers
nodes; (2) stream switching among the peers; (3) optimizing video quality
by active measurements of links; and
(4) enhancing the overall Quality of Service (QoS). Our key technique to
provide quality adaptation is based on active measurements of network links
and selection of sender peers to enhance the overall throughput. We used
video traffic organised as MDC (Multiple Description Coding) layers. This
later provides high error resilient and good tradeoffs between quality and
throughout. Our simulations results using ns2 show that our solution allows
to efficiently utilizing available network bandwidth of sending peers and
allow maximizing streaming qualities at the reception peer."
}

@INPROCEEDINGS{Ahme0607:VANETCODE,
AUTHOR="Shabbir Ahmed and Salil Kanhere",
TITLE="{VANETCODE:} Network Coding to Enhance Co-operative Downloading in
Vehicular {Ad-Hoc} Networks",
BOOKTITLE="IWCMC 2006 Wireless Ad Hoc and Sensor Networks",
DAYS=3,
MONTH=jul,
YEAR=2006,
ABSTRACT="Inter-vehicular communication is fast emerging as a popular application for
mobile ad-hoc networks. Content distribution in Vehicular Ad-Hoc Networks
(VANET) is particularly challenging due to the high mobility, rapidly
changing topology and intermittent connectivity observed in these networks.
Effective mechanisms are needed to enable rapid sharing of real-time such
as traffic warnings and multimedia-rich files. In this paper, we propose a
novel network coding based co-operative content distribution scheme called
VANETCODE. The randomization introduced by the coding scheme makes
distribution efficient. Our scheme also leverages on the broadcast nature
of the wireless medium to expedite the dissemination of the encoded blocks
amongst the one-hop neighbors and is entirely independent of routing. We
have carried out extensive simulations to demonstrate that VANETCODE
effectively enhances cooperative content sharing in VANETs without
introducing additional overhead."
}

@INPROCEEDINGS{Ahme0608:Phase,
AUTHOR="Hashim Ahmed and Alex Kirkham and Clare Allen and Alex Freeman and Rowland
Illing and Mark Emberton",
TITLE="A Phase 1 study evaluating {HIFU} hemiablation of unilateral localised
prostate cancer",
BOOKTITLE="6th International Symposium on Therapeutic Ultrasound",
ADDRESS="Oxford, United Kingdom",
DAYS=30,
MONTH=aug,
YEAR=2006,
ABSTRACT="Background and rationale: The present choice for men with localized
prostate cancer lies between two extremes of care: active surveillance and
radical treatment.  It i generally accepted that the difference between
these in mortality is probably very small, but radical treatment carries
tremendous morbidity for approximately half of men.  By treating only the
half of the gland with prostate cancer in cases with unilateral disease, to
what extent can morbidity (impotence, incontinence, rectal problems) be
reduced?
Method: 40 men with TRUS proven unilateral prostate cancer will be
recruited into  this Phase 1 trial with two stages. Stage 1: verifying
unilateral with multi-sequence MRI scan and 5mm transperineal template
biopsy mapping.  Stage 2: those men with verified unilateral prostate
cancer will be treated with the Sonablate 500 HIFU to that side only. 
Analysis of primary outcomes (morbidity, quality of life), and secondary
outcomes (PSA nadir, PSA kinetics, biopsy at 6 months) will be carried
out.
Results: results to date will be presented."
}

@INPROCEEDINGS{Ahme0609:Iterative,
AUTHOR="Sajid Ahmed and Tharmalingam Ratnarajah and Colin Cowan",
TITLE="Iterative Equalization For Severe Time Dispersive {MIMO} Channels",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this work, minimum mean squared error (MMSE) iterative equalization
method for a severe time dispersive MIMO channel is proposed. To mitigate
the severe time dispersiveness of the channel single carrier with cyclic
prefix (SCCP) is employed and the equalization is performed in frequency
domain. The use of cyclic prefix (CP) and equalization in frequency domain
simplify the challenging problem of equalization in MIMO channels due to
the both inter-symbol-interference (ISI) and co-channel interference (CCI).
The proposed iterative algorithm work in two stages; first stage estimate
the transmitted frequency domain symbols using low complexity MMSE
equalizer. The second stage finds the \textit{a posteriori} probabilities
of the estimated symbols to find their means and variances to use in the
MMSE equalizer in the following iteration. Simulation results show the
superior performance of the iterative algorithm when compared with the
conventional MMSE equalizer."
}

@INPROCEEDINGS{Ahme0609:SKVR,
AUTHOR="Shabbir Ahmed and Salil Kanhere",
TITLE="{SKVR:} Scalable Knowledge-based Routing Architecture for Public Transport
Networks",
BOOKTITLE="Third ACM International Workshop on Vehicular Ad Hoc Networks",
ADDRESS="Los Angeles, California, USA",
DAYS=29,
MONTH=sep,
YEAR=2006,
ABSTRACT="Vehicular AdHoc Networks (VANET) can be treated as special kinds of
Delay-tolerant Networks (DTN) where end-to-end path might never be
possible. As a result, mobile ad hoc (MANET) routing protocols perform
poorly on DTNs. Moreover, traditional routing architecture is not scalable
for public transport networks with large numbers of nodes (public
transports). In this paper, we introduce a hierarchical knowledge-based DTN
routing scheme for public transport networks that is not only scalable but
also communication efficient. We evaluate our design using simulation with
real bus traces with a large number of buses and compare it with other
routing protocols."
}

@INPROCEEDINGS{Ahme0610:Implementation,
AUTHOR="Sayed Ahmed and Mehmet Eskicioglu and Peter Graham",
TITLE="Design and Implementation of a Sensor Network based Location Determination
Service for use in Home Networks",
BOOKTITLE="First IEEE International Workshop on Intelligent Systems Techniques for
Wireless Sensor Networks",
ADDRESS="Vancouver, British Columbia, Canada",
DAYS=9,
MONTH=oct,
YEAR=2006,
ABSTRACT={Location determination is a fundamental component enabling context
aware home applications. Ultrasound, floor sensors and computer
vision, among others, have been proposed for location determination,
each with its own benefits and limitations. In this paper we discuss
the design, implementation and evaluation of a location
determination system based on sensor networks. Our implementation
includes three components: the location determination system which
adapts and extends the Motetrack system for in-home use, a
location storage system, and a middleware interface to allow home
applications to access historical location information. Our system
uses Crossbow Mica2 and Mica2Dot sensors to provide 28th,
50th, 85th and 97th percentile location errors of
under 1, 1.5, 2 and 3 meters, respectively. This will support most
home services which typically require {"}room level{"} accuracy.}
}

@INPROCEEDINGS{Ahme0610:Secure,
AUTHOR="Fawad Ahmed and Mohammed Yakoob Siyal",
TITLE="A Secure and Robust {DCT-Based} Hashing Scheme for Image Authentication",
BOOKTITLE="10th IEEE International Conference on Communication Systems 2006",
ADDRESS="Singapore, Singapore",
DAYS=30,
MONTH=oct,
YEAR=2006,
ABSTRACT="The purpose of an image hash function is to provide a compact
representation of an image that can be used for authentication purposes.
Designing a good image hash function requires the consideration of many
issues like robustness, security and tamper detection with precise
localization. In this paper, we focus our attention towards DCT-based
hashing schemes for image authentication. We first highlight the problems
that we have discovered in some of the existing DCT-based hashing schemes
proposed in the literature. We then propose solutions to counter these
problems. We present experimental results to show the effectiveness of our
proposed scheme. Although we focus on DCT-based hashing techniques,
however, the type of problems highlighted in this paper may be present in
other spatial or transform domain image hashing techniques as well."
}

@INPROCEEDINGS{Ahn0602:Proactive,
AUTHOR="Sungjin Ahn and Daeyoung Kim",
TITLE="Proactive {Context-Aware} Sensor Networks",
BOOKTITLE="3rd European Workshop on Wireless Sensor Networks",
ADDRESS="ETH Zurich, Switzerland",
DAYS=13,
MONTH=feb,
YEAR=2006,
ABSTRACT="We propose a novel context detection mechanism in Wireless Sensor Networks,
called PROCON. In PROCON, context decisions are made in a distributed way,
by cooperation of nodes connected through a context overlay on the network.
As a result, the sensor network can deliver context level information, not
low level sensing data, directly to the proper actuators. Moreover, PROCON
achieves highly efficient energy consumption compared to the existing
centralized context detection mechanism. The analysis and simulation
results show that the proposed mechanism outperforms the existing
centralized mechanism in average energy consumption, capability of
mitigating congestion to a base station, context service lifetime, and
reliability."
}

@INPROCEEDINGS{Ahn0604:Building,
AUTHOR="Sangim Ahn",
TITLE="Building a Bridge for Heterogeneous Sensor Networks",
BOOKTITLE="Third International Workshop on Software Technologies for Future Embedded
and Ubiquitous Systems",
ADDRESS="Gyeongju, Korea",
DAYS=27,
MONTH=apr,
YEAR=2006,
ABSTRACT="According as home networks become a practical reality, wireless sensor
networks are getting increasingly into the spotlight to monitor and control
environmental conditions at home. Some methods need to exchange information
in heterogeneous wireless sensor networks, such as different network
protocol, different embedded operating system, and different manufacturers
to produce sensor nodes. We propose interoperable middleware architecture
with an intelligent bridge. This approach offers two contributions to the
study of information exchange in heterogeneous constraints: (1) We
described rule management technique with interoperability in an intelligent
bridge. (2) We defined general message exchange mechanism. They are
composed of three factors. First, a message format has elements which are
message type, destination, source, number of message, and contents. Second,
a message style is XML documents. Third, a message transmission protocol is
SOAP, a lightweight XML-based messaging protocol. To demonstrate the
feasibility of our approach, we conducted a case study on sensing event
handle in home environment. We confirmed the effect of information exchange
mechanism with extensibility and flexibility."
}

@INPROCEEDINGS{Ahn0604:Tone,
AUTHOR="Jae-hyun Ahn and Jeongkyun Yun and Saewoong Bahk",
TITLE="Tone-based Access Scheme with Repetitive Contention in {IEEE} {802.11}
{DCF}",
BOOKTITLE="The 16th Joint Conference on Communication \& Information, 2006",
ADDRESS="Paradise Hotel, Busan, Korea",
DAYS=26,
MONTH=apr,
YEAR=2006,
ABSTRACT="There are two coordination functions in IEEE 802.11 standard. One is PCF,
polling based function, and the other is DCF, contention based function.
DCF is simpler than PCF but the performance is similar with the latter.
That's the reason why DCF is more popular than PCF. However, DCF has a risk
of collision with other nodes in the network because the function is a
distributed contention based one. CSMA/CA of DCF has collision avoidance
algorithm in it, but the performance of avoidance algorithm is not good. In
this paper we proposed a new scheme called TAR(Tone-based Access scheme
with Repetitive conention). In TAR, there is narrow contention-only channel
other than original data transmitting channel, so that both a data
transmission and the contention can be performed simultaneously. The TAR
uses the same contention concept with the CSMA/CA, but it has the
originality for the narrow contention channel and the repetitive contention
scheme which greatly reduce the collision probability. We proved the
performance of TAR by some simulations, and it showed good results."
}

@INPROCEEDINGS{Ahn0605:Fundamental,
AUTHOR="Joon Ahn and Bhaskar Krishnamachari",
TITLE="Fundamental Scaling Laws for {Energy-Efficient} Storage and Querying in
Wireless Sensor Networks",
BOOKTITLE="The Seventh ACM International Symposium on Mobile Ad Hoc Networking and
Computing",
ADDRESS="Florence, Italy",
DAYS=22,
MONTH=may,
YEAR=2006,
ABSTRACT="We use a constrained optimization framework to derive
fundamental scaling laws for both unstructured sensor
networks (which use blind sequential search for querying)
and structured sensor networks (which use efficient
hash-based querying). We find that the scalability of a
sensor network's performance depends upon whether or not
the increase in energy and storage resources with more
nodes is outweighed by the concomitant application-specific
increase in event and query loads. Let $m$ be the number of
events sensed by a network over a finite period of
deployment, $q$ the number of queries for each event, and
$N$ the size of the network. Our key finding is that
$q^{1/2}\cdot m$ must be $O(N^{1/4})$ for unstructured
networks, and $q^{2/3}\cdot m$ must be $O(N^{1/2})$ for
structured networks, to ensure scalable network
performance. These conditions determine (i) whether or not
the energy requirement per node grows without bound with
the network size for a fixed-duration deployment, (ii)
whether or not there exists a maximum network size that can
be operated for a specified duration on a fixed energy
budget, and (iii) whether the network lifetime increases or
decreases with the size of the network for a fixed energy
budget. We discuss the practical implications of these
results for the design of hierarchical two-tier wireless
sensor networks."
}

@INPROCEEDINGS{Ahn0608:Clinical,
AUTHOR="Sangwon Ahn",
TITLE="Clinical Experience for the Palliative Treatment of Pancreatic Cancer Using
{HIFU}",
BOOKTITLE="6th International Symposium on Therapeutic Ultrasound",
ADDRESS="Oxford, United Kingdom",
DAYS=30,
MONTH=aug,
YEAR=2006,
ABSTRACT="Purpose: The purpose of our study is to evaluate the effectiveness and
usefulness of clinical application of HIFU in the palliative treatment of
pancreatic cancer.

Materials and Methods: The HIFU treatment was performed in 22 patients of
pancreatic cancer from Oct. 2004 to Aug. 2006 under general anesthesia. The
male were 11(mean age:58.3Yrs) and the female were 11 cases(mean
age:53.4Yrs). The region of tumor masses were follows: pancreatic head in
11, body in 9 and tail in 2 cases. We analyzed the necrosis of mass
compared with pre- and post-HIFU MR \&/or CT images, the clinical symptom
change after HIFU, echo change of mass during HIFU, laboratory finding of
Amylase and Lipase before and after HIFU. 

Results: The partial necrotic findings of 17 cases were identified by
comparing MR \&/or CT images of pre- and post-HIFU, the significant
decrease of pain was found in the 8 cases among 12 patient of tumor-related
severe pain (66.7\%). 16 cases showed increased echo change and 6 cases
revealed no visible echo change during HIFU procedure. Among 6 cases with
no visible echo change, 4 cases showed partial necrosis of tumor mass, only
2 case revealed no visible tumor necrosis, but this case showed remarkable
decrease of pain.  Only 1 case of pancreatic pseudo-cyst and another 1 case
of 3rd drgree burn of anterior abdominal wall were found as HIFU-related
complications. 

Conclusions: Our clinical experience demonstrates that HIFU for pancreatic
cancer make pain control as well as tumor necrosis, and so HIFU is a good
method of palliative treatment to improve patient's quality of life."
}

@INPROCEEDINGS{Ahn0610:Analyzing,
AUTHOR="Jong-Suk Ahn",
TITLE="Analyzing the Effect of a Block {FEC} Algorithm's Symbol Size on Energy
Consumption in Wireless Sensor Networks",
BOOKTITLE="International Symposium on Ubiquitous Computing Systems",
ADDRESS="COEX, Seoul, Korea",
DAYS=11,
MONTH=oct,
YEAR=2006,
ABSTRACT="This paper evaluates the effect of a block Forward Error Correction (FEC)
algorithm's symbol size on power consumption in wireless sensor networks.
The wireless channel of sensor networks shows a high Bit Error Rate (BER)
due to their low transmission power and their random deployment ignoring
geographical obstacles. For resisting against these frequent bursty
propagation errors, sensor nodes would adopt a block FEC algorithm whose
recovery unit is a symbol not an individual error bit. Different FEC symbol
sizes influence the number of packet retransmissions over a given sensor
channel even if the FEC code for each packet is allocated with the same
amount of check bits. They also affect the computational energy since their
decoding and encoding complexities are different even with the same size of
packets. The analytical analysis confirms that the power expenditure for
computation and retransmission closely depends on the selection of a FEC
symbol size over wireless channels modeled as random bit errors. The
evaluation based on long-term sensor traffic traces indicates that the
appropriate FEC symbol size consumes the total sensor node's energy
consumption by 85\% less than other ones over sensor channels with a light
BER."
}

@INPROCEEDINGS{Ahro0604:Distributed,
AUTHOR="Ehoud Ahronovitz and Jean-Claude {König} and Clément Saad",
TITLE="A Distributed Method for Dynamic Resolution of {BGP} Oscillations",
BOOKTITLE="20th IEEE International Parallel \& Distributed Processing Symposium",
ADDRESS="Rhodes Island, Greece",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="Autonomous Systems (AS) in the Internet use different protocols for
internal and external routing. BGP is the only external protocol. It allows
ASes to define their own routing policy independently. Many papers cited in
reference deal with a divergence behavior due to this flexibility. In fact,
when routing policies are not conflicting, BGP is self-stabilising, which
means that whatever the network configuration, BGP converges to a stable
solution. Unfortunately, as experienced on the Internet, AS routing
policies may be uncoherent, thus generating oscillations. In this paper we
propose a distributed dynamic method for detecting and solving oscillations
of BGP. It respects private policy choices and requires only a few low
level constraints in order to converge to a stable solution. Essentially, a
router has to maintain only local path stateful information to detect
instabilities. In this case, it generates and launches a token linked to a
route. Each router makes the decision to forward or not the token according
to local data and local policy. If the originating router receives back the
token, then it marks the route as barred. Nevertheless, routes may
furtherly be unmarked. Finally, we express and define what coherence
between routing policies means."
}

@INPROCEEDINGS{Ahuj0601:Using,
AUTHOR="Sadhna Ahuja and Tao Wu and Ora Lassila",
TITLE="Using the Semantic Web to Enhance the Digital Living Experience",
BOOKTITLE="CCNC2006 Special session technical papers",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="With the multitude of home electronics devices available, it is becoming
difficult for consumers to manage their digital content. The Digital Living
Network Alliance (DLNA) has specified an architecture that enables
interoperability between the various devices and allows a user to enjoy the
desired content. However, in a typical home, users might store thousands of
multimedia items across several devices and it is tedious to search every
single device individually. Additionally, in the case of a metadata-based
content search, not all metadata or the semantics associated with it might
be available, resulting in incomplete search results. In this paper, we
extend the DLNA architecture to address these problems. We use a Virtual
Media Server as a service-enabling platform and also to hide the complexity
of distributed content storage. Furthermore, we use the Semantic Web to
provide an enriched and more comprehensive metadata-based multimedia search
experience."
}

@INPROCEEDINGS{Ahuj0611:Algorithms,
AUTHOR="Satyajeet Ahuja and Marwan Krunz",
TITLE="Algorithms for Server Placement in {Multiple-Description-Based} Media
Streaming",
BOOKTITLE="IEEE Globecom 2006 - Multimedia Communications",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT={Multiple description coding (MDC) has emerged as a powerful technique for
reliable real-time communications over lossy packet networks, such as the
Internet and wireless ad hoc networks. In its basic form, it involves
encoding a media stream into m substreams that are send independently from
a source to a destination. Each of these substreams can be decoded
independently and with every successful reception of a substream final
quality of the decoded signal improves. In this paper, we consider the
problem of placing a set of servers in the network such that a desired QoS
can be provided to a community of clients that request MDC coded traffic.
Specifically, we consider the server placement (SP) problem where the goal
is to identify the {"}optimal{"} server positions such that if MDC content
is placed at these servers a cost function that is a linear combination of
average delay and path
disjointness is minimized. We propose an MILP formulation and
a highly efficient heuristic to solve the SP problem. Simulations
are conducted to evaluate the performance of the proposed heuristic
and is compared with the optimal solution obtained by using the MILP
solutions.}
}

@INPROCEEDINGS{Ai0606:Novel,
AUTHOR="Si Ai and Shu-hung Leung and Chi-sing Leung and Rong-Fang Song",
TITLE="A Novel Adaptive {OFDM} Receiver with Second Order Polynomial Nyquist
Window Function",
BOOKTITLE="ICC 2006  Signal Processing for Communications",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT={A new receive scheme and a class of time domain second order polynomial
Nyquist window functions are proposed and applied to orthogonal
frequency-division multiplexing (OFDM) systems for reducing frequency
offset induced inter-carrier interference (ICI) at the receiver. The signal
to ICI plus noise ratio (SINR) and bit error ratio (BER) performances of
the receiver are analyzed in this paper. We also propose a method to select
the optimum window parameters to maximize the SINR of the receiver thus
providing an adaptive receiving capability. The results show that the
proposed method that enables the use of unity roll-off factor provides
better SINR and BER than conventional receive methods whose roll-off
factors are generally less than one. The new second order polynomial window
is shown to provide better performance than raised cosine and {"}better
than{"} Nyquist window.}
}

@INPROCEEDINGS{Ai0610:Cross,
AUTHOR="Jing Ai and Alhussein Abouzeid and Zhenzhen Ye",
TITLE="Cross-layer Optimal Decision Policies for Spatial Diversity Forwarding in
Wireless Ad Hoc Networks",
BOOKTITLE="The Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems",
ADDRESS="Vancouver, BC, Canada",
DAYS=7,
MONTH=oct,
YEAR=2006,
ABSTRACT={In order to adapt to the time-varying nature of wireless channels,
various channel-adaptive schemes have been proposed to exploit
inherent spatial diversity in wireless ad hoc networks where there
are usually alternate forwarding nodes available at a given
forwarding node. However, existing schemes along this line are
designed based on heuristics, implying room for performance
enhancement. Thereby, to seek a theoretical foundation for improving
spatial diversity gain, we formulate the selection of the next-hop
relay as a sequential decision problem and derive a general
{"}Optimal Stopping Relaying (OSR){"} framework for designing such
spatial-diversity schemes. As a particular example, assuming
Rayleigh fading channels, we implement an OSR strategy to optimize
information efficiency in a protocol stack consisting of Greedy
Perimeter Stateless Routing (GPSR) and IEEE 802.11 MAC protocols. We
present an analysis of the algorithm for a single node. In addition,
we perform extensive simulations (using QualNet) to evaluate the
end-to-end performance of the proposed forwarding strategy. The
results demonstrate the superiority of OSR over other existing
schemes, and sheds new insights into the design of spatial-diversity
based forwarding strategies.}
}

@INPROCEEDINGS{Aiac0604:Enhanced,
AUTHOR="Hervé Aiache and Vania Conan and Gregoire Guibe and Raymond Knopp and
Jeremie Leguay and Christophe J. {Le Martret} and Navid Nikaein",
TITLE="Enhanced Integrated {IP/MAC/PHY} services for ad-hoc networks",
BOOKTITLE="IEEE INFOCOM 2006 Poster and Demo Session",
ADDRESS="Barcelona, Spain",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="This demo presents a new wireless ad-hoc network architecture that 
supports multi-hop communications efficiently. This architecture contains a
cluster based MAC layer and a reliable PHY layer closely integrated. Link
state routing tied to the MAC layer through a cross-layer interface to
improve overall performances. We have implemented the architecture in
software and ported it on an RT (Real Time) Linux platform equipped with a
PCMCIA board containing an FPGA and two RF chains. We will demonstrate the
equipment for audio and video applications through multi-hop communication."
}

@INPROCEEDINGS{Aiac0606:XIAN,
AUTHOR="Hervé Aiache and Vania Conan and Jeremie Leguay and Mikael Levy",
TITLE="{XIAN:} {Cross-Layer} Interface for Wireless Ad hoc Networks",
BOOKTITLE="Mediterranean Ad Hoc Networking Workshop 2006",
ADDRESS="Lipari, Italy",
DAYS=14,
MONTH=jun,
YEAR=2006,
ABSTRACT="In the highly dynamic and unpredictable environment of MANETs, cross-layer
design is receiving growing interest but lacks experimental validation
tools. This paper proposes Xian, a Cross-layer Interface for wireless Ad
hoc Networks, a generic interface for experimenting cross-layer designs
with legacy 802.11 protocols. Xian can be used as a service by other
network layers or system components to access information about
configuration and performance of MAC/PHY layers. The interface is fully
implemented and is available for Linux over the Madwifi 802.11 driver. We
exemplify its use for the design of various QoS routing schemes and provide
experimental demonstration of their potential benefits."
}

@INPROCEEDINGS{AICH0603:Enhancing,
AUTHOR="Sofiène {Ben aicha} and Mounir Frikha",
TITLE="Enhancing {IEEE} {802.11} standard in congested environments",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="The aim of this study is to propose a set of methods in order to enhance
the QoS performances in the WLAN 802.11 in congested environments. First,
we have presented the standard IEEE 802.11. Then, we have considered the
issue of the congested environments and we have proposed new approaches
based on a Contention Window slow decrease scheme, more adapted to
congestion context. Based on simulation, we have finally analysed the
results and the performances of WLAN using the new approaches."
}

@INPROCEEDINGS{Aida0605:Disconnected,
AUTHOR="Hiroto Aida and Masaya Kadota and Jin Nakazawa and Hideyuki Tokuda",
TITLE="A Disconnected Bayesian Analysis for Wireless {Sensor-Actuator} Networks",
BOOKTITLE="Third International Conference on Networked Sensing Systems",
ADDRESS="Chicago, Illinois, USA",
DAYS=31,
MONTH=may,
YEAR=2006,
ABSTRACT={This paper proposes a novel context inference mechanism for sensor networks
called HIHORB, which enables the context inference based on Bayesian
networks by {"}in-network{"} sensor nodes that are disconnected from the
sync node. In a statically centralized sensor-actuator network, the
backbone server connected to the sync node is the single static node that
is always responsible for inference and actuation. Therefore, if the sensor
nodes are disconnected from the backbone server due to power failure,
movement, or other events of relay nodes, they cannot keep their actuation
capability since they rely context inference functionality on the backbone
server. HIHORB achieves robustness against the disconnection by delegating
a part of inference and actuation responsibility to the {"}in-network{"}
sensor nodes. When a sensor node detects a disconnection, meaning that the
backbone server cannot continue to infer contexts, the sensor node
temporarily starts inference and actuations based on inferred contexts.
When the node detects a reconnection, it delegates the inference/actuation
responsibility back to the backbone server. By delegating the
responsibility back and forth, HIHORB can adapt to the network failure
keeping a powerful context inference scheme based on Bayesian networks.
This paper shows a prototype of the system using MICAz Motes and evaluates
it with various contexts with different complexity to infer. The evaluation
shows that our mechanism decreases the network/computational load in sensor
nodes, thereby entailing energy efficiency with flexible and robust context
inference using Bayesian networks.}
}

@INPROCEEDINGS{Aime0606:Wireless,
AUTHOR="Marco Aime and Giorgio Calandriello and Antonio Lioy",
TITLE="A wireless distributed intrusion detection system and a new attack model",
BOOKTITLE="11th IEEE Symposium on Computers and Communications",
ADDRESS="Pula-Cagliari, Sardinia, Italy",
DAYS=26,
MONTH=jun,
YEAR=2006,
ABSTRACT="Denial-of-Service attacks, and jamming in particular, are a threat to
wireless networks because they are at the same time easy to mount and
difficult to detect and stop. In our paper we propose a distributed
intrusion detection system in which each node monitors the traffic flowing
on the network and collects relevant statistics about it. By combining each
node's view the network is able to tell if (and which type of) an attack
happened or if the channel is just saturated. However, a shared detection
system like this one opens the possibility for misuse of the system itself.
We discuss the impact of the misuse on the system and the best strategies
for each actor in the system."
}

@INPROCEEDINGS{Aimi0608:Dynamic,
AUTHOR="Liang Aimin",
TITLE="Dynamic Mobile Content Adaptation Abstracting in Device Independent Web
Engineering",
BOOKTITLE="12th Asia-Pacific Conference on Communications",
ADDRESS="Busan, Republic of Korea",
DAYS=31,
MONTH=aug,
YEAR=2006,
ABSTRACT="When delivering content across proliferations of presentation devices,
current web engineering tries to allow the web accessible for varieties
accessing mechanisms and universal user modes. An intelligent content
amalgamation mechanism is researched to meet current web information
systems. It provides flexible networking infrastructure with effective
content adaptations practices. Including an abstracted network context
logical model, a device independent metadata definition for web resources,
and autonomous-agents based adaptation algorithms reorganization, this
framework serves an optimized dynamic intelligent mobile web-engineering
environment."
}

@INPROCEEDINGS{Aimi0611:General,
AUTHOR="Liang Aimin",
TITLE="A General Mobile Content Adaptation Framework in Device Independent Web
Engineering",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="When delivering content across proliferations of presentation devices,
current web engineering tries to allow the web accessible for varieties
accessing mechanisms and universal user modes. An intelligent content
amalgamation mechanism is researched to meet current web information
systems. It provides flexible networking infrastructure with effective
content adaptations practices. Including an abstracted network context
logical model, a device independent metadata definition for web resources,
and autonomous-agents based adaptation algorithms reorganization, this
framework serves an optimized dynamic intelligent mobile web-engineering
environment."
}

@INPROCEEDINGS{Ains0605:Analysis,
AUTHOR="Thomas Ainsworth and Mark Williams and Tim Payne and Jong-Sen Lee",
TITLE="Analysis of Polarimetric Variability in Simulated Vegetation Ground Cover",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="We employ simulation to cover a range of vegetation and ground surface
parameters, such as stem height, stem density, total biomass, surface
roughness and moisture content, etc. A subsequent systematic polarimetric
analysis, employing both coherent and incoherent methods, will be used to
determine the polarimetric variations induced by the changes of the ground
cover and/or underlying surface scattering parameters."
}

@INPROCEEDINGS{Aipp0605:Analysis,
AUTHOR="Ryan Aipperspach and John Canny and Elliot Cohen",
TITLE="Analysis and Prediction of Sensor Data Collected From Smart Homes",
BOOKTITLE="Pervasive 2006",
ADDRESS="Dublin Ireland",
DAYS=7,
MONTH=may,
YEAR=2006,
ABSTRACT={There are a growing number of {"}smart home{"} projects that consider the
deployment of large numbers of simple {"}on/off{"} sensors in the home. We
use the data from these sensors to predict the future actions of
inhabitants. We consider data from sensor installations in three real
homes, and we explore their relationship to patterns of human movement and
their implications for prediction of future behavior. We then present a
simple and efficient system for making predictions on streams of sensor
data, achieving accuracy of up to 53\% and running times sufficient for
real-time operation.}
}

@INPROCEEDINGS{Aipp0609:Quantitative,
AUTHOR="Ryan Aipperspach and Tye Rattenbury and Allison Woodruff and John Canny",
TITLE="A Quantitative Method for Revealing and Comparing Places in the Home",
BOOKTITLE="Eighth International Conference on Ubiquitous Computing (Ubicomp 2006)",
ADDRESS="Orange County, California, USA",
DAYS=17,
MONTH=sep,
YEAR=2006,
ABSTRACT="Increasing availability of sensor-based location traces for individuals,
combined with the goal of better understanding user context, has resulted
in a recent emphasis on algorithms for automatically extracting users'
significant places from location data.  Place-finding can be characterized
by two sub-problems, (1) finding significant places, and (2) assigning
semantic labels to those places. Existing algorithms focus on the first
sub-problem and on finding city-level places. We use a principled approach
in adapting Gaussian Mixture Models (GMMs) to provide a first solution for
finding significant places within the home. We also present a novel metric
for quantifying the similarity between places, which has the potential to
assign semantic labels to places by comparing them to a library of known
places. We discuss several implications of these new techniques for the
design of Ubicomp systems."
}

@INPROCEEDINGS{Aiss0606:Sonia,
AUTHOR="Ghassane Aniba and Sonia Aissa",
TITLE="{Multi-User} Capacity Maximization for {MIMO} Gaussian Broadcast Channels",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="In this paper we consider the problem of maximizing multi-user capacity of
a multiple-antenna Gaussian broadcast channel. To deal with this problem,
we must provide the optimal users' covariances that maximize the capacity.
Those covariances represent, in the same time, the selection of users to
transmit to, and their corresponding allocated power. In this vein, many
papers use iterative algorithms to provide the optimal solution, however,
these algorithms introduce a high order of complexity when the number of
users is high, and suffer from memory drawback. Herein, we show that in a
multi-user multi-antenna system, there exists an optimal subset of active
users that maximizes the capacity, and that such iterative algorithms can
be executed considering a group of users instead of all users. In addition,
we present a new algorithm which makes a suboptimal selection of such
group, referred to as the Best Group (BG). This novel algorithm can be used
jointly with any optimal power allocation algorithm to provide the
covariances which maximize the capacity. Results show that even if the BG
selection algorithm is sub-optimal, it is at least 5 times faster that
other algorithms and introduces a negligible reduction in the broadcast
capacity."
}

@INPROCEEDINGS{Aiss0611:BER,
AUTHOR="Sonia Aissa and Ghassane Aniba",
TITLE="{BER} Analysis of {STBC} with Packet Combining in {MIMO} Rayleigh Fading
Channels: {LLR-Based} Approach",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="In this paper, we analyze the bit error rate (BER) performance of
orthogonal space-time block coding (STBC) using M-ary quadrature
amplitude modulation (M-QAM) along with packet combining over
multiple-input multiple-output (MIMO) Rayleigh fading channels. A
log-likelihood ratio (LLR) based approach is used to present
analytical BER expressions for different STBC settings with packet
combining. Specifically, based on exact and approximate
distributions for the LLRs, we present a simple approach for the
analytical formulation of the system's ensuing BER. In particular,
considering the 16-QAM case of study, we provide an exact formula
for the aggregate LLR distribution in the case of two transmissions,
and derive an exact closed-form expression for the BER. For higher
number of transmissions, an approximation of the error function,
erf(.), is presented and used to derive the LLR distributions and
ensuing BER formulae. The derived expressions are shown to be very
accurate and easily generalizable to other QAM modulations. The
proposed BER analytical model is validated through simulations
considering transmission over additive white Gaussian noise (AWGN)
and MIMO Rayleigh fading channels, for different STBC mappings,
different values of combined transmissions, and considering
constellation rearrangement (CoRe)."
}

@INPROCEEDINGS{Aiva0611:Requirements,
AUTHOR="Efthimia Aivaloglou and Stefanos Gritzalis and Harry Skianis",
TITLE="Requirements and Challenges in the Design of Privacy-aware Sensor Networks",
BOOKTITLE="IEEE Globecom 2006- World Class Solutions - Networking the Globe",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Sensor networks are set to become a truly ubiquitous technology that 
will affect the lives of the people in their application environment.
While providing the opportunity for sophisticated, context-aware services,
at the same time sensor networks impose great privacy risks. This paper
discusses privacy issues in sensor networks, by identifying the
requirements for privacy preserving deployments, analysing the challenges
faced when designing them, and discussing the main solutions that have been
proposed."
}

@INPROCEEDINGS{Ajdl0609:Spatio,
AUTHOR="Thibaut Ajdler and Robert Konsbruck and Olivier Roy and Luciano Sbaiz and
Emre Telatar and Martin Vetterli",
TITLE="{Spatio-Temporal} Sampling and Distributed Compression of the Sound Field",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="We investigate the spatio-temporal characteristics of the sound field.
Spatial sampling using a set of microphones is studied for different array
topologies. The reconstruction problem is also discussed. Distributed
compression is then addressed using an information-theoretic point of view.
In particular, optimal rate-distortion tradeoffs are derived for a linear
network setup and a hearing aids configuration."
}

@INPROCEEDINGS{Akar0606:Optimal,
AUTHOR="Mehmet Akar",
TITLE="Optimal power and handoff control for {CDMA} wireless networks",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="In this paper, joint downlink power control and handoff design is
formulated as optimization problems that are amenable to dynamic
programming (DP). Based on the DP solutions, optimal and suboptimal
algorithms are proposed. These algorithms present a paradigm shift in
integrated handoff/power control by capturing the tradeoff between user
satisfaction and network overhead, therefore enjoy the advantages of joint
resource allocation, and provide significant improvement over existing
methods. The achievable gains and the tradeoffs in both algorithms are
verified through simulations."
}

@INPROCEEDINGS{Akay0604:Achieving,
AUTHOR="Enis Akay and Ersin Sengul and Ender Ayanoglu",
TITLE="Achieving Full Spatial Multiplexing and Full Diversity in Wireless
Communications",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Phy/MAC",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="It is well-known that using multiple antennas provides a substantial
capacity and diversity increase for wireless communication systems. A
multi-input multi-output (MIMO) technique that utilizes the channel
knowledge both at the transmitter and the receiver is known as beamforming.
Beamforming separates a MIMO channel into parallel subchannels. It was
previously shown that uncoded beamforming achieves a diversity order of
(N-S+1)(M-S+1) if S symbols are transmitted simultaneously for N transmit
and M receive antennas. Hence, there is a significant drop in the diversity
order (and performance) of the system with increased spatial multiplexing.
In this paper, we introduce bit interleaved coded multiple beamforming and
name the system BICMB. We provide interleaver design criteria such that the
resulting system achieves full spatial multiplexing of min(N,M) and full
spatial diversity of NM. Simulation results show that BICMB, due to its
ability of maintaining the maximum diversity order even at full spatial
multiplexing, provides substantial performance gain when compared to the
best spatial multiplexing systems."
}

@INPROCEEDINGS{Akca0606:PHY,
AUTHOR="Cemal Akcaba and Rohit Nabar and Kin Leung",
TITLE="A {PHY/MAC} Approach to Wireless Routing",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Routing data through a wireless network is made challenging by impairments
in the wireless medium, such as fading. Nevertheless, wireless routing if
implemented, will result in tremendous cost-savings in next generation
wireless networks. This paper examines centralized and decentralized
approaches for wireless routing from a PHY/MAC perspective. We show that
decentralized routing strategies are capable of realizing full spatial
diversity gain if an appropriate level of channel knowledge is available at
the relay terminals. Furthermore, we propose a new carrier sensing random
access based routing technique designed to avoid collision and conserve
network power. A numerical example is provided to demonstrate that the
technique is capable of realizing full spatial diversity gain."
}

@INPROCEEDINGS{Akca0610:Deterministic,
AUTHOR="Huseyin Akcan and Herve Bronnimann",
TITLE="Deterministic Data Reduction in Sensor Networks",
BOOKTITLE="The Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems",
ADDRESS="Vancouver, BC, Canada",
DAYS=7,
MONTH=oct,
YEAR=2006,
ABSTRACT="The processing capabilities of wireless sensor nodes enable to aggregate
redundant data to limit total data flow over the network. The main property
of a good aggregation algorithm is to extract the most representative data
by using minimum resources. From this point of view, sampling is a
promising aggregation method, that acts as surrogate for the whole data,
and once extracted can be used to answer multiple kinds of queries (such as
AVG, MEDIAN, SUM, COUNT, etc.), at no extra cost. Additionally, sampling
also preserves the correlation info within multi-dimensional data, which is
quite valuable for further data mining. In this paper, we propose a novel,
distributed, weighted sampling algorithm to sample sensor network data and
compare to an existing random sampling algorithm, which to the best of our
knowledge is the only algorithm to work in this kind of setting. We also
introduce a real world data set, which covers climate data in the U.S for
the past 100 years, and perform popular queries on this dataset to evaluate
our algorithm. During testing, we focus on issues such as sample quality,
network longevity, energy and communication costs."
}

@INPROCEEDINGS{Akgü0609:Extraction,
AUTHOR="Ceyhun {Akgül} and Bulent Sankur and Ata {Ak\ın}",
TITLE="Extraction of Cognitive Activity Related Waveforms from Functional Near
Infrared Signals",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="We address the problem of prototypical waveform extraction from functional
near infrared spectroscopy (fNIRS) signals in cognitive experiments.
Extracted waveforms represent the brain hemodynamic response (BHR) to
visual stimuli pro-vided in an oddball type experimental protocol. We use
and evaluate two statistical signal processing tools, namely inde-pendent
component analysis (ICA) and waveform clustering, in a comparative manner.
Based on the conformance to a parametric BHR model, we determine that the
ICA waveform extraction method is superior. We measure and comment on the
intra-subject and inter-subject waveform and parameter variability."
}

@INPROCEEDINGS{Akgü0609:Framework,
AUTHOR="Ceyhun {Akgül} and Bulent Sankur and Yücel Yemez and Francis Schmitt",
TITLE="A framework for histogram-induced {3D} descriptors",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper, we propose a novel histogram descriptor framework for 3D
shapes based on modeling the probability density functions (pdf) of
geometrical quantities. The shape functions are designed to reflect the 3D
surface properties of objects, and their pdf is modeled as mixtures of
Gaussians. We make use of the special geometry of triangular meshes in 3D
and provide efficient means to approximate the moments of shape functions
per triangle. Our framework produces a number of 3D shape descriptors that
prove to be quite dis-criminative in a retrieval application. We test and
compare our descriptors to other histogram-based methods on two 3D model
databases. It is shown that our methodology im-proves the performance of
existing descriptors and becomes a fertile ground to advance and tests new
ones."
}

@INPROCEEDINGS{Akha0605:Robust,
AUTHOR="Ali Akhaee and Farokh Marvasti",
TITLE="A Robust Approach for Speech Enhancement Using Wavelet Transform",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="AbstractThis paper introduces a combined approach for speech enhancement in
the wavelet domain. To prevent quality degradation of the enhanced speech,
unvoiced regions are separated from noisy speech and then by a new
shrinkage function, the thresholding process is applied differently in each
detail scale. To have better performance and robustness against Babble
noise, the spectral subtraction method is used in the approximation scales.
Simulation results show that, despite the simplicity of the method, the
output SNR and subjective tests (MOS score) are favorable to other
waveshrink methods."
}

@INPROCEEDINGS{Akha0609:Improved,
AUTHOR="Ali Akhaee",
TITLE="An Improved Iterative Method to Compensate for {1-D} Signal Interpolation
Distortion of Each Kind",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="We propose a new method to compensate for the distortion of any
interpolation function. This is a hybrid method based on the iterative
method proposed by one of the authors where modular harmonics are utilized
instead of simple lowpass filter. The hybrid method is also improved by the
Chebyshev acceleration algorithm. The proposed technique drastically
improves the convergence rate with less computational complexity while it
is robust to additive noise. This method could be used in any 1-D signals
which must be interpolated during the process."
}

@INPROCEEDINGS{Akhl0605:Communication,
AUTHOR="Soroush Akhlaghi and Amir K. Khandani and Abolfazl Falahati",
TITLE="Communication Over {Time-Varying} {MIMO} Broadcast channels",
BOOKTITLE="23rd Queen's Biennial Symposium on Communications",
ADDRESS="Kingston, Ontario, Canada",
DAYS=29,
MONTH=may,
YEAR=2006,
ABSTRACT="The problem of channel time variation for Multiple Input Multiple Output
(MIMO) broadcast channels with Zero-Forcing Beamforming (ZFBF) in the
presence of outdated Channel State Information (CSI) is addressed.
 Each user utilizes fixed-rate Block Coded Modulation (BCM) scheme, and 
it is assumed that the perfect CSI is known at the beginning of each
block, while the channel varies over time. The impact of the outdated CSI
is evaluated both analytically, and experimentally
through Monte-Carlo simulation. The effect of channel aging is
modeled as an additive noise with time-varying power. We introduce a
new method based on Hadamard transformation in order to equalize the
noise power across the coding block. The performance of BCM scheme
is studied using the Pairwise Error Probability, showing that the
proposed method results in a significant improvement in the error
performance with a negligible increase in  the complexity."
}

@INPROCEEDINGS{Akho0603:Influence,
AUTHOR="Lida Akhoondzadeh-Asl and Peter Hall",
TITLE="Influence of angular stability of {EBG} structures on low profile dipole
antenna performance",
BOOKTITLE="2006 IEEE International Workshop on Antenna Technology:  Small Antennas and
Novel Metamaterials",
ADDRESS="White Plains, Nw York",
DAYS=6,
MONTH=mar,
YEAR=2006,
ABSTRACT="In this paper the broadband diamond dipole antenna performance above an
Electromagnetic Bandgap (EBG) structure composed of an array of square
metallic patches and Jerusalem crosses without any vias over a PEC backed
dielectric substrate is investigated and compared to each other. The result
shows that angular stability of the EBG structures does not significantly
affect on the performance of the antenna."
}

@INPROCEEDINGS{Akho0604:Parametric,
AUTHOR="Lida Akhoondzadeh-Asl and Peter Hall",
TITLE="Parametric Study of Wideband Dipole on Electromagnetic Bandgap Ground Plane",
BOOKTITLE="LAPC - Loughborough Antennas \& Propagation Conference",
ADDRESS="Burleigh Court Conference Centre, Loughborough University",
DAYS=11,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this paper different ground plane sizes and heights of the wideband
diamond dipole antenna from the electromagnetic bandgap surface (EBG) are
examined. The EBG was composed of an array of square metallic patches
without any vias over a PEC backed dielectric substrate. It is demonstrated
that increasing the ground plane size does not much affect the performance
of the antenna. The operating frequency bandwidth shifts to lower
frequencies when the height of the dipole is increased."
}

@INPROCEEDINGS{Akih0610:Geocasting,
AUTHOR="Akihiro Nomoto and Gen Tsuchida and Susumu Ishihara",
TITLE="A Geocast scheme based on Successful Transmission Records on Wireless Ad
Hoc Networks",
BOOKTITLE="The Third International Conference on Mobile Computing and Ubiquitous
Networking",
ADDRESS="London, United Kingdom",
DAYS=11,
MONTH=oct,
YEAR=2006,
ABSTRACT="In this paper we propose an efficient geocasting scheme
based on flooding for cases where a source node sends request
messages to nodes in the destination area and receives replies
from some of them, Geocasting based on Successful Transmission
Result (GSTR). Generally geocast protocols based on
flooding cause many redundant messages which cause transmission
errors. In GSTR, each node records whether each
request messages which they have relayed result in a reply
from a suitable node. Using these records, each node decides
the delay before rebroadcast of geocasting packets.
Simulation results showed that the proposed scheme reduces
collisions and response time, and achieves high success
ratio of the queries."
}

@INPROCEEDINGS{Akil0609:Separability,
AUTHOR="Moussa Akil and Christine {Servière}",
TITLE="Separability of convolutive mixtures based on wiener filtering and mutual
information criterion",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper, we focus on convolutive mixture, expressed in time-domain.
We present a method based on the minimization of the mutual information and
using wiener filtering. Separation is known to be obtained by testing the
independence between delayed outputs. This criterion can be much simplified
and we prove that testing the independence between the contributions of all
sources on the same sensor at same time index also leads to separability.
We recover the contribution by using Wiener filtering (or Minimal
Distorsion Principal) which is included in the separation procedure. The
independence is tested here with the mutual information. It is minimized
only for non-delayed outputs of the Wiener filters. The test is easier and
shows good results on simulation."
}

@INPROCEEDINGS{Akin0601:Client,
AUTHOR="Ozdemir Akin and Salih Ergut and Ramesh Rao",
TITLE="Client Side Active Queue Management for {3G} Cellular Networks",
BOOKTITLE="CCNC2006 Networking Track Regular Technical Papers",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="In recent years the use of wired-cum-wireless networks has increased
considerably. However, the protocols designed for wired networks does not
always perform well in a wireless environment. For example, a TCP
connection can easily fill-up the buffer of a slow wireless link causing
other connections - such as interactive applications - experience high
end-to-end delays. In this paper we develop an Active Queue Management
(AQM) scheme to control the queue length at a 3G cellular base station. In
contrast to regular AQM schemes our algorithm is implemented at the client
node, thus we call the new algorithm Remote AQM (R-AQM). An important
feature of this paper is that instead of testing our new algorithm with a
software based simulator, we conducted our tests using a commercial
CDMA2000 1xRTT network. Our experiments show that our algorithm can
decrease the queue length considerably while maintaining very high
utilization at the wireless link, hence achieves low per packet delay and
jitter."
}

@INPROCEEDINGS{Akl0601:Capacity,
AUTHOR="Robert Akl and Son Nguyen",
TITLE="Capacity Optimization in Multi-cell {UMTS} Networks for Different Spreading
Factors with Perfect and Imperfect Power Control",
BOOKTITLE="CCNC2006 Networking Track Regular Technical Papers",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="An analytical model for optimizing capacity in multi-cell UMTS networks is
presented. Capacity is optimized for different spreading factors and for
perfect and imperfect power control. An analytical model is presented for
approximating the user distributions in multi-cell third generation WCDMA
networks using 2-dimensional Gaussian distributions by determining the
means and the standard deviations of the distributions for every cell. This
allows for the calculation of the inter-cell interference and the
reverse-link capacity of the network. The capacity was determined for
signal-to-interference threshold from 5 dB to 10 dB and spreading factor
values of 256, 64, 16, and 4."
}

@INPROCEEDINGS{Akol0604:Performance,
AUTHOR="Roseline Akol and Fambirai Takawira",
TITLE="Performance of Coded Residual Arithmetic Differential {MPSK} Modulation",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Phy/MAC",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="A major attraction for differential modulation is in non-coherent reception
for a communication system propagating over fast fading channels. However,
conventional differential modulation (CDM) leads to a 3 dB loss over
coherent modulation. To overcome this with minimal complexity, iterative
decoding employing hard decision feedback and bit-interleaved coded
modulation have been suggested. The channel encoder often employs
convolutional codes which may require low rates or high constraint length
to reduce the error floor effect in conventional differential modulation.
In this paper we propose residual arithmetic codes for channel coding. We
show through simulated results that the arithmetic codes can achieve
similar or better bit error rate (BER) performance than convolutional codes
of the same rate and asymptotic coding gain at t = 1, 2 error correcting
capability. We invoke the Chase algorithm to provide the soft input to the
hard decision algebraic decoder for the arithmetic codes."
}

@INPROCEEDINGS{Aksa0609:Temporal,
AUTHOR="Anil Aksay and Cagdas Bilen and Engin Kurutepe and Tanir Ozcelebi and Gozde
{Bozdagi Akar} and Reha Civanlar and A. Murat Tekalp",
TITLE="Temporal And Spatial Scaling For Stereoscopic Video Compression",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="In stereoscopic video, it is well-known that compression efficiency can be
improved, without sacrificing PSNR, by predicting one view from the other.
Moreover, additional gain can be achieved by subsampling one of the views,
since the Human Visual System can perceive high frequency information from
the other view. In this work, we propose subsampling of one of the views by
scaling its temporal rate and/or spatial size at regular intervals using a
real-time stereoscopic H.264/AVC codec, and assess the subjective quality
of the resulting videos using DSCQS test methodology. We show that
stereoscopic videos can be coded at a rate about 1.2 times that of
monoscopic videos with little visual quality degradation."
}

@INPROCEEDINGS{Akso0604:Serial,
AUTHOR="Kenan Aksoy and Umit Aygolu",
TITLE="Serial Concatenated {Super-Orthogonal} {Space-Time-Frequency} Trellis Coded
{OFDM}",
BOOKTITLE="4 th International Symposium on Turbo Codes in connection with 6th
International ITG-Conference on Source and Channel Coding",
ADDRESS="Munich, Germany",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this paper, we present a new space-time-frequency coded orthogonal
frequency-division multiplexing (OFDM) scheme that achieves high diversity
gain through frequency-selective multipath fading channels with L taps. The
proposed serial concatenated scheme combines an inner super-orthogonal
space-time-frequency trellis code (SOSTFTC) with an outer punctured
convolutional code (PCC) that provides additional coding and diversity
gain, so that the overall diversity of the system becomes Gd = Nr *
min{Lg*dfree, Nt*L} where Nt and Nr are the number of transmit and receive
antennas, respectively, Lg is the build-in space-frequency diversity of the
SOSTFTC, and dfree is the outer codes minimum Hamming distance. The bit
error rate (BER) for an example concatenated code employing inner 16-state
QPSK SOSTFTC was evaluated by computer simulations and it is shown that
significant error performance improvement is obtained."
}

@INPROCEEDINGS{Akta0606:Distributed,
AUTHOR="Emre Aktas and Jamie Evans and Stephen Hanly",
TITLE="Distributed Base Station Processing in the Uplink of Cellular Networks",
BOOKTITLE="ICC 2006  Communication Theory",
ADDRESS="Istanbul, Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="This paper considers the problem of joint detection in the uplink of
cellular multiaccess networks with base-station cooperation. Distributed
multiuser detection algorithms with local passing among neighbor base
stations are proposed and compared in terms of computational complexity
required in the base stations, the amount of serial communications among
them, error rate performance, and convergence speed. The algorithms based
on the belief propagation algorithm result in complexity and delay per base
station which do not grow as the network size increases. In addition, it is
observed that these algorithms have near single user error rate performance
for the fading channels considered. Thus it is illustrated that using the
belief propagation algorithm, it is possible to use non-orthogonal
signaling and still achieve near single user performance with moderate
computational complexity and a limited amount of message passing between
base stations of adjacent cells."
}

@INPROCEEDINGS{Akta0611:Pilot,
AUTHOR="Emre Aktas",
TITLE="{Pilot-Assisted} Communication Over {ISI} Channels Based on the Belief
Propagation Algorithm",
BOOKTITLE="IEEE Globecom 2006 - Communications Theory",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Application of the belief propagation (BP) algorithm is proposed for
  pilot-assisted reception of Gaussian symbols over unknown
  inter-symbol interference channels whose parameters are also
  Gaussian. The proposed Bayesian network graph for the demodulator
  includes the channel parameters explicitly, allowing the combined
  estimation of the channel and information bearing symbols.  The
  proposed algorithm is parallel in nature, is suitable for sparse
  channels, and is easily expandable to coded systems for joint
  channel pilot-assisted demodulation and decoding. The numerical
  results show performance better than the performance of iterative
  semi-blind equalization with batch minimum mean-squared error
  estimation iterations."
}

@INPROCEEDINGS{AL-A0601:Effect,
AUTHOR="Fatima AL-Azzawi and Emad Ahmed",
TITLE="effect of {Multi-Tone} Jamming on {FH-OFDMA} with Orthogonal Hopping
Patterns",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="Frequency hopped Orthogonal Frequency Division Multiple Access (FH-OFDMA)
is considered as one of the hybrid CDMA-OFDM systems. Data is transmitted
through multiple access system which adopt set of frequencies on which
signal can hopped. Extending Quadratic Congruence (EQC) orthogonal hopping
code is used to provide a protection against multi-user interference (MUI)
and extremely generated interfering (jamming) signals with finite power,
whether the system is suffering from fading or not."
}

@INPROCEEDINGS{Al-A0603:Power,
AUTHOR="Ali Al-Awami",
TITLE="Power System Stability Enhancement Using Unified Power Flow Controllers",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="The use of the supplementary controllers of a unified power flow controller
(UPFC) to damp low frequency oscillations is investigated. The potential of
the UPFC supplementary controllers to enhance the dynamic stability is
evaluated by measuring the electromechanical controllability through
singular value decomposition (SVD) analysis. Individual designs of the UPFC
controllers using particle swarm optimization (PSO) technique are
discussed. A nonlinear, time-domain objective function is considered. The
effectiveness of the proposed controllers on damping low frequency
oscillations is tested through eigenvalue analysis and non-linear time
simulation. For comparison, power system stabilizer (PSS) performance is
also included."
}

@INPROCEEDINGS{Al-B0611:Adaptive,
AUTHOR="Ayham Al-Banna and Joseph LoCicero and Donald Ucci",
TITLE="Adaptive Antennas for Interference Mitigation of {Barker/CCK} Spread
{Wi-Fi} Signals",
BOOKTITLE="Second Workshop on Performance and Management of Wireless and Mobile
Networks (in conjunction with LCN 2006)",
ADDRESS="Tampa, FL, USA",
DAYS=14,
MONTH=nov,
YEAR=2006,
ABSTRACT="A study of interference caused by adjacent IEEE 802.11 Barker-code spread
and Complementary Code Keying spread Wireless Fidelity signals used in
Wireless Local Area Networks is presented.  The interference resulted from
these signals is thoroughly analyzed and compared to that caused by
bandlimited flat spectral interferers as well as narrow band interferers. 
Adaptive antennas employing tapped-delay-lines are used to mitigate the
interference effect from these signals.  The optimal values for the
delay-line parameters to restore the performance at minimum cost are found."
}

@INPROCEEDINGS{Al-D0601:New,
AUTHOR="Arafat Al-Dweik",
TITLE="A New Generalized Approach for Performance Evaluation of Communication
Systems with {Intentional/Non-Intentional} Jamming",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="In this work, a new generalized approach is proposed to evaluate the
probability of error performance of communication systems in the presence
of interference. The interference can be intentional such as multitone
jamming, or non-intentional such as multiple access interference or
co-channel interference. As an example, the new approach is applied to
compute the exact probability of error for a frequency hopping spread
spectrum system with noncoherently demodulated M-ary amplitude shift keying
signal in the presence of multitone jamming and white Gaussian noise."
}

@INPROCEEDINGS{Al-E0601:EAREC,
AUTHOR="Akhtar Al-Eimon and Choong Seon Hong and Tatsuya Suda",
TITLE="{EAREC:} Energy Aware Routing with Efficient Clustering for Sensor Networks",
BOOKTITLE="CCNC2006 Networking Track Regular Technical Papers",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="Energy efficiency is the most challenging issue in wireless sensor network
to prolong the life time of the network, as the sensors have to serve
unattended. Cluster based communication can reduce the traffic on the
network and gives the opportunity to other sensors for periodic sleep and
awake. Thus the sensor nodes can save huge amount of energy. Passive
clustering can perform a significant role to minimize the network load in
WSN as it is less computational and light weight. In cluster based
approach, cluster heads and gateways have to have maximum energy to be
awake for all the times. But the existing passive clustering algorithm does
not consider any criteria to be the cluster head or gateway. Moreover, the
first declaration method of passive clustering without any priority will
generate severe collisions in the network and form the clusters very dense
with large amount of overlapping regions. As a result huge number of nodes
will be the gateway which is simply wastage of energy. We have proposed
several modifications for the existing passive clustering algorithm to
prolong the life time of the network with better cluster formation. More
-over, our proposed solution finds the optimum path between sources and
sinks using the tiny cache memory of the intermediate nodes. Simulation
result shows that EAREC saves significant amount of energy and at the same
time keeps the delay and success rate satisfactory."
}

@INPROCEEDINGS{Al-F0601:Algorithm,
AUTHOR="Mohammed Al-Faiz and Mazin Othman and Baker Al-Bahri",
TITLE="An Algorithm to Solve the Inverse Kinematics Problem of a Robotic
Manipulator Based on Rotation Vectors",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="This paper presents an algorithm to solve the kinematics problem for a
complex wrist structure six degree of freedom(6DOF) robotic manipulator.
The last three rotating axis do not intersect at one point and three are
off axes in its coordinate frames.The proposed algorithm is based on the
rotating vectot concept, which is also used to describe the orientation of
manipulator end-effector.All the possible solutions of the inverse
kinematics problem can be obtained by using the proposed algorithm ,which
is tested practically on the MA2000 robotic manipulator."
}

@INPROCEEDINGS{Al-f0606:Genetic,
AUTHOR="Ala Al-Fuqaha",
TITLE="Genetic Approach for Traffic Grooming, Routing, and Wavelength Assignment
in {WDM} Optical Networks with Sparse Grooming Resources",
BOOKTITLE="ICC 2006 Optical Systems and Networks Symposium",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="In wavelength division multiplexing (WDM) all-optical networks, the size of
a request stream may be less than the maximum capacity of a lightpath. To
avoid assigning an entire lightpath to a small request, many researchers
have looked at adding traffic grooming to the routing and wavelength
assignment (RWA) problem. In this work, we consider the RWA problem with
traffic grooming (GRWA) for mesh networks. The GRWA problem is NP-Complete
since it is a generalization of the RWA problem which is known to be
NP-Complete. While most of the previous work in this field focuses on
optical networks without grooming or with full grooming capabilities, in
this work we study networks with sparse traffic grooming and wavelength
conversion resources. In this paper, we propose two novel heuristics that
minimize the cost of the traffic grooming and wavelength conversion
equipment used in optical network without hindering the network blocking
performance. The strength of the proposed heuristics stems from their
simplicity, applicability to large-scale networks, and efficiency compared
to other heuristics proposed in the literature. The performance of our
proposed heuristics is compared to that of other efficient heuristics
proposed in the literature in terms of the total cost of traffic grooming
and wavelength conversion devices used and the blocking performance of the
network."
}

@INPROCEEDINGS{Al-G0601:Intelligent,
AUTHOR="Ebrahim Al-Gallaf",
TITLE="Intelligent Nonlinear Predictive Control",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="This research article presents a Fuzzy structure for a Model Predictive
Control (MPC) system. MPC theorem has recently been incorporated with fuzzy
models. Such an integration provides controller design methods for an MPC
control system. The paper concentrates on aspects of fuzzy based MPC for
multivariable systems. Mathematical formulation of linearized MPC is
utilized to introduce the concept of fuzzy based MPC scheme, then fuzzy MPC
is constructed based on a modeled pH reactor."
}

@INPROCEEDINGS{Al-G0601:Robotics,
AUTHOR="Ebrahim Al-Gallaf",
TITLE="Robotics System Optimal Task Control, {(Neuro-Inverse} Kinematics Approach)",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="A fast and efficient method for computing optimal grasping and manipulation
forces is presented based on a Quadratic Optimisation formulation for a
hand robotics system, where computation has been based on using the
non-linear factual model of contacts. Furthermore, in order to achieve
grasping while in motion, the Hand Inverse Jacobian has to be intensively
computed, consequently, we investigate an efficient approach of employing
an Artificial Neural Network for the multi-finger robot hand in which the
object motion is defined in. The approach followed here is to let an ANN to
learn the nonlinear Inverse Kinematics functional relating the hand joints
positions and displacements to object displacement."
}

@INPROCEEDINGS{Al-G0606:Performance,
AUTHOR="Mishal Al-Gharabally and Pankaj Das",
TITLE="On the Performance of {OFDM} Systems in Time Varying Channels with Channel
Estimation Error",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="In this paper, we analyze the performance of Orthogonal Frequency Division
Multiplexing (OFDM) systems in time varying channels with channel
estimation error. The conventional approach to obtain an analytical
expression for the average error probability (bit or symbol) relies on
finding the joint probability density function (PDF) of the channel and the
channel estimate, and then, average the conditional error probability over
the joint PDF. Usually, averaging the conditional error probability
requires solving a three-fold integral. We will first give a simple proof
to the asymptotic Gaussianity of the Intercarrier Interference (ICI), then
we show that by expressing the channel in terms of the channel estimate,
the problem of obtaining the average error probability is greatly reduced,
and simplified to solving a single integral. The derived expressions are
general, and may be used to analyze the performance of a variety of channel
estimation schemes for OFDM systems in static and time varying channels."
}

@INPROCEEDINGS{Al-H0603:Performance,
AUTHOR="Emad Al-Hussaini and Hebat-Allah Mourad and Ahmed Harmal",
TITLE="Performance of a radio mobile multirate {CDMA} system employing pre-rake
and coding",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="Multirate variable spreading length, where users are able to transmit at
different data rates on CDMA mobile radio systems , which can be fitted to
the reverse link, is considered in this article. In order to minimize the
effects of (ISI), (MAI) and multipath fading, Joint multiuser detection
(JD) employing MMSE equalization with pre-rake at the transmitter and
channel coding are also applied. Satisfactory bit error rate results are
obtained in a single cell environment."
}

@INPROCEEDINGS{Al-H0604:Decentralized,
AUTHOR="Ahmad Al-Hammouri",
TITLE="Decentralized and Dynamic Bandwidth Allocation in Networked Control Systems",
BOOKTITLE="Workshop on Parallel and Distributed Real-Time Systems",
ADDRESS="Island of Rhodes, Greece",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this paper, we propose a scheme for bandwidth allocation in networked
control systems (NCSs) working over geographically distributed networks. We
first formulate the network bandwidth allocation problem as a convex
optimization program. We then present the allocation scheme that solves
this optimization program in a fully distributed manner. In addition to
being fully distributed, the proposed scheme is also asynchronous,
scalable, dynamic and flexible. We present analytical and simulation
results."
}

@INPROCEEDINGS{Al-H0605:Next,
AUTHOR="Adel Al-Hezmi and Muslim Elkotob and Bernd Mrohs and Christian {Räck} and
Stephan Steglich",
TITLE="Next Generation Service Architecture: Challenges and Approaches",
BOOKTITLE="6th International Workshop on Applications and Services in Wireless
Networks",
ADDRESS="Berlin, Germany",
DAYS=29,
MONTH=may,
YEAR=2006,
ABSTRACT="Developing telecommunication applications has evolved from the using closed
service architectures as is the case in Intelligent Networks (IN) towards
open distributed service architecture such OSA/Parlay, and the Open Mobile
Alliance (OMA). The Open Mobile Alliance (OMA) specifies different
standardized components called enablers to create an environment in which
services could be developed and deployed. Therefore, OMA provides a
service-oriented architecture (SOA) and enables the mapping of service
elements onto the underlying network infrastructure components [1]. On the
other hand, the approach used in MobiLife[2] is more user-centric and tries
to bring advances in mobile applications and services within the reach of
users in their everyday life by innovating and deploying new applications
[2]. Consequently, the MobiLife paradigm also follows a high-level
service-oriented approach quite similar to the OMA approach. Issues such as
extensibility, scalability, and flexibility are quite critical in
determining the success of a certain service. When using the last mentioned
approach, service composition on top of OMA enablers or on top of the
MobiLife framework is greatly facilitated. The focus of our paper is on the
significant differences between the classical black box approach and the
modular approach used by the OMA and MobiLife for building
telecommunication services on the top of the IP Multimedia Subsystem (IMS)
[4] architecture."
}

@INPROCEEDINGS{Al-M0601:Block,
AUTHOR="Mohammed Al-Mualla",
TITLE="A {Block-Based} Barni Watermarking Method for Improved Robustness under
Video Compression Attacks",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="The Barni method has been proposed in the literature for watermarking still
images. In our previous work, we have extended this method to work for
image sequences (video). However, it was found that this extended
frame-based version fails under video compression attacks. In this paper,
we present a block-based version to improve robustness against such attacks"
}

@INPROCEEDINGS{AL-Q0603:Space,
AUTHOR="Fawaz AL-Qahtani",
TITLE="A {Space-Time} {MIMO} Channel based on Geometrical Model with
Hyperbolically Distributed Scatteres for a Macrocell Mobile Environment",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="This paper introduces a general concept of a space time geometrical channel
model with hyperbolically distributed for a macrocell mobile environment.
This model provides statistics of the time of arrival (TOA) and direction
of arrival (DOA).In this paper, the proposed channel is modified to
Multiple Input Multiple Output (MIMO) which characterizes the space and
time-variant of the mobile radio channel. Our MIMO channel model is based
on the one ring scattering model. This model will be examined under
different mobile environments. Moreover, we will study the influence of
physical parameters such as scatteres distribution with different
environment and the influence of system parameters such as antennas spacing
on the capacity"
}

@INPROCEEDINGS{AL-Q0608:Space,
AUTHOR="Fawaz AL-Qahtani and Seedahmed Mahmoud and Zahir Hussain",
TITLE="A {Space-Time} {MIMO} Channel Model for Macrocell Mobile Environment",
BOOKTITLE="12th Asia-Pacific Conference on Communications",
ADDRESS="Busan, Republic of Korea",
DAYS=31,
MONTH=aug,
YEAR=2006,
ABSTRACT="This paper introduces a general concept of a space time geometrical channel
model with hyperbolically distributed scatterers for a macrocell mobile
environment. This model provides statistics of the time of arrival (TOA)
and direction of arrival (DOA). The proposed channel model is modified to
Multiple Input Multiple Output (MIMO) model which characterizes the space
and time-variance characters of the mobile radio channel. Our MIMO channel
model is based on one-ring scattering model. This model is examined under
different mobile environments. Moreover, we studied the influence of the
physical parameters (such as scatterers distribution) as well as the system
parameters (such as antennas spacing) on the capacity."
}

@INPROCEEDINGS{Al-R0603:Design,
AUTHOR="Rami Adada and Hussain Al-Rizzo and James Scott",
TITLE="Design of a Miniaturized Microstrip Antenna for Implanted Medical Devices",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="In this paper, a miniaturized microstrip patch antenna is presented for
wireless communications with medical implants in the 402405 MHz Medical
Implant Communications Services (MICS) band. Ansofts HFSS
(http://www.ansoft.com), which is based on the Finite Element method, was
used to evaluate the antenna design. Size reduction techniques such as
meandering, the addition of a shorting pin as well as the introduction of a
capacitive plate were investigated to make the antenna size suitable for
use with medical implants."
}

@INPROCEEDINGS{Al-R0603:Finite,
AUTHOR="Hussain Al-Rizzo and Hayder {Al Shukri} and Basil Miller and Okba {Al Kadi}
and Yasir Taleb and Mohammed Sheet Taka",
TITLE="Finite Difference Time Domain Modeling of an {RF-Based} Technology for the
Detection of Buried Pipes: The Ground Penetrating Radar",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="A three-dimensional (3-D) Finite-Difference Time Domain (FDTD) model of a
Ground Penetrating Radar (GPR) is developed to investigate the feasibility
of detecting two different realistic cylindrical pipes, metal or dielectric
buried in a dry and/or moist soil. The model is employed to numerically
investigate the EM fields scattered from and transmitted through
deterministic objects buried underneath a 3-D air-ground interface. This
study is motivated by recent interest in electromagnetic sensing of water
leaks to complement an extensive experimental effort currently being
undertaken by the Arkansas Center for Earthquake Education and Technology
Transfer of the University of Arkansas at Little Rock. Examples are
provided to demonstrate the applicability and to verify the numerical
solutions using the time-domain solver of the commercial software package:
Microwave Studio. The model and computer code are capable of analyzing
stratified media with arbitrary number of discontinuities both in vertical
and horizontal directions."
}

@INPROCEEDINGS{Al-R0603:Parity,
AUTHOR="Amer Alhabsi and Hussain Al-Rizzo and Robert Akl",
TITLE="Parity Assisted Decision Making for {QAM}",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="A simple technique which involves the transmission of a Quadrature
Amplitude Modulation (QAM) symbol and two parity bits in separate channels
to improve the performance of communication systems is devised. When a
symbol is received, a decision is made not solely by its Euclidean
distances to the constellation points. Rather, the two parity bits are used
to assist in making the decision. Unlike standard error correcting codes
(ECC), the proposed method operates on the received symbols at the detector
level and before the ECC. The parity bits and the information symbols can
be sent in different channels (frequency division) or at different times on
the same channel (time division). The available energy for transmission is
distributed unevenly among the information bits and the parity bits to
improve the performance. Simulation results show large gains in required
signal to noise ratios over uncoded system to achieve the same performance.
The scheme is simple and is well suited for systems with low computational
power."
}

@INPROCEEDINGS{AL-S0603:Analysis,
AUTHOR="Ja'afer AL-Saraireh and Mohammad {AL Nabhan} and Sufian Yousef",
TITLE="Analysis and Enhancement Authentication Algorithms in Mobile Networks",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="Mobile phones are rapidly becoming one of the most popular tools for
communica-tion. The rapid growth of wireless tech-nology and the increasing
use of such technologies in coordination with the internet require a very
careful look at the issue of security. Security, Authentication, Encryption
and Access Control are vital features that must be present in any
communication network. In our paper we will investigate existing and
enhancement authentication mecha-nisms for mobile communications and
analyse these mechanisms. Specifically, I will minimize the authentication
signaling in GSM, 3G and future mobile bottleneck at authentication centre,
by reducing the number of messages between mobile and authentication centre
(i.e. reducing the procedures of authentication). Also to en-hanced
authentication and security in mo-bile networks."
}

@INPROCEEDINGS{Al-Z0601:Personal,
AUTHOR="Ahmed Al-Zeyodi and Ali Al-Qayedi",
TITLE="A Personal Search Agent System",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="This paper demonstrates a personal search agent system which enables the
users to personalise their search and hence to save their time and effort.
The system uses its own ranking algorithm and provides two types of search:
a direct search (via a local database) and an indirect search (via third
party search engines). The system achieves search personalisation through
an initial user interaction that decides on what search criteria should be
considered more important than others. The system also attempts to learn
the user behaviour through a user feedback mechanism. This mechanism can
cause two search attempts with the same query to return two different
results; because of changing the user preferences even though the search is
run on the same data set. Issues regarding the setup, implementation and
experimental results of the system are illustrated here."
}

@INPROCEEDINGS{Alae0609:Realization,
AUTHOR="Hamze Alaeddine and El-Houssain Baghious and Guillaume Madre and Gilles
Burel",
TITLE="Realization of Block Robust Adaptive Filters using Generalized Sliding
Fermat Number Transform",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="This paper is about an efficient implementation of adaptive filtering for
echo cancelers. First, a realization of an improved Block Proportionate
Normalized Least Mean Squares (BPNLMS++) using Generalized Sliding Fermat
Number Transform (GSFNT) is presented. Unfortunately, during the
double-talk mode, the echo cancelers often diverge. We can cope with this
problem by employing a double-talk detector formed by two Voice Activity
Detectors (VAD's). We propose a general system based on the
Robust-Block-PNLMS++ (RBPNLMS++) adaptive filter combined with a
post-filter. The general system was implemented with GSFNT which can
significantly reduce the computation complexity of the filter implantation
on Digital Signal Processing (DSP)."
}

@INPROCEEDINGS{Alam0603:Block,
AUTHOR="Mohammad Shah Alam and Shamim Ara Shawkat and Mitsuji Matsumoto",
TITLE="Block Selective Repeat: A New {ARQ} Scheme for High Speed {IrDA} Links",
BOOKTITLE="2006 IEEE Sarnoff Symposium",
ADDRESS="Princeton NJ, USA",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="Automatic Repeat Request (ARQ) is a method to make a link and flow more
robust to transmission errors. For the inherent simplicity of go-Back-N
(GBN) ARQ scheme, Infrared Data Association (IrDA) has adopted this scheme
as the error control method for half duplex infrared links. However, the
large window size associated with high speed infrared links reduces the
throughput of this error control scheme and renders the link operation very
vulnerable to bit error rate (BER) increase. Hence, in this paper, we
propose a more effective Automatic Repeat Request (ARQ) scheme for
enhancing the reliability and throughput of high speed IrDA links.
Simulation results show that it significantly outperforms the existing
go-back-N ARQ scheme, particularly for links with high data rate. We also
explore that without adapting window size at high bit error rate, the
proposed scheme provides a significant improvement in the throughput over a
range of bit error rates including high bit error rate."
}

@INPROCEEDINGS{Alam0606:Investigation,
AUTHOR="Mohammad Shah Alam and Shamim Ara Shawkat and Mitsuji Matsumoto",
TITLE="Investigation of the Suitability of {IrBurst} for {High-Speed} Exchange of
Large Data Blocks",
BOOKTITLE="ICC 2006 Optical Systems and Networks Symposium",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="This paper investigates the suitability of IrBurst, a higher layer protocol
recently proposed by IrDA, for highspeed exchange of large data blocks. An
analytical model for IrBurst throughput efficiency over the IrDA protocol
stacks is carried out. Results are presented which reveal that IrBurst
scales well for use with large data blocks and high data rates compared to
the existing OBEX protocol. We also examine the effect of lower layer
parameters such as IrLAP window size and frame length, and IrPHY minimum
turnaround time that significantly impact the IrBurst performance.
Consequently, a new Automatic Repeat Request (ARQ) scheme is also proposed
at IrLAP layer to maximize the throughput efficiency for IrBurst protocol
as well as for next generation high speed IrDA links. Simulation result
indicates that employment of the proposed ARQ scheme results in significant
improvement of IrBurst throughput efficiency at High BER."
}

@TECHREPORT{Alam0608:Competition,
AUTHOR="S. M. Nazrul Alam and Peter Marbach",
TITLE="Competition and Request Routing Policies in Content Delivery Networks",
TYPE="arXiv report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0608082",
MONTH=aug,
YEAR=2006,
ABSTRACT="The role of competition and monetary benefits in the design of Content
Delivery Networks (CDNs) is largely an unexplored area. In this paper, we
investigate the effect of competition among the competitive web based CDNs
and show that little difference in their performance may cause significant
financial gain/loss. It turns out that the economy of scale effect is very
significant for the success of a CDN in a competitive market. So CDN
peering might be a good idea. Since performance and conforming to the
service level agreement (SLA) with content providers is very important, we
then focus on designing CDN from this perspective. We provide an
asymptotically optimal static request routing policy for a CDN under a
model where a CDN company guarantees a certain level of user latency to the
content providers in the SLA.",
URL="http://arxiv.org/abs/cs/0608082"
}

@INPROCEEDINGS{Alam0609:Coverage,
AUTHOR="S. M. Nazrul Alam and Zygmunt Haas",
TITLE="Coverage and Connectivity in {Three-Dimensional} Networks",
BOOKTITLE="12th Annual International Conference on Mobile Computing and Networking",
ADDRESS="Los Angeles, CA",
DAYS=23,
MONTH=sep,
YEAR=2006,
ABSTRACT="Although most wireless terrestrial networks are based on two-dimensional
(2D) design, in reality, such networks operate in three-dimensions (3D).
Since most often the size (i.e., the length and the width) of such
terrestrial networks is significantly larger than the differences in the
third dimension (i.e., the height) of the nodes, the 2D assumption is
somewhat justified and usually it does not lead to major inaccuracies.
However, in some environments, this is not the case; the underwater,
atmospheric, or space communications being such apparent examples. In fact,
recent interest in underwater acoustic ad hoc and sensor networks hints at
the need to understand how to design networks in 3D. Unfortunately, the
design of 3D networks is surprisingly more difficult than the design of 2D
networks. For example, proofs of Kelvin's conjecture and Kepler's
conjecture required centuries of research to achieve breakthroughs, whereas
their 2D counterparts are trivial to solve. In this paper, we consider the
coverage and connectivity issues of 3D networks, where the goal is to find
a node placement strategy with 100\% sensing coverage of 3D space, while
minimizing the number of nodes required for surveillance. Our results
indicate that the use of the Voronoi tessellation of 3D space to create
truncated octahedral cells results in the best strategy. In this truncated
octahedron placement strategy, the transmission range must be at least
1.7889 times the sensing range in order to maintain connectivity among
nodes. If the transmission range is between 1.4142 and 1.7889 times the
sensing range, then a hexagonal prism placement strategy or a rhombic
dodecahedron placement strategy should be used. Although the required
number of nodes in the hexagonal prism and the rhombic dodecahedron
placements strategies is the same, this number is 43.25\% higher than the
number of nodes required by truncated octahedron placement strategy. We
verify by simulation that our placement strategies indeed guarantee
ubiquitous coverage. We believe that our approach and our results presented
in this paper could be used as a basis for extending the processes of 2D
network design to 3D networks."
}

@TECHREPORT{Alam0609:Coverage,
AUTHOR="S. M. Nazrul Alam and Zygmunt Haas",
TITLE="Coverage and Connectivity in {Three-Dimensional} Networks",
TYPE="arXiv report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0609069",
MONTH=sep,
YEAR=2006,
ABSTRACT="Most wireless terrestrial networks are designed based on the assumption
that the nodes are deployed on a two-dimensional (2D) plane. However, this
2D assumption is not valid in underwater, atmospheric, or space
communications. In fact, recent interest in underwater acoustic ad hoc and
sensor networks hints at the need to understand how to design networks in
3D. Unfortunately, the design of 3D networks is surprisingly more difficult
than the design of 2D networks. For example, proofs of Kelvin's conjecture
and Kepler's conjecture required centuries of research to achieve
breakthroughs, whereas their 2D counterparts are trivial to solve. In this
paper, we consider the coverage and connectivity issues of 3D networks,
where the goal is to find a node placement strategy with 100\% sensing
coverage of a 3D space, while minimizing the number of nodes required for
surveillance. Our results indicate that the use of the Voronoi tessellation
of 3D space to create truncated octahedral cells results in the best
strategy. In this truncated octahedron placement strategy, the transmission
range must be at least 1.7889 times the sensing range in order to maintain
connectivity among nodes. If the transmission range is between 1.4142 and
1.7889 times the sensing range, then a hexagonal prism placement strategy
or a rhombic dodecahedron placement strategy should be used. Although the
required number of nodes in the hexagonal prism and the rhombic
dodecahedron placement strategies is the same, this number is 43.25\%
higher than the number of nodes required by the truncated octahedron
placement strategy. We verify by simulation that our placement strategies
indeed guarantee ubiquitous coverage. We believe that our approach and our
results presented in this paper could be used for extending the processes
of 2D network design to 3D networks.",
URL="http://arXiv.org/abs/cs/0609069"
}

@TECHREPORT{Alam0609:Topology,
AUTHOR="S. M. Nazrul Alam and Zygmunt Haas",
TITLE="Topology Control and Network Lifetime in {Three-Dimensional} Wireless
Sensor Networks",
TYPE="arXiv report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0609047",
MONTH=sep,
YEAR=2006,
ABSTRACT="Coverage and connectivity issues of three-dimensional (3D) networks are
addressed in [2], but that work assumes that a node can be placed at any
arbitrary location. In this work, we drop that assumption and rather assume
that nodes are uniformly and densely deployed in a 3D space. We want to
devise a mechanism that keeps some nodes active and puts other nodes into
sleep so that the number of active nodes at a time is minimized (and thus
network life time is maximized), while maintaining full coverage and
connectivity. One simple way to do that is to partition the 3D space into
cells, and only one node in each cell remains active at a time. Our results
show that the number of active nodes can be minimized if the shape of each
cell is a truncated octahedron. It requires the sensing range to be at
least 0.542326 times the transmission radius. This value is 0.5, 0.53452
and 0.5 for cube, hexagonal prism, and rhombic dodecahedron, respectively.
However, at a time the number of active nodes for cube, hexagonal prism and
rhombic dodecahedron model is respectively 2.372239, 1.82615 and 1.49468
times of that of truncated octahedron model. So clearly truncated
octahedron model has the highest network lifetime. We also provide a
distributed topology control algorithm that can be used by each sensor node
to determine its cell id using a constant number of local arithmetic
operations provided that the sensor node knows its location. We also
validate our results by simulation.",
URL="http://arXiv.org/abs/cs/0609047"
}

@INPROCEEDINGS{Alam0611:IrSimple,
AUTHOR="Mohammad Shah Alam and Shamim Ara Shawkat and Gontaro Kitazumi and Mitsuji
Matsumoto",
TITLE="{IrSimple} Modeling and Performance Evaluation for {High-Speed} Infrared
Communications",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="IrSimple is a high-speed Infrared communications protocol to provide simple
and instant wireless communications between mobile devices and digital home
appliances. This paper provides a mathematical model with which we derive a
simple equation for IrSimple throughput efficiency. Based on this model, we
compare the performance of IrSimple protocol with the existing IrDA
protocol for exchanging digital contents at high data rates. Results are
presented which reveal that IrSimple protocol scales well for use with high
data rates compared to the existing OBEX protocol. The significance of
parameters such as IrSMP block size and link minimum turnaround time on
IrSimple performance is also examined. Finally, an enhancement of existing
error control scheme to provide robustness for IrSimple protocol at high
bit error rates and an improvement in flow control to reduce redundant data
retransmissions are presented."
}

@INPROCEEDINGS{Alan0606:Service,
AUTHOR="Wesam Alanqar and Victor Frost",
TITLE="A Service {Profile-Aware} Control Plane with a Comparison to {IETF} \&
{ITU} Approaches",
BOOKTITLE="ICC 2006 Optical Systems and Networks Symposium",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Existing Internet Engineering Task Force (IETF) and International
Telecommunications Union (ITU) optical control plane models do not consider
the service profile layer when establishing network connections, this work
proposes the novel concept of a Service Profile-Aware (SPA) control plane
model that is superior to existing models. SPA includes a full realization
of the multi-granularity network resources, and considers services
architectures and their associated service profile feature set. Detailed
comparison between the three control plane models were considered from
multiple dimensions including traffic management scheme, components level
interaction between (service profile, control plane, network
infrastructure) layers, and network infrastructure realization from both
horizontal network domains and vertical resource granularity and network
partitions perspective. The service models were analyzed based on their
service profile parameters from both an architectural and performance
perspective. Mathematical analysis of the three control plane models was
performed using multi-instance Fixed Point Approximation (FPA). The
performance analysis of the new SPA traffic management schemes found a
significant increase in service allowed load while maintaining lower
service blocking probability and network utilization as compared to the
IETF and ITU control plane models."
}

@INPROCEEDINGS{Alar0606:Design,
AUTHOR="Valentina Alaria and Andrea Bianco and Paolo Giaccone and Emilio Leonardi
and Fabio Neri",
TITLE="Design of switches with reconfiguration latency",
BOOKTITLE="ICC 2006 Optical Systems and Networks Symposium",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Optical switching fabrics (OSF) are considered to be appealing solutions
for the design of high speed packet switches, due to their excellent
scalability in terms of bandwidth and power consumption. Candidate
technologies are MEMS, bubble switches, broadcast-and-select networks with
tunable devices. All of them suffer a reconfiguration latency each time the
input/output connections are changed, due to technological constraints;
unfortunately, this latency is not negligible with respect to the packet
transmission time, and can adversely affect performance, especially delay
and throughput. When scheduling the transmission of packets across an OSF,
the multi-hop approach was shown to be a promising way to control the
tradeoff between delay and throughput. In this case, the OSF is configured
just once in a while, on a time scale much larger than the packet
transmission time, and packets may be recirculated across the ports to
provide full or partial connectivity among ports. Previous works have
investigated this approach when a physical ring topology is used for the
interconnection. Here, we extend the multi-hop approach to multidimensional
regular topologies, which offer a better tradeoff between throughput and
delay. We discuss not only the scheduling problem for these topologies, but
also the design of routing. We investigate performance by simple analytical
models and show the design tradeoff among throughput, speedup and delays."
}

@INPROCEEDINGS{Alar0606:Multi,
AUTHOR="Valentina Alaria and Andrea Bianco and Paolo Giaccone and Emilio Leonardi
and Fabio Neri",
TITLE="Multi-hop scheduling algorithms in switches with reconfiguration latency",
BOOKTITLE="2006 Workshop on High Performance Switching and Routing",
ADDRESS="Poznan, Poland, Poland",
DAYS=7,
MONTH=jun,
YEAR=2006,
ABSTRACT="Optical switching fabrics (OSF) are receiving increasing attention
in the design of high speed packet switches, due to their excellent
properties in terms of available bandwidth and reduced power consumption.
However, most optical devices suffer a reconfiguration
latency each time input/output connections are modified;
unfortunately, this latency may not be negligible with respect to the 
packet transmission time, and can adversely affect performance, especially

delay and throughput. 

The multi-hop approach, i.e., sending packets to the final destination
port 
exploiting transmission to intermediate ports, was shown to be a promising

way to control the tradeoff between delay and throughput. 
In this paper, we examine the multi-hop approach when using a logical
interconnections
based on multidimensional regular topologies. We discuss not only 
the scheduling problem for these topologies, but also the design of
routing
and queueing schemes. Performance are analyzed by simulation."
}

@INPROCEEDINGS{Alar0609:DoS,
AUTHOR="Bernardo Alarcos and Maria Calderon and Marifeli Sedano and Juan Velasco",
TITLE="A {DoS} protection for a Pragmatic Multiservice Network Based on
Programmable Networks",
BOOKTITLE="IFIP TC6 8th International Working Conference on Active and Programmable
Networks",
ADDRESS="Paris, France",
DAYS=25,
MONTH=sep,
YEAR=2006,
ABSTRACT="We propose a scenario of a multiservice network, based on pragmatic ideas
of programmable networks. The active routers are capable of processing both
active and legacy packets. This scenario is vulnerable to a Denial of
Service attack, which consists of inserting false legacy packets into the
active routers. We propose a mechanism for detecting the injection of false
legacy packets into the active routers. This mechanism consists of
exchanging accounting information on the traffic between neighboring active
routers. The exchange of accounting information must be carried out in a
secure way using secure active packets. The proposed mechanism is sensitive
to the loss of packets. To deal with this problem some improvements in the
mechanisms have been proposed. An important issue is the procedure of
discharging packets when an attack has been detected. We propose an easy
and efficient mechanism that would be im-proved in future work."
}

@INPROCEEDINGS{Alav0604:Studying,
AUTHOR="Bardia Alavi and Kaveh Pahlavan",
TITLE="Studying the Effect of Bandwidth on Performance of {UWB} Positioning
Systems",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Phy/MAC",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this paper we study the effect of bandwidth on performance of
positioning systems. We introduce a benchmark for performance evaluation,
Distance Measurement Error (DME). We analyze DME and introduce a model for
it. We show that there are two causes for DME, multipath dispersion and
Undetected Direct Path (UDP), and we study the effect of bandwidth on each
of these components in DME. We show that increasing the bandwidth can
decrease the multipath effect, but for the UDP effect, beyond a certain
point it increases the DME. Thus there is an optimum bandwidth for
minimizing overall error. The results were obtained using a database of UWB
measurements conducted in an indoor propagation environment."
}

@INPROCEEDINGS{Albe0604:Study,
AUTHOR="Teresa Albero",
TITLE="A study of mobility and reachability in Ad Hoc networks using Stochastic
Activity Networks",
BOOKTITLE="2nd EuroNGI Conference on Next Generation Internet Design and Engineering",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="The integration of Ad-Hoc networks into real environments is now becoming
more and more common and supervision and control systems are no exception.
The efficiency of the communication in these networks as well as various
other factors, are governed by the working area, the number of nodes,
mobility, transmission power, etc. In this paper, the mobility and
reachability of mobile nodes appearing spontaneously in a large
installation such as can be found in a water purification system are
studied. These nodes form an Ad-hoc network and communicate between each
other in order to finally reach a fixed node which can offer them
information from the rest of the system in real time or act as a gateway to
other remote networks. The study was done analytically using stochastic
activity models, and using the minimum number of nodes necessary to
successfully serve a water purification system with a high percentage of
communication cover."
}

@INPROCEEDINGS{Albe0605:Flight,
AUTHOR="Giovanni Alberti and Ciro Caramiello and Luca Ciofaniello and Giovanni
Galiero and Antonio Moccia and Gianfranco Palmese and Marco Sacchettino",
TITLE="Flight tests of {MiniSAR,} an Italian airborne interferometric {SAR}",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="MiniSAR is a compact airborne interferometric SAR, potentially suitable for
many applications but mainly finalized for producing technical topographic
maps, for monitoring landslides evolution and for assessing their extension
and risk area. Particular efforts have been devoted to limit its dimensions
and weight to allow installation on board of a small aerial platform but
without jeopardizing performance. In addition, some design choices have
been preferred (digital chirp synthesis, stepped frequency) in order to
make the system as flexible and expandable as possible. In fact, it has
been designed and assembled in view of future developments for unmanned
platforms. The hardware consists in an airborne X-band interferometric SAR,
able to obtain a resolution less than a meter (because of a 280 MHz stepped
chirp signal) and an altimetric accuracy less than 7 meters. Such an
accuracy derives from an equivalent 1.5 meters baseline (achieved by
adopting half physical baseline, with antennas operating in ping-pong mode)
and the high gain antennas, that let MiniSAR to use a transmitted power of
only 80 W. The system has been mounted on board of a small platform (Tecnam
P92, a JAR-VLA Very Light Aircraft), and currently it is performing flight
tests and calibration. After a brief analysis of the mathematical models
and software procedures adopted to define system characteristics and
performance, the paper will address main HW/SW features of MiniSAR. As an
example, the antennas are based on a multi-layer uniform array of 32x3, and
the antenna interface sub-system is constituted by WR90 guidelines,
circulator and ferrite switches for implementing ping-pong transmission
mode. The chirp signals to be transmitted are digitally generated by a
Chirp Generation Unit based on an AD9852 component, a highly integrated
synthesizer that uses advanced Direct Digital Synthesis (DDS) technology,
coupled with an internal high-speed, high-performance (12 bit) Digital-to
Analog Converter (DAC). This component allows the generation of chirp
signal with bandwidth up to 150 MHz. It is mounted on board of a card
provided by ANALOG and it is controlled by an additional card realized by
CO.RI.S.T.A. based on PIC microcontrollers. The Frequency Generator Unit
(FGU) is the heart of the system since it is the main source of phase noise
that affects the interferometric performance of the radar. It provides the
frequencies for the digital sub-systems and, mainly, those needed for the
up and down conversion of chirp signal. Since the stepped frequency mode of
the system, the FGU unit should be able to switch among four frequency
values each PRI. A commercial frequency synthesizer provided by
Comstron-Aeroflex company will be used. The Up-Conversion (UPC) and
Down-Conversion (DWC) units are responsible for up and down translation of
the chirp signal before transmission and after reception in addition to
accomplish the needed amplification and filtering. These two units have
been realized by using COTS (Commercial Off-The-Shelf) components. Finally,
gathered data are processed using a chirp scaling algorithm in order to
obtain the two Single Look Complex (SLC) images which are then processed to
obtain high accuracy Digital Elevation Model (DEM). Details on the adopted
procedure and examples of achieved results are given in the paper. The
Consortium for Research on Advanced Remote Sensing Systems (CO.RI.S.T.A.),
a non profit research organization formed by three Italian Academic
Institutions (the University of Naples Federico II, the Second University
of Naples, the University of Bari) and by Alcatel Alenia Spazio Italia), is
responsible of the whole definition and development of the radar. The
program is co-funded by the Italian Ministry for Education, Universities
and Research (M.I.U.R.)."
}

@INPROCEEDINGS{Albe0605:Two,
AUTHOR="Gianni Albertazzi and Stylianos Papaharalabos and Alessandro
Vanelli-Coralli and Peter Sweeney and Giovanni Emanuele Corazza and Barry
Evans",
TITLE="Two Reduced Complexity Decoding Algorithms for {DVB-S2} {LDPC} Code",
BOOKTITLE="Third Advanced Satellite Mobile Systems Conference",
ADDRESS="Herrsching am Ammersee (Germany)",
DAYS=29,
MONTH=may,
YEAR=2006,
ABSTRACT="Two methods are presented to cope with both the hyperbolic tangent function
(tanh) and inverse (arc) hyperbolic tangent function approximation problem
that is used in check-node update computation of the sum-product algorithm
(SPA) when decoding low-density parity-check (LDPC) codes. The reason for
that is the increased amount of computational complexity that is required
to both the tanh and inverse (arc) tanh functions. Computer simulation
results assuming the LDPC code such as in the second generation Digital
Video Broadcasting by satellite (DVB-S2) standard indicate that the
proposed methods provide good trade-off between performance and complexity.
Thus, it seems to be reasonable alternative decoding solutions with respect
to the conventional SPA."
}

@INPROCEEDINGS{AlDh0607:Diversity,
AUTHOR="Naofal Al-Dhahir and Sushanta Das",
TITLE="New {Diversity-Embedding} {STBC} Constructions",
BOOKTITLE="The Seventh IEEE International Workshop on Signal Processing Advances in
Wireless Communications",
ADDRESS="Cannes, France",
DAYS=2,
MONTH=jul,
YEAR=2006,
ABSTRACT="Diversity-Embedding space-time codes, introduced in [2], embed a
high-diversity code within a
high-rate code making opportunistic use of the channel fading
conditions.  They encode the information symbols into layers each
at a prescribed rate-diversity operating point; thus providing an
unequal error protection capability.  Previous diversity-embedding
space-time block codes in [2] were presented
only for 4 transmit antennas.  In this paper, we present three
new constructions for 2,3, and 4 transmit antennas by
varying the relative transmit power levels between the layers
without violating the total transmit power constraint.  The
relative power scaling factor is optimized (off-line as a function
of the constellation size) to achieve a desirable tradeoff between
the available coding gains of the transmission layers while
controlling the peak to minimum transmit power ratio."
}

@INPROCEEDINGS{Alel0605:Sadhoc,
AUTHOR="Vasco Aleluia and Pedro Fernandes",
TITLE="Mobile Self-organized Service-oriented Networks",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="The increasing demand for information sharing anytime, anywhere, along with
the growing number of users using wireless local access to the internet is
imposing new challenges to both technological and architectural aspects of
today systems. It is therefore foreseen an evolution to a more flexible
self-organized and self-maintained architecture, where mesh networking and
seamless mobility are of paramount importance. This paper addresses a novel
architecture based on self-organized principles and Pv6, where service
support is handled at a higher abstraction level. In this context,
solutions for the addressing scheme, mobility support, self-organization
and node interconnection are proposed. A prototype was developed as a proof
of concept and performance measurements were obtained from a given set of
scenarios. Main results showed acceptable performance (e.g. 20 ms and 6 s
for average session establishment and service location, respectively) on
the majority of the scenarios except for mobility in real-time situations."
}

@INPROCEEDINGS{Alem0607:Detection,
AUTHOR="Yohannes {D. Alemseged} and Klaus Witrisal",
TITLE="Detection of {Delay-Hopped} {Transmitted-Reference} {UWB} Signals Under
Narrowband Interference",
BOOKTITLE="The Seventh IEEE International Workshop on Signal Processing Advances in
Wireless Communications",
ADDRESS="Cannes, France",
DAYS=2,
MONTH=jul,
YEAR=2006,
ABSTRACT="This paper presents a detection scheme for the delay-hopped
transmitted-reference (TR) UWB communication system proposed by Hoctor and
Tomlinson in the presence of Narrowband Interference (NBI). We derive a
chip level data model which takes into account the effects of NBI and
noise. The validity of the model is shown, enabling superior performance by
using least squares detection algorithms. Simulation results are conducted
under a practical scenario where the UWB transmission coexists with an
IEEE802.11a WLAN service."
}

@INPROCEEDINGS{Alen0605:Model,
AUTHOR="Marcelo Alencar",
TITLE="Model for the Laser Optical Spectrum and Analysis of the Phase Noise Effect",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="This article presents a mathematical model for the laser lineshape and an
evaluation of the effect of phase noise, $1/f$ frequency noise and
temperature on the linewidth measurements. A model is also presented to
explain the linewidth floor effect. The method generalize previous works on
the subject, by introducing a model that permits the use of any probability
distribution for the laser phase noise. The temperature effect is
investigated and a connection between the linewidth floor and the $1/f$
frequency effect is discussed in the paper."
}

@INPROCEEDINGS{Alet0605:Effects,
AUTHOR="Federico Aletti and Ettore Lanzarone and Marialaura Costantino and Giuseppe
Baselli",
TITLE="Effects of Pulsatility on Apparent Peripheral Resistance with Edema",
BOOKTITLE="ESGCO 2006",
ADDRESS="Jena, Germany",
DAYS=15,
MONTH=may,
YEAR=2006,
ABSTRACT="In the typical conditions of ExtraCorporeal Circulation (ECC),
haemodilution contributes to the formation of edema in the interstitial
space of tissues, thus compressing capillary vessels and increasing the
peripheral resistance of any district and the total peripheral resistance
of the arterial tree as a whole. Simulations are carried out through an
arterial tree model with active peripheral districts including vasomotor
control and fluid exchange, in order to evaluate the additional effects of
continuous flow. After restoring pulsatility, the radius oscillations of
microvessels contribute in reducing their resistance, thus favoring a
condition of perfusion of tissues closer to the one typical of
physiological circulation."
}

@INPROCEEDINGS{Alex0610:Architecture,
AUTHOR="Michael Alexander and Peter Suppan",
TITLE="An Architecture for {SDP-Based} Bandwidth Resource Allocation with {QoS}
for {SIP} in {IEEE} {802.16} Networks",
BOOKTITLE="2nd ACM International Workshop on QoS and Security for Wireless and Mobile
Networks",
ADDRESS="Torremolinos, (Malaga), Spain",
DAYS=2,
MONTH=oct,
YEAR=2006,
ABSTRACT="The IEEE 802.16 link-layer offers rich QoS primitives which make it an
attractive transport for voice traffic. Yet, its QoS capabilities are
disjoint from the application layer protocols, such as SIP. This paper
presents a new approach with a demonstrator on utilizing 802.16 QoS from
SIP and provide bandwidth allocation capabilities based on the Session
Description Protocol's Provisional Response Acknowledgment (PRACK) method.
It is henceforward suggested, that tying SIP with 802.16 MAC bandwidth
management provides an effective means to transport voice traffic over this
wireless access technology."
}

@INPROCEEDINGS{Alex0612:Job,
AUTHOR="Michael Alexander",
TITLE="Job Scheduling for Loosely-coupled Heterogeneous Nodes using Data
Envelopment Analysis",
BOOKTITLE="Workshop on XEN in High-Performance Cluster and Grid Computing",
ADDRESS="Sorrento (Italy), Italy",
DAYS=1,
MONTH=dec,
YEAR=2006,
ABSTRACT="Job Scheduling in high performance computing (HPC) clusters and grids has
traditionally been performed by job entry and management systems, such as
the Portable Batch System that place their emphasis on job management and
only to a lesser extent on job scheduling. In grid infrastructures and
emerging, virtual machine-based HPC environments, the previous assumption
on relative homogeneity of nodes does not hold any more. In contrast,
loosely coupled nodes in these settings are more heterogeneous than ever.
This places new demands on job scheduling, where a large number of
different nodes create a hard problem on optimally laying out compute jobs
across the network for efficient resource allocation. The proposed approach
presented utilizes non-parametric Data Envelopment Analysis (DEA) to derive
a workload-type proximity factor for a given node type. An experimental
factor determination is performed using 5 physical and one virtual nodes."
}

@INPROCEEDINGS{Alfa0606:Eigenvalue,
AUTHOR="Giuseppa Alfano and Antonia Tulino and Angel Lozano and Sergio Verdu",
TITLE="Eigenvalue Statistics of {Finite-Dimensional} Random Matrices for {MIMO}
Wireless Communication",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="This paper characterizes the marginal probability density function of an
unordered eigenvalue of finite-dimensional random matrices of particular
interest in MIMO (multiple-input multiple-output) wireless communications.
Specifically, a technique is presented for deriving the eigenvalue
statistics in one-side correlated Rayleigh-faded channels and in
Ricean-faded channels, with or without cochannel interferers. The exact
expressions found turn out to be extremely useful in calculating
information-theoretic quantities. As an application, we calculate the
ergodic channel capacity for all the abovementioned channel fading
conditions, obtaining closed form formulas for the Rayleigh case and, in
turn, series expressions for the Ricean faded one."
}

@INPROCEEDINGS{Alfs0609:Families,
AUTHOR="Daniel Alfsmann",
TITLE="On Families of 2^N-dimensional Hypercomplex Algebras Suitable for Digital
Signal Processing",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="A survey of hypercomplex algebras suitable for DSP is presented. Generally
applicable properties are obtained, including a paraunitarity condition for
hypercomplex lossless systems. Algebras of dimension n = 2^N, N in Z, are
classified by generation methods, constituting families. Two algebra
families, which hold commutative and associative properties for arbitrary
N, are examined in more detail: The 2^N-dimensional hyperbolic numbers and
tessarines. Since these non-division algebras possess zero divisors,
orthogonal decomposition of hypercomplex numbers is investigated in
general."
}

@INPROCEEDINGS{Alfu0611:Harnessing,
AUTHOR="Ala Al-Fuqaha and Bilal Khan and Ghassen {Ben Brahim}",
TITLE="Harnessing the Parity of Multiple Errors in {End-to-End} {MAC} Schemes",
BOOKTITLE="IEEE Globecom 2006 - Wireless Ad Hoc and Sensor Networks - towards Anytime
Anywhere Internetworking",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="We present the results of simulation experiments
that compare end-to-end error management (used in controlled
access MAC protocols) against hop-by-hop error management
(used in random access MAC protocols). Our experiments are
novel in that we restrict both MAC schemes to identical power
budgets and power distribution strategies. By making such a
normalized comparison, we observe that end-to-end schemes are
more effective than hop-by-hop schemes at reducing connection
BER. We are also able to quantify the sensitivity of this relative
advantage to various environmental parameters, including power
budget size, geographic distance, the number of hops, and power
distribution scheme"
}

@INPROCEEDINGS{Algr0605:Frequency,
AUTHOR="Theo Algra and Laurens Bierens",
TITLE="Frequency domain raw {SAR} data compression for multi-mode satellite {SAR}
instruments",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="This paper presents a novel frequency domain raw SAR data compression
concept that outperforms conventional methods based on Block Adaptive
Quantisation (BAQ). The compressor architecture, which has been selected as
the baseline for TerraSAR-L, a multi-mode L-band SAR instrument, can be
compactly designed for accommodation on a half-size euro-board. The
resulting average compression factor is more than 100\% higher as compared
to BAQ, with the same or better signal quality in the image domain."
}

@INPROCEEDINGS{Alhi0601:SMS,
AUTHOR="Haikel Alhichri and Basma Marhoon and Sharifisistani Amirhosein and Mohamed
Alrubaiy",
TITLE="{SMS-based} Payment System for E-commerce",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="This paper introduces a new digital payment system for E-commerce, based on
Simple Messaging System (SMS) technology. This SMS-based payment system is
secure, cheap, and easy to use. It is also very accessible because of the
widespread of mobile telephones in the world. In this new system the
commercial transaction is initiated on the internet when the customer makes
a purchase. After that the customer uses his mobile phone to make a payment
for that purchase which will be deducted from his account with the mobile
operator"
}

@INPROCEEDINGS{Ali-0609:New,
AUTHOR="Arash Ali-Amini and Massoud Babaie-Zadeh and Christian Jutten",
TITLE="A new approach for Sparse Decomposition and Sparse Source Separation",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="We introduce a new approach for sparse decomposition, based on a
geometrical interpretation of sparsity. By sparse decomposition we mean
finding sufficiently sparse solutions of underdetermined linear systems of
equations. This will be discussed in the context of Blind Source Separation
(BSS). Our problem is then underdetermined BSS where there are fewer
mixtures than sources. The proposed algorithm is based on minimizing a
family of quadratic forms, each measuring the distance of the solution set
of the system to one of the coordinate subspaces (i.e. coordinate axes,
planes, etc.). The performance of the method is then compared to the
minimal 1-norm solution, obtained using the linear programming (LP). It is
observed that the proposed algorithm, in its simplest form, performs nearly
as well as LP, provided that the average number of active sources at each
time instant is less than unity. The computational efficiency of this
simple form is much higher than LP. For less sparse sources, performance
gains over LP may be obtained at the cost of increased complexity which
will slow the algorithm at higher dimensions. This suggests that LP is
still the algorithm of choice for high-dimensional moderately-sparse
problems. The advantage of our algorithm is to provide a trade-of between
complexity and performance."
}

@INPROCEEDINGS{Ali0601:Performance,
AUTHOR="Mustafa {Mehmet Ali} and Mehdi Khabazian",
TITLE="Performance Modeling of Connectivity in Ad Hoc Networks",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Networking",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this paper, we study the connectivity of an ad hoc network with a
dynamic user population. We assume that the nodes arrive at the service
area according to a Poisson process and, then travel according to a user
mobility model. The nodes, which havenot departed from the service area,
are able to participate in communications. The location of the nodes and
the size of the user population within the service area is constantly
changing. We study connectivity of this user population at the
steady-state. We derive the distribution of the size of user population
within the service area, nodes location distribution and the distribution
of the distance between the two nodes. Then, we determine the mean cluster
size, fraction of nodes within the cluster, probability that nodes will
form a single cluster and average of the minimum number of hops that it
takes for two nodes to communicate. This work shows significance of
mobility on the connectivity of ad hoc networks."
}

@INPROCEEDINGS{Ali0601:Proposed,
AUTHOR="Ali Ali and Azad Kareem",
TITLE="A Proposed Design for the Broadband Microwave Distributed Amplifiers",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="In this paper, a new method for the design of the broadband RF/microwave
amplifiers employing distributed amplification is presented. It proposes to
use stages with asymmetric lumped elements (inductances and capacitances)
in the gate and drain circuits of the amplifier instead of symmetric
elements in order to control the frequency response and to achieve a flat
gain over a large bandwidth. The need for impedance matching problems is
also solved. Simulation result obtained demonstrates that the new design
gives better frequency response as compared to the conventional distributed
amplifiers even without optimization."
}

@INPROCEEDINGS{Ali0603:Miniature,
AUTHOR="Mohammod Ali and Guangli Yang and Roger Dougal",
TITLE="A Miniature Packaged Rectenna for Wireless Power Transmission and Data
Telemetry",
BOOKTITLE="2006 IEEE International Workshop on Antenna Technology:  Small Antennas and
Novel Metamaterials",
ADDRESS="White Plains, Nw York",
DAYS=6,
MONTH=mar,
YEAR=2006,
ABSTRACT="Embedded wireless sensors are becoming crucial for many safety critical
applications. Sensor batteries must be charged as needed to support high
data rate communications. A miniature packaged circularly polarized
rectenna is proposed. With the help of an integrated band-reject filter the
proposed rectenna achieves a conversion efficiency of 74\% and suppresses
the second harmonic emission at 11 GHz by more than 50 dB."
}

@INPROCEEDINGS{Ali0604:Pairwise,
AUTHOR="Syed Ali and Erhan Ince",
TITLE="Pairwise Error Probability Expressions Over Fully Interleaved Nakagami-m
Fading Channels and Their Use in Union Bounds for Turbo Codes",
BOOKTITLE="4 th International Symposium on Turbo Codes in connection with 6th
International ITG-Conference on Source and Channel Coding",
ADDRESS="Munich, Germany",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this paper, different derivations for pairwise error probability over
fully interleaved Nakagami-m fading channels using coherent BPSK signaling
are considered. The derived results are obtained by finding the probability
distribution of the sum of squared i.i.d Nakagami-m random variables in the
presence of ideal channel state information at the decoder. The exact
expressions have also been approximated to provide tight upper bounds which
are both efficient and in close approximation to the exact results. Plots
for both the pairwise error probability and average union upper bounds on
turbo codes having generator polynomials (1,5/7,5/7) and (1,7/5,7/5) are
provided to demonstrate the usefulness of the new results."
}

@INPROCEEDINGS{Ali0604:Performance,
AUTHOR="Mustafa {Mehmet Ali} and Hao Gu",
TITLE="Performance Analysis of a Wireless Sensor Network",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Phy/MAC",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this work, we consider modeling of a wireless sensor network with a TDMA
media access protocol with slot reuse. It is assumed that the nodes have
two modes of operation, active and sleep modes. We model the sensor network
as a Jackson network with node breakdowns. We determine the joint
distribution of the queue lengths in the sensor network. From this result,
we derive the probability distribution of the number of active nodes and
blocking probability of node activation. Then, we present the mean packet
delay, average down period of a node as well as the network throughput.
Finally, we discuss how the derived results may be used in the design of
sensor networks."
}

@INPROCEEDINGS{Ali0604:Vision,
AUTHOR="Mohamed Ali and Antonis Hadjiantonis and Haidar Chamas and William Bjorkman
and Stuart Elby",
TITLE="On the Vision of Implementing A Truly Native {Ethernet-Based} Global
{Multi-Service} Infrastructure",
BOOKTITLE="IEEE INFOCOM 2006 Poster and Demo Session",
ADDRESS="Barcelona, Spain",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="This work proposes and devises a novel native Ethernet-based networking
architecture and switching paradigms to implement a truly end-to-end
Optical Ethernet infrastructure seamlessly stretching from enterprise LAN
to Metro to Global. To this end, the City College Next-Generation
Data-Centric Networking Lab along with Verizon Communications scientists
and engineers are leading extensive research aimed at defining the
networking technology and architecture for scaling Metro Ethernet networks
into a Global multi-service infrastructure. The proposed Optical Ethernet
networking architecture is a true two-layer model, realizing the
significant goal of Ethernet-over-WDM, where native Ethernet frames are
mapped directly over WDM. It offers significant advantages over existing
Layer-2 and MPLS solutions in that it divorces the Ethernet from legacy
transport mechanisms like SONET/SDH."
}

@INPROCEEDINGS{Ali0605:Distribution,
AUTHOR="Syed Ali and Erhan Ince",
TITLE="Distribution Free Approximations to Pairwise Error Probability for
Memoryless Fading Channels",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="This paper provides derivations of two simple novel approximations
to pairwise error probability for memoryless fading channels with no
channel state information. The derived approximations are independent of
the fading distribution and relies only on its mean and variance. The newly
obtained approximations are better than an already existing approximation
and a bound for low signal to noise ratio values. The approximations are
useful in obtaining average union upper bounds for block and turbo-like
coding schemes. Plots of pairwise error probability for Rician, Rayleigh
and Nakagami-m fading channels along with average union upper bounds for
turbo codes having (1,5/7,5/7) generator polynomial are provided to
illustrate the improvement."
}

@INPROCEEDINGS{Ali0606:Optimal,
AUTHOR="Syed {Hussain Ali} and Vikram Krishnamurthy and Victor Leung",
TITLE="Optimal and Approximate Mobility Assisted Opportunistic Scheduling in
Cellular Data Networks",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="This paper presents optimal and approximate opportunistic scheduling
algorithms for the downlink transmission in a time-slotted shared cellular
data network that combines channel fluctuation and user mobility
information in the decision rule. The proposed algorithms modify
opportunistic scheduling algorithm of Liu et al. with dynamic fairness
constraints that adapt according to the user mobility. The optimum
algorithm is an offline algorithm that pre-computes constraint values
according to the known mobility model. The approximate algorithm is an
on-line algorithm that relies on future prediction of user mobility
locations in time. These predicted values are used in computing constraint
values. Simulation results illustrate the usefulness of the proposed
schemes for elastic traffic and restrictive constraints. The use of
mobility information in opportunistic scheduling also increases channel
capacity."
}

@INPROCEEDINGS{Ali0606:Statistical,
AUTHOR="Najah {Abu Ali} and Hussein Mouftah and Saeed Gazor",
TITLE="Statistical Delay Budget Partitioning Algorithm",
BOOKTITLE="ICC 2006 Communications QoS, Reliability and Performance Modeling",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Mapping the end to end QoS requirements into link QoS requirements is an
important step for meeting the QoS requirements and balancing the load in
the network. The problem of the QoS partitioning has been addressed in
literature and proved to be NP complete. Different algorithms are proposed
to solve the problem of single end-to-end QoS metric. However, these
algorithms are near optimal or heuristic algorithms and solve the QoS
partitioning problem for single QoS metric. In this paper, we propose a
novel optimal partitioning algorithm which is capable of partitioning the
end to end QoS requirement for multiple QoS metrics, additive and
multiplicative, simultaneously. Extensive simulation verified the
effectiveness of the algorithm compared to two QoS partitioning algorithms.
The algorithms are the equal and the proportional partitioning algorithms,
which are extended to support multiple QoS metrics. The results show that
the proposed algorithm outperforms the other two algorithms for loose and
stringent QoS requirements and over different path lengths."
}

@INPROCEEDINGS{Ali0607:Directional,
AUTHOR="Khaled Ali and Hossam Hassanein and Abd-Elhamid Taha and Hussein Mouftah",
TITLE="Directional Cell Breathing: A Module for Congestion Control and Load
Balancing in {WCDMA} Networks",
BOOKTITLE="IWCMC 2006 Next Generation Mobile Networks",
ADDRESS="Vancouver, BC, Canada",
DAYS=3,
MONTH=jul,
YEAR=2006,
ABSTRACT="In this paper, we outline the basis of a novel cooperative module for
congestion control and load balancing in WCDMA networks. Through carefully
exploiting the capabilities of smart and directional antennas, we propose a
controllable directional breathing where a base stations (BS) sectorized
coverage is varied reactively in instances of congestion, and proactively
in instances of exercising load balancing. This proposal, called
Directional Cell Breathing (DCB), overcomes the drawbacks of non-sectorized
and non-controllable WCDMA breathing management by optimizing the coverage
level within each sector under constraints minding sectoral traffic load
and interference bounds. Interference analysis is carried out to determine
the eligibility of a cell to be considered in DCB if one of its adjacent
cells becomes overloaded. This analysis is then used in a mathematical
formulation to facilitate the optimization of the proposed scheme."
}

@INPROCEEDINGS{Ali0607:Efficient,
AUTHOR="Racha {Ben Ali} and Samuel Pierre",
TITLE="An Efficient Predictive Admission Control Policy for Wireless Bandwidth
Allocation in Next Generation Mobile Networks",
BOOKTITLE="IWCMC 2006 Next Generation Mobile Networks",
ADDRESS="Vancouver, BC, Canada",
DAYS=3,
MONTH=jul,
YEAR=2006,
ABSTRACT="With the decrease of cell size and the increase of user mobility in next
generation mobile networks (NGMN), there is an urgent need for more
effective resource management algorithms resolving the quality of service
(QoS) violation issues encountered by emergent multimedia applications and
caused by more frequent handovers. We propose an efficient predictive
admission control (CAC) policy based on the prediction of local and
aggregate information on calling and mobility traffic. Furthermore, we
propose a multi-class CAC algorithm using a dynamic multi-threshold guard
band policy to satisfy QoS constraints of various handoff connection
classes besides service connection classes introduced by a heterogeneous
multi-service NGMN. Our preliminary results show that our CAC policy
algorithm, benefiting from more prediction accuracy, outperforms the
existing adaptive CAC policy. In fact, it improves wireless bandwidth
utilization while guaranteeing hard constraints on handoff dropping
probabilities."
}

@INPROCEEDINGS{Ali0610:Capacity,
AUTHOR="Adel Ali and Syed Qaseem",
TITLE="Capacity and Diversity Gains of {MIMO} Systems in Correlated Rician Fading
Channels",
BOOKTITLE="10th IEEE International Conference on Communication Systems 2006",
ADDRESS="Singapore, Singapore",
DAYS=30,
MONTH=oct,
YEAR=2006,
ABSTRACT="This paper investigates the effect of Rician fading and correlation on the
capacity and diversity of MIMO channels. The use of antenna arrays at both
sides of the wireless communication link (MIMO systems) can result in high
channel capacity provided the propagation medium is rich scattering or
Rayleigh fading and the antenna arrays at both sides are uncorrelated.
However, the presence of LOS component and correlation of real world
wireless channel may affect the system performance.  Slow and frequency
nonselective Rician fading channel is assumed, and the effect of Rician
factor (K) on the capacity and diversity gains of correlated MIMO channels
is investigated. We also endorsed the view point that the loss or gain in
the capacity or diversity gains can be considered as an equivalent increase
or decrease in the signal-to-noise power ratio (SNR)."
}

@INPROCEEDINGS{Ali0610:Grid,
AUTHOR="Arshad Ali and Ashiq Anjum and Tahir Azim and Julian Bunn and Ahsan Ikram
and Richard McClatchey and Harvey Newman and Conrad Steenberg and Michael
Thomas",
TITLE="Mobile Computing in Physics Analysis - An Indicator for eScience",
BOOKTITLE="The Third International Conference on Mobile Computing and Ubiquitous
Networking",
ADDRESS="London, United Kingdom",
DAYS=11,
MONTH=oct,
YEAR=2006,
ABSTRACT="This paper presents the design and implementation of a Grid-enabled physics
analysis environment for handheld and other resource-limited computing
devices as an example of the use of mobile devices in eScience. Handheld
devices offer great potential because they provide ubiquitous access to
data and round-the-clock connectivity over wireless links. Our solution
aims to provide users of handheld devices the capability to launch heavy
computational tasks on computational and data grids, monitor the jobs
status during execution, and retrieve results after job completion. Users
carry their jobs on their handheld devices in the form of executables (and
associated libraries). Users can transparently view the status of their
jobs and get back their outputs without having to know where they are being
executed. In this way, our system is able to act as a high-throughput
computing environment where devices ranging from powerful desktop machines
to small handhelds can employ the power of the Grid. The results shown in
this paper are readily applicable to the wider eScience community."
}

@INPROCEEDINGS{Ali0612:TETRA,
AUTHOR="Adel Ali and Faihan D. Alotaibi",
TITLE="{TETRA} Outdoor Large- Scale Received Signal Prediction Model in Riyadh
{City-Saudi} Arabia",
BOOKTITLE="8th Annual IEEE WIRELESS AND MICROWAVE TECHNOLOGY CONFERENCE",
ADDRESS="Clearwater, Florida, USA",
DAYS=4,
MONTH=dec,
YEAR=2006,
ABSTRACT="TETRA outdoor large scale received signal prediction model is presented
here. The model follows log-distance model. It is derived based on received
signal strength survey measurements of a TETRA system, operating in the
300-400 MHz band, in Riyadh city, Saudi Arabia. This model is aimed to
assist practicing engineers in the estimation of received power, or
electric field strength as well as path-loss at any given distance from the
base station or vice versa. The value of the model exponent (n) for the
selected routes is found to be 3 ± 0.7. However, the overall value of n
for urban area in the Riyadh city is found to be 3.22. It is noted that the
value of n obtained here is low, compared to values obtained in several
European cities, as the streets are wider and the buildings are lower in
most part of the route in Riyadh"
}

@ARTICLE{Alic0608:Joint,
AUTHOR="Mansoor Alicherry and Randeep Bhatia and Li (Erran) Li",
TITLE="Joint channel assignment and routing for throughput optimization in
multi-radio wireless mesh networks",
JOURNAL="IEEE Journal on Selected Areas in Communications MULTI-HOP WIRELESS MESH
NETWORKS",
DAYS=1,
MONTH=aug,
YEAR=2006,
ABSTRACT="Multi-hop infrastructure wireless mesh networks offer increased
reliability, coverage and reduced equipment costs over their single-hop
counterpart, wireless LANs. Equipping wireless routers with multiple radios
further improves the capacity by transmitting over multiple radios
simultaneously using orthogonal channels. Efficient channel assignment and
routing is essential for throughput optimization of mesh clients. Efficient
channel assignment schemes can greatly relieve the interference effect of
close-by transmissions; effective routing schemes can alleviate potential
congestion on any gateways to the Internet, thereby improving per-client
throughput. Unlike previous heuristic approaches, we mathematically
formulate the joint channel assignment and routing problem, taking into
account the interference constraints, the number of channels in the network
and the number of radios available at each mesh router. We then use this
formulation to develop a solution for our problem that optimizes the
overall network throughput subject to fairness constraints on allocation of
scarce wireless capacity among mobile clients. We show that the performance
of our algorithms is within a constant factor of that of any optimal
algorithm for the joint channel assignment and routing problem. Our
evaluation demonstrates that our algorithm can effectively exploit the
increased number of channels and radios, and it performs much better than
the theoretical worst case bounds."
}

@INPROCEEDINGS{Alih0606:Performance,
AUTHOR="Reza Alihemmati and Esrafil Jedari and Ali Reza Enayati and Amir Ahmad
Shishegar and Mahdi {Golparvar Roozbahani} and Gholamreza Dadashzadeh",
TITLE="Performance of the {Pre/Post-FFT} Smart Antenna Methods for {OFDM-Based}
Wireless {LANs} in an Indoor Channel with Interference",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="The performance of OFDM-based Wireless Local Area Networks (WLANs) is
investigated by employing different smart antenna techniques at the
receiver. The use of multiple antennas at the Access Point (AP) receiver in
IEEE802.11a standard-compliant Single Input Multiple Output (SIMO)
configuration, improves the physical layer performance in different channel
scenarios and interference that may arise from other stations sharing the
same frequency band. For this purpose, a comparative study of smart antenna
architectures for IEEE802.11a WLAN system using pre-FFT and post-FFT array
processing techniques is presented. Simulations are performed on a new
model for IEEE802.11a system using a spatio-temporal channel model which is
developed based on a measured wideband channels in the 5GHz band.
Bit-Error-Rate (BER) performance for QPSK modulation at LOS, OLOS and NLOS
channel scenario along with co-channel interference is evaluated.
Simulation results demonstrate the effectiveness of employing the proposed
pre-FFT signal processing."
}

@INPROCEEDINGS{Alin0608:SYSTEM,
AUTHOR="Wouter Alink and Raoul Bhoedjang and Peter Boncz and Arjen {de Vries}",
TITLE="{SYSTEM} - Ultimate Forensic Querying",
BOOKTITLE="6th Annual Digital Forensics Research Workshop",
ADDRESS="West Lafayette, IN, USA",
DAYS=14,
MONTH=aug,
YEAR=2006,
ABSTRACT="This paper describes a novel, XML-based approach towards managing and
querying forensic traces extracted from digital evidence. This approach has
been implemented in SYSTEM, a prototype system for forensic analysis.
SYSTEM systematically applies forensic analysis tools to evidence files
(e.g., hard disk images). Each tool produces structured XML annotations
that can refer to regions (byte ranges) in an evidence file. SYSTEM stores
such annotations in an XML database, which allows us to query the
annotations using a single, powerful query language (XQuery). SYSTEM
provides the forensic investigator with a rich query environment in which
browsing, searching, and pre-defined query templates are all expressed in
terms of XML database queries."
}

@INPROCEEDINGS{Aliz0606:Blind,
AUTHOR="Amir Alizad and Babak Alipanahi and Akbar Ghasemi and Mohsen Shiva and S.
Hamidreza Jamali and Said Nader-Esfahani",
TITLE="A Blind Channel Estimation Technique for {TH-PPM}",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="As the UWB systems are designed to operate in environments having dense
multi-path characteristics (i.e., indoor environments) the channel
estimation task is much more involved than the conventional systems. In
this paper, we present a new blind channel estimation technique for
Time-Hopping Pulse- Position-Modulation (TH-PPM) systems. Our proposed
method is based on the Pulse Compression (PC) technique introduced in [1].
In spite of its low complexity, the proposed blind channel estimation
method outperforms the Non-Data Aided Maximum Likelihood (NDA-ML)
technique. Our simulation results show the promising gain of 3.5 dB around
the Bit Error Rate (BER) of 10-3, compared to NDA-ML. The performance loss,
compared to the Perfect Channel Knowledge (PCK) is only 1.5 dB at this BER."
}

@INPROCEEDINGS{Alja0601:Analysis,
AUTHOR="Mahmood Nagrial and Wadah Aljaism and Jamal Rizk",
TITLE="Analysis and Torque Optimisation of Switched Reluctance Motor",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="Abstract This paper shows the developed torque of a 4 phase 8/6 poles
switched reluctance motor by simulation tests. The analysis for the torque
is computed by finite element method. The torque optimisation is
investigated by changing the pole arc/pole pitch ratio (\γ) of the
stator, rotor and yoke dimensions. Index Terms Reluctance motors,
Simulation"
}

@INPROCEEDINGS{Alja0601:Microphotonic,
AUTHOR="Muhsen Aljada and Chung-Kiak Poh and Kamal Alameh and Khalid Al-Begain",
TITLE="{MicroPhotonic} Components for Optical {Packet-Switched} Networks",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="The implementation of packet switched optical network architectures bring
forth a set of new challenges in network node design. This paper discusses
and demonstrates promising MicroPhotonic architectures that perform optical
header recognition and reconfigurable add/drop multiplexing for future
optical networks."
}

@INPROCEEDINGS{Alja0601:Performance,
AUTHOR="Wadah Aljaism and Mahmood Nagrial and Jamal Rizk",
TITLE="Investigation of Torque Development in {SRM} Under Single phase Excitation",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="Abstract This paper presents the results of an investigation of torque
development in the air gap of a 6/4 and 8/6 switched reluctance machines
(SRM). Due to the force components acting on the rotor enables us to
provide more accurate picture of the torque generation and vibration in
this family of electric machines. The analysis for the torque is computed
by finite element method. The torque optimisation is investigated by
changing the pole arc/pole pitch ratio (\γ) of the stator, rotor and
yoke dimensions. Index Terms Reluctance motors, Simulation"
}

@INPROCEEDINGS{AlJa0609:Analysis,
AUTHOR="Saleh Al-Jazzar",
TITLE="Analysis and equalization of delay in asynchronous {CDMA} system using
unscented filtering",
BOOKTITLE="Mobile Computing and Wireless Communications International Conference",
ADDRESS="Amman, Jordan",
DAYS=17,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper, we present analysis and equalization
for asynchronous received signals in a code-divisionmultiple-
access (CDMA) system. The equalization is performed
using the unscented filer (UF). This equalization
helps the multiuser detector to estimate the desired signal
in asynchronous system without the need of estimating the
delays of the asynchronous users. Simulations are presented
to show the performance of the equalizer."
}

@INPROCEEDINGS{AlJa0609:Load,
AUTHOR="Omar Al-Jarrah and Musab Al-Hadrusi",
TITLE="Load Balanced Ad Hoc Routing Protocol",
BOOKTITLE="Mobile Computing and Wireless Communications International Conference",
ADDRESS="Amman, Jordan",
DAYS=17,
MONTH=sep,
YEAR=2006,
ABSTRACT="Most of the routing algorithms in mobile ad hoc networks are based on the
shortest path metric, which results in using the same path for several
sessions. Consequently, nodes will lose their power, and their paths will
eventually become invalid. This paper presents a new method for achieving
better load balancing in mobile ad hoc networks. It targets load balancing
at the routing layer of the Dynamic Source Routing Protocol (DSR). The new
method proposes a new definition to the load metric and a new way to
compute it. The load is defined in term of the relative time needed to
process and forward packets in each node. Also, congestion is predicted and
cured using a modified version of the Random Early Detection (RED) queue. A
set of changes is applied to the DSR protocol to give the nodes the most
recent information about the load within paths and neighborhoods.
Simulation results show that the new method results in an overall
enhancement of 37\% in term of end to end delay when compared with the
Load-Aware On-Demand Routing (LAOR) Protocol and the Load-Sensitive Routing
for Mobile Ad Hoc Networks (LSR)."
}

@INPROCEEDINGS{AlJe0606:Performance,
AUTHOR="Mohamed AlJerjawi and Walaa Hamouda",
TITLE="Performance Analysis of {Space-Time} Diversity in Multiuser {CDMA} Systems
over Fading Channels",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="In continuity of the work in Part I of this paper, where we derived the
probability density function (pdf) for the signal to interference ratio
(SIR) of the prescribed DS-CDMA system, here in Part II we pursue the
performance analysis using the results obtained in Part I. We show that by
averaging over the pdf found in Part I, a closed form expression for the
probability of error using the decorrelator multiuser detector can be
obtained. Further, using this expression we prove that the diversity order
is maintained as a linear inverse relationship with the average SNR per
channel. We verify the accuracy of the expression by comparison with
simulations for different number of users. Both theoretical and simulation
results show that the diversity order is maintained for systems with
moderate number of users."
}

@INPROCEEDINGS{AlKa0606:Energy,
AUTHOR="Jamal Al-Karaki",
TITLE="{Energy-Centric} Routing in Wireless Sensor Networks",
BOOKTITLE="11th IEEE Symposium on Computers and Communications",
ADDRESS="Pula-Cagliari, Sardinia, Italy",
DAYS=26,
MONTH=jun,
YEAR=2006,
ABSTRACT="The lifetime of Wireless Sensor Networks (WSNs) is highly affected by the
non-replenishible energy resource of typical WSNs. Thus, it is important to
continuously monitor the status of this valuable network resource after
network deployment. The information about energy status can be used to
early notify both sensors and deployers of resource depletion in some parts
of the network. It can also be used to perform energy-efficient routing in
WSNs. In this paper, we propose a scheme for monitoring energy resource at
different parts of the network through an energy scale (e-scale) of
residual energy distributions. This scale is then used to perform optimal
energy-centric routing (ECR) in WSNs with the objective of maximizing the
network lifetime. Due to network dynamics, we also propose an on-line
approximate solution that performs ECR in WSNs. Both solutions make use of
a fixed virtual wireless backbone that is built on top of the physical
topology. Simulation results show that our scheme is scalable and can
provide many folds of energy savings when compared to conventional routing
schemes."
}

@INPROCEEDINGS{AlKa0610:Node,
AUTHOR="Jamal Al-Karaki and Sameer Bataineh",
TITLE="On the Node Cooperation in Mobile Ad hoc Networks",
BOOKTITLE="10th IEEE International Conference on Communication Systems 2006",
ADDRESS="Singapore, Singapore",
DAYS=30,
MONTH=oct,
YEAR=2006,
ABSTRACT="Node cooperation is a basic requirement for the operation of
Mobile Ad hoc Networks (MANETs). However, a user may
misbehave due to several advantages resulting from noncooperation,
the most obvious being power saving. As such,
enforcing the cooperation among nodes becomes a very important
issue. Several different approaches have been developed
for non-cooperativeMANETs. It is found that the proposed
approaches have several concerns that prevent them
from really enforcing the node cooperation in MANETs. In
this paper, a new scheme to stimulate and enforce nodes cooperation
in ad hoc environment is presented. The scheme
applies various mechanisms to detect and exclude potential
threats of selfish mobile nodes. Simulation results indicate
that our scheme makes MANETs more robust against
nodes’misbehaving and the system performance is enhanced
many folds when compared to other existing schemes."
}

@INPROCEEDINGS{AlKh0604:Performance,
AUTHOR="Iyad {Al Khatib} and Giuseppe Russo and Rustam Nabiev",
TITLE="Performance Analysis of Interoperability Protocols and Algorithms in
{Networks-on-Chip} for the Next Generation Biomedical {Sensor-Networks}",
BOOKTITLE="IEEE INFOCOM 2006 Poster and Demo Session",
ADDRESS="Barcelona, Spain",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="We present a nano-interconnect platform utilizing biomedical sensor
networks and the network-on-chip technology for human heart
electrocardiogram (ECG) real-time monitoring and analysis. We analyze the
performance of the platform interoperability protocol by setting the
medical-application-specific figures-of-merit. These figures of merit are:
the analysis-time required to converge to an alarm signal in very short
rescue intervals due to life-critical medical situations, and power
consumption in rechargeable biomedical sensors (lasting for a maximum of 24
hours). This is an industry-relevant bio-medical application, with a huge
potential market, that is still in the research and development phase.
Hence it is an ideal target for an application-specific network
implementation. We investigate the ECG network as a multi-processor
architecture based on commercial VLIW DSPs that process in real-time
12-lead ECG signals. This architecture improves upon state-of-the-art
designs for ECG analysis in its ability to analyze the full 12 leads in
real-time, even with high sampling frequencies, and ability to detect heart
malfunction. We explore the design space for the wearable platform and
consider the need for inter-communications protocol/algorithms."
}

@INPROCEEDINGS{Alla0604:Memory,
AUTHOR="Atef Allam and J. Ram Ramanujam and Gerald Baumgartner and Ponnuswamy
Sadayappan",
TITLE="Memory Minimization for Tensor Contractions using Integer Linear
Programming",
BOOKTITLE="Workshop on Performance Optimization for High-Level Languages and Libraries",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="This paper presents a technique for memory optimization for a class of
computations that arises in the field of correlated electronic structure
methods such as coupled cluster and configuration interaction methods in
quantum chemistry. In this class of computations, loop computations perform
a multi-dimensional sum of product of input arrays. There are many
different ways to get the same final results that differ in the required
number of arithmetic operations required. In addition, for a given number
of arithmetic operations, different expressions of the loop have different
memory requirements. Loop fusion is a plausible solution for reducing
memory usage. By fusing loops between producer loop nest and consumer loop
nest, the required storage of intermediate array is reduced by the range of
the fused loop. Because resultant loops have to be legal after fusion, some
loops can not be fused at the same time. In this paper, we have developed a
novel integer linear programming (ILP) formulation that is shown to be
highly effective on a number of test cases producing the optimal solutions
using very small execution times. The main idea in the ILP formulation is
the encoding of legality rules for loop fusion of a special class of loops
using logical constraints over binary decision variables and a highly
effective approximation of memory usage."
}

@INPROCEEDINGS{Alla0605:Polarimetric,
AUTHOR="Sophie Allain and Laurent Ferro-Famil and Eric Pottier",
TITLE="A polarimetric classification fom polsar data using {SERD/DERD} parameters",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="The aim of this paper is to analyze the usefulness of different
polarimetric parameters to describe and to classify scattering mechanisms
over natural media. Two novel polarimetric parameters, the Double
Eigenvalue Relative Difference (DERD) and the Single Eigenvalue Relative
Difference (SERD), are developed to characterize natural areas. In the
first part of this study, the analytical expressions of these polarimetric
descriptors is presented based on the Eigenvector/value based decomposition
theorem for PolSAR data These parameters are derived from the
eigen-decomposition of the coherency matrix considering the reflection
symmetry hypothesis. In order to compare these parameters to the classical
polarimetric descriptors derived from the Cloude / Pottier decomposition,
we introduce a new classification (SERD/DERD/a1) using an iterative
algorithm based on a complex Wishart density function. The DERD can be
compared to the anisotropy and is demonstrated to have a larger range
domain and to be a more relevant descriptor for surface characterization.
The SERD can be compared to the entropy and qualify the importance of the
single bounce scattering mechanism The theoretical study of the SERD and
DERD parameters is also addressed from a statistical point of view in order
to determine the effects of speckle noise in their estimation. A comparison
between this classification and the H/A/a classification is led using real
SAR data. acquired over different natural media such as bare soils, snow
covered mountains regions and forested areas for different frequency bands.
Quantitative results of these two classifications are calculated from
available ground truth measurements."
}

@INPROCEEDINGS{Alla0605:Study,
AUTHOR="Sophie Allain and Laurent Ferro-Famil and Eric Pottier",
TITLE="Study of high resolution polarimetric {SAR} data for soil parameter
retrieval",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="New Synthetic Aperture Radars are characterized by high spatial resolution
values. It has been observed, in many studies, that the surface scattering
becomes dependent on the resolution cell size as the spatial resolution
decreases. This paper proposes to retrieve surface parameters as the shape
of the surface spectrum and the surface rms height from polarimetric SAR
data acquired for different resolution size over surfaces with various
roughness.. As the resolution cell size increases, the behavior of the
scattering information changes. In order, to model the scattering
coefficient, a two scale model is derived. In the case of high SAR
resolution sizes, the surface viewed by the SAR has a band-limited
spectrum. In order to take into account this limitation, a rough surface is
decomposed into a small and a large scale by splitting its spectrum in two
parts according to the spatial resolution size. Within each resolution
cell, the polarimetric scattering information is derived as a coherent
summation of all elementary scatterers contributions with the IEM model,
taking into account roughness characteristics within the SAR cell. SAR data
analysis usually involves a polarimetric incoherent averaging of different
cell responses. The global polarimetric response of the surface is a
function of roughness and cell size. This model is used to find a relation
between the texture correlation function and the surface correlation
function. It is shown that using the two-scale model and SAR data, this
relation changes with the resolution. A new inversion algorithm is
developed in order to consider the influence of resolution cell size.
Moreover, this analysis is tested on different polarization channels to
find the most appropriate channel to retrieve surface parameters. It is
shown that the retrieved physical parameters may differ from one case to
the other. This study is validated using indoor polarimetric SAR
measurements, acquired at the European Microwave Signature Laboratory
(EMSL) at the JRC laboratory at Ispra for various resolution cell sizes
over four different types of surface."
}

@INPROCEEDINGS{Alla0610:Robust,
AUTHOR="Hommad Allali and Anthony Lo and Ignas Niemegeers",
TITLE="A Robust {Measurement-Based} Admission Control for Resource Management in
Diffserv {IP} Networks",
BOOKTITLE="10th IEEE International Conference on Communication Systems 2006",
ADDRESS="Singapore, Singapore",
DAYS=30,
MONTH=oct,
YEAR=2006,
ABSTRACT="IP-based Radio Access Networks (RANs) are envisaged to be the next
generation access networks in UMTS. In order to provide a satisfactory
level of Quality of Service (QoS) for real-time applications, and efficient
network resource utilisation in the IP-based RAN, Resource Management in
Diffserv (RMD) is proposed. RMD is a simple and scalable bandwidth resource
management scheme that extends Differentiated Services for on-demand
resource reservation and admission control. This paper investigates
Measurement Based Admission Control algorithms for RMD. We propose an
alternative Time Scale Decomposition (TSD) algorithm, which is called TSD
Enhanced Aggregate Estimation (TSD-EAE). Our next step is to investigate
the impact of traffic burstiness on the performance of TSD-EAE and compare
it against other MBAC algorithms in the literature. The study is conducted
by using an RMD network simulator and a MPEG-4 traffic simulation model.
The simulation results show TSD-EAE compares favourably against other MBAC
algorithms. Because TSD-EAE is robust keeping the packet loss and delay low
while achieving high utilisation."
}

@INPROCEEDINGS{Alle0604:Simulation,
AUTHOR="Marco Allegretti and Marco Marcovina and Luca Spognetta and Marco Gabella
and Giovanni Emilio Perona",
TITLE="Simulation in complex indoor environments of a {3D} Propagation Algorithm
based on inverse Ray Tracing",
BOOKTITLE="LAPC - Loughborough Antennas \& Propagation Conference",
ADDRESS="Burleigh Court Conference Centre, Loughborough University",
DAYS=11,
MONTH=apr,
YEAR=2006,
ABSTRACT="The analysis and simulation of electromagnetic (EM) wave propagation
represent a crucial task in planning wireless networks for ICT application
in complex indoor environments: for example, when emergency communication
requirements must be fulfilled, an adequate planning is unavoidable in
order to grant a service reliable both for quality and confidence. Since
empirical wave propagation models are usually inadequate in indoor
environments, 3D ray tracing techniques are quite useful and accurate to
face the problem, even if a detailed vectorial drawing of the building
under investigation must be available. For recently planned buildings, that
isnt a problem: vectorial drawings are usually available from architectural
projects; older buildings require instead a detailed survey. This paper
describes a deterministic wave propagation simulator which can be very
useful to evaluate propagation losses in indoor environments, even the most
complex ones. Since the number of reflecting walls is usually below 102, 3D
Ray Tracing can be directly applied by using multiple image method: no
speeding up tricks (such as the ones used in urban scenery or when the
number of walls to process is above 103) are required in order to reduce
computation time. In such environments, even if edge diffraction is
negligible (compared to reflection contributions), an empirical model was
adopted at least to make the field maps continuos in the simulation
characterized by a low number of reflections. In order to display the
output maps and to manage the input phase of vectorial drawings, a user
friendly CAD-like Graphical User Interface (GUI) was developed, too. Among
other various features, the GUI allows for example to pick from very
complex architectural drawings only the true reflecting surfaces and
diffracting edges and to display the outputs with different color palettes
and resolution. By using the developed software described, in addition to
the field signal strength, its easy to evaluate from the propagation losses
other important parameters such as for example the delay spread, the
signal-to-noise ratio (SNR) and the carrier-to-interference (C/I) ratio."
}

@INPROCEEDINGS{Alle0609:HDR,
AUTHOR="David Alleysson and Sabine Susstrunk and Laurence Meylan",
TITLE="{HDR} {CFA} Image Rendering",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="We propose a method for high dynamic range (HDR) mapping that is directly
applied on the color filter array (CFA) image instead of the already
demosaiced image. This rendering is closer to retinal processing where an
image is acquired by a mosaic of cones and where adaptive non- linear
functions apply before interpolation. Thus, in our framework, demosaicing
is the final step of the rendering. Our method, inspired by retinal
sampling and adaptive processing is very simple, fast because only one
third of operations are needed, and gives good result as shown by
experiments."
}

@INPROCEEDINGS{Alle0611:Model,
AUTHOR="William Allen and Chin Dou and Gerald Marin",
TITLE="A Model-based Approach to the Security Testing of Network Protocol
Implementations",
BOOKTITLE="The 2nd IEEE LCN Workshop on Network Security",
ADDRESS="Tampa, Florida, U.S.A.",
DAYS=14,
MONTH=nov,
YEAR=2006,
ABSTRACT="Software is inherently buggy and those defects can lead to security
breaches in applications. For more than a decade, buffer overflows have
been the most common bugs found “in the wild” and they often
lead to critical security issues. Several techniques have been developed to
defend against these types of security flaws, all with different rates of
success. In this paper, we present a systematic approach for the automated
testing of network protocol server implementations. The technique is based
on established black-box testing methods (such as finite-state model-based
testing and fault-injection) enhanced by the generation of intelligent,
semantic-aware test cases that provide a more complete coverage of the code
space. We also demonstrate  the use of a model-based testing  tool that can
reliably detect vulnerabilities in server applications."
}

@INPROCEEDINGS{AlMa0611:Optimal,
AUTHOR="Bader Al-Manthari and Nidal Nasser and Hossam Hassanein",
TITLE="Optimal Utility-based Scheduling Scheme for High Speed Downlink Packet
Access",
BOOKTITLE="IEEE Globecom 2006 - Next Generation Networks",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Channel dependant scheduling schemes for High Speed Downlink Packet Access
(HSDPA) system such as Max CIR and Proportional Fairness (PF) have been
proven to provide a significant throughput gain by exploiting the channel
fluctuations of the users. However, their inability to ensure a fair
distribution of the radio resources among the mobile users has been a major
concern.  In this paper, we propose a novel Medium Access Control Packet
Scheduler (MAC-PS) scheme for HSDPA that is motivated by realistic economic
models to satisfy the mobile users as well as the service providers through
the use of utility and opportunity cost functions. Simulation results
reveal the superiority of the MAC-PS in terms of fairness, user
satisfaction and flexibility."
}

@INPROCEEDINGS{Alme0607:Space,
AUTHOR="André {de Almeida} and Favier {Gérard} and Joao Mota",
TITLE="{Space-Time} Multiplexing Codes: A Tensor Modeling Approach",
BOOKTITLE="The Seventh IEEE International Workshop on Signal Processing Advances in
Wireless Communications",
ADDRESS="Cannes, France",
DAYS=2,
MONTH=jul,
YEAR=2006,
ABSTRACT="In this paper, we present new Space-Time Multiplexing Codes (STMC) for
multiple-antenna transmissions, which rely on a three-dimensional tensor
modeling of the transmitted/received signals. The proposed codes combine
spatial multiplexing and space-time coding by spreading a linear
combination of different sub-streams of data over the space and time
dimensions. We show the STMC induces a tensor structure on the
transmited/received signal that can be modeled using a trilinear tensor
decomposition. Tensor modeling is exploited at the receiver for a blind
decoding of the transmitted sub-streams based on linear processing and
without any ambiguity. The proposed approach also provides full diversity
while benefiting from the maximum multiplexing
gain offered by the multiple antennas. Simulation results show that the
tensor-based STMC offer remarkable performance with good
diversity-multiplexing trade-off."
}

@INPROCEEDINGS{Almh0606:Recursive,
AUTHOR="Jalal Almhana and Zikuan Liu and Vartan Choulakian",
TITLE="A Recursive Algorithm for Gamma Mixture Models",
BOOKTITLE="ICC'06 General Symposium",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="The hyper-Erlang model can approximate any nonnegative distribution as
closely as desired. It can not only characterize field data well, but also
facilitate analytically tractable results for performance evaluation. As a
result, this model is widely used in telecommunication network modeling.
Actually, the hyper-Erlang model is a special case of a mixture of Gamma
models. This paper proposes an online algorithm for Gamma mixture
distributions and applies it to Internet traffic modeling. Simulation and
experimental results are also provided."
}

@INPROCEEDINGS{ALMH0609:New,
AUTHOR="Ahmad Almhdie and Christophe {Léger} and Mohamed Deriche and Roger
{Lédée}",
TITLE="A new implementation of the {ICP} algorithm for {3D} surface registration
using a comprehensive look up matrix",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="The iterative closest point algorithm is one of the most effi-cient
algorithms for robust rigid registration of 3D data. It consists in finding
the closest points between two sets of data which are then used to estimate
the parameters of the global rigid transformation to register the two data
sets. All the steps of the algorithm are highly dependent upon the accuracy
with which correspondence pairs of points are found. In this paper, a new
enhanced implementation of the ICP algorithm proposes to use a look up
matrix for finding the best correspondence pairs. It results in reducing
the minimum mean square error between the two data sets after registration,
compared to existing implementations. The algorithm was implemented and
tested to evaluate its con-vergence properties and robustness to noise.
Performance improvements are obtained. The new algorithm has success-fully
been applied to register 3D medical data."
}

@INPROCEEDINGS{Alon0604:Dynamic,
AUTHOR="Marina Alonso and Salvador Coll and Juan-Miguel Martinez and Vicente
Santonja and Pedro Lopez and Jose Duato",
TITLE="Dynamic Power Saving in {Fat-Tree} Interconnection Networks Using {On/Off}
Links",
BOOKTITLE="High-Performance Power-Aware Computing 2006",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="Current trends in high-performance parallel computers
show that fat-tree interconnection networks are one of the
most popular topologies. The particular characteristics of
this topology, that provide multiple alternative paths for
each source/destination pair, make it an excellent candidate
for applying power consumption reduction techniques. Such
techniques are being increasingly applied in computer systems
and the interconnection network is not an exception,
since its contribution to system power budget is not negligible.
In this paper, we present a mechanism that dynamically
switches on and off network links as a function of traf-
fic. The mechanism is designed to guarantee network connectivity,
according to the underlying routing algorithm. In
this way, the default routing algorithm can be used regardless
the power saving actions taken, thus simplifying router
design.
Our simulation results show that significant network
power consumption reductions can be obtained at no cost.
Latency remains the same although the number of operating
network links is dynamically adjusted."
}

@INPROCEEDINGS{Alou0603:Diversity,
AUTHOR="Mohamed-Slim Alouini and Khalid Qaraqe",
TITLE="Diversity Combining with {Up-Link} Power Control",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="We introduce in this paper a new adaptive power-controlled diversity
combining scheme that reduces the average transmitted power of the mobile
units while meeting a certain minimum required quality of service. The key
idea is (i) to collect and combine all the available diversity paths at the
base station and then (ii) to request the mobile unit to increase or
decrease its transmitted power just to track the required target
signal-to-noise ratio (SNR). Four power control variants accounting for
practical implementation constraints including discrete power levels and
transmitter gain saturation are proposed and studied. Some preliminary
selected numerical results, show that the proposed scheme offers
considerable savings in the transmitted power levels over a wide SNR range
but amplifier saturation leads to a violation of the target BER requirement
in the low average SNR range."
}

@INPROCEEDINGS{Alou0603:Tutorial,
AUTHOR="Mohamed-Slim Alouini",
TITLE="Tutorial: Design and Performance Evaluation of Diversity Systems over
Fading Channels.",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="Many of the current and emerging wireless communication technologies and
systems make use of some form of diversity combining to combat the fading
and shadowing effects induced by the harsh, complex, and dynamic channel.
In designing such systems to achieve a specified quality of service, one is
also faced with the practical reality of satisfying a predetermined degree
of complexity. Thus, although the optimum (from a performance standpoint)
diversity combining techniques such as maximal-ratio combining (MRC) (for
coherent systems) and equal gain combining (EGC) (for non-coherent and
differentially-coherent systems) are well-known, one often opts in favor of
a less complex scheme at a sacrifice in performance. In this tutorial a
wide variety of receiver, transmitter, and multiple-input multiple-output
(MIMO) diversity combining schemes are outlined and compared from a
performance and complexity standpoint. The analytical tools used to obtain
the performance of these systems are also be presented and discussed. The
mathematical formalism is illustrated by various parametric performance
curves that can help researchers and design engineers to perform trade-off
studies among various diversity combining schemes so as to determine the
most suitable choice in the face of their available constraints. This
tutorial concludes with discussions of (1) combining in diversity rich
environments and (2) multi-user diversity schemes which are two recent
applications that have seen a great deal of interest and progress over the
last couple of years. The intent of this tutorial is not to duplicate
material dealing with basic digital communication theory and system
performance evaluation over additive white Gaussian channels which is well
documented in many fine textbooks on the subject. Rather the tutorial
serves to supplement the material found in these texts and as such is of
most value to those desiring to extend their knowledge to the performance
of communication systems over wireless fading channels. This tutorial
coverage is sufficiently broad as to have strong appeal to MS and PhD
students, instructors/lecturers, and researchers currently working in the
field of digital communications as well as a large cross-section of
practicing engineers who are responsible for the design, development, and
performance evaluation of wireless communication systems. Just as a matter
of information, the presenter co-authored the second edition of a textbook
on the topic which was published by Wiley in December 2004. Hence much of
what the presenter will cover in the tutorial will come from material that
is contained therein, and the attendees will in a sense get a condensed
version of the material that is published in that book as well as new
results discovered more recently by the author and collaborators in the
area of design and performance analysis of adaptive diversity combiners and
multi-user diversity systems. Speaker's biography: Mohamed-Slim Alouini was
born in Tunis, Tunisia. He received the Diplome d'Ingenieur degree from the
Ecole Nationale Superieure des Telecommunications(TELECOM Paris), Paris,
France, and the Diplome d'Etudes Approfondies (D.E.A.) degree in
Electronics from the University of Pierre \& Marie Curie (Paris VI), Paris,
France, both in 1993. He received the M.S.E.E. degree from the Georgia
Institute of Technology (Georgia Tech), Atlanta, GA, USA, in 1995, and the
Ph.D. degree in electrical engineering from the California Institute of
Technology (Caltech), Pasadena, CA, USA, in 1998. He also received the
Habilitation degree from the University of Paris VI in 2003. He is
currently an Associate Professor at the Texas A\&M University in Qatar and
his current research interests include statistical characterization and
modeling of fading channels, performance analysis of diversity combining
techniques, MIMO, and multi-hop communications systems, capacity and outage
analysis of multi-user wireless systems subject to interference and/or
jamming, and design and performance evaluation of multi-resolution,
hierarchical, and adaptive modulation schemes. Dr. Alouini has published
several papers on the above subjects and he is co-author of the textbook
Digital Communication over Fading Channels published by Wiley Inter-science
(1st Edition in 2000 and 2nd Edition in 2004). He is a recipient of a
National Semiconductor Graduate Fellowship Award, the Charles Wilts Prize
for outstanding independent research leading to a Ph.D. degree in
electrical engineering at Caltech, co-recipient of the Prize Paper Award of
the IEEE Vehicular Technology Conference (VTC'99-Fall), Amsterdam, The
Netherlands, co-recipient of the Best Paper Award of 7th ACM/IEEE
International Symposium on Modeling, Analysis and Simulation of Wireless
and Mobile Systems (MSWiM 2004), Venice, Italy, a 1999 CAREER Award from
the National Science Foundation, a McKnight Land-Grant Professorship by the
Board of Regents of the University of Minnesota in 2001, the Best
Instructor Award (Dept of ECE) by the Institute of Technology Student Board
at the University of Minnesota in 2001 and 2002, and the Taylor Career
Development Award from the Institute of Technology of the University of
Minnesota in 2003. He is an editor for the IEEE Transactions on
Communications (Modulation \& Diversity Systems) and for the Wiley Journal
on Wireless Systems and Mobile Computing."
}

@INPROCEEDINGS{Alpa0606:Performance,
AUTHOR="Onur Alparslan and Shin'ichi Arakawa",
TITLE="Performance of Paced and {Non-Paced} Transmission Control Algorithms in
Small Buffered Networks",
BOOKTITLE="11th IEEE Symposium on Computers and Communications",
ADDRESS="Pula-Cagliari, Sardinia, Italy",
DAYS=26,
MONTH=jun,
YEAR=2006,
ABSTRACT="Famous rule-of-thumb states that a buffer sized at B = RTT* BW, where RTT
is the average round trip time and BW is the bandwidth of output link is
necessary in order to achieve high utilization with TCP flows. However, as
the speed of links continue increasing with technological advances, this
buffer requirement starts becoming an important cost factor on routers of
electronic networks. On the other hand, bursty nature of TCP limits further
decreasing the buffer requirements, because it brings a very high packet
drop rate in small buffered networks. In this paper, we evaluate several
transmission control algorithms in small buffered networks. The algorithms
include TCP Reno, TCP NewReno, Highspeed TCP with SACK, and XCP. Simulation
results show that all non-paced TCP and XCP versions perform poorly.
Furthermore, the results also show that even rule-of-thumb buffers are not
enough for XCP in some cases because of high burstiness of XCP. We
therefore introduce pacing method at sender side for making transmission
control algorithms suitable for very small buffered networks. We show that
pacing alone is not enough for XCP to make suitable for small buffered
networks, so we introduce a suitable parameter set. Simulation results show
that buffer requirements on routers are greatly reduced by paced XCP with
suitable parameter settings, while keeping best fairness, faster
convergence, and high utilization."
}

@INPROCEEDINGS{ALPH0605:PLATINE,
AUTHOR="Olivier Alphand and Pascal Berthou and Thierry Gayraud and Frédéric Nivor
and Stéphane Combes and Cedric Baudoin",
TITLE="{PLATINE:} {DVB-S/RCS} Testbed for Next Generation Satellite Networks",
BOOKTITLE="Third Advanced Satellite Mobile Systems Conference",
ADDRESS="Herrsching am Ammersee (Germany)",
DAYS=29,
MONTH=may,
YEAR=2006,
ABSTRACT="Evaluating performances over real data links or network is often costly,
even impossible for systems in development phase. In such situation,
emulation is the key to provide a low cost and demonstrative platform. The
main problem is to overcome the emulation weakness which is the accuracy of
the model reproducing the systems to be evaluated. Owing to its modular
design and implementation, the PLATINE satellite emulation platform,
presented in this paper, is able to emulate a complete DVB-RCS (Digital
Video Broadcasting Return Channel via Satellite) system in a realistic and
flexible way. It is possible to configure the platform to simulate a
transparent DVB-RCS system dimensioned around a single Hub, or to simulate
a system using a regenerative satellite with an on-board switching matrix
only by changing some configuration files. A DVB-RCS protocol stack is
implemented, and the modulation/coding part is simulated in real time
thanks to pre-calculated BER files. A DiffServ-like QoS Architecture that
couples MAC and IP-Layer QoS mechanisms has also been implemented. In this
paper, we mainly focus on the emulation platform and the tools developed to
help the performance analysis of the simulated system."
}

@INPROCEEDINGS{AlQa0601:Analytical,
AUTHOR="Salman AlQahtani",
TITLE="Analytical Modeling of Call Admission Control Schemes for Multiclass
Traffic Mobile Wireless Networks",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="This paper studies and analyze two call admission control (CAC) schemes in
multimedia cellular wireless networks. These call admission control
algorithms are studied for different network configurations. These
configurations include, employing the queuing techniques for voice handoff
with finite lifetime, differentiating between voice and data calls in terms
of the average channel holding time, data bandwidth requirements, and
employing queuing techniques for voice handoff and data handoff calls with
finite lifetime. The main contribution of this paper is the development of
an analytical model for each of the two CAC algorithms specified in this
study. In addition to the call blocking and termination probabilities which
are usually cited as the performance metrics, in this work we derive and
evaluate other metrics that have not be considered by previous work such as
the average queue length, the average queue residency, and the time-out
probability for handoff calls. We also develop a simulation tool to test
and verify our results. Finally, we present numerical examples to
demonstrate the performance of the proposed CAC algorithms and we show that
analytical and simulation results are in total agreement."
}

@INPROCEEDINGS{AlQa0601:Qos,
AUTHOR="Salman AlQahtani",
TITLE="A {QoS-Aware} Call Admission Control Algorithm for {3G} Cellular Wireless
Networks",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="The 3G cellular mobile systems which are based on WCDMA technology are
expected to be interference limited. Soft capacity is one of the main
characteristics of 3G (i.e, UMTS) and it requires new radio resource
management strategies to serve diverse quality of service requirements. In
this paper, a WCDMA prioritized uplink call admission control (CAC)
algorithm for UMTS, which combines QoS negotiation and service
differentiation by priority, is studied. This CAC scheme gives preferential
treatment to high priority calls, such as soft handoff calls, by reserving
some bandwidth margin (soft guard channel) to reduce handoff failures. In
addition, queuing is also used to enhance the handoff success probability.
The algorithm uses the effective load as an admission criterion and applies
different thresholds for new and handoff calls. Finally, the study
considers two types of services: voice and data calls. Results indicate
that this algorithm reduces the drop handoff calls and increases the total
system capacity; hence the GoS and the system performance can significantly
be improved especially in case of high mobility environments."
}

@INPROCEEDINGS{AlQa0601:Uplink,
AUTHOR="Salman AlQahtani",
TITLE="Radio Resource Management Issues for {3G} and Beyond Cellular Wireless
Networks",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="Radio resource management (RRM) in the next generation wireless network
system will have features and requirements that are quite distinct from
current systems, mostly designed for non-heterogeneous and non-shared
networks. Such features include radio resource sharing which is considered
as one of the main future issues of RRM as network evolves towards 4G.
Radio resource sharing has an impact on system design in general and on
radio resource management in particular. This paper presents a general RRM
for 3G and beyond mobile wireless network supporting multi-services,
referred to as general call admission control (GCAC). The aim of the
proposed GCAC algorithm is to guarantee the required quality of service
(QoS) and to maintain higher resource utilization. Simulation results
indicate that the proposed GCAC provides higher resource utilization under
all load conditions leading in turn to increased revenue. In addition, a
higher quality of service for traffic is provided especially when we
differentiate between the traffic classes."
}

@INPROCEEDINGS{AlQa0603:Analytical,
AUTHOR="Salman AlQahtani and Ashraf Mahmoud",
TITLE="Analytical Modeling of Two Call Admission Control Schemes for Multiclass
Traffic {3G} Mobile Wireless Networks",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="This paper studies and analyze two call admission control (CAC) schemes in
multimedia 3G cellular wireless networks. These call admission control
algorithms are studied for different network configurations. These
configurations include, employing the queuing techniques for voice handoff
with finite lifetime, differentiating between voice and data calls in terms
of the average channel holding time, data bandwidth requirements, and
employing queuing techniques for voice handoff and data handoff calls with
finite lifetime. The main contribution of this paper is the development of
an analytical model for each of the two CAC algorithms specified in this
study. In addition to the call blocking and termination probabilities which
are usually cited as the performance metrics, in this work we derive and
evaluate other metrics that have not be considered by previous work such as
the average queue length, the average queue residency, and the time-out
probability for handoff calls. We also develop a simulation tool to test
and verify our results. Finally, we present numerical examples to
demonstrate the performance of the proposed CAC algorithms and we show that
analytical and simulation results are in total agreement."
}

@INPROCEEDINGS{AlQa0610:Performance,
AUTHOR="Salman AlQahtani and Ashraf Mahmoud and Asrar Shiekh",
TITLE="Performance Evaluation of Uplink {CAC} for {3G} {WCDMA} Wireless Networks
with Multiservices",
BOOKTITLE="10th IEEE International Conference on Communication Systems 2006",
ADDRESS="Singapore, Singapore",
DAYS=30,
MONTH=oct,
YEAR=2006,
ABSTRACT="The wide-band code division multiple access (WCDMA) based 3G and beyond
cellular mobile wireless networks are expected to provide a diverse range
of multimedia services to mobile users with guaranteed quality of service
(QoS). Call admission control is a very important measure in WCDMA system
to guarantee the quality of the communicating links. Two throughput-based
admission control strategy with multi-services, referred to herein as the
complete partitioning CAC (CP-CAC) and the queuing priority CAC (QP-CAC),
are analyzed and compared. The main contribution of this paper is the
development of an analytical model for the QP-CAC algorithm which can be
easily extended and used for CP-CAC. We also develop a simulation tool to
test and verify our results. Finally, we present numerical examples to
demonstrate the performance of the proposed CAC algorithms and we show that
analytical and simulation results are in total agreement."
}

@INPROCEEDINGS{Alqa0611:Efficient,
AUTHOR="Hend Alqamzi and Tiffany Jing Li",
TITLE="An Efficient Energy-balanced {COordinated} Node Scheduling {(ECONS)}
Protocol for Dense Wireless Sensor Networks",
BOOKTITLE="IEEE Globecom 2006 - Wireless Ad Hoc and Sensor Networks - towards Anytime
Anywhere Internetworking",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="The sensing area coverage of wireless sensor networks indicates the
surveillance quality of the monitored region, and hence it is an important
Quality of Service (QoS) measure of the network. Since applications differ
in their requirements of sensing area coverage, we first define the
parameters that can be adjusted by the applications to meet the desired
coverage percentage. Next, we propose a node scheduling protocol that
maximizes the network lifetime while preserving the QoS coverage
requirements. Our Protocol guarantees that the on-duty sensors at any time
provide complete coverage of the monitored area while others are asleep.
This is achieved by an accurate sleeping eligibility method, proper back
off schemes, and dynamic off duty interval that adapts to the energy
consumption pattern of the sensors in each neighborhood. It also minimized
the protocol overhead energy using appropriate mechanisms. Simulation
addresses applications with different QoS requirements using realistic
network application scenario and energy model based on MICA2 measurements
that consider all sources of energy consumption in a wireless media.
Results show that the proposed protocol achieves an increase of 49\% to
71.5\% of network lifetime compared to non-scheduled networks and 18.9\%
compared to Coverage Preserving (CP) protocol."
}

@INPROCEEDINGS{AlSa0611:Hybrid,
AUTHOR="Choudhury {Al Sayeed} and Alex Vukovic and Oliver Yang and Heng Hua",
TITLE="Hybrid Low Loss Architecture for Reconfigurable Optical {Add/Drop}
Multiplexer",
BOOKTITLE="IEEE Globecom 2006 - Advanced Technologies and Protocols for Optical
Networks",
ADDRESS="San Francisco, CA, USA",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Reconfigurable Optical Add/Drop Multiplexers (ROADMs) manufactured with
different designs and technologies are soon going to be available in the
market. Unfortunately, the latest available ROADM architectures are either
suffering from high insertion losses, or high manufacturing costs that
prevents their rapid deployment in the network. In this paper, we propose a
low-loss Hybrid architecture for ROADM subsystem that combines the best
features of the latest available ROADM designs. A metro network testbed is
designed and simulated in order to compare the performance of different
ROADM modules. The obtained results indicate that our proposed Hybrid-ROADM
module performs better than the latest available ROADM subsystems and
ultimately reduces the overall network operating costs."
}

@INPROCEEDINGS{Alsh0601:Expedited,
AUTHOR="Hamada Alshaer and Eric Horlait",
TITLE="Expedited Forwarding {End-to-End} Delay Budget Partitioning",
BOOKTITLE="CCNC2006 Networking Track Regular Technical Papers",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="Providing strict bandwidth or delay bound to packet flows in the Internet
is an inherently challenging task. It requires signaling and policing
mechanisms, accurate and rapid accounting for network resources, and call
admission control. In this paper, we present some policies to translate
end-to-end (e2e) resource requirements into per-DiffServ hop service rate.
We also introduce two e2e delay budget partitioning algorithms: One is
built on rate-based scheduling and another is built on delay-based
scheduling. This work mainly focuses on guaranteeing the e2e delay and loss
of real-time flows given Expedited Forwarding (EF) Service class in
DiffServ network. Furthermore, balancing EF traffic loads on the network
links along the different routing paths."
}

@INPROCEEDINGS{Alsu0606:Novel,
AUTHOR="Emad Alsusa and Lin Yang",
TITLE="Novel {Redundancy-Free} and {SER-Improved} Selective Mapping Technique with
Coded Phase Sequences for {PAPR} Reduction in {OFDM} Systems",
BOOKTITLE="ICC 2006  Signal Processing for Communications",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="The inhernet high peak-to-average power ratio (PAPR) of multicarrier
transmission, such as OFDM or DMT, is a major drawback that can
significantly worsen the power efficiency and performance of these systems.
One of the most effective techniques proposed for reducing the PAPR in
multicarrier systems is based on selective mapping (SLM) in which a family
of sequencies with random phase distribution is used iteratively to modify
the phases of the modulated subcarriers with the aim to minimise the PAPR.
However, the fact that this technique requires the transmission of side
information, to enable correct demapping at the receiver, reduces the
system's spectral and transmission-power efficiency. In this paper, we
propose a modified SLM technique that does not require the transmission of
any side information while at the same time it can achieve the same PAPR
reduction and even lower symbol error rate (SER) performance as the
unmodified SLM technique."
}

@INPROCEEDINGS{ALSu0609:Party,
AUTHOR="Ghazi {AL Sukkar} and Hossam Afifi and Sidi-Mohammed Senouci",
TITLE="Party: {Pastry-Like} Multi-hop Routing Protocol for Wireless
{Self-Organizing} Networks",
BOOKTITLE="Mobile Computing and Wireless Communications International Conference",
ADDRESS="Amman, Jordan",
DAYS=17,
MONTH=sep,
YEAR=2006,
ABSTRACT="With the great advance of wireless communication technologies, an increased
interest in wireless Self-Organizing Networks (SONs) was remarkable. The
deployment of wireless Self-Organizing Networks (e.g. MANET, Mesh Networks,
and Sensor Networks) raises a number of key design issues such as
scalability, spontaneity, ease-of-management, adaptability, and dynamically
changing topologies. In this context, routing is particularly challenging,
and requires revisiting important components of the routing
architecture/protocol suite, such as, establishing and managing an
addressing scheme, providing a distributed location service, and defining a
packet forwarding mechanism.
In this paper we propose Party, a new routing protocol for wireless
Self-Organizing Networks, this protocol is intended to be applied in
environments with large number of nodes where the scalability of the
routing protocols play an important issue, it is well known that the
current ad hoc routing protocols do not scale to work efficiently in
networks of more than a few hundred nodes. In Party, nodes build a network
infrastructure which allocates each node a unique relative address
according to the current node relative location, the  routing is also
unique and only depends on the current node’s neighborhood, where in
order to implement the routing table, each node needs only to exchange
information with its direct neighbors."
}

@TECHREPORT{Alta0602:Modeling,
AUTHOR="Altyeb Altaher and Sami Sharif and Iman Abumaaly",
TITLE="Modeling of Autocorrelation Functions Using Weighted Non-linear least
Squares",
TYPE="arXiv report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0602094",
MONTH=feb,
YEAR=2006,
ABSTRACT="Because autocorrelation functions play an important role in stochastic
processes and can be used to model the traffic data practically, it is
significant to study how to find a function that best fits the
autocorrelation
sequence of a real-traffic trace. This paper presents a asymptotic model
for
autocorrelation functions using Weighted non-linear least squares.",
URL="http://arXiv.org/abs/cs/0602094"
}

@INPROCEEDINGS{Alti0606:Effective,
AUTHOR="Kuban Altinel",
TITLE="Effective coverage in sensor networks: Binary integer programming
formulations and heuristics",
BOOKTITLE="ICC 2006  Wireless Ad Hoc and Sensor Networks",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Coverage is a fundamental task in sensor networks. We present two binary
integer linear programming models for the effective sensor placement on a
grid structured sensor field when there are more than one types of
available sensors with varying sensing quality and price. The first model
assumes perfect sensor detection. The second one is more realistic and
gives an optimal placement strategy for probabilistic sensing. Both models
suffer from the intractability of the binary integer programming
formulations. We therefore suggest greedy and Lagrangean heuristics, which
are both accurate and efficient. Computational results are also provided."
}

@INPROCEEDINGS{ALTI0609:Phase,
AUTHOR="Mustafa Altinkaya and Emin Anarim and Bulent Sankur",
TITLE="Phase Noise Mitigation in the Autocorrelation Estimates With Data
Windowing: The Case of Two Close Sinusoids",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="We address the phase noise and the superresolution problem in Toeplitz
matrix-based spectral estimates. The Toeplitz autocorrelation (AC) matrix
approach in spectral estimation brings in an order of magnitude
computational advantage while the price paid is the phase noise that
becomes effective at high signal-to-noise ratios (SNR). This noise can be
mitigated with windowing the data though some concomitant loss in
resolution occurs. The trade-offs between additive noise SNR, 
resolvability of sinusoids closer than the resolution limit, and behavior
of the estimated AC lags and tone frequencies are investigated."
}

@INPROCEEDINGS{Alti0609:Retour,
AUTHOR="Hatice Altintas and Yasin Yasin and Jacqueline Born",
TITLE="Retour vers le futur",
BOOKTITLE="VDE-1MT 2006, 1. Mitarbeiter Tagung in Frankfurt",
ADDRESS="Frankfurt/Main",
DAYS=21,
MONTH=sep,
YEAR=2006,
ABSTRACT="Der VDE-Innovationsmonitor 2005, eine Umfrage unter den 1.250
Mitgliedsunternehmen des Verbandes, kommt zu dem Ergebnis, dass die
deutsche Industrie im internationalen Vergleich Spitzenpositionen bei der
Innovationskraft in der Elektro-, Energie-, Automations- und Medizintechnik
einnimmt. Die höchste Schubkraft geht von der Mikro- und Nanotechnik
aus; in der Mikroelektronik ist Deutschland führend in Europa. Die
Studie können Sie für 150 Euro inkl. MwSt. (VDE-Mitglieder kostenlos)
unter www.vde.com/reports herunterladen. [mehr]"
}

@INPROCEEDINGS{Alti0609:Second,
AUTHOR="Hatice Altintas",
TITLE="Second Paper Submission",
BOOKTITLE="VDE-1MT 2006, 1. Mitarbeiter Tagung in Frankfurt",
ADDRESS="Frankfurt/Main",
DAYS=21,
MONTH=sep,
YEAR=2006,
ABSTRACT="This is a new test This is a new test This is a new test This is a new test
This is a new test This is a new test This is a new test This is a new test
This is a new test This is a new test This is a new test This is a new test
This is a new test This is a new test This is a new test This is a new test
This is a new test This is a new test This is a new test This is a new test
This is a new test This is a new test This is a new test This is a new test
This is a new test This is a new test This is a new test This is a new test
This is a new test This is a new test"
}

@INPROCEEDINGS{Altm0601:Fair,
AUTHOR="Eitan Altman and Jerome Galtier and Corinne Touati",
TITLE="Fair power and transmission rate control in wireless networks",
BOOKTITLE="Third Annual Conference on Wireless On demand Network Systems and Services",
ADDRESS="Les Menuires, France",
DAYS=18,
MONTH=jan,
YEAR=2006,
ABSTRACT="In third generation mobile networks, transmission rates can be assigned to
both real time and non real time applications. We address in this paper the
question of how to allocate transmission rates in a manner that is both
optimal and fair. As optimality criterion we use the Pareto optimality
notion, and as fairness criterion we use a general concept of which the
max-min fairness (which is the standardized fairness concept in ATM
networks) and the proportional fairness (which characterizes fairness
obtained by some transport protocols for the Internet) are special cases.
We show that the problem is a joint optimization system of the transmission
rate and the power. We formulate the fair allocation problem as an
optimization problem and propose both exact as well as approximating
solutions. We consider both uplink and downlink problems and study also
macrodiversity."
}

@INPROCEEDINGS{Altm0604:Parallel,
AUTHOR="Eitan Altman and Dhiman Barman and Bruno Tuffin and Milan Vojnovic",
TITLE="Parallel {TCP} Sockets: Simple Model, Throughput and Validation",
BOOKTITLE="IEEE INFOCOM 2006",
ADDRESS="Barcelona, SPAIN",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="We consider a simple model of parallel TCP connections defined as follows.
There are N connections competing for a bottleneck of fixed capacity. Each
connection is assumed to increase its send rate linearly in time in absence
of congestion indication and otherwise decreases its rate to a fraction
\beta of the current send rate. Whenever aggregate send rate of the
connections hits the link capacity, a single connection is signalled a
congestion indication. Under the prevailing assumptions, and assuming only
in addition a mild stability condition,we obtain that the throughput is the
factor of the link capacity (1-1/(1+const\ N)), with
const=(1+\beta)/(1-\beta). This result appears to be previously unknown;
despites simplicity of its final form, it may be non trivial to prove. The
result is of practical importance as it elucidates the throughput of
parallel TCP sockets, an approach used widely to improve throughput
performance of bulk data transfers (e.g. GridFTP), in regimes when
individual connections are none or weakly synchronized. We argue that it is
important to distinguish two factors that contribute to TCP throughput
deficiency (F1) TCP window synchronization and (F2) TCP window adaptation
in congestion avoidance. Our result is a good news as it suggests that in
regimes when (F1) does not hold, already a few sockets are enough to almost
entirely eliminate the deficiency due to (F2). Specifically, the result
suggests that already 3 TCP connections yield 90\\% link utilization and
95\\% is almost achieved by 6 connections. This analytically proven result
should provide incentive to throughput-greedy users to limit the number of
their parallel TCP sockets as a few connections already ensure effectively
100\\% utilization, and any additional connections would provide only a
marginal throughput gain. Openning too many sockets is not desirable as
such transfers may beat down other connections sharing a link on the path
of this transfer. However, there still remains a throughput deficiency due
to (F1), which may provide incentive to users to open more sockets.The
result found in this paper suggests that throughput-deficiency of parallel
TCP sockets would be largely attributed to the synchronization factor (F1)
and not to window control (F2). This motivates intelligent queueing
disciplines that help mitigating the synchronization. As a by-product, the
result shows that emulation of parallel TCP connections by MultTCP protocol
is a good approximation.The implication of the result is that aggregate
throughput achieved by connections is insensitive to a choice of loss
policy which connection is signalled a congestion indication at congestion
events.This perhaps somewhat counter-intuitive throughput insensitivity
property is showed not to hold for steady-state distribution of the
aggregate send rate.We provide a preliminary validation of our results by
simulations."
}

@INPROCEEDINGS{Alva0609:Trellis,
AUTHOR="Marcos {Álvarez Díaz} and Massimo Neri and Carlos Mosquera and Giovanni
Emanuele Corazza",
TITLE="Trellis Shaping Techniques for Satellite Telecommunication Systems",
BOOKTITLE="Second International Workshop on Satellite and Space Communications 2006",
DAYS=14,
MONTH=sep,
YEAR=2006,
ABSTRACT="In recent years, satellite overlay networks have shown their potential for
delivering multimedia content both to rural and urban environments. In the
latter case, the adoption of terrestrial Intermediate Module Repeaters
(IMRs) is in order to close the link in Non-Line-of-Sight propagation
conditions, causing a severe increase of multipath propagation and
consequent linear distortion, adding to the intrinsic non linear distortion
of satellite links. Whenever the propagation channel for the user receiving
the data can be known with good approximation at the transmitter, the
application of precoding techniques can be considered as a feasible
solution to counter channel dispersion. In this paper, Tomlinson-Harashima
precoding and Signal Shaping are used along with predistortion techniques
to increase the resilience to channel dispersion and non-linear distortion.
Several metrics are considered, that pursue different optimization goals.
The robustness to non linear distortion of signals shaped using different
metrics is assessed, showing the impact on performance of signal dynamics."
}

@INPROCEEDINGS{Alve0601:TCM,
AUTHOR="Rui Alves",
TITLE="{TCM} Coding of {PPM} Based Modulations for Infrared {WLANs} impaired by
{ISI}",
BOOKTITLE="International Symposium on Wireless Pervasive Computing 2006",
ADDRESS="Phuket, Thailand",
DAYS=16,
MONTH=jan,
YEAR=2006,
ABSTRACT="In this communication we consider the use of PPM based modulation methods,
such as the hybrid modulation method called Amplitude and Pulse-Position
Modulation (APPM) and Overlapping Pulse-Position Modulation (OPPM) to
improve the performance of infrared WLANs, by the use of Trellis-Coded
Modulation (TCM) codes. We describe the best code search and results, which
demonstrate that, even with trellis codes of moderate complexity,
non-negligible coding gains can be obtained without bandwidth expansion.
Monte Carlo simulations have been done to evaluate uncoded PPM and APPM and
OPPM TCM coded systems performances, on ceiling-bounce channel models with
delay spread per bit duration ratios values 0, 0.06 and 0.2. Although our
codes were derived for AWGN channel (without ISI awareness) their behaviour
in multipath dispersion channels is quite effective. Actually, our current
work focuses the search of codes with optimum features in ISI prevention."
}

@INPROCEEDINGS{Alve0603:Investigation,
AUTHOR="Graham Alvey and Helen Pan and Jennifer Bernhard",
TITLE="Investigation into Techniques for Packaging Cosite Microstrip Patch
Antennas into Handheld Devices",
BOOKTITLE="2006 IEEE International Workshop on Antenna Technology:  Small Antennas and
Novel Metamaterials",
ADDRESS="White Plains, Nw York",
DAYS=6,
MONTH=mar,
YEAR=2006,
ABSTRACT="In many situations, it is advantageous to have multiple wireless systems
located in very close proximity to one another. Placing the antennas of
separate systems near each other, however, creates numerous problems. In
order to limit the severity of the issues associated with cosite antenna
configurations, the antennas should be very well isolated. The following
work investigates a few possible approaches to help isolate two nearby
linearly polarized microstrip patch antennas on a common ground plane."
}

@TECHREPORT{Alve0606:Use,
AUTHOR="Atos Alves",
TITLE="Use {MPLS} in Lan's",
TYPE="arXiv report",
INSTITUTION="arXiv",
MONTH=jun,
YEAR=2006,
ABSTRACT="To demonstrate the result of researches in laboratory with the focus in
exhibiting the real impact of the use of the technology MPLS in LAN.
Through these researches we will verify that the investment in this
technology is shown, of the point of view cost/benefit, very interesting,
being necessary, however, the adoption of another measured, in order to
settle down a satisfactory level in the items Quality and safety in the
sending of packages in VPN but assisting to the requirement latency of the
net very well being shown in the tests that it consumes on average one
Tuesday leaves of the time spend for the same function in routing IP.",
URL="http://arxiv.org/abs/cs/0606123"
}

@INPROCEEDINGS{Alyf0610:Fair,
AUTHOR="George Alyfantis and Stathes Hadjiefthymiades and Lazaros Merakos",
TITLE="On Fair and Efficient Power Control in {CDMA} Wireless Data Networks",
BOOKTITLE="International Conference on Computer Communications and Networks 2006 -
Wireless Mobile Networking",
ADDRESS="Arlington, Virginia, USA",
DAYS=9,
MONTH=oct,
YEAR=2006,
ABSTRACT="We consider the uplink power control problem in a single cell, multi-user,
CDMA wireless data system and formulate it as a cooperative game. Our goal
is to provide an efficient and fair solution. For this reason, we use the
Nash bargaining solution concept, in order to determine the socially
optimum solution, which is both Pareto efficient and fair. In our
formulation, the BS plays the role of the arbitrator, i.e., solves the
power control problem in a socially optimal manner, and broadcasts the
relevant information to all users in order to enforce convergence to the
optimal operating point. The comparison of the proposed scheme to the
non-cooperative scheme shows significant reduction in the required
transmission power of the mobile terminals."
}

@INPROCEEDINGS{Alyf0610:Proactive,
AUTHOR="George Alyfantis and Stathes Hadjiefthymiades and Lazaros Merakos",
TITLE="Proactive Resource Management for the Mitigation of Service Discontinuation
in Mobile Networks",
BOOKTITLE="International Conference on Computer Communications and Networks 2006 -
Wireless Mobile Networking",
ADDRESS="Arlington, Virginia, USA",
DAYS=9,
MONTH=oct,
YEAR=2006,
ABSTRACT="A scheme for the proactive allocation of network resources, based on a
pricing framework, is proposed. The objective is the reduction of service
discontinua-tion events attributed to handovers in the cellular
in-frastructure, by intelligently managing the finite wire-less resources.
The future base station, where network resources have to be reserved
proactively, is deter-mined by means of a path prediction algorithm. The
network receives a fee for providing the advance res-ervation service to
the user. The exact price is deter-mined after a sequential bargaining
procedure, mod-eled as a two-person non-cooperative game between the mobile
user and the network. The efficiency of the proposed scheme is evaluated
through simulations."
}

@INPROCEEDINGS{Alzo0607:Maintaining,
AUTHOR="Khaled Alzoubi and Moussa Ayyash",
TITLE="Maintaining a Quality of Service Routing Tree for Mobile Ad Hoc Networks",
BOOKTITLE="IWCMC 2006 Wireless Ad Hoc and Sensor Networks",
DAYS=3,
MONTH=jul,
YEAR=2006,
ABSTRACT="We define the Quality of Service Routing Tree (QoSRT) for the weighted
graph G(V,E), as a subgraph G\′(V,E\′) such that G\′ is a
tree, and the set of intermediate edges of the path between any pair of
nodes u and v is a subset of E\′. Furthermore, the bottleneck of the
path is maximized. In this paper, we propose a distributed algorithm to
construct a QoSRT that adapts quickly to mobile environments. The QoSRT is
uniquely constructed for maintenance purposes, that handles mobility and
changes to bandwidth within the local subtree. Then we propose a
maintenance scheme to act quickly in response to mobility and bandwidth
changes. A virtual backbone (VBB) which consists of a subset of the nodes
is also constructed. The QoSRT and its VBB are constructed using O(nlog n)
messages in O(nlog n) time."
}

@INPROCEEDINGS{Amat0604:Design,
AUTHOR="Alexandre {Graell i Amat} and Fredrik {Brännström} and Lars K. Rasmussen",
TITLE="Design of {Rate-Compatible} Serially Concatenated Convolutional Codes",
BOOKTITLE="4 th International Symposium on Turbo Codes in connection with 6th
International ITG-Conference on Source and Channel Coding",
ADDRESS="Munich, Germany",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="Recently a powerful class of rate-compatible serially concatenated
convolutional codes (SCCCs) have been proposed based on minimizing
analytical upper bounds on the error probability in the error floor region.
Here this class of codes is further investigated by combining analytical
upper bounds with extrinsic information transfer charts analysis. Following
this approach, we construct a family of rate-compatible SCCCs with good
performance in both the error floor and the waterfall regions over a broad
range of code rates."
}

@INPROCEEDINGS{Ambe0605:Super,
AUTHOR="Virginie Amberg and David Petit and Céline Tison and Jean-Claude Souyris",
TITLE="Super-resolution based on spectral shifted {SAR} images : Theory and
results",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="This paper pursues describing potential and limitations of super-resolution
and super-localization techniques based on a combination of spectral
shifted SAR image. First, we propose a theoretical approach of the concept,
and second we provide preliminary validated results."
}

@INPROCEEDINGS{Ambe0605:Tracking,
AUTHOR="Virginie Amberg and Marc Spigai and Yves {Le roy}",
TITLE="A tracking algorithm for road extraction in dense urban areas: importance
of contextual information",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="The ability of future spatial SAR sensors to provide fine resolution
imagery of the Earth surface leads to new remote sensing applications. This
article deals with one relevant application of high resolution remote
sensing: road extraction in semi-urban and dense urban areas. In previous
works, we have already proposed an almost automatic and reliable algorithm
for road extraction in peri-urban areas. The process is based on a Hough
transform that localises straight parts of road in the scene, and a
tracking algorithm that extracts the full road network. The current paper
proposes some modifications of these previous works to take into account
knowledge about contextual objects of road to complete the extraction
result in disturbed areas."
}

@INPROCEEDINGS{Amde0604:Packet,
AUTHOR="Manish Amde and Joel Marciano and Sushil Singh and Cahit Akin and Rene Cruz
and Kenneth Yun",
TITLE="Packet Detection and Acquisition at Low {SINR} in {Spread-Spectrum} Based
Wireless Communications",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Phy/MAC",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="A low signal to interference and noise ratio (SINR) wireless environment
makes successful reception and accurate detection of packets a challenging
task. We can combat a low SINR by using direct-sequence spread spectrum
modulation with a sufficiently high processing gain, as well as by
employing block codes for FEC on each packet. In this paper, we propose a
packet detection and acquisition method for low SINR environments. The
received waveform is processed using a non-linear filtering algorithm based
on a maximum likelihood ratio calculation to detect the presence of
transmitted packets. The algorithm uses the entire packet transmission for
chip timing synchronization and code acquisition at the receiver. The
performance of the algorithm is analyzed using simulations and real packet
transmissions captured over the wireless medium. The algorithm is finally
implemented on a FPGA which is a part of a wireless transceiver prototype.
The experimental results are reported."
}

@INPROCEEDINGS{Ames0610:PhotoArcs,
AUTHOR="Morgan Ames and Lilia Manguy",
TITLE="{PhotoArcs:} Ludic Tools for Sharing Photographs",
BOOKTITLE="ACM Multimedia - Short Papers and Posters",
DAYS=22,
MONTH=oct,
YEAR=2006,
ABSTRACT="PhotoArcs is a framework for flexible creation of photo-narratives,
timeline displays of friends’ photos, and consistent,
collaboratively-created metadata. The interface aims to enable easy and fun
manipulation and sharing of digital photographs and narratives, organized
around chronological “arcs” of photographs, to encourage remote
sharing and interaction. We describe the design of the interface and how
the design has changed across three iterations. We also report on the
results of an exploratory low-fidelity usability study with five
participants and an expert evaluation and critique with eleven user
experience researchers, and outline future directions for the PhotoArcs
project."
}

@INPROCEEDINGS{Amin0604:Coordinated,
AUTHOR="Mehdi Aminian and Kazem Akbari and Bahman Javadi",
TITLE="Coordinated Checkpoint from Messages Payload in Pessimistic {Sender-Based}
Message Logging",
BOOKTITLE="The 7th Workshop on Parallel and Distributed Scientific and Engineering
Computing at IPDPS 2006",
ADDRESS="Rhodes Island, Greece",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="Execution of MPI applications on Clusters and Grid deployments suffering
from node and network failures which motivates the use of fault tolerant
MPI implementations. Two category techniques have been introduced to make
these systems fault-tolerant. The first one is checkpoint-based technique
and the other is log-based recovery protocol. Sender-based pessimistic
logging which falls in the second category is harnessing from huge amount
of payload messages it must keep in volatile memory and uncoordinated
checkpoint files.  We present the Coordinated Checkpoint from Messages
Payload (CCMP) to reduce this overhead. We examine our method on MPICH-V2,
a public domain platform implemented pessimistic logging with uncoordinated
checkpoint. Experimental results demonstrate the reduction of run-time for
NPB benchmarks in both fault-free and faulty environment."
}

@INPROCEEDINGS{Amin0604:Multiband,
AUTHOR="Muhammad Amin and Robert Cahill",
TITLE="Multiband Quadrifilar Helix Antenna",
BOOKTITLE="LAPC - Loughborough Antennas \& Propagation Conference",
ADDRESS="Burleigh Court Conference Centre, Loughborough University",
DAYS=11,
MONTH=apr,
YEAR=2006,
ABSTRACT="A new Quadrifilar Helix Antenna (QHA) is presented which uses a simple
mechanical tuning arrangement to provide multiband operation. This is
demonstrated using computed and experimental results at L-band where for a
½ turn, half-wavelength structure the resonant frequency is shown to be
tunable over a 16 \% bandwidth for a VSWR \≤ 2 and a front to back
ratio \≥14dB."
}

@INPROCEEDINGS{Amin0604:Recycling,
AUTHOR="Mohammad Amin and Ivor Morrow",
TITLE="Recycling Ambient Microwave Energy With Wideband Microstrip Rectenna",
BOOKTITLE="LAPC - Loughborough Antennas \& Propagation Conference",
ADDRESS="Burleigh Court Conference Centre, Loughborough University",
DAYS=11,
MONTH=apr,
YEAR=2006,
ABSTRACT="A high efficiency microstrip rectenna element has been designed and tested
at 2.5 GHz for applications involving microwave power transmission. The
patch antenna and circuitry are printed on a thin Taconic substrate. A
silicon Schottky barrier mixer diode with low forward voltage drop is used
as a rectifying device and integrated with the patch antenna. A novel
feature of the patch rectenna operation is rectification over an extended
bandwidth of 9 \%. This has been made possible by implanting two silicon
varicap diodes into the radiating apertures of the microstrip antenna. The
rectenna was tested in the laboratory for free space microwave power
transmission and achieved an rf-to-dc conversion efficiency of 25\% at an
input power density of 0.56 µW/cm2 and 1 k? load. The antenna and
circuit design are based upon analytic and full-wave electromagnetic
circuit design. There is good agreement between predicted and measured
results"
}

@INPROCEEDINGS{Amin0608:Bluetooth,
AUTHOR="Mohammad Amin and Fahima Bhuyan and Mohammad Amin and M Rahman",
TITLE="Bluetooth Scatternet Formation Protocol: A Comparative Performance Analysis",
BOOKTITLE="12th Asia-Pacific Conference on Communications",
ADDRESS="Busan, Republic of Korea",
DAYS=31,
MONTH=aug,
YEAR=2006,
ABSTRACT="This paper describes the in depth performance comparison and evaluation
among three major solutions for forming multi-hop networks of Bluetooth
devices (scatternet formation). The three protocols considered in this
paper are BlueTrees [1], BlueStars [2], and the “New protocol”
presented in [3]. By means of a thorough performance evaluation, protocol
parameters and Bluetooth technology features that affect the duration of 
device discovery, have been identified. The effect of the different
protocols’ operations on key metrics of the generated scatternets is
also analyzed in this paper. The comparative performance evaluation showed
that due to the simplicity of its operations and to its basic working
requirements BlueStars is by far the fastest protocol for scatternet
formation However, BlueStars produces scatternets with an unbounded,
possibly large number of slaves per piconet, which imposes the use of
potentially inefficient Bluetooth operations. A good compromise when
interested in forming scatternets whose piconets have a bounded number of
slaves is obtained by the New protocol. The comparative study presented in
this paper clearly identifies the key features of a scatternet formation
protocol that affects its performance."
}

@INPROCEEDINGS{Amin0611:Steganalysis,
AUTHOR="Palak Amin",
TITLE="Steganalysis Using Power Spectra of Digital Images",
BOOKTITLE="IEEE Globecom 2006 - Network and Information Security Systems",
ADDRESS="San Francisco, USA",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="In this paper we present a semantic categorization of images, and the
discuss the change in the power spectra of these images before and after
data hiding. Data hiding alters various natural qualities of the host
image, one of which is the image power spectrum. In this paper, we classify
a large image database into several categories based on characteristics
such as atmospheric details, backgrounds, depths, resolutions, etc. For
each category, we calculate the slope (alpha) of the log-log graph of the
spatial frequency versus the amplitude for the marked and unmarked images.
We note that in the case of spatial data hiding the average value of alpha
for the marked images is at least 45.73\% higher than that of the unmarked
images. Also in the cases of transform domain data hiding we note that the
average value of alpha for the images marked using a discrete cosine
(wavelet) transform (DC(W)T) based technique is higher by at least 3.41\%
(15.76\%). For a commercial data hiding software namely Digimarc
corp.’s MyPictureMarc® 2005 V1.0, the average value of alpha for
the marked images is at least 30.61\% higher than that of the unmarked
images. The maximum percent differences in the value of alpha for all of
the four classes of data hiding algorithms are 65.89\%, 15.76\%, 51.13\%
and 42.19\% for the spatial, DCT, DWT and Digimarc techniques respectively.
Based on the observations above we propose to visually classify a test
image into one of the semantic categories as in this paper and an alpha
value deviating from other images in same class will reveal the presence of
hidden data in the test image."
}

@INPROCEEDINGS{Amir0601:Broadband,
AUTHOR="Pouyan Amirshahi and Mohsen Kavehrad",
TITLE="Broadband Access over Medium and Low Voltage Powerlines and use of White
Light Emitting Diodes for Indoor Communications",
BOOKTITLE="CCNC2006 Networking Track Regular Technical Papers",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="Home users are in need for broadband communications access, globally.
Broadband powerline communication has advanced through last decade and it
is going to be a mature access technology in near future. Meanwhile, indoor
optical wireless communications through lighting LEDs has been
investigated, recently. Suitable channel models are proposed for each of
these systems and the corresponding transmission capacity values are
calculated. It is shown that marriage of these two technologies creates an
efficient delivery mechanism for fulfilling the premise of broadband access
for home networking, while providing efficient and low-cost lighting."
}

@INPROCEEDINGS{Amir0601:Fountain,
AUTHOR="Pouyan Amirshahi and Seyed Mohammad Navidpour and Mohsen Kavehrad",
TITLE="Fountain Codes for Impulsive Noise Correction In {Low-Voltage} Indoor
Power-line Broadband Communications",
BOOKTITLE="CCNC2006 Networking Track Regular Technical Papers",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="Broadband communications for indoor power-line networks with impulsive
noise using Orthogonal Frequency Division Multiplexing (OFDM) is considered
in this paper. From earlier investigations, it is known that this channel
suffers from multipath fading and frequency selectivity along with man-made
impulsive bursty noise. Nevertheless, the calculated channel capacity limit
promises very high data rates over this channel. Enhancement techniques,
such as concatenated coding can help an OFDM system to tackle impulsive
noise burst. In this paper we employ Digital Fountain codes, which are a
new class of erasure detecting codes. These codes are considered the
state-of-the-art discovery in coding theory due to their simplicity and
performance."
}

@INPROCEEDINGS{Amir0601:Increasing,
AUTHOR="Mohammad Amirhosseini",
TITLE="Increasing the efficiency of interconnects using a compensating circuit",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="It is shown that the efficiency of an arbitrary previously designed
interconnect can be increased using a suitable compensating circuit at its
far end. A lossless lowpass circuit is considered for this purpose and its
element values can be obtained by an optimization method. The proposed idea
is evaluated using an example."
}

@INPROCEEDINGS{Amir0601:Using,
AUTHOR="Mohammad Amirhosseini",
TITLE="Using {DOUBLE-LAYERS} {WALLS} {FOR} {SHIELDED} {ENCLOSURES}",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="In this paper the use of double-layers walls for shielded enclosures is
proposed to increase the shielding effectiveness of them. The effect of
distance between two layers and the offset between two apertures in the
shielding effectiveness is investigated. To analyze enclosures with
double-layers wall, the eigenvector expansion and the Bethes approximation
have been used."
}

@INPROCEEDINGS{Amir0606:Fast,
AUTHOR="Yair Amir and Claudiu Danilov and Michael Hilsdale and Raluca Musaloiu-E.
and Nilo Rivera",
TITLE="Fast Handoff for Seamless Wireless Mesh Networks",
BOOKTITLE="Fourth International Conference on Mobile Systems Applications and Services
- MobiSys 2006",
ADDRESS="Uppsala, Sweden",
DAYS=19,
MONTH=jun,
YEAR=2006,
ABSTRACT="This paper presents the architecture and protocols of SMesh, a completely
transparent wireless mesh system that offers seamless, fast handoff,
supporting VoIP and other real-time application traffic for any unmodified
802.11 device. In SMesh, the entire mesh network is seen by the mobile
clients as a single, omnipresent access point. Fast handoff is achieved by
ensuring that each client is served by at least one access point at any
time. Mobile clients are handled by a single access point during stable
connectivity times. During handoff transitions, SMesh uses more than one
access point to handle the moving client. Access points continuously
monitor the connectivity quality of any client in their range and
efficiently share this information with other access points in the vicinity
of that client to coordinate which of them should serve the client.
Experimental results on a fully deployed mesh network consisting of 14
access points demonstrate the effectiveness of the SMesh architecture and
its handoff protocol."
}

@INPROCEEDINGS{Amir0606:Performance,
AUTHOR="Pouyan Amirshahi and Seyed Mohammad Navidpour and Mohsen Kavehrad",
TITLE="Performance Analysis of {OFDM} Broadband Communications System Over Low
Voltage Powerline with Impulsive Noise",
BOOKTITLE="ICC'06 General Symposium",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Broadband communications for indoor power-line networks with impulsive
noise using Orthogonal Frequency Division Multiplexing (OFDM) is
considered. From earlier investigations, it is known that this channel
suffers from multipath fading and frequency selectivity along with man-made
impulsive bursty noise. Nevertheless, the calculated channel capacity limit
promises very high data rates over this channel. In this paper the bit
error rate (BER) performance of the OFDM system under impulsive noise and
frequency fading is theoretically analyzed and closed form formulas for
this performance is derived. Furthermore, a theoretical upper bound on the
performance of coded OFDM system is obtained, given perfect interleaving
and the effect of the interleaver length on coding performance is also
studied."
}

@INPROCEEDINGS{Amir0611:Analog,
AUTHOR="Amir Amirkhany and Aliazam Abbasfar and Vladimir Stojanovic and Mark
Horowitz",
TITLE="Analog {Multi-Tone} Signaling for High-speed Backplane Electrical Links",
BOOKTITLE="IEEE Globecom 2006 Signal Processing for Communication",
ADDRESS="San Francisco, California, USA",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Implementing a multi-tone (MT) architecture for high-speed backplane
electrical links is difficult given the tight power and complexity
constraints in this application. This paper proposes an approach that
incorporates a baseband (BB) channel and a few passband (PB) channels. In
this MT system inter-channel interference (ICI) and inter-symbol
interference (ISI) are eliminated through fractionally spaced equalization
at the transmitter and feedback equalization at the receiver. The design is
modeled as a MIMO system, and optimal  equalizer coefficients to minimize
the transmit peak voltage are found by casting the optimization as a Second
Order Conic (SOC) problem. In addition, for systems that need adaptation,
we show how equalizer and power allocation coefficients can be obtained
(sub optimally) using Zero Forcing (ZF) optimization. The effect of
transmitter and receiver clock jitter are modeled in a way that can be
included in both SOC and ZF optimizations, and the performance of this
system is compared to more conventional baseband examples. It is shown that
this AMT system can be built with complexity/power similar to a comparable
performance baseband system, but has the ability to scale to higher bit
rates."
}

@INPROCEEDINGS{Amma0606:Semi,
AUTHOR="Nejib Ammar",
TITLE="{Semi-Coherent} Detection for Differential {Space-Time} Codes",
BOOKTITLE="ICC 2006  Signal Processing for Communications",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Differential space-time coded (DSTC) modulation is a viable scheme for MIMO
communication systems that do not utilize channel information at the
receiver either because of rapid channel variation and/or limited training
data. The drawback of DSTC is the 3 dB performance loss because of
incoherent detection. In order to alleviate this performance loss, we
develop a semi-coherent receiver structure in which partial channel
information is acquired and utilized to generalize the traditional
non-coherent receiver. This partial channel information takes the form of a
subspace where the channel parameter vector must reside in. It is blindly
extracted from the receive data without additional pilot assistance."
}

@INPROCEEDINGS{Amma0610:Computing,
AUTHOR="Habib M. Ammari and Sajal Das",
TITLE="On Computing Conditional {Fault-Tolerance} Measures for Wireless Sensing
k-Covered Networks",
BOOKTITLE="9th ACM-IEEE International Symposium on Modeling, Analysis and Simulation
of Wireless and Mobile Systems (MSWiM 2006)",
ADDRESS="Torremolinos, Malaga, Spain",
DAYS=2,
MONTH=oct,
YEAR=2006,
ABSTRACT="Traditional connectivity is a graph-theoretic concept that has been widely
used as a measure of the fault tolerance in wireless sensor networks. The
classical connectivity, however, assumes that any subset of nodes can
potentially fail at the same time, including the entire neighbor set of any
node. In this paper, we propose a new measure of fault tolerance, called
conditional fault-tolerance, for a class of wireless sensor networks, named
wireless sensing k-covered networks (WSkCN), using the concept of forbidden
faulty set. Our forbidden faulty set analysis of conditional
fault-tolerance prohibits having a simultaneous failure of all the
neighbors of any node. We characterize WSkCN with either homogeneous or
non-homogeneous sensors based on the assumptions of random uniform
distribution of the sensors and circular model of their transmission and
sensing ranges. In particular, we compute the minimum node degree of WSkCN.
We also prove that in general, the relationship between transmission and
sensing ranges   does not always imply network connectivity even if sensing
coverage is guaranteed. Moreover, we propose two conditional
fault-tolerance measures for WSkCN: one based on the concept of conditional
connectivity, the other using a new concept that is called conditional
coverage. Our results prove that WSkCN can sustain a large number of sensor
failures provided that the faulty set does not include the forbidden faulty
set. We also present tractable algorithms for checking network connectivity
and computing the degree of sensing coverage."
}

@INPROCEEDINGS{Amme0606:Energy,
AUTHOR="Josephine Ammer and Jan Rabaey",
TITLE="The {Energy-per-Useful-Bit} Metric for Evaluating and Optimizing Sensor
Network Physical Layers",
BOOKTITLE="International Workshop on Wireless Ad Hoc and Sensor Networks",
DAYS=28,
MONTH=jun,
YEAR=2006,
ABSTRACT="To become truly ubiquitous, sensor network nodes must achieve ultra low
power consumption.  This paper proposes the Energy-per-Useful-Bit (EPUB)
metric for evaluating and comparing sensor network physical layers.   EPUB
includes the energy consumption of both the transmitter and receiver, and
amortizes the energy consumption during the synchronization preamble over
the number of data bits in the packet.  Using EPUB, we compare six existing
sensor network PHYs.  Next, an optimization of the PHY according to EPUB is
performed.  We conclude that the EPUB of sensor network PHYs can be reduced
by increasing data rate, lowering carrier frequency, and using simple
modulation schemes such as OOK to reduce synchronization overhead."
}

@INPROCEEDINGS{Amor0601:Lightweight,
AUTHOR="Alessandro Amoroso and Marco Masotti",
TITLE="Lightweight Steganography on Smartphones",
BOOKTITLE="CCNC2006 NIME Workshop",
ADDRESS="Las Vegas",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="Steganography is an historical technique to send secret messages embedded
into carrier messages. The introduction of computers provided very
sophisticated techniques to create carrier messages, to embed the secret,
and to detect steganographic messages. The smartphone devices are both
popular and ubiquitous, and they can be used as an ``all-in-one'' device
for steganography. The users can shoot photos, and use them as carrier
message. By means of the computational capacity of the smartphones, the
user can also embed and retrieve small messages into the photos stored into
the device. Moreover, the user can securely communicate its secrets by
means of sending and receiving MMS messages. The Multimedia Messaging
Service, MMS, is a common technique to exchange images in the actual
scenario of cellular telephony. In this paper we show the results of
preliminary studies to test the feasibility of such an approach."
}

@INPROCEEDINGS{Ampe0607:Linear,
AUTHOR="Dimitris Ampeliotis and Kostas Berberidis",
TITLE="A Linear Complexity Turbo Equalizer Based on a Modified Soft Interference
Canceller",
BOOKTITLE="The Seventh IEEE International Workshop on Signal Processing Advances in
Wireless Communications",
ADDRESS="Cannes, France",
DAYS=2,
MONTH=jul,
YEAR=2006,
ABSTRACT="Soft-Input Soft-Output (SISO) equalizers based on linear filters have
proven to be good, low complexity, alternatives to trellis-based SISO
equalizers. In particular, the Soft Interference Canceller (SIC) has
recently received great interest, especially for receivers performing Turbo
Equalization. In this paper, we modify the way in which the SIC
incorporates soft information. In existing literature the input to the
cancellation filter is the expectation of the symbols based solely on the
a-priori probabilities coming from the decoder, whereas here we propose to
use the conditional expectation of those symbols, given both the a-priori
probabilities and the received sequence. This modification results in
performance gains at the expense of increased computational complexity.
However, by introducing an approximation to the aforementioned algorithm a
linear complexity SISO equalizer can be derived. Simulation results for an
8-PSK constellation and hostile radio channels have shown the effectiveness
of the proposed algorithms in mitigating the Inter-Symbol Interference
(ISI)."
}

@INPROCEEDINGS{Amyo0605:Evaluation,
AUTHOR="Daniel Amyot and Hanna Farah and Jean-François Roy",
TITLE="Evaluation of Development Tools for {Domain-Specific} Modeling Languages",
BOOKTITLE="Fifth Workshop on System Analysis and Modelling",
ADDRESS="Kaiserslautern, Germany, Germany",
DAYS=31,
MONTH=may,
YEAR=2006,
ABSTRACT="Creating and maintaining tools for domain-specific modelling languages
(DSML) demands time and efforts that often discourage potential developers.
However, several tools are now available that promise to accelerate the
development of DSML environments. In this paper, we evaluate five such
tools (GME, Tau G2, RSA, XMF-Mosaic, and Eclipse with GEF and EMF) by
observing how well they can be used to create graphical editors for the
Goal-oriented Requirement Language (GRL), for which a simplified metamodel
is provided. We discuss the evaluation criteria, results, and lessons
learned during the creation of GRL editors with these technologies."
}

@ARTICLE{Amyo0609:Evaluation,
AUTHOR="Daniel Amyot and Hanna Farah and Jean-François Roy",
TITLE="Evaluation of Development Tools for {Domain-Specific} Modeling Languages",
JOURNAL="LNCS System Analysis and Modelling",
ADDRESS=", Germany",
DAYS=28,
MONTH=sep,
YEAR=2006,
ABSTRACT="Creating and maintaining tools for domain-specific modeling languages
(DSML) demands time and efforts that often discourage potential developers.
However, several tools are now available that promise to accelerate the
development of DSML environments. In this paper, we evaluate five such
tools (GME, Tau G2, RSA, XMF-Mosaic, and Eclipse with GEF and EMF) by
observing how well they can be used to create graphical editors for the
Goal-oriented Requirement Language (GRL), for which a simplified metamodel
is provided. We discuss the evaluation criteria, results, and lessons
learned during the creation of GRL editors with these technologies."
}

@INPROCEEDINGS{An0605:PGA,
AUTHOR="Daoxiang An and Huang Xiaotao and Liang Wang",
TITLE="{PGA} Algorithm for Stripmap {UWB} {SAR}",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="This paper discusses the problem when directly apply PGA to Stripmap UWB
SAR. Especially the serious phase error space-variant along the range is in
Stripmap UWB SAR. And a way was proposed to solve the problem. Finally, the
simulation modal was presented."
}

@INPROCEEDINGS{An0608:Energy,
AUTHOR="Xizhi An and Kyungsup Kwak",
TITLE="An Energy-efficient Routing Scheme for {UWB} Sensor Networks",
BOOKTITLE="12th Asia-Pacific Conference on Communications",
ADDRESS="Busan, Republic of Korea",
DAYS=31,
MONTH=aug,
YEAR=2006,
ABSTRACT="In this paper, an energy-efficient routing scheme for sensor networks based
on ultra-wideband (UWB) technique is proposed and evaluated. This method
makes use of the positioning capability of UWB and takes into account the
energy consumption in the network. By modeling the property of energy
consumption, we find that energy and quality-of-service (QOS) issues are
greatly influenced by the route selected. Accordingly, a new routing
algorithm is derived to search for energy-efficient routes that can support
adequate QOS requirements. The simulation results have proved the
advantages of this routing scheme. Related Topics: Wireless Sensor
Networks, Routing Technology"
}

@INPROCEEDINGS{Anan0601:Call,
AUTHOR="Sai Anand and Thomas Erlebach",
TITLE="Call Control on Lines",
BOOKTITLE="COMmunication Systems softWAre and middlewaRE",
DAYS=8,
MONTH=jan,
YEAR=2006,
ABSTRACT="Call admission control, call control for short, is a fundamental
optimization problem arising in communication networks. The objective of
the problem is to maximize the profit of call requests that can be
accommodated in the network without violating the bandwidth constraints on
the links. We study the offline variant of the problem on line networks. We
provide polynomial time approximation schemes (PTAS) or algorithms with
good approximation ratios for the problem when varying restrictions are
imposed."
}

@INPROCEEDINGS{Anan0601:Optimized,
AUTHOR="Avishek Anand and Kiran Rk",
TITLE="Optimized and Adaptive Link State Routing Strategy",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="The dominant link state protocols like OSPF despite their advantages
require the flooding of new information across the entire routing area
after changes in any link state. With the growth of the network diameter or
the frequency of link-state changes increases, the overhead in terms of
bandwidth and processing cost, of flooding becomes prohibitive.
Furthermore, such flooding over a large area will cause unnecessary
overhead on the links, potentially creating many transient routing loops
that can last for a long time. This limits the scalability of the routing
protocols to large routing areas. To overcome such problems, we present in
this paper an Optimized and Adaptive Link-State Protocol (OALP), a
modification to the existing link-state routing protocol that does not
require the state of each link to be flooded to the entire internetwork all
the time, or to entire areas if we monitor the activity status of the nodes
in the internetwork. Thus minimizing the amount of information distributed
by link-state routing protocols. There are primarily two modes in which we
devise the network to operate depending the activity levels of the
incumbent nodes. Depending on the activity levels an optimized flooding
procedure is provided which would greatly reduce the number of
advertisements flowing through the network."
}

@INPROCEEDINGS{Anan0609:Design,
AUTHOR="Vijaya Krishna Ananthapadmanabha and Kvs Hari",
TITLE="Design of {MMSE} filterbank precoder and equalizer for {MIMO} frequency
selective channels",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper, we consider the problem of designing minimum mean squared
error (MMSE) filterbank precoder and equalizer for multiple input multiple
output (MIMO) frequency selective channels. We derive the conditions to be
satisfied by the optimal precoder-equalizer pair, and provide an iterative
algorithm for solving them. The optimal design is very general, in that it
is not constrained by channel dimensions, channel order, channel rank, or
the input constellation. We also discuss some pertinent differences between
the filterbank approach and the space-time approach to the design of
optimal precoder and equalizer. Simulation results demonstrate that the
proposed design performs better than the space-time systems while
supporting a higher data rate."
}

@INPROCEEDINGS{Anan0609:Next,
AUTHOR="S Vijay Anand",
TITLE="Next Generation Mobile Terminal Architecture : A Vision",
BOOKTITLE="Mobile Computing and Wireless Communications International Conference",
ADDRESS="Amman, Jordan",
DAYS=17,
MONTH=sep,
YEAR=2006,
ABSTRACT="The Vision of 4G System enables an “always on, always best connected”
mode of communication. Mobile users are expected to have seamless roaming
and fast connectivity to highly integrated cellular networks and should be
able to select preferred networks automatically when the user move across
various cellular networks. This paper proposes a next generation Mobile
Terminal software architecture which includes a Generic Radio Access
Abstraction layer (GRAAL) in the wireless protocol stack for selecting the
best radio access network automatically according to the users and
applications preferences and an IMS (IP Multimedia Subsystem) Client
framework for providing multiple and simultaneous services for voice, data
and multimedia applications. A new MAC Protocol is also introduced for
efficient packet transmission mechanism with reliable QoS assurance for a
new 4G Network and a unified Hardware adaptation layer for achieving fast
synchronization and switching among multiple physical layer technologies.
The proposed Mobile Terminal architecture can enable subscribers to benefit
from high throughput and to maintain session continuity during roaming
across several Radio access Networks."
}

@INPROCEEDINGS{Anan0611:Adaptive,
AUTHOR="Himanshu Anand and Casey Reardon and Rajagopal Subramaniyan and Alan George",
TITLE="Adaptive Link Rate {(ALR)} for Ethernet: Analysis of a {MAC} Handshake
Protocol",
BOOKTITLE="The 31st Annual IEEE Conference on Local Computer Networks (LCN)",
ADDRESS="Tampa, Florida, USA",
DAYS=14,
MONTH=nov,
YEAR=2006,
ABSTRACT="Desktop computers, which comprise the largest portion of Internet users,
collectively represent a significant consumer of energy resources
worldwide.  For these users, operating the network interface card (NIC) at
lower link speeds is one area where power consumption can be reduced. 
Ethernet links are mostly underutilized and can often operate at lower
speeds without significantly decreasing performance.  In this paper, a
handshake protocol at the Medium Access Control (MAC) layer is proposed and
analyzed for dynamically changing the link rate in the NIC, adapting to
network utilization, and decreasing average power consumption.  Simulation
models are developed to evaluate performance of this protocol with respect
to mean packet delay (between NIC and switch) and maximum buffer occupancy
using both captured traffic traces from a Gigabit Ethernet network and
synthetically generated network traffic as inputs.  Simulation results show
that this protocol can be used to change link rate without causing
user-perceivable delays."
}

@INPROCEEDINGS{Anas0610:Adaptive,
AUTHOR="Giuseppe Anastasi and Marco Conti and Mario {Di Francesco} and Andrea
Passarella",
TITLE="An Adaptive Low-latency Power Management Protocol for Wireless Sensor
Networks",
BOOKTITLE="the 4th ACM International Workshop on Mobility Management and Wireless
Access",
ADDRESS="Torremolinos. Malaga, Spain",
DAYS=2,
MONTH=oct,
YEAR=2006,
ABSTRACT="Energy conservation is a very critical issue in wireless sensor networks.
An effective way to reduce power consumption consists in using a
sleep/wakeup scheme that switches off the wireless transceiver when
communication is not needed. Sleep/wakeup schemes usually require to
coordinate wakeup periods of neighbor sensor nodes to allow communication.
In addition, they typically increase the message latency as nodes are not
able to communicate while sleeping.
In this paper we introduce an adaptive and low-latency power management
protocol for multi-hop sensor networks. The proposed scheme staggers wakeup
periods of nodes according to the network organization. In addition, it
minimizes both power consumption and average message latency by dynamically
adjusting the wakeup period of each node to its real communication needs.
The simulation results show that our power management protocol can
effectively react to traffic and topology variations. Furthermore, it
allows lower energy consumption and introduces lower additional latency
than fixed (i.e., non adaptive) sleep/wakeup schemes."
}

@INPROCEEDINGS{Anat0603:Powerline,
AUTHOR="Justinian Anatory and Mussa Kissaka and Nerey Mvungi",
TITLE="Powerline Communications: The Effects of Branches on Network Performance",
BOOKTITLE="IEEE International Symposium on Powerline Communications and Its
Applications",
ADDRESS="Disney Coronado Springs Resort, Orlando, FL USA",
DAYS=26,
MONTH=mar,
YEAR=2006,
ABSTRACT="AbstractThe paper has investigated the effects of branches in powerline
networks. It has utilized the recent developed model to compare different
power line channels. The channels segments compared are access, indoor and
medium channels. The channel was compared by varying different loads at one
of the terminal. The relationship between signal level and number of
branches is established. The signal to noise ratio (SNR) and power to be
transmitted has been simulated. Quadrature amplitude modulation (QAM) is
applied to the access channel model and attainable bit error rate (BER)
against SNR analyzed and compared with possible transmitted power. It is
observed that BER tends to degrade as number of branches increases; the SNR
of about 4dB is needed to attain the original performance by introducing a
branch in the channel, using different modulations."
}

@INPROCEEDINGS{Anci0601:Layer,
AUTHOR="Emilio Ancillotti and Raffaele Bruno and Marco Conti and Enrico Gregori and
Antonio Pinizzotto",
TITLE="A Layer-2 Architecture for Interconnecting Multi-hop Hybrid Ad Hoc Networks
to the Internet",
BOOKTITLE="Third Annual Conference on Wireless On demand Network Systems and Services",
ADDRESS="Les Menuires, France",
DAYS=18,
MONTH=jan,
YEAR=2006,
ABSTRACT="Recently, the research on mobile ad hoc networks is departing from the view
of stand-alone networks, to focus on hybrid self-organized network
environments interconnected to the Internet. This type of networks is built
on a mix of fixed and mobile nodes using both wired and multi-hop wireless
technologies, and may be easily integrated into classical wired/wireless
networking infrastructures. In this paper we design a lightweight and
efficient architecture to build such a multi-hop hybrid ad hoc network,
which will be used as a flexible and low-cost extension of traditional
wired LANs. Our proposed architecture provides transparent global Internet
connectivity and self-configuration to mobile nodes, without requiring
configuration changes in the pre-existing wired LAN. Differently from most
of the implemented solutions, which are based on complex IP-based
mechanisms, such as Mobile IP, IP-in-IP encapsulation and IP tunneling, our
proposed system operates below the IP level, and employs only layer-2
mechanisms. We have prototyped the core functionalities of our
architecture, and we present several experimental results to verify the
network performance constraints, and how different OLSR parameter settings
impact on them."
}

@INPROCEEDINGS{Anco0606:Visualizing,
AUTHOR="Massimo Ancona and Sara Drago and Walter Cazzola and Gianluca Quercini",
TITLE="Visualizing and Managing Network Topologies via Rectangular Dualization",
BOOKTITLE="11th IEEE Symposium on Computers and Communications",
ADDRESS="Pula-Cagliari, Sardinia, Italy",
DAYS=26,
MONTH=jun,
YEAR=2006,
ABSTRACT="Rectangular dualization is an effective, hierarchically oriented
visualization method for network topologies and can be used in many other
problems having in common with networks the condition that objects and
their interoccurring relations are represented by means of a planar graph.
However, only 4-connected triangulated planar graphs admit a rectangular
dual. In this paper we present a linear time algorithm to optimally
construct a rectangular layout for a more general class of graphs and we
discuss a variety of application fields where this approach represents an
helpful support for visualization tools."
}

@INPROCEEDINGS{Ande0604:Comparison,
AUTHOR="Michael Anderson and Mark Reed and Gerard Borg",
TITLE="A Comparison of Optimal and Sub-optimal Iterative Equalization Techniques
for Full-response {CPM}",
BOOKTITLE="4 th International Symposium on Turbo Codes in connection with 6th
International ITG-Conference on Source and Channel Coding",
ADDRESS="Munich, Germany",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT={It is well known that continuous phase modulation (CPM) serially
concatenated with convolutional codes provides powerful error correction
through iterative decoding. CPM also has the inherent benefits of being
bandwidth efficient and compatible with non-linear amplifiers. A
disadvantage of CPM is its relatively poor performance over ISI channels.
In this paper we compare two methods of iteratively equalizing CPM. The
first is the optimal method that combines the memory of the CPM with the
memory of the channel such that decoding is performed over the resulting
{"}super--trellis{"}. The second method is the parallel interference
cancellation method using the Laurent signal model. The two methods are
compared through Monte Carlo simulations and EXIT chart analysis.}
}

@INPROCEEDINGS{Ande0604:Improving,
AUTHOR="John Anderson and Fredrik Rusek",
TITLE="Improving {OFDM:} Multistream {Faster-than-Nyquist} Signaling",
BOOKTITLE="4 th International Symposium on Turbo Codes in connection with 6th
International ITG-Conference on Source and Channel Coding",
ADDRESS="Munich, Germany",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="Mazo's concept of Faster Than Nyquist signaling is extended to pulse trains
that modulate adjacent subcarriers, in a manner similar to orthogonal
frequency division multiplex (OFDM) transmission. Despite pulses that are
faster than the Nyquist limit and subcarriers that significantly overlap,
the transmission system achieves the isolated pulse error performance.
Systems with at least twice the spectral efficiency of OFDM can be achieved
at the same error probability. Receiver design is challenging, and we
report tests of several options."
}

@INPROCEEDINGS{Ande0605:Channel,
AUTHOR="Bjorn Roger Andersen and Odd Gangaas",
TITLE="Channel Adaptive Transmission Techniques in Satellite Communications",
BOOKTITLE="Third Advanced Satellite Mobile Systems Conference",
ADDRESS="Herrsching am Ammersee (Germany)",
DAYS=29,
MONTH=may,
YEAR=2006,
ABSTRACT="In radio communications systems it is a well-known fact that the radio
signals are subject to impairments due to different impacts from the radio
medium. Satellite communications are no exception in this respect. The
paper will discuss impairments on signals in satellite communications
systems, as well as the phenomena that create them, and discuss solutions
for countermeasure the different impairments. Interesting candidates are
adaptive coding and modulation (ACM), channel adaptive packet transmissions
(CAPT), spatial filtering and antenna diversity. Adaptive Coding and
Modulation (ACM) is considered to be most feasible for satellite
communications to fixed terminals, provided sufficient satellite link
bandwidth. ACM is also useful combined with other technical solutions
addressed in this paper, but ACM as a stand-alone method has limitations
for mobile communications channels in general. CAPT represents an enhanced
countermeasure, particularly for maritime satellite communications."
}

@INPROCEEDINGS{Ande0605:Context,
AUTHOR="Ian Anderson and Henk Muller",
TITLE="Context Awareness via {GSM} Signal Strength Fluctuation",
BOOKTITLE="Pervasive 2006 Short Papers-Demos-Videos",
ADDRESS="Dublin, Ireland",
DAYS=7,
MONTH=may,
YEAR=2006,
ABSTRACT="In this paper we demonstrate how a mobile device can infer contextual
information such as mode of travel by monitoring the fluctuation of GSM
signal strength levels and neighbouring cell information. We show that
these signals are stable enough to reliably distinguish between various
states of movement such as walking, travelling in a motor car and remaining
still. We present preliminary results for a metropolitan environment."
}

@INPROCEEDINGS{Ande0609:Rotation,
AUTHOR="Ryan Anderson and Nick Kingsbury and Julien Fauqueur",
TITLE="Rotation Invariant Object Recognition Using {Edge-Profile} Clusters",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="This paper introduces a new method to recognize objects at any rotation
using clusters that represent edge profiles. These clusters are calculated
from the Interlevel Product (ILP) of complex wavelets whose phases
represent the level of edginess vs ridginess of a feature, a quantity that
is invariant to basic affine transformations. These clusters represent
areas where ILP coefficients are large and of similar phase; these are two
properties which indicate that a stable, coarse-level feature with a
consistent edge profile exists at the indicated locations. We calculate
these clusters for a small target image, and then seek these clusters
within a larger search image, regardless of their rotation angle. We
compare our method against SIFT for the task of rotation-invariant matching
in the presence of heavy Gaussian noise, where our method is shown to be
more noise-robust. This improvement is a direct result of our new
edge-profile clusters broad spatial support and stable relationship to
coarse-level image content."
}

@INPROCEEDINGS{Ande0610:Architecture,
AUTHOR="Karl Andersson and Christer Ahlund",
TITLE="An architecture for seamless mobility management in various types of
applications using a combination of {MIP} and {SIP}",
BOOKTITLE="The Fourth Swedish National Computer Networking Workshop 2006",
ADDRESS="Luleå, Sweden",
DAYS=26,
MONTH=oct,
YEAR=2006,
ABSTRACT={4G is not yet defined, but future mobile users will have the possibility to
use a variety of wireless access networks simultaneously making the vision
{"}Always best connected{"} come true. The Internet Protocol (IP) will most
likely be the least common divisor allowing service providers to deploy
services in a unified way regardless of access network type (being wired or
wireless).The 3GPP-led development of the IP Multimedia Subsystem (IMS) is
a promising step towards the vision. However, there are a number of
obstacles along this way forward including various deployment difficulties
related to already installed base of user and infrastructure equipment,
service providers protecting their old investments, somewhat conservative
regulatory authorities, short-comings in digital rights management,
multiple standardization bodies proposing non-aligned solutions, as well as
non-uniformed and non-optimized use of radio spectrum.

Our research is performed within the area of seamless real-time multimedia
distribution in heterogeneous wireless access networks with a user-centric
and end-to-end system approach. Having proposed various extensions to
Mobile IP (MIP) including multihoming and port-based handling of flows, as
well as solutions for global connectivity in ad hoc networks we now present
a combined architecture using both MIP and Session Initiation Protocol
(SIP) for mobility management where MIP is used for TCP connections and SIP
is used for UDP traffic carrying real-time multimedia streams of data.}
}

@INPROCEEDINGS{Ande0610:CRIS,
AUTHOR="Mikael Andersson and Anders Hagsten and Fredrik Neisler",
TITLE="{CRIS} - a Crisis Request generator for Internet Servers",
BOOKTITLE="The Fourth Swedish National Computer Networking Workshop 2006",
ADDRESS="Luleå, Sweden",
DAYS=26,
MONTH=oct,
YEAR=2006,
ABSTRACT="There are many available traffic generators for
Internet servers today, but many of them are outdated, limited in
their functionality or simply cost a lot of money. Recently, there
has been an increased interest in crisis-related Internet research.
This paper presents a new traffic generator, that can be extended by
the user to generate almost any type of traffic. It can be used for
performance model validation, capacity planning and crisis research."
}

@INPROCEEDINGS{Ande0610:Qualitative,
AUTHOR="Ian Anderson and Henk Muller",
TITLE="Qualitative Positioning for Pervasive Environments",
BOOKTITLE="The Third International Conference on Mobile Computing and Ubiquitous
Networking",
ADDRESS="London, United Kingdom",
DAYS=11,
MONTH=oct,
YEAR=2006,
ABSTRACT="In this paper we present a strategy and set of algorithms for developing
qualitative positioning services that provide a qualitative location
optimised for the environment where they are to be deployed. We argue that
for many context-aware applications this may be more appropriate than more
common quantitative location systems, where the positioning API may make
unrealistic demands on the underlying measurement service, and unrealistic
promises to the application. We show how a symbolic location system can be
learnt from training data in an unsupervised manner. We present
experimental results using 802.11 and GSM signal strength levels and
wireless beacon data."
}

@INPROCEEDINGS{Ande0611:Information,
AUTHOR="John B. Anderson and Fredrik Rusek",
TITLE="On Information Rates for Faster than Nyquist Signaling",
BOOKTITLE="IEEE Globecom 2006 - Communications Theory",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="In this paper we consider the information rates of faster than Nyquist
(FTN) signaling schemes. We consider binary, quaternary and octal schemes.
The pulse shape is the root raised cosine pulse with excess bandwidth
$\alpha$. Lower and upper bounds to the information rates will be given.
The main result is that the lower bounds will often be above the
information rates for standard Nyquist signaling schemes. This implies that
FTN is indeed superiour to Nyquist signaling in some cases. The results of
a tentative coding scheme are also given; these show that high throughput
communication based on FTN is indeed practically possible."
}

@INPROCEEDINGS{Ande0611:Traffic,
AUTHOR="Jens Andersson and Christian Nyberg and Maria Kihl",
TITLE="Traffic shaping and dimensioning of an external overload controller in
service architectures",
BOOKTITLE="The 31st Annual IEEE Conference on Local Computer Networks (LCN)",
ADDRESS="Tampa, Florida, USA",
DAYS=14,
MONTH=nov,
YEAR=2006,
ABSTRACT="This paper investigates the dimensioning of a server used for external
overload control in a service architecture. In a Service Level Agreement,
restrictions on how a source can send its requests are agreed upon. We
assume that a Token bucket method is used by the source to control that
restrictions are fulfilled.
As one of the main parts of this paper it is shown that Poissonian
arrivals is a good assumption for some services in a service architectures.
The mean number of departures from a Token bucket with Poissonian arrivals
is derived.
By using Network calculus and Queuing theory, methods for dimensioning is
derived. Great savings can be obtained by an operator if the dimensioning
analysis is performed correctly. Which method that should be used for
dimensioning is dependent of how the SLA is formulated. Guidelines for when
which method for dimensioning is suitable to use are presented and examples
of calculations for the required capacity are provided."
}

@INPROCEEDINGS{Ando0605:Terror,
AUTHOR="Shigeru Ando",
TITLE="Terror in sensor network: A simulation study on Bayesian
calibration/synchronization problem and its electric circuit analogy",
BOOKTITLE="Third International Conference on Networked Sensing Systems",
ADDRESS="Chicago, Illinois, USA",
DAYS=31,
MONTH=may,
YEAR=2006,
ABSTRACT="We proposed in the INSS'04 an optimum method for successive calibration of
networked sensors using duplicated measurements among them. In INSS'05, we
considered about a structural aspect of this algorithm and showed that it
has a strict analogy with an electric circuit in which a novel branch
composed of a series of conductance (confidence of measurement) and voltage
source (measured difference) is added between the relevant nodes at each
measurement. By using it and the Thevenin's theorem, an efficient method
based on the group-based calculation was proposed. In this paper, we
further extend this approach into the current flows between nodes and
admittance/impedance matrix of the node array. This clarify the excessive
load of network and the susceptivity of the mutually connected, highly
synchronized sensor network. The sources of disturbance are externally
applied currents/voltages and internally induced contradictory conductances
and voltage sources. We show the latter ones are crucial for all networked
nodes, and are easily generated by a deceitful (terror) sensor node.
Although the situation assumed by the theory may have insufficient reality,
the results will give us good insights into the security of sensor network
against terrors or pernicias failure of sensor nodes."
}

@INPROCEEDINGS{Ando0606:Error,
AUTHOR="Daisuke Ando and Tasuku Nishihara and Takeshi Matsumoto and Masahiro Fujita
and Shunsuke Sasaki",
TITLE="Design Error Detection in {System-Level} Designs by Dependence Analysis and
Formal Checker",
BOOKTITLE="International Workshop on Logic and Synthesis 2006",
ADDRESS="Vail, Colorado, USA",
DAYS=7,
MONTH=jun,
YEAR=2006,
ABSTRACT="In this paper, we propose methods to detect common errors in SpecC design
descriptions by formal reasoning and dependence analysis on the checker.
Our target design errors are use of uninitialized variables, nil-pointer
dereferences, out-of-bound array index, race condition,
and deadlocks. For software programs, there are several program checkers
detecting these defeats, but very few tools can be applied to system-level
designs. In our methods, first of all, these design errors are checked
almost statically by the program checker analyzing
System Dependence Graphs (SDGs) and Control Flow Graphs (CFGs). However,
there are many falsenegative warnings if they are checked by the program
checker. Then, we detect the real bugs precisely and
formally by formal checkers with appropriate assertions. Since our
verification flow can be automated, we can detect these common errors
quickly and precisely."
}

@INPROCEEDINGS{Ando0610:Robust,
AUTHOR="Ryoichi Ando and Koichi Shinoda and Sadaoki Furui and Takahiro Mochizuki",
TITLE="Robust Scene Recognition using Language Models for Scene Contexts",
BOOKTITLE="ACM Multimedia Workshop On Multimedia Information Retrieval",
ADDRESS="Santa Barbara, USA",
DAYS=22,
MONTH=oct,
YEAR=2006,
ABSTRACT="We propose a robust scene recognition framework using scene context
information for multimedia contents. Multimedia contents consist of scene
sequences that are more likely to happen compared with other scene
sequences. We employ a statistical approach to deal with this scene context
information. We employ a hidden Markov model (HMM) to model each scene and
n-gram language model to represent the contexts among scenes. We evaluated
the proposed method in scene recognition experiments for 16 scenes in video
data of 25 baseball games. The proposed method significantly improved the
results compared to that without scene context information."
}

@INPROCEEDINGS{Andr0604:CDMA,
AUTHOR="Matthew Andrews and Lisa Zhang",
TITLE="A {CDMA} Data Measurement and Analysis Tool",
BOOKTITLE="The Second International Workshop On Wireless Network Measurement",
ADDRESS="Boston, MA, USA",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="We present DQoS, a tool for measuring and analyzing CDMA data services. For
a wireless connection, DQoS collects traces at its two endpoints and at
multiple layers including application, IP, TCP, PPP and physical layers. It
then synchronizes the traces and aggregates the information to produce
graphical plots that illustrate throughput, latencies, protocol (e.g. TCP)
behavior and bad events. DQoS provides a comprehensive view of the
connection performance from an end-to-end perspective. It allows us to
correlate behaviors at different network layers and troubleshoot potential
problems. We have been using DQoS internally at Lucent Technologies for
testing and performance validation. DQoS requires no instrumentation
internally within the wireless network. Therefore, we have also used DQoS
for comparing different CDMA technologies (e.g. EVDO vs UMTS) as well as
networks operated by different vendors."
}

@INPROCEEDINGS{Andr0604:Complexity,
AUTHOR="Matthew Andrews and Lisa Zhang",
TITLE="Complexity of Wavelength Assignment in Optical Network Optimization",
BOOKTITLE="IEEE INFOCOM 2006",
ADDRESS="Barcelona, SPAIN",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="We study the complexity of a spectrum of optical network design problems.
Under WDM technology, traffic demands sharing a common fiber are
transported on distinct wavelengths. Multiple fibers may be deployed on a
physical link. We have three variants in design objectives: 1) minimizing
the total amount of fibers to carry all demands; 2) minimizing the maximum
amount of fibers per link; and 3) maximizing the carried demands subject to
given fibers. We also have two variants in the design constraints: 1)
routing and wavelength assignment for every demand; 2) wavelength
assignment only with fixed demand routes. We show all variants are hard to
approximate within any constant factor. The variant of fixed routes allows
us to study wavelength assignment in isolation and thereby conclude it is
an inherently hard problem by itself. We also study wavelength assignment
in the presence of time multiplexing and wavelength conversion."
}

@INPROCEEDINGS{Andr0604:Dosimetric,
AUTHOR="Elizabeth Andrews and Wendy Liu and Greg Cook and Tony Barker and Les
Coulton and Andy Scutt",
TITLE="Dosimetric {SAR} analysis of {TEM} cell for the exposure of stem cell
monolayer",
BOOKTITLE="LAPC - Loughborough Antennas \& Propagation Conference",
ADDRESS="Burleigh Court Conference Centre, Loughborough University",
DAYS=11,
MONTH=apr,
YEAR=2006,
ABSTRACT="FDTD modelling is used to determine the optimum dish position and level of
culture medium for efficient and uniform exposure of a monolayer of
mesenchymal stem cells in a Crawford TEM cell. Preliminary biological data
are subsequently presented for an experimental configuration based on this
analysis."
}

@INPROCEEDINGS{Andr0604:Measuring,
AUTHOR="Matthew Andrews and Jin Cao and Jim McGowan",
TITLE="Measuring Human Satisfaction in Data Networks",
BOOKTITLE="IEEE INFOCOM 2006",
ADDRESS="Barcelona, SPAIN",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="There is currently no widely accepted method for converting packet-based
measurements of Quality-of-Service (QoS) into a score reflecting a user's
opinion of network performance. Such a measure is desirable for comparing
networks, making design trade-offs, or enforcing service-level agreements.
It is of particular importance in wireless networks where network resources
are limited. To build a user-centric measure of performance, it is
necessary to have a robust method for measuring user opinions of web
surfing. In this paper we present a methodology that is similar in function
to the Mean Opinion Score (MOS) in the voice domain. In our method, users
actively engage in a series of realistic internet tasks over emulated
wireless connections varying in bandwidth and propagation delay. For each
task, users rate the experience in terms of overall quality, perceived
browsing speed, and website design."
}

@INPROCEEDINGS{Andr0604:Oscillations,
AUTHOR="Matthew Andrews and Aleksandrs Slivkins",
TITLE="Oscillations with {TCP-like} Flow Control in Networks of Queues",
BOOKTITLE="IEEE INFOCOM 2006",
ADDRESS="Barcelona, SPAIN",
DAYS=23,
MONTH=apr,
YEAR=2006,
ABSTRACT="We consider a set of flows passing through a set of servers. The injection
rate into each flow is governed by a flow control that increases the
injection rate when all the servers on the flows path are empty and
decreases the injection rate when some server is congested. We show that if
each servers congestion is governed by the arriving traffic at the server
then the system can oscillate. This is in contrast to previous work on flow
control where congestion was modeled as a function of the flow injection
rates and the system was shown to converge to a steady state that maximizes
an overall network utility."
}

@INPROCEEDINGS{Andr0605:Development,
AUTHOR="Maria André and Rogério Nogueira and Antonio Teixeira and Paulo André",
TITLE="Development of integrated photonic waveguides based on organicinorganic
hybrids",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="We report the use of organic/inorganic sol-gel derived
poly(oxyethylene)/siloxane hybrid doped with methacrylic acid modified
zirconium (IV) n-propoxide for the fabrication of low cost waveguides
though direct UV laser writing. The structural and morphological analyses
of the waveguides are analysed."
}

@INPROCEEDINGS{Andr0605:Inversion,
AUTHOR="Christian Andres and Rolf Scheiber",
TITLE="Inversion of residual motion error in Airborne Single and Repeat Pass
interferometry under the presence of squint and large topography variations",
BOOKTITLE="6th European Conference on Synthetic Aperture Radar",
ADDRESS="Dresden, International Congress Center",
DAYS=16,
MONTH=may,
YEAR=2006,
ABSTRACT="The potential and necessity of the estimation and compensation of motion
errors beyond the accuracy of up-to-date navigation systems has been
demonstrated and proved in several studies during the last years. This
paper presents a improved method to invert the estimated residual phase
error to navigation errors of the airplane using an accurate model of the
airplane and scene geometry in Single and Repeat Pass SAR mode."
}

@INPROCEEDINGS{Andr0605:Satellite,
AUTHOR="Ilias Andrikopoulos and Thibault Gallet and Hanspeter Widmer and Thierry
Dubois",
TITLE="Satellite Digital Multimedia Broadcasting - Experimentation and Validation",
BOOKTITLE="Third Advanced Satellite Mobile Systems Conference",
ADDRESS="Herrsching am Ammersee (Germany)",
DAYS=29,
MONTH=may,
YEAR=2006,
ABSTRACT="The Satellite Digital Multimedia Broadcasting (SDMB) system intends to
implement a multicast layer over unicast terrestrial 3G UMTS mobile
networks. The system concept is based on a combined satellite and
terrestrial repeaters architecture for delivery of interactive
broadcast/multicast multimedia services (MBMS) to mobile end-users. The
system will aim at permitting indoor penetration by means of dedicated
large power GEO satellites providing several beams over Europe. SDMB
enhances a 3rd generation mobile environment by integrating a reliable,
flexible, scalable, efficient and cost-effective content delivery medium.
SDMB delivers content directly to the mobile terminals in the form of
download and streaming services. The SDMB architecture combines high-power
bent-pipe geo-stationary satellites and terrestrial repeaters (i.e.
Intermediate Module Repeaters - IMR) to provide a large point-to-multipoint
content delivery network (CDN). The satellite component operates in the
IMT2000 Mobile Satellite Systems (MSS) frequency band, i.e., adjacent to
the band for the terrestrial mobile. SDMB provides a unidirectional link
towards the mobile terminal and adopts the 3GPP standardised terrestrial
W-CDMA air interface enabling maximum re-use of T-UMTS technology. This
allows low cost user terminal as well as smooth integration in the 3G
cellular network architecture. The European IST integrated project MAESTRO
has one of its major objectives to validate a number of key SDMB
performances and functions by conducting laboratory and field trials with a
representative SDMB experimental platform. MAESTRO aims at specifying and
validating the most critical services, features, and functions of satellite
system architecture, achieving the highest possible degree of integration
with terrestrial infrastructures. It aims not only at assessing the
satellite systems technical and economical feasibility, but also at
highlighting their competitive assets on the way they complement
terrestrial solutions. The present paper reports on the followed validation
approach and presents the results obtained from the trials as well as from
the comparison between experimentation and simulation."
}

@INPROCEEDINGS{Andr0606:New,
AUTHOR="Iryna Andriyanova and Jean-Pierre Tillich and Jean-Claude Carlach",
TITLE="A new family of codes with high iterative decoding performances",
BOOKTITLE="ICC 2006  Communication Theory",
ADDRESS="Istanbul, Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="We investigate a new class of codes which is in a sense a hybrid between
LDPC codes and turbo-codes. Some members of this new class have been shown
to be asymptotically good and we conjecture that such a behavior holds for
all classes of codes presented here. They all display excellent iterative
decoding performances with no error floor at block error rates up to
$10^{-5}-10^{-6}$ for lengths of several thousand together with low average
decoding complexity."
}

@INPROCEEDINGS{Andr0606:Signaling,
AUTHOR="Nicola Andriolli and Luca Valcarenghi and Piero Castoldi and Jakob Buron
and Sarah Ruepp and Filippo Cugini",
TITLE="Signaling protocol extensions for converter-saving wavelength assignment in
{GMPLS} optical networks",
BOOKTITLE="2006 Workshop on High Performance Switching and Routing",
ADDRESS="Poznan, Poland, Poland",
DAYS=7,
MONTH=jun,
YEAR=2006,
ABSTRACT="GMPLS architecture specifies signaling protocol extensions, such as the
Label Set, to support dynamic connection setup in the optical domain.
However, current extensions do not carry information to minimize converter
utilization in wavelength routed optical networks. Converter waste
increases the network cost and negatively impacts the blocking probability
if the available converters are limited. With the aim of reducing
wavelength converter utilization, in this paper we propose to use standard
(Suggested Label) and novel (Suggested Vector) extensions to collect
information on the label (i.e., wavelength) preference from the nodes along
the connection path. Two advanced label preference schemes are proposed
exploiting these extensions: SL scheme supports the Label Set with the
Suggested Label, carrying one preferred wavelength; SV scheme supports the
Label Set with the Suggested Vector, indicating the preference level for
each wavelength. They are compared against two currently used schemes: NP
(No Preference) scheme uses no extension; LS scheme uses just the Label Set
to notify the acceptable wavelengths. In all schemes, network nodes adopt
either First-fit or Random tie-breaking policies to select a wavelength
from a pool with equal preference. Simulations with unlimited and limited
amount of wavelength converters show that both the Suggested Label and the
Suggested Vector extensions significantly improve network performance. SL
and SV schemes allow to decrease wavelength converter utilization compared
to NP and LS schemes. When the converter count is limited, SL and SV also
reduce blocking probability. SV with First-fit policy outperforms all the
other schemes in terms of both converter utilization and blocking, while SL
obtains very good performance without requiring any protocol modification."
}

@ARTICLE{Andr0608:Cross,
AUTHOR="Ioannis Andreopoulos and Nicholas Mastronarde and Mihaela {van der Schaar}",
TITLE="Cross-layer Optimized Video Streaming over Wireless Multi-hop Mesh Networks",
JOURNAL="IEEE Journal on Selected Areas in Communications MULTI-HOP WIRELESS MESH
NETWORKS",
DAYS=1,
MONTH=aug,
YEAR=2006,
ABSTRACT="The proliferation of wireless multi-hop communication infrastructures in
office or residential environments depends on their ability to support a
variety of emerging applications requiring real-time video transmission
between stations located across the network. We propose an integrated
cross-layer optimization algorithm aimed at maximizing the decoded video
quality of delay-constrained streaming in a multi-hop wireless mesh network
that supports quality-of-service (QoS). The key principle of our algorithm
lays in the synergistic optimization of different control parameters at
each node of the multi-hop network, across the protocol layers -
application, network, medium access control (MAC) and physical (PHY)
layers, as well as end-to-end, across the various nodes. To drive this
optimization, we assume an overlay network infrastructure, which is able to
convey information on the conditions of each link. Various scenarios that
perform the integrated optimization using different levels (horizons) of
information about the network status are examined. The differences between
several optimization scenarios in terms of decoded video quality and
required streaming complexity are quantified. Our results demonstrate the
merits and the need for cross-layer optimization in order to provide an
efficient solution for real-time video transmission using existing
protocols and infrastructures. In addition, they also provide important
insights for future protocol and system design targeted at enhanced video
streaming support across wireless mesh networks."
}

@INPROCEEDINGS{Andr0609:Lossless,
AUTHOR="Stefano Andriani and Giancarlo Calvagno and Daniele Menon",
TITLE="Lossless Compression of Bayer Mask Images Using An Optimal Vector
Prediction Technique",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper a lossless compression technique for Bayer pattern images is
presented. The common way to save these images was to colour reconstruct
them and then code the full resolution images using one of the lossless or
lossy methods. This solution is useful to show the captured images at once,
but it is not suitable for the source coding. In fact, the resulting full
colour image is three times greater than the Bayer pattern image and the
compression algorithms are not able to remove the correlations introduced
by the reconstruction algorithm. However, the Bayer pattern images present
new problems for the coding step. In fact, adjacent pixels belong to
different colour bands mixing up different kinds of correlations. In this
environment we present an optimal vector predictor, where the Bayer pattern
is divided into non-overlaped 2x2 blocks, each of them predicted as a
vector. We show that this solution is able to exploit the existing
correlation giving a good improvement of the compression ratio with respect
to other lossless compression techniques, e.g., JPEG-LS."
}

@INPROCEEDINGS{Angh0607:Full,
AUTHOR="Paul Anghel and Geert Leus and Mostafa Kaveh",
TITLE="A {Full-Diversity} Distributed {Space-Time} Coding System with Regenerative
Relays",
BOOKTITLE="The Seventh IEEE International Workshop on Signal Processing Advances in
Wireless Communications",
ADDRESS="Cannes, France",
DAYS=2,
MONTH=jul,
YEAR=2006,
ABSTRACT={We propose a distributed space-time coding (DSTC) systems based on the
Alamouti design. We discuss the limitations in the relay channel of the
{"}out of the box{"} Alamouti scheme and the additional complexity required
to overcome its loss of diversity. Using a bit error rate based antenna
selection approach, we design DSTC systems with one regenerative relay that
improve on the classical Alamouti scheme when utilized in a two-hop
channel. We prove that the proposed one relay DSTC system collects the full
diversity of the distributed MISO channel. We also introduce a less complex
DSTC system in which the relaying energies depend on the error
probabilities at the relays. Numerical results show that the proposed
systems perform close to the error probability lower bound obtained by
considering error-free reception at the relays.}
}

@INPROCEEDINGS{Angl0604:Interceptor,
AUTHOR="Cosimo Anglano",
TITLE="Interceptor: Middleware-level Application Segregation and Scheduling for
{P2P} Systems",
BOOKTITLE="Third International Workshop on Hot Topics in Peer-to-Peer Systems",
ADDRESS="Rhodes, Greece",
DAYS=29,
MONTH=apr,
YEAR=2006,
ABSTRACT="Very large size Peer-to-Peer systems are often required to implement
efficient and scalable services, but usually they can be built only by
assembling resources contributed by many independent users. Among the
guarantees that must be provided to convince these users to join the P2P
system, particularly important is the ability of ensuring that P2P
applications and services run on their nodes will not unacceptably degrade
the performance of their own applications because of an excessive resource
consumption. In this paper we present Interceptor, a middleware-level
application segregation and scheduling system that is able to strictly
enforce quantitative limitations on node resource usage and, at same time,
to make P2P applications achieve satisfactory performance even in face of
these limitations."
}

@INPROCEEDINGS{Angl0606:Stabilizing,
AUTHOR="Dana Angluin and Michael J. Fischer and Hong Jiang",
TITLE="Stabilizing Consensus in Mobile Networks",
BOOKTITLE="International Conference on Distributed Computing in Sensor Systems
(Algorithms track)",
ADDRESS="San Francisco, California",
DAYS=18,
MONTH=jun,
YEAR=2006,
ABSTRACT="Inspired by the characteristics of biologically-motivated
systems consisting of autonomous agents, we define the notion of
stabilizing consensus in fully decentralized and highly dynamic ad
hoc systems. Stabilizing consensus requires non-faulty nodes to
eventually agree on one of their inputs, but individual node does
not necessarily know when agreement is reached. First we show that
similar to the original consensus problem in the synchronous model,
there exist deterministic solutions to the stabilizing consensus
problem tolerating stopping faults. Similarly, stabilizing consensus
can also be solved deterministically in presence of Byzantine faults
with the assumption that $n > 3f$ where $n$ is the number of nodes
and $f$ is the number of faulty nodes. We also give a Byzantine
consensus protocol in a model in which the input to each node can
change during execution and eventually stabilizes. At last we
present an impossibility result of stabilizing consensus in systems
where all nodes are identical."
}

@INPROCEEDINGS{Ango0605:Wireless,
AUTHOR="Brendan {O' Flynn} and Andrew Lynch and Kevin Aherne and Philip Angove and
John Barton and S. Harte and C. {O’Mathuna} and Dermot Diamond and Fiona
Regan",
TITLE="The Tyndall Mote. Enabling Wireless Research and Practical Sensor
Application Development",
BOOKTITLE="Pervasive 2006 Short Papers-Demos-Videos",
ADDRESS="Dublin, Ireland",
DAYS=7,
MONTH=may,
YEAR=2006,
ABSTRACT="Wireless sensor networks are fast becoming a major technology
driver, with applications seen ranging from medical and environmental
monitoring to wearable sensor systems. Different application and
demonstrators
require specific hardware implementations. The 25mm modular stackable
layer
solution, developed by the AES group at the Tyndall National Institute,
has
proven to yield an easy solution for integration of sensors to a
miniaturised
communications platform enabling sensor network development and
deployment. Representative wireless applications, through research
collaborations throughout Europe and Ireland are presented here. A number
of
major applications are outlined, the development of a wearable inertial
sensor
system (WIMS) and a water monitoring application. Also outlined are some
general WSN projects enabled by Tyndalls National Access Programme (NAP)"
}

@INPROCEEDINGS{Angu0603:Enhancing,
AUTHOR="Jaume Anguera",
TITLE="Enhancing the performance of handset antennas by means of groundplane
design",
BOOKTITLE="2006 IEEE International Workshop on Antenna Technology:  Small Antennas and
Novel Metamaterials",
ADDRESS="White Plains, Nw York",
DAYS=6,
MONTH=mar,
YEAR=2006,
ABSTRACT="Mobile devices are in a constant state of evolution given the increasing
features and frequencies available worldwide. Today, global handset
functionality is becoming an important consideration influencing customer
purchasing habits. Industry dynamics have increased the drive for smaller
and multi-functional wireless devices. Antenna technology has played a key
role in influencing the end form factor of these mobile devices because
without the antenna the device is not wireless. The present paper shows a
conventional design for dual-band operation (GSM900-DCS1800) and how it can
be improved for a quad-band design (GSM850-GSM900-DCS1800-DCS1900) through
the FracPlane® technique. This technique encapsulates both basic shaping
of a groundplane to a more sophisticated space-filling and/or multilevel
design for further size reduction and multi-band performance enhancement"
}

@INPROCEEDINGS{Anju0607:Framework,
AUTHOR="Arasanathan Anjulan and Nishan Canagarajah",
TITLE="A Novel Framework for Robust Annotation and Retrieval in Video Sequences",
BOOKTITLE="Conference on Image and Video Retrieval 2006",
ADDRESS="Tempe, AZ, USA",
DAYS=13,
MONTH=jul,
YEAR=2006,
ABSTRACT="This paper describes a method for automatic video annotation and
scene retrieval based on local region descriptors. A novel framework
is proposed for combined video segmentation, content extraction and
retrieval. A similarity measure, previously proposed by the authors
based on local region features, is used for video segmentation. The
local regions are tracked throughout a shot and stable features are
extracted. The conventional key frame method is replaced with these
stable local features to characterise different shots. Compared to
previous video annotation approaches, the proposed method is highly
robust to camera and object motions and can withstand severe
illumination changes and spatial editing. We apply the proposed
framework to shot cut detection and scene retrieval applications and
demonstrate superior performance compared to existing methods.
Furthermore as segmentation and content extraction are performed
within the same step, the overall computational complexity of the
system is considerably reduced."
}

@INPROCEEDINGS{Anke0604:Wire,
AUTHOR="Tal Anker and Danny Dolev and Gregory Greenman and Ilya Shnayderman",
TITLE="{Wire-Speed} Total Order",
BOOKTITLE="20th IEEE International Parallel \& Distributed Processing Symposium",
ADDRESS="Rhodes Island, Greece",
DAYS=25,
MONTH=apr,
YEAR=2006,
ABSTRACT="Many distributed systems may be limited in their performance by the number
of transactions they are able to support per unit of time. In order to
achieve fault tolerance and to boost a system's performance, active state
machine replication is frequently used. It employs total ordering service
to keep the state of replicas synchronized. In this paper, we present an
architecture that enables a drastic increase in the number of ordered
transactions in a cluster, using off-the-shelf network equipment.
Performance supporting nearly one million ordered transactions per second
has been achieved, which substantiates our claim."
}

@INPROCEEDINGS{Anke0605:Cooperative,
AUTHOR="Tal Anker and Danny Dolev and Bracha Hod",
TITLE="Cooperative and Reliable {Packet-Forwarding} On Top of {AODV}",
BOOKTITLE="4th International Symposium on Modeling and Optimization in Mobile,Ad-hoc
and Wireless Networks",
DAYS=24,
MONTH=may,
YEAR=2006,
ABSTRACT="Cooperative and reliable packet forwarding presents a formidable challenge
in mobile ad hoc networks (MANET), due to special network characteristics;
e.g., mobility, dynamic topology and absence of centralized management.
Lack of cooperation, due to misbehavior caused by selfishness or malice,
may severely degrade the performance of the network. This paper highlights
various aspects of cooperation enforcement and reliability, when Ad hoc
On-Demand Distance Vector (AODV) is the underlying protocol. Furthermore,
it presents a scalable protocol that combines a reputation system with AODV
that addresses reputation fading, second-chance and robustness against
liars."
}

@INPROCEEDINGS{AnKy0604:Design,
AUTHOR="Hwang AnKyu and Whoijin Jung and ByungChul Kim and JaeYong Lee",
TITLE="Design of Polling-based Congestion Control Algorithm for {TCP} Performance
Enhancement in Wireless ad-hoc Networks",
BOOKTITLE="The 16th Joint Conference on Communication \& Information, 2006",
ADDRESS="Paradise Hotel, Busan, Korea",
DAYS=26,
MONTH=apr,
YEAR=2006,
ABSTRACT="In ad-hoc networks, the discrepancy between a station's transmission and
interference range produces hidden terminal problem and exposed terminal
which can decrease TCP performance. Also, contention of data packet and ACK
packet makes a increasing jitter of ACK packet because ACK packet smaller
then data packet. Packet pacing can solve exposed terminal problem between
data packets but can not solve TCP performance decreased by exposed
terminal between data packet and ACK packet. In this paper, we proposed new
polling-based congestion algorithm that transmit ACK after receive
specified data to solve exposed terminal problem and collision which caused
between data and ACK. Sender informs last data packet using a TCP header
and receiver transmit ACK after this packet. We demonstrate TCP performance
enhancement compare with existing algorithm by simulation."
}

@INPROCEEDINGS{Anla0606:Network,
AUTHOR="Matthias Anlauff and Asuman Suenbuel",
TITLE="Network Security in Enterprise Services Architectures",
BOOKTITLE="ICC 2006  Network Security and Information Assurance",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Enterprise Service Architectures are emerging as a promising way to compose
Web-Services as defined by the W3C consortium, to form complex, enterprise
level services. However, due to the fact that each Web-Service composition
is also a protocol composition, this composition gets problematic, if
security protocol mechanisms are used for the individual Web-Services,
because security properties are not preserved under composition. This paper
outlines an approach that on the one hand mimics the general engineering
practice when combining security features, but on the other hand avoids the
problems that can arise during the composition of Web-Services by using
well-founded mathematical concepts. The Protocol Derivation Assistant, a
tool that supports this approach, is also introduced in this paper."
}

@INPROCEEDINGS{Anna0611:Analytical,
AUTHOR="Kiran Anna and Mostafa Bassiouni",
TITLE="Analytical Modeling and {QoS} Application of the {P-Persistent} {802.11}
{MAC} Protocol",
BOOKTITLE="IEEE Globecom 2006 - Wireless Ad Hoc and Sensor Networks - towards Anytime
Anywhere Internetworking",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="In this paper, we present analytical models for the average service time,
end-to-end delay and system capacity for the p-persistent 802.11 MAC
protocol. Models for both the ?no retry limit? and ?finite retry limit?
cases are presented. The analytical models are validated by extensive
simulation results. The application of the p-persistent 802.11 MAC protocol
in providing throughput differentiation is discussed."
}

@INPROCEEDINGS{Anon0605:Adhocsys,
TITLE="Adhocsys",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper, but we need at least 10 words for an abstract"
}

@INPROCEEDINGS{Anon0605:Aveiro,
TITLE="Aveiro Digital",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper, but we need at least 10 words for an abstract

PT Inovação"
}

@INPROCEEDINGS{Anon0605:Capanina,
TITLE="Capanina",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper, but we need at least 10 words for an abstract

University of York"
}

@INPROCEEDINGS{Anon0605:Codmuca,
TITLE="Codmuca",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper, but we need at least 10 words for an abstract"
}

@INPROCEEDINGS{Anon0605:European,
TITLE="European Commision",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper, but we need at least 10 words for an abstract

EC-DG INFSO G5"
}

@INPROCEEDINGS{Anon0605:Ftth,
TITLE="Ftth Council",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper, but we need at least 10 words for an abstract"
}

@INPROCEEDINGS{Anon0605:Gandalf,
TITLE="Gandalf",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper, but we need at least 10 words for an abstract"
}

@INPROCEEDINGS{Anon0605:Oban,
TITLE="Oban",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper, but we need at least 10 words for an abstract"
}

@INPROCEEDINGS{Anon0605:Widens,
TITLE="Widens",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper, but we need at least 10 words for an abstract
University of Oulo"
}

@INPROCEEDINGS{Anou0610:Optimal,
AUTHOR="Hicham Anouar and Christian Bonnet",
TITLE="Optimal {Constant-Window} Backoff Scheme for {IEEE} {802.11} {DCF} in
finite Load {Single-Hop} Wireless Networks",
BOOKTITLE="9th ACM-IEEE International Symposium on Modeling, Analysis and Simulation
of Wireless and Mobile Systems (MSWiM 2006)",
ADDRESS="Torremolinos, Malaga, Spain",
DAYS=2,
MONTH=oct,
YEAR=2006,
ABSTRACT="Existing backoff optimization schemes of IEEE 802.11 DCF MAC
protocol consider only saturated network or asymptotic conditions.
In real situations, traffic is bursty or \\streamed at low rates so
that stations do not operate usually in saturated regime. In this
work, we propose and analyze a backoff  enhancement for IEEE802.11
DCF that is quasi-optimal under all traffic loads. First, we give a new
analysis
of DCF scheme under finite load conditions in single hop configuration and
we provide an accurate
delay statistics model that consider the self-loop probability in
every backoff state. Then we introduce the constant-window backoff scheme
and we
compare its performance to IEEE802.11 DCF with Binary exponential
backoff. The quasi-optimality of the proposed scheme is proved and
numerical results show that it increases, both the throughput and
fairness, of IEEE 802.11 DCF while remaining insensitive to traffic
intensity. The analysis is then extended to consider the finite
queueing capacity at nodes buffers using results from the delay
analysis. NS2 simulations validate the obtained results."
}

@INPROCEEDINGS{Anre0604:Capacity,
AUTHOR="Vikram Anreddy and Mary Ingram",
TITLE="Capacity of Measured Ricean and Rayleigh Indoor {MIMO} Channels at {2.4}
{GHz} with Polarization and Spatial Diversity",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2006 - Phy/MAC",
ADDRESS="Las Vegas, NV",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="In this paper, we analyze the impact of the polarization diversity on the
capacity of multiple-input multiple-output (MIMO) channels in indoor
environments. A channel measurement campaign was conducted at 2.4 GHz to
measure the co-polarized and cross-polarized subchannels under
line-of-sight (LOS) and non-line-of-sight (NLOS) channel conditions. We
analyze the measured data in terms of Ricean K-factor, cross-polar
discrimination (XPD) and subchannel correlation. A major contribution of
this paper is that in these measured channels, we observe a coincidence of
low K factors and high XPD. This leads to a diversity deficit for MIMO
systems employing polarization diversity, when compared to spatial
configurations. On the other hand, our results indicate that polarization
diversity can substantially lower the subchannel correlations for compact
configurations, even in a LOS scenario. We draw a fair comparison in terms
of capacity, between spatial MIMO configurations and systems using
polarization diversity. We analyze the performance of 2 × 2 and 4 ×
4 MIMO systems for a range of inter-element spacings. Our results indicate
that for scenarios with low K-factors and high XPD, spatial configurations
should be preferred over hybrid or dual-polarized configurations,
especially when space is not a constraint."
}

@INPROCEEDINGS{Anre0611:Antenna,
AUTHOR="Vikram Anreddy and Mary Ingram",
TITLE="Antenna Selection for Compact {Dual-Polarized} {MIMO} Systems with Linear
Receivers",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="Antenna selection combined with dual-polarized antennas offers an
attractive alternative for realizing higher order multiple-input
multiple-output (MIMO) configurations in compact, low-complexity devices.
In this paper we analyze the performance of antenna selection for
narrowband dual-polarized MIMO channels with linear minimum mean square
error (MMSE) receiver processing. We analytically study the impact of
cross-polar discrimination on the achieved selection gain for
dual-polarized MIMO channels. We use channel measurement data collected at
2.4 GHz in a typical office environment to compare the performance of
spatial and dual-polarized MIMO with respect to antenna selection.  Our
bit-error-rate (BER) results indicate that antenna selection with
dual-polarized antennas can achieve significant performance gains for
compact configurations with only a nominal increase in complexity."
}

@INPROCEEDINGS{Ansa0606:Implementation,
AUTHOR="Junaid Ansari and Janne {Riihijärvi} and Petri {Mähönen} and Jussi
Haapola",
TITLE="Implementation and Performance Evaluation of {nanoMAC:} A {Low-Power} {MAC}
Solution for High Density Wireless Sensor Networks",
BOOKTITLE="ICC 2006  Wireless Ad Hoc and Sensor Networks",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="This paper describes the implementation architecture and performance
analysis of nanoMAC, a CSMA/CA based medium access control protocol, which
is specifically designed for high density wireless sensor networks. We
empirically show that nanoMAC performs with high reliability in a variety
of network traffic conditions in single and multihop scenarios. For energy
efficient operation and minimizing idle-overhearing, nanoMAC uses a
specialized sleep algorithm. The nodes may operate in one of the different
sleep groups depending on the application requirements. This paper also
makes a comparative study of nanoMAC with B-MAC in terms of performance
measures."
}

@INPROCEEDINGS{Ansa0606:ROSE,
AUTHOR="Nirwan Ansari and Gang Cheng and Nan Wang",
TITLE="{ROSE} {II} for Updating Additive Link State Information",
BOOKTITLE="ICC 2006 Communications QoS, Reliability and Performance Modeling",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Many works have been reported to address the issue of updating link state
information in order to effectively facilitate Quality-of-Service (QoS)
routing. However, most of them, if not all, only consider concave metrics,
e.g., bandwidth. In this paper, we first observe that due to the inherently
different nature of additive and concave QoS metrics, directly applying
existing link state update policies cannot provide satisfactory
performance. As such, it is essential to consider the additive metrics of
link state update for the purpose of reducing the protocol overhead and
improving the accuracy of link state information. By applying the central
limit theorem, the additive QoS constraint imposed on each link can be
modeled as a normal random variable. Then, based on our previous proposal,
ROSE, we present a high performance link state update policy, ROSE II. Via
theoretical analysis and extensive simulations, we show that ROSE II
greatly outperforms the state of the arts in terms of protocol overhead and
the accuracy of the link state information for additive metrics."
}

@INPROCEEDINGS{ANTA0603:Integrated,
AUTHOR="Yahia Antar",
TITLE="Integrated Antennas for {Wireless,Mobile} and Satellite Communications",
BOOKTITLE="Wireless Euro-Mediterranean International Conference",
ADDRESS="Amman, Jordan",
DAYS=27,
MONTH=mar,
YEAR=2006,
ABSTRACT="Abstract: Rapid growth in telecommunications and information technology
requires increasing volume of data transmission and at a faster rate.
Wireless and satellite communications are two key technologies that can
assist in this growth and provide rapid and cost- effective solutions.
Associated with all of these applications are new challenges towards
advancing microwave and millimeter wave technology, developing new
innovative broadband and smart antennas that can be integrated with also
new millimeter wave circuitry and other technologies and new materials with
improved performance needed for future systems. The tutorial will review
basic system requirements and address state-of-the-art microwave and
millimeter antennas and associated circuits for wireless and broadband
satellite applications. New and emerging research areas in integrated
active antennas and wider band components will be addressed, with emphasis
given to innovative concepts in research and engineering of new materials
and analysis techniques to facilitate cost-effective development and
implementation of efficient antennas and phased arrays. Some of the topics
to be addressed include uniplanar passive and active printed antennas,ultra
wideband (UWB), quasi optical antennas, power combining techniques, new
materials and dielectrics use for efficient implementation, and innovative
microelectronics incorporating micromachining and microfabrication. The
last part of the tutorial will address how educators in RF and
communications areas are challenged to reformat educational and
continuing-education programs to meet the changing needs. Target Audience:
Researchers,Educators,Communications Engineers. antar-y(at)rmc.ca, Canada
Research Chair in Electromagnetic Engineering. Royal Military College of
Canada Yahia M.M. Antar (S'73-M'76-SM'85-F00) was born on November 18, 1946
in Meit Temmama, Egypt. He received the B.Sc. (Hons.) degree in 1966 from
Alexandria University, Egypt, and the M.Sc. and Ph.D. degrees from the
University of Manitoba, Winnipeg, Canada, in 1971 and 1975, respectively,
all in electrical engineering. In 1966, he joined the Faculty of
Engineering at Alexandria, where he was involved in teaching and research.
At the University of Manitoba he held a University Fellowship, an NRC
Postgraduate and postdoctoral Fellowships. In 1976-1977 he was with the
Faculty of Engineering at the University of Regina. In June 1977, he was
awarded a Visiting Fellowship from the Government of Canada to work at the
Communications Research Centre of the Department of Communications,
Shirley's Bay, Ottawa, where he was involved in research and development of
satellite technology with the Space Electronics group. In May 1979, he
joined the Division of Electrical Engineering, National Research Council of
Canada, Ottawa, where he worked on polarization radar applications in
remote sensing of precipitation, radio wave propagation, electromagnetic
scattering and radar cross section investigations. In November 1987, he
joined the staff of the Department of Electrical and Computer Engineering
at the Royal Military College of Canada in Kingston, where he has held the
position of professor since 1990. His current research interests include
polarization and radar studies, integrated antennas, microwave and
millimeter wave circuits. He has authored or co-authored over 120 journal
papers on these topics, holds several patents, chaired conferences and
sessions in many conferences, and supervised or co-supervised over 50 Ph.D.
and M.Sc. theses at the Royal Military College and Queens University, of
which three have received the Governor General Gold Medal. He is presently
the Chairman of the Canadian National Commission for Radio Science (CNC,
URSI), holds adjunct appointment at the University of Manitoba, and, has a
cross appointment at Queen's University in Kingston. Dr. Antar is a Fellow
of the IEEE, a Fellow of the Engineering Institute of Canada (FEIC), an
Associate Editor (Features) of the IEEE Antennas and Propagation Magazine,
Associate Editor of the IEEE Transactions on Antennas and Propagation and a
member of the Editorial Board of the RFMiCAE Journal. He received the 2003
Royal Military College of Canada Excellence in Research Prize. In May 2002,
he became the holder of a Canada Research Chair (CRC) in Electromagnetic
Engineering."
}

@INPROCEEDINGS{ANTO0601:Mlab,
AUTHOR="Emmanouil Antonakakis",
TITLE="mLab: An Ad Hoc Network Testbed",
BOOKTITLE="CCNC2006 Demonstration proposals",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="The testing of ad hoc networking protocols in a laboratory environment
allows researchers the opportunity to validate theories in practice, to
test simulation assumptions, and to discover practical problems facing ad
hoc network users and developers alike. Testing ad hoc network
implementations in a laboratory environment, however, also presents a
number of challenges. The most obvious challenge is being able to test the
effects of node mobility on the ad hoc routing protocols and ad hoc
applications. NISTs prototype mLab testbed allows users to automatically
generate arbitrary logical network topologies in order to perform real-time
performance measurements of routing protocol implementations. By changing
the logical topology of the network, mLab users can conduct tests on an ad
hoc network without having to physically move the nodes in the ad hoc
network."
}

@INPROCEEDINGS{Anto0603:Antenna,
AUTHOR="Marco Antoniades and George Eleftheriades",
TITLE="Antenna Applications of {Negative-Refractive-Index} {Transmission-Line}
Metamaterials",
BOOKTITLE="2006 IEEE International Workshop on Antenna Technology:  Small Antennas and
Novel Metamaterials",
ADDRESS="White Plains, Nw York",
DAYS=6,
MONTH=mar,
YEAR=2006,
ABSTRACT="Metamaterials that exhibit a simultaneously negative electric permittivity
\ε and magnetic permeability \μ, and thus a negative refractive
index (NRI), have recently attracted considerable attention in the
microwave community. This has been motivated by the potential to create new
microwave devices that exhibit superior qualities compared to their
conventional counterparts. A useful method of implementing planar
metamaterials (MM) is based on reactively loaded transmission lines (TL).
Transmission line NRI media consist of a network of printed transmission
lines periodically loaded with lumped-element series capacitors and shunt
inductors in a dual-TL (high-pass) configuration. The planar nature of the
TL-based metamaterial structures renders them well suited for the
realization of planar microwave antennas and circuits. This work presents
some NRI-TL based metamaterial devices and antennas recently developed at
the University of Toronto. Specifically, the principles of 1-D
phase-shifting lines are presented, followed by a MM Wilkinson balun, a MM
series power divider and a fully printed miniature MM ring antenna."
}

@INPROCEEDINGS{Anto0605:RF,
AUTHOR="Mirko Antonini and Silvello Betti and Valeria Carrozzo and Ernestina Cianca
and Elisa Duca and Marco Lucente and Marina Ruggieri and Tommaso Rossi",
TITLE="{RF-optical} architecture for {GEOSS} based on the use of {HAPs}",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Invited paper from Tommaso Rossi, Marina Rugieri, form Univ. Roma Tor
Vergata"
}

@INPROCEEDINGS{Anto0605:Routing,
AUTHOR="David Antos and Vojtech Rehak",
TITLE="Routing and Level 2 Addressing in a Hardware Accelerator for Network
Applications",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Personal computers are known to be highly usable as internet routers. To
overcome their throughput limitations, a hardware accelerator can be
employed. For the purposes of packet classification in the accelerator, we
investigate a way to combine routing, level 2 addressing, and packet
filtering into a single lookup structure. This paper describes the first
part of the process: a method to combine routing and level 2 addressing to
a single lookup. A formal model of routing and level 2 addressing is
presented and used to prove correctness of the method and its equivalence
to operating system behaviour."
}

@INPROCEEDINGS{Anto0606:Modeling,
AUTHOR="Galina Antonova",
TITLE="Modeling technique and a simulation tool for analysis of clock
synchronization in communication networks",
BOOKTITLE="11th International Workshop on Computer-Aided Modeling, Analysis and Design
of Communication Links and Networks",
ADDRESS="Trento, Italy",
DAYS=8,
MONTH=jun,
YEAR=2006,
ABSTRACT="Clock synchronization and timing continue to be an active area of research
and development. This paper describes a modeling technique and a simulation
tool for analysis of clock synchronization in communication networks. The
tool supports analysis of stability, quality of control, time to converge,
calculations of standard Maximum Time Interval Error (MTIE) and Time
Deviation (TDEV) parameters, etc. Initially developed for clock
synchronization in communication networks, the tool can be enhanced to
address synchronization needs of other applications as well."
}

@INPROCEEDINGS{Anto0609:Experimental,
AUTHOR="Fabio Antonacci and Diego Saiu and Paolo Russo and Augusto Sarti and Marco
Tagliasacchi and Stefano Tubaro",
TITLE="Experimental evaluation of a localization algorithm for multiple acoustic
sources in reverberating environments",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="The problem of blind separation of multiple acoustic sources has been
recently addressed by the TRINICON framework. By exploiting higher order
statistics, it allows to successfully separate acoustic sources when
propagation takes place in a reverberating environment. In this paper we
apply TRINICON to the problem of source localization, emphasizing the fact
that it is possible to achieve small localization errors also when source
separation is not perfectly obtained. Extensive simulations have been
carried out in order to highlight the trade-offs between complexity and
localization error at different levels of reverberation."
}

@INPROCEEDINGS{Anto0609:Tracking,
AUTHOR="Fabio Antonacci and Davide Riva and Diego Saiu and Augusto Sarti and Marco
Tagliasacchi and Stefano Tubaro",
TITLE="Tracking Multiple Acoustic Sources using Particle Filtering",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper we deal with the problem of localizing and tracking multiple
acoustic sources by means of microphones pairs. We assume that the
propagation takes place in a reverberating environment such as an office
room. The problem is tackled by combining two well known techniques. First,
for each pair of microphones, source de-mixing is carried out using the
TRINICON algorithm. TRINICON exploits the fact that the original sources
are statistically independent in order to estimate appropriate de-mixing
filters. The impulse responses of such filters exhibit peaks related to the
TDOA (Time Difference of Arrival) of each microphones pair. In the second
step, such observations are combined using a particle filter with a dynamic
model representing the positions and the velocities of the sources.
Simulations demonstrate that the proposed system enables to accurately
tracking moving acoustic sources in reverberating environments (±10cm in
a 5m×5m room with T60 < 0.450s)."
}

@INPROCEEDINGS{Anto0612:Exploring,
AUTHOR="Joseph Antony and Pete Janes and Alistair Rendell",
TITLE="Exploring Thread and Memory Placement on {NUMA} Architectures: Solaris and
Linux, {UltraSPARC/FirePlane} and {Opteron/HyperTransport}",
BOOKTITLE="13th Annual IEEE International Conference on High Performance Computing",
ADDRESS="Bangalore, India",
DAYS=18,
MONTH=dec,
YEAR=2006,
ABSTRACT="Modern shared memory multiprocessor systems commonly have
non-uniform memory access (NUMA) with asymmetric memory
bandwidth and latency characteristics. To accommodate for these, operating

systems, such as Solaris and Linux, have been extended to be
``NUMA-aware'' 
and to provide application programmer interfaces that
allow the user to perform specific thread and memory placement. To
date, however, there have been relatively few detailed assessments 
of the importance of memory/thread placement for complex
applications. 

This paper outlines a framework for performing memory and
thread placement experiments using two different operating systems
(Solaris and Linux). How to bind a thread, allocate memory at a
specific location, and how to verify that a thread is running and
memory is allocated at the requested location is discussed and
contrasted between Solaris and Linux. 

Using specific memory and thread placement the performance
characteristics of serial versions of 
lmbench, Stream and various BLAS libraries 
(ATLAS, GOTO, ACML on Opteron/Linux and
Sunperf on Opteron, UltraSPARC/Solaris) are
measured on two different hardware platforms (UltraSPARC/FirePlane 
and Opteron/HyperTransport). A simple model
describing performance as a function of memory distribution is 
proposed and assessed for both the Opteron and UltraSPARC."
}

@TECHREPORT{Antu0601:Integration,
AUTHOR="Nelson Antunes and Christine Fricker and Fabrice Guillemin",
TITLE="Integration of streaming services and {TCP} data transmission in the
Internet",
TYPE="arXiv report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0601016",
MONTH=jan,
YEAR=2006,
ABSTRACT="We study in this paper the integration of elastic and streaming traffic on
a
same link in an IP network. We are specifically interested in the
computation
of the mean bit rate obtained by a data transfer. For this purpose, we
consider
that the bit rate offered by streaming traffic is low, of the order of
magnitude of a small parameter \eps \ll 1 and related to an auxiliary
stationary Markovian process (X(t)). Under the assumption that data
transfers
are exponentially distributed, arrive according to a Poisson process, and
share
the available bandwidth according to the ideal processor sharing
discipline, we
derive the mean bit rate of a data transfer as a power series expansion in
\eps. Since the system can be described by means of an M/M/1 queue with a
time-varying server rate, which depends upon the parameter \eps and
process
(X(t)), the key issue is to compute an expansion of the area swept under
the
occupation process of this queue in a busy period. We obtain closed
formulas
for the power series expansion in \eps of the mean bit rate, which allow
us to
verify the validity of the so-called reduced service rate at the first
order.
The second order term yields more insight into the negative impact of the
variability of streaming flows.",
URL="http://arXiv.org/abs/cs/0601016"
}

@TECHREPORT{Antu0601:Perturbation,
AUTHOR="Nelson Antunes and Christine Fricker and Fabrice Guillemin",
TITLE="Perturbation Analysis of a Variable {M/M/1} Queue: A Probabilistic Approach",
TYPE="arXiv report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0601015",
MONTH=jan,
YEAR=2006,
ABSTRACT="Motivated by the problem of the coexistence on transmission links of
telecommunication networks of elastic and unresponsive traffic, we study
in
this paper the impact on the busy period of an M/M/1 queue of a small
perturbation in the server rate. The perturbation depends upon an
independent
stationary process (X(t)) and is quantified by means of a parameter \eps
\ll 1.
We specifically compute the two first terms of the power series expansion
in
\eps of the mean value of the busy period duration. This allows us to
study the
validity of the Reduced Service Rate (RSR) approximation, which consists
in
comparing the perturbed M/M/1 queue with the M/M/1 queue where the service
rate
is constant and equal to the mean value of the perturbation. For the first
term
of the expansion, the two systems are equivalent. For the second term, the
situation is more complex and it is shown that the correlations of the
environment process (X(t)) play a key role.",
URL="http://arXiv.org/abs/cs/0601015"
}

@INPROCEEDINGS{Antu0604:Sojourn,
AUTHOR="Nelson Antunes and Cláudia Nunes and António Pacheco",
TITLE="Sojourn time of elastic flows under perturbation of unresponsive traffic",
BOOKTITLE="2nd EuroNGI Conference on Next Generation Internet Design and Engineering",
DAYS=3,
MONTH=apr,
YEAR=2006,
ABSTRACT="Motivated by the need to develop simple  models to obtain
qualitative results for evaluating the impact of unresponsive
traffic on elastic flows, we consider that transmission capacity
is offered to elastic flows in a processor sharing fashion as
function of the unresponsive traffic and  quantified by means of a
perturbation parameter $\eps$. For such a  system, we analyze the
impact of the perturbation on the mean sojourn time of an elastic
flow, which represents a useful measure for the transfer delay of
digital documents.

Specifically, we derive the first two terms of the power series
expansion in $\eps$ of the mean sojourn time. The
first order term is consistent with reduced service rate (RSR)
approximation, which corresponds to the service rate for elastic
flows being constant and equal to the mean value of the perturbed
service rate. The complexity of the expansion increases for the
second order term and correlations created by the unresponsive
traffic appear. Qualitative results show that variability  on the
service rate degrades the performance of elastic flows."
}

@INPROCEEDINGS{Antu0609:Metastability,
AUTHOR="Nelson Antunes and Christine Fricker and Philippe Robert and Danielle Tibi",
TITLE="Metastability of {CDMA} cellular systems",
BOOKTITLE="12th Annual International Conference on Mobile Computing and Networking",
ADDRESS="Los Angeles, CA",
DAYS=23,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this  paper, it is shown  that the coexistence of a variety of 
different traffics in third generation cellular networks may lead to a 
very undesirable behavior of the whole network: a metastability property.
When this property holds, the state of the network fluctuates on a very
long time scale between different set of states. These long oscillations of
the network make impossible to predict the average performances of some of
the key characteristics of the connections, such as the handoff blocking
rate or the probability of call blocking. As a consequence, the quality of
service provided by such a network can be estimated only through, sometimes
poor, lower bounds. The situation is reminiscent of complex phenomena
occurring in statistical physics. Experiments as well as a simplified
mathematical model are presented and the practical implications in the
design of radio resource management for CDMA cellular networks are
discussed."
}

@INPROCEEDINGS{ANWA0601:Novel,
AUTHOR="Khoirul Anwar and Masato Saito and Takao Hara and Minoru Okada and Heiicni
Yamamo",
TITLE="A Novel Fast Computation without Divisions for {MMSE} Equalizer and
Combiner",
BOOKTITLE="3rd IEEE-GCC 2006",
ADDRESS="Manama, Bahrain",
DAYS=20,
MONTH=mar,
YEAR=2006,
ABSTRACT="In this paper, we propose a novel fast and low complexity algorithm of
computation for minimum-mean-square-error (MMSE) equalizer or combiner
without divisions. Multiplicative effect of fading channel should be
compensated by divisions at the receiver. Therefore, equalizer or combiner
at the receiver is derived by inverting the channel impulse responses.
Here, the number of divisions equals to the number of subcarriers. For the
next generation with high bit rate applications, these divisions are
necessary to be computed in a very short time and may impact to the
increasing of hardware complexities. The main contribution of this paper is
a proposed fast algorithm by replacing the large number of divisions with
multiplications and subtraction due to its lower complexity. We improve the
performance of Newton-Raphson Method by a range extension so that the
Newton-Raphson Method is applicable for MMSE computation with small number
of iterations. Our results in Carrier Interferometry Orthogonal Division
Multiplexing (CI/OFDM) confirm that with only two iterations, performance
of the proposed algorithm can achieve the similar performance as the normal
computation with divisions."
}

@INPROCEEDINGS{Anwa0604:Multiple,
AUTHOR="Zahid Anwar and William Yurcik and Ralph Johnson and Munawar Hafiz and Roy
Campbell",
TITLE="Multiple Design Patterns for Voice over {IP} {(VoIP)} Security",
BOOKTITLE="Workshop on Information Assurance (WIA 2006)",
ADDRESS="Phoenix, Arizona",
DAYS=10,
MONTH=apr,
YEAR=2006,
ABSTRACT="Design patterns capture software solutions to specific problems that have
evolved over time and reflect many iterations of work. Documenting such
patterns promotes proven design and software reuse. There has been a
growing amount of work documenting design patterns for security, however,
little work specific to VoIP security. In 2005 NIST released a report on
recommendations and best practices for securing VoIP, however it lacks the
structure, terminology, and ease-of-understanding needed for both technical
and non-technical audiences that is an inherent feature of design patterns.
In this paper we document three design patterns for VoIP implementations
related to specific security problems: (1) secure traversal of firewalls
and NATs; (2) detecting and mitigating DDoS attacks; and (3) securing
against eavesdropping. With many VoIP vendors rushing products to market
with overlapping functionality and requirements for interoperability,
documenting design patterns is poised to become an important part of secure
programming processes for VoIP."
}

@INPROCEEDINGS{ANWA0606:New,
AUTHOR="Khoirul Anwar and Takao Hara and Masato Saito and Minoru Okada and Heiichi
Yamamoto",
TITLE="A New Spreading Code for {OFDM} and {MC-CDMA} Systems",
BOOKTITLE="11th IEEE Symposium on Computers and Communications",
ADDRESS="Pula-Cagliari, Sardinia, Italy",
DAYS=26,
MONTH=jun,
YEAR=2006,
ABSTRACT="Recently, there is an interest to increase the capacity of multicarrier
code division multiplexing (MC-CDMA) and orthogonal frequency division
multiplexing (OFDM) by using spreading codes. However in conventional
technique, the additional users should be paid by complexity increasing
e.g. iterative detection at the receiver because the cross correlation of
the spreading is not low. Some spreading codes only can support up to K =
N+M, where M < N. In this paper, we propose a new spreading code with low
cross correlation, high autocorrelation and capable of supporting K = 2N+1
data symbols or users. The proposed code is a complex spreading codes with
length of N and number of code of 2N+1. It means that 2N+1 users or data
symbols are able to be transmitted or assigned over only N subcarriers. The
results show that our proposed code outperforms Pseudo-orthogonal Carrier
Interferometry (POCI) code with gain of 3dB at bit-error-rate (BER) level
of 10-4 in additive white Gaussian noise (AWGN) channel and gain of more
than 4dB in multipath fading channel. By the proposed code, peak-to-average
power ratio (PAPR) problem as a typical problem in multicarrier system is
also able to be reduced up the PAPR level of single carrier."
}

@INPROCEEDINGS{ANWA0607:New,
AUTHOR="Khoirul Anwar and Minoru Okada and Takao Hara and Masato Saito and Heiichi
Yamamoto",
TITLE="Large Code Set for {PAPR} Reduction and Capacity Increasing in {OFDM} and
{MC-CDMA} System",
BOOKTITLE="IWCMC 2006 Communication and Information Theory",
ADDRESS="Vancouver, Canada",
DAYS=3,
MONTH=jul,
YEAR=2006,
ABSTRACT="Recently, an interest to increase the capacity of multicarrier system such
as orthogonal frequency division multiplexing (OFDM) and multi-carrier code
division multiple access (MC-CDMA) is attracting many studies to develop
spreading code for obtaining higher capacity. This paper proposes a new
complex spreading code that is capable of increasing the capacity more than
twice, offering better performance due to its uniform low cross
correlations and high autocorrelation properties and reducing peak power of
the transmit signal. By the proposed code, peak-to-average power ratio
(PAPR) of OFDM system can be reduced up to the PAPR level of single carrier
system. Our proposed code with code length of N, is capable of supporting K
= 2N+1 users, while the conventional spreading codes only can support up to
K = N+M, where M N. The capacity of 2N+1 means that 2N+1 users or data
symbols are able to be transmitted or assigned over only N subcarriers. Our
results confirms that the proposed code outperforms current
pseudo-orthogonal carrier interferometry (POCI) code with gain of 3dB at
bit-error-rate (BER) level of 10-5 in additive white Gaussian noise (AWGN)
channel and gain of more than 4dB in multipath fading channel."
}

@INPROCEEDINGS{Aoul0605:Towards,
AUTHOR="Zakia Imane {Kazi Aoul} and Isabelle Demeure and Jean-Claude Moissinac",
TITLE="Towards a Peer-to-peer Architecture for the provision of Adaptable
Multimedia Composed Documents",
BOOKTITLE="Second International Conference on Distributed Frameworks for Multimedia
applications",
DAYS=14,
MONTH=may,
YEAR=2006,
ABSTRACT="This article proposes an architecture that delivers adapted multimedia
documents to participants of a P2P system. Both the multimedia documents
and the adaptation resources are made available in the P2P system. The
adaptation architecture looks for adaptation resources, composes them in
order to support complex adaptation operations and to perform the
adaptations. The system also faces the difficulty that, in a P2P
environment, a peer is likely to disconnect. It thus takes into account the
dynamic changes in both users and adaptors environments. A complete
adaptation chain is implemented using the web services technology, the
MPEG-21 multimedia standard and the SMIL multimedia language. A first
evaluation of the approach is presented; it shows that there is no
significant overhead with respect to other adaptation architectures. This
is encouraging given that the approach enables parallel execution of
adaptation functions and load balancing which could lead to gains in
performance."
}

@INPROCEEDINGS{Aoun0606:Closer,
AUTHOR="Bassam Aoun and Youssef Iraqi and Raouf Boutaba",
TITLE="A Closer Look at the Capacity of Wireless Mesh Networks",
BOOKTITLE="Mediterranean Ad Hoc Networking Workshop 2006",
ADDRESS="Lipari, Italy",
DAYS=14,
MONTH=jun,
YEAR=2006,
ABSTRACT="In this paper, we define a fairness reference model and study the fair
capacity of Wireless Mesh Networks (WMN) operating over 802.11 MAC
protocol. First, we show the limitations of 802.11 MAC over multihop
wireless networks. We argue that unfairness can be mitigated using adaptive
data rates; however, the hidden node problem remains unresolved, causing
collisions and reducing throughput. Then we study the properties of the
wireless channel and identify spatial reuse. We show that the effective
load on a collision domain (i.e. interference set) is less than or equal to
the sum of the traffic on its links. The fair throughput of any given flow
is then derived from the bottleneck collision domain along its path to the
gateway. We finally validate our results over baseline scenarios then study
a more general topology."
}

@ARTICLE{Aoun0608:Gateway,
AUTHOR="Bassam Aoun and Raouf Boutaba and Youssef Iraqi",
TITLE="Gateway Placement Optimization in {WMN} with {QoS} Constraints",
JOURNAL="IEEE Journal on Selected Areas in Communications MULTI-HOP WIRELESS MESH
NETWORKS",
DAYS=1,
MONTH=aug,
YEAR=2006,
ABSTRACT="In a Wireless Mesh Networks (WMN), the traffic is aggregated and forwarded
towards the gateways. Wireless Access Points (AP) cooperatively forward
each other packets which compete with the packets generated by the APs
themselves. As the expected path length increases, the bandwidth available
for each AP to originate packets decreases. From that perspective, the more
gateways are available the better. However, for deployment cost
considerations, the number of gateways should be kept to minimum.
Therefore, strategically placing and connecting the gateways to the wired
backbone is critical to the management and efficient operation of a WMN. In
this paper, we address the problem of gateway placement subject to Quality
of Service (QoS) constraints. We aim to minimize the number of required
gateways while ensuring QoS requirements. We propose a polynomial time
near-optimal algorithm consisting of recursively computing minimum weighted
Dominating Sets (DS) in a WMN setting, while consistently preserving QoS
requirements across iterations. We evaluate the performance of our
algorithm using both analysis and simulation, and show that it outperform
other alternative schemes by comparing the number of gateways placed in
different scenarios and network parameters."
}

@INPROCEEDINGS{Aoun0610:Max,
AUTHOR="Bassam Aoun and Raouf Boutaba",
TITLE="{Max-Min} Fair Capacity of Wireless Mesh Networks",
BOOKTITLE="The Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems",
ADDRESS="Vancouver, BC, Canada",
DAYS=7,
MONTH=oct,
YEAR=2006,
ABSTRACT="The use of WMNs as backbone for large wireless access networks imposes
strict bandwidth requirements. It is therefore necessary to study and
quantify the capacity of such systems. In this paper, we argue that the
capacity of WMNs should be addressed in the context of fairness to ensure
proper operation of WMNs. Among the fairness schemes, max-min fairness
allows fair and efficient use of network resources. We therefore propose an
algorithm for max-min capacity calculation, formulated in term of collision
domains. In addition, we show how to calculate the effective load of
collision domains, assuming IEEE 802.11 as the MAC protocol. We illustrate
our proposed algorithm and validate our results over baseline and general
topologies."
}

@INPROCEEDINGS{AOYA0601:Latest,
AUTHOR="Harumi Aoyama",
TITLE="Latest Technology for {Video-Streaming} Gateway of M-stage V Live -Assuring
Video Quality and Usability-",
BOOKTITLE="CCNC2006 Special session technical papers",
DAYS=7,
MONTH=jan,
YEAR=2006,
ABSTRACT="In The case of a system for delivering glive streamingh video and audio
from the internet under a videophone mechanism in real-time, the major
issue is to assure video quality and usability at the same time. It
introduces the technology of assuring video quality and usability developed
in the gvideo-streaming gatewayh provided by gM-stage V Liveh service."
}

@INPROCEEDINGS{Appa0612:Architectural,
AUTHOR="Padmashree Apparao",
TITLE="Architectural characterization of {VM} scaling on an {SMP} machine",
BOOKTITLE="Workshop on XEN in High-Performance Cluster and Grid Computing",
ADDRESS="Sorrento (Italy), Italy",
DAYS=1,
MONTH=dec,
YEAR=2006,
ABSTRACT="The use of virtualization as a means to consolidate multiple applications
on the same server platform continues to grow in the datacenter. However,
understanding the interaction between virtualization events and their
effects on the performance of server applications has not yet been
thoroughly understood. In this paper, our goal is to provide architectural
insights into the performance of server application scaling in a
virtualized environment. We do so by measuring and analyzing the scaling
behavior of a compute intensive application, namely SPECjbb2005 which is a
commercial Java benchmark. Through detailed measurements and
instrumentation on an Intel Xeon platform, we show that the overhead of
running SPECjbb2005 in a single VM is very minimal. However, we observed
that the overheads increased significantly as the number of VMs were
increased. A detailed investigation into the VM scheduling policies showed
that context switching overhead is the cause of the poor scaling. Using
performance monitoring events, we also present the architectural impact of
this context switching between the VMs."
}

@INPROCEEDINGS{Apte0601:Measurement,
AUTHOR="Shourya Bhattacharya and Varsha Apte",
TITLE="A Measurement Study of the Linux {TCP/IP} Stack Performance and Scalability
on {SMP} systems",
BOOKTITLE="COMmunication Systems softWAre and middlewaRE",
DAYS=8,
MONTH=jan,
YEAR=2006,
ABSTRACT={Underlying any networked application, is the protocol stack implementation
of the operating system on which it runs. Thus, protocol stack performance
can greatly impact the performance of networked applications. In this
paper, we present a thorough measurement study and comparison of two
popular Linux kernels: 2.4 and 2.6, with a special focus on their
performance on SMP architectures. Our findings reveal that interrupt
processing costs, device driver overheads, checksumming and buffer copying
are dominant overheads of protocol processing. We find that although raw
CPU costs are not very different between the two kernels, Linux 2.6 shows
vastly improved scalability, attributed to better scheduling and kernel
locking mechanisms. We also find that the same ability of better scheduling
in fact degrades Linux 2.6 performance when packet processing for a single
connection is distributed over multiple processors, thereby verifying the
superiority of the ``processor per connection{"} model for parallel
processing.}
}

@INPROCEEDINGS{Apto0609:Mathematical,
AUTHOR="Erchan Aptoula and Sébastien {Lefèvre} and Christophe Collet",
TITLE="Mathematical morphology applied to the segmentation and classification of
galaxies in multispectral images",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="The automated segmentation and classification of galaxies still constitute
open problems for astronomical imaging, mainly due to their fuzzy and
versatile nature, as well as to the multitude of the available channels. In
this paper, a mathematical morphology based approach is explored. First, a
semi-automated method for multispectral galaxy segmentation, based on the
marker controlled watershed transformation is proposed. Moreover, a novel
and viewpoint independent morphological feature, based on the top-hat
operator, is introduced for the distinction of spiral from elliptical
galaxies. Illustrative application examples of the presented approach on
actual images are also presented."
}

@INPROCEEDINGS{Arab06:Distributed,
AUTHOR="Knarig Arabshian and Henning Schulzrinne",
TITLE="Distributed Context-aware Agent Architecture for Global Service Discovery",
BOOKTITLE="The Second International Workshop on Semantic Web Technology For Ubiquitous
and Mobile Applications (SWUMA '06)",
YEAR=2006,
KEYWORDS="Context-aware computing; pervasive computing; service discovery; ontologies",
ABSTRACT="We present a novel distributed context-aware service
discovery system that is built on top of a global service discovery
architecture, GloServ. A context ontology maps context attributes
to service classes within GloServ. Context-aware agents are distributed
globally and map combinations of context attributes to specific
GloServ queries. These agents also record history of context
combinations in order to provide services to those users who can
specify their context, but are not aware of appropriate services within
their environment. We discuss the details of the architecture, the
algorithms
for mapping context attributes to services, and the details
of the protocol.",
URL="http://www1.cs.columbia.edu/~knarig/SWUMA06.pdf"
}

@ARTICLE{Arab06:Ontology,
AUTHOR="Knarig Arabshian and Henning Schulzrinne",
TITLE="An Ontology-based Hierarchical {Peer-to-Peer} Global Service Discovery
System",
JOURNAL="Journal of Ubiquitous Computing and Intelligence (JUCI)",
YEAR=2006,
KEYWORDS="service discovery; ontologies; ubiquitous computing; peer-to-peer; CAN;",
ABSTRACT="Current service discovery systems fail to span across
the globe and they use simple attribute-value pair or interface
matching for service description and querying. We propose a
global service discovery system, GloServ, that uses the Web
Ontology Language (OWL) for service classification and the
dynamic formation of the network architecture. The GloServ
architecture spans both local and wide area networks. It maps
knowledge obtained by the service classification ontology to a
structured peer-to-peer network such as a Content Addressable
Network (CAN). GloServ also performs automated and intelligent
registration and querying by exploiting the logical relationships
within the service ontologies.",
URL="http://www1.cs.columbia.edu/~knarig/gloservJUCI.pdf"
}

@INPROCEEDINGS{Arad0605:Minimizing,
AUTHOR="Noa Arad and Yuval Shavitt",
TITLE="Minimizing Recovery State in Geographic {Ad-Hoc} Routing",
BOOKTITLE="The Seventh ACM International Symposium on Mobile Ad Hoc Networking and
Computing",
ADDRESS="Florence, Italy",
DAYS=22,
MONTH=may,
YEAR=2006,
ABSTRACT="Geographic ad hoc networks use position information for routing. They often
utilize stateless greedy forwarding and require the use of recovery
algorithms when the greedy approach fails. We propose a novel idea based on
virtual repositioning of nodes that allows to increase the efficiency of
greedy routing and significantly increase the success of the recovery
algorithm based on local information alone. We explain the problem of
predicting dead ends which the greedy algorithm may reach and bypassing
voids in the network, and introduce NEAR, Node Elevation Ad-hoc Routing, a
solution that incorporates both virtual positioning and routing algorithms
that improve performance in ad-hoc networks containing voids. We
demonstrate by simulations the advantages of our algorithm over other
geographic ad-hoc routing solutions."
}

@INPROCEEDINGS{Arak0609:Normalized,
AUTHOR="Shoko Araki and Hiroshi Sawada and Ryo Mukai and Shoji Makino",
TITLE="Normalized Observation Vector Clustering Approach for Sparse Source
Separation",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="This paper presents a new method for the blind separation of sparse sources
whose number N can exceed the number of sensors M. Recently, sparseness
based blind separation has been actively studied. However, most methods
utilize a linear sensor array (or only two sensors), and therefore have
certain limitations; e.g., they cannot be applied to symmetrically
positioned sources. To allow the use of more than two sensors that can be
arranged in a non-linear/non-uniform way, we propose a new method that
includes the normalization and clustering of the observation vectors. We
report promising results for the speech separation of 3-dimensionally
distributed five sources with non-linear/non-uniform sensor arrangements of
four sensors in a room (RT\_{60}= 120 ms)."
}

@INPROCEEDINGS{Aran0610:Vehicular,
AUTHOR="Jesus Arango and Alon Efrat and Srinivasan Ramasubramanian and Marwan Krunz",
TITLE="Onroad Vehicular Broadcast",
BOOKTITLE="International Conference on Computer Communications and Networks 2006 -
Sensor \& Ad-hoc Networking",
ADDRESS="Arlington, Virginia, USA",
DAYS=9,
MONTH=oct,
YEAR=2006,
ABSTRACT="This paper presents a broadcasting algorithm that considerably reduces the
number of retransmissions in applications such as onroad vehicular
broadcasting where nodes are assumed to be arranged on a strip. Analysis
and simulation results are presented to describe the overhead, coverage and
latency characteristics of the algorithm."
}

@INPROCEEDINGS{Aran0611:Improving,
AUTHOR="Jesus Arango and Marwan Krunz",
TITLE="Improving Throughput in {802.11} Networks Using Adaptive {IP} Encapsulation",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="This paper presents an adaptive encapsulation scheme that
significantly improves the effective throughput in 802.11 wireless
LANs. The scheme maximizes the number of IP packets encapsulated
in a single 802.11 MAC frame. Channel efficiency is
improved by deferring transmission requests based on predictions
of packet inter-arrival times, and by performing early discarding
of real-time packets for which delay violations are anticipated.
The scheme supports both real-time and non-real-time traffic
types, adaptively accounting for transport-level requirements as
well as the time-varying nature of the transmission overhead as
network conditions change."
}

@INPROCEEDINGS{Arce0609:Halftone,
AUTHOR="Gonzalo Arce and Zhongmin Wang and Giovanni {Di Crescenzo}",
TITLE="Halftone Visual Cryptography via Direct Binary Search",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="This paper considers the problem of encoding a secret binary image into n
shares of meaningful halftone images. The secret image can be visually
decoded by stacking together the transparencies associated to shares from a
qualified subset. Secret pixels encoded into the shares introduce noise to
the halftone images. We extend our previous work on halftone visual
cryptography and propose a new method that can encode the secret pixels
into the shares via the direct binary search (DBS) method. The perceptual
errors between the halftone shares and the continuous-tone images are
minimized with respect to an alpha stable human visual system (HVS) model.
Simulation results show that our proposed method can improve significantly
the halftone image quality for the encoded shares compared with previous
algorithms."
}

@INPROCEEDINGS{Arci0609:Broadband,
AUTHOR="Antonio Arcidiacono and Daniele Finocchiaro and Sebastien Grazzini",
TITLE="Broadband Mobile Satellite Services: the Ku-band Revolution",
BOOKTITLE="2006 Tyrrhenian International Workshop on Digital Communications -
Satellite Navigation and Communications Systems",
ADDRESS="Island of Ponza, Italy",
DAYS=6,
MONTH=sep,
YEAR=2006,
ABSTRACT="In this paper we analyze the emergence of new system architectures and
products that are able to deliver broadband services into mobile
environments using Ku-band. In particular, we analyze the latest
technological solutions that have been developed to cope with the stringent
requirements of a mobile environment. Such solutions have brought broadband
to environments such as business jets, commercial aircrafts, trains, and
cars, that are today the new frontiers where broadband MSS can be offered"
}

@INPROCEEDINGS{Arda0603:Low,
AUTHOR="Masoud Ardakani and Ali Sanaei",
TITLE="{Low-Density} {Parity-Check} Coding for {Non-Uniform} {Power-Line} Channels",
BOOKTITLE="IEEE International Symposium on Powerline Communications and Its
Applications",
ADDRESS="Disney Coronado Springs Resort, Orlando, FL USA",
DAYS=26,
MONTH=mar,
YEAR=2006,
ABSTRACT="Irregular low-density parity-check coding is studied for frequency
selective channels and discreet multi-tone (DMT) systems that are
used for power-line channels. To let a long block-length code with a
practical buffer delay, we protect all the symbols that are
transmitted in a DMT symbol with one code. The main challenge,
therefore, is the varying signal to noise ratio in different
frequency tones, which normally necessitates using different codes
for different frequency tones (according to their signal to noise
ratios). We show that if this non-uniformity is considered in the
code design process, low-density parity-check codes that approach
the capacity of such frequency selective channels can be found.
Compared to codes that are designed for uniform channels, our codes
have a significantly smaller gap from the capacity. As an extreme
case, we focus on systems that---for reducing signalling and
detection complexity---use only one non-binary modulation in all
frequency tones. Therefore, the soft information at the receiver
experiences a dramatic non-uniform quality from bit to bit.
Surprisingly, even in this case, very close-to-capacity performance
can be obtained."
}

@INPROCEEDINGS{Arda0606:Linear,
AUTHOR="Masoud Ardakani",
TITLE="A {Linear-Programming} Approach to The Design of {Low-Density}
{Parity-Check} Codes for {Non-Uniform} Channels",
BOOKTITLE="ICC 2006  Communication Theory",
ADDRESS="Istanbul, Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="We propose a linear-programming approach to the design of low-density
parity-check codes for non-uniform channels, i.e., when different bits of
the codeword experience different channel parameters. Non-uniform channels
are encountered in many communication systems, e.g., in a network that
different packets are sent through parallel routes; in orthogonal frequency
division multiplexing, where the codeword bits are modulated in different
frequency bins with different SNRs; also in multi-input multi-output
systems, where different channel pairs have different parameters. We
formulate the problem of optimizing the rate of an irregular low-density
parity-check code, with guaranteed convergence over such a channel, as an
iterative linear-programming. The number of design-parameters for
code-design over non-uniform channels is much greater than the number of
design-parameters in conventional channels. Therefore, search-based
optimization methods are impractical. As a result, a linear-programming
approach is significantly more efficient. The methodology of this paper is
directly applicable to all decoding algorithms for which an exact or
accurate-enough one-dimensional analysis is possible. For other decoding
algorithms, we show that the method can still be applied after minor
modifications."
}

@INPROCEEDINGS{Ardi0609:Damages,
AUTHOR="Edoardo Ardizzone and Haris Dindo and Umberto Maniscalco and Giuseppe
Mazzola",
TITLE="Damages of Digitized Historical Images as Objects for Content Based
Applications",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="This work presents the preliminary results achieved within a FIRB project
aimed to develop innovative support tools for automatic or semi-automatic
restoration of damaged digital images concerning archaeological and
monumental inheritance of Mediterranean coast. In particular, this paper is
focused on a methodology for describing image degradation and its
meta-representation for content based storing and retrieval. Our innovative
idea is to decompose and store in a conventional RDBMS the images content,
considering the damages as objects of the images. Moreover, a set of
descriptors(a subset of MPEG7 descriptors) is used for the damage meta
representation aimed to content based application. Finally we developed a
user-friendly database management tool for manipulating the contents of the
database"
}

@INPROCEEDINGS{Aren0605:Use,
AUTHOR="Lukas Arenson and Dave Sego and Greg Newman",
TITLE="The use of convective heat flow in road designs for Northern regions",
BOOKTITLE="EIC Climate Change Technology Conference",
ADDRESS="Ottawa, Ontario, Canada",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Roads and highways in northern environments are exposed to harsh climatic
conditions. In particular, changes in temperature of several tens of
degrees centigrade between the seasons, and substantial precipitation as
well as permafrost conditions. These environmental conditions result in
significant damages to the infrastructure that requires extensive
maintenance. Road damage is directly related to problems associated with
the foundation, frequently resulting in differential settlements.
Significant increase in these problems is expected as a result of changing
climate, thus reducing the expected service life of various roads in arctic
regions. The highway system within the permafrost region is extremely
vulnerable to these climate changes because the mechanical property of the
soil changes dramatically with temperature increases and as ice within the
frozen soil thaws. This paper presents a numerical investigation of a novel
approach for an improvement of road foundations resulting from convective
heat flow. The proposed foundation is capable of compensating for some of
the expected warming of the permafrost by storing and maintaining the cold
winter temperatures through the summer months. The numerical model
demonstrated the importance of considering convective heat flows to
optimize the design of the foundation with a focus on minimizing the effect
of climate warming."
}

@INPROCEEDINGS{Ares0603:Image,
AUTHOR="Romain Areste and Yongyi Yang and Jiang Hsieh",
TITLE="An image enhancement procedure for 3d visualization of liver {CT} data",
BOOKTITLE="2006 Southwest Symposium on Image Analysis and Interpretation",
ADDRESS="Grand Hyatt Denver Downtown, Denver, Colorado, USA",
DAYS=26,
MONTH=mar,
YEAR=2006,
ABSTRACT="In this paper we present an image enhancement procedure for 3D
visualization of CT image data in a liver study. The procedure consists of
the following two steps: 1) segmentation of the liver volume from the image
data; and 2) adaptive noise filtering of the liver volume for enhancing the
visibility of vascular features in the liver. The processed liver volume is
visualized using the technique of maximum intensity projection (MIP), where
projection images from multiple view angles are generated and visualized in
cine display. Our experimental results demonstrate that the proposed
procedure can greatly improve the visibility of the vascular features in
the MIP images, enabling intuitive perception of the vascular system in the
liver. In addition, the procedure is computationally efficient and requires
little manual intervention."
}

@INPROCEEDINGS{Argü0609:Mexican,
AUTHOR="Francisco {Argüeso}",
TITLE="The Mexican Hat Wavelet Family. Application to the study of non-Gaussianity
in cosmic microwave backgound maps",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="The detection of the non-Gaussian signal due to extragalactic point sources
and its separation from the possible intrinsic non-Gaussianity is an issue
of great importance in the cosmic microwave background (CMB) analysis. The
Mexican Hat Wavelet Family (MHWF), which has been proved very useful for
the detection of extragalactic point sources, is applied here to the study
of non-Gaussianity due to point sources in CMB maps. We carry out
simulations of CMB maps with the characteristics of the forthcoming Planck
mission at 70 and 100 GHz and filter them with the MHWF. By comparing the
skewness and kurtosis of simulated maps with and without point sources, we
are able to detect clearly the non Gaussian signal due to point sources for
flux cuts as low as 0.4 Jy (70 GHz) and 0.3 Jy (100 GHz). The MHWF performs
better in this respect than the Mexican Hat Wavelet and much better than
the Daubechies 4 wavelet."
}

@INPROCEEDINGS{Argo0606:Systematic,
AUTHOR="Cenk Argon",
TITLE="Systematic Optical Orthogonal Code Design Techniques Using Extended Sets",
BOOKTITLE="ICC 2006 Optical Systems and Networks Symposium",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="Optical orthogonal code (OOC) sequences are assigned to optical
code-division multiple-access (CDMA) network users, who are then able to
transmit data asynchronously through this network. In this work, we present
two systematic OOC design techniques based on extended sets. The first
technique is a deterministic design approach where the OOC sequences are
generated in a single run. We demonstrate that with this design strategy,
although not optimal, sequences of relatively short length can be obtained
and hence, the required system bandwidth can be feasible for asynchronous
intensity-modulation/direct-detection (IM/DD) optical CDMA systems. The
second design technique is semi-random and may require multiple iterations
until all OOC sequences are generated. Although computationally more
cumbersome, this design method is able to converge to the optimal OOC and
hence, enables minimum required system bandwidth for the optical CDMA
system under consideration."
}

@INPROCEEDINGS{Argy0609:Motion,
AUTHOR="Vasileios Argyriou and Theo Vlachos",
TITLE="Motion Estimation Using Hypercomplex Correlation in the Wavelet Domain",
BOOKTITLE="14th European Signal Processing Conference",
ADDRESS="Florence, Italy",
DAYS=4,
MONTH=sep,
YEAR=2006,
ABSTRACT="We present a novel frequency-domain motion estimation technique, which
employs hypercomplex correlation in the wavelet domain. Our method involves
wavelet decomposition followed by cross-correlation in the frequency domain
using the discrete quaternion Fourier transform. Experiments using both
artificially induced motion and actual scene motion demonstrate that the
proposed method outperforms the state-of-the-art in frequency-domain motion
estimation, in the shape of phase correlation, in terms of sub-pixel
accuracy for a range of test material and motion scenarios."
}

@INPROCEEDINGS{Argy0611:Modeling,
AUTHOR="Antonios Argyriou",
TITLE="Modeling the Effect of Mobile Handoffs on {TCP} and {TFRC} Throughput",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="At the forefront of the recent advances in mobile networks, is the
development of sophisticated mobility management mechanisms that are
usually based on Mobile IP and its derivatives. Based on these
mobility management protocols, several studies that characterize
transport protocol performance have been presented. In this work we
move one step further, and present a joint performance evaluation
model of TCP and TFRC, with the underlying IP-based mobility
protocols. We develop stochastic models that can characterize the
protocol performance during handoffs between heterogeneous wireless
networks like WLAN, cellular, or WMAN. We present performance
evaluation results for validating the developed models under a set
of different handoff scenarios. The developed model can be utilized
as a basis for further analytical evaluation of new mobility
management protocols, allowing thus a fast and accurate comparison."
}

@INPROCEEDINGS{Argy0611:Playback,
AUTHOR="Antonios Argyriou",
TITLE="Playback Adaptation with {Transport-Protocol} Awareness for Wireless Video
Streaming",
BOOKTITLE="IEEE Globecom 2006 - Wireless Communications and Networking",
ADDRESS="San Francisco",
DAYS=27,
MONTH=nov,
YEAR=2006,
ABSTRACT="In this paper we propose a new playback adaptation algorithm for
video streaming in IP wireless and mobile networks where both
handoffs and random wireless errors can happen. We assume the two
protocols can be used namely TCP and the UDP/TFRC. Primary task of
our method, is the estimation of the expected latency for the
delivery of the lost packets. Subsequently, the client uses this
estimate in order to adjust the playback rate according to a new
algorithm we define so that both buffer underflows and overflows can
be avoided. The proposed algorithm in non-intrusive to the protocol
stack since it does not require any modifications in the baseline
protocol. To validate the basic principles behind our idea, we
provide a set of comparative experimental results with other
streaming systems in terms of the rate of underflow events and the
actual PSNR."
}

@INPROCEEDINGS{Aria0609:Efficient,
AUTHOR="Eva Arias-de-Reyna and José Acha",
TITLE="Efficient search strategy for coarse synchronization of {UWB} signals
without channel knowledge",
BOOKTITLE="International Conference on Ultra Wideband 2006",
ADDRESS="Westin Hotel, Waltham, Massachusetts",
DAYS=24,
MONTH=sep,
YEAR=2006,
ABSTRACT="This paper addresses the problem of coarse synchronization
of Ultra Wideband (UWB) signals in the dense
multipath channel, extending a previous work where we proposed
a search strategy based on the golden section, which practically
achieved the minimum mean acquisition time (MAT) under a
simplistic model. Firstly, we show that the golden section strategy
is especially advantageous when the size of the uncertainty region
is a term of the Fibonacci sequence, thus providing an alternative
to the popular bit reversal search: the proposed strategy has also
a very simple implementation and adds flexibility in the choice
of design parameters. Secondly, we test the proposed strategy
under a model for which there exist known lower bounds for
the MAT. Finally, we report simulations with a realistic channel
model, confirming that the proposed strategy is very appropriate
for the acquisition of UWB signals."
}

@INPROCEEDINGS{Arif0605:New,
AUTHOR="Muhammad Arif and Noor Sheikh and Asrar Sheikh",
TITLE="A New Deterministic Interleaver for Turbo Codes",
BOOKTITLE="13th International Conference on Telecommunications",
ADDRESS="Madeira, Portugal",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Interleavers play a critical role in performance of turbo codes. The turbo
code performance curve can change its slope in low bit error rate (BER)
region, if the interleaver is not designed properly. The interleaver is
also a cause of bottleneck for parallelization of turbo decoder. In this
paper, we propose the design of interleaver that combines the regular
permutation of the interleaver and de-correlation property of the decoder.
The interleaver design is systematic and provides enlarged the minimum
effective free distance dmin. The systematic design and low memory
requirement make the interleaver best suited for parallelism. Spread
spectrum distribution and simulation results are presented and compared
with well established S-random interleaver for short block lengths."
}

@INPROCEEDINGS{Aris0605:Urban,
AUTHOR="Hanz Arisz",
TITLE="Urban Drainage Infrastructure Planning And Design Considering Climate
Change",
BOOKTITLE="EIC Climate Change Technology Conference",
ADDRESS="Ottawa, Ontario, Canada",
DAYS=9,
MONTH=may,
YEAR=2006,
ABSTRACT="Climate change is a reality that planners and designers of drainage
infrastructures must consider. The cumulative effects of gradual changes in
hydrology due to climatic change are expected to alter the magnitude and
frequency of peak flows over the service life of drainage infrastructure.
Potential future changes in rainfall intensity are expected to alter the
level of service of drainage infrastructure, with increased rainfall
intensity likely resulting in more frequent flooding of storm sewers and
surcharging of culverts. The expected effects of climate change necessitate
a change in the approach used to plan for and design drainage
infrastructure. New development should ideally be served by both a minor
storm drainage system, such as a traditional storm sewer system, and a
major overland storm drainage system designed to convey the excess runoff
when the capacity of the minor system is exceeded. The planning and design
of new drainage infrastructure should incorporate development features and
sustainable urban drainage systems that provide multiple benefits (such as
a reduction of localized urban flooding and harmful environmental impacts).
Modifications to existing drainage infrastructure in existing development
is complicated by the integration of the minor drainage system with other
infrastructure and a lack of space for the construction of major drainage
system components. KEYWORDS: urban drainage, climate change, hydrology,
stormwater"
}

@INPROCEEDINGS{Aris0606:End,
AUTHOR="Mustafa Arisoylu and Tara Javidi and Rene L. Cruz",
TITLE="{End-to-End} and {Mac-Layer} Fair Rate Assignment in Interference Limited
Wireless Access Networks",
BOOKTITLE="ICC 2006  Wireless Communications",
ADDRESS=", Turkey",
DAYS=11,
MONTH=jun,
YEAR=2006,
ABSTRACT="In this paper, the problem of end-to-end and mac-layer fair rate
assignments in a two-channel multi-hop CDMA wireless access network is
discussed. We show that end-to-end global max-min fairness (hierarchical as
well as flow-based) can be achieved by simple extension of mac-layer
fairness. In particular, we show that end-to-end flow-based global max-min
fairness can be simply insured if and only if weighted mac-layer max-min
and transport-layer max-min fair rates are achieved. The significance of
this result is that the only higher-layer information required at the mac
layer to ensure end-to-end global max-min fairness is the number of flows
traversing on a link. In addition, we introduce a mac-layer algorithm,
MIMD-alpha-G algorithm, that, with careful choice of parameters, not only
provides alpha-proportional fairness at the mac layer, but also leads to
end-to-end global max-min fairness with an appropriate higher-layer (e.g
transport) protocol."
}

@INPROCEEDINGS{Arkh0611:Frequency,
AUTHOR="Alexander Arkhipov and Michael Schnell",
TITLE="Frequency Offset Estimation for {IFDMA} Uplink Systems",
BOOKTITLE="IEEE Globecom 2006 - Next Generation Network