Position-Based Packet Forwarding for Vehicular Ad-Hoc Networks

OpenAIRE

Füßler, Holger

2007-01-01

Mobile Ad-Hoc Networks, or MANETs, are data communication networks between (potentially) mobile computer systems equipped with wireless communication devices and — in their purest form — in complete absence of communication infrastructure. Usage scenarios for these systems include communication during disaster recovery or battlefield communications. One of the great research challenges concerning MANETs is the Packet Forwarding Problem, i.e., the question to which neighbor node a data packet ...

Auto-Configuration Protocols in Mobile Ad Hoc Networks

Science.gov (United States)

Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

2011-01-01

The TCP/IP protocol allows the different nodes in a network to communicate by associating a different IP address to each node. In wired or wireless networks with infrastructure, we have a server or node acting as such which correctly assigns IP addresses, but in mobile ad hoc networks there is no such centralized entity capable of carrying out this function. Therefore, a protocol is needed to perform the network configuration automatically and in a dynamic way, which will use all nodes in the network (or part thereof) as if they were servers that manage IP addresses. This article reviews the major proposed auto-configuration protocols for mobile ad hoc networks, with particular emphasis on one of the most recent: D2HCP. This work also includes a comparison of auto-configuration protocols for mobile ad hoc networks by specifying the most relevant metrics, such as a guarantee of uniqueness, overhead, latency, dependency on the routing protocol and uniformity. PMID:22163814

Auto-configuration protocols in mobile ad hoc networks.

Science.gov (United States)

Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

2011-01-01

The TCP/IP protocol allows the different nodes in a network to communicate by associating a different IP address to each node. In wired or wireless networks with infrastructure, we have a server or node acting as such which correctly assigns IP addresses, but in mobile ad hoc networks there is no such centralized entity capable of carrying out this function. Therefore, a protocol is needed to perform the network configuration automatically and in a dynamic way, which will use all nodes in the network (or part thereof) as if they were servers that manage IP addresses. This article reviews the major proposed auto-configuration protocols for mobile ad hoc networks, with particular emphasis on one of the most recent: D2HCP. This work also includes a comparison of auto-configuration protocols for mobile ad hoc networks by specifying the most relevant metrics, such as a guarantee of uniqueness, overhead, latency, dependency on the routing protocol and uniformity.

Proposal of interference reduction routing for ad-hoc networks

Directory of Open Access Journals (Sweden)

Katsuhiro Naito

2010-10-01

Full Text Available In this paper, we propose an interference reduction routing protocol for ad-hoc networks. The interference is one of the degradation factors in wireless communications. In the ad-hoc network, some nodes communicate simultaneously. Therefore, these communications cause interference each other, and some packets are corrupted due to interference from another node. In the proposed protocol, each node estimates required transmission power according to hello messages. Therefore, the node can transmit a data packet with minimum required transmission power. Consequently, the interference against neighbor nodes can be reduced. From simulation results, we can find that the proposed protocol can reduce the number of control messages and can improve the throughput performance.

Sensor and ad-hoc networks theoretical and algorithmic aspects

CERN Document Server

Makki, S Kami; Pissinou, Niki; Makki, Shamila; Karimi, Masoumeh; Makki, Kia

2008-01-01

This book brings together leading researchers and developers in the field of wireless sensor networks to explain the special problems and challenges of the algorithmic aspects of sensor and ad-hoc networks. The book also fosters communication not only between the different sensor and ad-hoc communities, but also between those communities and the distributed systems and information systems communities. The topics addressed pertain to the sensors and mobile environment.

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

Science.gov (United States)

Xu, Xiao-Feng

2018-03-01

Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.

Contribution to design a communication framework for vehicular ad hoc networks in urban scenarios

OpenAIRE

Tripp Barba, Carolina

2013-01-01

The constant mobility of people, the growing need to be always connected, the large number of vehicles that nowadays can be found in the roads and the advances in technology make Vehicular Ad hoc Networks (VANETs) be a major area of research. Vehicular Ad hoc Networks are a special type of wireless Mobile Ad hoc Networks (MANETs), which allow a group of mobile nodes configure a temporary network and maintain it without the need of a fixed infrastructure. A vehicular network presents some spec...

Recent development in wireless sensor and ad-hoc networks

CERN Document Server

Li, Xiaolong; Yang, Yeon-Mo

2015-01-01

Wireless Sensor Network (WSN) consists of numerous physically distributed autonomous devices used for sensing and monitoring the physical and/or environmental conditions. A WSN uses a gateway that provides wireless connectivity to the wired world as well as distributed networks. There are many open problems related to Ad-Hoc networks and its applications. Looking at the expansion of the cellular infrastructure, Ad-Hoc network may be acting as the basis of the 4th generation wireless technology with the new paradigm of ‘anytime, anywhere communications’. To realize this, the real challenge would be the security, authorization and management issues of the large scale WSNs. This book is an edited volume in the broad area of WSNs. The book covers various chapters like Multi-Channel Wireless Sensor Networks, its Coverage, Connectivity as well as Deployment. It covers comparison of various communication protocols and algorithms such as MANNET, ODMRP and ADMR Protocols for Ad hoc Multicasting, Location Based C...

Mobile ad hoc networking

CERN Document Server

John Wiley & Sons

2004-01-01

"Assimilating the most up-to-date information on research and development activities in this rapidly growing area, Mobile Ad Hoc Networking covers physical, data link, network, and transport layers, as well as application, security, simulation, and power management issues in sensor, local area, personal, and mobile ad hoc networks. Each of the book's sixteen chapters has been written by a top expert and discusses in-depth the most important topics in the field. Mobile Ad Hoc Networking is an excellent reference and guide for professionals seeking an in-depth examination of topics that also provides a comprehensive overview of the current state-of-the-art."--Jacket.

An implementation of traffic light system using multi-hop Ad hoc networks

KAUST Repository

Ansari, Imran Shafique

2009-08-01

In ad hoc networks nodes cooperate with each other to form a temporary network without the aid of any centralized administration. No wired base station or infrastructure is supported, and each host communicates via radio packets. Each host must act as a router, since routes are mostly multi-hop, due to the limited power transmission set by government agencies, (e.g. the Federal Communication Commission (FCC), which is 1 Watt in Industrial Scientific and Medical (ISM) band. The natures of wireless mobile ad hoc networks depend on batteries or other fatiguing means for their energy. A limited energy capacity may be the most significant performance constraint. Therefore, radio resource and power management is an important issue of any wireless network. In this paper, a design for traffic light system employing ad hoc networks is proposed. The traffic light system runs automatically based on signals sent through a multi-hop ad hoc network of \\'n\\' number of nodes utilizing the Token Ring protocol, which is efficient for this application from the energy prospective. The experiment consists of a graphical user interface that simulates the traffic lights and laptops (which have wireless network adapters) are used to run the graphical user interface and are responsible for setting up the ad hoc network between them. The traffic light system has been implemented utilizing A Mesh Driver (which allows for more than one wireless device to be connected simultaneously) and Java-based client-server programs. © 2009 IEEE.

A fault-tolerant small world topology control model in ad hoc networks for search and rescue

Science.gov (United States)

Tan, Mian; Fang, Ling; Wu, Yue; Zhang, Bo; Chang, Bowen; Holme, Petter; Zhao, Jing

2018-02-01

Due to their self-organized, multi-hop and distributed characteristics, ad hoc networks are useful in search and rescue. Topology control models need to be designed for energy-efficient, robust and fast communication in ad hoc networks. This paper proposes a topology control model which specializes for search and rescue-Compensation Small World-Repeated Game (CSWRG)-which integrates mobility models, constructing small world networks and a game-theoretic approach to the allocation of resources. Simulation results show that our mobility models can enhance the communication performance of the constructed small-world networks. Our strategy, based on repeated game, can suppress selfish behavior and compensate agents that encounter selfish or faulty neighbors. This model could be useful for the design of ad hoc communication networks.

An Approach to Ad-hoc Messaging Networks Using Time Shifted Propagation

Directory of Open Access Journals (Sweden)

Christoph Fuchß

2007-10-01

Full Text Available Many communication devices, like mobile phones and PDAs, are enabled for near field communication by using Bluetooth. Many approaches dealt so far with the attempt to transfer mobile ad-hoc networks (MANET to the mechanism of the “fixed internet” to mobile networks. In order to achieve liability and robustness of common TCP connections routing algorithm in near field communication based networks become more sophisticated and complex. These mechanisms often do not reflect on the application’s particularities.Our approach of an ad-hoc messaging network (AMNET uses simple store-and-forward message passing to spread data asynchronously. We do not aim at the reliability of common internet networks but focus on application specific needs that can be covered by simple message passing mechanism. In this paper we will portray a powerful network by using simple devices and communication protocols on the basis of AMNETs. Simulation results of our AMNET approach provide insights towards speeding up the network setup process and to enable the use of AMNETs even with few participants by introducing a hybrid structure of infrastructure and mobile nodes.

Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mann Raminder P

2005-01-01

Full Text Available Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.

Ad Hoc Access Gateway Selection Algorithm

Science.gov (United States)

Jie, Liu

With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. For mobile nodes in Ad Hoc network to internet, internet communications in the peer nodes must be achieved through the gateway. Therefore, the key Ad Hoc Access Networks will focus on the discovery gateway, as well as gateway selection in the case of multi-gateway and handover problems between different gateways. This paper considers the mobile node and the gateway, based on the average number of hops from an average access time and the stability of routes, improved gateway selection algorithm were proposed. An improved gateway selection algorithm, which mainly considers the algorithm can improve the access time of Ad Hoc nodes and the continuity of communication between the gateways, were proposed. This can improve the quality of communication across the network.

Exploiting Mobile Ad Hoc Networking and Knowledge Generation to Achieve Ambient Intelligence

Directory of Open Access Journals (Sweden)

Anna Lekova

2012-01-01

Full Text Available Ambient Intelligence (AmI joins together the fields of ubiquitous computing and communications, context awareness, and intelligent user interfaces. Energy, fault-tolerance, and mobility are newly added dimensions of AmI. Within the context of AmI the concept of mobile ad hoc networks (MANETs for “anytime and anywhere” is likely to play larger roles in the future in which people are surrounded and supported by small context-aware, cooperative, and nonobtrusive devices that will aid our everyday life. The connection between knowledge generation and communication ad hoc networking is symbiotic—knowledge generation utilizes ad hoc networking to perform their communication needs, and MANETs will utilize the knowledge generation to enhance their network services. The contribution of the present study is a distributed evolving fuzzy modeling framework (EFMF to observe and categorize relationships and activities in the user and application level and based on that social context to take intelligent decisions about MANETs service management. EFMF employs unsupervised online one-pass fuzzy clustering method to recognize nodes' mobility context from social scenario traces and ubiquitously learn “friends” and “strangers” indirectly and anonymously.

Intrusion detection in wireless ad-hoc networks

CERN Document Server

Chaki, Nabendu

2014-01-01

Presenting cutting-edge research, Intrusion Detection in Wireless Ad-Hoc Networks explores the security aspects of the basic categories of wireless ad-hoc networks and related application areas. Focusing on intrusion detection systems (IDSs), it explains how to establish security solutions for the range of wireless networks, including mobile ad-hoc networks, hybrid wireless networks, and sensor networks.This edited volume reviews and analyzes state-of-the-art IDSs for various wireless ad-hoc networks. It includes case studies on honesty-based intrusion detection systems, cluster oriented-based

Cognitive radio application for vehicular ad hoc networks (VANETS

Directory of Open Access Journals (Sweden)

Miladić Suzana D.

2016-01-01

Full Text Available This paper presents the application of cognitive radio technology in vehicular ad-hoc networks aimed to improve the communications between vehicles themselves as well as between vehicles and roadside infrastructure. Due to dynamic approach of spectrum access, cognitive radio is a technology that enables more efficient usage of radio-frequency spectrum. We review actual approaches and discuss research challenges related to the use of cognitive radio technology in vehicular ad hoc networks with emphasis on architecture, spectrum management as well as QoS optimization. The researching on cognitive radio application in vehicular networks is still developing and there are not many experimental platforms due to their complex setups. Some related research projects and cognitive radio realizations are provided in this paper.

Challenges of evidence acquisition in wireless ad-hoc networks

CSIR Research Space (South Africa)

Mutanga, MB

2010-05-01

Full Text Available a big challenge. Thus, the aim of this paper is to explore the challenges of acquiring live evidence in wireless ad-hoc networks. We also give some legal requirements of evidence admissibility as outlined in the Communications and Transactions Act...

User-centred and context-aware identity management in mobile ad-hoc networks

CERN Document Server

Arabo, Abdullahi

2013-01-01

The emergent notion of ubiquitous computing makes it possible for mobile devices to communicate and provide services via networks connected in an ad-hoc manner. These have resulted in the proliferation of wireless technologies such as Mobile Ad-hoc Networks (MANets), which offer attractive solutions for services that need flexible setup as well as dynamic and low cost wireless connectivity. However, the growing trend outlined above also raises serious concerns over Identity Management (IM) du...

LAMAN: Load Adaptable MAC for Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Realp Marc

2005-01-01

Full Text Available In mobile ad hoc radio networks, mechanisms on how to access the radio channel are extremely important in order to improve network efficiency. In this paper, the load adaptable medium access control for ad hoc networks (LAMAN protocol is described. LAMAN is a novel decentralized multipacket MAC protocol designed following a cross-layer approach. Basically, this protocol is a hybrid CDMA-TDMA-based protocol that aims at throughput maximization in multipacket communication environments by efficiently combining contention and conflict-free protocol components. Such combination of components is used to adapt the nodes' access priority to changes on the traffic load while, at the same time, accounting for the multipacket reception (MPR capability of the receivers. A theoretical analysis of the system is developed presenting closed expressions of network throughput and packet delay. By simulations the validity of our analysis is shown and the performances of a LAMAN-based system and an Aloha-CDMA-based one are compared.

A Spontaneous Ad Hoc Network to Share WWW Access

Directory of Open Access Journals (Sweden)

Lloret Jaime

2010-01-01

Full Text Available In this paper, we propose a secure spontaneous ad-hoc network, based on direct peer-to-peer interaction, to grant a quick, easy, and secure access to the users to surf the Web. The paper shows the description of our proposal, the procedure of the nodes involved in the system, the security algorithms implemented, and the designed messages. We have taken into account the security and its performance. Although some people have defined and described the main features of spontaneous ad-hoc networks, nobody has published any design and simulation until today. Spontaneous networking will enable a more natural form of wireless computing when people physically meet in the real world. We also validate the success of our proposal through several simulations and comparisons with a regular architecture, taking into account the optimization of the resources of the devices. Finally, we compare our proposal with other caching techniques published in the related literature. The proposal has been developed with the main objective of improving the communication and integration between different study centers of low-resource communities. That is, it lets communicate spontaneous networks, which are working collaboratively and which have been created on different physical places.

Energy-Efficient Cluster Based Routing Protocol in Mobile Ad Hoc Networks Using Network Coding

OpenAIRE

Srinivas Kanakala; Venugopal Reddy Ananthula; Prashanthi Vempaty

2014-01-01

In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of wireless networks. COPE protocol implements network coding concept to reduce number of transmissions by mixing the packets at intermediate nodes. We incorporate COPE into cluster based routing proto...

Ad hoc Sensor Networks to Support Maritime Interdiction Operations

OpenAIRE

Osmundson, John; Bordetsky, Alex

2014-01-01

Networking sensors, decision centers, and boarding parties supports success in Maritime Interdiction Operations. Led by a team from Naval Post-graduate School (NPS), experiments were conducted in 2012 to test the use of ad-hoc, self-forming communication networks to link sensors, people, and decision centers. The experiments involved international participants and successfully shared valuable biometric and radiological sensor data between boarding parties and decis...

Adaptive Demand-Driven Multicast Routing in Multi-Hop Wireless Ad Hoc Networks

National Research Council Canada - National Science Library

Jetcheva, Jorjeta G

2004-01-01

...) nodes that wish to communicate. Each node in the ad hoc network acts as a router and forwards packets on behalf of other nodes, allowing nodes that are not within wireless range of each other to communicate over multi-hop paths...

Worm epidemics in wireless ad hoc networks

Energy Technology Data Exchange (ETDEWEB)

Nekovee, Maziar [BT Research, Polaris 134, Adastral Park, Martlesham, Suffolk IP5 3RE (United Kingdom); Centre for Computational Science, University College London, 20 Gordon Street, London WC1H 0AJ (United Kingdom)

2007-06-15

A dramatic increase in the number of computing devices with wireless communication capability has resulted in the emergence of a new class of computer worms which specifically target such devices. The most striking feature of these worms is that they do not require Internet connectivity for their propagation but can spread directly from device to device using a short-range radio communication technology, such as WiFi or Bluetooth. In this paper, we develop a new model for epidemic spreading of these worms and investigate their spreading in wireless ad hoc networks via extensive Monte Carlo simulations. Our studies show that the threshold behaviour and dynamics of worm epidemics in these networks are greatly affected by a combination of spatial and temporal correlations which characterize these networks, and are significantly different from the previously studied epidemics in the Internet.

Worm epidemics in wireless ad hoc networks

Science.gov (United States)

Nekovee, Maziar

2007-06-01

A dramatic increase in the number of computing devices with wireless communication capability has resulted in the emergence of a new class of computer worms which specifically target such devices. The most striking feature of these worms is that they do not require Internet connectivity for their propagation but can spread directly from device to device using a short-range radio communication technology, such as WiFi or Bluetooth. In this paper, we develop a new model for epidemic spreading of these worms and investigate their spreading in wireless ad hoc networks via extensive Monte Carlo simulations. Our studies show that the threshold behaviour and dynamics of worm epidemics in these networks are greatly affected by a combination of spatial and temporal correlations which characterize these networks, and are significantly different from the previously studied epidemics in the Internet.

Worm epidemics in wireless ad hoc networks

International Nuclear Information System (INIS)

Nekovee, Maziar

2007-01-01

A dramatic increase in the number of computing devices with wireless communication capability has resulted in the emergence of a new class of computer worms which specifically target such devices. The most striking feature of these worms is that they do not require Internet connectivity for their propagation but can spread directly from device to device using a short-range radio communication technology, such as WiFi or Bluetooth. In this paper, we develop a new model for epidemic spreading of these worms and investigate their spreading in wireless ad hoc networks via extensive Monte Carlo simulations. Our studies show that the threshold behaviour and dynamics of worm epidemics in these networks are greatly affected by a combination of spatial and temporal correlations which characterize these networks, and are significantly different from the previously studied epidemics in the Internet

Collaboration Layer for Robots in Mobile Ad-hoc Networks

DEFF Research Database (Denmark)

Borch, Ole; Madsen, Per Printz; Broberg, Jacob Honor´e

2009-01-01

In many applications multiple robots in Mobile Ad-hoc Networks are required to collaborate in order to solve a task. This paper shows by proof of concept that a Collaboration Layer can be modelled and designed to handle the collaborative communication, which enables robots in small to medium size...

An Effective Approach for Mobile ad hoc Network via I-Watchdog Protocol

Directory of Open Access Journals (Sweden)

Nidhi Lal

2014-12-01

Full Text Available Mobile ad hoc network (MANET is now days become very famous due to their fixed infrastructure-less quality and dynamic nature. They contain a large number of nodes which are connected and communicated to each other in wireless nature. Mobile ad hoc network is a wireless technology that contains high mobility of nodes and does not depend on the background administrator for central authority, because they do not contain any infrastructure. Nodes of the MANET use radio wave for communication and having limited resources and limited computational power. The Topology of this network is changing very frequently because they are distributed in nature and self-configurable. Due to its wireless nature and lack of any central authority in the background, Mobile ad hoc networks are always vulnerable to some security issues and performance issues. The security imposes a huge impact on the performance of any network. Some of the security issues are black hole attack, flooding, wormhole attack etc. In this paper, we will discuss issues regarding low performance of Watchdog protocol used in the MANET and proposed an improved Watchdog mechanism, which is called by I-Watchdog protocol that overcomes the limitations of Watchdog protocol and gives high performance in terms of throughput, delay.

Context discovery in ad-hoc networks

NARCIS (Netherlands)

Liu, F.

2011-01-01

With the rapid development of wireless technology and portable devices, mobile ad-hoc networks (MANETs) are more and more present in our daily life. Ad-hoc networks are often composed of mobile and battery-supplied devices, like laptops, mobile phones, and PDAs. With no requirement for

Multicasting in Wireless Communications (Ad-Hoc Networks): Comparison against a Tree-Based Approach

Science.gov (United States)

Rizos, G. E.; Vasiliadis, D. C.

2007-12-01

We examine on-demand multicasting in ad hoc networks. The Core Assisted Mesh Protocol (CAMP) is a well-known protocol for multicast routing in ad-hoc networks, generalizing the notion of core-based trees employed for internet multicasting into multicast meshes that have much richer connectivity than trees. On the other hand, wireless tree-based multicast routing protocols use much simpler structures for determining route paths, using only parent-child relationships. In this work, we compare the performance of the CAMP protocol against the performance of wireless tree-based multicast routing protocols, in terms of two important factors, namely packet delay and ratio of dropped packets.

Routing Protocol for Mobile Ad-hoc Wireless Networks

Directory of Open Access Journals (Sweden)

I. M. B. Nogales

2007-09-01

Full Text Available Bluetooth is a cutting-edge technology used for implementing wireless ad hoc networks. In order to provide an overall scheme for mobile ad hoc networks, this paper deals with scatternet topology formation and routing algorithm to form larger ad hoc wireless Networks. Scatternet topology starts by forming a robust network, which is less susceptible to the problems posed by node mobility. Mobile topology relies on the presence of free nodes that create multiple connections with the network and on their subsequently rejoining the network. Our routing protocol is a proactive routing protocol, which is tailor made for the Bluetooth ad hoc network. The connection establishment connects nodes in a structure that simplifies packet routing and scheduling. The design allows nodes to arrive and leave arbitrarily, incrementally building the topology and healing partitions when they occur. We present simulation results that show that the algorithm presents low formation latency and also generates an efficient topology for forwarding packets along ad-hoc wireless networks.

A Survey on Trust Management for Mobile Ad Hoc Networks

Science.gov (United States)

2011-11-01

expects, trust is dangerous implying the possible betrayal of trust. In his comments on Lagerspetz’s book titled Trust: The Tacit Demand, Lahno [24...AODV Zouridaki et al. (2005 ) [79] (2006) [80] Secure routing Direct observation [79][80] Reputation by secondhand information [80] Packet dropping...areas of signal processing, wireless communications, sensor and mobile ad hoc networks. He is co-editor of the book Wireless Sensor Networks: Signal

Mobile agents affect worm spreading in wireless ad hoc networks

International Nuclear Information System (INIS)

Huang, Zi-Gang; Sun, Jin-Tu; Wang, Ying-Hai; Wang, Sheng-Jun; Xu, Xin-Jian

2009-01-01

Considering the dynamic nature of portable computing devices with wireless communication capability, an extended model is introduced for worm spreading in the wireless ad hoc network, with a population of mobile agents in a planar distribution, starting from an initial infected seed. The effect of agents' mobility on worm spreading is investigated via extensive Monte Carlo simulations. The threshold behavior and the dynamics of worm epidemics in the wireless networks are greatly affected by both agents' mobility and spatial and temporal correlations. The medium access control mechanism for the wireless communication promotes the sensitivity of the spreading dynamics to agents' mobility

Cross-Layer Design Approach for Power Control in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

A. Sarfaraz Ahmed

2015-03-01

Full Text Available In mobile ad hoc networks, communication among mobile nodes occurs through wireless medium The design of ad hoc network protocol, generally based on a traditional “layered approach”, has been found ineffective to deal with receiving signal strength (RSS-related problems, affecting the physical layer, the network layer and transport layer. This paper proposes a design approach, deviating from the traditional network design, toward enhancing the cross-layer interaction among different layers, namely physical, MAC and network. The Cross-Layer design approach for Power control (CLPC would help to enhance the transmission power by averaging the RSS values and to find an effective route between the source and the destination. This cross-layer design approach was tested by simulation (NS2 simulator and its performance over AODV was found to be better.

Ad Hoc Wireless Networking and Shared Computation for Autonomous Multirobot Systems

OpenAIRE

Bevilacqua, Riccardo; Hall, Jason S.; Horning, James; Romano, Marcello

2009-01-01

The article of record as published may be located at http://dx.doi.org/10.2514/1.40734 A wireless ad hoc network is introduced that enables inter-robot communication and shared computation among multiple robots with PC/104-based single board computers running the real-time application interface patched Linux operating system. Through the use of IEEE 802.11 ad hoc technology and User Datagram Protocol, each robot is able to exchange data without the need of a centralized router ...

Performance evaluation of a multi-radio, multi-hop ad-hoc radio communication network for Communications-Based Train Control (CBTC)

DEFF Research Database (Denmark)

Farooq, Jahanzeb; Bro, Lars; Karstensen, Rasmus Thystrup

2017-01-01

Communications-Based Train Control (CBTC) is a modern signalling system that uses radio communication to transfer train control information between the train and the wayside. A vast majority of CBTC systems worldwide use IEEE 802.11 Wi-Fi as the radio technology mostly due to its costeffectiveness....... The trackside networks in these systems are mostly based on conventional infrastructure Wi-Fi. It means a train has to continuously associate (i.e. perform handshake) with the trackside Wi-Fi Access Points (AP) as it moves. This is a timeconsuming process associated with a certain delay. Additionally, these APs...... are connected to the wayside infrastructure via optical fiber cables that incurs huge costs. This paper presents a novel design in which trackside nodes function in ad-hoc Wi-Fi mode, which means no association has to be performed with them prior to transmitting. A train simply broadcasts packets to any nodes...

Innovative research of AD HOC network mobility model

Science.gov (United States)

Chen, Xin

2017-08-01

It is difficult for researchers of AD HOC network to conduct actual deployment during experimental stage as the network topology is changeable and location of nodes is unfixed. Thus simulation still remains the main research method of the network. Mobility model is an important component of AD HOC network simulation. It is used to describe the movement pattern of nodes in AD HOC network (including location and velocity, etc.) and decides the movement trail of nodes, playing as the abstraction of the movement modes of nodes. Therefore, mobility model which simulates node movement is an important foundation for simulation research. In AD HOC network research, mobility model shall reflect the movement law of nodes as truly as possible. In this paper, node generally refers to the wireless equipment people carry. The main research contents include how nodes avoid obstacles during movement process and the impacts of obstacles on the mutual relation among nodes, based on which a Node Self Avoiding Obstacle, i.e. NASO model is established in AD HOC network.

ENERGY EFFICIENT ROUTING PROTOCOLS FOR WIRELESS AD HOC NETWORKS – A SURVEY

Directory of Open Access Journals (Sweden)

K. Sankar

2012-06-01

Full Text Available Reducing energy consumption, primarily with the goal of extending the lifetime of battery-powered devices, has emerged as a fundamental challenge in wireless communication. The performance of the medium access control (MAC scheme not only has a fairly significant end-result on the behaviour of the routing approach employed, but also on the energy consumption of the wireless network interface card (NIC. We investigate the inadequacies of the MAC schemes designed for ad hoc wireless networks in the context of power awareness herein. The topology changes due to uncontrollable factors such as node mobility, weather, interference, noise, as well as on controllable parameters such as transmission power and antenna direction results in significant amount of energy loss. Controlling rapid topology changes by minimizing the maximum transmission power used in ad hoc wireless networks, while still maintaining networks connectivity can prolong battery life and hence network lifetime considerably. In addition, we systematically explore the potential energy consumption pitfalls of non–power-based and power based routing schemes. We suggest a thorough energy-based performance survey of energy aware routing protocols for wireless mobile ad-hoc networks. We also present the statistical performance metrics measured by our simulations.

Performance Analysis of Hierarchical Group Key Management Integrated with Adaptive Intrusion Detection in Mobile ad hoc Networks

Science.gov (United States)

2016-04-05

applications in wireless networks such as military battlefields, emergency response, mobile commerce , online gaming, and collaborative work are based on the...www.elsevier.com/locate/peva Performance analysis of hierarchical group key management integrated with adaptive intrusion detection in mobile ad hoc...Accepted 19 September 2010 Available online 26 September 2010 Keywords: Mobile ad hoc networks Intrusion detection Group communication systems Group

Contribution to design a communication framework for vehicular ad hoc networks in urban scenarios

OpenAIRE

Tripp Barba, Carolina

2013-01-01

La movilidad constante de las personas y la creciente necesidad de estar conectados en todo momento ha hecho de las redes vehiculares un área cuyo interés ha ido en aumento. La gran cantidad de vehículos que hay en la actualidad, y los avances tecnológicos han hecho de las redes vehiculares (VANETS, Vehicular Ad hoc Networks) un gran campo de investigación. Las redes vehiculares son un tipo especial de redes móviles ad hoc inalámbricas, las cuales, al igual que las redes MANET (Mobile Ad hoc ...

Extending Service Area of IEEE 802.11 Ad Hoc Networks

Science.gov (United States)

Choi, Woo-Yong

2012-06-01

According to the current IEEE 802.11 wireless LAN standards, IEEE 802.11 ad hoc networks have the limitation that all STAs (Stations) are in the one-hop transmission range of each other. In this paper, to alleviate the limitation of IEEE 802.11 ad hoc networks we propose the efficient method for selecting the most appropriate pseudo AP (Access Point) from among the set of ad hoc STAs and extending the service area of IEEE 802.11 ad hoc networks by the pseudo AP's relaying the internal traffic of IEEE 802.11 ad hoc networks. Numerical examples show that the proposed method significantly extends the service area of IEEE 802.11 ad hoc networks.

Decentralized position verification in geographic ad hoc routing

NARCIS (Netherlands)

Leinmüller, Tim; Schoch, Elmar; Kargl, Frank; Maihöfer, Christian

Inter-vehicle communication is regarded as one of the major applications of mobile ad hoc networks (MANETs). Compared to MANETs or wireless sensor networks (WSNs), these so-called vehicular ad hoc networks (VANETs) have unique requirements on network protocols. The requirements result mainly from

Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

YongQiang Li

2018-01-01

Full Text Available For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR, is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.

Distributed generation of shared RSA keys in mobile ad hoc networks

Science.gov (United States)

Liu, Yi-Liang; Huang, Qin; Shen, Ying

2005-12-01

Mobile Ad Hoc Networks is a totally new concept in which mobile nodes are able to communicate together over wireless links in an independent manner, independent of fixed physical infrastructure and centralized administrative infrastructure. However, the nature of Ad Hoc Networks makes them very vulnerable to security threats. Generation and distribution of shared keys for CA (Certification Authority) is challenging for security solution based on distributed PKI(Public-Key Infrastructure)/CA. The solutions that have been proposed in the literature and some related issues are discussed in this paper. The solution of a distributed generation of shared threshold RSA keys for CA is proposed in the present paper. During the process of creating an RSA private key share, every CA node only has its own private security. Distributed arithmetic is used to create the CA's private share locally, and that the requirement of centralized management institution is eliminated. Based on fully considering the Mobile Ad Hoc network's characteristic of self-organization, it avoids the security hidden trouble that comes by holding an all private security share of CA, with which the security and robustness of system is enhanced.

Information Sharing Mechanism among Mobile Agents In Ad-hoc Network Environment and Its Applications

Directory of Open Access Journals (Sweden)

Kunio Umetsuji

2004-12-01

Full Text Available Mobile agents are programs that can move from one site to another in a network with their data and states. Mobile agents are expected to be an essential tool in pervasive computing. In multi platform environment, it is important to communicate with mobile agents only using their universal or logical name not using their physical locations. More, in an ad-hoc network environment, an agent can migrate autonomously and communicate with other agents on demand. It is difficult that mobile agent grasps the position information on other agents correctly each other, because mobile agent processes a task while moving a network successively. In order to realize on-demand mutual communication among mobile agents without any centralized servers, we propose a new information sharing mechanism within mobile agents. In this paper, we present a new information sharing mechanism within mobile agents. The method is a complete peer based and requires no agent servers to manage mobile agent locations. Therefore, a mobile agent can get another mobile agent, communicate with it and shares information stored in the agent without any knowledge of the location of the target mobile agent. The basic idea of the mechanism is an introduction of Agent Ring, Agent Chain and Shadow Agent. With this mechanism, each agent can communicate with other agents in a server-less environment, which is suitable for ad-hoc agent network and an agent system can manage agents search and communications efficiently.

Broadcast design in cognitive radio ad hoc networks

CERN Document Server

Song, Yi

2014-01-01

This SpringerBrief investigates the special challenges of broadcast design in cognitive radio (CR) ad hoc networks. It introduces two broadcast protocols in CR ad hoc networks: a quality-of-service based broadcast protocol under blind information and a fully-distributed broadcast protocol with collision avoidance. A novel unified analytical model is also presented to analyze the performance of the broadcast protocols. This is the first book dedicated to the unique broadcast design challenges in CR ad hoc networks. The authors also discuss the recent research on the performance analysis of broa

Accurate 3D Localization Method for Public Safety Applications in Vehicular Ad-hoc Networks

KAUST Repository

Ansari, Abdul Rahim; Saeed, Nasir; Haq, Mian Imtiaz Ul; Cho, Sunghyun

2018-01-01

Vehicular ad hoc networks (VANETs) represent a very promising research area because of their ever increasing demand, especially for public safety applications. In VANETs vehicles communicate with each other to exchange road maps and traffic

Ad hoc mobile wireless networks principles, protocols, and applications

CERN Document Server

Sarkar, Subir Kumar

2013-01-01

The military, the research community, emergency services, and industrial environments all rely on ad hoc mobile wireless networks because of their simple infrastructure and minimal central administration. Now in its second edition, Ad Hoc Mobile Wireless Networks: Principles, Protocols, and Applications explains the concepts, mechanism, design, and performance of these highly valued systems. Following an overview of wireless network fundamentals, the book explores MAC layer, routing, multicast, and transport layer protocols for ad hoc mobile wireless networks. Next, it examines quality of serv

Maximization of Energy Efficiency in Wireless ad hoc and Sensor Networks With SERENA

Directory of Open Access Journals (Sweden)

Saoucene Mahfoudh

2009-01-01

Full Text Available In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. SERENA is based on a two-hop coloring algorithm, whose complexity in terms of colors and rounds is evaluated. We then quantify the slot reuse. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks. We compare SERENA with classical TDMA and optimized variants such as USAP in wireless ad hoc and sensor networks.

Intelligent routing protocol for ad hoc wireless network

Science.gov (United States)

Peng, Chaorong; Chen, Chang Wen

2006-05-01

A novel routing scheme for mobile ad hoc networks (MANETs), which combines hybrid and multi-inter-routing path properties with a distributed topology discovery route mechanism using control agents is proposed in this paper. In recent years, a variety of hybrid routing protocols for Mobile Ad hoc wireless networks (MANETs) have been developed. Which is proactively maintains routing information for a local neighborhood, while reactively acquiring routes to destinations beyond the global. The hybrid protocol reduces routing discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the other side the hybrid routing protocols in MANETs likes Zone Routing Protocol still need route "re-discover" time when a route between zones link break. Sine the topology update information needs to be broadcast routing request on local zone. Due to this delay, the routing protocol may not be applicable for real-time data and multimedia communication. We utilize the advantages of a clustering organization and multi-routing path in routing protocol to achieve several goals at the same time. Firstly, IRP efficiently saves network bandwidth and reduces route reconstruction time when a routing path fails. The IRP protocol does not require global periodic routing advertisements, local control agents will automatically monitor and repair broke links. Secondly, it efficiently reduces congestion and traffic "bottlenecks" for ClusterHeads in clustering network. Thirdly, it reduces significant overheads associated with maintaining clusters. Fourthly, it improves clusters stability due to dynamic topology changing frequently. In this paper, we present the Intelligent Routing Protocol. First, we discuss the problem of routing in ad hoc networks and the motivation of IRP. We describe the hierarchical architecture of IRP. We describe the routing process and illustrate it with an example. Further, we describe the control manage

Wireless ad hoc networks access for aeronautical communications

OpenAIRE

Besse , Frédéric; Garcia , Fabien; Pirovano , Alain; Radzik , José

2010-01-01

International audience; There is an increasing interest in the current aeronautical context to offer new services for civil aircraft passengers. For example, airlines want to offer their customers the opportunity to access the Internet, to manage their mails, to watch video on demand, to access corporate VPNs.... All these services represent a new type of air-ground communications called APC (Aeronautical Passenger Communications) in the ATN (Aeronautical Telecommunication Network) context. I...

Enhancing On-Demand Multicast Routing Protocols using Mobility Prediction in Mobile Ad-hoc Network

Directory of Open Access Journals (Sweden)

Nermin Makhlouf

2014-08-01

Full Text Available A Mobile Ad hoc Network (MANET is a self-organizing wireless communication network in which mobile devices are based on no infrastructure like base stations or access points. Minimal configuration and quick deployment make ad hoc networks suitable for emergency situations like disaster recovery or military conflict. Since node mobility may cause links to be broken frequently, a very important issue for routing in MANETs is how to set reliable paths which can last as long as possible. To solve this problem, non-random behaviors for the mobility patterns that mobile users exhibit are exploited. This paper introduces a scheme to improve On-Demand Multicast Routing Protocol (ODMRP performances by using mobility prediction. 

Intelligent self-organization methods for wireless ad hoc sensor networks based on limited resources

Science.gov (United States)

Hortos, William S.

2006-05-01

A wireless ad hoc sensor network (WSN) is a configuration for area surveillance that affords rapid, flexible deployment in arbitrary threat environments. There is no infrastructure support and sensor nodes communicate with each other only when they are in transmission range. To a greater degree than the terminals found in mobile ad hoc networks (MANETs) for communications, sensor nodes are resource-constrained, with limited computational processing, bandwidth, memory, and power, and are typically unattended once in operation. Consequently, the level of information exchange among nodes, to support any complex adaptive algorithms to establish network connectivity and optimize throughput, not only deplete those limited resources and creates high overhead in narrowband communications, but also increase network vulnerability to eavesdropping by malicious nodes. Cooperation among nodes, critical to the mission of sensor networks, can thus be disrupted by the inappropriate choice of the method for self-organization. Recent published contributions to the self-configuration of ad hoc sensor networks, e.g., self-organizing mapping and swarm intelligence techniques, have been based on the adaptive control of the cross-layer interactions found in MANET protocols to achieve one or more performance objectives: connectivity, intrusion resistance, power control, throughput, and delay. However, few studies have examined the performance of these algorithms when implemented with the limited resources of WSNs. In this paper, self-organization algorithms for the initiation, operation and maintenance of a network topology from a collection of wireless sensor nodes are proposed that improve the performance metrics significant to WSNs. The intelligent algorithm approach emphasizes low computational complexity, energy efficiency and robust adaptation to change, allowing distributed implementation with the actual limited resources of the cooperative nodes of the network. Extensions of the

Client-Server and Peer-to-Peer Ad-hoc Network for a Flexible Learning Environment

Directory of Open Access Journals (Sweden)

Ferial Khaddage

2011-01-01

Full Text Available Peer-to-Peer (P2P networking in a mobile learning environment has become a popular topic of research. One of the new emerging research ideas is on the ability to combine P2P network with server-based network to form a strong efficient portable and compatible network infrastructure. This paper describes a unique mobile network architecture, which reflects the on-campus students’ need for a mobile learning environment. This can be achieved by combining two different networks, client-server and peer-to-peer ad-hoc to form a sold and secure network. This is accomplished by employing one peer within the ad-hoc network to act as an agent-peer to facilitate communication and information sharing between the two networks. It can be implemented without any major changes to the current network technologies, and can combine any wireless protocols such as GPRS, Wi-Fi, Bluetooth, and 3G.

Ad hoc networks telecommunications and game theory

CERN Document Server

Benslama, Malek; Batatia, Hadj

2015-01-01

Random SALOHA and CSMA protocols that are used to access MAC in ad hoc networks are very small compared to the multiple and spontaneous use of the transmission channel. So they have low immunity to the problems of packet collisions. Indeed, the transmission time is the critical factor in the operation of such networks. The simulations demonstrate the positive impact of erasure codes on the throughput of the transmission in ad hoc networks. However, the network still suffers from the intermittency and volatility of its efficiency throughout its operation, and it switches quickly to the satura

Implementing voice over Internet protocol in mobile ad hoc network – analysing its features regarding efficiency, reliability and security

Directory of Open Access Journals (Sweden)

Naveed Ahmed Sheikh

2014-05-01

Full Text Available Providing secure and efficient real-time voice communication in mobile ad hoc network (MANET environment is a challenging problem. Voice over Internet protocol (VoIP has originally been developed over the past two decades for infrastructure-based networks. There are strict timing constraints for acceptable quality VoIP services, in addition to registration and discovery issues in VoIP end-points. In MANETs, ad hoc nature of networks and multi-hop wireless environment with significant packet loss and delays present formidable challenges to the implementation. Providing a secure real-time VoIP service on MANET is the main design objective of this paper. The authors have successfully developed a prototype system that establishes reliable and efficient VoIP communication and provides an extremely flexible method for voice communication in MANETs. The authors’ cooperative mesh-based MANET implementation can be used for rapidly deployable VoIP communication with survivable and efficient dynamic networking using open source software.

Performance analysis and implementation of proposed mechanism for detection and prevention of security attacks in routing protocols of vehicular ad-hoc network (VANET

Directory of Open Access Journals (Sweden)

Parul Tyagi

2017-07-01

Full Text Available Next-generation communication networks have become widely popular as ad-hoc networks, broadly categorized as the mobile nodes based on mobile ad-hoc networks (MANET and the vehicular nodes based vehicular ad-hoc networks (VANET. VANET is aimed at maintaining safety to vehicle drivers by begin autonomous communication with the nearby vehicles. Each vehicle in the ad-hoc network performs as an intelligent mobile node characterized by high mobility and formation of dynamic networks. The ad-hoc networks are decentralized dynamic networks that need efficient and secure communication requirements due to the vehicles being persistently in motion. These networks are more susceptible to various attacks like Warm Hole attacks, denial of service attacks and Black Hole Attacks. The paper is a novel attempt to examine and investigate the security features of the routing protocols in VANET, applicability of AODV (Ad hoc On Demand protocol to detect and tackle a particular category of network attacks, known as the Black Hole Attacks. A new algorithm is proposed to enhance the security mechanism of AODV protocol and to introduce a mechanism to detect Black Hole Attacks and to prevent the network from such attacks in which source node stores all route replies in a look up table. This table stores the sequences of all route reply, arranged in ascending order using PUSH and POP operations. The priority is calculated based on sequence number and discard the RREP having presumably very high destination sequence number. The result show that proposed algorithm for detection and prevention of Black Hole Attack increases security in Intelligent Transportation System (ITS and reduces the effect of malicious node in the VANET. NCTUNs simulator is used in this research work.

Ad hoc mobile wireless networks principles, protocols and applications

CERN Document Server

Sarkar, Subir Kumar; Puttamadappa, C

2007-01-01

Ad hoc mobile wireless networks have seen increased adaptation in a variety of disciplines because they can be deployed with simple infrastructures and virtually no central administration. In particular, the development of ad hoc wireless and sensor networks provides tremendous opportunities in areas including disaster recovery, defense, health care, and industrial environments. Ad Hoc Mobile Wireless Networks: Principles, Protocols and Applications explains the concepts, mechanisms, design, and performance of these systems. It presents in-depth explanations of the latest wireless technologies

The 11th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2012)

NARCIS (Netherlands)

Pitsillides, A.; Douligeris, C.; Vassiliou, V.; Heijenk, Geert; Cavalcante de Oliveira, J.

Message from the General Chairs Welcome to the 2012 Mediterranean Ad Hoc Networking Workshop in Ayia Napa, Cyprus. We are excited to host Med-Hoc-Net. As a major annual international workshop, following recent successful workshops in Sicily (2006), Corfu (2007), Palma de Mallorca (2008), Haifa

Enabling Real-Time Video Services over Ad-Hoc Networks Opens the Gates for E-learning in Areas Lacking Infrastructure

Directory of Open Access Journals (Sweden)

Johannes Karlsson

2009-10-01

Full Text Available In this paper we suggest a promising solution to come over the problems of delivering e-learning to areas with lack or deficiencies in infrastructure for Internet and mobile communication. We present a simple, reasonably priced and efficient communication platform for providing e-learning. This platform is based on wireless ad-hoc networks. We also present a preemptive routing protocol suitable for real-time video communication over wireless ad-hoc networks. Our results show that this routing protocol can significantly improve the quality of the received video. This makes our suggested system not only good to overcome the infrastructure barrier but even capable of delivering a high quality e-learning material.

Cross-Layer QoS Control for Video Communications over Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Pei Yong

2005-01-01

Full Text Available Assuming a wireless ad hoc network consisting of homogeneous video users with each of them also serving as a possible relay node for other users, we propose a cross-layer rate-control scheme based on an analytical study of how the effective video transmission rate is affected by the prevailing operating parameters, such as the interference environment, the number of transmission hops to a destination, and the packet loss rate. Furthermore, in order to provide error-resilient video delivery over such wireless ad hoc networks, a cross-layer joint source-channel coding (JSCC approach, to be used in conjunction with rate-control, is proposed and investigated. This approach attempts to optimally apply the appropriate channel coding rate given the constraints imposed by the effective transmission rate obtained from the proposed rate-control scheme, the allowable real-time video play-out delay, and the prevailing channel conditions. Simulation results are provided which demonstrate the effectiveness of the proposed cross-layer combined rate-control and JSCC approach.

Ad Hoc on-Demand Distance Vector (AODV Routing Protocol Performance Evaluation on Hybrid Ad Hoc Network: Comparison of Result of Ns-2 Simulation and Implementation on Testbed using PDA

Directory of Open Access Journals (Sweden)

Riri Sari

2010-10-01

Full Text Available In Mobile Ad hoc NETwork (MANET, node supplemented with wireless equipment has the capacity to manage and organise autonomously, without the presence of network infrastructures. Hybrid ad hoc network, enable several nodes to move freely (mobile to create instant communication. Independent from infrastructure. They could access the Local Area Network (LAN or the Internet. Functionalities of ad hoc network very much dependent on the routing protocol that determines the routing around node. Ad hoc On-demand Distance Vector (AODV is one of routing protocols in ad hoc network which has a reactive characteristic. This protocol is the most common protocol being researched and used. In this Research, AODV protocol investigation was conducted by developing a testbed using Personal Computer, several Laptops (the Linux Red Hat operation system 9.0 and Fedora Core 2, and Personal Digital Assistant (PDA. This research also made a complete package by mean of cross compilation for PDA iPAQ. In general, results obtained from the simulation of AODV protocol using Network Simulator NS-2 are packet delivery ratio 99.89%, end-to-end delay of 0.14 seconds and routing overhead of 1,756.61 byte per second. Afterwards results from simulation were compared to results from testbed. Results obtained from testbed are as follows: the packet delivery ratio is 99.57%, the end-to-end delay is 1.004 seconds and the routing overhead is 1,360.36 byte per second.

Analysis of Pervasive Mobile Ad Hoc Routing Protocols

Science.gov (United States)

Qadri, Nadia N.; Liotta, Antonio

Mobile ad hoc networks (MANETs) are a fundamental element of pervasive networks and therefore, of pervasive systems that truly support pervasive computing, where user can communicate anywhere, anytime and on-the-fly. In fact, future advances in pervasive computing rely on advancements in mobile communication, which includes both infrastructure-based wireless networks and non-infrastructure-based MANETs. MANETs introduce a new communication paradigm, which does not require a fixed infrastructure - they rely on wireless terminals for routing and transport services. Due to highly dynamic topology, absence of established infrastructure for centralized administration, bandwidth constrained wireless links, and limited resources in MANETs, it is challenging to design an efficient and reliable routing protocol. This chapter reviews the key studies carried out so far on the performance of mobile ad hoc routing protocols. We discuss performance issues and metrics required for the evaluation of ad hoc routing protocols. This leads to a survey of existing work, which captures the performance of ad hoc routing algorithms and their behaviour from different perspectives and highlights avenues for future research.

Multiagent Based Information Dissemination in Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

S.S. Manvi

2009-01-01

Full Text Available Vehicular Ad hoc Networks (VANETs are a compelling application of ad hoc networks, because of the potential to access specific context information (e.g. traffic conditions, service updates, route planning and deliver multimedia services (Voice over IP, in-car entertainment, instant messaging, etc.. This paper proposes an agent based information dissemination model for VANETs. A two-tier agent architecture is employed comprising of the following: 1 'lightweight', network-facing, mobile agents; 2 'heavyweight', application-facing, norm-aware agents. The limitations of VANETs lead us to consider a hybrid wireless network architecture that includes Wireless LAN/Cellular and ad hoc networking for analyzing the proposed model. The proposed model provides flexibility, adaptability and maintainability for traffic information dissemination in VANETs as well as supports robust and agile network management. The proposed model has been simulated in various network scenarios to evaluate the effectiveness of the approach.

Scaling of Airborne Ad-hoc Network Metrics with Link Range and Satellite Connectivity

Directory of Open Access Journals (Sweden)

Kai-Daniel BÜCHTER

2018-06-01

Full Text Available In this contribution, large-scale commercial aeronautical ad-hoc networks are evaluated. The investigation is based on a simulation environment with input from 2016 flight schedule and aircraft performance databases for flight movement modelling, along with a defined infrastructure of ground gateways and communication satellites. A cluster-based algorithm is used to build the communication network topology between aircraft. Cloud top pressure data can be considered to estimate cloud height and evaluate the impact of link obscuration on network availability, assuming a free-space optics-based communication network. The effects of communication range, satellite availability, fleet equipage ratio and clouds are discussed. It is shown how network reach and performance can be enhanced by adding taps to the network in the form of high-speed satellite links. The effect of adding these is two-fold: firstly, network reach can be increased by connecting remote aircraft clusters. Secondly, larger clusters can effectively be split into smaller ones in order to increase performance especially with regard to hop count and available overall capacity. In a realistic scenario concerning communication range and with moderate numbers of high-speed satellite terminals, on average, 78% of all widebody aircraft can be reached. With clouds considered (assuming laser links, this number reduces by 10%.

Internet-Based Mobile Ad Hoc Networking (Preprint)

National Research Council Canada - National Science Library

Corson, M. S; Macker, Joseph P; Cirincione, Gregory H

1999-01-01

Internet-based Mobile Ad Hoc Networking is an emerging technology that supports self-organizing, mobile networking infrastructures, and is one which appears well-suited for use in future commercial...

Evolutionary algorithms for mobile ad hoc networks

CERN Document Server

Dorronsoro, Bernabé; Danoy, Grégoire; Pigné, Yoann; Bouvry, Pascal

2014-01-01

Describes how evolutionary algorithms (EAs) can be used to identify, model, and minimize day-to-day problems that arise for researchers in optimization and mobile networking. Mobile ad hoc networks (MANETs), vehicular networks (VANETs), sensor networks (SNs), and hybrid networks—each of these require a designer’s keen sense and knowledge of evolutionary algorithms in order to help with the common issues that plague professionals involved in optimization and mobile networking. This book introduces readers to both mobile ad hoc networks and evolutionary algorithms, presenting basic concepts as well as detailed descriptions of each. It demonstrates how metaheuristics and evolutionary algorithms (EAs) can be used to help provide low-cost operations in the optimization process—allowing designers to put some “intelligence” or sophistication into the design. It also offers efficient and accurate information on dissemination algorithms topology management, and mobility models to address challenges in the ...

Vehicular ad hoc networks standards, solutions, and research

CERN Document Server

Molinaro, Antonella; Scopigno, Riccardo

2015-01-01

This book presents vehicular ad-hoc networks (VANETs) from the their onset, gradually going into technical details, providing a clear understanding of both theoretical foundations and more practical investigation. The editors gathered top-ranking authors to provide comprehensiveness and timely content; the invited authors were carefully selected from a list of who’s who in the respective field of interest: there are as many from Academia as from Standardization and Industry sectors from around the world. The covered topics are organized around five Parts starting from an historical overview of vehicular communications and standardization/harmonization activities (Part I), then progressing to the theoretical foundations of VANETs and a description of the day-one standard-compliant solutions (Part II), hence going into details of vehicular networking and security (Part III) and to the tools to study VANETs, from mobility and channel models, to network simulators and field trial methodologies (Part IV), and fi...

A Game Theory Based Approach for Power Efficient Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Kun Hua

2017-01-01

Full Text Available Green communications are playing critical roles in vehicular ad hoc networks (VANETs, while the deployment of a power efficient VANET is quite challenging in practice. To add more greens into such kind of complicated and time-varying mobile network, we specifically investigate the throughput and transmission delay performances for real-time and delay sensitive services through a repeated game theoretic solution. This paper has employed Nash Equilibrium in the noncooperative game model and analyzes its efficiency. Simulation results have shown an obvious improvement on power efficiency through such efforts.

Secure Adaptive Topology Control for Wireless Ad-Hoc Sensor Networks

Directory of Open Access Journals (Sweden)

Yen-Chieh Ouyang

2010-02-01

Full Text Available This paper presents a secure decentralized clustering algorithm for wireless ad-hoc sensor networks. The algorithm operates without a centralized controller, operates asynchronously, and does not require that the location of the sensors be known a priori. Based on the cluster-based topology, secure hierarchical communication protocols and dynamic quarantine strategies are introduced to defend against spam attacks, since this type of attacks can exhaust the energy of sensor nodes and will shorten the lifetime of a sensor network drastically. By adjusting the threshold of infected percentage of the cluster coverage, our scheme can dynamically coordinate the proportion of the quarantine region and adaptively achieve the cluster control and the neighborhood control of attacks. Simulation results show that the proposed approach is feasible and cost effective for wireless sensor networks.

Enhanced Secure Trusted AODV (ESTA Protocol to Mitigate Blackhole Attack in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Dilraj Singh

2015-09-01

Full Text Available The self-organizing nature of the Mobile Ad hoc Networks (MANETs provide a communication channel anywhere, anytime without any pre-existing network infrastructure. However, it is exposed to various vulnerabilities that may be exploited by the malicious nodes. One such malicious behavior is introduced by blackhole nodes, which can be easily introduced in the network and, in turn, such nodes try to crumble the working of the network by dropping the maximum data under transmission. In this paper, a new protocol is proposed which is based on the widely used Ad hoc On-Demand Distance Vector (AODV protocol, Enhanced Secure Trusted AODV (ESTA, which makes use of multiple paths along with use of trust and asymmetric cryptography to ensure data security. The results, based on NS-3 simulation, reveal that the proposed protocol is effectively able to counter the blackhole nodes in three different scenarios.

Secure neighborhood discovery: A fundamental element for mobile ad hoc networking

DEFF Research Database (Denmark)

Papadimitratos, P.; Poturalski, M.; Schaller, P.

2008-01-01

Pervasive computing systems will likely be deployed in the near future, with the proliferation of wireless devices and the emergence of ad hoc networking as key enablers. Coping with mobility and the volatility of wireless communications in such systems is critical. Neighborhood discovery (ND......) - the discovery of devices directly reachable for communication or in physical proximity - becomes a fundamental requirement and building block for various applications. However, the very nature of wireless mobile networks makes it easy to abuse ND and thereby compromise the overlying protocols and applications....... Thus, providing methods to mitigate this vulnerability and secure ND is crucial. In this article we focus on this problem and provide definitions of neighborhood types and ND protocol properties, as well as a broad classification of attacks. Our ND literature survey reveals that securing ND is indeed...

PERFORMANCE ANALYSIS OF DSR ROUTING PROTOCOL UNDER ENERGY BASED SELFISH ATTACK IN MOBILE AD HOC NETWORKS

Directory of Open Access Journals (Sweden)

T.V.P.Sundararajan

2010-06-01

Full Text Available Mobile Ad hoc Networks (MANETs rely on the cooperation of all participating nodes to provide the fundamental operations such as routing and data forwarding. However, due to the open structure and scarcely available battery-based energy, node misbehaviors may exist.[1]. One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. This paper pointed out Energy based selfish nodes (EBSN where these selfish nodes tend to use the network but do not cooperate, saving battery life for their own communications [2],[3]. We present a simulation study of the effects of Energy based selfish nodes (EBSN on DSR routing protocol and its impact over network performance in terms of throughput and delay of a mobile ad hoc network where a defined percentage of nodes were misbehaving.

Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks

DEFF Research Database (Denmark)

Espensen, Kristian Asbjørn Leth; Kjeldsen, Mads Keblov; Kristensen, Lars Michael

2008-01-01

A mobile ad-hoc network (MANET) is an infrastructureless network established by a set of mobile devices using wireless communication. The Dynamic MANET On-demand (DYMO) protocol is a routing protocol for multi-hop communication in MANETs currently under development by the Internet Engineering Task...... Force (IETF). This paper presents a Coloured Petri Net (CPN) model of the mandatory parts of the DYMO protocol, and shows how scenario-based state space exploration has been used to validate key properties of the protocol. Our CPN modelling and verification work has spanned two revisions of the DYMO...... protocol specification and have had direct impact on the most recent version of the protocol specification....

An ad hoc wireless sensor network for tele medicine applications

International Nuclear Information System (INIS)

Sheltami, Tarek R.; Mahmoud, Ashraf S.; Abu-Amara, Marwan H.

2007-01-01

Recent advances in embedded computing systems have led to the emergence of wireless sensor networks (SNETs), consisting of small, battery-powered motes with limited computation and radio communication capabilities. SNETs permit data gathering and computation to be deeply embedded in the physical environment. Large scale ad hoc sensor networks (ASNET), when deployed among mobile patients, can provide dynamic data query architecture to allow medical specialists to monitor patients at any place via the web or cellular network. In case of an emergency, doctors and/or nurses will be contacted automatically through their handheld personal digital assistants (PDAs) or cellular phones. In specific, the proposed network consists of sensor nodes at the first layer whose responsibility is to measure, collect and communicate, via wired or wireless interface, readings to a microcontroller presenting the second layer of architecture. Deployed microcontrollers process incoming readings and report to a central system via a wireless interface. The implemented network distinguishes between periodic sensor readings and critical or event driven readings where higher priorities is given for the latter. In this paper we implement 3 special cases for tracking and monitoring patients and doctors using SNETs. In addition, the performance of a large scale of our implementation has been tested by means of mathematical analysis. (author)

Energy-Efficient Cluster Based Routing Protocol in Mobile Ad Hoc Networks Using Network Coding

Directory of Open Access Journals (Sweden)

Srinivas Kanakala

2014-01-01

Full Text Available In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of wireless networks. COPE protocol implements network coding concept to reduce number of transmissions by mixing the packets at intermediate nodes. We incorporate COPE into cluster based routing protocol to further reduce the energy consumption. The proposed energy-efficient coding-aware cluster based routing protocol (ECCRP scheme applies network coding at cluster heads to reduce number of transmissions. We also modify the queue management procedure of COPE protocol to further improve coding opportunities. We also use an energy efficient scheme while selecting the cluster head. It helps to increase the life time of the network. We evaluate the performance of proposed energy efficient cluster based protocol using simulation. Simulation results show that the proposed ECCRP algorithm reduces energy consumption and increases life time of the network.

A flow level model for wireless multihop ad hoc network throughput

NARCIS (Netherlands)

Coenen, Tom Johannes Maria; van den Berg, Hans Leo; Boucherie, Richardus J.

2005-01-01

A flow level model for multihop wireless ad hoc networks is presented in this paper. Using a flow level view, we show the main properties and modeling challenges for ad hoc networks. Considering different scenarios, a multihop WLAN and a serial network with a TCP-like flow control protocol, we

On the impact of network dynamics on a discovery protocol for ad-hoc networks

NARCIS (Netherlands)

Liu, F.; Heijenk, Geert

A very promising approach to discovering services and context information in ad-hoc networks is based on the use of Attenuated Bloom filters. In this paper we analyze the impact of changes in the connectivity of an ad-hoc network on this approach. We evaluate the performance of the discovery

A multihop key agreement scheme for wireless ad hoc networks based on channel characteristics.

Science.gov (United States)

Hao, Zhuo; Zhong, Sheng; Yu, Nenghai

2013-01-01

A number of key agreement schemes based on wireless channel characteristics have been proposed recently. However, previous key agreement schemes require that two nodes which need to agree on a key are within the communication range of each other. Hence, they are not suitable for multihop wireless networks, in which nodes do not always have direct connections with each other. In this paper, we first propose a basic multihop key agreement scheme for wireless ad hoc networks. The proposed basic scheme is resistant to external eavesdroppers. Nevertheless, this basic scheme is not secure when there exist internal eavesdroppers or Man-in-the-Middle (MITM) adversaries. In order to cope with these adversaries, we propose an improved multihop key agreement scheme. We show that the improved scheme is secure against internal eavesdroppers and MITM adversaries in a single path. Both performance analysis and simulation results demonstrate that the improved scheme is efficient. Consequently, the improved key agreement scheme is suitable for multihop wireless ad hoc networks.

Intelligent QoS routing algorithm based on improved AODV protocol for Ad Hoc networks

Science.gov (United States)

Huibin, Liu; Jun, Zhang

2016-04-01

Mobile Ad Hoc Networks were playing an increasingly important part in disaster reliefs, military battlefields and scientific explorations. However, networks routing difficulties are more and more outstanding due to inherent structures. This paper proposed an improved cuckoo searching-based Ad hoc On-Demand Distance Vector Routing protocol (CSAODV). It elaborately designs the calculation methods of optimal routing algorithm used by protocol and transmission mechanism of communication-package. In calculation of optimal routing algorithm by CS Algorithm, by increasing QoS constraint, the found optimal routing algorithm can conform to the requirements of specified bandwidth and time delay, and a certain balance can be obtained among computation spending, bandwidth and time delay. Take advantage of NS2 simulation software to take performance test on protocol in three circumstances and validate the feasibility and validity of CSAODV protocol. In results, CSAODV routing protocol is more adapt to the change of network topological structure than AODV protocol, which improves package delivery fraction of protocol effectively, reduce the transmission time delay of network, reduce the extra burden to network brought by controlling information, and improve the routing efficiency of network.

Monitoring and classifying animal behavior using ZigBee-based mobile ad hoc wireless sensor networks and artificial neural networks

DEFF Research Database (Denmark)

S. Nadimi, Esmaeil; Nyholm Jørgensen, Rasmus; Blanes-Vidal, Victoria

2012-01-01

Animal welfare is an issue of great importance in modern food production systems. Because animal behavior provides reliable information about animal health and welfare, recent research has aimed at designing monitoring systems capable of measuring behavioral parameters and transforming them...... into their corresponding behavioral modes. However, network unreliability and high-energy consumption have limited the applicability of those systems. In this study, a 2.4-GHz ZigBee-based mobile ad hoc wireless sensor network (MANET) that is able to overcome those problems is presented. The designed MANET showed high...... communication reliability, low energy consumption and low packet loss rate (14.8%) due to the deployment of modern communication protocols (e.g. multi-hop communication and handshaking protocol). The measured behavioral parameters were transformed into the corresponding behavioral modes using a multilayer...

Analysis for Ad Hoc Network Attack-Defense Based on Stochastic Game Model

Directory of Open Access Journals (Sweden)

Yuanjie LI

2014-06-01

Full Text Available The attack actions analysis for Ad Hoc networks can provide a reference for the design security mechanisms. This paper presents an analysis method of security of Ad Hoc networks based on Stochastic Game Nets (SGN. This method can establish a SGN model of Ad Hoc networks and calculate to get the Nash equilibrium strategy. After transforming the SGN model into a continuous-time Markov Chain (CTMC, the security of Ad Hoc networks can be evaluated and analyzed quantitatively by calculating the stationary probability of CTMC. Finally, the Matlab simulation results show that the probability of successful attack is related to the attack intensity and expected payoffs, but not attack rate.

Multichannel MAC Layer In Mobile Ad—Hoc Network

Science.gov (United States)

Logesh, K.; Rao, Samba Siva

2010-11-01

This paper we presented the design objectives and technical challenges in Multichannel MAC protocols in Mobile Ad-hoc Network. In IEEE 802.11 a/b/g standards allow use of multiple channels, only a single channel is popularly used, due to the lack of efficient protocols that enable use of Multiple Channels. Even though complex environments in ad hoc networks require a combined control of physical (PHY) and medium access control (MAC) layers resources in order to optimize performance. And also we discuss the characteristics of cross-layer frame and give a multichannel MAC approach.

Access Point Security Service for wireless ad-hoc communication

NARCIS (Netherlands)

Scholten, Johan; Nijdam, M.

2006-01-01

This paper describes the design and implementation of a security solution for ad-hoc peer-to-peer communication. The security solution is based on a scenario where two wireless devices require secure communication, but share no security relationship a priori. The necessary requirements for the

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks.

Science.gov (United States)

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV.

Increased longevity of wireless Ad hoc network through fuzzy system

Directory of Open Access Journals (Sweden)

Fawzia Abdali Larki

2014-06-01

Full Text Available The Ad hoc network is one of the multistep-based self-organizing networks, which are dynamically changing and are taken more into account as the ways of connecting the terminals through the development of wireless communication terminals. We are faced with numerous challenges in designing a wireless network such as the dynamic topology, common and limited bandwidth, and the limited energy. The nodes are moving according to the continuous changes in the topology and the source-to-destination paths are completely broken. Therefore, the repeated route discovery enhances the delay and overload of routing. Thus, it is essential to consider the link stability while designing the path in order to choose the routing protocol. Providing the multiple paths may lead to the better performance than a path. The transmission energy control in the wireless Ad hoc networks is the option for the level of transmission energy in order to transmit each node packet in this system. Therefore, transmission energy control affects the wireless medium interface. Because of choosing the appropriate protocol, the routing operation can be improved and the energy consumption can be controlled properly as well as enhancing the durability and longevity of network. The main objective of this study is to enhance the network longevity. The proposed algorithm in this research considers the combination of 2 parameters including the rate of node energy and number of steps in Fuzzy System applied on AOMDV Protocol, which is a Multipath Routing Protocol. The results of simulation also indicate the improved performance of proposed algorithm (AOMDV-F compared to AODV and AOMDV Protocols in NS2 simulator.

Performance Analysis of a Cluster-Based MAC Protocol for Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jesús Alonso-Zárate

2010-01-01

Full Text Available An analytical model to evaluate the non-saturated performance of the Distributed Queuing Medium Access Control Protocol for Ad Hoc Networks (DQMANs in single-hop networks is presented in this paper. DQMAN is comprised of a spontaneous, temporary, and dynamic clustering mechanism integrated with a near-optimum distributed queuing Medium Access Control (MAC protocol. Clustering is executed in a distributed manner using a mechanism inspired by the Distributed Coordination Function (DCF of the IEEE 802.11. Once a station seizes the channel, it becomes the temporary clusterhead of a spontaneous cluster and it coordinates the peer-to-peer communications between the clustermembers. Within each cluster, a near-optimum distributed queuing MAC protocol is executed. The theoretical performance analysis of DQMAN in single-hop networks under non-saturation conditions is presented in this paper. The approach integrates the analysis of the clustering mechanism into the MAC layer model. Up to the knowledge of the authors, this approach is novel in the literature. In addition, the performance of an ad hoc network using DQMAN is compared to that obtained when using the DCF of the IEEE 802.11, as a benchmark reference.

An Incentivized Approach for Fair Participation in Wireless Ad hoc Networks

OpenAIRE

Choudhuri, Arka Rai; S, Kalyanasundaram; Sridhar, Shriyak; B, Annappa

2015-01-01

In Wireless Ad hoc networks (WANETs), nodes separated by considerable distance communicate with each other by relaying their messages through other nodes. However, it might not be in the best interests of a node to forward the message of another node due to power constraints. In addition, all nodes being rational, some nodes may be selfish, i.e. they might not relay data from other nodes so as to increase their lifetime. In this paper, we present a fair and incentivized approach for participa...

Optimum Combining for Rapidly Fading Channels in Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Sonia Furman

2003-10-01

Full Text Available Research and technology in wireless communication systems such as radar and cellular networks have successfully implemented alternative design approaches that utilize antenna array techniques such as optimum combining, to mitigate the degradation effects of multipath in rapid fading channels. In ad hoc networks, these methods have not yet been exploited primarily due to the complexity inherent in the network's architecture. With the high demand for improved signal link quality, devices configured with omnidirectional antennas can no longer meet the growing need for link quality and spectrum efficiency. This study takes an empirical approach to determine an optimum combining antenna array based on 3 variants of interelement spacing. For rapid fading channels, the simulation results show that the performance in the network of devices retrofitted with our antenna arrays consistently exceeded those with an omnidirectional antenna. Further, with the optimum combiner, the performance increased by over 60% compared to that of an omnidirectional antenna in a rapid fading channel.

Effects of Data Replication on Data Exfiltration in Mobile Ad Hoc Networks Utilizing Reactive Protocols

Science.gov (United States)

2015-03-01

aerial vehicle VANET vehicular ad hoc network VoIP Voice over Internet Protocol VRR Virtual Ring Routing xiii EFFECTS OF DATA REPLICATION ON DATA...ad hoc networks in mobile ad hoc networks (MANETs), vehicular ad hoc networks (VANETs), and flying ad hoc net- works (FANETs). Much of the research...metric, such as capacity, congestion , power, or combinations thereof. Caro refers to two different types of ants, FANTs and BANTs which are analogous to

Model checking mobile ad hoc networks

NARCIS (Netherlands)

Ghassemi, Fatemeh; Fokkink, Wan

2016-01-01

Modeling arbitrary connectivity changes within mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We use constrained labeled transition systems as a semantic model to represent mobility. To model check MANET protocols with respect to the underlying

Data delivery method based on neighbor nodes' information in a mobile ad hoc network.

Science.gov (United States)

Kashihara, Shigeru; Hayashi, Takuma; Taenaka, Yuzo; Okuda, Takeshi; Yamaguchi, Suguru

2014-01-01

This paper proposes a data delivery method based on neighbor nodes' information to achieve reliable communication in a mobile ad hoc network (MANET). In a MANET, it is difficult to deliver data reliably due to instabilities in network topology and wireless network condition which result from node movement. To overcome such unstable communication, opportunistic routing and network coding schemes have lately attracted considerable attention. Although an existing method that employs such schemes, MAC-independent opportunistic routing and encoding (MORE), Chachulski et al. (2007), improves the efficiency of data delivery in an unstable wireless mesh network, it does not address node movement. To efficiently deliver data in a MANET, the method proposed in this paper thus first employs the same opportunistic routing and network coding used in MORE and also uses the location information and transmission probabilities of neighbor nodes to adapt to changeable network topology and wireless network condition. The simulation experiments showed that the proposed method can achieve efficient data delivery with low network load when the movement speed is relatively slow.

Data Delivery Method Based on Neighbor Nodes’ Information in a Mobile Ad Hoc Network

Directory of Open Access Journals (Sweden)

Shigeru Kashihara

2014-01-01

Full Text Available This paper proposes a data delivery method based on neighbor nodes’ information to achieve reliable communication in a mobile ad hoc network (MANET. In a MANET, it is difficult to deliver data reliably due to instabilities in network topology and wireless network condition which result from node movement. To overcome such unstable communication, opportunistic routing and network coding schemes have lately attracted considerable attention. Although an existing method that employs such schemes, MAC-independent opportunistic routing and encoding (MORE, Chachulski et al. (2007, improves the efficiency of data delivery in an unstable wireless mesh network, it does not address node movement. To efficiently deliver data in a MANET, the method proposed in this paper thus first employs the same opportunistic routing and network coding used in MORE and also uses the location information and transmission probabilities of neighbor nodes to adapt to changeable network topology and wireless network condition. The simulation experiments showed that the proposed method can achieve efficient data delivery with low network load when the movement speed is relatively slow.

Intelligent Networks Data Fusion Web-based Services for Ad-hoc Integrated WSNs-RFID

Directory of Open Access Journals (Sweden)

Falah Alshahrany

2016-01-01

Full Text Available The use of variety of data fusion tools and techniques for big data processing poses the problem of the data and information integration called data fusion having objectives which can differ from one application to another. The design of network data fusion systems aimed at meeting these objectives, need to take into account of the necessary synergy that can result from distributed data processing within the data networks and data centres, involving increased computation and communication. This papers reports on how this processing distribution is functionally structured as configurable integrated web-based support services, in the context of an ad-hoc wireless sensor network used for sensing and tracking, in the context of distributed detection based on complete observations to support real rime decision making. The interrelated functional and hardware RFID-WSN integration is an essential aspect of the data fusion framework that focuses on multi-sensor collaboration as an innovative approach to extend the heterogeneity of the devices and sensor nodes of ad-hoc networks generating a huge amount of heterogeneous soft and hard raw data. The deployment and configuration of these networks require data fusion processing that includes network and service management and enhances the performance and reliability of networks data fusion support systems providing intelligent capabilities for real-time control access and fire detection.

Novel Concepts for Device to Device Communication using Network Coding

DEFF Research Database (Denmark)

Pahlevani, Peyman; Hundebøll, Martin; Pedersen, Morten Videbæk

2014-01-01

Device-to-device communication is currently a hot research topic within 3GPP. Even though D2D communication has been part of previous ad hoc, meshed and sensor networks proposals, the main contribution by 3GPP is that the direct communication among two devices is carried out over a dynamically as...

A Clustering Routing Protocol for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jinke Huang

2016-01-01

Full Text Available The dynamic topology of a mobile ad hoc network poses a real challenge in the design of hierarchical routing protocol, which combines proactive with reactive routing protocols and takes advantages of both. And as an essential technique of hierarchical routing protocol, clustering of nodes provides an efficient method of establishing a hierarchical structure in mobile ad hoc networks. In this paper, we designed a novel clustering algorithm and a corresponding hierarchical routing protocol for large-scale mobile ad hoc networks. Each cluster is composed of a cluster head, several cluster gateway nodes, several cluster guest nodes, and other cluster members. The proposed routing protocol uses proactive protocol between nodes within individual clusters and reactive protocol between clusters. Simulation results show that the proposed clustering algorithm and hierarchical routing protocol provide superior performance with several advantages over existing clustering algorithm and routing protocol, respectively.

Classification and Evaluation of Mobility Metrics for Mobility Model Movement Patterns in Mobile Ad-Hoc Networks

OpenAIRE

Santosh Kumar S C Sharma Bhupendra Suman

2011-01-01

A mobile ad hoc network is collection of self configuring and adaption of wireless link between communicating devices (mobile devices) to form an arbitrary topology and multihop wireless connectivity without the use of existing infrastructure. It requires efficient dynamic routing protocol to determine the routes subsequent to a set of rules that enables two or more devices to communicate with each others. This paper basically classifies and evaluates the mobility metrics into two categories-...

Quantum load balancing in ad hoc networks

Science.gov (United States)

Hasanpour, M.; Shariat, S.; Barnaghi, P.; Hoseinitabatabaei, S. A.; Vahid, S.; Tafazolli, R.

2017-06-01

This paper presents a novel approach in targeting load balancing in ad hoc networks utilizing the properties of quantum game theory. This approach benefits from the instantaneous and information-less capability of entangled particles to synchronize the load balancing strategies in ad hoc networks. The quantum load balancing (QLB) algorithm proposed by this work is implemented on top of OLSR as the baseline routing protocol; its performance is analyzed against the baseline OLSR, and considerable gain is reported regarding some of the main QoS metrics such as delay and jitter. Furthermore, it is shown that QLB algorithm supports a solid stability gain in terms of throughput which stands a proof of concept for the load balancing properties of the proposed theory.

Dynamic Mobile IP routers in ad hoc networks

NARCIS (Netherlands)

Kock, B.A.; Schmidt, J.R.

2005-01-01

This paper describes a concept combining mobile IP and ad hoc routing to create a robust mobile network. In this network all nodes are mobile and globally and locally reachable under the same IP address. Essential for implementing this network are the dynamic mobile IP routers. They act as gateways

Reliability analysis of cluster-based ad-hoc networks

International Nuclear Information System (INIS)

Cook, Jason L.; Ramirez-Marquez, Jose Emmanuel

2008-01-01

The mobile ad-hoc wireless network (MAWN) is a new and emerging network scheme that is being employed in a variety of applications. The MAWN varies from traditional networks because it is a self-forming and dynamic network. The MAWN is free of infrastructure and, as such, only the mobile nodes comprise the network. Pairs of nodes communicate either directly or through other nodes. To do so, each node acts, in turn, as a source, destination, and relay of messages. The virtue of a MAWN is the flexibility this provides; however, the challenge for reliability analyses is also brought about by this unique feature. The variability and volatility of the MAWN configuration makes typical reliability methods (e.g. reliability block diagram) inappropriate because no single structure or configuration represents all manifestations of a MAWN. For this reason, new methods are being developed to analyze the reliability of this new networking technology. New published methods adapt to this feature by treating the configuration probabilistically or by inclusion of embedded mobility models. This paper joins both methods together and expands upon these works by modifying the problem formulation to address the reliability analysis of a cluster-based MAWN. The cluster-based MAWN is deployed in applications with constraints on networking resources such as bandwidth and energy. This paper presents the problem's formulation, a discussion of applicable reliability metrics for the MAWN, and illustration of a Monte Carlo simulation method through the analysis of several example networks

Energy management in wireless cellular and ad-hoc networks

CERN Document Server

Imran, Muhammad; Qaraqe, Khalid; Alouini, Mohamed-Slim; Vasilakos, Athanasios

2016-01-01

This book investigates energy management approaches for energy efficient or energy-centric system design and architecture and presents end-to-end energy management in the recent heterogeneous-type wireless network medium. It also considers energy management in wireless sensor and mesh networks by exploiting energy efficient transmission techniques and protocols. and explores energy management in emerging applications, services and engineering to be facilitated with 5G networks such as WBANs, VANETS and Cognitive networks. A special focus of the book is on the examination of the energy management practices in emerging wireless cellular and ad hoc networks. Considering the broad scope of energy management in wireless cellular and ad hoc networks, this book is organized into six sections covering range of Energy efficient systems and architectures; Energy efficient transmission and techniques; Energy efficient applications and services. .

Dynamic fair node spectrum allocation for ad hoc networks using random matrices

Science.gov (United States)

Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

2015-05-01

Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

Source Authentication for Multicast in Mobile Ad Hoc Networks

National Research Council Canada - National Science Library

Ramachandran, Prabha

2003-01-01

Recent emergence and popularity of mobile ad hoc networks in a host of current-day applications has instigated a suite of research challenges, primarily in routing and security issues for such networks...

Evaluation of mobile ad hoc network reliability using propagation-based link reliability model

International Nuclear Information System (INIS)

Padmavathy, N.; Chaturvedi, Sanjay K.

2013-01-01

A wireless mobile ad hoc network (MANET) is a collection of solely independent nodes (that can move randomly around the area of deployment) making the topology highly dynamic; nodes communicate with each other by forming a single hop/multi-hop network and maintain connectivity in decentralized manner. MANET is modelled using geometric random graphs rather than random graphs because the link existence in MANET is a function of the geometric distance between the nodes and the transmission range of the nodes. Among many factors that contribute to the MANET reliability, the reliability of these networks also depends on the robustness of the link between the mobile nodes of the network. Recently, the reliability of such networks has been evaluated for imperfect nodes (transceivers) with binary model of communication links based on the transmission range of the mobile nodes and the distance between them. However, in reality, the probability of successful communication decreases as the signal strength deteriorates due to noise, fading or interference effects even up to the nodes' transmission range. Hence, in this paper, using a propagation-based link reliability model rather than a binary-model with nodes following a known failure distribution to evaluate the network reliability (2TR m , ATR m and AoTR m ) of MANET through Monte Carlo Simulation is proposed. The method is illustrated with an application and some imperative results are also presented

Analysis of DDoS Attack Effect and Protection Scheme in Wireless Mobile Ad-hoc Network

OpenAIRE

Ramratan Ahirwal; Leeladhar Mahour

2012-01-01

In Wireless mobile Ad Hoc Networks (MANET) every node functions as transmitter, router and data sink is network without infrastructure. Detecting malicious nodes in an open ad-hoc network in whichparticipating nodes have no previous security associations presents a number of challenges not faced by traditional wired networks. Traffic monitoring in wired networks is usually performed at switches,routers and gateways, but an ad-hoc network does not have these types of network elements where the...

A Family of Key Agreement Mechanisms for Mission Critical Communications for Secure Mobile Ad Hoc and Wireless Mesh Internetworking

Directory of Open Access Journals (Sweden)

Tryfonas Theo

2011-01-01

Full Text Available Future wireless networks like mobile ad hoc networks and wireless mesh networks are expected to play important role in demanding communications such as mission critical communications. MANETs are ideal for emergency cases where the communication infrastructure has been completely destroyed and there is a need for quick set up of communications among the rescue/emergency workers. In such emergency scenarios wireless mesh networks may be employed in a later phase for providing advanced communications and services acting as a backbone network in the affected area. Internetworking of both types of future networks will provide a broad range of mission critical applications. While offering many advantages, such as flexibility, easy of deployment and low cost, MANETs and mesh networks face important security and resilience threats, especially for such demanding applications. We introduce a family of key agreement methods based on weak to strong authentication associated with several multiparty contributory key establishment methods. We examine the attributes of each key establishment method and how each method can be better applied in different scenarios. The proposed protocols support seamlessly both types of networks and consider system and application requirements such as efficient and secure internetworking, dynamicity of network topologies and support of thin clients.

Handbook on theoretical and algorithmic aspects of sensor, ad hoc wireless, and peer-to-peer networks

CERN Document Server

Wu, Jie

2005-01-01

PrefaceAD HOC WIRELESS NETWORKSA Modular Cross Layer Architecture for Ad Hoc Networks, M. Conti, J. Crowcroft, G. Maselli, and G. TuriRouting Scalability in MANETs, J. Eriksson, S. Krishnamurthy and M. FaloutsosUniformly Distributed Algorithm for Virtual Backbone Routing in Ad Hoc Wireless Networks, D.S. KimMaximum Necessary Hop Count for Packet Routing in MANET, X. Chen and J. ShenEfficient Strategyproof Multicast in Selfish Wireless Networks, X.-Yang LiGeocasting in Ad Hoc and Sensor Networks, I. StojmenovicTopology Control for Ad hoc Networks: Present Solutions and Open Issues, C.-C. Shen a

Reducing Congestion in Obstructed Highways with Traffic Data Dissemination Using Ad hoc Vehicular Networks

OpenAIRE

Thomas D. Hewer; Maziar Nekovee; Peter V. Coveney

2010-01-01

Vehicle-to-vehicle communications can be used effectively for intelligent transport systems (ITSs) and location-aware services. The ability to disseminate information in an ad hoc fashion allows pertinent information to propagate faster through a network. In the realm of ITS, the ability to spread warning information faster and further is of great advantage to receivers. In this paper we propose and present a message-dissemination procedure that uses vehicular wireless protocols to influence...

A Group Based Key Sharing and Management Algorithm for Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Zeeshan Shafi Khan

2014-01-01

Full Text Available Vehicular ad hoc networks (VANETs are one special type of ad hoc networks that involves vehicles on roads. Typically like ad hoc networks, broadcast approach is used for data dissemination. Blind broadcast to each and every node results in exchange of useless and irrelevant messages and hence creates an overhead. Unicasting is not preferred in ad-hoc networks due to the dynamic topology and the resource requirements as compared to broadcasting. Simple broadcasting techniques create several problems on privacy, disturbance, and resource utilization. In this paper, we propose media mixing algorithm to decide what information should be provided to each user and how to provide such information. Results obtained through simulation show that fewer number of keys are needed to share compared to simple broadcasting. Privacy is also enhanced through this approach.

Secure Geographic Routing in Ad Hoc and Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zahariadis Theodore

2010-01-01

Full Text Available Security in sensor networks is one of the most relevant research topics in resource constrained wireless devices and networks. Several attacks can be suffered in ad hoc and wireless sensor networks (WSN, which are highly susceptible to attacks, due to the limited resources of the nodes. In this paper, we propose innovative and lightweight localization techniques that allow for intrusion identification and isolation schemes and provide accurate location information. This information is used by our routing protocol which additionally incorporates a distributed trust model to prevent several routing attacks to the network. We finally evaluate our algorithms for accurate localization and for secure routing which have been implemented and tested in real ad hoc and wireless sensor networks.

A COMPREHENSIVE SURVEY ON DETECTING BLACK HOLE ATTACK IN MOBILE AD-HOC NETWORK (MANET

Directory of Open Access Journals (Sweden)

Pascal Maniriho

2018-01-01

Full Text Available The infrastructure-less nature and mobility of nodes in mobile ad-hoc network (MANET make it to be very susceptible to various attacks. Besides, owing to its flexibility and simplicity, there is no predefined time or permission set for nodes to leave or join the network and each node can act as a client or server.  Nevertheless, securing communication between nodes has become a challenging problem than in other types of network. Attacks in MANET range into different categories. Black hole attack is one of the attacks that has been addressed by many researchers in the recent years. It does occur when a harmful mobile node called black hole becomes a part of the network and tries to use its malicious behaviors by sending fake route reply packets (RREP for any received route request packets (RREQ. When these faked packets arrive to the source node, it does reply to them by sending data packet via the established route. Once the packets are received by the black hole, it drops them before reaching the destination.  Hence, preventing the source node from reaching the intended destination. In this paper, we present an overview of a wide range of techniques suggested in the literature for detecting and preventing black hole attacks in mobile ad hoc network. Additionally, the effect of each approach on the network performance is also presented.

SURVEI TEKNIK CLUSTERING ROUTING BERDASARKAN MOBILITAS PADA WIRELESS AD-HOC NETWORK

Directory of Open Access Journals (Sweden)

I Nyoman Trisna Wirawan

2016-01-01

Full Text Available Wireless ad-hoc merupakan sebuah skema jaringan yang didesain supaya mampu beroperasi tanpa membutuhkan infrastruktur tetap serta bersifat otonom. Teknik flooding pada proses path discovery dalam kasus wireless ad-hoc network dapat menimbulkan masalah beban jaringan yang berlebihan. Oleh karena itu, sebuah skema clustering diusulkan untuk mengurangi adanya flooding paket yang berlebihan dengan membagi node-node dalam jaringan menjadi beberapa bagian berdasarkan parameter tertentu. Teknik ini efektifuntuk mengurangi paket yang harus dilewatkan dalam jaringan. Namun masalah muncul ketika sebuah jaringan wireless ad-hoc harus membentuk sebuah cluster dengan mempertimbangkan beberapa parameter khusus. Parameter tersebut harus disesuaikan dengan kasus yang dihadapi. Pada tulisan ini akan dibahas secara khusus mengenai penerapan skema clustering dalam lingkungan wireless ad-hoc network, baik pada MANETdan penyesuaian skema clustering yang harus dilakukan pada VANET berdasarkan mobilitasnya.

Capacity, delay and mobility in wireless ad-hoc networks

NARCIS (Netherlands)

Bansal, N.; Liu, Z.

2003-01-01

Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been shown to increase the capacity of a network, it is not clear whether the delay can be kept low without trading off the throughput. We

Deny-by-Default Distributed Security Policy Enforcement in Mobile Ad Hoc Networks

Science.gov (United States)

Alicherry, Mansoor; Keromytis, Angelos D.; Stavrou, Angelos

Mobile Ad-hoc Networks (MANETs) are increasingly employed in tactical military and civil rapid-deployment networks, including emergency rescue operations and ad hoc disaster-relief networks. However, this flexibility of MANETs comes at a price, when compared to wired and base station-based wireless networks: MANETs are susceptible to both insider and outsider attacks. This is mainly because of the lack of a well-defined defense perimeter preventing the effective use of wired defenses including firewalls and intrusion detection systems.

Minimizing Broadcast Expenses in Clustered Ad-hoc Networks

Directory of Open Access Journals (Sweden)

S. Zeeshan Hussain

2018-01-01

Full Text Available One way to minimize the broadcast expenses of routing protocols is to cluster the network. In clustered ad-hoc networks, all resources can be managed easily by resolving scalability issues. However, blind query broadcast is a major issue that leads to the broadcast storm problem in clustered ad-hoc networks. This query broadcast is done to carry out the route-search task that leads to the unnecessary propagation of route-query even after route has been found. Hence, this query propagation poses the problem of congestion in the network. In particular this motivates us to propose a query-control technique in such networks which works based on broadcast repealing. A huge amount of work has been devoted to propose the query control broadcasting techniques. However, such techniques used in traditional broadcasting mechanisms need to be properly extended for use in the cluster based routing architecture. In this paper, query-control technique is proposed for cluster based routing technique to reduce the broadcast expenses. Finally, we report some experiments which compare the proposed technique to other commonly used techniques including standard one-class AODV that follows TTL-sequence based broadcasting technique.

Verification of mobile ad hoc networks : an algebraic approach

NARCIS (Netherlands)

Ghassemi, F.; Fokkink, W.J.; Movaghar, A.

2011-01-01

We introduced Computed Network Process Theory to reason about protocols for mobile ad hoc networks (MANETs). Here we explore the applicability of our framework in two regards: model checking and equational reasoning. The operational semantics of our framework is based on constrained labeled

Improving information dissemination in sparse vehicular networks by adding satellite communication

NARCIS (Netherlands)

Kloiber, Bernhard; Strang, Thomas; Spijker, Hanno; Heijenk, Geert

Information dissemination in pure Vehicular Ad Hoc NETworks (VANETs) such as ITS-G5 becomes problematic when the network is sparse. In situations where the number of vehicles, that can act as a communication node, is insufficiently low, e.g. in rural areas, during night-time or because of a low

Centralized cooperative spectrum sensing for ad-hoc disaster relief network clusters

DEFF Research Database (Denmark)

Pratas, Nuno; Marchetti, Nicola; Prasad, Neeli R.

2010-01-01

Disaster relief networks have to be highly adaptable and resilient. Cognitive radio enhanced ad-hoc architecture have been put forward as a candidate to enable such networks. Spectrum sensing is the cornerstone of the cognitive radio paradigm, and it has been the target of intensive research....... The main common conclusion was that the achievable spectrum sensing accuracy can be greatly enhanced through the use of cooperative sensing schemes. When considering applying Cognitive Radio to ad-hoc disaster relief networks, spectrum sensing cooperative schemes are paramount. A centralized cluster...

Analysis and Enhancements of Leader Elections algorithms in Mobile Ad Hoc Networks

OpenAIRE

Shayeji, Mohammad H. Al; Al-Azmi, AbdulRahman R.; Al-Azmi, AbdulAziz R.; Samrajesh, M. D.

2012-01-01

Mobile Ad Hoc networks (MANET), distinct from traditional distributed systems, are dynamic and self-organizing networks. MANET requires a leader to coordinate and organize tasks. The challenge is to have the right election algorithm that chooses the right leader based on various factors in MANET. In this paper, we analyze four leader election algorithms used in mobile Ad Hoc Networks. Factors considered in our analysis are time complexity, message complexity, assumptions considered, fault tol...

Les Protocoles de routage dans les réseaux mobiles Ad Hoc ...

African Journals Online (AJOL)

Dans cet article nous présentons un état de l'art sur les protocoles de routage dans les réseaux mobiles Ad hoc. Mots clés : Réseaux mobiles ad hoc/, Protocoles de routage. Routing protocols in wireless mobile ad hoc networks. Abstract:The communication between users with handheld computers interconnected through ...

Reducing Congestion in Obstructed Highways with Traffic Data Dissemination Using Ad hoc Vehicular Networks

Directory of Open Access Journals (Sweden)

Coveney PeterV

2010-01-01

Full Text Available Vehicle-to-vehicle communications can be used effectively for intelligent transport systems (ITSs and location-aware services. The ability to disseminate information in an ad hoc fashion allows pertinent information to propagate faster through a network. In the realm of ITS, the ability to spread warning information faster and further is of great advantage to receivers. In this paper we propose and present a message-dissemination procedure that uses vehicular wireless protocols to influence vehicular flow, reducing congestion in road networks. The computational experiments we present show how a car-following model and lane-change algorithm can be adapted to "react" to the reception of information. This model also illustrates the advantages of coupling together with vehicular flow modelling tools and network simulation tools.

Research on Propagation Model of Malicious Programs in Ad Hoc Wireless Network

Directory of Open Access Journals (Sweden)

Weimin GAO

2014-01-01

Full Text Available Ad Hoc wireless network faces more security threats than traditional network due to its P2P system structure and the limited node resources. In recent years, malicious program has become one of the most important researches on international network security and information security. The research of malicious programs on wireless network has become a new research hotspot in the field of malicious programs. This paper first analyzed the Ad Hoc network system structure, security threats, the common classification of malicious programs and the bionic propagation model. Then starting from the differential equations of the SEIR virus propagation model, the question caused by introducing the SEIR virus propagation model in Ad Hoc wireless network was analyzed. This paper improved the malicious program propagation model through introducing the network topology features and concepts such as immunization delay, and designed an improved algorithm combined with the dynamic evolution of malware propagation process. Considering of the network virus propagation characteristics, network characteristics and immunization strategy to improve simulation model experiment analysis, the experimental results show that both the immunization strategy and the degrees of node can affect the propagation of malicious program.

A Rate-Adaptive MAC Protocol Based on TCP throughput for Ad Hoc Networks in Fading Channels

Directory of Open Access Journals (Sweden)

Shoko Uchida

2008-10-01

Full Text Available Wireless technology is becoming a leading option for future Internet access. Transmission Control Protocol (TCP is one of the protocols designed on the basis of the transmission characteristics in wired networks. It is known that the TCP performance deteriorates drastically under a wireless communication environment. On the other hand, many wireless networking standards such as IEEE 802.11a, 802.11b, and 802.11g have multirate capability. Therefore, adaptive rate control methods have been proposed for ad hoc networks. However, almost methods require the modification of the request to send (RTS and clear to send (CTS packets. Therefore, the conventional methods are not compatible with the standardized system. In this paper, we propose adaptive rate control mechanisms for ad hoc networks. Our mechanisms are based on the RTS/CTS mechanisms. However, no modifications to the RTS and CTS packets are required in the proposed method. Therefore, our proposed method can attempt to satisfy the conventional IEEE 802.11 standards. Moreover, an adequate transmission rate is selected based on an estimated TCP throughput performance. From simulation results, it is observed that the proposed method can improve the throughput performance without any modification of packet structures.

An authenticated encrypted routing protocol against attacks in mobile ad-hoc networks

Directory of Open Access Journals (Sweden)

C.C. Suma

2017-01-01

Full Text Available Mobile Ad hoc Network is stated as a cluster that contains Digital data terminals and they are furnished with the wireless transceivers which are able to communicate with each other with no need of any fixed architecture or concentrated authority. Security is one of the major issues in MANETs because of vast applications such as Military Battlefields, emergency and rescue operations[10]. In order to provide anonymous communications and to identify the malicious nodes in MANETs, many authors have proposed different secure routing protocols but each protocol have their own advantages and disadvantages. In MANTE’s each and every node in the communicating network functions like router and transmits the packets among the networking nodes for the purpose of communication[11]. Sometimes nodes may be attacked by the malicious nodes or the legitimate node will be caught by foemen there by controlling and preventing the nodes to perform the assigned task or nodes may be corrupted due to loss of energy. So, due to these drawbacks securing the network under the presence of adversaries is an important thing. The existing protocols were designed with keeping anonymity and the identification of vicious nodes in the network as the main goal. For providing better security, the anonymity factors such as Unidentifiability and Unlinkability must be fully satisfied[1]. Many anonymous routing schemes that concentrate on achieving anonymity are proposed in the past decade and they provides the security at different levels and also provides the privacy protection that is of different cost. In this paper we consider a protocol called Authenticated Secure Routing Protocol proposed which provides both security & anonymity. Anonymity is achieved in this protocol using Group signature. Over all by using this protocol performance in terms of throughput as well as the packet dropping rate is good compared to the other living protocols.

PNNI routing support for ad hoc mobile networking: The multilevel case

Energy Technology Data Exchange (ETDEWEB)

Martinez, L.; Sholander, P.; Tolendino, L.

1998-01-01

This contribution extends the Outside Nodal Hierarchy List (ONHL) procedures described in ATM Forum Contributions 97-0766 and 97-0933. These extensions allow multiple mobile networks to form either an ad hoc network or an extension of a fixed PNNI infrastructure. A previous contribution (97-1073) covered the simplest case where the top-most Logical Group Nodes (LGNs), in those mobile networks, all resided at the same level in a PNNI hierarchy. This contribution covers the more general case wherein those top-most LGNs may reside at different PNNI hierarchy levels. Both of the SNL contributions consider flat ad hoc network architectures in the sense that each mobile network always participates in the PNNI hierarchy at the pre-configured level of its top-most LGN.

Power control algorithms for mobile ad hoc networks

Directory of Open Access Journals (Sweden)

Nuraj L. Pradhan

2011-07-01

We will also focus on an adaptive distributed power management (DISPOW algorithm as an example of the multi-parameter optimization approach which manages the transmit power of nodes in a wireless ad hoc network to preserve network connectivity and cooperatively reduce interference. We will show that the algorithm in a distributed manner builds a unique stable network topology tailored to its surrounding node density and propagation environment over random topologies in a dynamic mobile wireless channel.

On the Geometrical Characteristics of Three-Dimensional Wireless Ad Hoc Networks and Their Applications

Directory of Open Access Journals (Sweden)

2006-01-01

Full Text Available In a wireless ad hoc network, messages are transmitted, received, and forwarded in a finite geometrical region and the transmission of messages is highly dependent on the locations of the nodes. Therefore the study of geometrical relationship between nodes in wireless ad hoc networks is of fundamental importance in the network architecture design and performance evaluation. However, most previous works concentrated on the networks deployed in the two-dimensional region or in the infinite three-dimensional space, while in many cases wireless ad hoc networks are deployed in the finite three-dimensional space. In this paper, we analyze the geometrical characteristics of the three-dimensional wireless ad hoc network in a finite space in the framework of random graph and deduce an expression to calculate the distance probability distribution between network nodes that are independently and uniformly distributed in a finite cuboid space. Based on the theoretical result, we present some meaningful results on the finite three-dimensional network performance, including the node degree and the max-flow capacity. Furthermore, we investigate some approximation properties of the distance probability distribution function derived in the paper.

Integration of Body Sensor Networks and Vehicular Ad-hoc Networks for Traffic Safety.

Science.gov (United States)

Reyes-Muñoz, Angelica; Domingo, Mari Carmen; López-Trinidad, Marco Antonio; Delgado, José Luis

2016-01-15

The emergence of Body Sensor Networks (BSNs) constitutes a new and fast growing trend for the development of daily routine applications. However, in the case of heterogeneous BSNs integration with Vehicular ad hoc Networks (VANETs) a large number of difficulties remain, that must be solved, especially when talking about the detection of human state factors that impair the driving of motor vehicles. The main contributions of this investigation are principally three: (1) an exhaustive review of the current mechanisms to detect four basic physiological behavior states (drowsy, drunk, driving under emotional state disorders and distracted driving) that may cause traffic accidents is presented; (2) A middleware architecture is proposed. This architecture can communicate with the car dashboard, emergency services, vehicles belonging to the VANET and road or street facilities. This architecture seeks on the one hand to improve the car driving experience of the driver and on the other hand to extend security mechanisms for the surrounding individuals; and (3) as a proof of concept, an Android real-time attention low level detection application that runs in a next-generation smartphone is developed. The application features mechanisms that allow one to measure the degree of attention of a driver on the base of her/his EEG signals, establish wireless communication links via various standard wireless means, GPRS, Bluetooth and WiFi and issue alarms of critical low driver attention levels.

Mobility Models for Next Generation Wireless Networks Ad Hoc, Vehicular and Mesh Networks

CERN Document Server

Santi, Paolo

2012-01-01

Mobility Models for Next Generation Wireless Networks: Ad Hoc, Vehicular and Mesh Networks provides the reader with an overview of mobility modelling, encompassing both theoretical and practical aspects related to the challenging mobility modelling task. It also: Provides up-to-date coverage of mobility models for next generation wireless networksOffers an in-depth discussion of the most representative mobility models for major next generation wireless network application scenarios, including WLAN/mesh networks, vehicular networks, wireless sensor networks, and

Optimal design of cluster-based ad-hoc networks using probabilistic solution discovery

International Nuclear Information System (INIS)

Cook, Jason L.; Ramirez-Marquez, Jose Emmanuel

2009-01-01

The reliability of ad-hoc networks is gaining popularity in two areas: as a topic of academic interest and as a key performance parameter for defense systems employing this type of network. The ad-hoc network is dynamic and scalable and these descriptions are what attract its users. However, these descriptions are also synonymous for undefined and unpredictable when considering the impacts to the reliability of the system. The configuration of an ad-hoc network changes continuously and this fact implies that no single mathematical expression or graphical depiction can describe the system reliability-wise. Previous research has used mobility and stochastic models to address this challenge successfully. In this paper, the authors leverage the stochastic approach and build upon it a probabilistic solution discovery (PSD) algorithm to optimize the topology for a cluster-based mobile ad-hoc wireless network (MAWN). Specifically, the membership of nodes within the back-bone network or networks will be assigned in such as way as to maximize reliability subject to a constraint on cost. The constraint may also be considered as a non-monetary cost, such as weight, volume, power, or the like. When a cost is assigned to each component, a maximum cost threshold is assigned to the network, and the method is run; the result is an optimized allocation of the radios enabling back-bone network(s) to provide the most reliable network possible without exceeding the allowable cost. The method is intended for use directly as part of the architectural design process of a cluster-based MAWN to efficiently determine an optimal or near-optimal design solution. It is capable of optimizing the topology based upon all-terminal reliability (ATR), all-operating terminal reliability (AoTR), or two-terminal reliability (2TR)

Service for fault tolerance in the Ad Hoc Networks based on Multi Agent Systems

Directory of Open Access Journals (Sweden)

Ghalem Belalem

2011-02-01

Full Text Available The Ad hoc networks are distributed networks, self-organized and does not require infrastructure. In such network, mobile infrastructures are subject of disconnections. This situation may concern a voluntary or involuntary disconnection of nodes caused by the high mobility in the Ad hoc network. In these problems we are trying through this work to contribute to solving these problems in order to ensure continuous service by proposing our service for faults tolerance based on Multi Agent Systems (MAS, which predict a problem and decision making in relation to critical nodes. Our work contributes to study the prediction of voluntary and involuntary disconnections in the Ad hoc network; therefore we propose our service for faults tolerance that allows for effective distribution of information in the Network by selecting some objects of the network to be duplicates of information.

An epidemic model for biological data fusion in ad hoc sensor networks

Science.gov (United States)

Chang, K. C.; Kotari, Vikas

2009-05-01

Bio terrorism can be a very refined and a catastrophic approach of attacking a nation. This requires the development of a complete architecture dedicatedly designed for this purpose which includes but is not limited to Sensing/Detection, Tracking and Fusion, Communication, and others. In this paper we focus on one such architecture and evaluate its performance. Various sensors for this specific purpose have been studied. The accent has been on use of Distributed systems such as ad-hoc networks and on application of epidemic data fusion algorithms to better manage the bio threat data. The emphasis has been on understanding the performance characteristics of these algorithms under diversified real time scenarios which are implemented through extensive JAVA based simulations. Through comparative studies on communication and fusion the performance of channel filter algorithm for the purpose of biological sensor data fusion are validated.

Power-Controlled MAC Protocols with Dynamic Neighbor Prediction for Ad hoc Networks

Institute of Scientific and Technical Information of China (English)

LI Meng; ZHANG Lin; XIAO Yong-kang; SHAN Xiu-ming

2004-01-01

Energy and bandwidth are the scarce resources in ad hoc networks because most of the mobile nodes are battery-supplied and share the exclusive wireless medium. Integrating the power control into MAC protocol is a promising technique to fully exploit these precious resources of ad hoc wireless networks. In this paper, a new intelligent power-controlled Medium Access Control (MAC) (iMAC) protocol with dynamic neighbor prediction is proposed. Through the elaborate design of the distributed transmit-receive strategy of mobile nodes, iMAC greatly outperforms the prevailing IEEE 802.11 MAC protocols in not only energy conservation but also network throughput. Using the Dynamic Neighbor Prediction (DNP), iMAC performs well in mobile scenes. To the best of our knowledge, iMAC is the first protocol that considers the performance deterioration of power-controlled MAC protocols in mobile scenes and then proposes a solution. Simulation results indicate that DNP is important and necessary for power-controlled MAC protocols in mobile ad hoc networks.

A multi-radio, multi-hop ad-hoc radio communication network for Communications-Based Train Control (CBTC)

DEFF Research Database (Denmark)

Farooq, Jahanzeb; Bro, Lars; Karstensen, Rasmus Thystrup

2018-01-01

Communications-Based Train Control (CBTC) is a modern signalling system that uses radio communication to transfer train control information between train and wayside. The trackside networks in these systems are mostly based on conventional infrastructure Wi-Fi (IEEE 802.11). It means a train has...... to continuously associate (i.e. perform handshake) with the trackside Wi-Fi Access Points (AP) as it moves, which incurs communication delays. Additionally, these APs are connected to the wayside infrastructure via optical fiber cables that incurs huge costs. This paper presents a novel design in which trackside...

Interference in wireless ad hoc networks with smart antennas

KAUST Repository

Alabdulmohsin, Ibrahim

2014-08-01

In this paper, we show that the use of directional antennas in wireless ad hoc networks can actually increase interference due to limitations of virtual carrier sensing. We derive a simple mathematical expression for interference in both physical and virtual carrier sense networks, which reveals counter-intuitively that receivers in large dense networks with directional antennas can experience larger interference than in omnidirectional networks unless the beamwidth is sufficiently small. Validity of mathematical analysis is confirmed using simulations.

Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Hong-Chuan Yang

2007-01-01

Full Text Available We study the energy-efficient configuration of multihop paths with automatic repeat request (ARQ mechanism in wireless ad hoc networks. We adopt a cross-layer design approach and take both the quality of each radio hop and the battery capacity of each transmitting node into consideration. Under certain constraints on the maximum tolerable transmission delay and the required packet delivery ratio, we solve optimization problems to jointly schedule the transmitting power of each transmitting node and the retransmission limit over each hop. Numerical results demonstrate that the path configuration methods can either significantly reduce the average energy consumption per packet delivery or considerably extend the average lifetime of the multihop route.

MAC Protocol for Ad Hoc Networks Using a Genetic Algorithm

Science.gov (United States)

Elizarraras, Omar; Panduro, Marco; Méndez, Aldo L.

2014-01-01

The problem of obtaining the transmission rate in an ad hoc network consists in adjusting the power of each node to ensure the signal to interference ratio (SIR) and the energy required to transmit from one node to another is obtained at the same time. Therefore, an optimal transmission rate for each node in a medium access control (MAC) protocol based on CSMA-CDMA (carrier sense multiple access-code division multiple access) for ad hoc networks can be obtained using evolutionary optimization. This work proposes a genetic algorithm for the transmission rate election considering a perfect power control, and our proposition achieves improvement of 10% compared with the scheme that handles the handshaking phase to adjust the transmission rate. Furthermore, this paper proposes a genetic algorithm that solves the problem of power combining, interference, data rate, and energy ensuring the signal to interference ratio in an ad hoc network. The result of the proposed genetic algorithm has a better performance (15%) compared to the CSMA-CDMA protocol without optimizing. Therefore, we show by simulation the effectiveness of the proposed protocol in terms of the throughput. PMID:25140339

MAC Protocol for Ad Hoc Networks Using a Genetic Algorithm

Directory of Open Access Journals (Sweden)

Omar Elizarraras

2014-01-01

Full Text Available The problem of obtaining the transmission rate in an ad hoc network consists in adjusting the power of each node to ensure the signal to interference ratio (SIR and the energy required to transmit from one node to another is obtained at the same time. Therefore, an optimal transmission rate for each node in a medium access control (MAC protocol based on CSMA-CDMA (carrier sense multiple access-code division multiple access for ad hoc networks can be obtained using evolutionary optimization. This work proposes a genetic algorithm for the transmission rate election considering a perfect power control, and our proposition achieves improvement of 10% compared with the scheme that handles the handshaking phase to adjust the transmission rate. Furthermore, this paper proposes a genetic algorithm that solves the problem of power combining, interference, data rate, and energy ensuring the signal to interference ratio in an ad hoc network. The result of the proposed genetic algorithm has a better performance (15% compared to the CSMA-CDMA protocol without optimizing. Therefore, we show by simulation the effectiveness of the proposed protocol in terms of the throughput.

Energy Efficient Probabilistic Broadcasting for Mobile Ad-Hoc Network

Science.gov (United States)

Kumar, Sumit; Mehfuz, Shabana

2017-06-01

In mobile ad-hoc network (MANETs) flooding method is used for broadcasting route request (RREQ) packet from one node to another node for route discovery. This is the simplest method of broadcasting of RREQ packets but it often results in broadcast storm problem, originating collisions and congestion of packets in the network. A probabilistic broadcasting is one of the widely used broadcasting scheme for route discovery in MANETs and provides solution for broadcasting storm problem. But it does not consider limited energy of the battery of the nodes. In this paper, a new energy efficient probabilistic broadcasting (EEPB) is proposed in which probability of broadcasting RREQs is calculated with respect to remaining energy of nodes. The analysis of simulation results clearly indicate that an EEPB route discovery scheme in ad-hoc on demand distance vector (AODV) can increase the network lifetime with a decrease in the average power consumption and RREQ packet overhead. It also decreases the number of dropped packets in the network, in comparison to other EEPB schemes like energy constraint gossip (ECG), energy aware gossip (EAG), energy based gossip (EBG) and network lifetime through energy efficient broadcast gossip (NEBG).

A communication theoretical analysis of FRET-based mobile ad hoc molecular nanonetworks.

Science.gov (United States)

Kuscu, Murat; Akan, Ozgur B

2014-09-01

Nanonetworks refer to a group of nanosized machines with very basic operational capabilities communicating to each other in order to accomplish more complex tasks such as in-body drug delivery, or chemical defense. Realizing reliable and high-rate communication between these nanomachines is a fundamental problem for the practicality of these nanonetworks. Recently, we have proposed a molecular communication method based on Förster Resonance Energy Transfer (FRET) which is a nonradiative excited state energy transfer phenomenon observed among fluorescent molecules, i.e., fluorophores. We have modeled the FRET-based communication channel considering the fluorophores as single-molecular immobile nanomachines, and shown its reliability at high rates, and practicality at the current stage of nanotechnology. In this study, for the first time in the literature, we investigate the network of mobile nanomachines communicating through FRET. We introduce two novel mobile molecular nanonetworks: FRET-based mobile molecular sensor/actor nanonetwork (FRET-MSAN) which is a distributed system of mobile fluorophores acting as sensor or actor node; and FRET-based mobile ad hoc molecular nanonetwork (FRET-MAMNET) which consists of fluorophore-based nanotransmitter, nanoreceivers and nanorelays. We model the single message propagation based on birth-death processes with continuous time Markov chains. We evaluate the performance of FRET-MSAN and FRET-MAMNET in terms of successful transmission probability and mean extinction time of the messages, system throughput, channel capacity and achievable communication rates.

A peer-to-peer file search and download protocol for wireless ad-hoc networks

NARCIS (Netherlands)

Sözer, Hasan; Tekkalmaz, M.; Korpeoglu, I.

Deployment of traditional peer-to-peer file sharing systems on a wireless ad-hoc network introduces several challenges. Information and workload distribution as well as routing are major problems for members of a wireless ad-hoc network, which are only aware of their immediate neighborhood. In this

UMDR: Multi-Path Routing Protocol for Underwater Ad Hoc Networks with Directional Antenna

Science.gov (United States)

Yang, Jianmin; Liu, Songzuo; Liu, Qipei; Qiao, Gang

2018-01-01

This paper presents a new routing scheme for underwater ad hoc networks based on directional antennas. Ad hoc networks with directional antennas have become a hot research topic because of space reuse may increase networks capacity. At present, researchers have applied traditional self-organizing routing protocols (such as DSR, AODV) [1] [2] on this type of networks, and the routing scheme is based on the shortest path metric. However, such routing schemes often suffer from long transmission delays and frequent link fragmentation along the intermediate nodes of the selected route. This is caused by a unique feature of directional transmission, often called as “deafness”. In this paper, we take a different approach to explore the advantages of space reuse through multipath routing. This paper introduces the validity of the conventional routing scheme in underwater ad hoc networks with directional antennas, and presents a special design of multipath routing algorithm for directional transmission. The experimental results show a significant performance improvement in throughput and latency.

Securing ad hoc wireless sensor networks under Byzantine attacks by implementing non-cryptographic method

Directory of Open Access Journals (Sweden)

Shabir Ahmad Sofi

2017-05-01

Full Text Available Ad Hoc wireless sensor network (WSN is a collection of nodes that do not need to rely on predefined infrastructure to keep the network connected. The level of security and performance are always somehow related to each other, therefore due to limited resources in WSN, cryptographic methods for securing the network against attacks is not feasible. Byzantine attacks disrupt the communication between nodes in the network without regard to its own resource consumption. This paper discusses the performance of cluster based WSN comparing LEACH with Advanced node based clusters under byzantine attacks. This paper also proposes an algorithm for detection and isolation of the compromised nodes to mitigate the attacks by non-cryptographic means. The throughput increases after using the algorithm for isolation of the malicious nodes, 33% in case of Gray Hole attack and 62% in case of Black Hole attack.

Mobile ad hoc networking the cutting edge directions

CERN Document Server

Basagni, Stefano; Giordano, Silvia; Stojmenovic, Ivan

2013-01-01

""An excellent book for those who are interested in learning the current status of research and development . . . [and] who want to get a comprehensive overview of the current state-of-the-art.""-E-Streams This book provides up-to-date information on research and development in the rapidly growing area of networks based on the multihop ad hoc networking paradigm. It reviews all classes of networks that have successfully adopted this paradigm, pointing out how they penetrated the mass market and sparked breakthrough research. Covering both physical issues and applica

Integration of Body Sensor Networks and Vehicular Ad-hoc Networks for Traffic Safety

Directory of Open Access Journals (Sweden)

Angelica Reyes-Muñoz

2016-01-01

Full Text Available The emergence of Body Sensor Networks (BSNs constitutes a new and fast growing trend for the development of daily routine applications. However, in the case of heterogeneous BSNs integration with Vehicular ad hoc Networks (VANETs a large number of difficulties remain, that must be solved, especially when talking about the detection of human state factors that impair the driving of motor vehicles. The main contributions of this investigation are principally three: (1 an exhaustive review of the current mechanisms to detect four basic physiological behavior states (drowsy, drunk, driving under emotional state disorders and distracted driving that may cause traffic accidents is presented; (2 A middleware architecture is proposed. This architecture can communicate with the car dashboard, emergency services, vehicles belonging to the VANET and road or street facilities. This architecture seeks on the one hand to improve the car driving experience of the driver and on the other hand to extend security mechanisms for the surrounding individuals; and (3 as a proof of concept, an Android real-time attention low level detection application that runs in a next-generation smartphone is developed. The application features mechanisms that allow one to measure the degree of attention of a driver on the base of her/his EEG signals, establish wireless communication links via various standard wireless means, GPRS, Bluetooth and WiFi and issue alarms of critical low driver attention levels.

Integration of Body Sensor Networks and Vehicular Ad-hoc Networks for Traffic Safety

Science.gov (United States)

Reyes-Muñoz, Angelica; Domingo, Mari Carmen; López-Trinidad, Marco Antonio; Delgado, José Luis

2016-01-01

The emergence of Body Sensor Networks (BSNs) constitutes a new and fast growing trend for the development of daily routine applications. However, in the case of heterogeneous BSNs integration with Vehicular ad hoc Networks (VANETs) a large number of difficulties remain, that must be solved, especially when talking about the detection of human state factors that impair the driving of motor vehicles. The main contributions of this investigation are principally three: (1) an exhaustive review of the current mechanisms to detect four basic physiological behavior states (drowsy, drunk, driving under emotional state disorders and distracted driving) that may cause traffic accidents is presented; (2) A middleware architecture is proposed. This architecture can communicate with the car dashboard, emergency services, vehicles belonging to the VANET and road or street facilities. This architecture seeks on the one hand to improve the car driving experience of the driver and on the other hand to extend security mechanisms for the surrounding individuals; and (3) as a proof of concept, an Android real-time attention low level detection application that runs in a next-generation smartphone is developed. The application features mechanisms that allow one to measure the degree of attention of a driver on the base of her/his EEG signals, establish wireless communication links via various standard wireless means, GPRS, Bluetooth and WiFi and issue alarms of critical low driver attention levels. PMID:26784204

Energy-aware architecture for multi-rate ad hoc networks

Directory of Open Access Journals (Sweden)

Ahmed Yahya

2010-06-01

Full Text Available The backbone of ad hoc network design is energy performance and bandwidth resources limitations. Multi-rate adaptation architectures have been proposed to reduce the control overhead and to increase bandwidth utilization efficiency. In this paper, we propose a multi-rate protocol to provide the highest network performance under very low control overhead. The efficiency of the proposed auto multi-rate protocol is validated extensive simulations using QualNet network simulator. The simulation results demonstrate that our solution significantly improves the overall network performance.

A multi-radio, multi-hop ad-hoc radio communication network for Communications-Based Train Control (CBTC) with optimized frequency separation

DEFF Research Database (Denmark)

Farooq, Jahanzeb; Bro, Lars; Karstensen, Rasmus Thystrup

2018-01-01

to continuously associate (i.e. perform handshake) with the trackside Wi-Fi Access Points (AP) as it moves, which incurs communication delays. Additionally, these APs are connected to the wayside infrastructure via optical fiber cables that incur huge installation costs. Our earlier work presented a novel design...... in which trackside nodes function in ad-hoc Wi-Fi mode, which means no handshake has to be performed with them prior to transmitting. A node upon receiving packets from a train forwards these packets to the next node, forming a chain of nodes. Following this chain, packets reach the destination. To make...

Cross-Layer Design for Energy-Efficient Secure Multicast Communications in Ad Hoc Networks

National Research Council Canada - National Science Library

Lazos, Loukas; Poovendran, Radha

2004-01-01

.... They present an analytical formulation of the energy expenditure associated with the communication overhead of key management, and highlight its dependence on network topology and key distribution method...

Interference in wireless ad hoc networks with smart antennas

KAUST Repository

Alabdulmohsin, Ibrahim

2014-01-01

In this paper, we show that the use of directional antennas in wireless ad hoc networks can actually increase interference due to limitations of virtual carrier sensing. We derive a simple mathematical expression for interference in both physical

Modelling Mobility in Mobile AD-HOC Network Environments ...

African Journals Online (AJOL)

In the simulation of mobile ad-hoc networks (MANETs), the probability distribution governing the movement of nodes typically varies over time and converges to a steady state distribution, known as the stationary distribution. This paper presents and evaluates the stationary distribution for location, speed and pause time of a ...

Mitigate DoS and DDoS attacks in Mobile Ad Hoc Networks

DEFF Research Database (Denmark)

Michalas, Antonis; Komninos, Nikos; Prasad, Neeli R.

2011-01-01

This paper proposes a technique to defeat Denial of Service (DoS) and Distributed Denial of Service (DDoS) attacks in Ad Hoc Networks. The technique is divided into two main parts and with game theory and cryptographic puzzles. Introduced first is a new client puzzle to prevent DoS attacks...... in DoS and DDoS attacks. Experimental results show the effectiveness of the approach for devices with limited resources and for environments like ad hoc networks where nodes must exchange information quickly....

Spontaneous ad hoc mobile cloud computing network.

Science.gov (United States)

Lacuesta, Raquel; Lloret, Jaime; Sendra, Sandra; Peñalver, Lourdes

2014-01-01

Cloud computing helps users and companies to share computing resources instead of having local servers or personal devices to handle the applications. Smart devices are becoming one of the main information processing devices. Their computing features are reaching levels that let them create a mobile cloud computing network. But sometimes they are not able to create it and collaborate actively in the cloud because it is difficult for them to build easily a spontaneous network and configure its parameters. For this reason, in this paper, we are going to present the design and deployment of a spontaneous ad hoc mobile cloud computing network. In order to perform it, we have developed a trusted algorithm that is able to manage the activity of the nodes when they join and leave the network. The paper shows the network procedures and classes that have been designed. Our simulation results using Castalia show that our proposal presents a good efficiency and network performance even by using high number of nodes.

Authentication and consensus overhead in vehicular ad hoc networks

NARCIS (Netherlands)

Petit, Jonathan; Mammeri, Zoubir

Vehicular ad hoc networks aim at increasing passenger safety by exchanging warning messages between vehicles wirelessly. A main challenge is to resist to various malicious abuses and security attacks. However, any security mechanism comes with overhead. We analyze how the authentication algorithm

Autonomous Power Control MAC Protocol for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

2006-01-01

Full Text Available Battery energy limitation has become a performance bottleneck for mobile ad hoc networks. IEEE 802.11 has been adopted as the current standard MAC protocol for ad hoc networks. However, it was developed without considering energy efficiency. To solve this problem, many modifications on IEEE 802.11 to incorporate power control have been proposed in the literature. The main idea of these power control schemes is to use a maximum possible power level for transmitting RTS/CTS and the lowest acceptable power for sending DATA/ACK. However, these schemes may degrade network throughput and reduce the overall energy efficiency of the network. This paper proposes autonomous power control MAC protocol (APCMP, which allows mobile nodes dynamically adjusting power level for transmitting DATA/ACK according to the distances between the transmitter and its neighbors. In addition, the power level for transmitting RTS/CTS is also adjustable according to the power level for DATA/ACK packets. In this paper, the performance of APCMP protocol is evaluated by simulation and is compared with that of other protocols.

A New Hybrid Channel Access Scheme for Ad Hoc Networks

National Research Council Canada - National Science Library

Wang, Yu; Garcia-Luna-Aceves, J. J

2002-01-01

Many contention-based channel access schemes have been proposed for multi-hop ad hoc networks in the recent past, and they can be divided into two categories, sender-initiated and receiver-initiated...

BCDP: Budget Constrained and Delay-Bounded Placement for Hybrid Roadside Units in Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Peng Li

2014-11-01

Full Text Available In vehicular ad hoc networks, roadside units (RSUs placement has been proposed to improve the the overall network performance in many ITS applications. This paper addresses the budget constrained and delay-bounded placement problem (BCDP for roadside units in vehicular ad hoc networks. There are two types of RSUs: cable connected RSU (c-RSU and wireless RSU (w-RSU. c-RSUs are interconnected through wired lines, and they form the backbone of VANETs, while w-RSUs connect to other RSUs through wireless communication and serve as an economical extension of the coverage of c-RSUs. The delay-bounded coverage range and deployment cost of these two cases are totally different. We are given a budget constraint and a delay bound, the problem is how to find the optimal candidate sites with the maximal delay-bounded coverage to place RSUs such that a message from any c-RSU in the region can be disseminated to the more vehicles within the given budget constraint and delay bound. We first prove that the BCDP problem is NP-hard. Then we propose several algorithms to solve the BCDP problem. Simulation results show the heuristic algorithms can significantly improve the coverage range and reduce the total deployment cost, compared with other heuristic methods.

Adjusting Sensing Range to Maximize Throughput on Ad-Hoc Multi-Hop Wireless Networks

National Research Council Canada - National Science Library

Roberts, Christopher

2003-01-01

.... Such a network is referred to as a multi-hop ad-hoc network, or simply a multi-hop network. Most multi-hop network protocols use some form of carrier sensing to determine if the wireless channel is in use...

On the Impacts and Benefits of Implementing Full-Duplex Communications Links in an Underwater Acoustic Network

National Research Council Canada - National Science Library

Gibson, J; Larraza, A; Rice, J; Smith, K; Xie, G

2002-01-01

.... These networks may provide command and control for autonomous underwater vehicles, forward reporting by arrays of sensor grids, ad hoc communications links to covert forces, or positive control...

A multi-radio, multi-hop ad-hoc radio communication network for Communications-Based Train Control (CBTC): Introducing frequency separation for train-to-trackside communication

DEFF Research Database (Denmark)

Farooq, Jahanzeb; Bro, Lars; Karstensen, Rasmus Thystrup

2018-01-01

to continuously associate (i.e. perform handshake) with the trackside Wi-Fi Access Points (AP) as it moves, which incurs communication delays. Additionally, these APs are connected to the wayside infrastructure via optical fiber cables that incur considerable installation costs. Our earlier work presented a novel...... design in which trackside nodes function in ad-hoc WiFi mode, which means no handshake has to be performed with them prior to transmitting. A node upon receiving packets from a train forwards these packets to the next node, forming a chain of nodes. Following this chain, packets reach the destination...

Power-Aware Intrusion Detection in Mobile Ad Hoc Networks

Science.gov (United States)

Şen, Sevil; Clark, John A.; Tapiador, Juan E.

Mobile ad hoc networks (MANETs) are a highly promising new form of networking. However they are more vulnerable to attacks than wired networks. In addition, conventional intrusion detection systems (IDS) are ineffective and inefficient for highly dynamic and resource-constrained environments. Achieving an effective operational MANET requires tradeoffs to be made between functional and non-functional criteria. In this paper we show how Genetic Programming (GP) together with a Multi-Objective Evolutionary Algorithm (MOEA) can be used to synthesise intrusion detection programs that make optimal tradeoffs between security criteria and the power they consume.

Cognitive radio network in vehicular ad-hoc network (VANET: A survey

Directory of Open Access Journals (Sweden)

Joanne Mun-Yee Lim

2016-05-01

Full Text Available Cognitive radio network and Vehicular Ad hoc Network (VANET are recent emerging concepts in wireless networking. Cognitive radio network obtains knowledge of its operational geographical environment to manage sharing of spectrum between primary and secondary users, while VANET shares emergency safety messages among vehicles to ensure safety of users on the road. Cognitive radio network is employed in VANET to ensure the efficient use of spectrum, as well as to support VANET’s deployment. Random increase and decrease of spectrum users, unpredictable nature of VANET, high mobility, varying interference, security, packet scheduling and priority assignment are the challenges encountered in a typical cognitive VANET environment. This paper provides survey and critical analysis on different challenges of cognitive radio VANET, with discussion on the open issues, challenges and performance metrics, for different cognitive radio VANET applications.

Decentralized session initiation protocol solution in ad hoc networks

Science.gov (United States)

Han, Lu; Jin, Zhigang; Shu, Yantai; Dong, Linfang

2006-10-01

With the fast development of ad hoc networks, SIP has attracted more and more attention in multimedia service. This paper proposes a new architecture to provide SIP service for ad hoc users, although there is no centralized SIP server deployed. In this solution, we provide the SIP service by the introduction of two nodes: Designated SIP Server (DS) and its Backup Server (BDS). The nodes of ad hoc network designate DS and BDS when they join the session nodes set and when some pre-defined events occur. A new sip message type called REGISTRAR is presented so nodes can send others REGISTRAR message to declare they want to be DS. According to the IP information taken in the message, an algorithm works like the election of DR and BDR in OSPF protocol is used to vote DS and BDS SIP servers. Naturally, the DS will be replaced by BDS when the DS is down for predicable or unpredictable reasons. To facilitate this, the DS should register to the BDS and transfer a backup of the SIP users' database. Considering the possibility DS or BDS may abruptly go down, a special policy is given. When there is no DS and BDS, a new election procedure is triggered just like the startup phase. The paper also describes how SIP works normally in the decentralized model as well as the evaluation of its performance. All sessions based on SIP in ad hoc such as DS voting have been tested in the real experiments within a 500m*500m square area where about 30 random nodes are placed.

Two-terminal reliability analyses for a mobile ad hoc wireless network

International Nuclear Information System (INIS)

Cook, Jason L.; Ramirez-Marquez, Jose Emmanuel

2007-01-01

Reliability is one of the most important performance measures for emerging technologies. For these systems, shortcomings are often overlooked in early releases as the cutting edge technology overshadows a fragile design. Currently, the proliferation of the mobile ad hoc wireless networks (MAWN) is moving from cutting edge to commodity and thus, reliable performance will be expected. Generally, ad hoc networking is applied for the flexibility and mobility it provides. As a result, military and first responders employ this network scheme and the reliability of the network becomes paramount. To ensure reliability is achieved, one must first be able to analyze and calculate the reliability of the MAWN. This work describes the unique attributes of the MAWN and how the classical analysis of network reliability, where the network configuration is known a priori, can be adjusted to model and analyze this type of network. The methods developed acknowledge the dynamic and scalable nature of the MAWN along with its absence of infrastructure. Thus, the methods rely on a modeling approach that considers the probabilistic formation of different network configurations in a MAWN. Hence, this paper proposes reliability analysis methods that consider the effect of node mobility and the continuous changes in the network's connectivity

Cross-Layer Service Discovery Mechanism for OLSRv2 Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

M. Isabel Vara

2015-07-01

Full Text Available Service discovery plays an important role in mobile ad hoc networks (MANETs. The lack of central infrastructure, limited resources and high mobility make service discovery a challenging issue for this kind of network. This article proposes a new service discovery mechanism for discovering and advertising services integrated into the Optimized Link State Routing Protocol Version 2 (OLSRv2. In previous studies, we demonstrated the validity of a similar service discovery mechanism integrated into the previous version of OLSR (OLSRv1. In order to advertise services, we have added a new type-length-value structure (TLV to the OLSRv2 protocol, called service discovery message (SDM, according to the Generalized MANET Packet/Message Format defined in Request For Comments (RFC 5444. Each node in the ad hoc network only advertises its own services. The advertisement frequency is a user-configurable parameter, so that it can be modified depending on the user requirements. Each node maintains two service tables, one to store information about its own services and another one to store information about the services it discovers in the network. We present simulation results, that compare our service discovery integrated into OLSRv2 with the one defined for OLSRv1 and with the integration of service discovery in Ad hoc On-demand Distance Vector (AODV protocol, in terms of service discovery ratio, service latency and network overhead.

Cross-Layer Service Discovery Mechanism for OLSRv2 Mobile Ad Hoc Networks.

Science.gov (United States)

Vara, M Isabel; Campo, Celeste

2015-07-20

Service discovery plays an important role in mobile ad hoc networks (MANETs). The lack of central infrastructure, limited resources and high mobility make service discovery a challenging issue for this kind of network. This article proposes a new service discovery mechanism for discovering and advertising services integrated into the Optimized Link State Routing Protocol Version 2 (OLSRv2). In previous studies, we demonstrated the validity of a similar service discovery mechanism integrated into the previous version of OLSR (OLSRv1). In order to advertise services, we have added a new type-length-value structure (TLV) to the OLSRv2 protocol, called service discovery message (SDM), according to the Generalized MANET Packet/Message Format defined in Request For Comments (RFC) 5444. Each node in the ad hoc network only advertises its own services. The advertisement frequency is a user-configurable parameter, so that it can be modified depending on the user requirements. Each node maintains two service tables, one to store information about its own services and another one to store information about the services it discovers in the network. We present simulation results, that compare our service discovery integrated into OLSRv2 with the one defined for OLSRv1 and with the integration of service discovery in Ad hoc On-demand Distance Vector (AODV) protocol, in terms of service discovery ratio, service latency and network overhead.

Wireless ad hoc and sensor networks management, performance, and applications

CERN Document Server

He, Jing

2013-01-01

Although wireless sensor networks (WSNs) have been employed across a wide range of applications, there are very few books that emphasize the algorithm description, performance analysis, and applications of network management techniques in WSNs. Filling this need, Wireless Ad Hoc and Sensor Networks: Management, Performance, and Applications summarizes not only traditional and classical network management techniques, but also state-of-the-art techniques in this area. The articles presented are expository, but scholarly in nature, including the appropriate history background, a review of current

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

Science.gov (United States)

Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

2015-01-01

In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jeevaa Katiravan

2015-01-01

Full Text Available In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

MQARR-AODV: A NOVEL MULTIPATH QOS AWARE RELIABLE REVERSE ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORKS

Directory of Open Access Journals (Sweden)

K.G. Santhiya

2012-12-01

Full Text Available MANET (Mobile Ad-hoc Network is an infra structure less wireless ad-hoc network that does not require any basic central control. The topology of the network changes drastically due to very fast mobility of nodes. So an adaptive routing protocol is needed for routing in MANET. AODV (Ad-hoc On-demand Distance Vector routing is the effective and prominent on-demand Ad-hoc routing protocols. During route establishment phase in traditional AODV, only one route reply message will be sent in the reverse path to establish routing path. The high mobility of nodes may affect the reply messages which lead to the retransmission of route request message by the sender which in turn leads to higher communication delay, power consumption and the reduction in the ratio of packets delivered. Sending multiple route reply messages and establishing multiple paths in a single path discovery will reduce the routing overhead involved in maintaining the connection between source and destination nodes. Multipath routing can render high scalability, end-to-end throughput and provide load balancing in MANET. The new proposed novel Multipath QoS aware reliable routing protocol establishes two routes of maximum node disjoint paths and the data transfer is carried out in the two paths simultaneously. To select best paths, the new proposed protocol uses three parameters Link Eminence, MAC overhead and node residual energy. The experimental values prove that the MQARR-AODV protocol achieves high reliability, stability, low latency and outperforms AODV by the less energy consumption, overhead and delay.

Distributed optimization of a multisubchannel Ad Hoc cognitive radio network

KAUST Repository

Leith, Alex

2012-05-01

In this paper, we study the distributed-duality-based optimization of a multisubchannel ad hoc cognitive radio network (CRN) that coexists with a multicell primary radio network (PRN). For radio resource allocation in multiuser orthogonal frequency-division multiplexing (MU-OFDM) systems, the orthogonal-access-based exclusive subchannel assignment (ESA) technique has been a popular method, but it is suboptimal in ad hoc networks, because nonorthogonal access between multiple secondary-user links by using shared subchannel assignment (SSA) can bring a higher weighted sum rate. We utilize the Lagrangian dual composition tool and design low-complexity near-optimal SSA resource allocation methods, assuming practical discrete-rate modulation and that the CRN-to-PRN interference constraint has to strictly be satisfied. However, available SSA methods for CRNs are either suboptimal or involve high complexity and suffer from slow convergence. To address this problem, we design fast-convergence SSA duality schemes and introduce several novel methods to increase the speed of convergence and to satisfy various system constraints with low complexity. For practical implementation in ad hoc CRNs, we design distributed-duality schemes that involve only a small number of CRN local information exchanges for dual update. The effects of many system parameters are presented through simulation results, which show that the near-optimal SSA duality scheme can perform significantly better than the suboptimal ESA duality and SSA-iterative waterfilling schemes and that the performance loss of the distributed schemes is small, compared with their centralized counterparts. © 2012 IEEE.

Throughput Capacity of Ad Hoc Networks with Route Discovery

Directory of Open Access Journals (Sweden)

Blum Rick S

2007-01-01

Full Text Available Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network . However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity.

On-Demand Routing in Multi-hop Wireless Mobile Ad Hoc Networks

National Research Council Canada - National Science Library

Maltz, David A

2001-01-01

.... Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth...

Throughput and Fairness of Collision Avoidance Protocols in Ad Hoc Networks

National Research Council Canada - National Science Library

Garcia-Luna-Aceves, J. J; Wang, Yu

2004-01-01

.... In Section 1, The authors present an analytical modeling to derive the saturation throughput of these sender-initiated collision avoidance protocols in multi-hop ad hoc networks with nodes randomly...

A Multivariant Stream Analysis Approach to Detect and Mitigate DDoS Attacks in Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Raenu Kolandaisamy

2018-01-01

Full Text Available Vehicular Ad Hoc Networks (VANETs are rapidly gaining attention due to the diversity of services that they can potentially offer. However, VANET communication is vulnerable to numerous security threats such as Distributed Denial of Service (DDoS attacks. Dealing with these attacks in VANET is a challenging problem. Most of the existing DDoS detection techniques suffer from poor accuracy and high computational overhead. To cope with these problems, we present a novel Multivariant Stream Analysis (MVSA approach. The proposed MVSA approach maintains the multiple stages for detection DDoS attack in network. The Multivariant Stream Analysis gives unique result based on the Vehicle-to-Vehicle communication through Road Side Unit. The approach observes the traffic in different situations and time frames and maintains different rules for various traffic classes in various time windows. The performance of the MVSA is evaluated using an NS2 simulator. Simulation results demonstrate the effectiveness and efficiency of the MVSA regarding detection accuracy and reducing the impact on VANET communication.

Signaling-Free Max-Min Airtime Fairness in IEEE 802.11 Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Youngsoo Lee

2016-01-01

Full Text Available We propose a novel media access control (MAC protocol, referred to as signaling-free max-min airtime fair (SMAF MAC, to improve fairness and channel utilization in ad hoc networks based on IEEE 802.11 wireless local area networks (WLANs. We introduce busy time ratio (BTR as a measure for max-min airtime fairness. Each node estimates its BTR and adjusts the transmission duration by means of frame aggregation and fragmentation, so that it can implicitly announce the BTR to neighbor nodes. Based on the announced BTR, each of the neighbor nodes controls its contention window. In this way, the SMAF MAC works in a distributed manner without the need to know the max-min fair share of airtime, and it does not require exchanging explicit control messages among nodes to attain fairness. Moreover, we successfully incorporate the hidden node detection and resolution mechanisms into the SMAF MAC to deal with the hidden node problem in ad hoc networks. The simulation results confirm that the SMAF MAC enhances airtime fairness without degrading channel utilization, and it effectively resolves several serious problems in ad hoc networks such as the starvation, performance anomaly, and hidden node problems.

Formal reconstruction of attack scenarios in mobile ad hoc and sensor networks

Directory of Open Access Journals (Sweden)

Rekhis Slim

2011-01-01

Full Text Available Abstract Several techniques of theoretical digital investigation are presented in the literature but most of them are unsuitable to cope with attacks in wireless networks, especially in Mobile Ad hoc and Sensor Networks (MASNets. In this article, we propose a formal approach for digital investigation of security attacks in wireless networks. We provide a model for describing attack scenarios in a wireless environment, and system and network evidence generated consequently. The use of formal approaches is motivated by the need to avoid ad hoc generation of results that impedes the accuracy of analysis and integrity of investigation. We develop an inference system that integrates the two types of evidence, handles incompleteness and duplication of information in them, and allows possible and provable actions and attack scenarios to be generated. To illustrate the proposal, we consider a case study dealing with the investigation of a remote buffer overflow attack.

A Cross Layer Solution to Address TCP Intra-flow Performance Degradation in Multihop Ad hoc Networks

OpenAIRE

Rakocevic, V.; Hamadani, E.

2008-01-01

Incorporating the concept of TCP end-to-end congestion control for wireless networks is one of the primary concerns in designing ad hoc networks since TCP was primarily designed and optimized based on the assumptions for wired networks. In this study, our interest lies on tackling the TCP instability and in particular intra-flow instability problem since due to the nature of applications in multihop ad hoc networks, connection instability or starvation even for a short period of time can have...

On Throughput Improvement of Wireless Ad Hoc Networks with Hidden Nodes

Science.gov (United States)

Choi, Hong-Seok; Lim, Jong-Tae

In this letter, we present the throughput analysis of the wireless ad hoc networks based on the IEEE 802.11 MAC (Medium Access Control). Especially, our analysis includes the case with the hidden node problem so that it can be applied to the multi-hop networks. In addition, we suggest a new channel access control algorithm to maximize the network throughput and show the usefulness of the proposed algorithm through simulations.

Performance Analysis of Routing Protocols in Ad-hoc and Sensor Networking Environments

Directory of Open Access Journals (Sweden)

L. Gavrilovska

2009-06-01

Full Text Available Ad-hoc and sensor networks are becoming an increasingly popular wireless networking concepts lately. This paper analyzes and compares prominent routing schemes in these networking environments. The knowledge obtained can serve users to better understand short range wireless network solutions thus leading to options for implementation in various scenarios. In addition, it should aid researchers develop protocol improvements reliable for the technologies of interest.

Intelligent Stale-Frame Discards for Real-Time Video Streaming over Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Sheu Tsang-Ling

2009-01-01

Full Text Available Abstract This paper presents intelligent early packet discards (I-EPD for real-time video streaming over a multihop wireless ad hoc network. In a multihop wireless ad hoc network, the quality of transferring real-time video streams could be seriously degraded, since every intermediate node (IN functionally like relay device does not possess large buffer and sufficient bandwidth. Even worse, a selected relay node could leave or power off unexpectedly, which breaks the route to destination. Thus, a stale video frame is useless even if it can reach destination after network traffic becomes smooth or failed route is reconfigured. In the proposed I-EPD, an IN can intelligently determine whether a buffered video packet should be early discarded. For the purpose of validation, we implement the I-EPD on Linux-based embedded systems. Via the comparisons of performance metrics (packet/frame discards ratios, PSNR, etc., we demonstrate that video quality over a wireless ad hoc network can be substantially improved and unnecessary bandwidth wastage is greatly reduced.

QoS Routing in Ad-Hoc Networks Using GA and Multi-Objective Optimization

Directory of Open Access Journals (Sweden)

Admir Barolli

2011-01-01

Full Text Available Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing.

Studies on urban vehicular ad-hoc networks

CERN Document Server

Zhu, Hongzi

2013-01-01

With the advancement of wireless technology, vehicular ad hoc networks (VANETs) are emerging as a promising approach to realizing 'smart cities' and addressing many important transportation problems such as road safety, efficiency, and convenience.This brief provides an introduction to the large trace data set collected from thousands of taxis and buses in Shanghai, the largest metropolis in China. It also presents the challenges, design issues, performance modeling and evaluation of a wide spectrum of VANET research topics, ranging from realistic vehicular mobility models and opportunistic ro

Context dependent off loading for cloudlet in mobile ad-hoc network

Science.gov (United States)

Bhatt, N.; Nadesh, R. K.; ArivuSelvan, K.

2017-11-01

Cloud Computing in Mobile Ad-hoc network is emerging part of research consideration as the demand and competency of mobile devices increased in last few years. To follow out operation within the remote cloud builds the postponement and influences the administration standard. To keep away from this trouble cloudlet is presented. Cloudlet gives identical support of the devices as cloud at low inactivity however at high transfer speed. Be that as it may, choice of a cloudlet for offloading calculation with flat energy is a noteworthy test if multiple cloud let is accessible adjacent. Here I proposed energy and bandwidth (Traffic overload for communication with cloud) aware cloudlet selection strategy based on the context dependency of the device location. It works on the basis of mobile device location and bandwidth availability of cloudlet. The cloudlet offloading and selection process using given solution is simulated in Cloud ~ Simulator.

A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks.

Science.gov (United States)

Chen, Huifang; Ge, Linlin; Xie, Lei

2015-07-14

The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes.

Improving the Dominating-Set Routing over Delay-Tolerant Mobile Ad-Hoc Networks via Estimating Node Intermeeting Times

Directory of Open Access Journals (Sweden)

Preiss Bruno

2011-01-01

Full Text Available With limited coverage of wireless networks and frequent roaming of mobile users, providing a seamless communication service poses a technical challenge. In our previous research, we presented a supernode system architecture that employs the delay-tolerant network (DTN concept to provide seamless communications for roaming users over interconnected heterogeneous wireless networks. Mobile ad hoc networks (MANETs are considered a key component of the supernode system for services over an area not covered by other wireless networks. Within the super node system, a dominating-set routing technique is proposed to improve message delivery over MANETs and to achieve better resource utilization. The performance of the dominating-set routing technique depends on estimation accuracy of the probability of a future contact between nodes. This paper studies how node mobility can be modeled and used to better estimate the probability of a contact. We derive a distribution for the node-to-node intermeeting time and present numerical results to demonstrate that the distribution can be used to improve the dominating-set routing technique performance. Moreover, we investigate how the distribution can be employed to relax the constraints of selecting the dominating-set members in order to improve the system resource utilization.

The impact of brief team communication, leadership and team behavior training on ad hoc team performance in trauma care settings.

Science.gov (United States)

Roberts, Nicole K; Williams, Reed G; Schwind, Cathy J; Sutyak, John A; McDowell, Christopher; Griffen, David; Wall, Jarrod; Sanfey, Hilary; Chestnut, Audra; Meier, Andreas H; Wohltmann, Christopher; Clark, Ted R; Wetter, Nathan

2014-02-01

Communication breakdowns and care coordination problems often cause preventable adverse patient care events, which can be especially acute in the trauma setting, in which ad hoc teams have little time for advanced planning. Existing teamwork curricula do not address the particular issues associated with ad hoc emergency teams providing trauma care. Ad hoc trauma teams completed a preinstruction simulated trauma encounter and were provided with instruction on appropriate team behaviors and team communication. Teams completed a postinstruction simulated trauma encounter immediately afterward and 3 weeks later, then completed a questionnaire. Blinded raters rated videotapes of the simulations. Participants expressed high levels of satisfaction and intent to change practice after the intervention. Participants changed teamwork and communication behavior on the posttest, and changes were sustained after a 3-week interval, though there was some loss of retention. Brief training exercises can change teamwork and communication behaviors on ad hoc trauma teams. Copyright © 2014 Elsevier Inc. All rights reserved.

A tandem queueing model for delay analysis in disconnected ad hoc networks

NARCIS (Netherlands)

Al Hanbali, Ahmad; de Haan, Roland; Boucherie, Richardus J.; van Ommeren, Jan C.W.

2007-01-01

Ad hoc network routing protocols may fail to operate in the absence of an end-to-end connection from source to destination. This deficiency can be resolved by so-called opportunistic networking which exploits the mobility of the nodes by letting them operate as relays according to the

Model-based prototyping of an interoperability protocol for mobile ad-hoc networks

NARCIS (Netherlands)

Kristensen, L.M.; Westergaard, M.; Norgaard, P.C.; Romijn, J.; Smith, G.; Pol, van de J.

2005-01-01

We present an industrial project conducted at Ericsson Danmark A/S, Telebit where formal methods in the form of Coloured Petri Nets (CP-nets or CPNs) have been used for the specification of an interoperability protocol for routing packets between fixed core networks and mobile ad-hoc networks. The

A Tool for Visualizing Mobile Ad-Hoc Network Topology Definitions Files

National Research Council Canada - National Science Library

Nguyen, Binh Q

2006-01-01

This report documents a research and development effort that the U.S. Army Research Laboratory conducted in FY05 in support of the building of an emulated tactical mobile ad hoc network (MANET) research test bed...

ADNP-CSMA Random Multiple Access protocol application with the function of monitoring in Ad Hoc network

Directory of Open Access Journals (Sweden)

Zhan Gang

2016-01-01

Full Text Available In Ad Hoc networks,the net work of mobile nodes exchange information with their wireless transceiver equipment,the network throughput is in increased,compared to other such multiple hops network.Moreover along with the rapid development of modern information,communication business also will be increase.However,the access and adaptive of previous CSMA protocol are insufficient.According to these properties,this paper presents a kind of adaptive dual clock with monitoring function P-CSMA random multiple access protocol(ADNP-CSMA,and discusses two kinds of P-CSMA.ACK with monitoring function is introduced to maintain the stability of the whole system,and the introduction of dual clock mechanism reduces the channel of idle period.It calculate the system throughput expression through the method of average period,and the simulation results show that the system is constant in the case of high load throughput.

An Analysis of the Privacy Threat in Vehicular Ad Hoc Networks due to Radio Frequency Fingerprinting

Directory of Open Access Journals (Sweden)

Gianmarco Baldini

2017-01-01

Full Text Available In Vehicular Ad Hoc Networks (VANETs used in the road transportation sector, privacy risks may arise because vehicles could be tracked on the basis of the information transmitted by the Vehicle to Vehicle (V2V and Vehicle to Infrastructure (V2I communications implemented with the Dedicated Short Range Communications (DSRC standards operating at 5.9 GHz. Various techniques have been proposed in the literature to mitigate these privacy risks including the use of pseudonym schemes, but they are mostly focused on data anonymization at the network and application layer. At the physical layer, the capability to accurately identify and fingerprint wireless devices through their radio frequency (RF emissions has been demonstrated in the literature. This capability may generate a privacy threat because vehicles can be tracked using the RF emissions of their DSRC devices. This paper investigates the privacy risks related to RF fingerprinting to determine if privacy breaches are feasible in practice. In particular, this paper analyzes the tracking accuracy in challenging RF environments with high attenuation and fading.

Ad Hoc Transient Groups: Instruments for Awareness in Learning Networks

NARCIS (Netherlands)

Fetter, Sibren; Rajagopal, Kamakshi; Berlanga, Adriana; Sloep, Peter

2011-01-01

Fetter, S., Rajagopal, K., Berlanga, A. J., & Sloep, P. B. (2011). Ad Hoc Transient Groups: Instruments for Awareness in Learning Networks. In W. Reinhardt, T. D. Ullmann, P. Scott, V. Pammer, O. Conlan, & A. J. Berlanga (Eds.), Proceedings of the 1st European Workshop on Awareness and Reflection in

Intelligent Broadcasting in Mobile Ad Hoc Networks: Three Classes of Adaptive Protocols

Directory of Open Access Journals (Sweden)

Michael D. Colagrosso

2006-11-01

Full Text Available Because adaptability greatly improves the performance of a broadcast protocol, we identify three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET. We chose broadcasting because it functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by higher-level MANET functionality and applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, protocols tend to fail catastrophically in severe network environments. Our three classes of adaptive protocols are pure machine learning, intra-protocol learning, and inter-protocol learning. In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN builds a classifier and trains it on data collected from the network environment. Using intra-protocol learning, each MN consults a simple machine model for the optimal value of one of its free parameters. Lastly, in inter-protocol learning, MNs learn to switch between different broadcasting protocols based on network conditions. For each class of learning method, we create a prototypical protocol and examine its performance in simulation.

Intelligent Broadcasting in Mobile Ad Hoc Networks: Three Classes of Adaptive Protocols

Directory of Open Access Journals (Sweden)

Colagrosso Michael D

2007-01-01

Full Text Available Because adaptability greatly improves the performance of a broadcast protocol, we identify three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET. We chose broadcasting because it functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by higher-level MANET functionality and applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, protocols tend to fail catastrophically in severe network environments. Our three classes of adaptive protocols are pure machine learning, intra-protocol learning, and inter-protocol learning. In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN builds a classifier and trains it on data collected from the network environment. Using intra-protocol learning, each MN consults a simple machine model for the optimal value of one of its free parameters. Lastly, in inter-protocol learning, MNs learn to switch between different broadcasting protocols based on network conditions. For each class of learning method, we create a prototypical protocol and examine its performance in simulation.

A multi-radio, multi-hop ad-hoc radio communication network for Communications-Based Train Control (CBTC): Introducing frequency separation for train-to-trackside communication

DEFF Research Database (Denmark)

Farooq, Jahanzeb; Bro, Lars; Karstensen, Rasmus Thystrup

2018-01-01

Communications-Based Train Control (CBTC) is a modern signalling system that uses radio communication to transfer train control information between train and wayside. The trackside networks in these systems are mostly based on conventionalinfrastructureWi-Fi(IEEE802.11).Itmeansatrain has to conti...

A Proposal and Evaluation of Security Camera System at a Car Park in an Ad-Hoc Network

Science.gov (United States)

Uemura, Wataru; Murata, Masashi

In recent year, ad-hoc network technology has gained attention, which consists of not access points and base stations but of wireless nodes. In this network, it is difficult to maintain the whole data flow because of the absence of access points as the network administrator when nodes share the data. This paper proposes the security camera system which has only nodes sharing the taken pictures and has the robustness against the data destroying. The sender node cannot know whether packets are received or not by neighboring nodes in broadcasting because of a unidirectional communication. So in our proposed method, the sender node selects the receiver node from neighboring nodes, and they communicate with each other. On the other hand, neighboring nodes listen to packets between the sender node and the receiver node. After that, this method guarantees nodes of more than 1 which receive a data in broadcasting. We construct the security camera system using wireless nodes with the IEEE 802.15.4 specification and show the performance for security. At last, using the simulator we show the efficiency in the large environment, and conclude this paper.

Data management issues in mobile ad hoc networks.

Science.gov (United States)

Hara, Takahiro

2017-01-01

Research on mobile ad hoc networks (MANETs) has become a hot research topic since the middle 1990's. Over the first decade, most research focused on networking techniques, ignoring data management issues. We, however, realized early the importance of data management in MANETs, and have been conducting studies in this area for 15 years. In this review, we summarize some key technical issues related to data management in MANETs, and the studies we have done in addressing these issues, which include placement of data replicas, update management, and query processing with security management. The techniques proposed in our studies have been designed with deep considerations of MANET features including network partitioning, node participation/disappearance, limited network bandwidth, and energy efficiency. Our studies published in early 2000's have developed a new research field as data management in MANETs. Also, our recent studies are expected to be significant guidelines of new research directions. We conclude the review by discussing some future directions for research.

Energy Aware Cluster-Based Routing in Flying Ad-Hoc Networks.

Science.gov (United States)

Aadil, Farhan; Raza, Ali; Khan, Muhammad Fahad; Maqsood, Muazzam; Mehmood, Irfan; Rho, Seungmin

2018-05-03

Flying ad-hoc networks (FANETs) are a very vibrant research area nowadays. They have many military and civil applications. Limited battery energy and the high mobility of micro unmanned aerial vehicles (UAVs) represent their two main problems, i.e., short flight time and inefficient routing. In this paper, we try to address both of these problems by means of efficient clustering. First, we adjust the transmission power of the UAVs by anticipating their operational requirements. Optimal transmission range will have minimum packet loss ratio (PLR) and better link quality, which ultimately save the energy consumed during communication. Second, we use a variant of the K-Means Density clustering algorithm for selection of cluster heads. Optimal cluster heads enhance the cluster lifetime and reduce the routing overhead. The proposed model outperforms the state of the art artificial intelligence techniques such as Ant Colony Optimization-based clustering algorithm and Grey Wolf Optimization-based clustering algorithm. The performance of the proposed algorithm is evaluated in term of number of clusters, cluster building time, cluster lifetime and energy consumption.

Energy Aware Cluster-Based Routing in Flying Ad-Hoc Networks

Directory of Open Access Journals (Sweden)

Farhan Aadil

2018-05-01

Full Text Available Flying ad-hoc networks (FANETs are a very vibrant research area nowadays. They have many military and civil applications. Limited battery energy and the high mobility of micro unmanned aerial vehicles (UAVs represent their two main problems, i.e., short flight time and inefficient routing. In this paper, we try to address both of these problems by means of efficient clustering. First, we adjust the transmission power of the UAVs by anticipating their operational requirements. Optimal transmission range will have minimum packet loss ratio (PLR and better link quality, which ultimately save the energy consumed during communication. Second, we use a variant of the K-Means Density clustering algorithm for selection of cluster heads. Optimal cluster heads enhance the cluster lifetime and reduce the routing overhead. The proposed model outperforms the state of the art artificial intelligence techniques such as Ant Colony Optimization-based clustering algorithm and Grey Wolf Optimization-based clustering algorithm. The performance of the proposed algorithm is evaluated in term of number of clusters, cluster building time, cluster lifetime and energy consumption.

Peer-to-peer over mobile ad hoc networks (Chapter 11)

NARCIS (Netherlands)

Qadri, N.N.; Liotta, A.; Pierre, S.

2010-01-01

In this chapter we review various approaches for the convergence of Peer-to-Peer (P2P) and Mobile Ad hoc Networks (MANETs), identifying strengths and weaknesses, and putting things in perspective. P2P and MANETs are among the most active research topics in pervasive computing. The convergence of P2P

Multiplayer Game for DDoS Attacks Resilience in Ad Hoc Networks

DEFF Research Database (Denmark)

Mikalas, Antonis; Komninos, Nikos; Prasad, Neeli R.

2011-01-01

This paper proposes a multiplayer game to prevent Distributed Denial of Service attack (DDoS) in ad hoc networks. The multiplayer game is based on game theory and cryptographic puzzles. We divide requests from nodes into separate groups which decreases the ability of malicious nodes to cooperate...... with one another in order to effectively make a DDoS attack. Finally, through our experiments we have shown that the total overhead of the multiplayer game as well as the the total time that each node needs to be served is affordable for devices that have limited resources and for environments like ad hoc...

Topology Control with Anisotropic and Sector Turning Antennas in Ad-hoc and Sensor Networks

Directory of Open Access Journals (Sweden)

V. Černý

2011-01-01

Full Text Available During the last several years, technological advances have allowed the development of small, cheap, embedded, independent and rather powerful radio devices that can self-organise into data networks. Such networks are usually called ad-hoc networks or, sometimes, depending on the application field, sensor networks. One of the first standards for ad-hoc networks to impose itself as a fully industrial framework for data gathering and control over such devices is IEEE 802.15.4 and, on top of it, its pair network architecture: ZigBee. In the case of multiple radio devices clamped into a small geographical area, the lack of radio bandwidth becomes a major problem, leading to multiple data losses and unnecessary power drain from the batteries of these small devices. This problem is usually perceived as interference. The deployment of appropriate topology control mechanisms (TC can solve interference. All of these algorithms calculate TC on the basis of isotropic antenna radiation patterns in the horizontal plane.

The effect of DAD timeout period on address autoconfiguration in wireless ad-hoc networks

CSIR Research Space (South Africa)

Mutanga, MB

2011-09-01

Full Text Available Lack of manual management mechanisms in wireless ad-hoc networks means that automatic configuration of IP addresses and other related network parameters are very crucial. Many IP address autoconfiguration mechanisms have been proposed in literature...

Topology for efficient information dissemination in ad-hoc networking

Science.gov (United States)

Jennings, E.; Okino, C. M.

2002-01-01

In this paper, we explore the information dissemination problem in ad-hoc wirless networks. First, we analyze the probability of successful broadcast, assuming: the nodes are uniformly distributed, the available area has a lower bould relative to the total number of nodes, and there is zero knowledge of the overall topology of the network. By showing that the probability of such events is small, we are motivated to extract good graph topologies to minimize the overall transmissions. Three algorithms are used to generate topologies of the network with guaranteed connectivity. These are the minimum radius graph, the relative neighborhood graph and the minimum spanning tree. Our simulation shows that the relative neighborhood graph has certain good graph properties, which makes it suitable for efficient information dissemination.

Illustration, detection and prevention of sleep deprivation anomaly in mobile ad hoc networks

International Nuclear Information System (INIS)

Nadeem, A.; Ahsan, K.; Sarim, M.

2017-01-01

MANETs (Mobile Ad Hoc Networks) have applications in various walks of life from rescue operations to battle field operations, personal and commercial. However, routing operations in MANETs are still vulnerable to anomalies and DoS (Denial of Service) attacks such as sleep deprivation. In SD (Sleep Deprivation) attack malicious node exploits the vulnerability in the route discovery function of the reactive routing protocol for example AODV (Ad Hoc On-Demand Distance Vector). In this paper, we first illustrate the SD anomaly in MANETs and then propose a SD detection and prevention algorithm which efficiently deals with this attack. We assess the performance of our proposed approach through simulation, evaluating its successfulness using different network scenarios. (author)

On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

Science.gov (United States)

Mehic, M.; Fazio, P.; Voznak, M.; Partila, P.; Komosny, D.; Tovarek, J.; Chmelikova, Z.

2016-05-01

A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

New grid based test bed environment for carrying out ad-hoc networking experiments

CSIR Research Space (South Africa)

Johnson, D

2006-09-01

Full Text Available and the third is to do analysis on a real test bed network which has implemented the ad-hoc networking protocol. This paper concerns the third option. Most researchers who have done work on test bed environments have used either indoor Wifi inter-office links...

Protocols for Detection and Removal of Wormholes for Secure Routing and Neighborhood Creation in Wireless Ad Hoc Networks

Science.gov (United States)

Hayajneh, Thaier Saleh

2009-01-01

Wireless ad hoc networks are suitable and sometimes the only solution for several applications. Many applications, particularly those in military and critical civilian domains (such as battlefield surveillance and emergency rescue) require that ad hoc networks be secure and stable. In fact, security is one of the main barriers to the extensive use…

Improving VANETs Connectivity with a Totally Ad Hoc Living Mobile Backbone

Directory of Open Access Journals (Sweden)

Joilson Alves Junior

2015-01-01

Full Text Available The vehicular ad hoc network (VANET for intelligent transportation systems is an emerging concept to improve transportation security, reliability, and management. The network behavior can be totally different in topological aspects because of the mobility of vehicular nodes. The topology can be fully connected when the flow of vehicles is high and may have low connectivity or be invalid when the flow of vehicles is low or unbalanced. In big cities, the metropolitan buses that travel on exclusive lanes may be used to set up a metropolitan vehicular data network (backbone, raising the connectivity among the vehicles. Therefore, this paper proposes the implementation of a living mobile backbone, totally ad hoc (MOB-NET, which will provide infrastructure and raise the network connectivity. In order to show the viability of MOB-NET, statistical analyses were made with real data of express buses that travel through exclusive lanes, besides evaluations through simulations and analytic models. The statistic, analytic, and simulation results prove that the buses that travel through exclusive lanes can be used to build a communication network totally ad hoc and provide connectivity in more than 99% of the time, besides raising the delivery rate up to 95%.

Performance of Group Communication Over Ad-Hoc Networks

National Research Council Canada - National Science Library

Mosko, Marc; Garcia-Luna-Aceves, J. J

2002-01-01

... through a network of cluster trees, where a spanning tree joins groups of fully connected nodes. Through numerical analysis and simulations in GloMoSim, we show throughput, goodput, and loss rates for reliable and unreliable networks...

Selective epidemic broadcast algorithm to suppress broadcast storm in vehicular ad hoc networks

Directory of Open Access Journals (Sweden)

M. Chitra

2018-03-01

Full Text Available Broadcasting in Vehicular Ad Hoc Networks is the best way to spread emergency messages all over the network. With the dynamic nature of vehicular ad hoc networks, simple broadcast or flooding faces the problem called as Broadcast Storm Problem (BSP. The issue of the BSP will degrade the performance of a message broadcasting process like increased overhead, collision and dissemination delay. The paper is motivated to solve the problems in the existing Broadcast Strom Suppression Algorithms (BSSAs like p-Persistence, TLO, VSPB, G-SAB and SIR. This paper proposes to suppress the Broadcast Storm Problem and to improve the Emergency Safety message dissemination rate through a new BSSA based on Selective Epidemic Broadcast Algorithm (SEB. The simulation results clearly show that the SEB outperforms the existing algorithms in terms of ESM Delivery Ratio, Message Overhead, Collision Ratio, Broadcast Storm Ratio and Redundant Rebroadcast Ratio with decreased Dissemination Delay.

Fault Tolerant Mechanism for Multimedia Flows in Wireless Ad Hoc Networks Based on Fast Switching Paths

Directory of Open Access Journals (Sweden)

Juan R. Diaz

2014-01-01

Full Text Available Multimedia traffic can be forwarded through a wireless ad hoc network using the available resources of the nodes. Several models and protocols have been designed in order to organize and arrange the nodes to improve transmissions along the network. We use a cluster-based framework, called MWAHCA architecture, which optimizes multimedia transmissions over a wireless ad hoc network. It was proposed by us in a previous research work. This architecture is focused on decreasing quality of service (QoS parameters like latency, jitter, and packet loss, but other network features were not developed, like load balance or fault tolerance. In this paper, we propose a new fault tolerance mechanism, using as a base the MWAHCA architecture, in order to recover any multimedia flow crossing the wireless ad hoc network when there is a node failure. The algorithm can run independently for each multimedia flow. The main objective is to keep the QoS parameters as low as possible. To achieve this goal, the convergence time must be controlled and reduced. This paper provides the designed protocol, the analytical model of the algorithm, and a software application developed to test its performance in a real laboratory.

Cross-layer model design in wireless ad hoc networks for the Internet of Things.

Science.gov (United States)

Yang, Xin; Wang, Ling; Xie, Jian; Zhang, Zhaolin

2018-01-01

Wireless ad hoc networks can experience extreme fluctuations in transmission traffic in the Internet of Things, which is widely used today. Currently, the most crucial issues requiring attention for wireless ad hoc networks are making the best use of low traffic periods, reducing congestion during high traffic periods, and improving transmission performance. To solve these problems, the present paper proposes a novel cross-layer transmission model based on decentralized coded caching in the physical layer and a content division multiplexing scheme in the media access control layer. Simulation results demonstrate that the proposed model effectively addresses these issues by substantially increasing the throughput and successful transmission rate compared to existing protocols without a negative influence on delay, particularly for large scale networks under conditions of highly contrasting high and low traffic periods.

Cross-layer model design in wireless ad hoc networks for the Internet of Things.

Directory of Open Access Journals (Sweden)

Xin Yang

Full Text Available Wireless ad hoc networks can experience extreme fluctuations in transmission traffic in the Internet of Things, which is widely used today. Currently, the most crucial issues requiring attention for wireless ad hoc networks are making the best use of low traffic periods, reducing congestion during high traffic periods, and improving transmission performance. To solve these problems, the present paper proposes a novel cross-layer transmission model based on decentralized coded caching in the physical layer and a content division multiplexing scheme in the media access control layer. Simulation results demonstrate that the proposed model effectively addresses these issues by substantially increasing the throughput and successful transmission rate compared to existing protocols without a negative influence on delay, particularly for large scale networks under conditions of highly contrasting high and low traffic periods.

A LOOP-BASED APPROACH IN CLUSTERING AND ROUTING IN MOBILE AD HOC NETWORKS

Institute of Scientific and Technical Information of China (English)

Li Yanping; Wang Xin; Xue Xiangyang; C.K. Toh

2006-01-01

Although clustering is a convenient framework to enable traffic control and service support in Mobile Ad hoc NETworks (MANETs), it is seldom adopted in practice due to the additional traffic overhead it leads to for the resource limited ad hoc network. In order to address this problem, we proposed a loop-based approach to combine clustering and routing. By employing loop topologies, topology information is disseminated with a loop instead of a single node, which provides better robustness, and the nature of a loop that there are two paths between each pair of nodes within a loop suggests smart route recovery strategy. Our approach is composed of setup procedure, regular procedure and recovery procedure to achieve clustering, routing and emergent route recovering.

A Novel Medium Access Control for Ad hoc Networks Based on OFDM System

Institute of Scientific and Technical Information of China (English)

YU Yi-fan; YIN Chang-chuan; YUE Guang-xin

2005-01-01

Recently, hosts of Medium Access Control (MAC) protocols for Ad hoc radio networks have been proposed to solve the hidden terminal problem and exposed terminal problem. However most of them take into no account the interactions between physical (PHY) system and MAC protocol. Therefore, the current MAC protocols are either inefficient in the networks with mobile nodes and fading channel or difficult in hardware implementation. In this paper, we present a novel media access control for Ad hoc networks that integrates a media access control protocol termed as Dual Busy Tone Multiple Access (DBTMA) into Orthogonal Frequency Division Multiplexing (OFDM) system proposed in IEEE 802.11a standard. The analysis presented in the paper indicates that the proposed MAC scheme achieves performance improvement over IEEE 802.11 protocol about 25%～80% especially in the environment with high mobility and deep fading. The complexity of the proposed scheme is also lower than other implementation of similar busy tone solution. Furthermore, it is compatible with IEEE 802.11a networks.

A feedback-retransmission based asynchronous frequency hopping MAC protocol for military aeronautical ad hoc networks

Directory of Open Access Journals (Sweden)

Jinhui TANG

2018-05-01

Full Text Available Attacking time-sensitive targets has rigid demands for the timeliness and reliability of information transmission, while typical Media Access Control (MAC designed for this application works well only in very light-load scenarios; as a consequence, the performances of system throughput and channel utilization are degraded. For this problem, a feedback-retransmission based asynchronous FRequency hopping Media Access (FRMA control protocol is proposed. Burst communication, asynchronous Frequency Hopping (FH, channel coding, and feedback retransmission are utilized in FRMA. With the mechanism of asynchronous FH, immediate packet transmission and multi-packet reception can be realized, and thus the timeliness is improved. Furthermore, reliability can be achieved via channel coding and feedback retransmission. With theories of queuing theory, Markov model, packets collision model, and discrete Laplace transformation, the formulas of packet success probability, system throughput, average packet end-to-end delay, and delay distribution are obtained. The approximation accuracy of theoretical derivation is verified by experimental results. Within a light-load network, the proposed FRMA has the ability of millisecond delay and 99% reliability as well as outperforms the non-feedback-retransmission based asynchronous frequency hopping media access control protocol. Keywords: Ad hoc networks, Aeronautical communications, Frequency hopping, Media Access Control (MAC, Time-sensitive

The Ex hoc Architecture

DEFF Research Database (Denmark)

2006-01-01

Developed in the LIWAS project which develops technology for measuring road surfaces and communicating this data in an ad hoc environment. The communication part is built upon OOVM Resilient technology....

An Agent-Based Approach To Nodes Misbehaviour Detection In Mobile Ad-Hoc Networks

Directory of Open Access Journals (Sweden)

Otor Samera U.

2017-02-01

Full Text Available Existing Misbehaviour Detection Systems in Mobile Ad-hoc Networks MANETs are challenged with routing overhead and high latency resulting from complexity and failure to isolate and block misbehaving nodes for the reason that it is difficult to detect them as they participate fully in route finding. In this work a Mobile Agent-Based Acknowledgement scheme MAACK was formulated to address this problem using an object oriented algorithm deployed to report misbehaving nodes to the source and destination by registering the Internet Protocol IP address of misbehaving nodes in their header. The scheme was simulated using Network Simulator-3 NS-3 and results benchmarked with an existing scheme the Enhanced Adaptive Acknowledgment EAACK using packet delivery ratio routing overhead and latency as performance metrics in the two scenarios. The results showed that the MAACK paradigm guaranteed a higher packet delivery ratio lower latency and routing overhead than the EAACK scheme. The model can be adapted by Ad-Hoc network protocol developers.

Cooperative Caching in Mobile Ad Hoc Networks Based on Data Utility

Directory of Open Access Journals (Sweden)

Narottam Chand

2007-01-01

Full Text Available Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client's mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV, to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC, is developed that employs LUV as replacement policy. In ZC one-hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.

Impact of Beamforming on the Path Connectivity in Cognitive Radio Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Le The Dung

2017-03-01

Full Text Available This paper investigates the impact of using directional antennas and beamforming schemes on the connectivity of cognitive radio ad hoc networks (CRAHNs. Specifically, considering that secondary users use two kinds of directional antennas, i.e., uniform linear array (ULA and uniform circular array (UCA antennas, and two different beamforming schemes, i.e., randomized beamforming and center-directed to communicate with each other, we study the connectivity of all combination pairs of directional antennas and beamforming schemes and compare their performances to those of omnidirectional antennas. The results obtained in this paper show that, compared with omnidirectional transmission, beamforming transmission only benefits the connectivity when the density of secondary user is moderate. Moreover, the combination of UCA and randomized beamforming scheme gives the highest path connectivity in all evaluating scenarios. Finally, the number of antenna elements and degree of path loss greatly affect path connectivity in CRAHNs.

Detection and Prevention of Denial of Service (DoS Attacks in Mobile Ad Hoc Networks using Reputation-based Incentive Schemes

Directory of Open Access Journals (Sweden)

Mieso, K Denko

2005-08-01

Full Text Available Mobile ad hoc networks (MANETs are dynamic mobile networks that can be formed in the absence of any pre-existing communication infrastructure. In addition to node mobility, a MANET is characterized by limited resources such as bandwidth, battery power, and storage space. The underlying assumption in MANETs is that the intermediate nodes cooperate in forwarding packets. However, this assumption does not hold in commercial and emerging civilian applications. MANETs are vulnerable to Denial of Service (DoS due to their salient characteristics. There is a need to provide an incentive mechanism that can provide cooperation among nodes in the network and improve overall network performance by reducing DoS attacks. In this paper, we propose a reputation-based incentive mechanism for detecting and preventing DoS attacks. DoS attacks committed by selfish and malicious nodes were investigated. Our scheme motivates nodes to cooperate and excludes them from the network only if they fail to do so. We evaluated the performance of our scheme using the packet delivery ratio, the routing and communication overhead, and misbehaving node detection in a discrete event-simulation environment. The results indicate that a reputation-based incentive mechanism can significantly reduce the effect of DoS attacks and improve performance in MANETs.

Noise-Assisted Concurrent Multipath Traffic Distribution in Ad Hoc Networks

Science.gov (United States)

Murata, Masayuki

2013-01-01

The concept of biologically inspired networking has been introduced to tackle unpredictable and unstable situations in computer networks, especially in wireless ad hoc networks where network conditions are continuously changing, resulting in the need of robustness and adaptability of control methods. Unfortunately, existing methods often rely heavily on the detailed knowledge of each network component and the preconfigured, that is, fine-tuned, parameters. In this paper, we utilize a new concept, called attractor perturbation (AP), which enables controlling the network performance using only end-to-end information. Based on AP, we propose a concurrent multipath traffic distribution method, which aims at lowering the average end-to-end delay by only adjusting the transmission rate on each path. We demonstrate through simulations that, by utilizing the attractor perturbation relationship, the proposed method achieves a lower average end-to-end delay compared to other methods which do not take fluctuations into account. PMID:24319375

Predictive scheduling approach in Inter-piconet communications

DEFF Research Database (Denmark)

Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

2001-01-01

mobile devices. Originally it was developed as cable replacement. For the time being, it has been used as a mobile ad hoc network, which is intended for both voice and data communications, e.g. voice traffics, TCP/IP data traffics.. . Knowledge on mobile ad hoc network will be in need of studying...... delivered to end users in Bluetooth networks depends on large number of parameters at different levels, e.g. link capacity, packet delays.., which require various control and optimization methods. In this pa-per, an important part of inter-connected communications, inter-piconet scheduling, is mentioned...

Predictive scheduling approach in Inter-piconet communications

DEFF Research Database (Denmark)

Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

mobile devices. Originally it was developed as cable replacement. For the time being, it has been used as a mobile ad hoc network, which is intended for both voice and data communications, e.g. voice traffics, TCP/IP data traffics.. . Knowledge on mobile ad hoc network will be in need of studying...... delivered to end users in Bluetooth networks depends on large number of parameters at different levels, e.g. link capacity, packet delays.., which require various control and optimization methods. In this pa-per, an important part of inter-connected communications, inter-piconet scheduling, is mentioned...

BLESSED with Opportunistic Beacons: A Lightweight Data Dissemination Model for Smart Mobile Ad-Hoc Networks

NARCIS (Netherlands)

Türkes, Okan; Scholten, Johan; Havinga, Paul J.M.

2015-01-01

This paper introduces BLESSED, a universal opportunistic ad hoc networking model intended for smart mobile devices. It enables fast and lightweight data dissemination in wireless community networks through the complementary utilization of the IEEE 802.11 and Bluetooth Low Energy standards. As a

On Energy-Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Poor HVincent

2007-01-01

Full Text Available A hierarchical cross-layer design approach is proposed to increase energy efficiency in ad hoc networks through joint adaptation of nodes' transmitting powers and route selection. The design maintains the advantages of the classic OSI model, while accounting for the cross-coupling between layers, through information sharing. The proposed joint power control and routing algorithm is shown to increase significantly the overall energy efficiency of the network, at the expense of a moderate increase in complexity. Performance enhancement of the joint design using multiuser detection is also investigated, and it is shown that the use of multiuser detection can increase the capacity of the ad hoc network significantly for a given level of energy consumption.

On Energy-Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Cristina Comaniciu

2007-03-01

Full Text Available A hierarchical cross-layer design approach is proposed to increase energy efficiency in ad hoc networks through joint adaptation of nodes' transmitting powers and route selection. The design maintains the advantages of the classic OSI model, while accounting for the cross-coupling between layers, through information sharing. The proposed joint power control and routing algorithm is shown to increase significantly the overall energy efficiency of the network, at the expense of a moderate increase in complexity. Performance enhancement of the joint design using multiuser detection is also investigated, and it is shown that the use of multiuser detection can increase the capacity of the ad hoc network significantly for a given level of energy consumption.

PROTOCOLS FOR INCREASING THE LIFETIME OF NODES OF AD HOC WIRELESS NETWORKS

Directory of Open Access Journals (Sweden)

B.Malarkodi

2010-03-01

Full Text Available Power consumption of nodes in ad hoc networks is a critical issue as they predominantly operate on batteries. In order to improve the lifetime of an ad hoc network, all the nodes must be utilized evenly and the power required for connections must be minimized. Energy management deals with the process of managing energy resources by means of controlling the battery discharge, adjusting the transmission power and scheduling of power sources so as to increase the lifetime of the nodes of an ad hoc wireless network. In this paper, two protocols are proposed to improve the lifetime of the nodes. The first protocol assumes smart battery packages with L cells and uses dynamic programming (DP to optimally select the set of cells used to satisfy a request for power. The second one proposes a MAC layer protocol denoted as Power Aware medium Access Control (PAMAC protocol which enables the network layer to select a route with minimum total power requirement among the possible routes between a source and a destination provided all nodes in the routes have battery capacity above a threshold. The life time of the nodes using the DP based scheduling policy is found through simulation and compared with that obtained using the techniques reported in the literature. It is found that DP based policy increases the lifetime of the mobile nodes by a factor of 1.15 to 1.8. The life expectancy, the average power consumption and throughput of the network using PAMAC protocol are computed through simulation and compared with that of the other MAC layer protocols 802.11, MACA, and CSMA. Besides this, the life expectancy and average power consumption of the network for different values of threshold are also compared. From the simulation results, it is observed that PAMAC consumes the least power and provides the longest lifetime among the various MAC Layer protocols. Moreover, using PAMAC as the MAC layer protocol, the performance obtained using different routing layer

Energy-Aware Broadcasting and Multicasting in Wireless Ad Hoc Networks: A Cross-Layering Approach

National Research Council Canada - National Science Library

Wieselthier, Jeffrey E; Nguyen, Gam D; Ephremides, Anthony

2004-01-01

...) problems, especially when energy-aware operation is required. To address the specific problem of energy-aware tree construction in wireless ad hoc networks, we have developed the Broadcast Incremental Power (BIP...

Manet: A reliable Network in Disaster Areas. | Onwuka | Journal of ...

African Journals Online (AJOL)

This paper describes a communication network that is appropriate, suitable and reliable in any disaster: - Mobile Ad hoc Network (MANET). A mobile ad hoc network is formed dynamically by an autonomous system of mobile nodes that are connected via wireless links without using the existing network infrastructure or ...

Impact of Mobility on the Performance of Relaying in Ad Hoc Networks

NARCIS (Netherlands)

Al Hanbali, Ahmad; Kherani, A.A.; Groenevelt, R.; Nain, P.; Altman, E

2006-01-01

We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly different mobility patterns. We introduce and study the notion of relay throughput, i.e. the maximum rate at which a node can

FRCA: A Fuzzy Relevance-Based Cluster Head Selection Algorithm for Wireless Mobile Ad-Hoc Sensor Networks

Directory of Open Access Journals (Sweden)

Taegwon Jeong

2011-05-01

Full Text Available Clustering is an important mechanism that efficiently provides information for mobile nodes and improves the processing capacity of routing, bandwidth allocation, and resource management and sharing. Clustering algorithms can be based on such criteria as the battery power of nodes, mobility, network size, distance, speed and direction. Above all, in order to achieve good clustering performance, overhead should be minimized, allowing mobile nodes to join and leave without perturbing the membership of the cluster while preserving current cluster structure as much as possible. This paper proposes a Fuzzy Relevance-based Cluster head selection Algorithm (FRCA to solve problems found in existing wireless mobile ad hoc sensor networks, such as the node distribution found in dynamic properties due to mobility and flat structures and disturbance of the cluster formation. The proposed mechanism uses fuzzy relevance to select the cluster head for clustering in wireless mobile ad hoc sensor networks. In the simulation implemented on the NS-2 simulator, the proposed FRCA is compared with algorithms such as the Cluster-based Routing Protocol (CBRP, the Weighted-based Adaptive Clustering Algorithm (WACA, and the Scenario-based Clustering Algorithm for Mobile ad hoc networks (SCAM. The simulation results showed that the proposed FRCA achieves better performance than that of the other existing mechanisms.

FRCA: a fuzzy relevance-based cluster head selection algorithm for wireless mobile ad-hoc sensor networks.

Science.gov (United States)

Lee, Chongdeuk; Jeong, Taegwon

2011-01-01

Clustering is an important mechanism that efficiently provides information for mobile nodes and improves the processing capacity of routing, bandwidth allocation, and resource management and sharing. Clustering algorithms can be based on such criteria as the battery power of nodes, mobility, network size, distance, speed and direction. Above all, in order to achieve good clustering performance, overhead should be minimized, allowing mobile nodes to join and leave without perturbing the membership of the cluster while preserving current cluster structure as much as possible. This paper proposes a Fuzzy Relevance-based Cluster head selection Algorithm (FRCA) to solve problems found in existing wireless mobile ad hoc sensor networks, such as the node distribution found in dynamic properties due to mobility and flat structures and disturbance of the cluster formation. The proposed mechanism uses fuzzy relevance to select the cluster head for clustering in wireless mobile ad hoc sensor networks. In the simulation implemented on the NS-2 simulator, the proposed FRCA is compared with algorithms such as the Cluster-based Routing Protocol (CBRP), the Weighted-based Adaptive Clustering Algorithm (WACA), and the Scenario-based Clustering Algorithm for Mobile ad hoc networks (SCAM). The simulation results showed that the proposed FRCA achieves better performance than that of the other existing mechanisms.

A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks.

Science.gov (United States)

Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J; Pallarès Segarra, Esteve; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Sanvicente Gargallo, Emilio

2015-04-17

The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic. Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs.

A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Ahmad Mohamad Mezher

2015-04-01

Full Text Available The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc. could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic. Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs.

Implementation and Evaluation of Multichannel Multi-Interface Routing Mechanism with QoS-Consideration for Ad-Hoc Networks

Directory of Open Access Journals (Sweden)

Satoh Hiroki

2010-01-01

Full Text Available To accommodate real-time multimedia application while satisfying application-level QoS requirements in a wireless ad-hoc network, we need QoS control mechanisms. We proposed a new routing mechanism for a wireless ad-hoc network composed of nodes equipped with multiple network interfaces. By embedding information about channel usage in control messages of OLSRv2, each node obtains a view of topology and bandwidth information of the whole network. Based on the obtained information, a source node determines a logical path with the maximum available bandwidth to satisfy application-level QoS requirements. In this paper, we evaluated feasibility of the proposal through simulation and practical experiments and confirmed that our proposal effectively transferred multimedia packets over a logical path avoiding congested links. The load on a network is well distributed and the network can accommodate more sessions than OLSRv2 and QOLSR.

On knowledge transfer management as a learning process for ad hoc teams

Science.gov (United States)

Iliescu, D.

2017-08-01

Knowledge management represents an emerging domain becoming more and more important. Concepts like knowledge codification and personalisation, knowledge life-cycle, social and technological dimensions, knowledge transfer and learning management are integral parts. Focus goes here in the process of knowledge transfer for the case of ad hoc teams. The social dimension of knowledge transfer plays an important role. No single individual actors involved in the process, but a collective one, representing the organisation. It is critically important for knowledge to be managed from the life-cycle point of view. A complex communication network needs to be in place to supports the process of knowledge transfer. Two particular concepts, the bridge tie and transactive memory, would eventually enhance the communication. The paper focuses on an informational communication platform supporting the collaborative work on knowledge transfer. The platform facilitates the creation of a topic language to be used in knowledge modelling, storage and reuse, by the ad hoc teams.

A framework for reactive optimization in mobile ad hoc networks

DEFF Research Database (Denmark)

McClary, Dan; Syrotiuk, Violet; Kulahci, Murat

2008-01-01

We present a framework to optimize the performance of a mobile ad hoc network over a wide range of operating conditions. It includes screening experiments to quantify the parameters and interactions among parameters influential to throughput. Profile-driven regression is applied to obtain a model....... The predictive accuracy of the model is monitored and used to update the model dynamically. The results indicate the framework may be useful for the optimization of dynamic systems of high dimension....

Performance analysis of differentiated resource-sharing in a wireless ad-hoc network

NARCIS (Netherlands)

Roijers, F.; van den Berg, H.; Mandjes, M.

2010-01-01

In this paper we model and analyze a relay node in a wireless ad-hoc network; the capacity available at this node is used to both transmit traffic from the source nodes (towards the relay node), and to serve traffic at the relay node (so that it can be forwarded to successor nodes). Clearly, a

Data communications and computer communications network

International Nuclear Information System (INIS)

Kim, Jang Gwon; Gu, Chang Hoe

2005-03-01

This textbook is composed of twelve chapters, which are communication network introduction, foundation of data communication, data link control, circuit switching system, packet switching system, multiple access communication system, protocol and architecture, LAN, MAN communication network, integrated service digital network, internet and Asymmetric digital subscriber Line and Wireless Local Loop. Each chapter has the introduction of the technique, structure, function and practice problems. It also has the appendix on electricity and communication standards organization, characteristic table and glossary.

PSO-Optimized Hopfield Neural Network-Based Multipath Routing for Mobile Ad-hoc Networks

Directory of Open Access Journals (Sweden)

Mansour Sheikhan

2012-06-01

Full Text Available Mobile ad-hoc network (MANET is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task. Disjoint multipath routing protocols address this problem and increase the reliability, security and lifetime of network. However, selecting an optimal multipath is an NP-complete problem. In this paper, Hopfield neural network (HNN which its parameters are optimized by particle swarm optimization (PSO algorithm is proposed as multipath routing algorithm. Link expiration time (LET between each two nodes is used as the link reliability estimation metric. This approach can find either node-disjoint or link-disjoint paths in singlephase route discovery. Simulation results confirm that PSO-HNN routing algorithm has better performance as compared to backup path set selection algorithm (BPSA in terms of the path set reliability and number of paths in the set.

Ad hoc networking scheme for mobile cyber-physical systems

KAUST Repository

Bader, Ahmed; Alouini, Mohamed-Slim

2017-01-01

Embodiments of the present disclosure provide techniques for packet routing. In an embodiment, when a transmitting communication device injects a packet into a communication network, a receiving communication device that is closer to a sink

A Performance Evaluation Model for Mobile Ad Hoc Networks and Sensor Networks

Directory of Open Access Journals (Sweden)

Heng LUO

2014-03-01

Full Text Available Potential applications in areas such as military sites and disaster relief fields that are characterized by absence of prefixed infrastructure justify the development of mobile ad hoc networks (MANETs and wireless sensor networks (WSNs. However, unfavorable wireless links and dynamic topology are still challenging, leading to the proposal of a collection of routing protocols for MANETs and WSNs. Nevertheless the performance of algorithms may vary with deployment scenario due to the application dependent philosophy behind algorithms. In this paper, the performance evaluation problem for MANETs and WSNs is investigated and a novel performance ranking model, termed AHP-SAW, is proposed. For simplicity but without loss of generality, the performance of two routing protocols DSDV and DSR are studies based on which ranking results are provided. Extensive simulations show that an overall 37.2 %, at most, gain may be achieved based on the AHP-SAW model.

Performance Analysis of Ad Hoc Dispersed Spectrum Cognitive Radio Networks over Fading Channels

Directory of Open Access Journals (Sweden)

Mohammad Muneer

2011-01-01

Full Text Available Cognitive radio systems can utilize dispersed spectrum, and thus such approach is known as dispersed spectrum cognitive radio systems. In this paper, we first provide the performance analysis of such systems over fading channels. We derive the average symbol error probability of dispersed spectrum cognitive radio systems for two cases, where the channel for each frequency diversity band experiences independent and dependent Nakagami- fading. In addition, the derivation is extended to include the effects of modulation type and order by considering M-ary phase-shift keying ( -PSK and M-ary quadrature amplitude modulation -QAM schemes. We then consider the deployment of such cognitive radio systems in an ad hoc fashion. We consider an ad hoc dispersed spectrum cognitive radio network, where the nodes are assumed to be distributed in three dimension (3D. We derive the effective transport capacity considering a cubic grid distribution. Numerical results are presented to verify the theoretical analysis and show the performance of such networks.

Link reliability based hybrid routing for tactical mobile ad hoc network

Institute of Scientific and Technical Information of China (English)

Xie Xiaochuan; Wei Gang; Wu Keping; Wang Gang; Jia Shilou

2008-01-01

Tactical mobile ad hoc network (MANET) is a collection of mobile nodes forming a temporary network,without the aid of pre-established network infrastructure. The routing protocol has a crucial impact on the networkperformance in battlefields. Link reliability based hybrid routing (LRHR) is proposed, which is a novel hybrid routing protocol, for tactical MANET. Contrary to the traditional single path routing strategy, multiple paths are established between a pair of source-destination nodes. In the hybrid routing strategy, the rate of topological change provides a natural mechanism for switching dynamically between table-driven and on-demand routing. The simulation results indicate that the performances of the protocol in packet delivery ratio, routing overhead, and average end-to-end delay are better than the conventional routing protocol.

Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach

OpenAIRE

Gavalas, Damianos; Pantziou, Grammati; Konstantopoulos, Charalampos; Mamalis, Basilis

2011-01-01

Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to address those issues. In this work, we introduce an efficient distributed clustering algorithm that uses both location and energy metrics for cluster formation. Our proposed solution mainly addresses cluster stability, manageability and energy efficiency i...

A Dynamic Reputation Management System for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Eric Chiejina

2015-04-01

Full Text Available Nodes in mobile ad hoc networks (MANETs are mandated to utilize their limited energy resources in forwarding routing control and data packets for other nodes. Since a MANET lacks a centralized administration and control, a node may decide to act selfishly, either by refusing to respond to route requests from other nodes or deceitfully by responding to some route requests, but dropping the corresponding data packets that are presented for forwarding. A significant increase in the presence of these misbehaving nodes in a MANET can subsequently degrade network performance. In this paper, we propose a dynamic reputation management system for detecting and isolating misbehaving nodes in MANETs. Our model employs a novel direct monitoring technique to evaluate the reputation of a node in the network, which ensures that nodes that expend their energy in transmitting data and routing control packets for others are allowed to carry out their network activities while the misbehaving nodes are detected and isolated from the network. Simulation results show that our model is effective at curbing and mitigating the effects of misbehaving nodes in the network.

PUCA: A Pseudonym Scheme with User-Controlled Anonymity for Vehicular Ad-Hoc Networks (VANET)

NARCIS (Netherlands)

Förster, David; Kargl, Frank; Löhr, Hans

2014-01-01

Envisioned vehicular ad-hoc networks (VANET) standards use pseudonym certificates to provide secure and privacy-friendly message authentication. Revocation of long-term credentials is required to remove participants from the system, e.g. in case of vehicle theft. However, the current approach to

Probabilistic Modelling of Information Propagation in Wireless Mobile Ad-Hoc Network

DEFF Research Database (Denmark)

Schiøler, Henrik; Hansen, Martin Bøgsted; Schwefel, Hans-Peter

2005-01-01

In this paper the dynamics of broadcasting wireless ad-hoc networks is studied through probabilistic modelling. A randomized transmission discipline is assumed in accordance with existing MAC definitions such as WLAN with Decentralized Coordination or IEEE-802.15.4. Message reception is assumed...... to be governed by node power-down policies and is equivalently assumed to be randomized. Altogether randomization facilitates a probabilistic model in the shape of an integro-differential equation governing the propagation of information, where brownian node mobility may be accounted for by including an extra...... diffusion term. The established model is analyzed for transient behaviour and a travelling wave solution facilitates expressions for propagation speed as well as parametrized analysis of network reliability and node power consumption. Applications of the developed models for node localization and network...

Game Theory in Wireless Ad-Hoc Opportunistic Radios

OpenAIRE

Mumtaz, Shahid; Gameiro, Atilio

2010-01-01

Emerging research in game theory based power control applied to ad hoc opportunist networks shows much promise to help understand the complex interactions between OR nodes in this highly dynamic and distributed environment. Also, the employment of game theory in modeling dynamic situations for opportunist ad hoc networks where OR nodes have incomplete information has led to the application of largely unexplored games such as games of imperfect monitoring. Ad hoc security using game theory is ...

Modeling In-Network Aggregation in VANETs

NARCIS (Netherlands)

Dietzel, Stefan; Kargl, Frank; Heijenk, Geert; Schaub, Florian

2011-01-01

The multitude of applications envisioned for vehicular ad hoc networks requires efficient communication and dissemination mechanisms to prevent network congestion. In-network data aggregation promises to reduce bandwidth requirements and enable scalability in large vehicular networks. However, most

A Sensitive Secondary Users Selection Algorithm for Cognitive Radio Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Aohan Li

2016-03-01

Full Text Available Secondary Users (SUs are allowed to use the temporarily unused licensed spectrum without disturbing Primary Users (PUs in Cognitive Radio Ad Hoc Networks (CRAHNs. Existing architectures for CRAHNs impose energy-consuming Cognitive Radios (CRs on SUs. However, the advanced CRs will increase energy cost for their cognitive functionalities, which is undesirable for the battery powered devices. A new architecture referred to as spectral Requirement-based CRAHN (RCRAHN is proposed to enhance energy efficiency for CRAHNs in this paper. In RCRAHNs, only parts of SUs are equipped with CRs. SUs equipped with CRs are referred to as Cognitive Radio Users (CRUs. To further enhance energy efficiency of CRAHNs, we aim to select minimum CRUs to sense available spectrum. A non-linear programming problem is mathematically formulated under the constraints of energy efficiency and real-time. Considering the NP-hardness of the problem, a framework of a heuristic algorithm referred to as Sensitive Secondary Users Selection (SSUS was designed to compute the near-optimal solutions. The simulation results demonstrate that SSUS not only improves the energy efficiency, but also achieves satisfied performances in end-to-end delay and communication reliability.

A Sensitive Secondary Users Selection Algorithm for Cognitive Radio Ad Hoc Networks.

Science.gov (United States)

Li, Aohan; Han, Guangjie; Wan, Liangtian; Shu, Lei

2016-03-26

Secondary Users (SUs) are allowed to use the temporarily unused licensed spectrum without disturbing Primary Users (PUs) in Cognitive Radio Ad Hoc Networks (CRAHNs). Existing architectures for CRAHNs impose energy-consuming Cognitive Radios (CRs) on SUs. However, the advanced CRs will increase energy cost for their cognitive functionalities, which is undesirable for the battery powered devices. A new architecture referred to as spectral Requirement-based CRAHN (RCRAHN) is proposed to enhance energy efficiency for CRAHNs in this paper. In RCRAHNs, only parts of SUs are equipped with CRs. SUs equipped with CRs are referred to as Cognitive Radio Users (CRUs). To further enhance energy efficiency of CRAHNs, we aim to select minimum CRUs to sense available spectrum. A non-linear programming problem is mathematically formulated under the constraints of energy efficiency and real-time. Considering the NP-hardness of the problem, a framework of a heuristic algorithm referred to as Sensitive Secondary Users Selection (SSUS) was designed to compute the near-optimal solutions. The simulation results demonstrate that SSUS not only improves the energy efficiency, but also achieves satisfied performances in end-to-end delay and communication reliability.

Improving TCP Performance over Wireless Ad Hoc Networks with Busy Tone Assisted Scheme

Directory of Open Access Journals (Sweden)

Cai Lin

2006-01-01

Full Text Available It is well known that transmission control protocol (TCP performance degrades severely in IEEE 802.11-based wireless ad hoc networks. We first identify two critical issues leading to the TCP performance degradation: (1 unreliable broadcast, since broadcast frames are transmitted without the request-to-send and clear-to-send (RTS/CTS dialog and Data/ACK handshake, so they are vulnerable to the hidden terminal problem; and (2 false link failure which occurs when a node cannot successfully transmit data temporarily due to medium contention. We then propose a scheme to use a narrow-bandwidth, out-of-band busy tone channel to make reservation for broadcast and link error detection frames only. The proposed scheme is simple and power efficient, because only the sender needs to transmit two short messages in the busy tone channel before sending broadcast or link error detection frames in the data channel. Analytical results show that the proposed scheme can dramatically reduce the collision probability of broadcast and link error detection frames. Extensive simulations with different network topologies further demonstrate that the proposed scheme can improve TCP throughput by 23% to 150%, depending on user mobility, and effectively enhance both short-term and long-term fairness among coexisting TCP flows in multihop wireless ad hoc networks.

A Hybrid Energy Efficient Protocol for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Niranjan Kumar Ray

2016-01-01

Full Text Available We proposed an energy conservation technique called Location Based Topology Control with Sleep Scheduling for ad hoc networks. It uses the feature of both topology control approach and power management approach. Like the topology control approach, it attempts to reduce the transmission power of a node, which is determined from its neighborhood location information. A node goes to sleep state based on the traffic condition as that of power management approach. In the proposed scheme, a node goes to sleep state only when its absence does not create local partition in its neighborhood. We preformed extensive simulation to compare the proposed scheme with existing ones. Simulation results show that the energy consumption is lower with increase in the network lifetime and higher throughput in the proposed scheme.

MIMO Techniques for Jamming Threat Suppression in Vehicular Networks

Directory of Open Access Journals (Sweden)

Dimitrios Kosmanos

2016-01-01

Full Text Available Vehicular ad hoc networks have emerged as a promising field of research and development, since they will be able to accommodate a variety of applications, ranging from infotainment to traffic management and road safety. A specific security-related concern that vehicular ad hoc networks face is how to keep communication alive in the presence of radio frequency jamming, especially during emergency situations. Multiple Input Multiple Output techniques are proven to be able to improve some crucial parameters of vehicular communications such as communication range and throughput. In this article, we investigate how Multiple Input Multiple Output techniques can be used in vehicular ad hoc networks as active defense mechanisms in order to avoid jamming threats. For this reason, a variation of spatial multiplexing is proposed, namely, vSP4, which achieves not only high throughput but also a stable diversity gain upon the interference of a malicious jammer.

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

Science.gov (United States)

Robinson, Y Harold; Rajaram, M

2015-01-01

Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique.

A Mobility-Aware Link Enhancement Mechanism for Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Kai-Wen Hu

2008-04-01

Full Text Available With the growth up of internet in mobile commerce, researchers have reproduced various mobile applications that vary from entertainment and commercial services to diagnostic and safety tools. Mobility management has widely been recognized as one of the most challenging problems for seamless access to wireless networks. In this paper, a novel link enhancement mechanism is proposed to deal with mobility management problem in vehicular ad hoc networks. Two machine learning techniques, namely, particle swarm optimization and fuzzy logic systems, are incorporated into the proposed schemes to enhance the accuracy of prediction of link break and congestion occurrence. The experimental results verify the effectiveness and feasibility of the proposed schemes.

A Mobility-Aware Link Enhancement Mechanism for Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Huang Chenn-Jung

2008-01-01

Full Text Available Abstract With the growth up of internet in mobile commerce, researchers have reproduced various mobile applications that vary from entertainment and commercial services to diagnostic and safety tools. Mobility management has widely been recognized as one of the most challenging problems for seamless access to wireless networks. In this paper, a novel link enhancement mechanism is proposed to deal with mobility management problem in vehicular ad hoc networks. Two machine learning techniques, namely, particle swarm optimization and fuzzy logic systems, are incorporated into the proposed schemes to enhance the accuracy of prediction of link break and congestion occurrence. The experimental results verify the effectiveness and feasibility of the proposed schemes.

Ad hoc networking scheme for mobile cyber-physical systems

KAUST Repository

Bader, Ahmed

2017-08-17

Embodiments of the present disclosure provide techniques for packet routing. In an embodiment, when a transmitting communication device injects a packet into a communication network, a receiving communication device that is closer to a sink or destination than the transmitting communication device relays the packet in a first hop. In a subsequent hop, a receiving communication device evaluates position information conveyed by the transmitting communication device of the first hop to determine whether to forward the packet. Accordingly, a receiving communication device receiver that offers progress towards the sink can elect to forward the packet.

Broadcast Expenses Controlling Techniques in Mobile Ad-hoc Networks: A Survey

Directory of Open Access Journals (Sweden)

Naeem Ahmad

2016-07-01

Full Text Available The blind flooding of query packets in route discovery more often characterizes the broadcast storm problem, exponentially increases energy consumption of intermediate nodes and congests the entire network. In such a congested network, the task of establishing the path between resources may become very complex and unwieldy. An extensive research work has been done in this area to improve the route discovery phase of routing protocols by reducing broadcast expenses. The purpose of this study is to provide a comparative analysis of existing broadcasting techniques for the route discovery phase, in order to bring about an efficient broadcasting technique for determining the route with minimum conveying nodes in ad-hoc networks. The study is designed to highlight the collective merits and demerits of such broadcasting techniques along with certain conclusions that would contribute to the choice of broadcasting techniques.

移动Ad Hoc网络路由协议综述%A Survey of Routing Protocols for Mobile Ad Hoc Networks

Institute of Scientific and Technical Information of China (English)

张顺亮; 叶澄清; 李方敏

2003-01-01

A review of current research about routing protocols for mobile Ad Hoc networks is made. Based on classifying of them, the characteristic, the strength and the weakness of these protocols are evaluated respectively. Then some crucial strategies to improve the existing routing protocols are proposed. Besides, a frame of new routing protocol for Ad Hoc networks is put forward. Finally, open issues that still need investigation are listed.

An Automated Tool for the Creation of Desired Emulated Topologies of a Mobile Ad-Hoc Network

National Research Council Canada - National Science Library

Nguyen, Binh Q

2006-01-01

This report documents a research effort that the U.S. Army Research Laboratory conducted in FY 2005 in support of the development of advanced technologies for tactical mobile ad hoc networks (MANET...

Integrated Social and Quality of Service Trust Management of Mobile Groups in Ad Hoc Networks

Science.gov (United States)

2013-01-01

high resiliency to malicious attacks and misbehaving nodes. Keywords—trust management; mobile ad hoc networks; QoS trust; social trust; trust...paper we address an importance issue of trust management protocol design for MANETs: trust bias minimization despite misbehaving nodes performing

Communication devices for network-hopping communications and methods of network-hopping communications

Science.gov (United States)

Buttles, John W

2013-04-23

Wireless communication devices include a software-defined radio coupled to processing circuitry. The system controller is configured to execute computer programming code. Storage media is coupled to the system controller and includes computer programming code configured to cause the system controller to configure and reconfigure the software-defined radio to operate on each of a plurality of communication networks according to a selected sequence. Methods for communicating with a wireless device and methods of wireless network-hopping are also disclosed.

Specification and Validation of an Edge Router Discovery Protocol for Mobile Ad Hoc Networks

DEFF Research Database (Denmark)

Kristensen, Lars Michael; Jensen, Kurt

2004-01-01

We present an industrial project at Ericsson Telebit A/S where Coloured Petri Nets (CP-nets or CPNs) have been used for the design and specification of an edge router discovery protocol for mobile ad-hoc networks. The Edge Router Discovery Protocol (ERDP) supports an edge router in a stationary...

Impact of mobility on the performance of relaying in ad hoc networks (Extended version)

NARCIS (Netherlands)

Al Hanbali, A.; Kherani, A.A.; Groenevelt, R.; Nain, P.; Altman, E.

2007-01-01

We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly different mobility patterns. We introduce and study the notion of relay throughput, i.e. the maximum rate at which a node can

Multiple-Ring Digital Communication Network

Science.gov (United States)

Kirkham, Harold

1992-01-01

Optical-fiber digital communication network to support data-acquisition and control functions of electric-power-distribution networks. Optical-fiber links of communication network follow power-distribution routes. Since fiber crosses open power switches, communication network includes multiple interconnected loops with occasional spurs. At each intersection node is needed. Nodes of communication network include power-distribution substations and power-controlling units. In addition to serving data acquisition and control functions, each node acts as repeater, passing on messages to next node(s). Multiple-ring communication network operates on new AbNET protocol and features fiber-optic communication.

System optimization for peer-to-peer multi hop video broadcasting in wireless ad hoc networks

NARCIS (Netherlands)

Dedeoglu, V.; Atici, C.; Salman, F.S.; Sunay, M.O.

2008-01-01

We consider peer-to-peer video broadcasting using cooperation among peers in an ad hoc wireless network. As opposed to the traditional single hop broadcasting, multiple hops cause an increase in broadcast video quality while creating interference and increasing transmission delay. We develop

Selective Route Based on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network

Directory of Open Access Journals (Sweden)

Istikmal

2017-01-01

Full Text Available In this study, we developed network and throughput formulation models and proposed new method of the routing protocol algorithm with a cross-layer scheme based on signal-to-noise ratio (SNR. This method is an enhancement of routing protocol ad hoc on-demand distance vector (AODV. This proposed scheme uses selective route based on the SNR threshold in the reverse route mechanism. We developed AODV SNR-selective route (AODV SNR-SR for a mechanism better than AODV SNR, that is, the routing protocol that used average or sum of path SNR, and also better than AODV which is hop-count-based. We also used selective reverse route based on SNR mechanism, replacing the earlier method to avoid routing overhead. The simulation results show that AODV SNR-SR outperforms AODV SNR and AODV in terms of throughput, end-to-end delay, and routing overhead. This proposed method is expected to support Device-to-Device (D2D communications that are concerned with the quality of the channel awareness in the development of the future Fifth Generation (5G.

Unmanned Aerial ad Hoc Networks: Simulation-Based Evaluation of Entity Mobility Models’ Impact on Routing Performance

Directory of Open Access Journals (Sweden)

Jean-Daniel Medjo Me Biomo

2015-06-01

Full Text Available An unmanned aerial ad hoc network (UAANET is a special type of mobile ad hoc network (MANET. For these networks, researchers rely mostly on simulations to evaluate their proposed networking protocols. Hence, it is of great importance that the simulation environment of a UAANET replicates as much as possible the reality of UAVs. One major component of that environment is the movement pattern of the UAVs. This means that the mobility model used in simulations has to be thoroughly understood in terms of its impact on the performance of the network. In this paper, we investigate how mobility models affect the performance of UAANET in simulations in order to come up with conclusions/recommendations that provide a benchmark for future UAANET simulations. To that end, we first propose a few metrics to evaluate the mobility models. Then, we present five random entity mobility models that allow nodes to move almost freely and independently from one another and evaluate four carefully-chosen MANET/UAANET routing protocols: ad hoc on-demand distance vector (AODV, optimized link state routing (OLSR, reactive-geographic hybrid routing (RGR and geographic routing protocol (GRP. In addition, flooding is also evaluated. The results show a wide variation of the protocol performance over different mobility models. These performance differences can be explained by the mobility model characteristics, and we discuss these effects. The results of our analysis show that: (i the enhanced Gauss–Markov (EGM mobility model is best suited for UAANET; (ii OLSR, a table-driven proactive routing protocol, and GRP, a position-based geographic protocol, are the protocols most sensitive to the change of mobility models; (iii RGR, a reactive-geographic hybrid routing protocol, is best suited for UAANET.

Improvement over the OLSR Routing Protocol in Mobile Ad Hoc Networks by Eliminating the Unnecessary Loops

OpenAIRE

Shahram Behzad; Reza Fotohi; Shahram Jamali

2013-01-01

Mobile ad hoc networks are type of wireless networks in which any kind of infrastructure is not used, i.e. there are no infrastructures such as routers or switches or anything else on the network that can be used to support the network structure and the nodes has mobility. The purpose of this paper is to provide a better quality of the package delivery rate and the throughput, that is in need of powerful routing protocol standards, which can guarantee delivering of the packages to destination...

Optimal resource allocation for distributed video communication

CERN Document Server

He, Yifeng

2013-01-01

While most books on the subject focus on resource allocation in just one type of network, this book is the first to examine the common characteristics of multiple distributed video communication systems. Comprehensive and systematic, Optimal Resource Allocation for Distributed Video Communication presents a unified optimization framework for resource allocation across these systems. The book examines the techniques required for optimal resource allocation over Internet, wireless cellular networks, wireless ad hoc networks, and wireless sensor networks. It provides you with the required foundat

Resilient In-Network Aggregation for Vehicular Networks

NARCIS (Netherlands)

Dietzel, Stefan

2015-01-01

Applications for vehicular ad hoc networks (VANETs) are an active field of re- search with the potential to significantly contribute to driver safety, traffic efficiency, and comfort. Messages are typically exchanged and forwarded between vehicles using wireless communication, thereby creating a

Building Realistic Mobility Models for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Adrian Pullin

2018-04-01

Full Text Available A mobile ad hoc network (MANET is a self-configuring wireless network in which each node could act as a router, as well as a data source or sink. Its application areas include battlefields and vehicular and disaster areas. Many techniques applied to infrastructure-based networks are less effective in MANETs, with routing being a particular challenge. This paper presents a rigorous study into simulation techniques for evaluating routing solutions for MANETs with the aim of producing more realistic simulation models and thereby, more accurate protocol evaluations. MANET simulations require models that reflect the world in which the MANET is to operate. Much of the published research uses movement models, such as the random waypoint (RWP model, with arbitrary world sizes and node counts. This paper presents a technique for developing more realistic simulation models to test and evaluate MANET protocols. The technique is animation, which is applied to a realistic scenario to produce a model that accurately reflects the size and shape of the world, node count, movement patterns, and time period over which the MANET may operate. The animation technique has been used to develop a battlefield model based on established military tactics. Trace data has been used to build a model of maritime movements in the Irish Sea. Similar world models have been built using the random waypoint movement model for comparison. All models have been built using the ns-2 simulator. These models have been used to compare the performance of three routing protocols: dynamic source routing (DSR, destination-sequenced distance-vector routing (DSDV, and ad hoc n-demand distance vector routing (AODV. The findings reveal that protocol performance is dependent on the model used. In particular, it is shown that RWP models do not reflect the performance of these protocols under realistic circumstances, and protocol selection is subject to the scenario to which it is applied. To

Novel store–carry–forward scheme for message dissemination in vehicular ad-hoc networks

Directory of Open Access Journals (Sweden)

Truc D.T. Nguyen

2017-12-01

Full Text Available To improve traffic safety in intelligent transportation systems, vehicles formed by vehicular ad-hoc networks (VANETs conventionally disseminate warning messages to their nearby vehicles as soon as a dangerous situation occurs. In this paper, we propose a novel scheme employing a novel story–carry–forward (SCF mechanism to tackle the network partition and broadcast storm problems, which are two major challenges in VANETs. The experimental result in the Veins simulation framework shows that the proposed SCF scheme significantly mitigates broadcast storms relative to other schemes, and maintains good coverage across various traffic densities.

Group Centric Networking: Large Scale Over the Air Testing of Group Centric Networking

Science.gov (United States)

2016-11-01

Large Scale Over-the-Air Testing of Group Centric Networking Logan Mercer, Greg Kuperman, Andrew Hunter, Brian Proulx MIT Lincoln Laboratory...performance of Group Centric Networking (GCN), a networking protocol developed for robust and scalable communications in lossy networks where users are...devices, and the ad-hoc nature of the network . Group Centric Networking (GCN) is a proposed networking protocol that addresses challenges specific to

Computer-communication networks

CERN Document Server

Meditch, James S

1983-01-01

Computer- Communication Networks presents a collection of articles the focus of which is on the field of modeling, analysis, design, and performance optimization. It discusses the problem of modeling the performance of local area networks under file transfer. It addresses the design of multi-hop, mobile-user radio networks. Some of the topics covered in the book are the distributed packet switching queuing network design, some investigations on communication switching techniques in computer networks and the minimum hop flow assignment and routing subject to an average message delay constraint

MWAHCA: a multimedia wireless ad hoc cluster architecture.

Science.gov (United States)

Diaz, Juan R; Lloret, Jaime; Jimenez, Jose M; Sendra, Sandra

2014-01-01

Wireless Ad hoc networks provide a flexible and adaptable infrastructure to transport data over a great variety of environments. Recently, real-time audio and video data transmission has been increased due to the appearance of many multimedia applications. One of the major challenges is to ensure the quality of multimedia streams when they have passed through a wireless ad hoc network. It requires adapting the network architecture to the multimedia QoS requirements. In this paper we propose a new architecture to organize and manage cluster-based ad hoc networks in order to provide multimedia streams. Proposed architecture adapts the network wireless topology in order to improve the quality of audio and video transmissions. In order to achieve this goal, the architecture uses some information such as each node's capacity and the QoS parameters (bandwidth, delay, jitter, and packet loss). The architecture splits the network into clusters which are specialized in specific multimedia traffic. The real system performance study provided at the end of the paper will demonstrate the feasibility of the proposal.

MWAHCA: A Multimedia Wireless Ad Hoc Cluster Architecture

Directory of Open Access Journals (Sweden)

Juan R. Diaz

2014-01-01

Full Text Available Wireless Ad hoc networks provide a flexible and adaptable infrastructure to transport data over a great variety of environments. Recently, real-time audio and video data transmission has been increased due to the appearance of many multimedia applications. One of the major challenges is to ensure the quality of multimedia streams when they have passed through a wireless ad hoc network. It requires adapting the network architecture to the multimedia QoS requirements. In this paper we propose a new architecture to organize and manage cluster-based ad hoc networks in order to provide multimedia streams. Proposed architecture adapts the network wireless topology in order to improve the quality of audio and video transmissions. In order to achieve this goal, the architecture uses some information such as each node’s capacity and the QoS parameters (bandwidth, delay, jitter, and packet loss. The architecture splits the network into clusters which are specialized in specific multimedia traffic. The real system performance study provided at the end of the paper will demonstrate the feasibility of the proposal.

Energy-efficient algorithm for broadcasting in ad hoc wireless sensor networks.

Science.gov (United States)

Xiong, Naixue; Huang, Xingbo; Cheng, Hongju; Wan, Zheng

2013-04-12

Broadcasting is a common and basic operation used to support various network protocols in wireless networks. To achieve energy-efficient broadcasting is especially important for ad hoc wireless sensor networks because sensors are generally powered by batteries with limited lifetimes. Energy consumption for broadcast operations can be reduced by minimizing the number of relay nodes based on the observation that data transmission processes consume more energy than data reception processes in the sensor nodes, and how to improve the network lifetime is always an interesting issue in sensor network research. The minimum-energy broadcast problem is then equivalent to the problem of finding the minimum Connected Dominating Set (CDS) for a connected graph that is proved NP-complete. In this paper, we introduce an Efficient Minimum CDS algorithm (EMCDS) with help of a proposed ordered sequence list. EMCDS does not concern itself with node energy and broadcast operations might fail if relay nodes are out of energy. Next we have proposed a Minimum Energy-consumption Broadcast Scheme (MEBS) with a modified version of EMCDS, and aimed at providing an efficient scheduling scheme with maximized network lifetime. The simulation results show that the proposed EMCDS algorithm can find smaller CDS compared with related works, and the MEBS can help to increase the network lifetime by efficiently balancing energy among nodes in the networks.

Assured Resource Sharing in Ad-Hoc Collaboration

Energy Technology Data Exchange (ETDEWEB)

Ahn, Gail-Joon [Arizona State Univ., Tempe, AZ (United States)

2015-12-19

The project seeks an innovative framework to enable users to access and selectively share resources in distributed environments, enhancing the scalability of information sharing. We have investigated secure sharing & assurance approaches for ad-hoc collaboration, focused on Grids, Clouds, and ad-hoc network environments.

Streaming Multimedia via Overlay Networks using Wi-Fi Peer-to-Peer Connections

DEFF Research Database (Denmark)

Poderys, Justas; Soler, José

2017-01-01

Short range ad-hoc wireless networks can be used to deliver streaming multimedia for information, entertainment and advertisement purposes. To enable short-range communication between various devices, the Wi-Fi Alliance proposed an extension to the IEEE802.11 Wi-Fi standard called Wi-Fi Peer......-to-Peer (P2P). It allows compliant devices to form ad-hoc communication groups without interrupting conventional access point-based Wi-Fi communication. This paper proposes to use Wi-Fi P2P connectivity to distribute streaming multimedia in ah-hoc formed user groups. The exchange of multimedia data...... is performed by forming an overlay network using Peer-to-Peer Streaming Peer Protocol (PPSPP). In order to make PPSPP function over WiFi P2P connections, this paper proposes a number of changes to the protocol. The performance of the proposed system is evaluated using a computer networks emulator...

A reliable, delay bounded and less complex communication protocol for multicluster FANETs

Directory of Open Access Journals (Sweden)

Wajiya Zafar

2017-02-01

Full Text Available Recently, Flying Ad-hoc Networks (FANETs, enabling ad-hoc networking between Unmanned Aerial Vehicles (UAVs is gaining importance in several military and civilian applications. The sensitivity of the applications requires adaptive; efficient; delay bounded and scalable communication network among UAVs for data transmission. Due to communication protocol complexity; rigidity; cost of commercial-off-the-shelf (COT components; limited radio bandwidth; high mobility and computational resources; maintaining the desired level of Quality of Service (QoS becomes a daunting task. For the first time in this research we propose multicluster FANETs for efficient network management; the proposed scheme considerably reduces communication cost and optimizes network performance as well as exploit low power; less complex and low cost IEEE 802.15.4 (MAC protocol for intercluster and intracluster communication. In this research both beacon enabled mode and beaconless modes have been investigated with Guaranteed Time Slots (GTS and virtual Time Division Multiple Access (TDMA respectively. The methodology plays a key role towards reserving bandwidth for latency critical applications; eliminate collisions and medium access delays. Moreover analysis ad-hoc routing protocols including two proactive (OLSR, DSDV and one reactive (AODV is also presented. The results shows that the proposed scheme guarantees high packet delivery ratios while maintaining acceptable levels of latency requirements comparable with more complex and dedicatedly designed protocols in literature.

Cognitive Radio Networks for Tactical Wireless Communications

Science.gov (United States)

2014-12-01

exists. Instead, security is an evolving process, as we have seen in the context of WLANs and 2G / 3G networks. New system vulnerabilities continue to...in the network configuration and radio parameters take place due to mobility of platforms, and variation in other users of the RF environment. CRNs...dynamic spectrum access experimentally, and it represents the largest military Mobile Ad hoc Network (MANET) as of today. The WNaN demonstrator has been

Achieving sink node anonymity in tactical wireless sensor networks using a reactive routing protocol

Science.gov (United States)

2017-06-01

node anonymity, base station anonymity, Wireless Sensor Networks (WSN), Mobile Ad hoc Network (MANET), Lightweight Ad hoc On-Demand – Next Generation ... Generation (LOADng) reactive-routing protocol to achieve anonymity. This modified protocol prevents an attacker from identifying the sink node without...within the constraints of WSN communication protocols, specifically IEEE 802.15.4. We use and modify the Lightweight Ad hoc On-Demand – Next Generation

ARSENAL: A Cross Layer Architecture for Secure Resilient Tactical Mobile AdHoc Networks

Science.gov (United States)

2016-01-21

stations separated by 0.5 to 1 km can be coherently measured to a single mobile subscriber using LTE signaling. These are the first measurements of...undertake three parallel but inter-coupled tasks geared towards a) performing measurements via real deployments and enhancing our understanding of layer...dependencies and vulnerabilities in mobile ad hoc networks; these measurements will be on existing testbeds at The views, opinions and/or findings

Adaptive Capacity Management in Bluetooth Networks

OpenAIRE

Son, L.T.

2004-01-01

With the Internet and mobile wireless development, accelerated by high-speed and low cost VLSI device evolution, short range wireless communications have become more and more popular, especially Bluetooth. Bluetooth is a new short range radio technology that promises to be very convenient, low power, and low cost mobile ad hoc solution for the global interconnection of all mobile devices. To implement Bluetooth network as a true mobile ad hoc wireless network operating in short radio range, h...

Fourth international conference on Networks & Communications

CERN Document Server

Meghanathan, Natarajan; Nagamalai, Dhinaharan; Computer Networks & Communications (NetCom)

2013-01-01

Computer Networks & Communications (NetCom) is the proceedings from the Fourth International Conference on Networks & Communications. This book covers theory, methodology and applications of computer networks, network protocols and wireless networks, data communication technologies, and network security. The proceedings will feature peer-reviewed papers that illustrate research results, projects, surveys and industrial experiences that describe significant advances in the diverse areas of computer networks & communications.

Directional Medium Access Control (MAC Protocols in Wireless Ad Hoc and Sensor Networks: A Survey

Directory of Open Access Journals (Sweden)

David Tung Chong Wong

2015-06-01

Full Text Available This survey paper presents the state-of-the-art directional medium access control (MAC protocols in wireless ad hoc and sensor networks (WAHSNs. The key benefits of directional antennas over omni-directional antennas are longer communication range, less multipath interference, more spatial reuse, more secure communications, higher throughput and reduced latency. However, directional antennas lead to single-/multi-channel directional hidden/exposed terminals, deafness and neighborhood, head-of-line blocking, and MAC-layer capture which need to be overcome. Addressing these problems and benefits for directional antennas to MAC protocols leads to many classes of directional MAC protocols in WAHSNs. These classes of directional MAC protocols presented in this survey paper include single-channel, multi-channel, cooperative and cognitive directional MACs. Single-channel directional MAC protocols can be classified as contention-based or non-contention-based or hybrid-based, while multi-channel directional MAC protocols commonly use a common control channel for control packets/tones and one or more data channels for directional data transmissions. Cooperative directional MAC protocols improve throughput in WAHSNs via directional multi-rate/single-relay/multiple-relay/two frequency channels/polarization, while cognitive directional MAC protocols leverage on conventional directional MAC protocols with new twists to address dynamic spectrum access. All of these directional MAC protocols are the pillars for the design of future directional MAC protocols in WAHSNs.

Implementing a Topology Management Algorithm for Mobile Ad-Hoc Networks

Directory of Open Access Journals (Sweden)

Mrinal K. Naskar

2008-01-01

Full Text Available In this paper, we propose to maintain the topology of a MANET by suitably selecting multiple coordinators among the nodes constituting the MANET. The maintenance of topology in a mobile ad–hoc network is of primary importance because the routing techniques can only work if we have a connected network. Thus of the burning issues at present is to device algorithms which ensure that the network topology is always maintained. The basic philosophy behind our algorithm is to isolate two coordinators amongst the system based on positional data. Once elected, they are entrusted with the responsibility to emit signals of different frequencies while the other nodes individually decide the logic they need to follow in order to maintain the topology, thereby greatly reducing the overhead. As far as our knowledge goes, we are the first ones to introduce the concept of multiple coordinators which not only reduces the workload of the coordinator, but also eliminates the need of different signal ranges thereby ensuring greater efficiency. We have simulated the algorithm with the help of a number of robots using embedded systems. The results we have obtained have been quite encouraging.

Designing for Networked Communications

DEFF Research Database (Denmark)

Designing for Networked Communications: Strategies and Development explains how to plan, use, and understand the products and the dynamic social processes and tasks some of the most vital innovations in the knowledge society depend upon– social as well as technological. Focusing on various forms...... of design, implementation and integration of computer mediated communication, this book bridges the academic fields of computer science and communication studies. Designing for Networked Communications: Strategies and Development uses an interdisciplinary approach, and presents results from recent...... and important research in a variety of forms for networked communications. A constructive and critical view of the interplay between the new electronic and the more conventional modes of communication are utilized, while studies of organizational work practices demonstrate that the use of new technologies...

Wireless Sensor Network Quality of Service Improvement on Flooding Attack Condition

Science.gov (United States)

Hartono, R.; Widyawan; Wibowo, S. B.; Purnomo, A.; Hartatik

2018-03-01

There are two methods of building communication using wireless media. The first method is building a base infrastructure as an intermediary between users. Problems that arise on this type of network infrastructure is limited space to build any network physical infrastructure and also the cost factor. The second method is to build an ad hoc network between users who will communicate. On ad hoc network, each user must be willing to send data from source to destination for the occurrence of a communication. One of network protocol in Ad Hoc, Ad hoc on demand Distance Vector (AODV), has the smallest overhead value, easier to adapt to dynamic network and has small control message. One AODV protocol’s drawback is route finding process’ security for sending the data. In this research, AODV protocol is optimized by determining Expanding Ring Search (ERS) best value. Random topology is used with variation in the number of nodes: 25, 50, 75, 100, 125 and 150 with node’s speed of 10m/s in the area of 1000m x 1000m on flooding network condition. Parameters measured are Throughput, Packet Delivery Ratio, Average Delay and Normalized Routing Load. From the test results of AODV protocol optimization with best value of Expanding Ring Search (ERS), throughput increased by 5.67%, packet delivery ratio increased by 5.73%, and as for Normalized Routing Load decreased by 4.66%. ERS optimal value for each node’s condition depending on the number of nodes on the network.

1st International Conference on Intelligent Communication, Control and Devices

CERN Document Server

Choudhury, Sushabhan

2017-01-01

The book presents high-quality research papers presented at the first international conference, ICICCD 2016, organised by the Department of Electronics, Instrumentation and Control Engineering of University of Petroleum and Energy Studies, Dehradun on 2nd and 3rd April, 2016. The book is broadly divided into three sections: Intelligent Communication, Intelligent Control and Intelligent Devices. The areas covered under these sections are wireless communication and radio technologies, optical communication, communication hardware evolution, machine-to-machine communication networks, routing techniques, network analytics, network applications and services, satellite and space communications, technologies for e-communication, wireless Ad-Hoc and sensor networks, communications and information security, signal processing for communications, communication software, microwave informatics, robotics and automation, optimization techniques and algorithms, intelligent transport, mechatronics system, guidance and navigat...

Industrial Internet of Things Based Efficient and Reliable Data Dissemination Solution for Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Shahid Latif

2018-01-01

Full Text Available Industrial Internet of Things (IIoT is the other name of industrial Internet. It integrates a variety of existing industrial automation technologies with computing, machine learning, and communication technologies. Vehicular ad hoc network, an application of IIoT, is a self-organized network of vehicles which tends to provide improved road safety, diminished traffic congestion, and ultimate comfort to the travellers. In VANETs, vehicles exchange data with each other directly or through roadside units (RSUs. Data dissemination in VANETs experiences numerous challenging issues including broadcast storm, network partitions, intermittent connectivity between vehicles, and limited bandwidth. In literature, various data dissemination schemes are proposed. However, most of these schemes are designed for either urban or highway VANET scenarios and evaluated under sparse or dense traffic conditions. Moreover, these schemes do not effectively overcome the aforementioned issues simultaneously. In this paper, we present a new data dissemination protocol for VANETs, which disseminates the emergency messages in different scenarios under varying traffic conditions. During dense traffic conditions, DDP4V employs the segmentation of transmission region of a vehicle in order to select the most appropriate next forwarding vehicle (NFV. Accordingly, it divides the transmission region of a vehicle in three distinct segments and selects vehicle(s inside the highest priority segment to forward the message to all neighbour vehicles, whereas it also uses implicit acknowledgements for guaranteed message delivery during sparse traffic Conditions. Simulation results show that DDP4V protocol outperforms the other existing related protocols in terms of coverage, network overhead, collision, and end-to-end delay.

A MODIFIED ROUTE DISCOVERY APPROACH FOR DYNAMIC SOURCE ROUTING (DSR PROTOCOL IN MOBILE AD-HOC NETWORKS

Directory of Open Access Journals (Sweden)

Alaa Azmi Allahham

2017-02-01

Full Text Available Mobile Ad-hoc networks (MANETs involved in many applications, whether commercial or military because of their characteristics that do not depend on the infrastructure as well as the freedom movement of their elements, but in return has caused this random mobility of the nodes many of the challenges, where the routing is considered one of these challenges. There are many types of routing protocols that operate within MANET networks, which responsible for finding paths between the source and destination nodes with the modernization of these paths which are constantly changing due to the dynamic topology of the network stemming from the constant random movement of the nodes. The DSR (Dynamic Source Routing routing protocol algorithm is one of these routing protocols which consist of two main stages; route discovery and maintenance, where the route discovery algorithm operates based on blind flooding of request messages. blind flooding is considered as the most well known broadcasting mechanism, it is inefficient in terms of communication and resource utilization, which causing increasing the probability of collisions, repeating send several copies of the same message, as well as increasing the delay. Hence, a new mechanism in route discovery stage and in caching the routes in DSR algorithm according to the node's location in the network and the direction of the broadcast is proposed for better performance especially in terms of delay as well as redundant packets rate. The implementation of proposed algorithms showed positive results in terms of delay, overhead, and improve the performance of MANETs in general.

AUTHENTICATION ARCHITECTURE USING THRESHOLD CRYPTOGRAPHY IN KERBEROS FOR MOBILE AD HOC NETWORKS

Directory of Open Access Journals (Sweden)

Hadj Gharib

2014-06-01

Full Text Available The use of wireless technologies is gradually increasing and risks related to the use of these technologies are considerable. Due to their dynamically changing topology and open environment without a centralized policy control of a traditional network, a mobile ad hoc network (MANET is vulnerable to the presence of malicious nodes and attacks. The ideal solution to overcome a myriad of security concerns in MANET’s is the use of reliable authentication architecture. In this paper we propose a new key management scheme based on threshold cryptography in kerberos for MANET’s, the proposed scheme uses the elliptic curve cryptography method that consumes fewer resources well adapted to the wireless environment. Our approach shows a strength and effectiveness against attacks.

The entire network topology display system of terminal communication access network

OpenAIRE

An Yi

2016-01-01

Now order terminal communication access network is network technology in Shanxi Province is diversiform, device type complex, lack of unified technical standard, the terminal communication access network management system of construction constitutes a great obstacle. Need to build a “unified communication interface and communication standard, unified communications network management” of the terminal communication access network cut in the integrated network management system, for the termina...

Adaptive Probabilistic Broadcasting over Dense Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Victor Gau

2010-01-01

Full Text Available We propose an idle probability-based broadcasting method, iPro, which employs an adaptive probabilistic mechanism to improve performance of data broadcasting over dense wireless ad hoc networks. In multisource one-hop broadcast scenarios, the modeling and simulation results of the proposed iPro are shown to significantly outperform the standard IEEE 802.11 under saturated condition. Moreover, the results also show that without estimating the number of competing nodes and changing the contention window size, the performance of the proposed iPro can still approach the theoretical bound. We further apply iPro to multihop broadcasting scenarios, and the experiment results show that within the same elapsed time after the broadcasting, the proposed iPro has significantly higher Packet-Delivery Ratios (PDR than traditional methods.

A DNA-Inspired Encryption Methodology for Secure, Mobile Ad Hoc Networks

Science.gov (United States)

Shaw, Harry

2012-01-01

Users are pushing for greater physical mobility with their network and Internet access. Mobile ad hoc networks (MANET) can provide an efficient mobile network architecture, but security is a key concern. A figure summarizes differences in the state of network security for MANET and fixed networks. MANETs require the ability to distinguish trusted peers, and tolerate the ingress/egress of nodes on an unscheduled basis. Because the networks by their very nature are mobile and self-organizing, use of a Public Key Infra structure (PKI), X.509 certificates, RSA, and nonce ex changes becomes problematic if the ideal of MANET is to be achieved. Molecular biology models such as DNA evolution can provide a basis for a proprietary security architecture that achieves high degrees of diffusion and confusion, and resistance to cryptanalysis. A proprietary encryption mechanism was developed that uses the principles of DNA replication and steganography (hidden word cryptography) for confidentiality and authentication. The foundation of the approach includes organization of coded words and messages using base pairs organized into genes, an expandable genome consisting of DNA-based chromosome keys, and a DNA-based message encoding, replication, and evolution and fitness. In evolutionary computing, a fitness algorithm determines whether candidate solutions, in this case encrypted messages, are sufficiently encrypted to be transmitted. The technology provides a mechanism for confidential electronic traffic over a MANET without a PKI for authenticating users.

Integrated data lookup and replication scheme in mobile ad hoc networks

Science.gov (United States)

Chen, Kai; Nahrstedt, Klara

2001-11-01

Accessing remote data is a challenging task in mobile ad hoc networks. Two problems have to be solved: (1) how to learn about available data in the network; and (2) how to access desired data even when the original copy of the data is unreachable. In this paper, we develop an integrated data lookup and replication scheme to solve these problems. In our scheme, a group of mobile nodes collectively host a set of data to improve data accessibility for all members of the group. They exchange data availability information by broadcasting advertising (ad) messages to the group using an adaptive sending rate policy. The ad messages are used by other nodes to derive a local data lookup table, and to reduce data redundancy within a connected group. Our data replication scheme predicts group partitioning based on each node's current location and movement patterns, and replicates data to other partitions before partitioning occurs. Our simulations show that data availability information can quickly propagate throughout the network, and that the successful data access ratio of each node is significantly improved.

Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

OpenAIRE

Schurgot, Mary R.; Comaniciu, Cristina; Jaffrès-Runser, Katia

2011-01-01

This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward social-based routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance tradeoffs from a multi-objective perspective is highlighted.

Devices and Control Strategies for AD HOC Optical Communications Networks

National Research Council Canada - National Science Library

Baillieul, John; Bifano, Thomas G

2006-01-01

... (both hardware and operational concepts) that we plan to develop in initiating an ambitious program of research to develop a radical new technology for high-bandwidth, stealthy communication over free-space optical links...

Securing mobile ad hoc networks using danger theory-based artificial immune algorithm.

Science.gov (United States)

Abdelhaq, Maha; Alsaqour, Raed; Abdelhaq, Shawkat

2015-01-01

A mobile ad hoc network (MANET) is a set of mobile, decentralized, and self-organizing nodes that are used in special cases, such as in the military. MANET properties render the environment of this network vulnerable to different types of attacks, including black hole, wormhole and flooding-based attacks. Flooding-based attacks are one of the most dangerous attacks that aim to consume all network resources and thus paralyze the functionality of the whole network. Therefore, the objective of this paper is to investigate the capability of a danger theory-based artificial immune algorithm called the mobile dendritic cell algorithm (MDCA) to detect flooding-based attacks in MANETs. The MDCA applies the dendritic cell algorithm (DCA) to secure the MANET with additional improvements. The MDCA is tested and validated using Qualnet v7.1 simulation tool. This work also introduces a new simulation module for a flooding attack called the resource consumption attack (RCA) using Qualnet v7.1. The results highlight the high efficiency of the MDCA in detecting RCAs in MANETs.

User Needs and Advances in Space Wireless Sensing and Communications

Science.gov (United States)

Kegege, Obadiah

2017-01-01

Decades of space exploration and technology trends for future missions show the need for new approaches in space/planetary sensor networks, observatories, internetworking, and communications/data delivery to Earth. The User Needs to be discussed in this talk includes interviews with several scientists and reviews of mission concepts for the next generation of sensors, observatories, and planetary surface missions. These observatories, sensors are envisioned to operate in extreme environments, with advanced autonomy, whereby sometimes communication to Earth is intermittent and delayed. These sensor nodes require software defined networking capabilities in order to learn and adapt to the environment, collect science data, internetwork, and communicate. Also, some user cases require the level of intelligence to manage network functions (either as a host), mobility, security, and interface data to the physical radio/optical layer. For instance, on a planetary surface, autonomous sensor nodes would create their own ad-hoc network, with some nodes handling communication capabilities between the wireless sensor networks and orbiting relay satellites. A section of this talk will cover the advances in space communication and internetworking to support future space missions. NASA's Space Communications and Navigation (SCaN) program continues to evolve with the development of optical communication, a new vision of the integrated network architecture with more capabilities, and the adoption of CCSDS space internetworking protocols. Advances in wireless communications hardware and electronics have enabled software defined networking (DVB-S2, VCM, ACM, DTN, Ad hoc, etc.) protocols for improved wireless communication and network management. Developing technologies to fulfil these user needs for wireless communications and adoption of standardized communication/internetworking protocols will be a huge benefit to future planetary missions, space observatories, and manned missions

Optimal channel choice for collaborative ad-hoc dissemination

DEFF Research Database (Denmark)

Hu, Liang; Boudec, J-Y. L.; Vojnovic, M.

2010-01-01

Collaborative ad-hoc dissemination of information has been proposed as an efficient means to disseminate information among devices in a wireless ad-hoc network. Devices help in forwarding the information channels to the entire network, by disseminating the channels they subscribe to, plus others...... by a Metropolis-Hastings sampling algorithm. We also give a variant that accounts for battery level. This leads to a practical channel selection and re-selection algorithm that can be implemented without any central control....

Construction of Pipelined Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Ceronmani Sharmila

2016-06-01

Full Text Available Efficient routing between nodes is the most important challenge in a Mobile Ad Hoc Network (MANET. A Connected Dominating Set (CDS acts as a virtual backbone for routing in a MANET. Hence, the construction of CDS based on the need and its application plays a vital role in the applications of MANET. The PipeLined Strategic CDS (PLS-CDS is constructed based on strategy, dynamic diameter and transmission range. The strategy used for selecting the starting node is, any source node in the network, which has its entire destination within a virtual pipelined coverage, instead of the node with maximum connectivity. The other nodes are then selected based on density and velocity. The proposed CDS also utilizes the energy of the nodes in the network in an optimized manner. Simulation results showed that the proposed algorithm is better in terms of size of the CDS and average hop per path length.

An enhanced performance through agent-based secure approach for mobile ad hoc networks

Science.gov (United States)

Bisen, Dhananjay; Sharma, Sanjeev

2018-01-01

This paper proposes an agent-based secure enhanced performance approach (AB-SEP) for mobile ad hoc network. In this approach, agent nodes are selected through optimal node reliability as a factor. This factor is calculated on the basis of node performance features such as degree difference, normalised distance value, energy level, mobility and optimal hello interval of node. After selection of agent nodes, a procedure of malicious behaviour detection is performed using fuzzy-based secure architecture (FBSA). To evaluate the performance of the proposed approach, comparative analysis is done with conventional schemes using performance parameters such as packet delivery ratio, throughput, total packet forwarding, network overhead, end-to-end delay and percentage of malicious detection.

SOCIAL NETWORKS AND INTERPERSONAL COMMUNICATION

Directory of Open Access Journals (Sweden)

Veronica GHEORGHIȚĂ

2014-11-01

Full Text Available Social networks visible influence people's ability to interact and communicate. Extending social circles by establishing virtual links involves a number of positive aspects such as: instant access to options for interaction, sharing of information to large communities of people, intensification of acts of communication, high levels of feedback and trust with people with whom we communicate. On the other hand, social networks adversely affects communication by decreasing the interaction face to face, by imposing superficial communications experiences, grammatical and spelling erosion of the language. Therefore, the study aims to capture the spread of social networks, their use and impact on interpersonal communication. More specifically, they look for the answer to the question: what is the nature of interpersonal communication that is found on social networking sites: personal, emotional, private or shared, informal, and public?

Management of Tactical Ad Hoc Networks With C2 Data Models

National Research Council Canada - National Science Library

Brand, John

2002-01-01

The U.S. Army Research Laboratory is investigating the exploitation of preloaded reference data to solve problems in tactical network management By closely evaluating how communications networks are described...

Forming an ad-hoc nearby storage, based on IKAROS and social networking services

International Nuclear Information System (INIS)

Filippidis, Christos; Cotronis, Yiannis; Markou, Christos

2014-01-01

We present an ad-hoc 'nearby' storage, based on IKAROS and social networking services, such as Facebook. By design, IKAROS is capable to increase or decrease the number of nodes of the I/O system instance on the fly, without bringing everything down or losing data. IKAROS is capable to decide the file partition distribution schema, by taking on account requests from the user or an application, as well as a domain or a Virtual Organization policy. In this way, it is possible to form multiple instances of smaller capacity higher bandwidth storage utilities capable to respond in an ad-hoc manner. This approach, focusing on flexibility, can scale both up and down and so can provide more cost effective infrastructures for both large scale and smaller size systems. A set of experiments is performed comparing IKAROS with PVFS2 by using multiple clients requests under HPC IOR benchmark and MPICH2.

Forming an ad-hoc nearby storage, based on IKAROS and social networking services

Science.gov (United States)

Filippidis, Christos; Cotronis, Yiannis; Markou, Christos

2014-06-01

We present an ad-hoc "nearby" storage, based on IKAROS and social networking services, such as Facebook. By design, IKAROS is capable to increase or decrease the number of nodes of the I/O system instance on the fly, without bringing everything down or losing data. IKAROS is capable to decide the file partition distribution schema, by taking on account requests from the user or an application, as well as a domain or a Virtual Organization policy. In this way, it is possible to form multiple instances of smaller capacity higher bandwidth storage utilities capable to respond in an ad-hoc manner. This approach, focusing on flexibility, can scale both up and down and so can provide more cost effective infrastructures for both large scale and smaller size systems. A set of experiments is performed comparing IKAROS with PVFS2 by using multiple clients requests under HPC IOR benchmark and MPICH2.

Impact of mobility on the performance7 of relaying in ad hoc networks – Extended version

NARCIS (Netherlands)

Al Hanbali, Ahmad; Kherani, A.A.; Groenevelt, R.; Nain, P.; Altman, E

2007-01-01

We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly different mobility patterns. We introduce and study the notion of relay throughput, i.e. the maximum rate at which a node can

Optimalization of Beacon Selection for Localization in Wireless AD-HOC Networks

Directory of Open Access Journals (Sweden)

Martin Matula

2008-01-01

Full Text Available In this paper we engage in optimalization of convenient beacons for localization position of a node in the ad-hoc network. An algorithm designed by us localizes position of moving or static node by RSS (Received Signal Strength method and trilateration. At first, localization of unknown node runs by combination of all beacons. Than optimalizating algorithmreduces the number of beacons (and repeats localization, while only three left. Its reduction is based on highest levels of received signal strength. It is only when signals are from the nearest beacons. Position localizating exactness is statistically interpreted from all localization by beacons combination and its repeating.

Fifth International Conference on Networks & Communications

CERN Document Server

Nagamalai, Dhinaharan; Rajasekaran, Sanguthevar

2014-01-01

This book covers theory, methodology and applications of computer networks, network protocols and wireless networks, data communication technologies, and network security. The book is based on the proceedings from the Fifth International Conference on Networks & Communications (NetCom). The proceedings will feature peer-reviewed papers that illustrate research results, projects, surveys and industrial experiences that describe significant advances in the diverse areas of computer networks & communications.

Intelligent Security Auditing Based on Access Control of Devices in Ad Hoc Network

Institute of Scientific and Technical Information of China (English)

XU Guang-wei; SHI You-qun; ZHU Ming; WU Guo-wen; CAO Qi-ying

2006-01-01

Security in Ad Hoc network is an important issue under the opening circumstance of application service. Some protocols and models of security auditing have been proposed to ensure rationality of contracting strategy and operating regulation and used to identify abnormal operation. Model of security auditing based on access control of devices will be advanced to register sign of devices and property of event of access control and to audit those actions. In the end, the model is analyzed and simulated.

The Ex Hoc Infrastructure - Enhancing Traffic Safety through LIfe WArning Systems

DEFF Research Database (Denmark)

Hansen, Klaus Marius; Kristensen, Lars Michael; Eskildsen, Toke

2004-01-01

New pervasive computing technologies for sensing and communication open up novel possibilities for enhancing traffic safety. We are currently designing and implementing the Ex Hoc infrastructure framework for communication among mobile and stationary units including vehicles. The infrastructure...... will connect sensing devices on vehicles with sensing devices on other vehicles and with stationary communication units placed alongside roads. The current application of Ex Hoc is to enable the collection and dissemination of information on road condition through LIfe Warning Systems (LIWAS) units....

Green Communications and Networks : Proceedings of the International Conference on Green Communications and Networks

CERN Document Server

Ma, Maode

2012-01-01

Green Communications and Networks presents 95 papers chosen for publication from among 190 reviewed papers accepted for presentation to the International Conference on Green Communications and Networks (GCN 2011), held in Chongqing, China, July 15-17, 2011. GCN 2011 provided a venue for leading academic and industrial researchers to exchange their views, ideas and research results on innovative technologies and sustainable solutions leading to greener communications and networks. In addition to paper presentations, the conference featured keynote speakers and a panel discussion. Reflecting the broad scope of the conference, the contents are organized in these topical categories: Communication Systems Data Management and Database System Digital Image Processing Education and Informatics Enabling Technologies Forensics, Recognition Technologies and Applications Fuzzy System and Control Graphics and Visualizing Green Computing Internet Growth Modelling and Virtualized Networks Network Components and Application ...

Position paper: cognitive radio networking for multiple sensor network interoperability in mines

CSIR Research Space (South Africa)

Kagize, BM

2008-01-01

Full Text Available . These commercially available networks are purported to be self-organizing and self correcting, though the software behind these networks are proprietary with the caveat of inter-operability difficulties with other networks [5]. There is a non-propriety and open...: Research challenges,” - Ad Hoc Networks, 2006 – Elsevier [4] V Mhatre, C Rosenberg, “Homogeneous vs heterogeneous clustered sensor networks: a comparative study,” - Communications, 2004 IEEE International Conference on, 2004 - ieeexplore.ieee.org [5...

VISIONS Vehicular communication Improvement : solution based on IMS Operational Nodes and Services

OpenAIRE

Lequerica Roca, Iván

2013-01-01

Digital services and communications in vehicular scenarios provide the essential assets to improve road transport in several ways like reducing accidents, improving traffic efficiency and optimizing the transport of goods and people. Vehicular communications typically rely on VANET (Vehicular Ad hoc Networks). In these networks vehicles communicate with each other without the need of infrastructure. VANET are mainly oriented to disseminate information to the vehicles in certain geographic are...

Communication in Animal Social Networks

NARCIS (Netherlands)

Snijders, Lysanne; Naguib, Marc

2017-01-01

Animal social networks and animal communication networks are key disciplines for understanding animal social behavior, yet these disciplines remain poorly integrated. In this review, we show how communication and social networks are inherently linked, with social signals reflecting and affecting

A survey and taxonomy of distributed certificate authorities in mobile ad hoc networks

Directory of Open Access Journals (Sweden)

Jabbehdari Sam

2011-01-01

Full Text Available Abstract Certificate authorities (CAs are the main components of PKI that enable us for providing basic security services in wired networks and Internet. But, we cannot use centralized CAs, in mobile ad hoc networks (MANETs. So, many efforts have been made to adapt CA to the special characteristics of MANETs and new concepts such as distributed CAs (DCAs have been proposed that distribute the functionality of CA between MANET nodes. In this article, we study various proposed DCA schemes for MANET and then classify these schemes according to their internal structures and techniques. Finally, we propose the characteristics of an ideal DCA system that can be used to verify the completeness of any DCA scheme. This classification and taxonomy identify the weakness and constraints of each scheme, and are very important for designing more secure, scalable, and high performance DCA systems for MANETs and other networks.

A time-based admission control mechanism for IEEE 802.11 ad Hoc networks

OpenAIRE

Costa, Luís Henrique M. K.; Cerveira, Carlos Rodrigo

2006-01-01

This paper presents a time-based admission control mechanism (TAC) for IEEE 802.11 ad hoc networks. The proposed mechanism was adapted to the QoS AODV routing protocol, which takes the quality of service requirements of the data flow into account in the route discovery process. TAC-AODV estimates the idle time of the physical medium based on the frames listened. The incoming traffic is admitted according to the offered load as well as the intra-flow interference, calculated based on the numbe...

Accurate 3D Localization Method for Public Safety Applications in Vehicular Ad-hoc Networks

KAUST Repository

Ansari, Abdul Rahim

2018-04-10

Vehicular ad hoc networks (VANETs) represent a very promising research area because of their ever increasing demand, especially for public safety applications. In VANETs vehicles communicate with each other to exchange road maps and traffic information. In many applications, location-based services are the main service, and localization accuracy is the main problem. VANETs also require accurate vehicle location information in real time. To fulfill this requirement, a number of algorithms have been proposed; however, the location accuracy required for public safety applications in VANETs has not been achieved. In this paper, an improved subspace algorithm is proposed for time of arrival (TOA) measurements in VANETs localization. The proposed method gives a closed-form solution and it is robust for large measurement noise, as it is based on the eigen form of a scalar product and dimensionality. Furthermore, we developed the Cramer-Rao Lower Bound (CRLB) to evaluate the performance of the proposed 3D VANETs localization method. The performance of the proposed method was evaluated by comparison with the CRLB and other localization algorithms available in the literature through numerous simulations. Simulation results show that the proposed 3D VANETs localization method is better than the literature methods especially for fewer anchors at road side units and large noise variance.

Sensor Based Framework for Secure Multimedia Communication in VANET

Science.gov (United States)

Rahim, Aneel; Khan, Zeeshan Shafi; Bin Muhaya, Fahad T.; Sher, Muhammad; Kim, Tai-Hoon

2010-01-01

Secure multimedia communication enhances the safety of passengers by providing visual pictures of accidents and danger situations. In this paper we proposed a framework for secure multimedia communication in Vehicular Ad-Hoc Networks (VANETs). Our proposed framework is mainly divided into four components: redundant information, priority assignment, malicious data verification and malicious node verification. The proposed scheme jhas been validated with the help of the NS-2 network simulator and the Evalvid tool. PMID:22163462

Topological Rankings in Communication Networks

DEFF Research Database (Denmark)

Aabrandt, Andreas; Hansen, Vagn Lundsgaard; Træholt, Chresten

2015-01-01

In the theory of communication the central problem is to study how agents exchange information. This problem may be studied using the theory of connected spaces in topology, since a communication network can be modelled as a topological space such that agents can communicate if and only...... if they belong to the same path connected component of that space. In order to study combinatorial properties of such a communication network, notions from algebraic topology are applied. This makes it possible to determine the shape of a network by concrete invariants, e.g. the number of connected components...

Network Approach in Political Communication Studies

Directory of Open Access Journals (Sweden)

Нина Васильевна Опанасенко

2013-12-01

Full Text Available The article is devoted to issues of network approach application in political communication studies. The author considers communication in online and offline areas and gives the definition of rhizome, its characteristics, identifies links between rhizome and network approach. The author also analyses conditions and possibilities of the network approach in modern political communication. Both positive and negative features of the network approach are emphasized.

Cross-layer design for intrusion detection and data security in wireless ad hoc sensor networks

Science.gov (United States)

Hortos, William S.

2007-09-01

A wireless ad hoc sensor network is a configuration for area surveillance that affords rapid, flexible deployment in arbitrary threat environments. There is no infrastructure support and sensor nodes communicate with each other only when they are in transmission range. The nodes are severely resource-constrained, with limited processing, memory and power capacities and must operate cooperatively to fulfill a common mission in typically unattended modes. In a wireless sensor network (WSN), each sensor at a node can observe locally some underlying physical phenomenon and sends a quantized version of the observation to sink (destination) nodes via wireless links. Since the wireless medium can be easily eavesdropped, links can be compromised by intrusion attacks from nodes that may mount denial-of-service attacks or insert spurious information into routing packets, leading to routing loops, long timeouts, impersonation, and node exhaustion. A cross-layer design based on protocol-layer interactions is proposed for detection and identification of various intrusion attacks on WSN operation. A feature set is formed from selected cross-layer parameters of the WSN protocol to detect and identify security threats due to intrusion attacks. A separate protocol is not constructed from the cross-layer design; instead, security attributes and quantified trust levels at and among nodes established during data exchanges complement customary WSN metrics of energy usage, reliability, route availability, and end-to-end quality-of-service (QoS) provisioning. Statistical pattern recognition algorithms are applied that use observed feature-set patterns observed during network operations, viewed as security audit logs. These algorithms provide the "best" network global performance in the presence of various intrusion attacks. A set of mobile (software) agents distributed at the nodes implement the algorithms, by moving among the layers involved in the network response at each active node

Opportunistic Beacon Networks

NARCIS (Netherlands)

Türkes, Okan

2016-01-01

Modern society is surrounded by an ample spectrum of personal mobile devices with short-range wireless communication support. This ubiquity creates an immense potential of new concepts for people-centric ad hoc networks that can be applied to every personal and social dimension of life. The last

Advances and Challenges in Convergent Communication Networks

DEFF Research Database (Denmark)

Toral-Cruz, Homero; Mihovska, Albena

2017-01-01

Welcome to this special issue of Wireless Personal Communications on Advances and Challenges in Convergent Communication Networks. The main purpose of this special issue is to present new progresses and challenges in convergent networks. Communication networks play an important role in our daily...... life because they allow communicating and sharing contents between heterogeneous nodes around the globe. The emergence of multiple network architectures and emerging technologies have resulted in new applications and services over a heterogeneous network. This heterogeneous network has undergone...... significant challenges in recent years, such as the evolution to a converged network with the capability to support multiple services, while maintaining a satisfactory level of QoE/QoS, security, efficiency and trust. The special issue on Advances and Challenges in Convergent Communication Networks...

Rollback recovery with low overhead for fault tolerance in mobile ad hoc networks

Directory of Open Access Journals (Sweden)

Parmeet Kaur Jaggi

2015-10-01

Full Text Available Mobile ad hoc networks (MANETs have significantly enhanced the wireless networks by eliminating the need for any fixed infrastructure. Hence, these are increasingly being used for expanding the computing capacity of existing networks or for implementation of autonomous mobile computing Grids. However, the fragile nature of MANETs makes the constituent nodes susceptible to failures and the computing potential of these networks can be utilized only if they are fault tolerant. The technique of checkpointing based rollback recovery has been used effectively for fault tolerance in static and cellular mobile systems; yet, the implementation of existing protocols for MANETs is not straightforward. The paper presents a novel rollback recovery protocol for handling the failures of mobile nodes in a MANET using checkpointing and sender based message logging. The proposed protocol utilizes the routing protocol existing in the network for implementing a low overhead recovery mechanism. The presented recovery procedure at a node is completely domino-free and asynchronous. The protocol is resilient to the dynamic characteristics of the MANET; allowing a distributed application to be executed independently without access to any wired Grid or cellular network access points. We also present an algorithm to record a consistent global snapshot of the MANET.

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

Science.gov (United States)

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-hoon

2017-01-01

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads. PMID:28531159

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks.

Science.gov (United States)

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-Hoon

2017-05-22

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads.

Performance Analysis of On-Demand Routing Protocols in Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Arafatur RAHMAN

2009-01-01

Full Text Available Wireless Mesh Networks (WMNs have recently gained a lot of popularity due to their rapid deployment and instant communication capabilities. WMNs are dynamically self-organizing, self-configuring and self-healing with the nodes in the network automatically establishing an adiej hoc network and preserving the mesh connectivity. Designing a routing protocol for WMNs requires several aspects to consider, such as wireless networks, fixed applications, mobile applications, scalability, better performance metrics, efficient routing within infrastructure, load balancing, throughput enhancement, interference, robustness etc. To support communication, various routing protocols are designed for various networks (e.g. ad hoc, sensor, wired etc.. However, all these protocols are not suitable for WMNs, because of the architectural differences among the networks. In this paper, a detailed simulation based performance study and analysis is performed on the reactive routing protocols to verify the suitability of these protocols over such kind of networks. Ad Hoc On-Demand Distance Vector (AODV, Dynamic Source Routing (DSR and Dynamic MANET On-demand (DYMO routing protocol are considered as the representative of reactive routing protocols. The performance differentials are investigated using varying traffic load and number of source. Based on the simulation results, how the performance of each protocol can be improved is also recommended.

Network Restoration for Next-Generation Communication and Computing Networks

Directory of Open Access Journals (Sweden)

B. S. Awoyemi

2018-01-01

Full Text Available Network failures are undesirable but inevitable occurrences for most modern communication and computing networks. A good network design must be robust enough to handle sudden failures, maintain traffic flow, and restore failed parts of the network within a permissible time frame, at the lowest cost achievable and with as little extra complexity in the network as possible. Emerging next-generation (xG communication and computing networks such as fifth-generation networks, software-defined networks, and internet-of-things networks have promises of fast speeds, impressive data rates, and remarkable reliability. To achieve these promises, these complex and dynamic xG networks must be built with low failure possibilities, high network restoration capacity, and quick failure recovery capabilities. Hence, improved network restoration models have to be developed and incorporated in their design. In this paper, a comprehensive study on network restoration mechanisms that are being developed for addressing network failures in current and emerging xG networks is carried out. Open-ended problems are identified, while invaluable ideas for better adaptation of network restoration to evolving xG communication and computing paradigms are discussed.

Sensor Based Framework for Secure Multimedia Communication in VANET

Directory of Open Access Journals (Sweden)

Tai-Hoon Kim

2010-11-01

Full Text Available Secure multimedia communication enhances the safety of passengers by providing visual pictures of accidents and danger situations. In this paper we proposed a framework for secure multimedia communication in Vehicular Ad-Hoc Networks (VANETs. Our proposed framework is mainly divided into four components: redundant information, priority assignment, malicious data verification and malicious node verification. The proposed scheme jhas been validated with the help of the NS-2 network simulator and the Evalvid tool.

3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment

Directory of Open Access Journals (Sweden)

Muhammad Sohail

2018-03-01

Full Text Available Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node’s transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing, which extends the widely used AODV (Ad hoc On-demand Distance Vector routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network. The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.

3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment.

Science.gov (United States)

Sohail, Muhammad; Wang, Liangmin

2018-03-14

Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node's transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.

IF-MANET: Interoperable framework for heterogeneous mobile ad hoc networks

OpenAIRE

Hassan, H.

2015-01-01

The advances in low power micro-processors, wireless networks and embedded systems have raised the need to utilize the significant resources of mobile devices. These devices for example, smart phones, tablets, laptops, wearables, and sensors are gaining enormous processing power, storage capacity and wireless bandwidth. In addition, the advancement in wireless mobile technology has created a new communication paradigm via which a wireless network can be created without any priori infrastructu...

MIMO Communication for Cellular Networks

CERN Document Server

Huang, Howard; Venkatesan, Sivarama

2012-01-01

As the theoretical foundations of multiple-antenna techniques evolve and as these multiple-input multiple-output (MIMO) techniques become essential for providing high data rates in wireless systems, there is a growing need to understand the performance limits of MIMO in practical networks. To address this need, MIMO Communication for Cellular Networks presents a systematic description of MIMO technology classes and a framework for MIMO system design that takes into account the essential physical-layer features of practical cellular networks. In contrast to works that focus on the theoretical performance of abstract MIMO channels, MIMO Communication for Cellular Networks emphasizes the practical performance of realistic MIMO systems. A unified set of system simulation results highlights relative performance gains of different MIMO techniques and provides insights into how best to use multiple antennas in cellular networks under various conditions. MIMO Communication for Cellular Networks describes single-user,...

Communication and Networking in Smart Grids

CERN Document Server

Xiao, Yang

2012-01-01

Appropriate for researchers, practitioners, and students alike, Communication and Networking in Smart Grids presents state-of-the-art approaches and novel technologies for communication networks in smart grids. It explains how contemporary grid networks are developed and deployed and presents a collection of cutting-edge advances to help improve current practice. Prominent researchers working on smart grids and in related fields around the world explain the fundamental aspects and applications of smart grids. Describing the role that communication and networking will play in future smart grids

Enhancement of Localization Accuracy in Cellular Networks via Cooperative AdHoc Links

DEFF Research Database (Denmark)

Lhomme, Edouard; Frattasi, Simone; Figueiras, Joao

2006-01-01

Positioning information enables new applications for cellular phones, personal communication systems, and specialized mobile radios. The network heterogeneity emerging in the fourth generation (4G) of mobile networks can be utilized for enhancements of the location estimation accuracy...

Design Considerations for Multi-Channel Picture Communication Networks

OpenAIRE

Scheibe, Paul O.

1983-01-01

Design of networks intended for communication of digitally-encoded pictures involves considerations different from those used in the design of text or voice communication networks. This paper provides an overview of the elements useful in the design of picture communication networks by relation and contrast with other communication networks. Particular emphasis is given to picture communication systems useful in medical applications.

A CONTEXT AWARE BASED PRE-HANDOFF SUPPORT APPROACH TO PROVIDE OPTIMAL QOS FOR STREAMING APPLICATIONS OVER VEHICULAR AD HOC NETWORKS – HOSA

Directory of Open Access Journals (Sweden)

K. RAMESH BABU

2015-06-01

Full Text Available Large variations in network Quality of Service (QoS such as bandwidth, latency, jitter, and reliability may occur during media transfer over vehicular ad hoc networks (VANET. Usage of VANET over mobile and wireless computing applications experience “bursty” QoS behavior during the execution over distributed network scenarios. Applications such as streaming media services need to adapt their functionalities to any change in network status. Moreover, an enhanced software platform is necessary to provide adaptive network management services to upper software components. HOSA, a handoff service broker based architecture for QoS adaptation over VANET supports in providing awareness. HOSA is structured as a middleware platform both to provide QoS awareness to streaming applications as well to manage dynamic ad hoc network resources with support over handoff in an adaptive fashion. HOSA is well analyzed over routing schemes such as TIBSCRPH, SIP and ABSRP where performance of HOSA was measured using throughput, traffic intensity and end to end delay. HOSA has been analyzed using JXTA development toolkit over C++ implemented classes to demonstrate its performance over varying node mobility established using vehicular mobility based conference application.

An Eco-Driving Advisory System for Continuous Signalized Intersections by Vehicular Ad Hoc Network

Directory of Open Access Journals (Sweden)

Wei-Hsun Lee

2018-01-01

Full Text Available With the vehicular ad hoc network (VANET technology which support vehicle-to-vehicle (V2V and vehicle to road side unit (V2R/R2V communications, vehicles can preview the intersection signal plan such as signal countdown message. In this paper, an ecodriving advisory system (EDAS is proposed to reduce CO2 emissions and energy consumption by letting the vehicle continuously pass through multiple intersections with the minimum possibilities of stops. We extend the isolated intersection model to multiple continuous intersections scenario. A hybrid method combining three strategies including maximized throughput model (MTM, smooth speed model (SSM, and minimized acceleration and deceleration (MinADM is designed, and it is compared with related works maximized throughput model (MaxTM, open traffic light control model (OTLCM, and predictive cruise control (PCC models. Some issues for the practical application including safe car following, queue clearing, and gliding mode are discussed and conquered. Simulation results show that the proposed model outperforms OTLCM 25.1%~81.2% in the isolated intersection scenario for the CO2 emissions and 20.5%~84.3% in averaged travel time. It also performs better than the compared PCC model in CO2 emissions (19.9%~31.2% as well as travel time (24.5%~35.9% in the multiple intersections scenario.

Quality-of-Service Routing Using Path and Power Aware Techniques in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

R. Asokan

2008-01-01

Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile hosts dynamically forming a temporary network without the aid of any existing established infrastructure. Quality of service (QoS is a set of service requirements that needs to be met by the network while transporting a packet stream from a source to its destination. QoS support MANETs is a challenging task due to the dynamic topology and limited resources. The main objective of this paper is to enhance the QoS routing for MANET using temporally ordered routing algorithm (TORA with self-healing and optimized routing techniques (SHORT. SHORT improves routing optimality by monitoring routing paths continuously and redirecting the path whenever a shortcut path is available. In this paper, the performance comparison of TORA and TORA with SHORT has been analyzed using network simulator for various parameters. TORA with SHORT enhances performance of TORA in terms of throughput, packet loss, end-to-end delay, and energy.

NASA Communications Augmentation network

Science.gov (United States)

Omidyar, Guy C.; Butler, Thomas E.; Laios, Straton C.

1990-01-01

The NASA Communications (Nascom) Division of the Mission Operations and Data Systems Directorate (MO&DSD) is to undertake a major initiative to develop the Nascom Augmentation (NAUG) network to achieve its long-range service objectives for operational data transport to support the Space Station Freedom Program, the Earth Observing System (EOS), and other projects. The NAUG is the Nascom ground communications network being developed to accommodate the operational traffic of the mid-1990s and beyond. The NAUG network development will be based on the Open Systems Interconnection Reference Model (OSI-RM). This paper describes the NAUG network architecture, subsystems, topology, and services; addresses issues of internetworking the Nascom network with other elements of the Space Station Information System (SSIS); discusses the operations environment. This paper also notes the areas of related research and presents the current conception of how the network will provide broadband services in 1998.

Game theory in communication networks cooperative resolution of interactive networking scenarios

CERN Document Server

Antoniou, Josephina

2012-01-01

A mathematical tool for scientists and researchers who work with computer and communication networks, Game Theory in Communication Networks: Cooperative Resolution of Interactive Networking Scenarios addresses the question of how to promote cooperative behavior in interactive situations between heterogeneous entities in communication networking scenarios. It explores network design and management from a theoretical perspective, using game theory and graph theory to analyze strategic situations and demonstrate profitable behaviors of the cooperative entities. The book promotes the use of Game T

Emerging trends in communication networks

CERN Document Server

Hasan, Syed Faraz

2014-01-01

This book covers the state of the art in communication networks with the help of illustrative diagrams and recent references published in reputed journals and magazines. The book gives readers a glimpse into the next generation of communication networks. It explores topics that are currently in the research phase and/or are expected to be deployed in recent future such as LTE networks and IPv6 networks. This book is written for students/researchers who wish to come up to date with the recent trends in telecommunications.

Scalable Broadcast Authentication for V2V Communication

NARCIS (Netherlands)

Feiri, Michael

2016-01-01

Vehicular Ad Hoc Networking (VANET) technology is, at it’s core, the simple idea of outfitting vehicles with wireless data communication equipment for automatic information exchange. This technology is expected to serve as a foundation for a set of novel safety, automation, and infotainment

A Routing Strategy for Non-Cooperation Wireless Multi-Hop Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Dung T. Tran

2012-01-01

Full Text Available Choosing routes such that the network lifetime is maximized in a wireless network with limited energy resources is a major routing problem in wireless multi-hop ad hoc networks. In this paper, we study the problem where participants are rationally selfish and non-cooperative. By selfish we designate the users who are ready to tamper with their source-routing (senders could choose intermediate nodes in the routing paths or next hop selection strategies in order to increase the total number of packets transmitted, but do not try to harm or drop packets of the other nodes. The problem therefore amounts to a non-cooperative game. In the works [2,6,19,23], the authors show that the game admits Nash equilibria [1]. Along this line, we first show that if the cost function is linear, this game has pure-strategy equilibrium flow even though participants have different demands. However, finding a Nash equilibrium for a normal game is computationally hard [9]. In this work, inspired by mixed-strategy equilibrium, we propose a simple local routing algorithm called MIxed Path Routing protocol (MiPR. Using analysis and simulations, we show that MiPR drives the system to an equilibrium state where selfish participants do not have incentive to deviate. Moreover, MiPR significantly improves the network lifetime as compared to original routing protocols.

Information Sharing Modalities for Mobile Ad-Hoc Networks

Science.gov (United States)

de Spindler, Alexandre; Grossniklaus, Michael; Lins, Christoph; Norrie, Moira C.

Current mobile phone technologies have fostered the emergence of a new generation of mobile applications. Such applications allow users to interact and share information opportunistically when their mobile devices are in physical proximity or close to fixed installations. It has been shown how mobile applications such as collaborative filtering and location-based services can take advantage of ad-hoc connectivity to use physical proximity as a filter mechanism inherent to the application logic. We discuss the different modes of information sharing that arise in such settings based on the models of persistence and synchronisation. We present a platform that supports the development of applications that can exploit these modes of ad-hoc information sharing and, by means of an example, show how such an application can be realised based on the supported event model.

The physics of communicability in complex networks

International Nuclear Information System (INIS)

Estrada, Ernesto; Hatano, Naomichi; Benzi, Michele

2012-01-01

A fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and applied to a wide variety of real-world networks in recent years. Several such communicability functions are reviewed in this paper. It is emphasized that communication and correlation in networks can take place through many more routes than the shortest paths, a fact that may not have been sufficiently appreciated in previously proposed correlation measures. In contrast to these, the communicability measures reviewed in this paper are defined by taking into account all possible routes between two nodes, assigning smaller weights to longer ones. This point of view naturally leads to the definition of communicability in terms of matrix functions, such as the exponential, resolvent, and hyperbolic functions, in which the matrix argument is either the adjacency matrix or the graph Laplacian associated with the network. Considerable insight on communicability can be gained by modeling a network as a system of oscillators and deriving physical interpretations, both classical and quantum-mechanical, of various communicability functions. Applications of communicability measures to the analysis of complex systems are illustrated on a variety of biological, physical and social networks. The last part of the paper is devoted to a review of the notion of locality in complex networks and to computational aspects that by exploiting sparsity can greatly reduce the computational efforts for the calculation of communicability functions for large networks.

A Novel Smart Routing Protocol for Remote Health Monitoring in Medical Wireless Networks

Directory of Open Access Journals (Sweden)

T. V. P. Sundararajan

2014-01-01

Full Text Available In a Medical Wireless Network (MWN, sensors constantly monitor patient's physiological condition and movement. Inter-MWN communications are set up between the Patient Server and one or more Centralized Coordinators. However, MWNs require protocols with little energy consumption and the self-organizing attribute perceived in ad-hoc networks. The proposed Smart Routing Protocol (SRP selects only the nodes with a higher residual energy and lower traffic density for routing. This approach enhances cooperation among the nodes of a Mobile Ad Hoc Network. Consequently, SRP produces better results than the existing protocols, namely Conditional Min-Max Battery Cost Routing, Min-Max Battery Cost Routing and AdHoc On-demand Distance Vector in terms of network parameters. The performance of the erstwhile schemes for routing protocols is evaluated using the network simulator Qualnet v 4.5.

Further Development of Synchronous Array Method for Ad Hoc Wireless Networks

Directory of Open Access Journals (Sweden)

Yingbo Hua

2008-09-01

Full Text Available A further development of the synchronous array method (SAM as a medium access control scheme for large-scale ad hoc wireless networks is presented. Under SAM, all transmissions of data packets between adjacent nodes are synchronized on a frame-by-frame basis, and the spacing between concurrent cochannel transmissions of data packets is properly controlled. An opportunistic SAM (O-SAM is presented which allows concurrent cochannel transmissions to be locally adaptive to channel gain variations. A distributed SAM (D-SAM is discussed that schedules all concurrent cochannel transmissions in a distributed fashion. For networks of low mobility, the control overhead required by SAM can be made much smaller than the payload. By analysis and simulation, the intranetwork throughput of O-SAM and D-SAM is evaluated. The effects of traffic load and multiple antennas on the intranetwork throughput are studied. The throughput of ALOHA is also analyzed and compared with that of O-SAM and D-SAM. By a distance-weighted throughput, a comparison of long distance transmission versus short distance transmission is also presented. The study of D-SAM reveals an important insight into the MSH-DSCH protocol adopted in IEEE 802.16 standards.

Development of IT-based data communication network technology

International Nuclear Information System (INIS)

Hong, Seok Boong; Jeong, K. I.; Yoo, Y. R.

2010-10-01

- Developing broadband high-reliability real-time communications technology for NPP - Developing reliability and performance validation technology for communications network - Developing security technology for NPP communications network - Developing field communications network for harsh environment of NPP - International standard registration(Oct. 28, 2009, IEC 61500

Ultra-wideband radar sensors and networks

Science.gov (United States)

Leach, Jr., Richard R; Nekoogar, Faranak; Haugen, Peter C

2013-08-06

Ultra wideband radar motion sensors strategically placed in an area of interest communicate with a wireless ad hoc network to provide remote area surveillance. Swept range impulse radar and a heart and respiration monitor combined with the motion sensor further improves discrimination.

Enabling content distribution in vehicular ad hoc networks

CERN Document Server

Luan, Tom H; Bai, Fan

2014-01-01

This SpringerBrief presents key enabling technologies and state-of-the-art research on delivering efficient content distribution services to fast moving vehicles. It describes recent research developments and proposals towards the efficient, resilient and scalable content distribution to vehicles through both infrastructure-based and infrastructure-less vehicular networks. The authors focus on the rich multimedia services provided by vehicular environment content distribution including vehicular communications and media playback, giving passengers many infotainment applications. Common problem

Address autoconfiguration in wireless ad hoc networks : Protocols and techniques

NARCIS (Netherlands)

Cempaka Wangi, N.I.; Prasad, R.V.; Jacobsson, M.; Niemegeers, I.

2008-01-01

With the advent of smaller devices having higher computational capacity and wireless communication capabilities, the world is becoming completely networked. Although, the mobile nature of these devices provides ubiquitous services, it also poses many challenges. In this article, we look in depth at

Secure and Fair Cluster Head Selection Protocol for Enhancing Security in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

B. Paramasivan

2014-01-01

Full Text Available Mobile ad hoc networks (MANETs are wireless networks consisting of number of autonomous mobile devices temporarily interconnected into a network by wireless media. MANETs become one of the most prevalent areas of research in the recent years. Resource limitations, energy efficiency, scalability, and security are the great challenging issues in MANETs. Due to its deployment nature, MANETs are more vulnerable to malicious attack. The secure routing protocols perform very basic security related functions which are not sufficient to protect the network. In this paper, a secure and fair cluster head selection protocol (SFCP is proposed which integrates security factors into the clustering approach for achieving attacker identification and classification. Byzantine agreement based cooperative technique is used for attacker identification and classification to make the network more attack resistant. SFCP used to solve this issue by making the nodes that are totally surrounded by malicious neighbors adjust dynamically their belief and disbelief thresholds. The proposed protocol selects the secure and energy efficient cluster head which acts as a local detector without imposing overhead to the clustering performance. SFCP is simulated in network simulator 2 and compared with two protocols including AODV and CBRP.

Secure and fair cluster head selection protocol for enhancing security in mobile ad hoc networks.

Science.gov (United States)

Paramasivan, B; Kaliappan, M

2014-01-01

Mobile ad hoc networks (MANETs) are wireless networks consisting of number of autonomous mobile devices temporarily interconnected into a network by wireless media. MANETs become one of the most prevalent areas of research in the recent years. Resource limitations, energy efficiency, scalability, and security are the great challenging issues in MANETs. Due to its deployment nature, MANETs are more vulnerable to malicious attack. The secure routing protocols perform very basic security related functions which are not sufficient to protect the network. In this paper, a secure and fair cluster head selection protocol (SFCP) is proposed which integrates security factors into the clustering approach for achieving attacker identification and classification. Byzantine agreement based cooperative technique is used for attacker identification and classification to make the network more attack resistant. SFCP used to solve this issue by making the nodes that are totally surrounded by malicious neighbors adjust dynamically their belief and disbelief thresholds. The proposed protocol selects the secure and energy efficient cluster head which acts as a local detector without imposing overhead to the clustering performance. SFCP is simulated in network simulator 2 and compared with two protocols including AODV and CBRP.

Multipath Activity Based Routing Protocol for Mobile ‎Cognitive Radio Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Shereen Omar

2017-01-01

Full Text Available Cognitive radio networks improve spectrum utilization by ‎sharing licensed spectrum with cognitive radio devices. In ‎cognitive radio ad hoc networks the routing protocol is one ‎of the most challenging tasks due to the changes in ‎frequency spectrum and the interrupted connectivity ‎caused by the primary user activity. In this paper, a multi‎path activity based routing protocol for cognitive radio ‎network (MACNRP is proposed. The protocol utilizes ‎channel availability and creates multiple node-disjoint ‎routes between the source and destination nodes. The ‎proposed protocol is compared with D2CARP and FTCRP ‎protocols. The performance evaluation is conducted ‎through mathematical analysis and using OPNET ‎simulation. The performance of the proposed protocol ‎achieves an increase in network throughput; besides it ‎decreases the probability of route failure due to node ‎mobility and primary user activity. We have found that the ‎MACNRP scheme results in 50% to 75% reduction in ‎blocking probability and 33% to 78% improvement in ‎network throughput, with a reasonable additional routing ‎overhead and average packet delay. Due to the successful ‎reduction of collision between primary users and ‎cognitive users, the MACNRP scheme results in decreasing ‎the path failure rate by 50% to 87%.‎

Mobile Ad Hoc Network Energy Cost Algorithm Based on Artificial Bee Colony

Directory of Open Access Journals (Sweden)

Mustafa Tareq

2017-01-01

Full Text Available A mobile ad hoc network (MANET is a collection of mobile nodes that dynamically form a temporary network without using any existing network infrastructure. MANET selects a path with minimal number of intermediate nodes to reach the destination node. As the distance between each node increases, the quantity of transmission power increases. The power level of nodes affects the simplicity with which a route is constituted between a couple of nodes. This study utilizes the swarm intelligence technique through the artificial bee colony (ABC algorithm to optimize the energy consumption in a dynamic source routing (DSR protocol in MANET. The proposed algorithm is called bee DSR (BEEDSR. The ABC algorithm is used to identify the optimal path from the source to the destination to overcome energy problems. The performance of the BEEDSR algorithm is compared with DSR and bee-inspired protocols (BeeIP. The comparison was conducted based on average energy consumption, average throughput, average end-to-end delay, routing overhead, and packet delivery ratio performance metrics, varying the node speed and packet size. The BEEDSR algorithm is superior in performance than other protocols in terms of energy conservation and delay degradation relating to node speed and packet size.

Medium Access Control Protocols for Cognitive Radio Ad Hoc Networks: A Survey

Directory of Open Access Journals (Sweden)

Mahdi Zareei

2017-09-01

Full Text Available New wireless network paradigms will demand higher spectrum use and availability to cope with emerging data-hungry devices. Traditional static spectrum allocation policies cause spectrum scarcity, and new paradigms such as Cognitive Radio (CR and new protocols and techniques need to be developed in order to have efficient spectrum usage. Medium Access Control (MAC protocols are accountable for recognizing free spectrum, scheduling available resources and coordinating the coexistence of heterogeneous systems and users. This paper provides an ample review of the state-of-the-art MAC protocols, which mainly focuses on Cognitive Radio Ad Hoc Networks (CRAHN. First, a description of the cognitive radio fundamental functions is presented. Next, MAC protocols are divided into three groups, which are based on their channel access mechanism, namely time-slotted protocol, random access protocol and hybrid protocol. In each group, a detailed and comprehensive explanation of the latest MAC protocols is presented, as well as the pros and cons of each protocol. A discussion on future challenges for CRAHN MAC protocols is included with a comparison of the protocols from a functional perspective.

Two-terminal reliability of a mobile ad hoc network under the asymptotic spatial distribution of the random waypoint model

International Nuclear Information System (INIS)

Chen, Binchao; Phillips, Aaron; Matis, Timothy I.

2012-01-01

The random waypoint (RWP) mobility model is frequently used in describing the movement pattern of mobile users in a mobile ad hoc network (MANET). As the asymptotic spatial distribution of nodes under a RWP model exhibits central tendency, the two-terminal reliability of the MANET is investigated as a function of the source node location. In particular, analytical expressions for one and two hop connectivities are developed as well as an efficient simulation methodology for two-terminal reliability. A study is then performed to assess the effect of nodal density and network topology on network reliability.

Tree-based server-middleman-client architecture: improving scalability and reliability for voting-based network games in ad hoc wireless networks

Science.gov (United States)

Guo, Y.; Fujinoki, H.

2006-10-01

The concept of a new tree-based architecture for networked multi-player games was proposed by Matuszek to improve scalability in network traffic at the same time to improve reliability. The architecture (we refer it as "Tree-Based Server- Middlemen-Client architecture") will solve the two major problems in ad-hoc wireless networks: frequent link failures and significance in battery power consumption at wireless transceivers by using two new techniques, recursive aggregation of client messages and subscription-based propagation of game state. However, the performance of the TBSMC architecture has never been quantitatively studied. In this paper, the TB-SMC architecture is compared with the client-server architecture using simulation experiments. We developed an event driven simulator to evaluate the performance of the TB-SMC architecture. In the network traffic scalability experiments, the TB-SMC architecture resulted in less than 1/14 of the network traffic load for 200 end users. In the reliability experiments, the TB-SMC architecture improved the number of successfully delivered players' votes by 31.6, 19.0, and 12.4% from the clientserver architecture at high (failure probability of 90%), moderate (50%) and low (10%) failure probability.

Communication and control for networked complex systems

CERN Document Server

Peng, Chen; Han, Qing-Long

2015-01-01

This book reports on the latest advances in the study of Networked Control Systems (NCSs). It highlights novel research concepts on NCSs; the analysis and synthesis of NCSs with special attention to their networked character; self- and event-triggered communication schemes for conserving limited network resources; and communication and control co-design for improving the efficiency of NCSs. The book will be of interest to university researchers, control and network engineers, and graduate students in the control engineering, communication and network sciences interested in learning the core principles, methods, algorithms and applications of NCSs.

Using networking and communications software in business

CERN Document Server

McBride, PK

2014-01-01

Using Networking and Communications Software in Business covers the importance of networks in a business firm, the benefits of computer communications within a firm, and the cost-benefit in putting up networks in businesses. The book is divided into six parts. Part I looks into the nature and varieties of networks, networking standards, and network software. Part II discusses the planning of a networked system, which includes analyzing the requirements for the network system, the hardware for the network, and network management. The installation of the network system and the network managemen

A Quantum Cryptography Communication Network Based on Software Defined Network

Directory of Open Access Journals (Sweden)

Zhang Hongliang

2018-01-01

Full Text Available With the development of the Internet, information security has attracted great attention in today’s society, and quantum cryptography communication network based on quantum key distribution (QKD is a very important part of this field, since the quantum key distribution combined with one-time-pad encryption scheme can guarantee the unconditional security of the information. The secret key generated by quantum key distribution protocols is a very valuable resource, so making full use of key resources is particularly important. Software definition network (SDN is a new type of network architecture, and it separates the control plane and the data plane of network devices through OpenFlow technology, thus it realizes the flexible control of the network resources. In this paper, a quantum cryptography communication network model based on SDN is proposed to realize the flexible control of quantum key resources in the whole cryptography communication network. Moreover, we propose a routing algorithm which takes into account both the hops and the end-to-end availible keys, so that the secret key generated by QKD can be used effectively. We also simulate this quantum cryptography communication network, and the result shows that based on SDN and the proposed routing algorithm the performance of this network is improved since the effective use of the quantum key resources.

Communicating embedded systems networks applications

CERN Document Server

Krief, Francine

2013-01-01

Embedded systems become more and more complex and require having some knowledge in various disciplines such as electronics, data processing, telecommunications and networks. Without detailing all the aspects related to the design of embedded systems, this book, which was written by specialists in electronics, data processing and telecommunications and networks, gives an interesting point of view of communication techniques and problems in embedded systems. This choice is easily justified by the fact that embedded systems are today massively communicating and that telecommunications and network

Scalable Optical-Fiber Communication Networks

Science.gov (United States)

Chow, Edward T.; Peterson, John C.

1993-01-01

Scalable arbitrary fiber extension network (SAFEnet) is conceptual fiber-optic communication network passing digital signals among variety of computers and input/output devices at rates from 200 Mb/s to more than 100 Gb/s. Intended for use with very-high-speed computers and other data-processing and communication systems in which message-passing delays must be kept short. Inherent flexibility makes it possible to match performance of network to computers by optimizing configuration of interconnections. In addition, interconnections made redundant to provide tolerance to faults.

The Structure of Online Consumer Communication Networks

NARCIS (Netherlands)

B.G.C. Dellaert (Benedict); M.J.W. Harmsen-van Hout (Marjolein); P.J.J. Herings (Jean-Jacques)

2006-01-01

textabstractIn this paper we study the structure of the bilateral communication links within Online Consumer Communication Networks (OCCNs), such as virtual communities. Compared to the offline world, consumers in online networks are highly flexible to choose their communication partners and little

Real-Time Communication Networks Onboard Ships

DEFF Research Database (Denmark)

Nielsen, Jens Frederik Dalsgaard; Nielsen, Kirsten Mølgaard; Jørgensen, N.

1995-01-01

This paper describes the ATOMOS communication network project carried out within the EU project ATOMOS, to be used for ISC purposes.......This paper describes the ATOMOS communication network project carried out within the EU project ATOMOS, to be used for ISC purposes....

A fusion networking model for smart grid power distribution backbone communication network based on PTN

Directory of Open Access Journals (Sweden)

Wang Hao

2016-01-01

Full Text Available In current communication network for distribution in Chinese power grid systems, the fiber communication backbone network for distribution and TD-LTE power private wireless backhaul network of power grid are both bearing by the SDH optical transmission network, which also carries the communication network of transformer substation and main electric. As the data traffic of the distribution communication and TD-LTE power private wireless network grow rapidly in recent years, it will have a big impact with the SDH network’s bearing capacity which is mainly used for main electric communication in high security level. This paper presents a fusion networking model which use a multiple-layer PTN network as the unified bearing of the TD-LTE power private wireless backhaul network and fiber communication backbone network for distribution. Network dataflow analysis shows that this model can greatly reduce the capacity pressure of the traditional SDH network as well as ensure the reliability of the transmission of the communication network for distribution and TD-LTE power private wireless network.

Anonymous communication networks protecting privacy on the web

CERN Document Server

Peng, Kun

2014-01-01

In today's interactive network environment, where various types of organizations are eager to monitor and track Internet use, anonymity is one of the most powerful resources available to counterbalance the threat of unknown spectators and to ensure Internet privacy.Addressing the demand for authoritative information on anonymous Internet usage, Anonymous Communication Networks: Protecting Privacy on the Web examines anonymous communication networks as a solution to Internet privacy concerns. It explains how anonymous communication networks make it possible for participants to communicate with

Performance testing framework for smart grid communication network

International Nuclear Information System (INIS)

Quang, D N; See, O H; Chee, L L; Xuen, C Y; Karuppiah, S

2013-01-01

Smart grid communication network is comprised of different communication mediums and technologies. Performance evaluation is one of the main concerns in smart grid communication system. In any smart grid communication implementation, to determine the performance factor of the network, a testing of an end-to-end process flow is required. Therefore, an effective and coordinated testing procedure plays a crucial role in evaluating the performance of smart grid communications. In this paper, a testing framework is proposed as a guideline to analyze and assess the performance of smart grid communication network.

Validation of network communicability metrics for the analysis of brain structural networks.

Directory of Open Access Journals (Sweden)

Jennifer Andreotti

Full Text Available Computational network analysis provides new methods to analyze the brain's structural organization based on diffusion imaging tractography data. Networks are characterized by global and local metrics that have recently given promising insights into diagnosis and the further understanding of psychiatric and neurologic disorders. Most of these metrics are based on the idea that information in a network flows along the shortest paths. In contrast to this notion, communicability is a broader measure of connectivity which assumes that information could flow along all possible paths between two nodes. In our work, the features of network metrics related to communicability were explored for the first time in the healthy structural brain network. In addition, the sensitivity of such metrics was analysed using simulated lesions to specific nodes and network connections. Results showed advantages of communicability over conventional metrics in detecting densely connected nodes as well as subsets of nodes vulnerable to lesions. In addition, communicability centrality was shown to be widely affected by the lesions and the changes were negatively correlated with the distance from lesion site. In summary, our analysis suggests that communicability metrics that may provide an insight into the integrative properties of the structural brain network and that these metrics may be useful for the analysis of brain networks in the presence of lesions. Nevertheless, the interpretation of communicability is not straightforward; hence these metrics should be used as a supplement to the more standard connectivity network metrics.

Challenges of Integrating NASA's Space Communications Networks

Science.gov (United States)

Reinert, Jessica; Barnes, Patrick

2013-01-01

The transition to new technology, innovative ideas, and resistance to change is something that every industry experiences. Recent examples of this shift are changing to using robots in the assembly line construction of automobiles or the increasing use of robotics for medical procedures. Most often this is done with cost-reduction in mind, though ease of use for the customer is also a driver. All industries experience the push to increase efficiency of their systems; National Aeronautics and Space Administration (NASA) and the commercial space industry are no different. NASA space communication services are provided by three separately designed, developed, maintained, and operated communications networks known as the Deep Space Network (DSN), Near Earth Network (NEN) and Space Network (SN). The Space Communications and Navigation (SCaN) Program is pursuing integration of these networks and has performed a variety of architecture trade studies to determine what integration options would be the most effective in achieving a unified user mission support organization, and increase the use of common operational equipment and processes. The integration of multiple, legacy organizations and existing systems has challenges ranging from technical to cultural. The existing networks are the progeny of the very first communication and tracking capabilities implemented by NASA and the Jet Propulsion Laboratory (JPL) more than 50 years ago and have been customized to the needs of their respective user mission base. The technical challenges to integrating the networks are many, though not impossible to overcome. The three distinct networks provide the same types of services, with customizable data rates, bandwidth, frequencies, and so forth. The differences across the networks have occurred in effort to satisfy their user missions' needs. Each new requirement has made the networks more unique and harder to integrate. The cultural challenges, however, have proven to be a

Challenges of Integrating NASAs Space Communication Networks

Science.gov (United States)

Reinert, Jessica M.; Barnes, Patrick

2013-01-01

The transition to new technology, innovative ideas, and resistance to change is something that every industry experiences. Recent examples of this shift are changing to using robots in the assembly line construction of automobiles or the increasing use of robotics for medical procedures. Most often this is done with cost-reduction in mind, though ease of use for the customer is also a driver. All industries experience the push to increase efficiency of their systems; National Aeronautics and Space Administration (NASA) and the commercial space industry are no different. NASA space communication services are provided by three separately designed, developed, maintained, and operated communications networks known as the Deep Space Network (DSN), Near Earth Network (NEN) and Space Network (SN). The Space Communications and Navigation (SCaN) Program is pursuing integration of these networks and has performed a variety of architecture trade studies to determine what integration options would be the most effective in achieving a unified user mission support organization, and increase the use of common operational equipment and processes. The integration of multiple, legacy organizations and existing systems has challenges ranging from technical to cultural. The existing networks are the progeny of the very first communication and tracking capabilities implemented by NASA and the Jet Propulsion Laboratory (JPL) more than 50 years ago and have been customized to the needs of their respective user mission base. The technical challenges to integrating the networks are many, though not impossible to overcome. The three distinct networks provide the same types of services, with customizable data rates, bandwidth, frequencies, and so forth. The differences across the networks have occurred in effort to satisfy their user missions' needs. Each new requirement has made the networks more unique and harder to integrate. The cultural challenges, however, have proven to be a

A Framework for a Distributed and Adaptive Query Processing Engine for Wireless Sensor Networks

NARCIS (Netherlands)

Chatterjea, Supriyo; Honda, S; Iwaoka, H; van Hoesel, L.F.W.; Havinga, Paul J.M.

Wireless sensor networks (WSNs) are formed of tiny, highly energy-constrained sensor nodes that are equipped with wireless transceivers and can be used primarily in environmental monitoring applications. The nodes communicate with one another by autonomously creating ad-hoc multihop networks which

The congestion control algorithm based on queue management of each node in mobile ad hoc networks

Science.gov (United States)

Wei, Yifei; Chang, Lin; Wang, Yali; Wang, Gaoping

2016-12-01

This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. As the network load increases, local congestion of mobile ad hoc network may lead to network performance degradation, hot node's energy consumption increase even failure. If small energy nodes congested because of forwarding data packets, then when it is used as the source node will cause a lot of packet loss. This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. Controlling nodes buffer queue in different levels of congestion area probability by adjusting the upper limits and lower limits, thus nodes can adjust responsibility of forwarding data packets according to their own situation. The proposed algorithm will slow down the send rate hop by hop along the data package transmission direction from congestion node to source node so that to prevent further congestion from the source node. The simulation results show that, the algorithm can better play the data forwarding ability of strong nodes, protect the weak nodes, can effectively alleviate the network congestion situation.

System Design for Nano-Network Communications

Science.gov (United States)

ShahMohammadian, Hoda

The potential applications of nanotechnology in a wide range of areas necessities nano-networking research. Nano-networking is a new type of networking which has emerged by applying nanotechnology to communication theory. Therefore, this dissertation presents a framework for physical layer communications in a nano-network and addresses some of the pressing unsolved challenges in designing a molecular communication system. The contribution of this dissertation is proposing well-justified models for signal propagation, noise sources, optimum receiver design and synchronization in molecular communication channels. The design of any communication system is primarily based on the signal propagation channel and noise models. Using the Brownian motion and advection molecular statistics, separate signal propagation and noise models are presented for diffusion-based and flow-based molecular communication channels. It is shown that the corrupting noise of molecular channels is uncorrelated and non-stationary with a signal dependent magnitude. The next key component of any communication system is the reception and detection process. This dissertation provides a detailed analysis of the effect of the ligand-receptor binding mechanism on the received signal, and develops the first optimal receiver design for molecular communications. The bit error rate performance of the proposed receiver is evaluated and the impact of medium motion on the receiver performance is investigated. Another important feature of any communication system is synchronization. In this dissertation, the first blind synchronization algorithm is presented for the molecular communication channels. The proposed algorithm uses a non-decision directed maximum likelihood criterion for estimating the channel delay. The Cramer-Rao lower bound is also derived and the performance of the proposed synchronization algorithm is evaluated by investigating its mean square error.

Reliable communication stack for flexible probe vehicle data collection in vehicular ad hoc networks

DEFF Research Database (Denmark)

Paulin, Thomas

Traffic congestions caused by high vehicular densities are an ever increasing problem for both personal and professional transportation, resulting in significant losses each year. While expanding the road infrastructure often offers a short term solution, more intelligent approaches are necessary...... the communication resource a single access point can provide for delay tolerant applications. 2) We improve the information exchange between road-side units and vehicles by identifying communication characteristics of the road-side unit and use them to determine the optimal location at which the information...... exchange should occur. 3) We extend the coverage range of the road-side units through vehicle to vehicle communication by modifying an existing routing algorithm, improving both delivery rate and communication overhead. Applying the proposed methodologies on the collection of probe data provides...

Reliability Analysis Techniques for Communication Networks in Nuclear Power Plant

International Nuclear Information System (INIS)

Lim, T. J.; Jang, S. C.; Kang, H. G.; Kim, M. C.; Eom, H. S.; Lee, H. J.

2006-09-01

The objectives of this project is to investigate and study existing reliability analysis techniques for communication networks in order to develop reliability analysis models for nuclear power plant's safety-critical networks. It is necessary to make a comprehensive survey of current methodologies for communication network reliability. Major outputs of this study are design characteristics of safety-critical communication networks, efficient algorithms for quantifying reliability of communication networks, and preliminary models for assessing reliability of safety-critical communication networks

Smart vehicle monitoring and assistance using cloud computing in vehicular Ad Hoc networks

Directory of Open Access Journals (Sweden)

Yash Agarwal

2018-03-01

Full Text Available The increasing number of on road vehicles has become a major cause for congestion, accidents and pollution. Intelligent Transportation Systems (ITS might be the key to achieve solutions that help in reducing these problems significantly. The connected vehicular networks stream is a rapidly growing field for research and development of various real-time applications. In this paper, novel techniques have been proposed to serve the speed based lane changing, collision avoidance and time of arrival (TOA based localization in Vehicular Ad Hoc Networks (VANETs. As GPS requires clear line-of-sight for accurate services of positioning and localization applications, we designed a Time of Arrival (ToA based algorithm for areas where strong GPS signals are unavailable. Collision avoidance using automatic braking and camera-based surveillance are a few other applications that we addressed. The feasibility and the viability of the algorithms were demonstrated through simulations in Simulation of Urban Mobility (SUMO and Network Simulator-2 (NS-2. We prototyped a working hardware and tested it on actual vehicles to assess the effectiveness of the proposed system. We designed a mobile app interface for the on-board unit for smart, efficient and remote traffic monitoring. The integrated VANET Cloud Computing architecture acts as the platform for the proposed applications.

Wireless communications networks for the smart grid

CERN Document Server

Ho, Quang-Dung; Rajalingham, Gowdemy; Le-Ngoc, Tho

2014-01-01

This brief presents a comprehensive review of the network architecture and communication technologies of the smart grid communication network (SGCN). It then studies the strengths, weaknesses and applications of two promising wireless mesh routing protocols that could be used to implement the SGCN. Packet transmission reliability, latency and robustness of these two protocols are evaluated and compared by simulations in various practical SGCN scenarios. Finally, technical challenges and open research opportunities of the SGCN are addressed. Wireless Communications Networks for Smart Grid provi

Maritime wideband communication networks video transmission scheduling

CERN Document Server

Yang, Tingting

2014-01-01

This Springer Brief covers emerging maritime wideband communication networks and how they facilitate applications such as maritime distress, urgency, safety and general communications. It provides valuable insight on the data transmission scheduling and protocol design for the maritime wideband network. This brief begins with an introduction to maritime wideband communication networks including the architecture, framework, operations and a comprehensive survey on current developments. The second part of the brief presents the resource allocation and scheduling for video packet transmission wit