the ability to discover services in mobile ad hoc network (manet) is a major prerequisite. cluster basedcross layer intelligent service discovery for manet (cbisd) is cluster based architecture, caching ofsemantic details of services and intelligent forwarding using network layer mechanisms. the cluster basedarchitecture using semantic knowledge provides scalability and accuracy. also, the mini...

Vehicular Ad-Hoc Networks (VANETs) were created with the goal of increasing traffic safety and efficiency through wireless communication. Due to the vehicles’ limited radio range, multi-hop communication is useful to extend coverage. However, it is not an easy proposition. The dynamic topology and spatial heterogeneity that characterize VANETs require a fundamental change from traditional topol...

Routing is a challenge to Wireless Multimedia Sensor Networks (WMSNs) for supporting multimedia applications due to nodes’ energy constraints and computational capabilities, and the ways sensor nodes obtain forwarding information. In this paper, we propose an online multipath routing protocol that uses nodes’ positions to make forwarding decisions at each hop. Real-time decisions are made witho...

Existing geographic routing algorithms face serious challenges due to location errors, nonplanarity issues and overhead of location service. To solve these issues, we propose Topological Cluster Based Geographic Routing that combines topology-based routing and geographic routing. It is a localized routing scheme where the geographic routing is performed on an overlay network of topological clus...

In this paper, we propose to apply Contention-Based Forwarding (CBF) to Vehicular Ad Hoc Networks (VANETs). CBF is a greedy positionbased forwarding algorithm that does not require proactive transmission of beacon messages. CBF performance is analyzed using realistic movement patterns of vehicles on a highway. We show by means of simulation that CBF as well as traditional position-based routing...

In this paper we present a novel combinatorial approach for geographic routing with delivery guarantees. Proposed algorithm can be seen as a variant of GFG (Greedy Face Greedy of Bose et.al) algorithm, but based on the defined combinatorial properties of the graph. We utilize a distributed planarization algorithm of a geometric graph, which is based on the Schnyder's characterization of planar ...

Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time...