Networking and Communication Engineering

S. Vijayaragavan ¹, K. Duraiswamy ²

Affiliations
1 Rajiv Gandhi College of Engineering and Technology, Kirumambakkam, Pondicherry, IN
2 K.S. Rangasamy College of Technology, Tiruchengode, Tamilnadu, IN

Abstract

Mobile ad hoc networks (MANETs) are characterized by dynamic topology, limited channel bandwidth and limited power at the nodes. Because of these characteristics, paths connecting to the source nodes with destinations may very unstable and go down at any time, making communication over ad hoc networks difficult. Multicasting is intended for group-oriented computing. Multicast generally needs a tree construction that connects all the members of the multicast group as well as the nodes where data packets are duplicate. In this paper, we compared the multicast multipath routing protocols. The MAODV (Multicast Ad hoc On-demand Distance Vector) routing protocol shows a smooth performance in light load ad hoc networks. However, as degraded quickly. Multipath routing allows building and use of multiple paths for routing between source and destination pair. It exploits the resource redundancy and diversity in the underlying network to provide benefits such as fault tolerance, load balancing, bandwidth aggregation, and improvement in QoS metrics such as delay. Multiple Tree- MAODV (MT-MAODV) routing protocol consists mainly of constructing two disjoint trees. Only when the two links are broken, the source nodes restart to find new routes. So it decreases the number of routing discovery and reduces routing overhead. The MT-MAODV preferably ensure the network performance in heavy load ad hoc networks.

Keywords

Multicast, Multipath, VCR, Mobile Adhoc Network.

Full Text

     

T. Thillaikkarasi ¹, A. Jagadeesan ², K. Duraiswamy ³

Affiliations
1 Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam-638 401, Tamil Nadu, IN
2 Bannari Amman Institute of Technology Sathyamangalam-638 401, Tamil Nadu, IN
3 K.S.R. College of Technology, Tiruchengode, Tamil Nadu, IN

Abstract

This paper describes the development of a Multiprocessor System-on-Chip (MPSoC) with a novel interconnect architecture incorporating memory allocation. It addresses the problem of mapping a process network with data dependent behavior and soft real time constraints onto the heterogeneous multiprocessor System on Chip (SoC) architectures and focuses on a memory allocation step which is based on an integer linear programming model. An application is modeled as Kahn Process Network (KPN) which makes the parallelism present in the application explicit. The main contribution of our work is an MILP based approach which can be used to map the KPN of streaming applications with data dependent behavior and interleaved computation and communication. Our solution minimizes hardware cost while taking into account the performance constraints. One of the salient features of our work is that it takes into account the additional overheads because of data communication conflicts. It permits to obtain an optimal distributed shared memory architecture minimizing the global cost to access the shared data in the application, and the memory cost. Our approach allows automatic generation of an architecture-level specification of the application.

Keywords

Application Specific Multiprocessors, Integer Linear Programming, Kahn Process Networks, System on Chip.

Full Text

     

R. Sasikala ¹, K. Duraiswamy ²

Affiliations
1 K. S. Rangasamy College of Technology, Tiruchengode–637 215, IN
2 K.S.Rangasamy College of Technology, Tiruchengode–637 215, IN

Abstract

Group communications require a reliable multicast protocol that guarantees safe data delivery in a reasonably short time. As these applications grow in use, scalability becomes an important issue. To support these applications, several multicast transport layer protocols have been proposed and implemented. These protocols may suffer from the length of the retransmission paths between source and receivers which yields very high cost for retransmissions. An approach to reduce latency of multicast transport layer protocol is to recover the lost packet locally by requesting local replier. This paper gives the solution that local replier can be selected dynamically based on the link properties such as Bandwidth Delay Product and reliability of link. We measured recovery latency for all loss cases, namely, source, receivers, and links. Results show that the recovery latency is decreased by 17.73% to 40.59%. This percentage of improvement increases linearly, when tree size increases. Also number of duplicate replies received by the receiver is zero when loss is at the receiver and link. This approach also reduces the routing overhead significantly.

Keywords

Proxy, Bandwidth Delay Product, Recovery Latency, Exposure.

Full Text