Wireless Communication

S. Aruna ¹, A. Subramani ²

Affiliations
1 Department of Master of Computer Applications, Sona College of Technology, Salem, Tamil Nadu, IN
2 Department of Computer Applications, KSR College of Engineering, Tiruchengode, Tamil Nadu, IN

Abstract

Nodes in MANET operate not only as an end system, but also as a router to forward packets. These nodes moves free and organizes themselves into a network. They also change its position frequently. To accommodate the changing topology special routing algorithms are needed. In a flat topology, all nodes are of the same level with equal functionalities. Therefore, flat routing protocols are sufficient only for small networks. Scalability is hard to achieve when the network size increases. In such a case, cluster based routing strategy can be a good choice. In a cluster-based routing, all nodes in the network are dynamically organized into partitions called groups or clusters. These clusters are then combined into larger partitions to help maintain a relatively stable network topology. One of the most critical issues in these networks is load imbalance among cluster heads. Thus, sharing the load between the overloaded and idle cluster heads is necessary in ad hoc networks. Because, these cluster heads has more responsibility and deplete more energy; thus drops out of the network soon. Therefore, there is a need for load-balancing among cluster heads to allow all nodes to serve as a cluster head. We propose a load balancing heuristic to extend the life of cluster heads. The simulation results show that the proposed heuristic guarantees fairness and stability.

Keywords

Cluster, Load Balance, MANET, Scalability.

Full Text

     

A. Vanitha ¹, S. Aruna ¹, A. Subramani ²

Affiliations
1 Department of MCA, Sona College of Technology, Salem-636 005, Tamil Nadu, IN
2 Department of Computer Applications, KSR College of Engineering, Tiruchengode-637 215, Tamil Nadu, IN

Abstract

An ad hoc wireless network consists of a set of mobile nodes that are connected by wireless links. The network topology in such a network may keep changing randomly. Routing protocols that find a path from a source node to a destination node used in traditional wired networks cannot be directly applied in ad hoc wireless networks due to their highly dynamic topology and absence of established infrastructure for centralized administration. A variety of routing protocols for ad hoc wireless networks has been proposed in the recent past. An efficient routing protocol can provide significant benefits to mobile ad hoc networks in terms of both performance and reliability. The most popular routing protocols are Dynamic Source Routing (DSR), Ad-hoc On-demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA) and Destination-Sequenced Distance Vector (DSDV) routing protocol. The performance of AODV and DSDV routing protocol have been evaluated for Mobile Ad-hoc Networks (MANETs) in terms of the quality of service metrics: "throughput", "average end-to-end delay" and observed that the AODV is performing better than the DSDV routing protocol. A network simulator-2 (NS-2) has been used for the performance evaluation of AODV and DSDV routing protocol in this paper.

Keywords

MANETs, AODV, DSDV.

Full Text