| 1.Title : PARTICIPATION |
| Period : 12-05-05 TO 13-05-05 |
| Organized by : |
| Chiefguest/ResourcePerson : |
| Venue : |
| Details: ORGANIZER |
| 2.Title : PARTICIPATED |
| Period : 4-03-05 TO 5-03-05 |
| Organized by : |
| Chiefguest/ResourcePerson : |
| Venue : |
| Details: ORGANIZER |
| 3.Title : TOPOLOGY DISCOVERY IN HETEROGENEOUS IP NETWORK |
| Period : 17-03-05 TO 18-03-05 |
| Organized by : |
| Chiefguest/ResourcePerson : |
| Venue : |
| Details: This paper describes the structure of a multicast
asynchronous transfer mode (ATM) switching node employing
a recursive copy generation algorithm, based on a self-routing
network with a limited copying capability and a few added
elements. While the network generates only a few copies a time of
an input multicast cell, the remaining are obtained by recycling
the output copies to the corresponding inputs as many times as
necessary. The proposed recursive copy generation is also suitable
to dynamically include new destinations and to delete old ones.
The performance of the proposed structure, that has been
implemented in a test-bed prototype, is also evaluated in terms of
throughput and delay, via computer simulation, showing a possible
performance improvement for multicast traffic with respect
to an equivalent unicast input traffic. The cell loss probability in
such structure is also evaluated.
|
| 4.Title : asymmetric key cryptography in wireless adhoc network |
| Period : 19-03-09 to 20-03-09 |
| Organized by : |
| Chiefguest/ResourcePerson : |
| Venue : |
| Details: The security architectures of existing mobile networks are highly centralized. Wireless ad-hoc networks usually do not provide on-line access to trusted authorities or to centralized servers and they exhibit frequent partitioning due to link and node failures. For these reasons, traditional security solutions that require on-line trusted authorities are not well suited for securing ad hoc networks.
|
| 5.Title : BOUNDARY MAPPING & BOUNDARY STATE ROUTING(BSR) IN ADHOC |
| Period : 28-3-09 |
| Organized by : |
| Chiefguest/ResourcePerson : |
| Venue : |
| Details: This paper presents a geographic routing protocol, Boundary State Routing (BSR), which consists of two components. The first is an improved forwarding strategy, Greedy-Bounded Compass, which can forward packets around concave boundaries, where the
packet moves away from the destination without looping. The second component is a Boundary Mapping Protocol (BMP), which is used to maintain link state information for boundaries containing concave vertices. The proposed forwarding strategy Greedy-
Bounded Compass is shown to produce a higher rate of path completion than Greedy forwarding and significantly improves the performance of Greedy Perimeter State Routing (GPSR) in sparse networks when used in place of Greedy forwarding. The proposed geographic routing protocol BSR is shown to produce significant improvements in performance in comparison to GPSR in sparse networks due to informed decisions regarding the direction of boundary traversal at local minima.
|
|
