Wireless Ad hoc Networks Research Papers (original) (raw)

Top Papers
Most Cited Papers
Most Downloaded Papers
Newest Papers
People
- by
- •
- Energy Consumption, Energy efficiency, Broadcasting, Performance Evaluation
- by Miguel Garcia
- •
- Routing protocols, Wimax, Wireless Ad hoc Networks, Routing Protocol
- by David Rodriguez
- •
- Wireless Communications, Computer Networks, Simulation, Comparison

An ad hoc wireless network has a dynamic nature that leads to constant changes in its network topology.
As a consequence, the routing problem becomes more complex and challengeable, and it probably is the
most addressed and studied problem in ad hoc networks. Based on the routing information update
mechanism Ad hoc wireless networks routing protocols are classified into Proactive, Reactive and Hybrid
Routing Protocols. Out of these, Hybrid Routing Protocol combines the best futures of the first two
categories. The Zone Routing Protocol (ZRP) is one of the hybrid routing protocols in which every
network node proactively maintaining routing information about its routing zone, while reactively
acquiring routes to destinations beyond the routing zone. In this paper, we proposed the Independent Zone
Routing Protocol (IZRP) an enhancement of the Zone Routing Protocol which allows adaptive and
distributed configuration for the optimal size of each node’s routing zone, on per-node basis. We
demonstrate the performance of IZRP with various performance metrics. Furthermore, we compared the
performance of IZRP and ZRP by considering performance metrics Packet Delivery Fraction, Normalized
Routing Overhead and End-to-End Delay.

- by Dave Stewart
- •
- Routing, Technology development, Load Balancing, Wireless Ad hoc Networks
- by Gasim Alandjani
- •
- Logic, Mobile Ad Hoc Networks, Fuzzy Logic, Computer Networks
- by Philippe Kruchten
- •
- Complex Systems Science, Complexity Theory, Humans, Hypertension

From the radar and military research world's, the Ultra-WideBand Impulse Radio (UWB-IR) was adopted in the telecommunications world in the 1990'. Currently, the UWB-IR technology is an interesting candidate for close range Wireless Sensors Networks (WSNs). It is particularly attractive for industrial sensor networks due to its resilience to multipath interference, simple transceiver circuitry, accurate ranging ability, and low transmission power. In order to secure data and communications in the Ad-Hoc UWB-IR networks, UWB-IR requires suitable encryption protocols. In this paper, we review and summarize the IEEE 802.15.4 security sub-layer protocol of UWB-IR based Symmetric Key Cryptography scheme. Then, we highlight the different vulnerabilities and weaknesses present in this type of scheme. Finally, we prove, after a deep examination of multiple Public Key Cryptography (PKC) schemes, that the certificateless one is the most suitable for Ad-Hoc UWB-IR networks characterized by nodes mobility. Indeed, we have also evaluated and analyzed the different public key cryptosystems (PKCS) and concluded that NTRU is the most optimum public key cryptosystem to be used with the certificateless scheme in order to secure data and communications in Ad-Hoc UWB-IR Networks. This is due to the fact that it is the fastest PKCS to provide different security levels at a high speed with very constrained resources.

- by Tianji Li
- •
- Distributed Computing, Wireless Ad hoc Networks, Ad hoc network, Wireless Lan

Intrusion detection has, over the last few years, assumed paramount importance within the broad realm of network security, more so in the case of wireless ad hoc networks. These are networks that do not have an underlying infrastructure; the network topology is constantly changing. The inherently vulnerable characteristics of wireless ad hoc networks make them susceptible to attacks, and it may be too late before any counter action can take effect. Second, with so much advancement in hacking, if attackers try hard enough they will eventually succeed in infiltrating the system. This makes it important to constantly (or at least periodically) monitor what is taking place on a system and look for suspicious behavior. Intrusion detection systems (IDSs) do just that: monitor audit data, look for intrusions to the system, and initiate a proper response (e.g., email the systems administrator, start an automatic retaliation). As such, there is a need to complement traditional security mechanisms with efficient intrusion detection and response. In this article we present a survey on the work that has been done in the area of intrusion detection in mobile ad hoc networks.

- by Min-Kuan Chang
- •
- Mobile Ad Hoc Networks, Graph Theory, Probability, Ad Hoc Networks

AbstractWe study the problem of landmark selection for landmark-based routing in a network of fixed wireless com-munication nodes. We present a distributed landmark selection algorithm that does not rely on global clock synchronization,... more

- by Jie Gao
- •
- Computer Science, Distributed Algorithms, Routing, Wireless Sensor Networks
- by Juan Antonio Cordero
- •
- Computer Science, Routing, Experiment, Manet
- by yamir moreno
- •
- Mechanical Engineering, Applied Mathematics, Complex Networks, Synchronization
- by otoniel lopez
- •
- Video Compression, Markov Models, Performance Evaluation, Wireless Network
- by Li-Hsing Yen
- •
- Distributed Computing, Mobile Ad Hoc Networks, Graph Theory, Computer Networks

in this paper, we explained compressive survey of recent Prevention techniques of rushing attack for wireless Ad-hoc Network. Routing protocols deplete these nodes to forward packet from one node to another node. There is many proposed routing protocol works in MANET as on-demand fashion. On-demand protocols have faster reaction time and lower overhead. The paper is based on Rushing attack. In Rushing attack, a awful node or an attacker increasing the speed of routing process. In this paper, we enlisted the approach, which are used to eliminate the rushing attack and also focus on how they work. As a conclusion, we invoke a number of open research challenges with regard to prospects of rushing attack prevention techniques and other issues.

Several analytical models of different wireless networking schemes such as wireless LANs and meshes have been reported in the literature. To the best of our knowledge, all these models fail to address the accurate end-to-end delay analysis of multi-hop wireless networks under unsaturated traffic condition considering the hidden and exposed terminal situation. In an effort to gain deep understanding of delay, this paper firstly proposes a new analytical model to predict accurate media access delay by obtaining its distribution function in a single wireless node. The interesting point of having the media access delay distribution is its generality that not only enables us to derive the average delay which has been reported in almost most of the previous studies as a special case but also facilitates obtaining higher moments of delay such as variance and skewness to capture the QoS parameters such as jitters in recently popular multimedia applications. Secondly, using the obtained single node media access delay distribution, we extend our modeling approach to investigate the delay in multi-hop networks. Moreover, probabilities of collisions in both hidden and exposed terminal conditions have been calculated. The validity of the model is demonstrated by comparing results predicted by the analytical model against those obtained through simulation experiments.

- by abolfazl diyanat
- •
- Distributed Computing, Wireless networks, Analysis, Wireless Network
- by Fayez Gebali
- •
- Engineering, Technology, System Analysis and Design, Sensors
- by Narendra Pareek
- •
- Computer Science, Social Networks, Mobile Ad Hoc Networks, Computer Networks
- by Nelson Baloian
- •
- Mobile Ad Hoc Networks, Mobile Technology, Data Compression, Mobile Computing

Recently, Mobile Crowd Sensing (MCS) has been used in many smart city monitoring applications, leveraging the latest smartphone features of sensing and networking. However, most of these applications use a direct internet connection for sending the collected data to the server through a 3G or 4G (LTE) network.This type of communication leads to higher bandwidth, battery consumption, and higher data plan cost. In this paper, we presenta new ad-hoc tree-based routing protocol named MCS-RPL based on theIoT RPL protocol for the smart city context. The proposed protocol aims to utilize smartphone and Mobile CrowdSensing (MCS) opportunistically to support static Wireless Sensor Network (WSN) and to cover more sensing areas with less routing overhead and power consumption. MCS-RPL usesa grid-based cluster head to address mobility issues and reduce control packets. The conducted performance evaluation reveals that the proposed protocol outperforms RPL in terms of packet delivery ratio and p...

- by Samuel Pierre
- •
- Mobile Ad Hoc Networks, Wireless Network, Ad Hoc Networks, Cellular Network
- by Nasser Sabah
- •
- Wireless Ad hoc Networks, Random Waypoint Mobility Model
- by Sunil Samtani
- •
- Mobile Ad Hoc Networks, Government, Routing protocols, Ad Hoc Networks

In [1] Abdel-Aal has introduced the notions of m-shadow graphs and n-splitting graphs, for all 1 , ≥ n m. In this paper, we prove that, the m-shadow graphs for paths and complete bipartite graphs are odd harmonious graphs for all 1 ≥ m. Also, we prove the n-splitting graphs for paths, stars and symmetric product between paths and null graphs are odd harmonious graphs for all 1 ≥ n. In addition, we present some examples to illustrate the proposed theories. Moreover, we show that some families of graphs admit odd harmonious libeling.

- by Weihua Zhuang
- •
- Distributed Computing, Localization, Equity, Wireless Network

When several independent terminals need to access a limited resource, a Medium Access Control (MAC) protocol is needed in order to manage and assign the resource. If no type of protocol is considered, conflicts could occur if more than one terminal wants to access the resource at the same time. Therefore, this work reports the analysis of MAC protocols. In addition to, we propose a protocol that handles transmission rates to maximize the transmission success rate. This proposed protocol is based on CSMA (Carrier Sense Multiple Access)-CDMA (Code Division Multiple Access). Simulations show that the protocol improves traffic transmission in the network, as compared with fixed rate mechanisms used to access the wireless medium.

- by Aldo Mendoza
- •
- Engineering, Distributed Computing, Smart Antenna, Spine
- by Bodhy Krishna
- •
- Wireless Communications, Computer Networks, Wireless Ad hoc Networks
- by Rick S Blum
- •
- Wireless Sensor Networks, Synchronization, Broadcasting, Stochastic processes
- by Karim Djouani and +1
- •
- Image Processing, Mobile Ad Hoc Networks, Wireless ad-hoc Networks, Dynamic Software Adaptation
- by Niels Reijers
- •
- Augmented Reality, Group communication, Global Positioning System, Mobile Computing

Since there is no fixed infrastructure or centralized management in wireless ad hoc networks, a Connected Dominating Set (CDS) has been proposed to serve as a virtual backbone. The CDS of a graph representing a network has a significant impact on the efficient design of routing protocols in wireless networks. This problem has been studied extensively in Unit Disk Graphs (UDG), in which all nodes have the same transmission ranges. However, in practice, the transmission ranges of all nodes are not necessarily equal. In this paper, we model a network as a disk graph and introduce the CDS problem in disk graphs. We present two efficient approximation algorithms to obtain a minimum CDS. The performance ratio of these algorithms is constant if the ratio of the maximum transmission range over the minimum transmission range in the network is bounded. These algorithms can be implemented as distributed algorithms. Furthermore, we show a size relationship between a maximal independent set and a CDS as well as a bound of the maximum number of independent neighbors of a node in disk graphs. The theoretical analysis and simulation results are also presented to verify our approaches.

- by Dan Liu
- •
- Set Theory, Distributed Computing, Mobile Ad Hoc Networks, Graph Theory
- by Jaewon Kang
- •
- Mobile Ad Hoc Networks, Government, Routing protocols, Ad Hoc Networks

- by An Nguyen and +2
- •
- Computer Science, Distributed Algorithms, Routing, Wireless Sensor Networks
- by David Tipper
- •
- Mobile Ad Hoc Networks, Computer Networks, Ad Hoc Networks, Wireless Ad hoc Networks

This paper presents a wireless communication protocol based on the Earliest Deadline First policy for wireless body sensor networks. This work advances a previous effort by proposing using an implicit Earliest Deadline First policy to guarantee real-time communication by optimizing network traffic flow, although this strategy may imply using the totality of bandwidth resources. The proposed protocol uses a slotted time-triggered medium access transmission control that is collision-free, even in the presence of hidden nodes. The protocol has been analytically modeled using Colored Petri Networks and Simulated in OPNET.

- by Miguel Garcia
- •
- Computer Science, Applied, Applied information technology, Wireless Ad hoc Networks

Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.

- by Elisavet Konstantinou
- •
- Mobile Ad Hoc Networks, Computer Networks, Broadcasting, Ad Hoc Networks