WorldWideScience

Sample records for hoc network communications

  1. Ad-hoc networking towards seamless communications

    CERN Document Server

    Gavrilovska, Liljana

    2006-01-01

    Ad-Hoc Networking Towards Seamless Communications is dedicated to an area that attracts growing interest in academia and industry and concentrates on wireless ad hoc networking paradigm. The persistent efforts to acquire the ability to establish dynamic wireless connections from anywhere to anyone with any device without prerequisite imbedded infrastructure move the communications boundaries towards ad-hoc networks. Recently, ad hoc networking has attracted growing interest due to advances in wireless communications, and developed framework for running IP based protocols. The expected degree of penetration of these networks will depend on the successful resolution of the key features. Ad-hoc networks pose many complex and open problems for researchers. Ad-Hoc Networking Towards Seamless Communications reveals the state-of-the-art in wireless ad-hoc networking and discusses some of the key research topics that are expected to promote and accelerate the commercial applications of these networks (e.g., MAC, rout...

  2. ON SECURE FULL DUPLEX COMMUNICATION IN MOBILE AD HOC NETWORK

    OpenAIRE

    S. C. Dutta; Sudha Singh; D. K. Singh

    2013-01-01

    This paper is to establish Ad Hoc network in mobile phones and start fully secured full duplex communication in any situation. This type of communication will be cost effective and it will be fastest way of communication in case of any server failure or server error.

  3. Capacity of Wireless Ad Hoc Networks with Opportunistic Collaborative Communications

    Directory of Open Access Journals (Sweden)

    Simeone O

    2007-01-01

    Full Text Available Optimal multihop routing in ad hoc networks requires the exchange of control messages at the MAC and network layer in order to set up the (centralized optimization problem. Distributed opportunistic space-time collaboration (OST is a valid alternative that avoids this drawback by enabling opportunistic cooperation with the source at the physical layer. In this paper, the performance of OST is investigated. It is shown analytically that opportunistic collaboration outperforms (centralized optimal multihop in case spatial reuse (i.e., the simultaneous transmission of more than one data stream is not allowed by the transmission protocol. Conversely, in case spatial reuse is possible, the relative performance between the two protocols has to be studied case by case in terms of the corresponding capacity regions, given the topology and the physical parameters of network at hand. Simulation results confirm that opportunistic collaborative communication is a promising paradigm for wireless ad hoc networks that deserves further investigation.

  4. Capacity of Wireless Ad Hoc Networks with Opportunistic Collaborative Communications

    Directory of Open Access Journals (Sweden)

    O. Simeone

    2007-03-01

    Full Text Available Optimal multihop routing in ad hoc networks requires the exchange of control messages at the MAC and network layer in order to set up the (centralized optimization problem. Distributed opportunistic space-time collaboration (OST is a valid alternative that avoids this drawback by enabling opportunistic cooperation with the source at the physical layer. In this paper, the performance of OST is investigated. It is shown analytically that opportunistic collaboration outperforms (centralized optimal multihop in case spatial reuse (i.e., the simultaneous transmission of more than one data stream is not allowed by the transmission protocol. Conversely, in case spatial reuse is possible, the relative performance between the two protocols has to be studied case by case in terms of the corresponding capacity regions, given the topology and the physical parameters of network at hand. Simulation results confirm that opportunistic collaborative communication is a promising paradigm for wireless ad hoc networks that deserves further investigation.

  5. Dynamic ad hoc networks

    CERN Document Server

    Rashvand, Habib

    2013-01-01

    Motivated by the exciting new application paradigm of using amalgamated technologies of the Internet and wireless, the next generation communication networks (also called 'ubiquitous', 'complex' and 'unstructured' networking) are changing the way we develop and apply our future systems and services at home and on local, national and global scales. Whatever the interconnection - a WiMAX enabled networked mobile vehicle, MEMS or nanotechnology enabled distributed sensor systems, Vehicular Ad hoc Networking (VANET) or Mobile Ad hoc Networking (MANET) - all can be classified under new networking s

  6. Voice Communications over 802.11 Ad Hoc Networks: Modeling, Optimization and Call Admission Control

    Science.gov (United States)

    Xu, Changchun; Xu, Yanyi; Liu, Gan; Liu, Kezhong

    Supporting quality-of-service (QoS) of multimedia communications over IEEE 802.11 based ad hoc networks is a challenging task. This paper develops a simple 3-D Markov chain model for queuing analysis of IEEE 802.11 MAC layer. The model is applied for performance analysis of voice communications over IEEE 802.11 single-hop ad hoc networks. By using the model, we finish the performance optimization of IEEE MAC layer and obtain the maximum number of voice calls in IEEE 802.11 ad hoc networks as well as the statistical performance bounds. Furthermore, we design a fully distributed call admission control (CAC) algorithm which can provide strict statistical QoS guarantee for voice communications over IEEE 802.11 ad hoc networks. Extensive simulations indicate the accuracy of the analytical model and the CAC scheme.

  7. 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...

  8. Performance Analysis of Mobile Ad Hoc Unmanned Aerial Vehicle Communication Networks with Directional Antennas

    Directory of Open Access Journals (Sweden)

    Abdel Ilah Alshbatat

    2010-01-01

    Full Text Available Unmanned aerial vehicles (UAVs have the potential of creating an ad hoc communication network in the air. Most UAVs used in communication networks are equipped with wireless transceivers using omnidirectional antennas. In this paper, we consider a collection of UAVs that communicate through wireless links as a mobile ad-hoc network using directional antennas. The network design goal is to maximize the throughput and minimize the end-to-end delay. In this respect, we propose a new medium access control protocol for a network of UAVs with directional antennas. We analyze the communication channel between the UAVs and the effect of aircraft attitude on the network performance. Using the optimized network engineering tool (OPNET, we compare our protocol with the IEEE 802.11 protocol for omnidirectional antennas. The simulation results show performance improvement in end-to-end delay as well as throughput.

  9. 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...

  10. 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...

  11. FRAMEWORK FOR AD HOC NETWORK COMMUNICATION IN MULTI-ROBOT SYSTEMS

    Directory of Open Access Journals (Sweden)

    Khilda Slyusar

    2016-11-01

    Full Text Available Assume a team of mobile robots operating in environments where no communication infrastructure like routers or access points is available. The robots have to create a mobile ad hoc network, in that case, it provides communication on peer-to-peer basis. The paper gives an overview of existing solutions how to route messages in such ad hoc networks between robots that are not directly connected and introduces a design of a software framework for realization of such communication. Feasibility of the proposed framework is shown on the example of distributed multi-robot exploration of an a priori unknown environment. Testing of developed functionality in an exploration scenario is based on results of several experiments with various input conditions of the exploration process and various sizes of a team and is described herein.

  12. A Protocol for Content-Based Communication in Disconnected Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Julien Haillot

    2010-01-01

    Full Text Available In content-based communication, information flows towards interested hosts rather than towards specifically set destinations. This new style of communication perfectly fits the needs of applications dedicated to information sharing, news distribution, service advertisement and discovery, etc. In this paper we address the problem of supporting content-based communication in partially or intermittently connected mobile ad hoc networks (MANETs. The protocol we designed leverages on the concepts of opportunistic networking and delay-tolerant networking in order to account for the absence of end-to-end connectivity in disconnected MANETs. The paper provides an overview of the protocol, as well as simulation results that show how this protocol can perform in realistic conditions.

  13. 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.

  14. 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...

  15. Car-to-Pedestrian Communication Safety System Based on the Vehicular Ad-Hoc Network Environment: A Systematic Review

    Directory of Open Access Journals (Sweden)

    Peng Jing

    2017-10-01

    Full Text Available With the unparalleled growth of motor vehicles, traffic accident between pedestrians and vehicles is one of the most serious issues in the word-wild. Plenty of injuries and fatalities are caused by the traffic accidents and crashes. The connected vehicular ad hoc network as an emerging approach which has the potential to reduce and even avoid accidents have been focused on by many researchers. A large number of car-to-pedestrian communication safety systems based on the vehicular ad hoc network are researching and developing. However, to our limited knowledge, a systematic review about the car-to-pedestrian communication safety system based on the vehicular ad-hoc network has not be written. The purpose and goal of this review is to systematically evaluate and access the reliability of car-to-pedestrian communication safety system based on the vehicular ad-hoc network environment and provide some recommendations for the future works according to throwing some light on the previous literatures. A quality evaluation was developed through established items and instruments tailored to this review. Future works are needed to focus on developing a valid as well as effective communication safety system based on the vehicular ad hoc network to protect the vulnerable road users.

  16. 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 ...

  17. 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.

  18. Queueing Models for Mobile Ad Hoc Networks

    NARCIS (Netherlands)

    de Haan, Roland

    2009-01-01

    This thesis presents models for the performance analysis of a recent communication paradigm: \\emph{mobile ad hoc networking}. The objective of mobile ad hoc networking is to provide wireless connectivity between stations in a highly dynamic environment. These dynamics are driven by the mobility of

  19. Research of Ad Hoc Networks Access Algorithm

    Science.gov (United States)

    Xiang, Ma

    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. When the ad hoc network is the access network of the internet, the gateway discovery protocol is very important to choose the most appropriate gateway to guarantee the connectivity between ad hoc network and IP based fixed networks. The paper proposes a QoS gateway discovery protocol which uses the time delay and stable route to the gateway selection conditions. And according to the gateway discovery protocol, it also proposes a fast handover scheme which can decrease the handover time and improve the handover efficiency.

  20. 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...

  1. 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.

  2. 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.

  3. Vehicular ad hoc network security and privacy

    CERN Document Server

    Lin, X

    2015-01-01

    Unlike any other book in this area, this book provides innovative solutions to security issues, making this book a must read for anyone working with or studying security measures. Vehicular Ad Hoc Network Security and Privacy mainly focuses on security and privacy issues related to vehicular communication systems. It begins with a comprehensive introduction to vehicular ad hoc network and its unique security threats and privacy concerns and then illustrates how to address those challenges in highly dynamic and large size wireless network environments from multiple perspectives. This book is richly illustrated with detailed designs and results for approaching security and privacy threats.

  4. 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...

  5. Ad hoc laser networks component technology for modular spacecraft

    Science.gov (United States)

    Huang, Xiujun; Shi, Dele; Shen, Jingshi

    2017-10-01

    Distributed reconfigurable satellite is a new kind of spacecraft system, which is based on a flexible platform of modularization and standardization. Based on the module data flow analysis of the spacecraft, this paper proposes a network component of ad hoc Laser networks architecture. Low speed control network with high speed load network of Microwave-Laser communication mode, no mesh network mode, to improve the flexibility of the network. Ad hoc Laser networks component technology was developed, and carried out the related performance testing and experiment. The results showed that ad hoc Laser networks components can meet the demand of future networking between the module of spacecraft.

  6. 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...

  7. 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...

  8. AD HOC Networks for the Autonomous Car

    Science.gov (United States)

    Ron, Davidescu; Negrus, Eugen

    2017-10-01

    The future of the vehicle is made of cars, roads and infrastructures connected in a two way automated communication in a holistic system. It is a mandatory to use Encryption to maintain Confidentiality, Integrity and Availability in an ad hoc vehicle network. Vehicle to Vehicle communication, requires multichannel interaction between mobile, moving and changing parties to insure the full benefit from data sharing and real time decision making, a network of such users referred as mobile ad hoc network (MANET), however as ad hoc networks were not implemented in such a scale, it is not clear what is the best method and protocol to apply. Furthermore the visibility of secure preferred asymmetric encrypted ad hoc networks in a real time environment of dense moving autonomous vehicles has to be demonstrated, In order to evaluate the performance of Ad Hoc networks in changing conditions a simulation of multiple protocols was performed on large number of mobile nodes. The following common routing protocols were tested, DSDV is a proactive protocol, every mobile station maintains a routing table with all available destinations, DSR is a reactive routing protocol which allows nodes in the MANET to dynamically discover a source route across multiple network hops, AODV is a reactive routing protocol Instead of being proactive. It minimizes the number of broadcasts by creating routes based on demand, SAODV is a secure version of AODV, requires heavyweight asymmetric cryptographic, ARIANDE is a routing protocol that relies on highly efficient symmetric cryptography the concept is primarily based on DSR. A methodical evolution was performed in a various density of transportation, based on known communication bench mark parameters including, Throughput Vs. time, Routing Load per packets and bytes. Out of the none encrypted protocols, It is clear that in terms of performance of throughput and routing load DSR protocol has a clear advantage the high node number mode. The encrypted

  9. 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.

  10. 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.

  11. 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

  12. 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

  13. 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.

  14. 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.

  15. Node counting in wireless ad-hoc networks

    NARCIS (Netherlands)

    Evers, J.H.M.; Kiss, D.; Kowalczyk, W.; Navilarekallu, T.; Renger, D.R.M.; Sella, L.; Timperio, V.; Viorel, A.; Wijk, van A.C.C.; Yzelman, A.J.; Planqué, B.; Bhulai, S.; Hulshof, J.; Kager, W.; Rot, T.

    2012-01-01

    We study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the wireless communication between the processors can be highly unreliable. For this setting, we propose a number of algorithms to estimate the number of nodes in the network, and the number of direct

  16. 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

  17. 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

  18. 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...

  19. 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...

  20. 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...

  1. 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 ...

  2. Securing DSR with mobile agents in wireless ad hoc networks

    Directory of Open Access Journals (Sweden)

    Ahmed Abosamra

    2011-03-01

    Full Text Available Ad hoc wireless network consists of a set of wireless nodes communicating with each other without a pre-defined infrastructure. They communicate by forwarding packets which can reach wireless nodes that do not exist in the range of the direct radio transmission. Designing ad hoc network routing protocols is a challenging task because of its decentralized infrastructure which makes securing ad hoc networks more and more challenging. Dynamic Source Routing (DSR protocol is a popular routing protocol designed for use in wireless ad hoc networks. Mobile agent is a promising technology used in diverse fields of network applications. In this paper, we try to implement DSR using mobile agents for securing this type of wireless network. Hybrid encryption technique (symmetric key encryption/public key encryption is used to improve performance; where symmetric keys are used to encrypt routing data to authenticate and authorize node sending data, while, public keys are used for the exchange of symmetric keys between nodes. We found that DSR may be secured using mobile agents with competitive performance.

  3. Secure Communication and Information Exchange using Authenticated Ciphertext Policy Attribute-Based Encryption in Mobile Ad-hoc Network

    Directory of Open Access Journals (Sweden)

    Samsul Huda

    2016-08-01

    Full Text Available MANETs are considered as suitable for commercial applications such as law enforcement, conference meeting, and sharing information in a student classroom and critical services such as military operations, disaster relief, and rescue operations. Meanwhile, in military operation especially in the battlefield in freely medium which naturally needs high mobility and flexibility. Thus, applying MANETs make these networks vulnerable to various types of attacks such aspacket eavesdropping, data disseminating, message replay, message modification, and especially privacy issue. In this paper, we propose a secure communication and information exchange in MANET with considering secure adhoc routing and secure information exchange. Regarding privacy issue or anonymity, we use a reliable asymmetric encryption which protecting user privacy by utilizing insensitive user attributes as user identity, CP-ABE (Ciphertext-Policy Attribute-Based Encryption cryptographic scheme. We also design protocols to implement the proposed scheme for various battlefied scenarios in real evironment using embedded devices. Our experimental results showed that the additional of HMAC (Keyed-Hash Message Authentication Code and AES (Advanced Encryption standard schemes using processor 1.2GHz only take processing time about 4.452 ms,  we can confirm that our approach by using CP-ABE with added HMAC and AES schemes make low overhead.

  4. 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

  5. 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...

  6. 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.

  7. 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.

  8. 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

  9. 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

  10. 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.

  11. 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...

  12. 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

  13. 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...

  14. 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

  15. 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

  16. 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.

  17. 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

  18. 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

  19. 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.

  20. DESAIN ALGORITMA DAN SIMULASI ROUTING UNTUK GATEWAY AD HOC WIRELESS NETWORKS

    Directory of Open Access Journals (Sweden)

    Nixson Meok

    2009-12-01

    Full Text Available   Routing protocol to the wireless ad hoc networks is very needed in the communication process between some terminals, to send the data packet through one or several node(s to the destination address where the network typology is always changing. Many previous works that discussed about routing ad hoc both for manet (mobile ad hoc networks and wireless networks, but the emphasis have more focus on comparing the performance of several routing ad hoc. While in this work, there is a bulding of routing algorithm model to gateway in land to the nodes that analogized as a boat that move on the sea. With the assumption that the communication inter terminals to radio band of Very High Frequency, thus algorithm that built in the simulation based on the range gap of the HF frequency. The result of this simulation will be developed as the platform to implement the service development of multiuser communication

  1. 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 ...

  2. 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.

  3. 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...

  4. 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.

  5. 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...

  6. 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...

  7. 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...

  8. 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...

  9. 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

  10. 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

  11. 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)

  12. 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.

  13. 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...

  14. NDN-CRAHNs: Named Data Networking for Cognitive Radio Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Rana Asif Rehman

    2015-01-01

    Full Text Available Named data networking (NDN is a newly proposed paradigm for future Internet, in which communication among nodes is based on data names, decoupling from their locations. In dynamic and self-organized cognitive radio ad hoc networks (CRAHNs, it is difficult to maintain end-to-end connectivity between ad hoc nodes especially in the presence of licensed users and intermittent wireless channels. Moreover, IP-based CRAHNs have several issues like scalability, inefficient-mapping, poor resource utilization, and location dependence. By leveraging the advantages of NDN, in this paper, we propose a new cross layer fine-grained architecture called named data networking for cognitive radio ad hoc networks (NDN-CRAHNs. The proposed architecture provides distinct features such as in-networking caching, security, scalability, and multipath routing. The performances of the proposed scheme are evaluated comparing to IP-based scheme in terms of average end-to-end delay and packet delivery ratio. Simulation results show that the proposed scheme is effective in terms of average contents download time and packet delivery ratios comparing to conventional cognitive radio ad hoc networks.

  15. 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.

  16. 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

  17. 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

  18. 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...

  19. 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

  20. 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.

  1. 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

  2. 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...

  3. 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.

  4. 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

  5. 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

  6. 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.

  7. 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.

  8. A game-theoretic approach to optimize ad hoc networks inspired by small-world network topology

    Science.gov (United States)

    Tan, Mian; Yang, Tinghong; Chen, Xing; Yang, Gang; Zhu, Guoqing; Holme, Petter; Zhao, Jing

    2018-03-01

    Nodes in ad hoc networks are connected in a self-organized manner. Limited communication radius makes information transmit in multi-hop mode, and each forwarding needs to consume the energy of nodes. Insufficient communication radius or exhaustion of energy may cause the absence of some relay nodes and links, further breaking network connectivity. On the other hand, nodes in the network may refuse to cooperate due to objective faulty or personal selfish, hindering regular communication in the network. This paper proposes a model called Repeated Game in Small World Networks (RGSWN). In this model, we first construct ad hoc networks with small-world feature by forming "communication shortcuts" between multiple-radio nodes. Small characteristic path length reduces average forwarding times in networks; meanwhile high clustering coefficient enhances network robustness. Such networks still maintain relative low global power consumption, which is beneficial to extend the network survival time. Then we use MTTFT strategy (Mend-Tolerance Tit-for-Tat) for repeated game as a rule for the interactions between neighbors in the small-world networks. Compared with other five strategies of repeated game, this strategy not only punishes the nodes' selfishness more reasonably, but also has the best tolerance to the network failure. This work is insightful for designing an efficient and robust ad hoc network.

  9. 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.

  10. 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

  11. 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.

  12. 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.

  13. 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. .

  14. 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.

  15. 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.

  16. 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

  17. 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.

  18. 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.

  19. 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

  20. 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

  1. 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 ...

  2. 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

  3. Realtime multiprocessor for mobile ad hoc networks

    Directory of Open Access Journals (Sweden)

    T. Jungeblut

    2008-05-01

    Full Text Available This paper introduces a real-time Multiprocessor System-On-Chip (MPSoC for low power wireless applications. The multiprocessor is based on eight 32bit RISC processors that are connected via an Network-On-Chip (NoC. The NoC follows a novel approach with guaranteed bandwidth to the application that meets hard realtime requirements. At a clock frequency of 100 MHz the total power consumption of the MPSoC that has been fabricated in 180 nm UMC standard cell technology is 772 mW.

  4. 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

  5. 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.

  6. 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.

  7. 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 ...

  8. 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

  9. 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.

  10. 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.

  11. 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

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. 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....

  18. 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.

  19. 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

  20. 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.

  1. 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.

  2. 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.

  3. 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...

  4. 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. 

  5. 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).

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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

  15. 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.

  16. 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%.

  17. 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.

  18. 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.

  19. 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.

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. 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

  5. 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.

  6. 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

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. 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...

  17. 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

  18. 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...

  19. 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....

  20. 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

  1. 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-...

  2. 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

  3. 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

  4. 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...

  5. 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

  6. 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.

  7. 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.

  8. 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.

  9. 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...

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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...

  20. 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...

  1. 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...

  2. 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.

  3. 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...

  4. 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.

  5. 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...

  6. 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.

  7. 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...

  8. 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...

  9. 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

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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...

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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.

  20. 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.

  1. 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

  2. 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.

  3. 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

  4. 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.

  5. 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...

  6. 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...

  7. 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...

  8. A Novel Routing Algorithm for Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Raúl Aquino Santos

    2008-01-01

    Full Text Available Este trabajo examina la importancia de las redes inalámbricas ad hoc y el algoritmo de enrutamiento con inundación basada en grupos (LORA-CBF para la comunicación inter-vehicular con la finalidad de optimizar el flujo de tráfico e incrementar la seguridad en las autopistas. Se discute el algoritmo de enrutamiento LORA-CBF y se presentan los resultados de simulaciones realizadas en OPNET de una autopista con alta movilidad vehicular. Primero, el modelo de simulación propuesto se valida a pequeña escala con resultados experimentales. Posteriormente, se emplean simulaciones de nuestro modelo comparándolos con Ad Hoc On-Demand Distance Vector (AODV y Dynamic Source Routing (DSR. Finalmente, se emplea un modelo de tráfico microscópico desarrollado en OPNET para simular la movilidad de 250 vehículos en una autopista y se aplica el algoritmo de enrutamiento LORA-CBF en un escenario vehicular.

  9. 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.

  10. 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...

  11. 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.

  12. 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

  13. 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

  14. 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

  15. 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.

  16. EAP-Based Authentication for Ad Hoc Network

    OpenAIRE

    Bhakti, Muhammad Agni Catur; Abdullah, Azween; Jung, Low Tan

    2007-01-01

    Wireless network has been deployed worldwide, but some security issues in wireless network might haveprevented its further acceptance. One of the solutions to overcome the limitation of wireless network security isthe IEEE 802.1X specification, a mechanism for port-based network access control, which is based onExtensible Authentication Protocol (EAP). It is an authentication framework that can support multipleauthentication methods. EAP can run over many types of data-link layer and it is fl...

  17. 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.

  18. 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.

  19. Communication Network Analysis Methods.

    Science.gov (United States)

    Farace, Richard V.; Mabee, Timothy

    This paper reviews a variety of analytic procedures that can be applied to network data, discussing the assumptions and usefulness of each procedure when applied to the complexity of human communication. Special attention is paid to the network properties measured or implied by each procedure. Factor analysis and multidimensional scaling are among…

  20. 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....

  1. Connectivity analysis of one-dimensional ad-hoc networks

    DEFF Research Database (Denmark)

    Hansen, Martin Bøgsted; Rasmussen, Jakob Gulddahl; Schwefel, Hans-Peter

    hop-count; (3) the connectivity distance, expressing the geographic distance that a message can be propagated in the network on multi-hop paths; (4) the connectivity hops, which corresponds to the number of hops that are necessary to reach all nodes in the connected network. The paper develops...

  2. Connectivity analysis of one-dimensional ad-hoc networks

    DEFF Research Database (Denmark)

    Bøgsted, Martin; Rasmussen, Jakob Gulddahl; Schwefel, Hans Peter

    2011-01-01

    distance, expressing the geographic distance that a message can be propagated in the network on multi-hop paths; (4) the connectivity hops, which corresponds to the number of hops that are necessary to reach all nodes in the connected network. The paper develops analytic expressions for the distributions...

  3. 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.

  4. 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.

  5. FHWA White Paper on Mobile Ad Hoc Networks

    Science.gov (United States)

    2018-01-01

    Advanced next generation communications technologies offer the potential to greatly improve safety, system efficiency, and mobility across our Nations roadways. These new technologies and processes can address both traditionally difficult as well ...

  6. Protocols for Impulse Radio UWB Ad Hoc Networks

    NARCIS (Netherlands)

    Shi, N.

    2010-01-01

    Ultra Wideband (UWB) technology offers an unprecedented opportunity to further accelerate the evolution of wireless communication and expand the application landscape by enabling outstanding capabilities. UWB radio is fundamentally different from most radio technologies, e.g., Bluetooth, WLAN, etc.

  7. 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.

  8. 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.

  9. Simplified Multicast Forwarding in Mobile Ad Hoc Networks

    National Research Council Canada - National Science Library

    Macker, Joseph P; Dean, Justin; Chao, William

    2004-01-01

    ...) based upon flooding mechanisms. We present the design of a working experimental prototype and some initial performance results using the NRL mobile network emulation system and various optional flooding approaches within the design framework...

  10. Reinforcement Learning for Routing in Cognitive Radio Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Hasan A. A. Al-Rawi

    2014-01-01

    Full Text Available Cognitive radio (CR enables unlicensed users (or secondary users, SUs to sense for and exploit underutilized licensed spectrum owned by the licensed users (or primary users, PUs. Reinforcement learning (RL is an artificial intelligence approach that enables a node to observe, learn, and make appropriate decisions on action selection in order to maximize network performance. Routing enables a source node to search for a least-cost route to its destination node. While there have been increasing efforts to enhance the traditional RL approach for routing in wireless networks, this research area remains largely unexplored in the domain of routing in CR networks. This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate through simulation. New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing. Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs’ network performance without significantly jeopardizing PUs’ network performance, specifically SUs’ interference to PUs.

  11. 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.

  12. 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)

  13. 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.

  14. 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.

  15. Probabilistic Models and Process Calculi for Mobile Ad Hoc Networks

    DEFF Research Database (Denmark)

    Song, Lei

    , thus the network topology may undergo constant changes. Moreover the devices in an MANET are loosely connected not depending on pre-installed infrastructure or central control components, they exchange messages via wireless connections which are less reliable compared to wired connections. Therefore...

  16. Computing Nash Equilibrium in Wireless Ad Hoc Networks

    DEFF Research Database (Denmark)

    Bulychev, Peter E.; David, Alexandre; Larsen, Kim G.

    2012-01-01

    This paper studies the problem of computing Nash equilibrium in wireless networks modeled by Weighted Timed Automata. Such formalism comes together with a logic that can be used to describe complex features such as timed energy constraints. Our contribution is a method for solving this problem...

  17. 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

  18. 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...

  19. 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

  20. 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

  1. 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

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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.

  7. 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…

  8. 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...

  9. 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.

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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

  20. 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...

  1. 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.

  2. Reorganization of intruder Using Ad-Hoc Network And RFID

    Directory of Open Access Journals (Sweden)

    Vishakha Hagawane

    2014-05-01

    Full Text Available This system is to develop a centralized computer application that needs to identify moving person in a specific area using wireless network. In this paper, we develop a new indoor tracking algorithm using received signal strength. The RFID is able to detect the humans and provide information about the direction of the movement. The gathered information from the node is to be given to the base station for processing. . This application is able to detect and track person, and report direction of the intruder to a central base station. In this system we design nodes through which we are able to track the person. The human intruder is detected using Zigbee.

  3. 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

    networks to solve tasks collaboratively. In this proposal the Collaboration Layer is modelled to handle service and position discovery, group management, and synchronisation among robots, but the layer is also designed to be extendable. Based on this model of the Collaboration Layer, generic services...... are provided to the application running on the robot. The services are generic because they can be used by many different applications, independent of the task to be solved. Likewise, specific services are requested from the underlying Virtual Machine, such as broadcast, multicast, and reliable unicast....... A prototype of the Collaboration Layer has been developed to run in a simulated environment and tested in an evaluation scenario. In the scenario five robots solve the tasks of vacuum cleaning and entrance guarding, which involves the ability to discover potential co-workers, form groups, shift from one group...

  4. Connectivist Communication Networks

    Science.gov (United States)

    Waßmann, Ingolf; Nicolay, Robin; Martens, Alke

    2016-01-01

    Facing the challenges of the digital age concerning lifelong learning, this contribution presents an approach to dynamically establish Connectivist communication networks. According the statement "the pipe is more important than the content within the pipe" by Georg Siemens, learning in digital age includes the connection of people to…

  5. European environmental communication networks

    International Nuclear Information System (INIS)

    Plesnikova, T.

    2005-01-01

    The goal of this presentation is apprise of special community - representatives of state and public administration, self-administration, workers of scientific institutes, schools, private companies and next privies subjects of areas of the environment with possibilities of access to actual environmental information by the Internet. Web-sites of environmental communication networks with data about the environment are presented

  6. 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.

  7. 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...

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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.

  15. 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

  16. 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

  17. 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.

  18. Communicability across evolving networks.

    Science.gov (United States)

    Grindrod, Peter; Parsons, Mark C; Higham, Desmond J; Estrada, Ernesto

    2011-04-01

    Many natural and technological applications generate time-ordered sequences of networks, defined over a fixed set of nodes; for example, time-stamped information about "who phoned who" or "who came into contact with who" arise naturally in studies of communication and the spread of disease. Concepts and algorithms for static networks do not immediately carry through to this dynamic setting. For example, suppose A and B interact in the morning, and then B and C interact in the afternoon. Information, or disease, may then pass from A to C, but not vice versa. This subtlety is lost if we simply summarize using the daily aggregate network given by the chain A-B-C. However, using a natural definition of a walk on an evolving network, we show that classic centrality measures from the static setting can be extended in a computationally convenient manner. In particular, communicability indices can be computed to summarize the ability of each node to broadcast and receive information. The computations involve basic operations in linear algebra, and the asymmetry caused by time's arrow is captured naturally through the noncommutativity of matrix-matrix multiplication. Illustrative examples are given for both synthetic and real-world communication data sets. We also discuss the use of the new centrality measures for real-time monitoring and prediction.

  19. 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.

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. 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)

  5. 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.

  6. 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

  7. 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...

  8. 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

  9. 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.

  10. 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...

  11. 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...

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  18. 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...

  19. 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.

  20. 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.

  1. 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.

  2. 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

  3. 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.

  4. 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.

  5. 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.

  6. 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.

  7. 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.

  8. 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...

  9. 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...

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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.

  15. 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?

  16. 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

  17. 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.

  18. 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.

  19. 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...

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. Verifying Safety Messages Using Relative-Time and Zone Priority in Vehicular Ad Hoc Networks

    Science.gov (United States)

    Banani, Sam; Thiemjarus, Surapa; Kittipiyakul, Somsak

    2018-01-01

    In high-density road networks, with each vehicle broadcasting multiple messages per second, the arrival rate of safety messages can easily exceed the rate at which digital signatures can be verified. Since not all messages can be verified, algorithms for selecting which messages to verify are required to ensure that each vehicle receives appropriate awareness about neighbouring vehicles. This paper presents a novel scheme to select important safety messages for verification in vehicular ad hoc networks (VANETs). The proposed scheme uses location and direction of the sender, as well as proximity and relative-time between vehicles, to reduce the number of irrelevant messages verified (i.e., messages from vehicles that are unlikely to cause an accident). Compared with other existing schemes, the analysis results show that the proposed scheme can verify messages from nearby vehicles with lower inter-message delay and reduced packet loss and thus provides high level of awareness of the nearby vehicles. PMID:29652840

  6. 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.

  7. An Opportunistic Routing for Data Forwarding Based on Vehicle Mobility Association in Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Leilei Wang

    2017-11-01

    Full Text Available Vehicular ad hoc networks (VANETs have emerged as a new powerful technology for data transmission between vehicles. Efficient data transmission accompanied with low data delay plays an important role in selecting the ideal data forwarding path in VANETs. This paper proposes a new opportunity routing protocol for data forwarding based on vehicle mobility association (OVMA. With assistance from the vehicle mobility association, data can be forwarded without passing through many extra intermediate nodes. Besides, each vehicle carries the only replica information to record its associated vehicle information, so the routing decision can adapt to the vehicle densities. Simulation results show that the OVMA protocol can extend the network lifetime, improve the performance of data delivery ratio, and reduce the data delay and routing overhead when compared to the other well-known routing protocols.

  8. 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.

  9. 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%.‎

  10. 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

  11. 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.

  12. 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,...

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. Asymptotic Delay Analysis for Cross-Layer Delay-Based Routing in Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Philippe Jacquet

    2007-01-01

    Full Text Available This paper addresses the problem of the evaluation of the delay distribution via analytical means in IEEE 802.11 wireless ad hoc networks. We show that the asymptotic delay distribution can be expressed as a power law. Based on the latter result, we present a cross-layer delay estimation protocol and we derive new delay-distribution-based routing algorithms, which are well adapted to the QoS requirements of real-time multimedia applications. In fact, multimedia services are not sensitive to average delays, but rather to the asymptotic delay distributions. Indeed, video streaming applications drop frames when they are received beyond a delay threshold, determined by the buffer size. Although delay-distribution-based routing is an NP-hard problem, we show that it can be solved in polynomial time when the delay threshold is large, because of the asymptotic power law distribution of the link delays.

  18. Content Downloading with the Assistance of Roadside Cars for Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Haigang Gong

    2017-01-01

    Full Text Available Plenty of multimedia contents such as traffic images, music, and movies pose great challenges for content downloading due to the high mobility of vehicles and intermittent connectivity for vehicular ad hoc networks. Roadside units or APs can improve the efficiency of content downloading but with the cost of large investments. In this paper, an efficient content downloading scheme is proposed with the assistance of parking clusters, which are formed by roadside parked cars. After receiving the downloading request, the parking clusters, which the downloader will travel through according to the estimated trajectory, will make a download scheduling for the downloader. Then the downloader acquires the content chunks while it drives through the parking clusters. Simulation results show that the proposed scheme achieves better performance than intervehicle approach and RSU based approach.

  19. Quorum system and random based asynchronous rendezvous protocol for cognitive radio ad hoc networks

    Directory of Open Access Journals (Sweden)

    Sylwia Romaszko

    2013-12-01

    Full Text Available This paper proposes a rendezvous protocol for cognitive radio ad hoc networks, RAC2E-gQS, which utilizes (1 the asynchronous and randomness properties of the RAC2E protocol, and (2 channel mapping protocol, based on a grid Quorum System (gQS, and taking into account channel heterogeneity and asymmetric channel views. We show that the combination of the RAC2E protocol with the grid-quorum based channel mapping can yield a powerful RAC2E-gQS rendezvous protocol for asynchronous operation in a distributed environment assuring a rapid rendezvous between the cognitive radio nodes having available both symmetric and asymmetric channel views. We also propose an enhancement of the protocol, which uses a torus QS for a slot allocation, dealing with the worst case scenario, a large number of channels with opposite ranking lists.

  20. 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.

  1. EPA Library Network Communication Strategies

    Science.gov (United States)

    To establish Agency-wide procedures for the EPA National Library Network libraries to communicate, using a range of established mechanisms, with other EPA libraries, EPA staff, organizations and the public.

  2. Networked Constellation Communications Technologies

    Data.gov (United States)

    National Aeronautics and Space Administration — Develop communications architectures and enabling technologies for mission concepts relying on multiple spatially distributed spacecraft to perform coordinated...

  3. 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...

  4. 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.

  5. Frame Transmission Efficiency-Based Cross-Layer Congestion Notification Scheme in Wireless Ad Hoc Networks.

    Science.gov (United States)

    He, Huaguang; Li, Taoshen; Feng, Luting; Ye, Jin

    2017-07-15

    Different from the traditional wired network, the fundamental cause of transmission congestion in wireless ad hoc networks is medium contention. How to utilize the congestion state from the MAC (Media Access Control) layer to adjust the transmission rate is core work for transport protocol design. However, recent works have shown that the existing cross-layer congestion detection solutions are too complex to be deployed or not able to characterize the congestion accurately. We first propose a new congestion metric called frame transmission efficiency (i.e., the ratio of successful transmission delay to the frame service delay), which describes the medium contention in a fast and accurate manner. We further present the design and implementation of RECN (ECN and the ratio of successful transmission delay to the frame service delay in the MAC layer, namely, the frame transmission efficiency), a general supporting scheme that adjusts the transport sending rate through a standard ECN (Explicit Congestion Notification) signaling method. Our method can be deployed on commodity switches with small firmware updates, while making no modification on end hosts. We integrate RECN transparently (i.e., without modification) with TCP on NS2 simulation. The experimental results show that RECN remarkably improves network goodput across multiple concurrent TCP flows.

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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

  12. BRAND COMMUNICATION ON SOCIAL NETWORKS

    Directory of Open Access Journals (Sweden)

    Otilia-Elena PLATON

    2015-07-01

    Full Text Available The communication represents a basic element for the marketing activity that helps companies to achieve their objectives. Building long-term relationships between brands and consumers is one of the most important objectives pursued by marketers. This involves brand communication and creating multiple connections with consumers, even in the online environment. From this point of view, social networks proved to be an effective way of linking brands and consumers online. This paper aims to present some aspects involved by the usage of social networks in brand communication by analyzing several examples of online marketing campaigns implemented on Facebook on the occasion of Valentine's Day by six different brands.

  13. 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.

  14. 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....

  15. 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

  16. RELATIONSHIPS AND COMMUNICATION NETWORKS

    OpenAIRE

    Stefan VLADUTESCU

    2012-01-01

    The main feature of the present situation regarding communication is the impregnation of the social with technology. Computer-mediated communication systems has led to the crystallization of a strong specific interactions. This article describes how human relationships constitues the ontological pillar of society and social relations form the axis irradiance of sociology. Overall, as social agents in social space, people come in a variety of social relationships. Thus, a distinct note of the ...

  17. A FSA Model for Performance Evaluation over Mobile Ad Hoc Networks with Low Traffic Volume

    Directory of Open Access Journals (Sweden)

    Heng LUO

    2014-07-01

    Full Text Available A Mobile Ad hoc network (MANET, which is composed of nodes that are able to move arbitrarily, differs from a direct connection network in the way that it is multi-hopping and self- organizing and thus able to operate without the help of prefixed infrastructures. However, problems such as unfavorable wireless links and dynamic topology are challenging, resulting in the proposal of a collection of routing protocols for MANETs. Nevertheless the performance of protocols may deteriorate dramatically as deployment scenario changes due to the application dependent philosophy behind algorithms. In this paper, the performance evaluation problem for MANETs and is explored and a novel performance ranking model, termed FSA, is proposed. For simplicity but without loss of generality, the performance of two routing protocols DSDV and DSR are studies. The FSA is able to rank the performance of DSDV and DSR depending on the average value and standard deviation results. Extensive simulations show that an overall 20.74 %, at most, gain may be achieved based on the FSA model.

  18. 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.

  19. Vehicle Assisted Data Delievery Technique To Control Data Dissemination In Vehicular AD - HOC Networks Vanets

    Directory of Open Access Journals (Sweden)

    Sandeep Kumar

    2015-08-01

    Full Text Available Abstract Multi-hop data delivery through vehicular ad hoc networks is complicated by the fact that vehicular networks are highly mobile and frequently disconnected. To address this issue the idea of helper node is opted where a moving vehicles carries the packet until a new vehicle moves into its vicinity and forwards the packet. Different from existing helper node solution use of the predicable vehicle mobility is made which is limited by the traffic pattern and the road layout. Based on the existing traffic pattern a vehicle can find the next road to forward packet a vehicle can find the next road to forward the packet to reduce the delay. Several vehicle-assisted date delievery VADD protocol is proposed to forward the packet to the best road with the road with the lowest data delivery delay. Experiment results are used to evaluate the proposed solutions. Results show that the proposed VADD protocol outperform existing solution in terms of packet delivery ratio data packet delay and protocol overhead. Among the proposed VADD protocols the Hybrid probe HVADD protocol has much better performance. In this Solution the helper node technique is provider with which the helper node will contain destination node path and the path in routine table continuously changes with the help of helper node technique.

  20. Concurrent Transmission Based on Channel Quality in Ad Hoc Networks: A Game Theoretic Approach

    Science.gov (United States)

    Chen, Chen; Gao, Xinbo; Li, Xiaoji; Pei, Qingqi

    In this paper, a decentralized concurrent transmission strategy in shared channel in Ad Hoc networks is proposed based on game theory. Firstly, a static concurrent transmissions game is used to determine the candidates for transmitting by channel quality threshold and to maximize the overall throughput with consideration of channel quality variation. To achieve NES (Nash Equilibrium Solution), the selfish behaviors of node to attempt to improve the channel gain unilaterally are evaluated. Therefore, this game allows each node to be distributed and to decide whether to transmit concurrently with others or not depending on NES. Secondly, as there are always some nodes with lower channel gain than NES, which are defined as hunger nodes in this paper, a hunger suppression scheme is proposed by adjusting the price function with interferences reservation and forward relay, to fairly give hunger nodes transmission opportunities. Finally, inspired by stock trading, a dynamic concurrent transmission threshold determination scheme is implemented to make the static game practical. Numerical results show that the proposed scheme is feasible to increase concurrent transmission opportunities for active nodes, and at the same time, the number of hunger nodes is greatly reduced with the least increase of threshold by interferences reservation. Also, the good performance on network goodput of the proposed model can be seen from the results.

  1. Fuzzy-Based Sensor Fusion for Cognitive Radio-Based Vehicular Ad Hoc and Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mohammad Jalil Piran

    2015-01-01

    Full Text Available In wireless sensor networks, sensor fusion is employed to integrate the acquired data from diverse sensors to provide a unified interpretation. The best and most salient advantage of sensor fusion is to obtain high-level information in both statistical and definitive aspects, which cannot be attained by a single sensor. In this paper, we propose a novel sensor fusion technique based on fuzzy theory for our earlier proposed Cognitive Radio-based Vehicular Ad Hoc and Sensor Networks (CR-VASNET. In the proposed technique, we considered four input sensor readings (antecedents and one output (consequent. The employed mobile nodes in CR-VASNET are supposed to be equipped with diverse sensors, which cater to our antecedent variables, for example, The Jerk, Collision Intensity, and Temperature and Inclination Degree. Crash_Severity is considered as the consequent variable. The processing and fusion of the diverse sensory signals are carried out by fuzzy logic scenario. Accuracy and reliability of the proposed protocol, demonstrated by the simulation results, introduce it as an applicable system to be employed to reduce the causalities rate of the vehicles’ crashes.

  2. Road Accident Prevention with Instant Emergency Warning Message Dissemination in Vehicular Ad-Hoc Network.

    Science.gov (United States)

    Gokulakrishnan, P; Ganeshkumar, P

    2015-01-01

    A Road Accident Prevention (RAP) scheme based on Vehicular Backbone Network (VBN) structure is proposed in this paper for Vehicular Ad-hoc Network (VANET). The RAP scheme attempts to prevent vehicles from highway road traffic accidents and thereby reduces death and injury rates. Once the possibility of an emergency situation (i.e. an accident) is predicted in advance, instantly RAP initiates a highway road traffic accident prevention scheme. The RAP scheme constitutes the following activities: (i) the Road Side Unit (RSU) constructs a Prediction Report (PR) based on the status of the vehicles and traffic in the highway roads, (ii) the RSU generates an Emergency Warning Message (EWM) based on an abnormal PR, (iii) the RSU forms a VBN structure and (iv) the RSU disseminates the EWM to the vehicles that holds the high Risk Factor (RF) and travels in High Risk Zone (HRZ). These vehicles might reside either within the RSU's coverage area or outside RSU's coverage area (reached using VBN structure). The RAP scheme improves the performance of EWM dissemination in terms of increase in notification and decrease in end-to-end delay. The RAP scheme also reduces infrastructure cost (number of RSUs) by formulating and deploying the VBN structure. The RAP scheme with VBN structure improves notification by 19 percent and end-to-end delay by 14.38 percent for a vehicle density of 160 vehicles. It is also proved from the simulation experiment that the performance of RAP scheme is promising in 4-lane highway roads.

  3. 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.

  4. Energy Effective Congestion Control for Multicast with Network Coding in Wireless Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    Chuanxin Zhao

    2014-01-01

    Full Text Available In order to improve network throughput and reduce energy consumption, we propose in this paper a cross-layer optimization design that is able to achieve multicast utility maximization and energy consumption minimization. The joint optimization of congestion control and power allocation is formulated to be a nonlinear nonconvex problem. Using dual decomposition, a distributed optimization algorithm is proposed to avoid the congestion by control flow rate at the source node and eliminate the bottleneck by allocating the power at the intermediate node. Simulation results show that the cross-layer algorithm can increase network performance, reduce the energy consumption of wireless nodes and prolong the network lifetime, while keeping network throughput basically unchanged.

  5. Towards Trust-based Cognitive Networks: A Survey of Trust Management for Mobile Ad Hoc Networks

    Science.gov (United States)

    2009-06-01

    of trust. First, social trust refers to properties derived from social relationships . Examples of social networks are strong social ... relationships such as colleagues or relatives or loose social relationships such as school alumni or friends with common interests [44]. Social trust may...also use social relationships in evaluating the trust metric among group members by employing the concept of social networks. Yu et al. [44] define

  6. IDMA: improving the defense against malicious attack for mobile ad hoc networks based on ARIP protocol

    Science.gov (United States)

    Peng, Chaorong; Chen, Chang Wen

    2008-04-01

    Malicious nodes are mounting increasingly sophisticated attacking operations on the Mobile Ad Hoc Networks (MANETs). This is mainly because the IP-based MANETs are vulnerable to attacks by various malicious nodes. However, the defense against malicious attack can be improved when a new layer of network architecture can be developed to separate true IP address from disclosing to the malicious nodes. In this paper, we propose a new algorithm to improve the defense against malicious attack (IDMA) that is based on a recently developed Assignment Router Identify Protocol (ARIP) for the clustering-based MANET management. In the ARIP protocol, we design the ARIP architecture based on the new Identity instead of the vulnerable IP addresses to provide the required security that is embedded seamlessly into the overall network architecture. We make full use of ARIP's special property to monitor gateway forward packets by Reply Request Route Packets (RREP) without additional intrusion detection layer. We name this new algorithm IDMA because of its inherent capability to improve the defense against malicious attacks. Through IDMA, a watching algorithm can be established so as to counterattack the malicious node in the routing path when it unusually drops up packets. We provide analysis examples for IDMA for the defense against a malicious node that disrupts the route discovery by impersonating the destination, or by responding with state of corrupted routing information, or by disseminating forged control traffic. The IDMA algorithm is able to counterattack the malicious node in the cases when the node lunch DoS attack by broadcast a large number of route requests, or make Target traffic congestion by delivering huge mount of data; or spoof the IP addresses and send forge packets with a fake ID to the same Target causing traffic congestion at that destination. We have implemented IDMA algorism using the GloMoSim simulator and have demonstrated its performance under a variety of

  7. 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.

  8. 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.

  9. An Efficient and QoS Supported Multichannel MAC Protocol for Vehicular Ad Hoc Networks.

    Science.gov (United States)

    Song, Caixia; Tan, Guozhen; Yu, Chao

    2017-10-09

    Vehicular Ad Hoc Networks (VANETs) employ multichannel to provide a variety of safety and non-safety (transport efficiency and infotainment) applications, based on the IEEE 802.11p and IEEE 1609.4 protocols. Different types of applications require different levels Quality-of-Service (QoS) support. Recently, transport efficiency and infotainment applications (e.g., electronic map download and Internet access) have received more and more attention, and this kind of applications is expected to become a big market driver in a near future. In this paper, we propose an Efficient and QoS supported Multichannel Medium Access Control (EQM-MAC) protocol for VANETs in a highway environment. The EQM-MAC protocol utilizes the service channel resources for non-safety message transmissions during the whole synchronization interval, and it dynamically adjusts minimum contention window size for different non-safety services according to the traffic conditions. Theoretical model analysis and extensive simulation results show that the EQM-MAC protocol can support QoS services, while ensuring the high saturation throughput and low transmission delay for non-safety applications.

  10. An Efficient and QoS Supported Multichannel MAC Protocol for Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Caixia Song

    2017-10-01

    Full Text Available Vehicular Ad Hoc Networks (VANETs employ multichannel to provide a variety of safety and non-safety (transport efficiency and infotainment applications, based on the IEEE 802.11p and IEEE 1609.4 protocols. Different types of applications require different levels Quality-of-Service (QoS support. Recently, transport efficiency and infotainment applications (e.g., electronic map download and Internet access have received more and more attention, and this kind of applications is expected to become a big market driver in a near future. In this paper, we propose an Efficient and QoS supported Multichannel Medium Access Control (EQM-MAC protocol for VANETs in a highway environment. The EQM-MAC protocol utilizes the service channel resources for non-safety message transmissions during the whole synchronization interval, and it dynamically adjusts minimum contention window size for different non-safety services according to the traffic conditions. Theoretical model analysis and extensive simulation results show that the EQM-MAC protocol can support QoS services, while ensuring the high saturation throughput and low transmission delay for non-safety applications.

  11. A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Huang Qiong

    2014-01-01

    Full Text Available Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

  12. Mobile Ad Hoc Networks in Bandwidth-Demanding Mission-Critical Applications: Practical Implementation Insights

    KAUST Repository

    Bader, Ahmed

    2016-09-28

    There has been recently a growing trend of using live video feeds in mission-critical applications. Real-time video streaming from front-end personnel or mobile agents is believed to substantially improve situational awareness in mission-critical operations such as disaster relief, law enforcement, and emergency response. Mobile Ad Hoc Networks (MANET) is a natural contender in such contexts. However, classical MANET routing schemes fall short in terms of scalability, bandwidth and latency; all three metrics being quite essential for mission-critical applications. As such, autonomous cooperative routing (ACR) has gained traction as the most viable MANET proposition. Nonetheless, ACR is also associated with a few implementation challenges. If they go unaddressed, will deem ACR practically useless. In this paper, efficient and low-complexity remedies to those issues are presented, analyzed, and validated. The validation is based on field experiments carried out using software-defined radio (SDR) platforms. Compared to classical MANET routing schemes, ACR was shown to offer up to 2X better throughput, more than 4X reduction in end-to-end latency, while observing a given target of transport rate normalized to energy consumption.

  13. Multiobjective Reinforcement Learning for Traffic Signal Control Using Vehicular Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    Houli Duan

    2010-01-01

    Full Text Available We propose a new multiobjective control algorithm based on reinforcement learning for urban traffic signal control, named multi-RL. A multiagent structure is used to describe the traffic system. A vehicular ad hoc network is used for the data exchange among agents. A reinforcement learning algorithm is applied to predict the overall value of the optimization objective given vehicles' states. The policy which minimizes the cumulative value of the optimization objective is regarded as the optimal one. In order to make the method adaptive to various traffic conditions, we also introduce a multiobjective control scheme in which the optimization objective is selected adaptively to real-time traffic states. The optimization objectives include the vehicle stops, the average waiting time, and the maximum queue length of the next intersection. In addition, we also accommodate a priority control to the buses and the emergency vehicles through our model. The simulation results indicated that our algorithm could perform more efficiently than traditional traffic light control methods.

  14. A Game Theory Algorithm for Intra-Cluster Data Aggregation in a Vehicular Ad Hoc Network.

    Science.gov (United States)

    Chen, Yuzhong; Weng, Shining; Guo, Wenzhong; Xiong, Naixue

    2016-02-19

    Vehicular ad hoc networks (VANETs) have an important role in urban management and planning. The effective integration of vehicle information in VANETs is critical to traffic analysis, large-scale vehicle route planning and intelligent transportation scheduling. However, given the limitations in the precision of the output information of a single sensor and the difficulty of information sharing among various sensors in a highly dynamic VANET, effectively performing data aggregation in VANETs remains a challenge. Moreover, current studies have mainly focused on data aggregation in large-scale environments but have rarely discussed the issue of intra-cluster data aggregation in VANETs. In this study, we propose a multi-player game theory algorithm for intra-cluster data aggregation in VANETs by analyzing the competitive and cooperative relationships among sensor nodes. Several sensor-centric metrics are proposed to measure the data redundancy and stability of a cluster. We then study the utility function to achieve efficient intra-cluster data aggregation by considering both data redundancy and cluster stability. In particular, we prove the existence of a unique Nash equilibrium in the game model, and conduct extensive experiments to validate the proposed algorithm. Results demonstrate that the proposed algorithm has advantages over typical data aggregation algorithms in both accuracy and efficiency.

  15. Minimizing Detection Probability Routing in Ad Hoc Networks Using Directional Antennas

    Directory of Open Access Journals (Sweden)

    Towsley Don

    2009-01-01

    Full Text Available In a hostile environment, it is important for a transmitter to make its wireless transmission invisible to adversaries because an adversary can detect the transmitter if the received power at its antennas is strong enough. This paper defines a detection probability model to compute the level of a transmitter being detected by a detection system at arbitrary location around the transmitter. Our study proves that the probability of detecting a directional antenna is much lower than that of detecting an omnidirectional antenna if both the directional and omnidirectional antennas provide the same Effective Isotropic Radiated Power (EIRP in the direction of the receiver. We propose a Minimizing Detection Probability (MinDP routing algorithm to find a secure routing path in ad hoc networks where nodes employ directional antennas to transmit data to decrease the probability of being detected by adversaries. Our study shows that the MinDP routing algorithm can reduce the total detection probability of deliveries from the source to the destination by over 74%.

  16. Precoding Design and Power Allocation in Two-User MU-MIMO Wireless Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Haole Chen

    2017-10-01

    Full Text Available In this paper, we consider the precoding design and power allocation problem for multi-user multiple-input multiple-output (MU-MIMO wireless ad hoc networks. In the first timeslot, the source node (SN transmits energy and information to a relay node (RN simultaneously within the simultaneous wireless information and power transfer (SWIPT framework. Then, in the second timeslot, based on the decoder and the forwarding (DF protocol, after reassembling the received signal and its own signal, the RN forwards the information to the main user (U1 and simultaneously sends its own information to the secondary user (U2. In this paper, when the transmission rate of the U1 is restricted, the precoding, beamforming, and power splitting (PS transmission ratio are jointly considered to maximize the transmission rate of U2. To maximize the system rate, we design an optimal beamforming matrix and solve the optimization problem by semi-definite relaxation (SDR, considering the high complexity of implementing the optimal solution. Two sub-optimal precoding programs are also discussed: singular value decomposition and block diagonalization. Finally, the performance of the optimization and sub-optimization schemes are compared using a simulation.

  17. Delay-dependent asymptotic stability of mobile ad-hoc networks: A descriptor system approach

    International Nuclear Information System (INIS)

    Yang Juan; Yang Dan; Zhang Xiao-Hong; Huang Bin; Luo Jian-Lu

    2014-01-01

    In order to analyze the capacity stability of the time-varying-propagation and delay-dependent of mobile ad-hoc networks (MANETs), in this paper, a novel approach is proposed to explore the capacity asymptotic stability for the delay-dependent of MANETs based on non-cooperative game theory, where the delay-dependent conditions are explicitly taken into consideration. This approach is based on the Lyapunov—Krasovskii stability theory for functional differential equations and the linear matrix inequality (LMI) technique. A corresponding Lyapunov—Krasovskii functional is introduced for the stability analysis of this system with use of the descriptor and “neutral-type” model transformation without producing any additional dynamics. The delay-dependent stability criteria are derived for this system. Conditions are given in terms of linear matrix inequalities, and for the first time referred to neutral systems with the time-varying propagation and delay-dependent stability for capacity analysis of MANETs. The proposed criteria are less conservative since they are based on an equivalent model transformation. Furthermore, we also provide an effective and efficient iterative algorithm to solve the constrained stability control model. Simulation experiments have verified the effectiveness and efficiency of our algorithm. (general)

  18. Cooperative ad hoc networks for energy and delay efficient content distribution with fast channel variations

    KAUST Repository

    Atat, Rachad

    2012-11-20

    Cooperative ad hoc networks for the efficient distribution of content of common interest are studied in the case of fast channel variations. Mobiles are grouped into cooperative clusters for the purpose of receiving the content with optimized energy efficiency. Data are sent to mobile terminals on a long range (LR) link, and then, the terminals exchange the content by using an appropriate short range wireless technology. When channel state information is available for the LR links, unicasting is used on the LR. When accurate channel state information is not available, threshold-based multicasting is implemented on the LR. Energy minimization is formulated as an optimization problem for each scenario, and the optimal solutions are determined in closed form in scenarios with fast channel variations. Results show significant energy savings in the proposed schemes compared with the noncooperative case and other previous related work. Furthermore, the energy minimizing solutions are shown to lead to reduced delay in the content distribution process. Practical implementation aspects of the proposed methods are also discussed. © 2012 John Wiley & Sons, Ltd.

  19. Cooperative ad hoc networks for energy and delay efficient content distribution with fast channel variations

    KAUST Repository

    Atat, Rachad; Yaacoub, Elias E.; Alouini, Mohamed-Slim; Abu-Dayya, Adnan A.

    2012-01-01

    Cooperative ad hoc networks for the efficient distribution of content of common interest are studied in the case of fast channel variations. Mobiles are grouped into cooperative clusters for the purpose of receiving the content with optimized energy efficiency. Data are sent to mobile terminals on a long range (LR) link, and then, the terminals exchange the content by using an appropriate short range wireless technology. When channel state information is available for the LR links, unicasting is used on the LR. When accurate channel state information is not available, threshold-based multicasting is implemented on the LR. Energy minimization is formulated as an optimization problem for each scenario, and the optimal solutions are determined in closed form in scenarios with fast channel variations. Results show significant energy savings in the proposed schemes compared with the noncooperative case and other previous related work. Furthermore, the energy minimizing solutions are shown to lead to reduced delay in the content distribution process. Practical implementation aspects of the proposed methods are also discussed. © 2012 John Wiley & Sons, Ltd.

  20. SVANET: A Smart Vehicular Ad Hoc Network for Efficient Data Transmission with Wireless Sensors

    Directory of Open Access Journals (Sweden)

    Prasan Kumar Sahoo

    2014-11-01

    Full Text Available Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency.

  1. SVANET: A smart vehicular ad hoc network for efficient data transmission with wireless sensors.

    Science.gov (United States)

    Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin

    2014-11-25

    Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET) architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency.

  2. A Game Theory Algorithm for Intra-Cluster Data Aggregation in a Vehicular Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    Yuzhong Chen

    2016-02-01

    Full Text Available Vehicular ad hoc networks (VANETs have an important role in urban management and planning. The effective integration of vehicle information in VANETs is critical to traffic analysis, large-scale vehicle route planning and intelligent transportation scheduling. However, given the limitations in the precision of the output information of a single sensor and the difficulty of information sharing among various sensors in a highly dynamic VANET, effectively performing data aggregation in VANETs remains a challenge. Moreover, current studies have mainly focused on data aggregation in large-scale environments but have rarely discussed the issue of intra-cluster data aggregation in VANETs. In this study, we propose a multi-player game theory algorithm for intra-cluster data aggregation in VANETs by analyzing the competitive and cooperative relationships among sensor nodes. Several sensor-centric metrics are proposed to measure the data redundancy and stability of a cluster. We then study the utility function to achieve efficient intra-cluster data aggregation by considering both data redundancy and cluster stability. In particular, we prove the existence of a unique Nash equilibrium in the game model, and conduct extensive experiments to validate the proposed algorithm. Results demonstrate that the proposed algorithm has advantages over typical data aggregation algorithms in both accuracy and efficiency.

  3. Ad-hoc Network of Smart Sensors for Mechanical Load Measurement

    Directory of Open Access Journals (Sweden)

    Manuel A. Vieira

    2016-07-01

    Full Text Available Strain gauges load cells are transducers devices capable of converting changes in applied mechanical load into an electrical analog signal. Those devices have a large spectrum of applications ranging from domestic to industrial or even medical appliances just to name a few. In this work, they are used in the electronic instrumentation of a force platform that will be used to carry out the analysis and characterization of human biomechanical walking. In this platform, four load cells are installed, each one capable of measuring forces along two different axis. A total of eight strain-gauges per load cell are employed. Hence, analog signal transmission, besides requiring a large number of connection wires, is prone to interference and noise. Moreover, with this solution, scalability requires severe changes in the connection topology. In order to circumvent those problems, an alternative in-situ signal conditioning and digital data transmission system was devised. This approach, as far as investigated, presents an innovative solution to signal conditioning and data transmission for load-cells. In particular, the presented solution allows the creation of an ad-hoc network of load cells, using the I²C protocol with a master interface that allows the users to interact and change the parameters of each load cell. This instrumentation structure has been successfully tested and the obtained results are documented in this article.

  4. Enhancing the selection of backoff interval using fuzzy logic over wireless Ad Hoc networks.

    Science.gov (United States)

    Ranganathan, Radha; Kannan, Kathiravan

    2015-01-01

    IEEE 802.11 is the de facto standard for medium access over wireless ad hoc network. The collision avoidance mechanism (i.e., random binary exponential backoff-BEB) of IEEE 802.11 DCF (distributed coordination function) is inefficient and unfair especially under heavy load. In the literature, many algorithms have been proposed to tune the contention window (CW) size. However, these algorithms make every node select its backoff interval between [0, CW] in a random and uniform manner. This randomness is incorporated to avoid collisions among the nodes. But this random backoff interval can change the optimal order and frequency of channel access among competing nodes which results in unfairness and increased delay. In this paper, we propose an algorithm that schedules the medium access in a fair and effective manner. This algorithm enhances IEEE 802.11 DCF with additional level of contention resolution that prioritizes the contending nodes according to its queue length and waiting time. Each node computes its unique backoff interval using fuzzy logic based on the input parameters collected from contending nodes through overhearing. We evaluate our algorithm against IEEE 802.11, GDCF (gentle distributed coordination function) protocols using ns-2.35 simulator and show that our algorithm achieves good performance.

  5. Cross-Layer Resource Allocation for Wireless Visual Sensor Networks and Mobile Ad Hoc Networks

    Science.gov (United States)

    2014-10-01

    are applied to video sequences in order to reduce the bit rate required for storage and/or transmission, while network congestion may result in packet...Wheatley, “On the capacity of a cellular CDMA system,” IEEE Transactions on Vehicular Technology, vol. 40, pp. 303–312, May 1991. [41] K. Pandremmenou

  6. Road Accident Prevention with Instant Emergency Warning Message Dissemination in Vehicular Ad-Hoc Network.

    Directory of Open Access Journals (Sweden)

    P Gokulakrishnan

    Full Text Available A Road Accident Prevention (RAP scheme based on Vehicular Backbone Network (VBN structure is proposed in this paper for Vehicular Ad-hoc Network (VANET. The RAP scheme attempts to prevent vehicles from highway road traffic accidents and thereby reduces death and injury rates. Once the possibility of an emergency situation (i.e. an accident is predicted in advance, instantly RAP initiates a highway road traffic accident prevention scheme. The RAP scheme constitutes the following activities: (i the Road Side Unit (RSU constructs a Prediction Report (PR based on the status of the vehicles and traffic in the highway roads, (ii the RSU generates an Emergency Warning Message (EWM based on an abnormal PR, (iii the RSU forms a VBN structure and (iv the RSU disseminates the EWM to the vehicles that holds the high Risk Factor (RF and travels in High Risk Zone (HRZ. These vehicles might reside either within the RSU's coverage area or outside RSU's coverage area (reached using VBN structure. The RAP scheme improves the performance of EWM dissemination in terms of increase in notification and decrease in end-to-end delay. The RAP scheme also reduces infrastructure cost (number of RSUs by formulating and deploying the VBN structure. The RAP scheme with VBN structure improves notification by 19 percent and end-to-end delay by 14.38 percent for a vehicle density of 160 vehicles. It is also proved from the simulation experiment that the performance of RAP scheme is promising in 4-lane highway roads.

  7. Decentralized Opportunistic Spectrum Resources Access Model and Algorithm toward Cooperative Ad-Hoc Networks

    Science.gov (United States)

    Liu, Ming; Xu, Yang; Mohammed, Abdul-Wahid

    2016-01-01

    Limited communication resources have gradually become a critical factor toward efficiency of decentralized large scale multi-agent coordination when both system scales up and tasks become more complex. In current researches, due to the agent’s limited communication and observational capability, an agent in a decentralized setting can only choose a part of channels to access, but cannot perceive or share global information. Each agent’s cooperative decision is based on the partial observation of the system state, and as such, uncertainty in the communication network is unavoidable. In this situation, it is a major challenge working out cooperative decision-making under uncertainty with only a partial observation of the environment. In this paper, we propose a decentralized approach that allows agents cooperatively search and independently choose channels. The key to our design is to build an up-to-date observation for each agent’s view so that a local decision model is achievable in a large scale team coordination. We simplify the Dec-POMDP model problem, and each agent can jointly work out its communication policy in order to improve its local decision utilities for the choice of communication resources. Finally, we discuss an implicate resource competition game, and show that, there exists an approximate resources access tradeoff balance between agents. Based on this discovery, the tradeoff between real-time decision-making and the efficiency of cooperation using these channels can be well improved. PMID:26727504

  8. Decentralized Opportunistic Spectrum Resources Access Model and Algorithm toward Cooperative Ad-Hoc Networks.

    Directory of Open Access Journals (Sweden)

    Ming Liu

    Full Text Available Limited communication resources have gradually become a critical factor toward efficiency of decentralized large scale multi-agent coordination when both system scales up and tasks become more complex. In current researches, due to the agent's limited communication and observational capability, an agent in a decentralized setting can only choose a part of channels to access, but cannot perceive or share global information. Each agent's cooperative decision is based on the partial observation of the system state, and as such, uncertainty in the communication network is unavoidable. In this situation, it is a major challenge working out cooperative decision-making under uncertainty with only a partial observation of the environment. In this paper, we propose a decentralized approach that allows agents cooperatively search and independently choose channels. The key to our design is to build an up-to-date observation for each agent's view so that a local decision model is achievable in a large scale team coordination. We simplify the Dec-POMDP model problem, and each agent can jointly work out its communication policy in order to improve its local decision utilities for the choice of communication resources. Finally, we discuss an implicate resource competition game, and show that, there exists an approximate resources access tradeoff balance between agents. Based on this discovery, the tradeoff between real-time decision-making and the efficiency of cooperation using these channels can be well improved.

  9. 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.

  10. 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.

  11. Rapid self-organised initiation of ad hoc sensor networks close above the percolation threshold

    Science.gov (United States)

    Korsnes, Reinert

    2010-07-01

    This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path tree spanning a weighted graph. This is a well-studied problem where for example Dijkstra’s algorithm provides a solution for non-negative edge weights. The present contribution shows by simulation examples that simple modifications of known distributed approaches here can provide significant improvements in performance. Phase transition phenomena, which are known to take place in networks close to percolation thresholds, may explain these observations. An initial method, which here serves as reference, assumes the sink node starts organisation of the network (tree) by transmitting a control message advertising its availability for its neighbours. These neighbours then advertise their current cost estimate for routing a message to the sink. A node which in this way receives a message implying an improved route to the sink, advertises its new finding and remembers which neighbouring node the message came from. This activity proceeds until there are no more improvements to advertise to neighbours. The result is a tree network for cost effective transmission of messages to the sink (root). This distributed approach has potential for simple improvements which are of interest when minimisation of storage and communication of network information are a concern. Fast organisation of the network takes place when the number k of connections for each node ( degree) is close above its critical value for global network percolation and at the same time there is a threshold for the nodes to decide to advertise network route updates.

  12. 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.

  13. 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.

  14. 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

  15. 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.

  16. 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.

  17. 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

  18. Communication Policies in Knowledge Networks

    Science.gov (United States)

    Ioannidis, Evangelos; Varsakelis, Nikos; Antoniou, Ioannis

    2018-02-01

    Faster knowledge attainment within organizations leads to improved innovation, and therefore competitive advantage. Interventions on the organizational network may be risky or costly or time-demanding. We investigate several communication policies in knowledge networks, which reduce the knowledge attainment time without interventions. We examine the resulting knowledge dynamics for real organizational networks, as well as for artificial networks. More specifically, we investigate the dependence of knowledge dynamics on: (1) the Selection Rule of agents for knowledge acquisition, and (2) the Order of implementation of "Selection" and "Filtering". Significant decrease of the knowledge attainment time (up to -74%) can be achieved by: (1) selecting agents of both high knowledge level and high knowledge transfer efficiency, and (2) implementing "Selection" after "Filtering" in contrast to the converse, implicitly assumed, conventional prioritization. The Non-Commutativity of "Selection" and "Filtering", reveals a Non-Boolean Logic of the Network Operations. The results demonstrate that significant improvement of knowledge dynamics can be achieved by implementing "fruitful" communication policies, by raising the awareness of agents, without any intervention on the network structure.

  19. Probabilistic monitoring in intrusion detection module for energy efficiency in mobile ad hoc networks

    Science.gov (United States)

    De Rango, Floriano; Lupia, Andrea

    2016-05-01

    MANETs allow mobile nodes communicating to each other using the wireless medium. A key aspect of these kind of networks is the security, because their setup is done without an infrastructure, so external nodes could interfere in the communication. Mobile nodes could be compromised, misbehaving during the multi-hop transmission of data, or they could have a selfish behavior to save energy, which is another important constraint in MANETs. The detection of these behaviors need a framework that takes into account the latest interactions among nodes, so malicious or selfish nodes could be detected also if their behavior is changed over time. The monitoring activity increases the energy consumption, so our proposal takes into account this issue reducing the energy required by the monitoring system, keeping the effectiveness of the intrusion detection system. The results show an improvement in the saved energy, improving the detection performance too.

  20. Communications for unattended sensor networks

    Science.gov (United States)

    Nemeroff, Jay L.; Angelini, Paul; Orpilla, Mont; Garcia, Luis; DiPierro, Stefano

    2004-07-01

    The future model of the US Army's Future Combat Systems (FCS) and the Future Force reflects a combat force that utilizes lighter armor protection than the current standard. Survival on the future battlefield will be increased by the use of advanced situational awareness provided by unattended tactical and urban sensors that detect, identify, and track enemy targets and threats. Successful implementation of these critical sensor fields requires the development of advanced sensors, sensor and data-fusion processors, and a specialized communications network. To ensure warfighter and asset survivability, the communications must be capable of near real-time dissemination of the sensor data using robust, secure, stealthy, and jam resistant links so that the proper and decisive action can be taken. Communications will be provided to a wide-array of mission-specific sensors that are capable of processing data from acoustic, magnetic, seismic, and/or Chemical, Biological, Radiological, and Nuclear (CBRN) sensors. Other, more powerful, sensor node configurations will be capable of fusing sensor data and intelligently collect and process data images from infrared or visual imaging cameras. The radio waveform and networking protocols being developed under the Soldier Level Integrated Communications Environment (SLICE) Soldier Radio Waveform (SRW) and the Networked Sensors for the Future Force Advanced Technology Demonstration are part of an effort to develop a common waveform family which will operate across multiple tactical domains including dismounted soldiers, ground sensor, munitions, missiles and robotics. These waveform technologies will ultimately be transitioned to the JTRS library, specifically the Cluster 5 requirement.

  1. Applied data communications and networks

    CERN Document Server

    Buchanan, W

    1996-01-01

    The usage of data communications and computer networks are ever in­ creasing. It is one of the few technological areas which brings benefits to most of the countries and the peoples of the world. Without it many industries could not exist. It is the objective of this book to discuss data communications in a readable form that students and professionals all over the world can understand. As much as possible the text uses dia­ grams to illustrate key points. Most currently available data communications books take their view­ point from either a computer scientists top-down approach or from an electronic engineers bottom-up approach. This book takes a practical ap­ proach and supports it with a theoretical background to create a textbook which can be used by electronic engineers, computer engineers, computer scientists and industry professionals. It discusses most of the current and future key data communications technologies, including: • Data Communications Standards and Models; • Local Area Networks (...

  2. Communications in interference limited networks

    CERN Document Server

    2016-01-01

    This book offers means to handle interference as a central problem of operating wireless networks. It investigates centralized and decentralized methods to avoid and handle interference as well as approaches that resolve interference constructively. The latter type of approach tries to solve the joint detection and estimation problem of several data streams that share a common medium. In fact, an exciting insight into the operation of networks is that it may be beneficial, in terms of an overall throughput, to actively create and manage interference. Thus, when handled properly, "mixing" of data in networks becomes a useful tool of operation rather than the nuisance as which it has been treated traditionally. With the development of mobile, robust, ubiquitous, reliable and instantaneous communication being a driving and enabling factor of an information centric economy, the understanding, mitigation and exploitation of interference in networks must be seen as a centrally important task.

  3. VSAT communications networks - An overview

    Science.gov (United States)

    Chakraborty, D.

    1988-05-01

    The very-small-aperture-terminal (VSAT) fixed satellite communication network is a star network in which many dispersed micro terminals attempt to send data in a packet form through a random access/time-division multiple-access (RA/TDMA) satellite channel with transmission delay. The basic concept of the VSAT and its service potential are discussed. Two classes of traffic are addressed, namely, business-oriented low-rate-data traffic and bulk data traffic of corporate networks. Satellite access, throughput, and delay are considered. The size of the network population that can be served in an RA/TDMA environment is calculated. User protocols are examined. A typical VSAT business scenario is described.

  4. Information communication on complex networks

    International Nuclear Information System (INIS)

    Igarashi, Akito; Kawamoto, Hiroki; Maruyama, Takahiro; Morioka, Atsushi; Naganuma, Yuki

    2013-01-01

    Since communication networks such as the Internet, which is regarded as a complex network, have recently become a huge scale and a lot of data pass through them, the improvement of packet routing strategies for transport is one of the most significant themes in the study of computer networks. It is especially important to find routing strategies which can bear as many traffic as possible without congestion in complex networks. First, using neural networks, we introduce a strategy for packet routing on complex networks, where path lengths and queue lengths in nodes are taken into account within a framework of statistical physics. Secondly, instead of using shortest paths, we propose efficient paths which avoid hubs, nodes with a great many degrees, on scale-free networks with a weight of each node. We improve the heuristic algorithm proposed by Danila et. al. which optimizes step by step routing properties on congestion by using the information of betweenness, the probability of paths passing through a node in all optimal paths which are defined according to a rule, and mitigates the congestion. We confirm the new heuristic algorithm which balances traffic on networks by achieving minimization of the maximum betweenness in much smaller number of iteration steps. Finally, We model virus spreading and data transfer on peer-to-peer (P2P) networks. Using mean-field approximation, we obtain an analytical formulation and emulate virus spreading on the network and compare the results with those of simulation. Moreover, we investigate the mitigation of information traffic congestion in the P2P networks.

  5. 1st International Workshop on Vehicular Ad-hoc Networks for Smart Cities

    CERN Document Server

    Qayyum, Amir; Saad, Mohamad

    2015-01-01

    Vehicular communication is a key technology in intelligent transportation systems. For many years now, the academic and industrial research communities have been investigating these communications in order to improve efficiency and safety of future transportation. Vehicular networking offers a wide variety of applications, including safety applications as well as infotainment applications. This book highlights the recent developments in vehicular networking technologies and their interaction with future smart cities in order to promote further research activities and challenges. SAADI BOUDJIT, University of Paris 13, France  HAKIMA CHAOUCHI, Telecom SudParis, France  YACINE GHAMRI, University La Rochelle, France HALABI HASBULLAH, Universiti Teknologi Petronas, Malaysia ANIS LAOUITI, Telecom SudParis, France  SAOUCENE MAHFOUDH, Jeddah, Saudi Arabia  PAUL MUHLETHALER, INRIA, France AMIR QAYYUM, Mohamad Ali Jinnah University, Pakistan NAUFAL SAAD, Universiti Teknologi�...

  6. Cognitive Self-Scheduled Mechanism for Access Control in Noisy Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Mario Manzano

    2015-01-01

    Full Text Available Within the challenging environment of intelligent transportation systems (ITS, networked control systems such as platooning guidance of autonomous vehicles require innovative mechanisms to provide real-time communications. Although several proposals are currently under discussion, the design of a rapid, efficient, flexible, and reliable medium access control mechanism which meets the specific constraints of such real-time communications applications remains unsolved in this highly dynamic environment. However, cognitive radio (CR combines the capacity to sense the radio spectrum with the flexibility to adapt to transmission parameters in order to maximize system performance and has thus become an effective approach for the design of dynamic spectrum access (DSA mechanisms. This paper presents the enhanced noncooperative cognitive division multiple access (ENCCMA proposal combining time division multiple access (TDMA and frequency division multiple access (FDMA schemes with CR techniques to obtain a mechanism fulfilling the requirements of real-time communications. The analysis presented here considers the IEEE WAVE and 802.11p as reference standards; however, the proposed medium access control (MAC mechanism can be adapted to operate on the physical layer of different standards. The mechanism also offers the advantage of avoiding signaling, thus enhancing system autonomy as well as behavior in adverse scenarios.

  7. 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.

  8. 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.

  9. 移动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.

  10. RAILWAY INFRASTRUCTURE CAPACITY MANAGEMENT FOR AD-HOC TRAINS ON THE SŽDC NETWORK

    Directory of Open Access Journals (Sweden)

    Petr Nachtigall

    2016-09-01

    Full Text Available The paper describes basic principles of ad-hoc routes assignment. Each carrier has its own interface called information system KADR with SŽDC for capacity requests management. The paper describes all steps which must be done before train departure.

  11. MUSIC algorithm DoA estimation for cooperative node location in mobile ad hoc networks

    Science.gov (United States)

    Warty, Chirag; Yu, Richard Wai; ElMahgoub, Khaled; Spinsante, Susanna

    In recent years the technological development has encouraged several applications based on distributed communications network without any fixed infrastructure. The problem of providing a collaborative early warning system for multiple mobile nodes against a fast moving object. The solution is provided subject to system level constraints: motion of nodes, antenna sensitivity and Doppler effect at 2.4 GHz and 5.8 GHz. This approach consists of three stages. The first phase consists of detecting the incoming object using a highly directive two element antenna at 5.0 GHz band. The second phase consists of broadcasting the warning message using a low directivity broad antenna beam using 2× 2 antenna array which then in third phase will be detected by receiving nodes by using direction of arrival (DOA) estimation technique. The DOA estimation technique is used to estimate the range and bearing of the incoming nodes. The position of fast arriving object can be estimated using the MUSIC algorithm for warning beam DOA estimation. This paper is mainly intended to demonstrate the feasibility of early detection and warning system using a collaborative node to node communication links. The simulation is performed to show the behavior of detecting and broadcasting antennas as well as performance of the detection algorithm. The idea can be further expanded to implement commercial grade detection and warning system

  12. 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.

  13. Vehicular ad hoc networks: From simulations to real-life scenarios

    African Journals Online (AJOL)

    pc

    2018-03-05

    Mar 5, 2018 ... Indeed, the introduction of new technologies and communication ... D2D communication technology to allow cars to communicate with each other, as well .... need for driver intervention will be adopted in 2019 [20]. Ultrasonic ...

  14. 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

  15. Optimal JPWL Forward Error Correction Rate Allocation for Robust JPEG 2000 Images and Video Streaming over Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Benoit Macq

    2008-07-01

    Full Text Available Based on the analysis of real mobile ad hoc network (MANET traces, we derive in this paper an optimal wireless JPEG 2000 compliant forward error correction (FEC rate allocation scheme for a robust streaming of images and videos over MANET. The packet-based proposed scheme has a low complexity and is compliant to JPWL, the 11th part of the JPEG 2000 standard. The effectiveness of the proposed method is evaluated using a wireless Motion JPEG 2000 client/server application; and the ability of the optimal scheme to guarantee quality of service (QoS to wireless clients is demonstrated.

  16. 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...

  17. PERFORMANCE OF OPPORTUNISTIC SPECTRUM ACCESS WITH SENSING ERROR IN COGNITIVE RADIO AD HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    N. ARMI

    2012-04-01

    Full Text Available Sensing in opportunistic spectrum access (OSA has a responsibility to detect the available channel by performing binary hypothesis as busy or idle states. If channel is busy, secondary user (SU cannot access and refrain from data transmission. SU is allowed to access when primary user (PU does not use it (idle states. However, channel is sensed on imperfect communication link. Fading, noise and any obstacles existed can cause sensing errors in PU signal detection. False alarm detects idle states as a busy channel while miss-identification detects busy states as an idle channel. False detection makes SU refrain from transmission and reduces number of bits transmitted. On the other hand, miss-identification causes SU collide to PU transmission. This paper study the performance of OSA based on the greedy approach with sensing errors by the restriction of maximum collision probability allowed (collision threshold by PU network. The throughput of SU and spectrum capacity metric is used to evaluate OSA performance and make comparisons to those ones without sensing error as function of number of slot based on the greedy approach. The relations between throughput and signal to noise ratio (SNR with different collision probability as well as false detection with different SNR are presented. According to the obtained results show that CR users can gain the reward from the previous slot for both of with and without sensing errors. It is indicated by the throughput improvement as slot number increases. However, sensing on imperfect channel with sensing errors can degrade the throughput performance. Subsequently, the throughput of SU and spectrum capacity improves by increasing maximum collision probability allowed by PU network as well. Due to frequent collision with PU, the throughput of SU and spectrum capacity decreases at certain value of collision threshold. Computer simulation is used to evaluate and validate these works.

  18. Ultra-Wideband Impulse Radio for Tactical Ad-Hoc Military Communications

    Science.gov (United States)

    2010-09-02

    21], [23]. Rather than using simulations to show the bit-error- probability ( BEP ) performance with MAI as found in [14] and [15], we incorporate...the power 4 delay profile (PDP) of the channel, inspired by the work in [13], to derive the variance of the MAI, enabling theoretical BEP analysis. Our...an upper bound on the BEP , the number of equal-power users that the system can support is evaluated for different modulation order M. The network

  19. The network communication of BEPC control system

    International Nuclear Information System (INIS)

    Xu Jingwei

    1997-01-01

    The author introduces the application of network communication of BEPC control system. The authors use non-transparent communication to transfer the data and command information from node VAX750 to VAX4500

  20. 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

  1. 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

  2. 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.

  3. 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.

  4. Social networks: communication and change

    Directory of Open Access Journals (Sweden)

    Gustavo Cardoso

    2011-01-01

    Full Text Available Virtual social networks have brought about the possibility for open and plural debate, where all those with the necessary literacy skills and means are able to participate in the creation and dissemination of information. By pressing political agents and determining the “agenda” of a lot of the media, users demonstrate that we stand at an ideal platform for creating both real social movements and more or less fleeting events, as manifestos or virtual campaigns. Nonetheless, in order to understand the role of virtual social networks in today’s world, we need to answer some prior questions. Are we facing a new communication model, whereby the product of “disinterested” interactivity creates an aura of confidence in disseminated information, often quite higher that that seen in the “old media”? Will that interactivity be a chance to fight-off citizens’ growing detachment with regard to the “res publica”? Will we find in citizen-made journalism, transmitted through virtual social networks, the consecration of a true fourth power? On the other hand, can we call the distinct collective movements we have seen emerging true “social movements”?The present article aims to examine this and other issues that come to the fore in the intricate social world of cyberspace.

  5. Reputation-Based Internet Protocol Security: A Multilayer Security Framework for Mobile Ad Hoc Networks

    Science.gov (United States)

    2010-09-01

    motivated research in behavior grading systems [56]. Peer-to-peer eCommerce appli- cations such as eBay, Amazon, uBid, and Yahoo have performed research that...Security in Mobile Ad Hoc Networks”. IEEE Security & Privacy , 72–75, 2008. 15. Chakeres, ID and EM Belding-Royer. “AODV Routing Protocol Implementa...Detection System”. Proceedings of IEEE Computer Society Symposium on Research in Security and Privacy , 240–250. 1992. 21. Devore, J.L. and N.R. Farnum

  6. 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.

  7. Next generation satellite communications networks

    Science.gov (United States)

    Garland, P. J.; Osborne, F. J.; Streibl, I.

    The paper introduces two potential uses for new space hardware to permit enhanced levels of signal handling and switching in satellite communication service for Canada. One application involves increased private-sector services in the Ku band; the second supports new personal/mobile services by employing higher levels of handling and switching in the Ka band. First-generation satellite regeneration and switching experiments involving the NASA/ACTS spacecraft are described, where the Ka band and switching satellite network problems are emphasized. Second-generation satellite development is outlined based on demand trends for more packet-based switching, low-cost earth stations, and closed user groups. A demonstration mission for new Ka- and Ku-band technologies is proposed, including the payload configuration. The half ANIK E payload is shown to meet the demonstration objectives, and projected to maintain a fully operational payload for at least 10 years.

  8. 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.

  9. Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chih-Yu Wen

    2009-05-01

    Full Text Available This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.

  10. Dynamic hierarchical sleep scheduling for wireless ad-hoc sensor networks.

    Science.gov (United States)

    Wen, Chih-Yu; Chen, Ying-Chih

    2009-01-01

    This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.

  11. Preventing Wormhole Attacks on Wireless Ad Hoc Networks: A Graph Theoretic Approach

    National Research Council Canada - National Science Library

    Lazos, L; Poovendran, Radha; Meadows, C; Syverson, P; Chang, L. W

    2005-01-01

    We study the problem of characterizing the wormhole attack, an attack that can be mounted on a wide range of wireless network protocols without compromising any cryptographic quantity or network node...

  12. Distributed wireless quantum communication networks

    International Nuclear Information System (INIS)

    Yu Xu-Tao; Xu Jin; Zhang Zai-Chen

    2013-01-01

    The distributed wireless quantum communication network (DWQCN) has a distributed network topology and transmits information by quantum states. In this paper, we present the concept of the DWQCN and propose a system scheme to transfer quantum states in the DWQCN. The system scheme for transmitting information between any two nodes in the DWQCN includes a routing protocol and a scheme for transferring quantum states. The routing protocol is on-demand and the routing metric is selected based on the number of entangled particle pairs. After setting up a route, quantum teleportation and entanglement swapping are used for transferring quantum states. Entanglement swapping is achieved along with the process of routing set up and the acknowledgment packet transmission. The measurement results of each entanglement swapping are piggybacked with route reply packets or acknowledgment packets. After entanglement swapping, a direct quantum link between source and destination is set up and quantum states are transferred by quantum teleportation. Adopting this scheme, the measurement results of entanglement swapping do not need to be transmitted specially, which decreases the wireless transmission cost and transmission delay. (general)

  13. A Comparative Study of Novel Opportunistic Routing Protocols in Mobile Ad Hoc Networks

    OpenAIRE

    R. Poonkuzhali; M. Y. Sanavullah; M. R. Gurupriya

    2014-01-01

    Opportunistic routing is used, where the network has the features like dynamic topology changes and intermittent network connectivity. In Delay tolerant network or Disruption tolerant network opportunistic forwarding technique is widely used. The key idea of opportunistic routing is selecting forwarding nodes to forward data packets and coordination among these nodes to avoid duplicate transmissions. This paper gives the analysis of pros and cons of various opportunistic ...

  14. Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

    OpenAIRE

    Chih-Yu Wen; Ying-Chih Chen

    2009-01-01

    This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show t...

  15. 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 ...

  16. Improved AODV route recovery in mobile ad-hoc networks using a genetic algorithm

    Directory of Open Access Journals (Sweden)

    Ahmad Maleki

    2014-09-01

    Full Text Available An important issue in ad-hoc on-demand distance vector (AODV routing protocols is route failure caused by node mobility in the MANETs. The AODV requires a new route discovery procedure whenever a route breaks and these frequent route discoveries increase transmission delays and routing overhead. The present study proposes a new method for AODVs using a genetic algorithm to improve the route recovery mechanism. When failure occurs in a route, the proposed method (GAAODV makes decisions regarding the QOS parameter to select source or local repair. The task of the genetic algorithm is to find an appropriate combination of weights to optimize end-to-end delay. This paper evaluates the metrics of routing overhead, average end-to-end delay, and packet delivery ratio. Comparison of the new algorithm and AODV (RFC 3561 using a NS-2 simulator shows that GAAODV obtains better results for the QOS parameters.

  17. 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....

  18. Agricultural informational flow in informal communication networks ...

    African Journals Online (AJOL)

    Agricultural informational flow in informal communication networks of farmers in Ghana. ... should identify such farmers who can serve as intermediaries between actors to help disseminate information in rural communities. Keywords: key communicators, farmers, rural communities, social networks, extension agents ...

  19. Collaborative communication protocols for wireless sensor networks

    NARCIS (Netherlands)

    Dulman, S.O.; van Hoesel, L.F.W.; Nieberg, T.; Havinga, Paul J.M.

    In this document, the design of communication within a wireless sensor network is discussed. The resource limitations of such a network, especially in terms of energy, require an integrated approach for all (traditional) layers of communication. We present such an integrated, collaborative approach

  20. Network Communication for Low Level RF Control

    International Nuclear Information System (INIS)

    Liu Weiqing; Yin Chengke; Zhang Tongxuan; Fu Zechuan; Liu Jianfei

    2009-01-01

    Low Level RF (LLRF) control system for storage ring of Shanghai Synchrotron Radiation Facility (SSRF) has been built by digital technology. The settings of parameters and the feedback loop status are carried out through the network communication interface, and the local oscillation and clock, which is the important component of the digital LLRF control system, are also configured through network communication. NIOS II processor was employed as a core to build the embedded system with a real-time operating system MicroC/OS-II, finally Lightweight TCP/IP (LwIP) was used to achieve the communication interface. The communication network is stable after a long-term operation. (authors)

  1. Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Sunil Kumar

    2013-01-01

    Full Text Available Node mobility in mobile ad hoc networks (MANETs causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU, for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI for discovery of reliable routes; (ii a local path update mechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii a keep alive mechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv a packet salvaging scheme to improve packet delivery in the event of a route breakage; and (v low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.

  2. 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

  3. A Novel Architecture for Intrusion Detection in Mobile Ad hoc Network

    OpenAIRE

    Atul Patel; Ruchi Kansara; Dr. Paresh Virparia

    2011-01-01

    Today’s wireless networks are vulnerable in many ways including illegal use, unauthorized access, denial of service attacks, eavesdropping so called war chalking. These problems are one of the main issues for wider uses of wireless network. On wired network intruder can access by wire but in wireless it has possibilities to access the computer anywhere in neighborhood. However, securing MANETs is highly challenging issue due to their inherent characteristics. Intrusion detection is an importa...

  4. Energy generation for an ad hoc wireless sensor network-based monitoring system using animal head movement

    DEFF Research Database (Denmark)

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

    2011-01-01

    are not easily accessible. Therefore, exploring novel sources of energy generation rather than operating electronics only on limited power supplies such as batteries is a major challenge. Monitoring free-ranging animal behavior is an application in which the entities (animals) within the MANET are not readily...... that the amount of energy generated by the vertical neck–head movement of sheep during grazing can be converted to useful electrical power adequate to provide power for operation of wireless sensor nodes on a continuous basis within a MANET-based animal behavior monitoring system.......The supply of energy to electronics is an imperative constraining factor to be considered during the design process of mobile ad hoc wireless sensor networks (MANETs). This influence is especially important when the MANET is deployed unattended or the wireless modules within the MANET...

  5. Real-Time Support on IEEE 802.11 Wireless Ad-Hoc Networks: Reality vs. Theory

    Science.gov (United States)

    Kang, Mikyung; Kang, Dong-In; Suh, Jinwoo

    The usable throughput of an IEEE 802.11 system for an application is much less than the raw bandwidth. Although 802.11b has a theoretical maximum of 11Mbps, more than half of the bandwidth is consumed by overhead leaving at most 5Mbps of usable bandwidth. Considering this characteristic, this paper proposes and analyzes a real-time distributed scheduling scheme based on the existing IEEE 802.11 wireless ad-hoc networks, using USC/ISI's Power Aware Sensing Tracking and Analysis (PASTA) hardware platform. We compared the distributed real-time scheduling scheme with the real-time polling scheme to meet deadline, and compared a measured real bandwidth with a theoretical result. The theoretical and experimental results show that the distributed scheduling scheme can guarantee real-time traffic and enhances the performance up to 74% compared with polling scheme.

  6. 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.

  7. An efficient and reliable multi-hop geographical broadcast protocol in vehicular ad-hoc networks

    NARCIS (Netherlands)

    Rajendran, R.; Jongh, J. de

    2013-01-01

    In Intelligent Transportation Systems (ITS), disseminating warning messages in a timely and efficient way through wireless short-range communications can save many lives and reduce traffic congestion. A geographical broadcast protocol provides data delivery to specified geographical areas, using

  8. Applications of Coding in Network Communications

    Science.gov (United States)

    Chang, Christopher SungWook

    2012-01-01

    This thesis uses the tool of network coding to investigate fast peer-to-peer file distribution, anonymous communication, robust network construction under uncertainty, and prioritized transmission. In a peer-to-peer file distribution system, we use a linear optimization approach to show that the network coding framework significantly simplifies…

  9. Communication on the structure of biological networks

    Indian Academy of Sciences (India)

    Networks are widely used to represent interaction pattern among the components in complex systems. Structures of real networks from different domains may vary quite significantly. As there is an interplay between network architecture and dynamics, structure plays an important role in communication and spreading of ...

  10. Corporate Communication in the Network Economy

    DEFF Research Database (Denmark)

    Foss, Nicolai Juul; Kristensen, Tore; Wilke, Ricky

    This paper draws on ideas in economics and game theory to develop a new theory of marketing and corporate communication in the emerging network economy. We argue that in a network economy, firms and consumers will confront `coordination problems.' With the emerging network economy all this become...

  11. An Integrated Multi-layer Approach for Seamless Soft Handoff in Mobile Ad Hoc Networks

    Science.gov (United States)

    2011-01-01

    network to showcase how to leverage the IEEE 802.21 Media Independent Handover ( MIH ) framework [3] in our handoff solution. Moreover, to further...to the seamless handoff problem. The architecture leverages the IEEE 802.21 MIH standard to facilitate handover related decisions on multiple...provided by the MIH function (MIHF), the topology control manager dynamically activates/deactivates the wireless interfaces to ensure the network is

  12. Design and implementation of Ad-Hoc collaborative proxying scheme for reducing network energy waste

    Directory of Open Access Journals (Sweden)

    Rafiullah Khan

    2017-05-01

    Full Text Available Network devices are equipped with low power states but they are rarely activated due to their inability of maintaining network connectivity. Recently, Network Connectivity Proxy (NCP concept has been proposed in literature as an effective mechanism to exploit full potential of low power features on network devices by impersonating their virtual presence. However, the NCP concept faces several open issues and challenges especially related to proxying of TCP connections and majority of daily used proprietary closed-source applications. This paper presents a new approach for reducing network energy waste through intelligent collaboration among daily used devices (e.g., desktop computers, laptops, tablets, smartphones, etc. It guarantees to run applications on only and only one user device that is under active use at that specific moment. To reduce energy waste and allow idle devices to sleep, our approach also takes benefit from a light-weight home gateway proxy with very basic practically realizable functionalities. The proposed system not just reduces energy waste of fixed devices but also enables mobile devices to significantly improve their battery life. Our developed software prototypes allow devices to autonomously and seamlessly collaborate with each other without requiring any configuration or user input. Further, this paper also presents the basic performance evaluation of developed prototypes in real networking environments.

  13. Efficient Networks Communication Routing Using Swarm Intelligence

    OpenAIRE

    Koushal Kumar

    2012-01-01

    As demonstrated by natural biological swarm’s collective intelligence has an abundance of desirable properties for problem-solving like in network routing. The focus of this paper is in the applications of swarm based intelligence in information routing for communication networks. As we know networks are growing and adopting new platforms as new technologies comes. Also according to new demands and requirements networks topologies and its complexity is increasing with time. Thus it is becomin...

  14. The handbook of optical communication networks

    CERN Document Server

    Ilyas, Mohammad

    2003-01-01

    The Handbook of Optical Communication Networks presents comprehensive, up-to-date technical information on integrated, state-of-the-art optical networks. Beginning with an in-depth intoduction to the field, top international authorities explore every major aspect of optical networks, from basic concepts to research grade material. Their discussions cover all of the essential topics, including protocols, resource management, routing and wavelength assignment in WDM networks, connection management, survivability, enabling technologies, and future trends.

  15. 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.

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

    KAUST Repository

    Ansari, Imran Shafique

    2009-01-01

    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

  17. Reliable Routing Protocols for Dynamic Wireless Ad Hoc and Sensor Networks

    NARCIS (Netherlands)

    Wu Jian, W.J.

    2007-01-01

    The vision of ubiquitous computing requires the development of devices and technologies, which can be pervasive without being intrusive. The basic components of such a smart environment will be small nodes with sensing and wireless communications capabilities, able to organize flexibly into a

  18. Information Potential Fields Navigation in Wireless Ad-Hoc Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yong Qi

    2011-05-01

    Full Text Available As wireless sensor networks (WSNs are increasingly being deployed in some important applications, it becomes imperative that we consider application requirements in in-network processes. We intend to use a WSN to aid information querying and navigation within a dynamic and real-time environment. We propose a novel method that relies on the heat diffusion equation to finish the navigation process conveniently and easily. From the perspective of theoretical analysis, our proposed work holds the lower constraint condition. We use multiple scales to reach the goal of accurate navigation. We present a multi-scale gradient descent method to satisfy users’ requirements in WSNs. Formula derivations and simulations show that the method is accurately and efficiently able to solve typical sensor network configuration information navigation problems. Simultaneously, the structure of heat diffusion equation allows more flexibility and adaptability in searching algorithm designs.

  19. Optimizing Neighbor Discovery for Ad hoc Networks based on the Bluetooth PAN Profile

    DEFF Research Database (Denmark)

    Kuijpers, Gerben; Nielsen, Thomas Toftegaard; Prasad, Ramjee

    2002-01-01

    IP layer neighbor discovery mechanisms rely highly on broadcast/multicast capabilities of the underlying link layer. The Bluetooth personal area network (PAN) profile has no native link layer broadcast/multicast capabilities and can only emulate this by repeatedly unicast link layer frames....... This paper introduces a neighbor discovery mechanism that utilizes the resources in the Bluetooth PAN profile more efficient. The performance of the new mechanism is investigated using a IPv6 network simulator and compared with emulated broadcasting. It is shown that the signaling overhead can...

  20. 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

  1. A secure and lightweight ad-hoc routing algorithm for personal networks

    NARCIS (Netherlands)

    Jehangir, A.; Heemstra de Groot, S.M.

    2005-01-01

    Over the past few years, there has been increasing interest in utilizing Personal Area Networks (PANs) to offer users innovative and personalized services. This interest is a consequence of the widespread use of mobile devices such as laptops, mobile phones, PDAs, digital cameras, wireless headsets,

  2. Local, distributed topology control for large-scale wireless ad-hoc networks

    NARCIS (Netherlands)

    Nieberg, T.; Hurink, Johann L.

    In this document, topology control of a large-scale, wireless network by a distributed algorithm that uses only locally available information is presented. Topology control algorithms adjust the transmission power of wireless nodes to create a desired topology. The algorithm, named local power

  3. 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.

  4. Ad-Hoc Sensor Networks for Maritime Interdiction Operations and Regional Security

    Science.gov (United States)

    2012-09-01

    include constraining or denying of supplies or other trading privileges, and even the liberty of moving people out of a particular area. The...line every day. This leads to flexibility and performance and cost trade -offs. Furthermore, the continuous evolution of both communication and...Ranger7 Data Sheet,” Calzoni Marine Handling and Lighting Solutions, Bologna, Italy, May 2009. [48] “ Intergrator UAV Specification Sheet,” Insitu

  5. Optimization and Control of Communication Networks

    OpenAIRE

    Chiang, Mung; Low, Steven

    2005-01-01

    Recently, there has been a surge in research activities that utilize the power of recent developments in nonlinear optimization to tackle a wide scope of work in the analysis and design of communication systems, touching every layer of the layered network architecture, and resulting in both intellectual and practical impacts significantly beyond the earlier frameworks. These research activities are driven by both new demands in the areas of communications and networking, and n...

  6. Jana: Confidential Communications on Social Networks

    Science.gov (United States)

    2017-08-09

    consuming phone resources and privacy leakage ?” We address this challenge via an extensive user study. Next, we ask “How can we detect background apps...not support secret group communications. Furthermore, access to such social networks via mobile platforms raises a series of concerns like leakage of...not support secret group communications. Furthermore, access to such social networks via mobile platforms raises a series of concerns like leakage of

  7. Scalable Mobile Ad Hoc Network (MANET) to Enhance Situational Awareness in Distributed Small Unit Operations

    Science.gov (United States)

    2015-06-01

    computing the algorithm is written in Python, a simple terminal programming language. At the top of that script was the integration to ROS and the rest of...etError    (1) where the refresh frequency is represented by Network in units of Hz and the angular speed of the Marine’s sweep rate...starts with: Java , C++, Python, and more. There are literally thousands if not hundreds of thousands, of projects, platforms, sensors, actuators

  8. Beamspace Multiple Input Multiple Output. Part II: Steerable Antennas in Mobile Ad Hoc Networks

    Science.gov (United States)

    2016-09-01

    to the transmitter with half the channel transfer function power , since the actual receiver dwells on each channel only half the time. Fourth diagram...steering in a wireless network to maximize signal power and minimize interference [8–10]. The ability to switch beams adds another diversity dimension to...channel transfer function power , since the actual receiver dwells on each channel only half the time. Fourth diagram: The transmit array sends four

  9. Trust Threshold Based Public Key Management in Mobile Ad Hoc Networks

    Science.gov (United States)

    2016-03-05

    detection 49 [6,7] , authentication, access control, key management, iso- 50 lating misbehaving nodes for effective routing [6,8,9] , and 51 many other...83 84 85 aims to achieve: (a) resiliency against misbehaving nodes 86 in the network to maintain minimum security vulnerabil- 87 ity; (b...neighbor will decreas the misbehaving node’s direct competence trust. Fur thermore, this neighbor when acting as a recommended public key management in

  10. Cross Layer PHY-MAC Protocol for Wireless Static and Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Chris Blondia

    2008-11-01

    Full Text Available Multihop mobile wireless networks have drawn a lot of attention in recent years thanks to their wide applicability in civil and military environments. Since the existing IEEE 802.11 distributed coordination function (DCF standard does not provide satisfactory access to the wireless medium in multihop mobile networks, we have designed a cross-layer protocol, (CroSs-layer noise aware power driven MAC (SNAPdMac, which consists of two parts. The protocol first concentrates on the flexible adjustment of the upper and lower bounds of the contention window (CW to lower the number of collisions. In addition, it uses a power control scheme, triggered by the medium access control (MAC layer, to limit the waste of energy and also to decrease the number of collisions. Thanks to a noticeable energy conservation and decrease of the number of collisions, it prolongs significantly the lifetime of the network and delays the death of the first node while increasing both the throughput performance and the sending bit rate/throughput fairness among contending flows.

  11. Solving data-at-rest for the storage and retrieval of files in ad hoc networks

    Science.gov (United States)

    Knobler, Ron; Scheffel, Peter; Williams, Jonathan; Gaj, Kris; Kaps, Jens-Peter

    2013-05-01

    Based on current trends for both military and commercial applications, the use of mobile devices (e.g. smartphones and tablets) is greatly increasing. Several military applications consist of secure peer to peer file sharing without a centralized authority. For these military applications, if one or more of these mobile devices are lost or compromised, sensitive files can be compromised by adversaries, since COTS devices and operating systems are used. Complete system files cannot be stored on a device, since after compromising a device, an adversary can attack the data at rest, and eventually obtain the original file. Also after a device is compromised, the existing peer to peer system devices must still be able to access all system files. McQ has teamed with the Cryptographic Engineering Research Group at George Mason University to develop a custom distributed file sharing system to provide a complete solution to the data at rest problem for resource constrained embedded systems and mobile devices. This innovative approach scales very well to a large number of network devices, without a single point of failure. We have implemented the approach on representative mobile devices as well as developed an extensive system simulator to benchmark expected system performance based on detailed modeling of the network/radio characteristics, CONOPS, and secure distributed file system functionality. The simulator is highly customizable for the purpose of determining expected system performance for other network topologies and CONOPS.

  12. 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.

  13. 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.

  14. 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

  15. Predicting Employee Turnover from Communication Networks.

    Science.gov (United States)

    Feeley, Thomas H.; Barnett, George A.

    1997-01-01

    Investigates three social network models of employee turnover: a structural equivalence model, a social influence model, and an erosion model. Administers a communication network questionnaire to all 170 employees of an organization. Finds support for all three models of turnover, with the erosion model explaining more of the variance than do the…

  16. Computer networks and advanced communications

    International Nuclear Information System (INIS)

    Koederitz, W.L.; Macon, B.S.

    1992-01-01

    One of the major methods for getting the most productivity and benefits from computer usage is networking. However, for those who are contemplating a change from stand-alone computers to a network system, the investigation of actual networks in use presents a paradox: network systems can be highly productive and beneficial; at the same time, these networks can create many complex, frustrating problems. The issue becomes a question of whether the benefits of networking are worth the extra effort and cost. In response to this issue, the authors review in this paper the implementation and management of an actual network in the LSU Petroleum Engineering Department. The network, which has been in operation for four years, is large and diverse (50 computers, 2 sites, PC's, UNIX RISC workstations, etc.). The benefits, costs, and method of operation of this network will be described, and an effort will be made to objectively weigh these elements from the point of view of the average computer user

  17. Evolutionary dynamics of complex communications networks

    CERN Document Server

    Karyotis, Vasileios; Papavassiliou, Symeon

    2013-01-01

    Until recently, most network design techniques employed a bottom-up approach with lower protocol layer mechanisms affecting the development of higher ones. This approach, however, has not yielded fascinating results in the case of wireless distributed networks. Addressing the emerging aspects of modern network analysis and design, Evolutionary Dynamics of Complex Communications Networks introduces and develops a top-bottom approach where elements of the higher layer can be exploited in modifying the lowest physical topology-closing the network design loop in an evolutionary fashion similar to

  18. 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.

  19. COMMUNICATION MANAGEMENT CRISIS IN SOCIAL NETWORKS

    OpenAIRE

    Ana Mª Enrique Jiménez

    2013-01-01

    It is often in the social networks where you detect the first signs of a potential crisis situation. Today, many companies decide to be present in social networks to communicate, listen and respond to their audiences openly with immediacy. A simple complaint is visible and propagates through the network in seconds, being capable of generating a negative impact on the corporate image of the organization. The same can happen to the contrary, ie, to praise the performance of a company, which may...

  20. Fairness in Communication and Computer Network Design

    OpenAIRE

    Nilsson, Pål

    2006-01-01

    In communication networks, fair sharing of resources is an important issue for one main reason. The growth of network capacity is in general not matching the rapid growth of traffic. Consequently, the resources consumed by each user have to be limited. This implies that users cannot always be assigned the end-to-end bandwidth they ask for. Instead, the limited network resources should be distributed to users in a way that assures fair end-to-end bandwidth assignment among them. Obtaini...

  1. Crosstalk in WDM communication networks

    NARCIS (Netherlands)

    Tafur Monroy, I.; Tangdiongga, E.

    2002-01-01

    The use of advanced transmission and switching techniques such as reconfigurable WDM optical crossconnects is enabling high capacity and flexible optical networking at ultra bit-rates reaching multi-terabits per second. These techniques also offer creative ways to improve the network connectivity

  2. Future networks and technologies supporting innovative communications

    DEFF Research Database (Denmark)

    Prasad, Ramjee

    2012-01-01

    -communications (WISDOM) that combines the aspects of personal- and cognitive radio- networks to let seamlessly bridge the virtual and physical worlds offering a constant level of all-senses, context-based, rich communication experience over fixed and wireless networks for the end users while realizing a new generation......Within a fully interconnected world, the distinct relationship between end users, consumers and providers rapidly changes towards a scenario of collaboration and competition of multiple parties within one system. ‘Convergence’, ‘ubiquitous’ and ‘smart’ are key words describing future networks...

  3. 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.

  4. 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

  5. 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

  6. A distributed Synchronous reservation multiple access control protocol for mobile Ad hoc networks

    Institute of Scientific and Technical Information of China (English)

    ZHANG Yanling; SUN Xianpu; LI Jiandong

    2007-01-01

    This study proposes a new multiple access control protocol named distributed synchronous reservation multiple access control protocol.in which the hidden and exposed terminal problems are solved,and the quality of service(QoS)requirements for real-time traffic are guaranteed.The protocol is founded on time division multiplex address and a different type of traffic is assigned to difierent priority,according to which a node should compete for and reserve the free slots in a different method.Moreover,there is a reservation acknowledgement process before data transmit in each reserved slot,so that the intruded terminal problem is solved.The throughput and average packets drop probability of this protocol are analyzed and simulated in a fully connected network.the results of which indicate that this protocol is efficient enough to support the real-time traffic.and it is more suitable to MANETs.

  7. Wireless sensor and mobile ad-hoc networks vehicular and space applications

    CERN Document Server

    Al-Fuqaha, Ala

    2015-01-01

    This book describes the practical perspectives in using wireless sensor networks (WSN) to develop real world applications that can be used for space exploration. These applications include sensor interfaces, remote wireless vehicles, space crew health monitoring and instrumentation. The material discusses how applications of WSN originally developed for space travel and exploration are being applied and used in multiple real world applications, allowing for the development of smart systems that have characteristics such as self-healing, self-diagnosis, and emergency healthcare notification. This book also: ·         Discusses how multidisciplinary fields can be implemented in a single application ·         Reviews exhaustively the state-of-the-art research in WSN for space and vehicular applications ·         Covers smart systems that have self-healing, self-diagnosis, and emergency healthcare notification

  8. A Localization Algorithm Based on AOA for Ad-Hoc Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yang Sun Lee

    2012-01-01

    Full Text Available Knowledge of positions of sensor nodes in Wireless Sensor Networks (WSNs will make possible many applications such as asset monitoring, object tracking and routing. In WSNs, the errors may happen in the measurement of distances and angles between pairs of nodes in WSN and these errors will be propagated to different nodes, the estimation of positions of sensor nodes can be difficult and have huge errors. In this paper, we will propose localization algorithm based on both distance and angle to landmark. So, we introduce a method of incident angle to landmark and the algorithm to exchange physical data such as distances and incident angles and update the position of a node by utilizing multiple landmarks and multiple paths to landmarks.

  9. BAKNET - Communication network for radiation monitoring devices

    International Nuclear Information System (INIS)

    Cohen, Y.; Wengrowicz, U.; Tirosh, D.; Barak, D.

    1997-01-01

    A system, based on a new concept of controlling and monitoring distributed radiation monitors, has been developed and approved at the NRCN. The system, named B AKNET Network , consists of a series of communication adapters connected to a main PC via an RS-485 communication network (see Fig. 1). The network's maximal length is 1200 meters and it enables connection of up to 128 adapters. The BAKNET adapters are designed to interface output signals of different types of stationary radiation monitors to a main PC. The BAKNET adapters' interface type includes: digital, analog, RS-232, and mixed output signals. This allows versatile interfacing of different stationary radiation monitors to the main computer. The connection to the main computer is via an RS-485 network, utilizing an identical communication protocol. The PC software, written in C ++ under MS-Windows, consists of two main programs. The first is the data collection program and the second is the Human Machine Interface (HMI). (authors)

  10. 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.

  11. 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.

  12. Implementation of software programmable radios to form ad-hoc meshed networks to enhance maritime interception operations

    OpenAIRE

    Vann, Christopher Allen

    2010-01-01

    Approved for public release; distribution is unlimited Maritime Interception Operations have become a core competency for United States naval vessels working in conjunction with coalition units in remote waters. An increased need for real-time communication networks exists that will bring VBSS and SOC Teams in contact with experts who can determine the urgency and threat levels of vessels at sea and possible targets on land. The ultimate objective is to deliver timely intelligence, sur...

  13. A Cross-Layer Route Discovery Framework for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Wu Jieyi

    2005-01-01

    Full Text Available Most reactive routing protocols in MANETs employ a random delay between rebroadcasting route requests (RREQ in order to avoid "broadcast storms." However this can lead to problems such as "next hop racing" and "rebroadcast redundancy." In addition to this, existing routing protocols for MANETs usually take a single routing strategy for all flows. This may lead to inefficient use of resources. In this paper we propose a cross-layer route discovery framework (CRDF to address these problems by exploiting the cross-layer information. CRDF solves the above problems efficiently and enables a new technique: routing strategy automation (RoSAuto. RoSAuto refers to the technique that each source node automatically decides the routing strategy based on the application requirements and each intermediate node further adapts the routing strategy so that the network resource usage can be optimized. To demonstrate the effectiveness and the efficiency of CRDF, we design and evaluate a macrobian route discovery strategy under CRDF.

  14. Statistical Delay QoS Provisioning for Energy-Efficient Spectrum-Sharing Based Wireless Ad Hoc Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yichen Wang

    2016-01-01

    Full Text Available In this paper, we develop the statistical delay quality-of-service (QoS provisioning framework for the energy-efficient spectrum-sharing based wireless ad hoc sensor network (WAHSN, which is characterized by the delay-bound violation probability. Based on the established delay QoS provisioning framework, we formulate the nonconvex optimization problem which aims at maximizing the average energy efficiency of the sensor node in the WAHSN while meeting PU’s statistical delay QoS requirement as well as satisfying sensor node’s average transmission rate, average transmitting power, and peak transmitting power constraints. By employing the theories of fractional programming, convex hull, and probabilistic transmission, we convert the original fractional-structured nonconvex problem to the additively structured parametric convex problem and obtain the optimal power allocation strategy under the given parameter via Lagrangian method. Finally, we derive the optimal average energy efficiency and corresponding optimal power allocation scheme by employing the Dinkelbach method. Simulation results show that our derived optimal power allocation strategy can be dynamically adjusted based on PU’s delay QoS requirement as well as the channel conditions. The impact of PU’s delay QoS requirement on sensor node’s energy efficiency is also illustrated.

  15. Optimizing Transmission and Shutdown for Energy-Efficient Real-time Packet Scheduling in Clustered Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Rajkumar Ragunathan

    2005-01-01

    Full Text Available Energy efficiency is imperative to enable the deployment of ad hoc networks. Conventional power management focuses independently on the physical or MAC layer and approaches differ depending on the abstraction level. At the physical layer, the fundamental tradeoff between transmission rate and energy is exploited, which leads to transmit as slow as possible. At MAC level, power reduction techniques aim to transmit as fast as possible to maximize the radios power-off interval. The two approaches seem conflicting and it is not obvious which one is the most appropriate. We propose a transmission strategy that optimally mixes both techniques in a multiuser context. We present a cross-layer solution considering the transceiver power characteristics, the varying system load, and the dynamic channel constraints. Based on this, we derive a low-complexity online scheduling algorithm. Results considering an -ary quadrature amplitude modulation radio show that for a range of scenarios a large power reduction is achieved, compared to the case where only scaling or shutdown is considered.

  16. Performance Analysis of the IEEE 802.11p Multichannel MAC Protocol in Vehicular Ad Hoc Networks.

    Science.gov (United States)

    Song, Caixia

    2017-12-12

    Vehicular Ad Hoc Networks (VANETs) employ multichannel to provide a variety of safety and non-safety applications, based on the IEEE 802.11p and IEEE 1609.4 protocols. The safety applications require timely and reliable transmissions, while the non-safety applications require efficient and high throughput. In the IEEE 1609.4 protocol, operating interval is divided into alternating Control Channel (CCH) interval and Service Channel (SCH) interval with an identical length. During the CCH interval, nodes transmit safety-related messages and control messages, and Enhanced Distributed Channel Access (EDCA) mechanism is employed to allow four Access Categories (ACs) within a station with different priorities according to their criticality for the vehicle's safety. During the SCH interval, the non-safety massages are transmitted. An analytical model is proposed in this paper to evaluate performance, reliability and efficiency of the IEEE 802.11p and IEEE 1609.4 protocols. The proposed model improves the existing work by taking serval aspects and the character of multichannel switching into design consideration. Extensive performance evaluations based on analysis and simulation help to validate the accuracy of the proposed model and analyze the capabilities and limitations of the IEEE 802.11p and IEEE 1609.4 protocols, and enhancement suggestions are given.

  17. A Fluid Model for a Relay Node in an Ad Hoc Network: Evaluation of Resource Sharing Policies

    Directory of Open Access Journals (Sweden)

    Michel Mandjes

    2008-01-01

    Full Text Available Fluid queues offer a natural framework for analyzing waiting times in a relay node of an ad hoc network. Because of the resource sharing policy applied, the input and output of these queues are coupled. More specifically, when there are users who wish to transmit data through a specific node, each of them obtains a share 1/(+ of the service capacity to feed traffic into the queue of the node, whereas the remaining fraction /(+ is used to serve the queue; here >0 is a free design parameter. Assume now that jobs arrive at the relay node according to a Poisson process, and that they bring along exponentially distributed amounts of data. The case =1 has been addressed before; the present paper focuses on the intrinsically harder case >1, that is, policies that give more weight to serving the queue. Four performance metrics are considered: (i the stationary workload of the queue, (ii the queueing delay, that is, the delay of a “packet” (a fluid particle that arrives at an arbitrary point in time, (iii the flow transfer delay, (iv the sojourn time, that is, the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. We explicitly compute the Laplace transforms of these random variables.

  18. Location of terminals in a communications network

    DEFF Research Database (Denmark)

    2015-01-01

    A method (400, 500) of identifying nodes in a communications network is disclosed, the nodes being for use in locating wireless terminals within the network based upon reports from the wireless terminals of transmissions received from the nodes. The method (400, 500) comprises prioritising...... combinations of nodes in which at least three nodes are located around a reference node in a configuration satisfying similarity criteria to an idealised star configuration, wherein an idealised star configuration comprises three nodes evenly angularly distributed around, and at the same distance from......, a reference node. Also disclosed is a method (100, 200) for locating a plurality of wireless terminals in a communications network, the network comprising a plurality of network nodes at known locations, wherein the nodes emit wireless transmissions in an unsynchronised manner, such that a time difference...

  19. Efficient data communication protocols for wireless networks

    Science.gov (United States)

    Zeydan, Engin

    In this dissertation, efficient decentralized algorithms are investigated for cost minimization problems in wireless networks. For wireless sensor networks, we investigate both the reduction in the energy consumption and throughput maximization problems separately using multi-hop data aggregation for correlated data in wireless sensor networks. The proposed algorithms exploit data redundancy using a game theoretic framework. For energy minimization, routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function used in routing takes into account distance, interference and in-network data aggregation. The proposed energy-efficient correlation-aware routing algorithm significantly reduces the energy consumption in the network and converges in a finite number of steps iteratively. For throughput maximization, we consider both the interference distribution across the network and correlation between forwarded data when establishing routes. Nodes along each route are chosen to minimize the interference impact in their neighborhood and to maximize the in-network data aggregation. The resulting network topology maximizes the global network throughput and the algorithm is guaranteed to converge with a finite number of steps using best response dynamics. For multiple antenna wireless ad-hoc networks, we present distributed cooperative and regret-matching based learning schemes for joint transmit beanformer and power level selection problem for nodes operating in multi-user interference environment. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise ratio at each receiver. In cooperative and regret-matching based power minimization algorithms, transmit beanformers are selected from a predefined codebook to minimize the total power. By selecting transmit beamformers judiciously and performing power adaptation, the cooperative algorithm is shown to

  20. Modeling MAC layer for powerline communications networks

    Science.gov (United States)

    Hrasnica, Halid; Haidine, Abdelfatteh

    2001-02-01

    The usage of electrical power distribution networks for voice and data transmission, called Powerline Communications, becomes nowadays more and more attractive, particularly in the telecommunication access area. The most important reasons for that are the deregulation of the telecommunication market and a fact that the access networks are still property of former monopolistic companies. In this work, first we analyze a PLC network and system structure as well as a disturbance scenario in powerline networks. After that, we define a logical structure of the powerline MAC layer and propose the reservation MAC protocols for the usage in the PLC network which provides collision free data transmission. This makes possible better network utilization and realization of QoS guarantees which can make PLC networks competitive to other access technologies.