In this paper, we rewrite the Minimal-Connected-Component (MCC) model in 2-D meshes in a fully-distributed manner without using global information so that not only can the existence of a Manhattan-distance-path be ensured at the source, but also such a path can be formed by routing-decisions made at intermediate nodes along the path. We propose the MCC model in 3-D meshes, and extend the corres...

Mobile Ad hoc NETwork (MANET) comprises of nodes, which are free to move randomly, yet cooperate to forward packets between source and destination over a multi-hop wireless network. Due to absence of any fixed node, each node acts as a router, providing routing capability for the MANET. Various protocols for discovery of routes between any two MANET nodes have been designed. These protocols are...

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 ...

Mobile Ad hoc Networks (MANETs) are very considered attractive for many applications. Routing protocol is considered as the most important element of MANET. However, media streaming over MANET is a quite demanding task. In this paper the performances of MANET routing protocols have been investigated for video applications. Some popular routing protocols namely Dynamic Source Routing (DSR), Ad h...

The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastructure or administration. The protocol is composed of the two mechanisms of Route Discovery and Rou...

The routing problems can be divided into two major classes. They are 1) Unicast routing and 2) Multicast routing. The Unicast routing problem is as follows. Given a source node sr, a destination node dn, a set of QoS constraints qc and an optimization goal (optional), find the best feasible path from sr to dn, which satisfies qc. The Multicast routing problem is as follows. Given a source node ...

Instead of blindly searching for a route in the entire network, the location-based routing protocol uses the location information of mobile nodes to confine routing space into a smaller range that reduces routing overhead and broadcast storm. In this paper, we propose a location-aided cluster-based routing protocol called Core Location-Aided Cluster-based Routing protocol (CLACR). CLACR partiti...

Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been ...

In modern internet era, communication networks are growing very rapidly. To provide efficient routing in the network, routers play an important role. They take part in the network and forward the packets from source to destination and also keep an eye on the data so that it remains in control manner. Routing is the process of transferring data from source node to destination node. Routing selec...