Network coding is a recently proposed method for transmitting data, which has been shown to have potential to improve wireless network performance. We study network coding for one specific case of multicast, broadcasting, from one source to all nodes of the network. We use network coding as a loss tolerant, energy-efficient, method for broadcast. Our emphasis is on mobile networks. Our contribution is the proposal of DRAGONCAST, a protocol to perform network coding in such a dynamically evolving environment. It is based on three building blocks: a method to permit real-time decoding of network coding, a method to adjust the network coding transmission rates, and a method for ensuring the termination of the broadcast. The performance and behavior of the method are explored experimentally by simulations; they illustrate the excellent performance of the protocol.
Many mobile ad hoc network protocols use simple flooding, in order to adapt to changes in time varying network topology. Most of the times, a network-wide flood results in redundant packets and increases network congestion, probability of packet collision, low utilization of available bandwidth, and most important, higher power consumption. In this paper, we propose a new cross-layer broadcast scheme to minimize broadcast traffic in mobile ad hoc networks. Our scheme is based on use of received signal strength indicator, RSSI, value to reduce the number of broadcast packets. The effectiveness …
An optimized broadcast protocol is proposed for VANETs. It is based on two key information: the direction to the destination and the beamforming angle θ. The efficiency of this technique is demonstrated in terms of packet delivery, bandwidth gain and probability of transmission success. An analytical model is developed to calculate the transmission area. This model allows capturing the propagation shape of the forwarding area. Comparisons with simulations show that the analytical model is precise.
Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet…
We study broadcast in multiple access channels in dynamic adversarial settings. There is an unbounded supply of anonymous stations attached to a synchronous channel. There is an adversary who injects packets into stations to be broadcast on the channel. The adversary is restricted by injection rate, burstiness, and by how many passive stations can be simultaneously activated by providing them with packets. We consider deterministic distributed broadcast algorithms, which are further categorized by their properties. We investigate for which injection rates can algorithms attain bounded packet l…
We study the minimum latency broadcast scheduling (MLBS) problem in Single-Radio Multi-Channel (SR-MC) wireless ad-hoc networks (WANETs), which are modeled by Unit Disk Graphs. Nodes with this capability have their fixed reception channels, but can switch their transmission channels to communicate with their neighbors. The single-radio and multi-channel model prevents existing algorithms for single-channel networks achieving good performance. First, the common assumption that one transmission reaches all the neighboring nodes does not hold naturally. Second, the multi-channel dimension provide…
This paper deals with broadcasting problem in vehicular ad hoc networks (VANETs). This communication mode is commonly used for sending safety messages and traffic information. However, designing an efficient broadcasting protocol is hard to achieve since it has to take into account some parameters related to the network environment, for example, the network density, in order to avoid causing radio interferences. In this paper, we propose a novel Autonomic Dissemination Method (ADM) which delivers messages in accordance with given priority and density levels. The proposed approach is based on t…
In this paper, we propose solutions for the energy-efficient broadcasting over cross networks, where N nodes are located on two perpendicular lines. Our solutions consist of an algorithm which finds the optimal range assignment in polynomial time (O(N^12)), a near-optimal algorithm with linear complexity (O(N)), and a distributed algorithm with complexity O(1). To the best of our knowledge, this is the first study presenting an optimal solution for the minimum-energy broadcasting problem for a 2-D network (with cross configuration). We compare our algorithms with the broadcast incremental powe…
Network-Wide Broadcast (NWB) is a common operation in Mobile Ad hoc Networks (MANETs) used by routing protocols to discover routes and in group communication operations. NWB is commonly performed via flooding, which has been shown to be expensive in dense MANETs because of its high redundancy. Several efforts have targeted reducing the redundancy of floods. In this work, we target another problem that can substantially impact the success of NWBs: since MAC level broadcasts are unreliable, it is possible for critical rebroadcasts to be lost, leading to a significant drop in the node coverage. T…
In a wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting introduces unnecessary retransmissions of same message. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NP-complete. In this paper, the goal is to reduce the number of forward nodes which will reduce redundant transmission as a result.…
Efficient routing mechanism is a challenging issue for group oriented computing in Mobile Ad Hoc Networks (MANETs). The ability of MANETs to support adequate Quality of Service (QoS) for group communication is limited by the ability of the underlying ad-hoc routing protocols to provide consistent behavior despite the dynamic properties of mobile computing devices. In MANET QoS requirements can be quantified in terms of Packet Delivery Ratio (PDR), Data Latency, Packet Loss Probability, Routing Overhead, Medium Access Control (MAC) Overhead and Data Throughput etc. This paper presents an in dep…
It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are fundamentally different and cannot be derived from unicast case. Therefore, broadcast protocols must be adapted in order to still be efficient under realistic assumptions. In this paper, we study the well-known multipoint relay protocol (MPR). In the latter, each node has to cho…
Multicasting is effective when its group members are sparse and the speed is low. On the other hand, broadcasting is effective when the group members dense and the speed are high. Since mobile ad hoc networks are highly dynamic in nature, either of the above two strategies can be adopted at different scenarios. In this paper, we propose an ant agent based adaptive, multicast protocol that exploits group members desire to simplify multicast routing and invoke broadcast operations in appropriate localized regimes. By reducing the number of group members that participate in the construction of th…
In Mobile Ad-Hoc networks, broadcasting is a fundamental operation in the network layer. A node transmits a rebroadcast message to any or all other nodes whenever it receives for the first time. It will generate several redundant transmissions and it ends up in a significant downside Broadcast Storm problem. Within the literature, researchers have proposed 2-Hop Neighbour based protocol like DP, TDP, PDP and APDP to reduce broadcast storm in MANETs by choosing the minimum number of forwarding nodes from 1-Hop nodes to cover all 2-Hop nodes.
The new type of Mobile Ad hoc Network which is called Vehicular Ad hoc Networks (VANET) created a fertile environment for research. In this research, a protocol Particle Swarm Optimization Contention Based Broadcast (PCBB) is proposed, for fast andeffective dissemination of emergency messages within a geographical area to distribute the emergency message and achieve the safety system, this research will help the VANET system to achieve its safety goals in intelligent and efficient way.
Nodes in an ad hoc wireless network incur certain costs for forwarding packets since packet forwarding consumes the resources of the nodes. If the nodes are rational, free packet forwarding by the nodes cannot be taken for granted and incentive based protocols are required to stimulate cooperation among the nodes. Existing incentive based approaches are based on the VCG (Vickrey-Clarke-Groves) mechanism which leads to high levels of incentive budgets and restricted applicability to only certain topologies of networks. Moreover, the existing approaches have only focused on unicast and multicast…
Vehicular ad hoc networks (VANETs) facilitate vehicles to broadcast beacon messages to ensure road safety. The rogue nodes in VANETs broadcast malicious information leading to potential hazards, including the collision of vehicles. Previous researchers used either cryptography, trust values, or past vehicle data to detect rogue nodes, but they suffer from high processing delay, overhead, and false-positive rate (FPR). We propose fog-based rogue nodes detection (F-RouND), a fog computing scheme, which dynamically creates a fog utilizing the on-board units (OBUs) of all vehicles in the region fo…
A Mobile Ad hoc network (MANET) consists of nodes which use multi-hop communication to establish connection between nodes. Traditional infrastructure based systems use a centralized architecture for address allocation. However, this is not possible in Ad hoc networks due to their dynamic structure. Many schemes have been proposed to solve this problem, but most of them use network-wide broadcasts to ensure the availability of a new address. This becomes extremely difficult as network size grows. In this paper, we propose an address allocation algorithm which avoids network-wide broadcasts to a…
Network coding has been successfully used in the past for efficient broadcasting in wireless multi-hop networks. Two coding approaches are suitable for mobile networks; Random Linear Network Coding (RLNC) and XOR-based coding. In this work, we make the observation that RLNC provides increased resilience to packet losses compared to XOR-based coding. We develop an analytical model that justifies our intuition. However, the model also reveals that combining RLNC with probabilistic forwarding, which is the approach taken in the literature, may significantly impact RLNC's performance. Therefore, w…
Network coding is commonly used to improve the energy efficiency of network-wide broadcasting in wireless multi-hop networks. In this work, we focus on XOR-based broadcasting in mobile ad hoc networks with multiple sources. We make the observation that the common approach, which is to benefit from the synergy of XOR network coding with a CDS-based broadcast algorithm, suffers performance breakdowns. After delving into the details of this synergy, we attribute this behavior to an important mechanism of the underlying broadcast algorithm, known as the "termination criterion". To tackle the probl…
Broadcast is a fundamental operation in networks, especially in wireless Mobile Ad Hoc NETworks (MANET). For example, some form of broadcasting is used by all on-demand MANET routing protocols, when there is uncertainty as to the location of the destination node, or for service discovery. Being such a basic operation of the networking protocols, the importance of efficient broadcasting has long been recognized by the networking community. Numerous papers proposed increasingly more efficient implementation of broadcasting, while other studies presented bounds on broadcast performance. In this w…
Wireless communication in a network of mobile devices is a challenging and resource demanding task, due to the highly dynamic network topology and the wireless channel randomness. This paper investigates information broadcast schemes in 2D mobile ad-hoc networks where nodes are initially randomly distributed and then move following a random direction mobility model. Based on an in-depth analysis of the popular Susceptible-Infectious-Recovered epidemic broadcast scheme, this paper proposes a novel energy and bandwidth efficient broadcast scheme, named the energy-efficient broadcast scheme, whic…
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols which broadcasts control packets to discover routes to the destination nodes, generate a high number of broadcast packets in a larger networks causing contention and collision. We propose an efficient route discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique. The simulation results show that the proposed probabilistic flooding decreases th…
We propose the design and development of an energy-efficient Risk Notification Message Dissemination Protocol (RNMDP) for vehicular ad hoc networks (VANETs). RNMDP propagates Risk Notification Messages (RNMs) from their location of origin (called the Risk Zone) to vehicles approaching the Risk Zone. RNMDP assumes each node is aware of its current location in the network. The protocol works as follows: A RNM is broadcast in the neighborhood of the Risk Zone. A node receiving the RNM from another node waits for a Rebroadcast-Wait-Time before deciding to rebroadcast the message. The Rebroadcast-W…
Wireless ad hoc networks, in particular mobile ad hoc networks (MANETs), are growing very fast as they make communication easier and more available. However, their protocols tend to be difficult to design due to topology dependent behavior of wireless communication, and their distributed and adaptive operations to topology dynamism. Therefore, it is desirable to have them modeled and verified using formal methods. In this paper, we present an actor-based modeling language with the aim to model MANETs. We address main challenges of modeling wireless ad hoc networks such as local broadcast, unde…
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters blindly broadcast without knowledge of the surrounding nodes, two fundamental design parameters are the node transmission probability and the transmission spectral efficiency. In this paper these parameters are selected to maximize end-to-end performance, characterized by the product of transmitter density, hop distance and rate. Due to the intractability of the problem as stated, an approximation function is examin…
In this report we propose a MultiObjective (MO) performance evaluation framework for wireless ad hoc networks where criteria such as capacity, robustness, energy and delay are optimized concurrently. Within such a framework, we can determine both the Pareto-optimal performance bounds and the networking parameters that provide these bounds. The originality of this approach is that it accounts for the inherent broadcast properties of the transmission and finely models the interference distribution. In the proposed model, the network performance can be optimized when several flows (source- destin…
For stationary wireless ad hoc networks, one of the key challenging issues in routing and multicasting is to conserve as much energy as possible without compromising path efficiency measured as end-to-end delay. In this paper, we address the problem of path efficient and energy aware multicasting in static wireless ad hoc networks. We propose a novel distributed scalable algorithm for finding a virtual multicast backbone (VMB). Based on this VMB, we have further developed a multicasting scheme that jointly improves path efficiency and energy conservation. By exploiting inherent broadcast advan…
We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the …
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets are the essential operations for finding the path between two ends. In such situations, intermediate node which may or may not belongs will participate in route discovery process, update routing table and rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT…
In ad hoc networks, the scheduling of route-request packets should be different from that of message packets, because during transmission of message packets the location of the destination is known whereas in route discovery this is not known in most of the cases. The router has to depend upon the last known location, if any, of the destination to determine the center and radius of the circle that embeds all possible current position of the destination. Route-request packets generated from the source are directed towards this circle i.e., directional route discovery can be applied. Otherwise, …
Now-a-days vehicles are one of the most important parts of our life. We need them to cross distances in our everyday life. In this paper we discuss Vehicular AdHoc Network (VANET) technology that can ensure the maintenance of traffic rules and regulation. By applying this technology we can save life, save time, corruption, vehicle security, avoid collision and so on. Vehicular Ad Hoc Network (VANET) is a part of Mobile Ad Hoc Network (MANET). Every node or vehicle can move freely and they will communicate each other by wireless technology in coverage. The main goal of this research is to study…
This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficienc…
Broadcast networks are often used in modern communication systems. A common broadcast network is a single hop shared media system, where a transmitted message is heard by all neighbors, such as some LAN networks. In this work we consider a more complex environment, in which a transmitted message is heard only by a group of neighbors, such as Ad-Hoc networks, satellite and radio networks, as well as wireless multistation backbone system for mobile communication. It is important to design efficient algorithms for such environments. Our main result is a new Leader Election algorithm, with O(n) ti…
A Mobile Ad hoc NETwork (MANET) is a type of wireless network without any infrastructure, where nodes must adapt to the changing dynamic situations that result from their mobility. Because of the decentralization of nodes and the security needs of communications, management of MANETs must be self-organized, which is a major research challenge. In order to cope with the intrinsic properties of MANETs, a new decentralized management system for MANETs called Self-organizing Life Cycle Management (SLCM), is here fully described and evaluated. Regarding security, node authentication is the most cri…
Security in Mobile Ad hoc Network (MANET) is one of the key challenges due to its special features e.g. hop-by-hop communications, dynamic topology, and open network boundary that received tremendous attention by scholars. Traditional security methods are not applicable in MANET due to its special properties. In this paper, a novel approach called Detecting and Eliminating Black Holes (DEBH) is proposed that uses a data control packet and an additional Black hole Check (BCh) table for detecting and eliminating malicious nodes. Benefiting from trustable nodes, the processing overhead of the sec…
Ad-hoc Social Networks have become popular to support novel applications related to location-based mobile services that are of great importance to users and businesses. Unlike traditional social services using a centralized server to fetch location, ad-hoc social network services support infrastructure less real-time social networking. It allows users to collaborate and share views anytime anywhere. However, current ad-hoc social network applications are either not available without rooting the mobile phones or don't filter the nearby users based on common interests without a centralized serve…
One of the main criteria in Vehicular Ad hoc Networks (VANETs) that has attracted the researchers' consideration is congestion control. Accordingly, many algorithms have been proposed to alleviate the congestion problem, although it is hard to find an appropriate algorithm for applications and safety messages among them. Safety messages encompass beacons and event-driven messages. Delay and reliability are essential requirements for event-driven messages. In crowded networks where beacon messages are broadcasted at a high number of frequencies by many vehicles, the Control Channel (CCH), which…
This paper proposes and evaluates a new position-based Parallel Routing Protocol (PRP) for simultaneously routing multiple data packets over disjoint paths in a mobile ad-hoc network (MANET) for higher reliability and reduced communication delays. PRP views the geographical region where the MANET is located as a virtual 2-dimensional grid of cells. Cell-disjoint (parallel) paths between grid cells are constructed and used for building pre-computed routing tables. A single gateway node in each grid cell handles routing through that grid cell reducing routing overheads. Each node maintains updat…
In recent years, a large number of smart devices will be connected in Internet of Things (IoT) using an ad hoc network, which needs more frequency spectra. The cognitive radio (CR) technology can improve spectrum utilization in an opportunistic communication manner for IoT, forming a promising paradigm known as cognitive radio ad hoc networks,CRAHNs. However, dynamic spectrum availability and mobile devices/persons make it difficult to develop an efficient data transmission scheme for CRAHNs under an obstacle environment. Opportunistic routing can leverage the broadcast nature of wireless chan…
Most MANET (Mobile Ad hoc NETwork) research assumes idealized propagation models. Experimental results have shown significant divergence from simulation results due to the effect of signal fading in realistic wireless communication channels. In this paper, we characterize the impact of fading on protocol performance. We first study the effect of fading on MAC performance and show that its effect can be dominating. One of our important conclusions is that eliminating RTS/CTS packets results in more effective operation under fading. We also identify an unfairness problem that arises due to backo…
Cooperative vehicle safety (CVS) systems operate based on broadcast of vehicle position and safety information to neighboring cars. The communication medium of CVS is a vehicular ad-hoc network. One of the main challenges in large scale deployment of CVS systems is the issue of scalability. To address the scalability problem, several congestion control methods have been proposed and are currently under field study. These algorithms adapt transmission rate and power based on network measures such as channel busy ratio. We examine two such algorithms and study their dynamic behavior in time and …
Ad-hoc routing protocols use a number of algorithms for route discovery. Some use flooding in which a route request packet (RREQ) is broadcasted from a source node to other nodes in the network. This often leads to unnecessary retransmissions, causing congestion and packet collisions in the network, a phenomenon called a broadcast storm. This paper presents a RREQ message forwarding scheme for AODV that reduces routing overheads. This has been called AODV_EXT. Its performance is compared to that of AODV, DSDV, DSR and OLSR protocols. Simulation results show that AODV_EXT achieves 3% energy eff…
Automatic dependent surveillance-broadcast (ADS-B) is the communications protocol currently being rolled out as part of next generation air transportation systems. As the heart of modern air traffic control, it will play an essential role in the protection of two billion passengers per year, besides being crucial to many other interest groups in aviation. The inherent lack of security measures in the ADS-B protocol has long been a topic in both the aviation circles and in the academic community. Due to recently published proof-of-concept attacks, the topic is becoming ever more pressing, espec…
Fast data synchronization in wireless ad hoc networks is a challenging and critical problem. It is fundamental for efficient information fusion, control and decision in distributed systems. Previously, distributed data synchronization was mainly studied in the latency-tolerant distributed databases, or assuming the general model of wireless ad hoc networks. In this paper, we propose a pair of linear network coding (NC) and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator's control. We consider both data block selectio…
This research aims at using vehicular ad-hoc networks as infra-structure for an urban cyber-physical system in order to gather data about a city. In this scenario, all nodes are data sources and there is a gateway as ultimate destination for all packets. Because of the volatility of the network connections and uncertainty of actual node placement, we argue that a broadcast-based protocol is the most adequate solution, despite the high overhead. The Urban Data Collector (UDC) protocol has been proposed which uses a distributed election of the forwarding node among the nodes receiving the packet…
We propose a decentralized stochastic control solution for the broadcast message dissemination problem in wireless ad hoc networks with slow fading channels. We formulate the control problem as a dynamic robust game which is well justified by two key observations; first, the shared nature of the wireless medium which inevitably cross-couples the nodes' forwarding decisions, thus binding them together as strategic players; second, the stochastic dynamics associated with the link qualities which renders the transmission costs noisy, thus motivating a robust formulation. Given the non stationarit…
In vehicular ad hoc networks, the dynamic change in transmission power is very effective to increase the throughput of the wireless vehicular network and decrease the delay of the message communication between vehicular nodes on the highway. Transmission range is directly proportional to the transmission power the moving node. If the transmission power will be high, the interference increases that can cause higher delay in message reception at receiver end, hence the performance of the network decreased. In this paper, it is analyzed that how transmission power can be controlled by considering…
Vehicular communication is an essential part of a smart city. Scalability is a major issue for vehicular communication, specially, when the number of vehicles increases at any given point. Vehicles also suffer some other problems such as broadcast problem. Clustering can solve the issues of vehicular ad hoc network (VANET); however, due to the high mobility of the vehicles, clustering in VANET suffers stability issue. Previously proposed clustering algorithms for VANET are optimized for either straight road or for intersection. Moreover, the absence of the intelligent use of a combination of t…
Flying ad hoc network (FANET) provides portable and flexible communication for many applications and possesses several unique design challenges; a key one is the successful delivery of messages to the destination, reliably. For reliable communication, routing plays an important role, which establishes a path between source and destination on the basis of certain criteria. Conventional routing protocols of FANET generally use a minimum hop count criterion to find the best route between source and destination, which results in lower latency with the consideration that there is single source/dest…
We propose a routing protocol for wireless networks. Wireless routing protocols allow hosts within a network to have some knowledge of the topology in order to know when to forward a packet (via broadcast) and when to drop it. Since a routing protocol forms the backbone of a network, it is a lucrative target for many attacks, all of which attempt to disrupt network traffic by corrupting routing tables of neighboring routers using false updates. Secure routing protocols designed for wired networks (such as S-BGP) are not scalable in an ad-hoc wireless environment because of two main drawbacks: …
Vehicular ad hoc networks is a modern technology that holds an important aspect in the transportation domain due to its abilities to increase traffic efficiency and safety. It is a another variant of Mobile ad-hoc networks that provides Vehicles to Vehicles (V2V), Rode-side Unit to Road-side Unit(R2R) and Vehicles to road-side Unit (V2R) communication.VANET is a multidimensional network in which the vehicles ceaselessly alter their locations. Connected vehicles broadcast sensitive information which must be communicated with the neighbors in a safe and established environment. VANET may also co…
In today's world Wireless Ad-hoc sensor network, consists of small sensor nodes having limited resources, has a great potential to solve problems in various domain including disaster management. In this paper "QCS-protocol" is modified which was introduced in our previous paper [1] and named as "Modified QCS-protocol". This is the backbone of our Intelligent Energy Efficient Ad-hoc Sensor Network. Two other protocols "Irregular Information Transfer" & "Final Broadcast-Petrol Flow" protocol are also modified to enhance performance of the new version of QCS protocol to run the system properly an…
A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes, simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11). This paper shows that the concept of network coding can be applied at the physical layer to turn the broadcast property into a capacity-boosting advantage in wireless ad hoc networks. Specifically, we pro…
We propose to use Vehicular ad hoc networks (VANET) as the infrastructure for an urban cyber-physical system for gathering up-to-date data about a city, like traffic conditions or environmental parameters. In this context, it is critical to design a data collection protocol that enables retrieving the data from the vehicles in almost real-time in an efficient way for urban scenarios. We propose Back off-based Per-hop Forwarding (BPF), a broadcast-based receiver-oriented protocol that uses the destination location information to select the forwarding order among the nodes receiving the packet. …
We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery.
This document describes a best-effort delay-tolerant communication system that protects the privacy of users in wireless ad-hoc networks by making their communication undetectable. The proposed system is a wireless broadcast-based adaptation of mix networks where each user belongs to at least one group it trusts, and each group acts as a mix node. Assuming encryption is not broken, it provides undetectability of all users and messages against external adversaries, as well as undetectability of users and messages in non-compromised groups against internal adversaries.
Mobile Ad-hoc Network (MANET) is the self organizing collection of mobile nodes. The communication in MANET is done via a wireless media. Ad hoc wireless networks have massive commercial and military potential because of their mobility support. Due to demanding real time multimedia applications, Quality of Services (QoS) support in such infrastructure less networks have become essential. QoS routing in mobile Ad-Hoc networks is challenging due to rapid change in network topology. In this paper, we focused to reduce flooding performance of the Fisheye State Routing (FSR) protocol in Grid using …
