In this paper, we present path loss model for VANETs and simulate three routing protocols; Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR) and Dynamic MANET On-demand (DYMO) to evaluate and compare their performance using NS-2. The main contribution of this work is enhancement of existing techniques to achieve high efficiency of the underlying networks. After e...

The HELLO messages of the OLSR protocol can be used as a way to exchange packet counters for each advertised link between the originating node and its neighbors. These counters are aimed to enable nodes receiving the HELLO messages to check that the property of flow conservation is verified on the originating node. The addition of this information incurs a significant overhead that could preven...

There is an Mayer-Vietoris exact sequence 0 → Vn → PicZCpn → Cl Q(ζn−1) × Pic ZCpn−1 → 0 involving the Picard group of the integer group ring ZCpn where Cpn is the cyclic group of order p and ζn−1 is a primitive p -th root of unity. The group Vn splits as Vn ∼= V + n ⊕ V − n and V − n is explicitly known. V + n is a quotient of an in some sense simpler group Vn. In 1977 Kervaire and Murthy conj...

The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically, routing strategy largely impacts the network capacity, i.e. the throughput offered to each flow. In this work, we propose a complete framework to compute the upper and the lower bounds of the network capacity accord...

Mobile Adhoc Network is an autonomous and decentralized network. Its topology changes dynamically and message overhead is more due to its frequent change of topology in network. For reliable transmission there is need to design a network which overcomes these problems like; overhead, Link breakage, power consumption etc. In this paper an attempt is made to overcome above mentioned issues by dev...

This paper provides a comparative analysis of five implementations of transaction support. The first of the methods is the traditional approach of implementing transaction processing within a data manager on top of a read optimized file system. The second also assumes a traditional file system but embeds transaction support inside the file system. The third model considers a traditional data ma...

In this paper, we develop a simple autoconfiguration mechanism for OLSR networks. The mechanism aims at solving the simple, but common, probem of one or more new nodes emerging in an existing network. We propose a simple solution, which allows these new nodes to acquire an address and participate in the network. Our method is simple, both algorithmically and in the requirements to the network. ...

In this paper, we propose an Optimized OSPF (Open Shortest Path First)protocol for MANETs (Mobile Ad-hoc Networks). MANETs are multi-hop ad-hoc wireless networks where nodes can move arbitrarily in the topology. The network has no given infrastructure and can be set up quickly in any environment. Traditional OSPF is not also well used in multi-hop wireless networks. The optimized OSPF we propos...