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 of the proposed technique is verified using simulations.
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.
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…
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…
In recent years, video-related services such as YouTube and Netflix have generated huge amounts of traffic and the network neutrality debate has emerged as a major issue. In this paper, we consider feasibility of using a hybrid of unicast and broadcast in cellular networks for high-traffic services (e.g., video streaming), from the perspective of cost effectiveness. To reflect spatial characteristics of base stations (BSs) and mobile users (MUs), we use the stochastic geometry approach where BSs and MUs are modeled as independent homogeneous Poisson point processes (PPPs). With these assumptio…
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.
This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization and stochastic network theory have been successful in designing architectures for fair resource allocation to meet long-term throughput demands. However, to the best of our knowledge, strict packet delay deadlines were not considered in this framework previously. In this paper, we propose a model for incorporating the quality of service (QoS) requirements of packets with deadlines in the optimization framework. The sol…
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…
In multi-hop ad hoc networks, selfish nodes may unduly acquire high quality of service (QoS) by assigning higher priority to source packets and lower priority to transit packets. Such traffic remapping attacks (TRAs) are cheap to launch, impossible to prevent, hard to detect, and harmful to non-selfish nodes. While studied mostly in single-hop wireless network settings, TRAs have resisted analysis in multi-hop settings. In this paper we offer a game-theoretic approach: we derive a formal model of opportunistic TRAs, define a TRA game with a heuristic rank-based payoff function, and propose a b…
Broadcasting capabilities are one of the most promising features of upcoming LTE-Advanced networks. However, the task of scheduling broadcasting sessions is far from trivial, since it affects the available resources of several contiguous cells as well as the amount of resources that can be devoted to unicast traffic. In this paper, we present a compact, convenient model for broadcasting in LTE, as well as a set of efficient algorithms to define broadcasting areas and to actually perform content scheduling. We study the performance of our algorithms in a realistic scenario, deriving interesting…
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…
Vehicular traffic is a foremost problem in modern cities. Huge amount of time and resources are wasted while traveling due to traffic congestion. With the introduction of sophisticated traffic management systems, such as those incorporating dynamic traffic assignments, more stringent demands are being placed upon the available real time traffic data. In this paper we have proposed mobile agent as a mechanism to handle the traffic problem on road. Mobile software agents can be used to provide the better QoS (Quality of Service) in vehicular ad hoc network to improve the safety application and d…
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…
The Long Term Evolution (LTE) broadcast is a promising solution to cope with exponentially increasing user traffic by broadcasting common user requests over the same frequency channels. In this paper, we propose a novel network framework provisioning broadcast and unicast services simultaneously. For each serving file to users, a cellular base station determines either to broadcast or unicast the file based on user demand prediction examining the file's content specific characteristics such as: file size, delay tolerance, price sensitivity. In a network operator's revenue maximization perspect…
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure. As the real-time applications used in today's wireless network grow, we need some schemes to provide more suitable service for them. We know that most of actual schemes do not perform well on traffic which is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio) of routing protocol (Optimized Link State Routing) OLSR by using in the first a real…
With the emergence of Information and Communication Technologies (ICT) and wireless embedded sensing devices into modern vehicles, Intelligent Transport System (ITS) becomes a reality and an indispensable component of smart cities. The purpose of ITS is to improve road safety and traffic efficiency as well as offering infotainments services. In fact, warning drivers in the right time about dangerous situations on the road and providing them with prior information about traffic will undoubtedly leads to enhance driver's safety and reduce traffic congestion. Technically speaking, ITS is based on…
The rapid increase of vehicular traffic and congestion on the highways began hampering the safe and efficient movement of traffic. Consequently, year by year, we see the ascending rate of car accidents and casualties in most of the countries. Therefore, exploiting the new technologies, e.g. wireless sensor networks, is required as a solution of reduction of these saddening and reprehensible statistics. This has motivated us to propose a novel and comprehensive system to utilize Wireless Sensor Networks for vehicular networks. We coin the vehicular network employing wireless Sensor networks as …
Mobile ad hoc networking (MANET) is a growing technology that can support the operation of adaptive wireless networks. With the increased demand rate of wireless applications it is useful to have more adaptive and self organizing technologies that adapt to changes within a network region. In this paper we initially present a brief listing of table driven ad hoc routing protocols and eventually analyze in detail the behaviour of demand driven ad hoc routing protocols like - Ad Hoc On Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR), Temporally-Ordered Routing Algorithm (TORA)…
Multihop ad hoc wireless networks consist of mobile nodes that communicate with each other without any fixed infrastructure. The nodes in these networks are power constrained, since they operate in limited battery energy. Cooperative caching is an attractive solution for reducing network traffic and bandwidth demands in mobile ad hoc networks. Deploying caches in mobile nodes can reduce the overall traffic considerably. Cache hits eliminate the need to contact the data source frequently, which avoids additional network overhead. In this paper we propose a cache discovery policy for cooperative…
Wireless networks are characterized by a dynamic topology triggered by the nodes mobility. Thus, the wireless multi-hops connection and the channel do not have a determinist behaviour such as: interference or multiple paths. Moreover, the nodes' invisibility makes the wireless channel difficult to detect. This wireless networks' behaviour should be scrutinized. In our study, we mainly focus on radio propagation models by observing the evolution of the routing layer's performances in terms of the characteristics of the physical layer. For this purpose, we first examine and then display the simu…
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…
Vehicular Ad Hoc Network (VANET) is a type of mobile ad hoc network (MANET) that facilitates communication among vehicles. VANET provides inter-vehicular communications to serve for the application like road traffic safety and traffic efficiency. Infotainment service has been an anticipating trend in VANETs, and video streaming has a high potential in VANET. Although, this emerging technology is trending, there are still some issues like QoS provisions, decentralized medium access control, node coverage area, and finding and maintaining routes due to highly dynamic topology. These issues make …
We study the problem of broadcasting packets in wireless networks. At each time slot, a network controller activates non-interfering links and forwards packets to all nodes at a common rate; the maximum rate is referred to as the broadcast capacity of the wireless network. Existing policies achieve the broadcast capacity by balancing traffic over a set of spanning trees, which are difficult to maintain in a large and time-varying wireless network. We propose a new dynamic algorithm that achieves the broadcast capacity when the underlying network topology is a directed acyclic graph (DAG). This…
Adhoc networks are formed by intermediate nodes which agree to relay traffic.The link between nodes is broken when a node rejects to relay traffic. Various parameters like depreciation in the energy of a node, distance between nodes and mobility of the nodes play a vital role in determining the nodes rejection to relay traffic.The objective of this paper is to propose a novel model that identifies the cooperative nodes forming stable routes at the route discovery phase.The weight factor of the different parameters decides the varied type of networks where the proposed model can be applied. Hen…
Vehicle-to-vehicle communications can be used effectively for intelligent transport systems (ITS) and location-aware services. The ability to disseminate information in an ad-hoc fashion allows pertinent information to propagate faster through the network. In the realm of ITS, the ability to spread warning information faster and further is of great advantage to the receivers of this information. In this paper we propose and present a message-dissemination procedure that uses vehicular wireless protocols for influencing traffic flow, reducing congestion in road networks. The computational exper…
This paper studies the fundamental communication properties of urban vehicle networks by exploiting the self-similarity and hierarchical organization of modern cities. We use an innovative model called "hyperfractal" that captures the self-similarities of both the traffic and vehicle locations but avoids the extremes of regularity and randomness. We use analytical tools to derive theoretical upper and lower bounds for the information propagation speed in an urban delay tolerant network (i.e., a network that is disconnected at all time, and thus uses a store-carry-and-forward routing model). We…
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…
In this work, we study the stability region of the two-user broadcast channel (BC) with bursty data arrivals and security constraints. We consider the scenario, where one of the receivers has a secrecy constraint and its packets need to be kept secret from the other receiver. This is achieved by employing full-duplexing at the receiver with the secrecy constraint, so that it transmits a jamming signal to impede the reception of the other receiver. In this context, the stability region of the two-user BC is characterized for the general decoding case. Then, assuming two different decoding schem…
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…
Vehicular Ad-hoc Networks (VANET) are self-organized, distributed communication networks built up from moving vehicles where each node is characterized by variable speed, strict limits of freedom in movement patterns and a variety of traffic dynamics. In the last few years vehicular traffic is attracting a growing attention from both industry and research, due to the importance of the related applications, ranging from traffic control to road safety. However, less attention has been paid to the modeling of realistic user mobility through real empirical data that would allow to develop much mor…
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, …
We consider the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links while ensuring bounded expected delay. Each packet transmission can be overheard by a random subset of receiver nodes among which the next relay is selected opportunistically. The main challenge in the design of minimum-delay routing policies is balancing the trade-off between routing the packets along the shortest paths to the destination and distributing traffic according to the maximum backpressure. Combining important aspects of shortest path and backpressure r…
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…
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…
