@COMMENT{{This file has been generated by bib2bib 1.88}}
@COMMENT{{Command line: /usr/bin/bib2bib -ob 2005b.bib -oc 2005c -c year=2005 abouzeid.bib}}
@ARTICLE{8726849,
language = {English},
copyright = {Copyright 2006, IEE},
title = {Energy efficient distributed image compression in resource-constrained multihop wireless networks},
journal = {Computer Communications},
author = {Alhussein A. Abouzeid and Huaming Wu},
volume = { 28},
number = { 14},
year = {2005},
pages = {1658 - 68},
issn = {0140-3664},
abstract = {Efficient compression and transmission of images in a resource-constrained multihop wireless network is considered. Distributed image compression is proposed as a means to overcome the computation and/or energy limitation of individual nodes by sharing the processing of tasks. It has the additional benefit of extending the overall lifetime of the network by distributing the computational load among otherwise idle processors. Two design alternatives for energy efficient distributed image compression are proposed and investigated with respect to energy consumption and image quality. Simulation results show that the proposed scheme prolongs the system lifetime at a normalized total energy consumption comparable to the centralized image compression. [All rights reserved Elsevier]},
keywords = {distributed processing;energy conservation;image coding;resource allocation;wireless sensor networks;},
pdf = {http://www.ecse.rpi.edu/homepages/abouzeid/preprints/2005comcom.pdf}
}
@INPROCEEDINGS{8589223,
language = {English},
copyright = {Copyright 2005, IEE},
title = {Routing in ad hoc networks: a theoretical framework with practical implications},
booktitle = {Proceedings IEEE Infocom 2005},
author = {Zhou, N. and Abouzeid, A.A.},
volume = {vol. 2},
year = {2005},
pages = {1240 - 51},
address = {Miami, FL, USA},
abstract = {In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a two-level hierarchical ad hoc network. Several entropy measures are introduced and used to bound the memory size necessary for the storage of the routing tables. The entropy rates of the topology sequences are used to bound the communication routing overhead-both the interior routing overhead within a cluster and the exterior routing overhead across clusters. A scalability analysis of the routing overheads with regard to the number of nodes and the cluster size is provided under three different network scaling modes. Finally, practical design issues are studied by providing the optimal cluster sizes that asymptotically minimize (i) the memory requirement for each cluster head; (ii) the total control message routing overhead},
keywords = {ad hoc networks;entropy;routing protocols;sequences;telecommunication network reliability;telecommunication network topology;},
pdf = {http://www.ecse.rpi.edu/homepages/abouzeid/preprints/2005infocom.pdf}
}
@ARTICLE{8326161,
language = {English},
copyright = {Copyright 2005, IEE},
title = {The impact of traffic patterns on the overhead of reactive routing protocols},
journal = {IEEE Journal on Selected Areas in Communications},
author = {Nianjun Zhou and Huaming Wu and Abouzeid, A.A.},
volume = { 23},
number = { 3},
year = {2005},
pages = {547 - 60},
issn = {0733-8716},
abstract = {This paper presents a mathematical and simulative framework for quantifying the overhead of reactive routing protocols, such as dynamic source routing and ad hoc on-demand distance vector, in wireless variable topology (ad hoc) networks. A model of the routing-layer traffic, in terms of the statistical description of the distance between a source and a destination, is presented. The model is used to study the effect of the traffic on the routing overhead. Two network models are analyzed; a Manhattan grid model for the case of regular node placement, and a Poisson model for the case of random node placement. We focus on situations where the nodes are stationary but unreliable. For each network model, expressions of various components of the routing overhead are derived as a function of the traffic pattern. Results are compared against ns-2 simulations, which corroborate the essential characteristics of the analytical results. One of the key insights that can be drawn from the mathematical results of this paper is that it is possible to design infinitely scalable reactive routing protocols for variable topology networks by judicious engineering of the traffic patterns to satisfy the conditions presented in this paper},
keywords = {ad hoc networks;mathematical analysis;routing protocols;telecommunication network topology;telecommunication traffic;},
pdf = {http://www.ecse.rpi.edu/homepages/abouzeid/preprints/2005jsac.pdf}
}
@INPROCEEDINGS{114,
author = {Huaming Wu and Alhussein A. Abouzeid},
title = {Error Robust Image Transport in Wireless Sensor Networks},
booktitle = {Proceedings of 5th Workshop on Applications and Services in Wireless Networks (ASWN 2005)},
year = {2005},
pages = {--},
location = { Paris, France},
pdf = {http://www.ecse.rpi.edu/homepages/abouzeid/preprints/2005aswn.pdf},
month = {June 29 - July 1},
abstract = {In this paper, we propose an 'in-network' diversity
combining scheme for image transport in wireless sensor networks.
We consider a wireless sensor network with both wireless
link impairments and node failures. We investigate two performance
metrics of the proposed image transport scheme: energy
consumption and received image quality distortion. Simulation
results show that the proposed image transport scheme improves
the robustness to network errors at the expense of low energy
overhead. This improvement is more noticeable in case of high
node failure probability and long distance between the source
and the destination. Our work also helps in understanding the
tradeoffs between image quality distortion and energy consumption
with different network parameters such as the number of
hops between the source and the destination, the average channel
error rate, and the average node failure rate.}
}
@INPROCEEDINGS{115,
author = {Nabhendra Bisnik and Alhussein A. Abouzeid},
title = {Modeling and Analysis of Random Walk Search Algorithms in P2P Networks},
booktitle = {Proceedings of IEEE Second International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P 2005)},
year = {2005},
pages = {95-103},
location = { San Diego, California},
pdf = {http://www.ecse.rpi.edu/homepages/abouzeid/preprints/2005hotp2p.pdf},
month = {July 21},
abstract = {In this paper we develop a model for random
walk search mechanism in unstructured P2P networks. Using
the model we obtain analytical expressions for the performance
metrics of random walk search in terms of the popularity of the
resource being searched for and the parameters of random walk.
We propose an equation based adaptive search mechanism that
uses estimate of popularity of a resource in order to choose the
parameters of random walk such that a targeted performance
level is achieved by the search. We also propose a low-overhead
method for maintaining an estimate of popularity that utilizes
feedback (or lack there-off) obtained from previous searches.
Simulation results show that the performance of equation based
adaptive search is significantly better than the non-adaptive
random walk.}
}
This file has been generated by bibtex2html 1.88.