|
In the area of
algorithms for efficient Web design and
performance evaluation, we studied the
optimal hotlink assignment problem. We
proposed new algorithms which are capable
of obtaining considerable savings on the
access cost of the web site. We also built
the hotlink optimizer (HotOpt), a new
software tool that helps administrators
and designers to structure their web sites
efficiently. In rendezvous and exploration
problems in peer-to-peer computing, we
developed several new efficient algorithms
to enable a mobile agent to explore a
network with low memory. We also developed
a new set of algorithms (both randomized
and deterministic) for the mobile agent
rendezvous problem with tokens. The first
step in forming an ad-hoc network is the
discovery of other nodes. This procedure,
called node discovery, involves two or
more nodes in an ad-hoc, multichannel
broadcast system that want to establish a
common communication channel. Our
contribution in this area concerns new
algorithms for access control in Bluetooth
networks. In the area of connectivity in
wireless and sensor networks, and
computing with location awareness we
studied how evolving wireless networks (adhoc,
sensor) take advantage of location
awareness of the hosts and do not need any
infrastructure to maintain efficiently
connectivity, routing information and
other communication primitives.
|
