WorldWideScience

Sample records for hoc networks based

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

  2. Authentication Based on Multilayer Clustering in Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Suh Heyi-Sook

    2005-01-01

    Full Text Available In this paper, we describe a secure cluster-routing protocol based on a multilayer scheme in ad hoc networks. This work provides scalable, threshold authentication scheme in ad hoc networks. We present detailed security threats against ad hoc routing protocols, specifically examining cluster-based routing. Our proposed protocol, called "authentication based on multilayer clustering for ad hoc networks" (AMCAN, designs an end-to-end authentication protocol that relies on mutual trust between nodes in other clusters. The AMCAN strategy takes advantage of a multilayer architecture that is designed for an authentication protocol in a cluster head (CH using a new concept of control cluster head (CCH scheme. We propose an authentication protocol that uses certificates containing an asymmetric key and a multilayer architecture so that the CCH is achieved using the threshold scheme, thereby reducing the computational overhead and successfully defeating all identified attacks. We also use a more extensive area, such as a CCH, using an identification protocol to build a highly secure, highly available authentication service, which forms the core of our security framework.

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

    Directory of Open Access Journals (Sweden)

    Abdulaziz Al-Nahari

    Full Text Available 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.

  4. Trust recovery model of Ad Hoc network based on identity authentication scheme

    Science.gov (United States)

    Liu, Jie; Huan, Shuiyuan

    2017-05-01

    Mobile Ad Hoc network trust model is widely used to solve mobile Ad Hoc network security issues. Aiming at the problem of reducing the network availability caused by the processing of malicious nodes and selfish nodes in mobile Ad Hoc network routing based on trust model, an authentication mechanism based on identity authentication mobile Ad Hoc network is proposed, which uses identity authentication to identify malicious nodes, And trust the recovery of selfish nodes in order to achieve the purpose of reducing network congestion and improving network quality. The simulation results show that the implementation of the mechanism can effectively improve the network availability and security.

  5. Demand Based Effective Energy Utilization in Mobile Ad Hoc Networks

    OpenAIRE

    Bhuvaneswari, R.; Viswanathan, M

    2012-01-01

    Mobile Ad Hoc Networks (MANET) are the collection of mobile nodes without any centralized infrastructure. The underlying assumption is that the intermediate nodes cooperate in forwarding packets. Mobile nodes collects the route information through overhearing and stores these information in route caches with the use of Dynamic Source Routing (DSR) Protocol. These nodes consume power unnecessarily due to overhearing the transmissions of their neighbors. Due to this, the network performance is ...

  6. Research of ad hoc network based on SINCGARS network

    Science.gov (United States)

    Nie, Hao; Cai, Xiaoxia; Chen, Hong; Chen, Jian; Weng, Pengfei

    2016-03-01

    In today's world, science and technology make a spurt of progress, so society has entered the era of information technology, network. Only the comprehensive use of electronic warfare and network warfare means can we maximize their access to information and maintain the information superiority. Combined with the specific combat mission and operational requirements, the research design and construction in accordance with the actual military which are Suitable for the future of information technology needs of the tactical Adhoc network, tactical internet, will greatly improve the operational efficiency of the command of the army. Through the study of the network of the U.S. military SINCGARS network, it can explore the routing protocol and mobile model, to provide a reference for the research of our army network.

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

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

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

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

  11. Coupled interference based rate adaptation in ad hoc networks

    CSIR Research Space (South Africa)

    Awuor, F

    2011-09-01

    Full Text Available since the channel condition is time variant [5], [6]. Hence CIN considers link adaptation based on SINR performance to derive transmit power that minimizes coupled interference in the network. In [5], an algorithm is proposed where an average value... channel condition variance for proper choice of PHY mode. In [7], rate adaptation scheme is proposed wherein nodes select the power-rate pair to maximize their utility based on the previous measured SINRs. The values of SINR employed by [5],[6] and [7...

  12. A Robust Routing Strategy for Density Spanner based Wireless Ad Hoc Networks

    OpenAIRE

    Divi Mydhili1; K.R.R.Mohana Rao2

    2012-01-01

    An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining such overlay networks have already been suggested, but most of them are based on an oversimplified wireless communication model. We address cooperative caching in wireless networks, where the nodes may be mobile and exchange information in a peer-to-peer fashion. We consider both cases of nodes with large and small-s...

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

  14. Rate adaptation in ad hoc networks based on pricing

    CSIR Research Space (South Africa)

    Awuor, F

    2011-09-01

    Full Text Available that incorporates penalty (pricing) obtruded to users’ choices of transmission parameters to curb the self-interest behaviour. Therefore users determine their data rates and transmit power based on the perceived coupled interference at the intended receiver...

  15. An Agent Based Intrusion Detection Model for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    B. M. Reshmi

    2006-01-01

    Full Text Available Intrusion detection has over the last few years, assumed paramount importance within the broad realm of network security, more so in case of wireless mobile ad hoc networks. The inherently vulnerable characteristics of wireless mobile ad hoc networks make them susceptible to attacks in-spite of some security measures, and it may be too late before any counter action can take effect. As such, there is a need to complement traditional security mechanisms with efficient intrusion detection and response systems. This paper proposes an agent-based model to address the aspect of intrusion detection in cluster based mobile wireless ad hoc network environment. The model comprises of a set of static and mobile agents, which are used to detect intrusions, respond to intrusions, and distribute selected and aggregated intrusion information to all other nodes in the network in an intelligent manner. The model is simulated to test its operation effectiveness by considering the performance parameters such as, detection rate, false positives, agent overheads, and intrusion information distribution time. Agent based approach facilitates flexible and adaptable security services. Also, it supports component based software engineering components such as maintainability, reachability, reusability, adaptability, flexibility, and customization.

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

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

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

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

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

  1. Mitigating Malicious Attacks Using Trust Based Secure-BEFORE Routing Strategy in Mobile Ad Hoc Networks

    National Research Council Canada - National Science Library

    Shah, Rutuja; Subramaniam, Sumathy; Lekala Dasarathan, Dhinesh Babu

    2016-01-01

    Mobile ad hoc Networks (MANET), being infrastructureless and dynamic in nature, are predominantly susceptible to attacks such as black hole, worm hole, cunning gray hole attack at source or destination...

  2. Replica Dissemination and Update Strategies in Cluster-Based Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Mieso K. Denko

    2006-01-01

    Full Text Available A mobile ad hoc network (MANET is a collection of wireless mobile nodes that forms a temporary network without the aid of a fixed communication infrastructure. Since every node can be mobile and network topology changes can occur frequently, node disconnection is a common mode of operation in MANETs. Providing reliable data access and message delivery is a challenge in this dynamic network environment. Caching and replica allocation within the network can improve data accessibility by storing the data and accessing them locally. However, maintaining data consistency among replicas becomes a challenging problem. Hence, balancing data accessibility and consistency is an important step toward data management in MANETs. In this paper, we propose a replica-based data-storage mechanism and undelivered-message queue schemes to provide reliable data storage and dissemination. We also propose replica update strategies to maintain data consistency while improving data accessibility. These solutions are based on a clustered MANET where nodes in the network are divided into small groups that are suitable for localized data management. The goal is to reduce communication overhead, support localized computation, and enhance scalability. A simulation environment was built using an NS-2 network simulator to evaluate the performance of the proposed schemes. The results show that our schemes distribute replicas effectively, provide high data accessibility rates and maintain consistency.

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

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

    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. PMID:26184224

  5. Low Power 24 GHz ad hoc Networking System Based on TDOA for Indoor Localization

    Directory of Open Access Journals (Sweden)

    Melanie Jung

    2013-12-01

    Full Text Available This paper introduces the key elements of a novel low-power, high precision localization system based on Time-Difference-of-Arrival (TDOA distance measurements. The combination of multiple localizable sensor nodes, leads to an ad hoc network. Besides the localization functionality this ad hoc network has the additional advantage of a communication interface. Due to this a flexible positioning of the master station for information collection and the detection of static and mobile nodes is possible. These sensor nodes work in the 24 GHz ISM (Industrial Scientific and Medical frequency range and address several use cases and are able to improve various processes for production scheduling, logistics, quality management, medical applications and collection of geo information. The whole system design is explained briefly. Its core component is the frequency modulated continuous wave (FMCW synthesizer suitable for high performance indoor localization. This research work focuses on power and size reduction of this crucial system component. The comparison of the first and second generation of the system shows a significant size and power reduction as well as an increased precision.

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

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

    Directory of Open Access Journals (Sweden)

    Maha Abdelhaq

    Full Text Available 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.

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

  9. Cross-Network Information Dissemination in Vehicular Ad hoc Networks (VANETs: Experimental Results from a Smartphone-Based Testbed

    Directory of Open Access Journals (Sweden)

    Gianluigi Ferrari

    2013-08-01

    Full Text Available In this work, we present an innovative approach for effective cross-network information dissemination, with applications to vehicular ad hoc networks (VANETs. The proposed approach, denoted as "Cross-Network Effective Traffic Alert Dissemination" (X-NETAD, leverages on the spontaneous formation of local WiFi (IEEE 802.11b VANETs, with direct connections between neighboring vehicles, in order to disseminate, very quickly and inexpensively, traffic alerts received from the cellular network. The proposed communication architecture has been implemented on Android smartphones. The obtained experimental results show that an effective cross-network information dissemination service can entirely rely on smartphone-based communications. This paves the way to future Internet architectures, where vehicles will play a key role as information destinations and sources.

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

  11. Dynamic Cooperative Clustering Based Power Assignment: Network Capacity and Lifetime Efficient Topology Control in Cooperative Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Xiao-Hong Li

    2014-01-01

    Full Text Available Cooperative communication (CC is used in topology control as it can reduce the transmission power and expand the transmission range. However, all previous research on topology control under the CC model focused on maintaining network connectivity and minimizing the total energy consumption, which would lead to low network capacity, transmission interruption, or even network paralysis. Meanwhile, without considering the balance of energy consumption in the network, it would reduce the network lifetime and greatly affect the network performance. This paper tries to solve the above problems existing in the research on topology control under the CC model by proposing a power assignment (DCCPA algorithm based on dynamic cooperative clustering in cooperative ad hoc networks. The new algorithm clusters the network to maximize network capacity and makes the clusters communicate with each other by CC. To reduce the number of redundant links between clusters, we design a static clustering method by using Kruskal algorithm. To maximize the network lifetime, we also propose a cluster head rotating method which can reach a good tradeoff between residual energy and distance for the cluster head reselection. Experimental results show that DCCPA can improve 80% network capacity with Cooperative Bridges algorithm; meanwhile, it can improve 20% network lifetime.

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

  13. Quality of Service Issues for Reinforcement Learning Based Routing Algorithm for Ad-Hoc Networks

    OpenAIRE

    Kulkarni, Shrirang Ambaji; Rao, G. Raghavendra

    2012-01-01

    Mobile ad-hoc networks are dynamic networks which are decentralized and autonomous in nature. Many routing algorithms have been proposed for these dynamic networks. It is an important problem to model Quality of Service requirements on these types of algorithms which traditionally have certain limitations. To model this scenario we have considered a reinforcement learning algorithm SAMPLE. SAMPLE promises to deal effectively with congestion and under high traffic load. As it is natural for ad...

  14. Distributed precision based localization algorithm for ad-hoc wireless networks

    NARCIS (Netherlands)

    Havinga, Paul J.M.; Evers, L.; van Hoesel, L.F.W.; Octavian, Stefan

    2005-01-01

    The invention relates to method for determining the position of a non-anchor node in an ad-hoc network comprising a number of non-anchor nodes and at least one anchor node having a predetermined location, said method comprising the steps of: determining the distance from a first non-anchor node to a

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

  16. Simulation Based: Study and Analysis of Routing Protocol in Vehicular Ad-hoc Network Environment

    OpenAIRE

    Khairnar, Mrs. Vaishali D.; Pradhan, Dr. S. N.

    2014-01-01

    A Vehicular Ad hoc Network (VANET) consists of vehicles which communicate with each other and exchange data via wireless communication links available between the vehicles which are in communication ranges of vehicles to improve the road safety in city. The communication between vehicles is used to provide road safety, comfort and entertainment. The performance of communication depends on how better routing takes place in the network. Routing data between the source and destination vehicle de...

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

  18. Traffic Adaptive Synchronized Cluster Based MAC Protocol for Cognitive Radio Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    Sultana Sahelee

    2017-01-01

    Full Text Available In wireless communication, Cognitive Radio Network (CRN is the contemporary research area to improve efficiency and spectrum utilization. It is structured with both licensed users and unlicensed users. In CRN, unlicensed users also called Cognitive Radio (CR users are permitted to utilize the free/idle of licensed channels without harmful interference to licensed users. However, accessing idle channels is the big challenging issue due to licensed users’ activities. A large number of cluster based MAC protocol have been proposed to solve this issue. In this paper, we have come up with a Traffic Adaptive Synchronized Cluster Based MAC Protocol for Cognitive Radio Ad Hoc Network, with the target of creating cluster structure more vigorous to the licensed users’ channel re-occupancy actions, maximize throughput, and minimize switching delay, so that CR users be able to use the idle spectrum more efficiently. In our protocol, clusters are formed according to Cluster Identification Channel (CIC and inter-communication is completed without gateway nodes. Finally, we have analysed and implemented our protocol through simulation and it provides better performance in terms of different performance metrics.

  19. Global Consistency Management Methods Based on Escrow Approaches in Mobile ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Takahiro Hara

    2010-01-01

    Full Text Available In a mobile ad hoc network, consistency management of data operations on replicas is a crucial issue for system performance. In our previous work, we classified several primitive consistency levels according to the requirements from applications and provided protocols to realize them. In this paper, we assume special types of applications in which the instances of each data item can be partitioned and propose two consistency management protocols which are combinations of an escrow method and our previously proposed protocols. We also report simulation results to investigate the characteristics of these protocols in a mobile ad hoc network. From the simulation results, we confirm that the protocols proposed in this paper drastically improve data availability and reduce the traffic for data operations while maintaining the global consistency in the entire network.

  20. OMNeT++-Based Cross-Layer Simulator for Content Transmission over Wireless Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Massin R

    2010-01-01

    Full Text Available Flexbility and deployment simplicity are among the numerous advantages of wireless links when compared to standard wired communications. However, challenges do remain high for wireless communications, in particular due to the wireless medium inherent unreliability, and to the desired flexibility, which entails complex protocol procedures. In that context simulation is an important tool to understand and design the protocols that manage the wireless networks. This paper introduces a new simulation framework based on the OMNeT++ simulator whose goal is to enable the study of data and multimedia content transmission over hybrid wired/wireless ad hoc networks, as well as the design of innovative radio access schemes. To achieve this goal, the complete protocol stack from the application to the physical layer is simulated, and the real bits and bytes of the messages transferred on the radio channel are exchanged. To ensure that this framework is reusable and extensible in future studies and projects, a modular software and protocol architecture has been defined. Although still in progress, our work has already provided some valuable results concerning cross layer HARQ/MAC protocol performance and video transmission over the wireless channel, as illustrated by results examples.

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

  2. 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; Jørgensen, Rasmus Nyholm; 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...

  3. Ad hoc network for emergency rescue system based on unmanned aerial vehicles

    OpenAIRE

    Cambra, Carlos; Sendra, Sandra; Lloret, Jaime; PARRA BORONAT, LORENA

    2015-01-01

    Intelligent Unmanned Aerial Vehicles (UAVs) on emergency rescue are widely used to detect injured mountaineers in inaccessible areas. These systems should satisfy several features. It is important to know the georeference of the injured mountaineers. It is also important to have real-time images of the area where people have suffered the accident. In this paper, we present the development of a UAV integrated within a wireless ad hoc network and the communication protocol that i...

  4. Dynamic Subchannel Assignment-Based Cross-Layer MAC and Network Protocol for Multihop Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Khanh Nguyen Quang

    2013-01-01

    Full Text Available The paper presents a dynamic subchannel assignment algorithm based on orthogonal frequency division multiple access technology operating in the time division duplexing and a new cross-layer design based on a proposed routing protocol jointed with the MAC protocol. The proposed dynamic sub-channel assignment algorithm provides a new interference avoidance mechanism which solves several drawbacks of existing radio resource allocation techniques in wireless networks using OFDMA/TDD, such as the hidden node and exposed node problems, mobility, and cochannels interference in frequency (CCI. Besides, in wireless networks, when a route is established, the radio resource allocation problems may decrease the end to end performance proportionally with the length of each route. The contention at MAC layer may cause the routing protocol at network layer to respond by finding new routes and routing table updates. The proposed routing protocol is jointed with the MAC protocol based on dynamic sub-channel assignment to ensure that the quality of service in multihop ad hoc networks is significantly improved.

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

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

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

  8. Coherence time-based cooperative MAC protocol 1 for wireless ad hoc networks

    Directory of Open Access Journals (Sweden)

    Kim Hyung-jin

    2011-01-01

    Full Text Available Abstract In this article, we address the goal of achieving performance gains under heavy-load and fast fading conditions. CoopMACI protocol proposed in Proceedings of the IEEE International Conference on Communications (ICC, Seoul, Korea, picks either direct path or relay path based on rate comparison to enhance average throughput and delay performances. However, CoopMACI performance deteriorates under fading conditions because of lower direct path or relay path reliability compared to UtdMAC (Agarwal et al. LNCS, 4479, 415-426, 2007. UtdMAC was shown to perform better than CoopMACI in terms of average throughput and delay performances because of improved transmission reliability provided by the backup relay path. Although better than CoopMACI, UtdMAC does not fully benefit from higher throughput relay path (compared to the direct path, since it uses relay path only as a secondary backup path. In this article, we develop a cooperative MAC protocol (termed as instantaneous relay-based cooperative MAC--IrcMAC that uses channel coherence time and estimates signal-to-noise ratio (SNR of source-to-relay, relay-to-destination, and source-to-destination links, to reliably choose between relay path or direct path for enhanced throughput and delay performances. Unique handshaking is used to estimate SNR and single bit feedbacks resolve contentions among relay nodes, which further provides source node with rate (based on SNR information on source-to-destination, source-to-relay, and relay-to-destination links. Simulation results clearly show that IrcMAC significantly outperforms the existing CoopMACI and the UtdMAC protocols in wireless ad hoc network. Results show average throughput improvements of 41% and 64% and average delay improvementd of 98.5% and 99.7% compared with UtdMAC and CoopMACI, respectively.

  9. Multicriteria Based Next Forwarder Selection for Data Dissemination in Vehicular Ad Hoc Networks Using Analytical Network Process

    Directory of Open Access Journals (Sweden)

    Shahid Latif

    2017-01-01

    Full Text Available Vehicular ad hoc network (VANET is a wireless emerging technology that aims to provide safety and communication services to drivers and passengers. In VANETs, vehicles communicate with other vehicles directly or through road side units (RSU for sharing traffic information. The data dissemination in VANETs is a challenging issue as the vehicles have to share safety critical information in real time. The data distribution is usually done using broadcast method resulting in inefficient use of network resources. Therefore, to avoid the broadcast storm and efficiently use network resources, next forwarder vehicle (NFV is selected to forward data to nearby vehicles. The NFV selection is based on certain parameters like direction, distance, and position of vehicles, which makes it a multicriteria decision problem. In this paper, analytical network process (ANP is used as a multicriteria decision tool to select the optimal vehicle as NFV. The stability of alternatives (candidate vehicles for NFV selection ranking is checked using sensitivity analysis for different scenarios. Mathematical formulation shows that ANP method is applicable for NFV selection in VANETs. Simulation results show that the proposed scheme outperforms other state-of-the-art data dissemination schemes in terms of reachability, latency, collisions, and number of transmitted and duplicate data packets.

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

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

    Science.gov (United States)

    2009-06-01

    destination.  Wormhole attack: A group of cooperating malicious nodes can pretend to connect two distant points in the network with a low-latency...communication link called wormhole link, causing disruptions in normal traffic load and flow.  Black hole attack: A malicious node, the so called

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

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

  14. Transmission Strategies in MIMO Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Fakih Khalil

    2009-01-01

    Full Text Available Abstract Precoding problem in multiple-input multiple-output (MIMO ad hoc networks is addressed in this work. Firstly, we consider the problem of maximizing the system mutual information under a power constraint. In this context, we give a brief overview of the nonlinear optimization methods, and systematically we compare their performances. Then, we propose a fast and distributed algorithm based on the quasi-Newton methods to give a lower bound of the system capacity of MIMO ad hoc networks. Our proposed algorithm solves the maximization problem while diminishing the amount of information in the feedback links needed in the cooperative optimization. Secondly, we propose a different problem formulation, which consists in minimizing the total transmit power under a quality of signal constraint. This novel problem design is motivated since the packets are captured in ad hoc networks based on their signal-to-interference-plus-noise ratio (SINR values. We convert the proposed formulation into semidefinite optimization problem, which can be solved numerically using interior point methods. Finally, an extensive set of simulations validates the proposed algorithms.

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

  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. 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. Mobile Offloading in Wireless Ad Hoc Networks

    OpenAIRE

    Kalejaiye, Gabriel B. T.; Rondina, João A. S. R.; Albuquerque, Leonardo V. V. L.; Pereira, Taís L.; Campos, Luiz F. O.; Melo, Raphael A. S.; Mascarenhas, Daniel S.; Carvalho, Marcelo M.

    2014-01-01

    This paper describes a strategy that was designed, implemented, and presented at the {\\it Mobile Ad Hoc Networking Interoperability and Cooperation (MANIAC) Challenge 2013}. The theme of the MANIAC Challenge 2013 was ``Mobile Data Offloading,'' and consisted on developing and comparatively evaluating strategies to offload infrastructure access points via customer ad hoc forwarding using handheld devices (e.g., tablets and smartphones). According to the challenge rules, a hop-by-hop bidding co...

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

  20. DAWN: Dynamic Ad-hoc Wireless Network

    Science.gov (United States)

    2016-06-19

    Wireless Network 1 Introduction The network-centric battlefield includes sensors, troop carriers, unmanned air vehicle (UAV), aircraft, smart ...Bellman Control Heritage Award. • Honorary Doctorate at Technical University of Crete. • Best paper award at 2008 IEEE International Conference on Mobile Ad-hoc and Sensor Systems.

  1. 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 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...... nodes function in ad-hoc Wi-Fi mode, which means no association 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 arrive at the destination. To make the design...

  2. 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 a Wistron CM9 mini PCI Atheros based WiFi card with 802.11a/b/g capability was used for each node. A Lego Mindstorms robot with a battery powered Soekris motherboard containing a 802.11a (5.8GHz) card and a 802.11b/g (2.4GHz) card was used... at the CSIR, South Africa (email {djohnson, ykaka, jhay}@csir.co.za) test bed [3]. These have helped understand the limitations of the 802.11 MAC layer and the issues that external factors such as hidden nodes, network load and interference have...

  3. A Self-Adaptive Back-off Optimization Scheme Based on Beacons Probability Prediction for Vehicle Ad-Hoc Networks

    Institute of Scientific and Technical Information of China (English)

    Haitao Zhao; Aiqian Du; Hongbo Zhu; Dapeng Li; Nanjie Liu

    2016-01-01

    In order to improve the broadcast reception rates of beacon messages in vehicle ad-hoc networks,a conclusion that the relationship between collision probability and minimum contention window size and the relationship between expiration probability and minimum window size was reached by building a Markov model. According to this conclusion,a back-off algorithm based on adjusting the size of minimum contention window called CEB is proposed, and this algorithm is on the basis of the differential size between the number of expiration beacons and preset threshold.Simulations were done to compare the performance of CEB with that of RBEB and BEB,and the results show that the performance of the new proposed algorithm is better than that of RBEB and BEB.

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

  5. Constrained Delaunay Triangulation for Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    D. Satyanarayana

    2008-01-01

    Full Text Available Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc networks primarily focused on geometric properties without considering network requirements. In this paper, we propose a new spanner called constrained Delaunay triangulation (CDT which considers both geometric properties and network requirements. The CDT is formed by introducing a small set of constraint edges into local Delaunay triangulation (LDel to reduce the number of hops between nodes in the network graph. We have simulated the CDT using network simulator (ns-2.28 and compared with Gabriel graph (GG, relative neighborhood graph (RNG, local Delaunay triangulation (LDel, and planarized local Delaunay triangulation (PLDel. The simulation results show that the minimum number of hops from source to destination is less than other spanners. We also observed the decrease in delay, jitter, and improvement in throughput.

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

  7. A contention-based efficient-information perception algorithm (CEiPA) for vehicular ad hoc networks

    Institute of Scientific and Technical Information of China (English)

    Chen Lijia; Jiang Hao; Yan Puliu

    2009-01-01

    The problem of information dissemination is researched for vehicular ad-hoc networks (VANET) in this paper, and a contention-based efficient-information perception algorithm (CEiPA) is proposed. The idea of CEiPA is that beacons are delivered over VANET with limited lifetime and efficient information. CEiPA consists of two phases. The first one is initialization phase, during which the count timers Tcycle and Tlocal are set to start beacon delivery while Tcycle is also used to monitor and restart beaconing. The second one is beacon delivery phase. An elaborate distance function is employed to set contention delay for beacons of each vehicle. In this way beacons will be sent in order, which decreases the collision of beacons. Simulation results show that CEiPA enables each beacon to carry more efficient information and spread them over more vehicles with lower network overhead than the periodic beacon scheme. CEiPA is also flexible and scalable because the efficient information threshold it employs is a balance among the freshness of information, network overhead and perception area of a vehicle.

  8. Cross-Network Information Dissemination in Vehicular Ad hoc Networks (VANETs): Experimental Results from a Smartphone-Based Testbed

    National Research Council Canada - National Science Library

    Stefano Busanelli; Filippo Rebecchi; Marco Picone; Nicola Iotti; Gianluigi Ferrari

    2013-01-01

    .... The proposed communication architecture has been implemented on Android smartphones. The obtained experimental results show that an effective cross-network information dissemination service can entirely rely on smartphone-based communications...

  9. Anomaly Detection Techniques for Ad Hoc Networks

    Science.gov (United States)

    Cai, Chaoli

    2009-01-01

    Anomaly detection is an important and indispensable aspect of any computer security mechanism. Ad hoc and mobile networks consist of a number of peer mobile nodes that are capable of communicating with each other absent a fixed infrastructure. Arbitrary node movements and lack of centralized control make them vulnerable to a wide variety of…

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

  11. 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...... be significantly reduced at the cost of a slight increase of processing complexity at the Bluetooth master device....

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

  13. Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach

    Directory of Open Access Journals (Sweden)

    Peter Bulychev

    2012-02-01

    Full Text Available 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 using Statistical Model Checking. The method has been implemented in UPPAAL model checker and has been applied to the analysis of Aloha CSMA/CD and IEEE 802.15.4 CSMA/CA protocols.

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

  15. Composite Trust-Based Public Key Management in Mobile Ad Hoc Networks

    Science.gov (United States)

    2013-01-01

    and static over time. Huang and Wu [10] proposed a certificate path discovery algorithm for MANETs based on the hierarchical PKI structure using...characteristics of MANETs. These challenges include no centralized trusted entities , resource constraints, and high security vulnerabilities. This...CTPKM) with no centralized trust entity with the goal of maximizing performance (e.g., service availability or efficiency) while mitigating security

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

    Science.gov (United States)

    2016-03-05

    434 435 436 437 438 439 440 441 442 443 4 4 4 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463...1062 is 1063 fr 1064 P H Fig. 2. Effect of trust threshold ection 3.4 . In Fig. 2 , we compare the performance of three ust-based approaches

  17. A spontaneous ad hoc network to share www access

    OpenAIRE

    Lloret Jaime; Garcia Miguel; Peñalver Lourdes; Lacuesta Raquel

    2010-01-01

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

  18. Mobility based key management technique for multicast security in mobile ad hoc networks.

    Science.gov (United States)

    Madhusudhanan, B; Chitra, S; Rajan, C

    2015-01-01

    In MANET multicasting, forward and backward secrecy result in increased packet drop rate owing to mobility. Frequent rekeying causes large message overhead which increases energy consumption and end-to-end delay. Particularly, the prevailing group key management techniques cause frequent mobility and disconnections. So there is a need to design a multicast key management technique to overcome these problems. In this paper, we propose the mobility based key management technique for multicast security in MANET. Initially, the nodes are categorized according to their stability index which is estimated based on the link availability and mobility. A multicast tree is constructed such that for every weak node, there is a strong parent node. A session key-based encryption technique is utilized to transmit a multicast data. The rekeying process is performed periodically by the initiator node. The rekeying interval is fixed depending on the node category so that this technique greatly minimizes the rekeying overhead. By simulation results, we show that our proposed approach reduces the packet drop rate and improves the data confidentiality.

  19. Fundamental Properties of Wireless Mobile Ad-hoc Networks

    NARCIS (Netherlands)

    Hekmat, R.

    2005-01-01

    Wireless mobile ad-hoc networks are formed by mobile devices that set up a possibly short-lived network for communication needs of the moment. Ad-hoc networks are decentralized, self-organizing networks capable of forming a communication network without relying on any fixed infrastructure. Each node

  20. Mobile Advertisement in Vehicular Ad-Hoc Networks

    OpenAIRE

    Dobre, Ciprian; Tudor, George Cristian

    2012-01-01

    Mobile Advertisement is a location-aware dissemination solution built on top of a vehicular ad-hoc network. We envision a network of WiFi access points that dynamically disseminate data to clients running on the car's smart device. The approach can be considered an alternative to the static advertisement billboards and can be useful to business companies wanting to dynamically advertise their products and offers to people driving their car. The clients can subscribe to information based on sp...

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

  2. Decentralized Network-level Synchronization in Mobile Ad Hoc Networks

    NARCIS (Netherlands)

    Voulgaris, Spyros; Dobson, Matthew; van Steen, Martinus Richardus

    Energy is the scarcest resource in ad hoc wireless networks, particularly in wireless sensor networks requiring a long lifetime. Intermittently switching the radio on and off is widely adopted as the most effective way to keep energy consumption low. This, however, prevents the very goal of

  3. Opinion Impact Models and Opinion Consensus Methods in Ad Hoc Tactical Social Networks

    OpenAIRE

    Demin Li; Jie Zhou; Jingjuan Zhu; Jiacun Wang

    2013-01-01

    Ad hoc social networks are special social networks, such as ad hoc tactical social networks, ad hoc firefighter social networks, and ad hoc vehicular social networks. The social networks possess both the properties of ad hoc network and social network. One of the challenge problems in ad hoc social networks is opinion impact and consensus, and the opinion impact plays a key role for information fusion and decision support in ad hoc social networks. In this paper, consider the impact of physic...

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

  5. Spontaneous Ad Hoc Mobile Cloud Computing Network

    Directory of Open Access Journals (Sweden)

    Raquel Lacuesta

    2014-01-01

    Full Text Available 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.

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

    OpenAIRE

    Rana Asif Rehman; Jong Kim; Byung-Seo Kim

    2015-01-01

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

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

    Directory of Open Access Journals (Sweden)

    K. RAMESH BABU

    2015-06-01

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

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

    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...... the worst conversion efficiency (25%), a minimum of 214 ± 25 mW of electrical energy per second could be generated. This amount exceeds the energy consumed by the wireless sensors that can be used to gather parameters describing animal behavior such as neck and head movement. This study suggests...... 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...

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

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

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

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

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

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

  15. Malicious node detection in ad-hoc wireless networks

    Science.gov (United States)

    Griswold, Richard L.; Medidi, Sirisha R.

    2003-07-01

    Advances in wireless communications and the proliferation of mobile computing devices has led to the rise of a new type of computer network: the ad-hoc wireless network. Ad-hoc networks are characterized by a lack of fixed infrastructure, which give ad-hoc networks a great deal of flexibility, but also increases the risk of security problems. In wired networks, key pieces of network infrastructure are secured to prevent unauthorized physical access and tampering. Network administrators ensure that everything is properly configured and are on-hand to fix problems and deal with intrusions. In contrast, the nodes in an ad-hoc network are responsible for routing and forwarding data in the network, and there are no network administrators to handle potential problems. This makes an ad-hoc network more vulnerable to a misconfigured, faulty, or compromised node. We propose a means for a node in an ad-hoc network to detect and handle these malicious nodes by comparing data available to the routing protocol, such as cached routes in Dynamic Source Routing, ICMP messages, and transport layer information, such as TCP timeouts. This data can then be used along with network probes to isolate the malicious node.

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

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

    OpenAIRE

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

    2012-01-01

    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 (2009), Juan-les-pins (2010), and Favignana Island (2011), the 11th Med-Hoc-Net (2012) aims to serve as a platform for researchers and visionaries from the academia, the research laboratories, and the i...

  18. Privacy-preserving schemes for Ad Hoc Social Networks: A survey

    OpenAIRE

    Ferrag, Mohamed Amine; Maglaras, Leandros; Ahmim, Ahmed

    2016-01-01

    In this paper, we review the state of the art of privacy-preserving schemes for ad hoc social networks, including, mobile social networks (MSNs) and vehicular social networks (VSNs). Specifically, we select and in-detail examine thirty-three privacy preserving schemes developed for or applied in the context of ad hoc social networks. These schemes are published between 2008 and 2016. Based on this existing privacy preservation schemes, we survey privacy preservation models, including location...

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

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

  1. Enhanced Broadcasting and Code Assignment in Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Jinfang Zhang

    2008-08-01

    Full Text Available A CDMA-based mobile Ad Hoc networks face two main design challenges. One is to periodically update connectivity information, namely, neighboring nodes and the codes used by neighboring nodes. The other is to guarantee that there is no code collision in two hops' distance. This paper proposes an enhanced time-spread broadcasting schedule for connectivity information update. Based on the connectivity information, a code assignment and potential code collision resolution scheme to solve hidden/exposed nodes problem is proposed. Simulation results demonstrate the efficiency and effectiveness of the proposed schemes.

  2. Fuzzy Logic-based Intelligent Scheme for Enhancing QoS of Vertical Handover Decision in Vehicular Ad-hoc Networks

    Science.gov (United States)

    Azzali, F.; Ghazali, O.; Omar, M. H.

    2017-08-01

    The design of next generation networks in various technologies under the “Anywhere, Anytime” paradigm offers seamless connectivity across different coverage. A conventional algorithm such as RSSThreshold algorithm, that only uses the received strength signal (RSS) as a metric, will decrease handover performance regarding handover latency, delay, packet loss, and handover failure probability. Moreover, the RSS-based algorithm is only suitable for horizontal handover decision to examine the quality of service (QoS) compared to the vertical handover decision in advanced technologies. In the next generation network, vertical handover can be started based on the user’s convenience or choice rather than connectivity reasons. This study proposes a vertical handover decision algorithm that uses a Fuzzy Logic (FL) algorithm, to increase QoS performance in heterogeneous vehicular ad-hoc networks (VANET). The study uses network simulator 2.29 (NS 2.29) along with the mobility traffic network and generator to implement simulation scenarios and topologies. This helps the simulation to achieve a realistic VANET mobility scenario. The required analysis on the performance of QoS in the vertical handover can thus be conducted. The proposed Fuzzy Logic algorithm shows improvement over the conventional algorithm (RSSThreshold) in the average percentage of handover QoS whereby it achieves 20%, 21% and 13% improvement on handover latency, delay, and packet loss respectively. This is achieved through triggering a process in layer two and three that enhances the handover performance.

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

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

  5. A Spontaneous Ad Hoc Network to Share WWW Access

    Directory of Open Access Journals (Sweden)

    Raquel Lacuesta

    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.

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

  7. Performance Analysis of Authentication Protocols in Vehicular Ad Hoc Networks

    OpenAIRE

    Aboobaker, Abdul Kalam Kunnel

    2009-01-01

    Traditionally traffic safety was addressed by traffic awareness and passive safety measures like solid chassis, seat belts, air bags etc. With the recent breakthroughs in the domain of mobile ad hoc networks, the concept of vehicular ad hoc networks (VANET) was realised. Safety messaging is the most important aspect of VANETs, where the passive safety (accident readiness) in vehicles was reinforced with the idea of active safety (accident prevention). In safety messaging vehicles will message...

  8. Sensor and ad-hoc networks theoretical and algorithmic aspects

    CERN Document Server

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

    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.

  9. Survey on Security Issues in Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Bassem Mokhtar

    2015-12-01

    Full Text Available Vehicular Ad hoc NETworks are special case of ad hoc networks that, besides lacking infrastructure, communicating entities move with various accelerations. Accordingly, this impedes establishing reliable end-to-end communication paths and having efficient data transfer. Thus, VANETs have different network concerns and security challenges to get the availability of ubiquitous connectivity, secure communications, and reputation management systems which affect the trust in cooperation and negotiation between mobile networking entities. In this survey, we discuss the security features, challenges, and attacks of VANETs, and we classify the security attacks of VANETs due to the different network layers.

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

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

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

  13. A survey of TCP over ad hoc networks

    NARCIS (Netherlands)

    Al Hanbali, Ahmad; Altman, Eitan; Nain, Philippe

    2005-01-01

    The Transmission Control Protocol (TCP) was designed to provide reliable end-to-end delivery of data over unreliable networks. In practice, most TCP deployments have been carefully designed in the context of wired networks. Ignoring the properties of wireless ad hoc networks can lead to TCP

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

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

  16. Mapping Ad Hoc Communications Network of a Large Number Fixed-Wing UAV Swarm

    Science.gov (United States)

    2017-03-01

    NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS MAPPING AD HOC COMMUNICATIONS NETWORK OF A LARGE NUMBER FIXED-WING UAV SWARM by Alexis...SUBTITLE MAPPING AD HOC COMMUNICATIONS NETWORK OF A LARGE NUMBER FIXED-WING UAV SWARM 5. FUNDING NUMBERS 6. AUTHOR(S) Alexis Pospischil 7. PERFORMING... UAVs ) simultaneously as a self-organizing swarm. These vehicles were able to execute behaviors based on message notification from a single ground

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

  18. An Efficient Channel Access Scheme for Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Syed Asad Hussain

    2017-01-01

    Full Text Available Vehicular Ad Hoc Networks (VANETs are getting more popularity due to the potential Intelligent Transport Systems (ITS technology. It provides many efficient network services such as safety warnings (collision warning, entertainment (video and voice, maps based guidance, and emergency information. VANETs most commonly use Road Side Units (RSUs and Vehicle-to-Vehicle (V2V referred to as Vehicle-to-Infrastructure (V2I mode for data accessing. IEEE 802.11p standard which was originally designed for Wireless Local Area Networks (WLANs is modified to address such type of communication. However, IEEE 802.11p uses Distributed Coordination Function (DCF for communication between wireless nodes. Therefore, it does not perform well for high mobility networks such as VANETs. Moreover, in RSU mode timely provision of data/services under high density of vehicles is challenging. In this paper, we propose a RSU-based efficient channel access scheme for VANETs under high traffic and mobility. In the proposed scheme, the contention window is dynamically varied according to the times (deadlines the vehicles are going to leave the RSU range. The vehicles with shorter time deadlines are served first and vice versa. Simulation is performed by using the Network Simulator (NS-3 v. 3.6. The simulation results show that the proposed scheme performs better in terms of throughput, backoff rate, RSU response time, and fairness.

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

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

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

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

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

  4. Combinatorial Channel Signature Modulation for Wireless ad-hoc Networks

    CERN Document Server

    Piechocki, Robert

    2012-01-01

    In this paper we introduce a novel modulation and multiplexing method which facilitates highly efficient and simultaneous communication between multiple terminals in wireless ad-hoc networks. We term this method Combinatorial Channel Signature Modulation (CCSM). The CCSM method is particularly efficient in situations where communicating nodes operate in highly time dispersive environments. This is all achieved with a minimal MAC layer overhead, since all users are allowed to transmit and receive at the same time/frequency (full simultaneous duplex). The CCSM method has its roots in sparse modelling and the receiver is based on compressive sampling techniques. Towards this end, we develop a new low complexity algorithm termed Group Subspace Pursuit. Our analysis suggests that CCSM at least doubles the throughput when compared to the state-of-the art.

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

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

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

    Directory of Open Access Journals (Sweden)

    S. C. Dutta

    2013-06-01

    Full Text Available 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.

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

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

    African Journals Online (AJOL)

    We show how to implement the random waypoint mobility model for ad-hoc networks without pausing, through a more efficient and reliable computer simulation, using MATrix LABoratory 7.5.0 (R2007b). Simulation results obtained verify the correctness of the model. Keywords : Stationary, random waypoint, simulation, ...

  10. Auto-Configuration Protocols in Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Julián García Matesanz

    2011-03-01

    Full Text Available 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.

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

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

  13. A Simplified Mobile Ad Hoc Network Structure for Helicopter Communication

    Directory of Open Access Journals (Sweden)

    Abdeldime Mohamed Salih Abdelgader

    2016-01-01

    Full Text Available There are a number of volunteer and statutory organizations who are capable of conducting an emergency response using helicopters. Rescue operations require a rapidly deployable high bandwidth network to coordinate necessary relief efforts between rescue teams on the ground and helicopters. Due to massive destruction and loss of services, ordinary communication infrastructures may collapse in these situations. Consequently, information exchange becomes one of the major challenges in these circumstances. Helicopters can be also employed for providing many services in rugged environments, military applications, and aerial photography. Ad hoc network can be used to provide alternative communication link between a set of helicopters, particularly in case of significant amount of data required to be shared. This paper addresses the ability of using ad hoc networks to support the communication between a set of helicopters. A simplified network structure model is presented and extensively discussed. Furthermore, a streamlined routing algorithm is proposed. Comprehensive simulations are conducted to evaluate the proposed routing algorithm.

  14. Coherent and automatic address resolution for vehicular ad hoc networks

    OpenAIRE

    Urquiza Aguiar, Luis; Tripp Barba, Carolina; Rebollo Monedero, David; Mezher, Ahmad Mohamad; Aguilar Igartua, Mónica; Forné Muñoz, Jorge

    2015-01-01

    The interest in vehicular communications has increased notably. In this paper, the use of the address resolution (AR) procedures is studied for vehicular ad hoc networks (VANETs).We analyse the poor performance of AR transactions in such networks and we present a new proposal called coherent, automatic address resolution (CAAR). Our approach inhibits the use of AR transactions and instead increases the usefulness of routing signalling to automatically match the IP and MAC addresses. Through e...

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

  16. TCP-M: Multiflow Transmission Control Protocol for Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available Recent research has indicated that transmission control protocol (TCP in its base form does not perform well in an ad hoc environment. The main reason identified for this behavior involves the ad hoc network dynamics. By nature, an ad hoc network does not support any form of quality of service. The reduction in congestion window size during packet drops, a property of the TCP used to ensure guaranteed delivery, further deteriorates the overall performance. While other researchers have proposed modifying congestion window properties to improve TCP performance in an ad hoc environment, the authors of this paper propose using multiple TCP flows per connection. The proposed protocol reduces the influence of packet drops that occurred in any single path on the overall system performance. The analysis carried out by the authors indicates a significant improvement in overall performance.

  17. ADAPTIVE SERVICE PROVISIONING FOR MOBILE AD HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    Cynthia Jayapal

    2010-09-01

    Full Text Available Providing efficient and scalable service provisioning in Mobile Ad Hoc Network (MANET is a big research challenge. In adaptive service provisioning mechanism an adaptive election procedure is used to select a coordinator node. The role of a service coordinator is crucial in any distributed directory based service provisioning scheme. The existing coordinator election schemes use either the nodeID or a hash function to choose the coordinator. In these schemes, the leader changes are more frequent due to node mobility. We propose an adaptive scheme that makes use of an eligibility factor that is calculated based on the distance to the zone center, remaining battery power and average speed to elect a core node that change according to the network dynamics. We also retain the node with the second highest priority as a backup node. Our algorithm is compared with the existing solution by simulation and the result shows that the core node selected by us is more stable and hence reduces the number of handoffs. This in turn improves the service delivery performance by increasing the packet delivery ratio and decreasing the delay, the overhead and the forwarding cost.

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

  19. Distribution of Information in Ad Hoc Networks

    Science.gov (United States)

    2007-09-01

    The protocols based on the fact that the behavior of stations is determined by the result of listening to channels are known as carrier sense...originally developed by Ericsson, IBM, Intel, Nokia, and Toshiba with the aim of connecting cell phones to other types of equipment. Although the...consumption: In the case of a context where the energy of stations is limited (because they use batteries, for example), it is important to consume the

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

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

  2. Towards a Security Architecture for Vehicular Ad Hoc Networks

    OpenAIRE

    Plößl, Klaus; Nowey, Thomas; Mletzko, Christian

    2006-01-01

    Vehicular ad hoc networks (VANETs) have the potential to increase road safety and comfort. Especially because of the road safety functions, there is a strong demand for security in VANETs. After defining three application categories the paper outlines main security and privacy requirements in VANETs. Next, a security architecture for VANETs (SAV) is proposed that strives to satisfy the requirements. To find mechanisms applicable in the architecture a survey of existing mechanisms is given.

  3. Anomaly detection using clustering for ad hoc networks -behavioral approach-

    Directory of Open Access Journals (Sweden)

    Belacel Madani

    2012-06-01

    Full Text Available Mobile   ad   hoc   networks   (MANETs   are   multi-hop   wireless   networks   ofautonomous  mobile  nodes  without  any  fixed  infrastructure.  In  MANETs,  it  isdifficult to detect malicious nodes because the network topology constantly changesdue  to  node  mobility.  Intrusion  detection  is  the  means  to  identify  the  intrusivebehaviors and provide useful information to intruded systems to respond fast and toavoid  or  reduce  damages.  The  anomaly  detection  algorithms  have  the  advantagebecause  they  can  detect  new  types  of  attacks  (zero-day  attacks.In  this  paper,  wepresent  a  Intrusion  Detection  System  clustering-based  (ID-Cluster  that  fits  therequirement of MANET. This dissertation addresses both routing layer misbehaviorsissues,  with  main  focuses  on  thwarting  routing  disruption  attack  Dynamic  SourceRouting  (DSR.  To  validate  the  research,  a  case  study  is  presented  using  thesimulation with GloMoSum at different mobility levels. Simulation results show thatour  proposed  system  can  achieve  desirable  performance  and  meet  the  securityrequirement of MANET.

  4. Challenges of evidence acquisition in wireless ad-hoc networks

    CSIR Research Space (South Africa)

    Mutanga, MB

    2010-05-01

    Full Text Available , there are various security threats to wireless ad-hoc networks. Examples of such attacks include denial of service (DoS), impersonation, eavesdropping and attacks against routing protocols. Routing protocol attacks include wormhole attacks [10], Rushing attacks... Page 7 of 8 [9] B. J. Nikkel, ‘”Improving evidence acquisition from live network sources”, Digital Investigation Volume 3, Issue 2, June 2006, Pages 89-96 [10] Y. Hu, A. Perrig and D. Johnson, “Packet Leashes: A Defense against Wormhole Attacks...

  5. Facilitating community building in Learning Networks through peer tutoring in ad hoc transient communities

    NARCIS (Netherlands)

    Kester, Liesbeth; Sloep, Peter; Van Rosmalen, Peter; Brouns, Francis; Koné, Malik; Koper, Rob

    2006-01-01

    De volledige referentie is: Kester, L., Sloep, P. B., Van Rosmalen, P., Brouns, F., Koné, M., & Koper, R. (2007). Facilitating Community Building in Learning Networks Through Peer-Tutoring in Ad Hoc Transient Communities. International Journal of Web based Communities, 3(2), 198-205.

  6. Context discovery using attenuated Bloom filters in ad-hoc networks

    NARCIS (Netherlands)

    Liu, F.; Heijenk, Geert; Braun, Torsten; Carle, Georg; Fahmy, Sonia; Koucheryavy, Yevgeni

    A novel approach to performing context discovery in ad-hoc networks based on the use of attenuated Bloom filters is proposed in this paper. In order to investigate the performance of this approach, a model has been developed. This document describes the model and its validation. The model has been

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

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

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

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

    DEFF Research Database (Denmark)

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

    Applications and communication protocols in dynamic ad-hoc networks are exposed to physical limitations imposed by the connectivity relations that result from mobility. Motivated by vehicular freeway scenarios, this paper analyzes a number of important connectivity metrics for instantaneous...... snapshots of stochastic geographic movement patterns under the assumption of a fixed radio range for each node: (1) The node degree, corresponding to the number of single-hop neighbors of a mobile node; (2) The connectivity number, expressing the number of nodes reachable via multi-hop paths of arbitrary...

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

  13. Opinion Impact Models and Opinion Consensus Methods in Ad Hoc Tactical Social Networks

    Directory of Open Access Journals (Sweden)

    Demin Li

    2013-01-01

    Full Text Available Ad hoc social networks are special social networks, such as ad hoc tactical social networks, ad hoc firefighter social networks, and ad hoc vehicular social networks. The social networks possess both the properties of ad hoc network and social network. One of the challenge problems in ad hoc social networks is opinion impact and consensus, and the opinion impact plays a key role for information fusion and decision support in ad hoc social networks. In this paper, consider the impact of physical and logical distance on the opinions of individuals or nodes in heterogeneous social networks; we present a general opinion impact model, discuss the local and global opinion impact models in detail, and point out the relationship between the local opinion impact model and the global opinion impact model. For understanding the opinion impact models easily, we use the general opinion impact model to ad hoc tactical social networks and discuss the opinion impact and opinion consensus for ad hoc tactical social networks in the end.

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

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

  16. A Software-Based Network Infrastructure for Mobile Ad Hoc Data Networking in Support of Small Tactical Units Using the SINCGARS Radio

    Science.gov (United States)

    2006-03-01

    unencrypted challenge text. Proper encryption of the challenge text proves possession of the shared WEP key and earns authentication. Regardless...17 5. Encryption Data secrecy and integrity are called for in the 802.11b standard. As of this writing, Wired Equivalent Privacy ( WEP ) is the...most commonly used encryption technique in 802.11b networks, though the use of Wi-Fi Protected Access (WPA) is growing. Both WEP and WPA provide

  17. LINK STABILITY WITH ENERGY AWARE AD HOC ON DEMAND MULTIPATH ROUTING PROTOCOL IN MOBILE AD HOC NETWORKS

    OpenAIRE

    Senthil Murugan Tamilarasan; Kannan Eswariah

    2013-01-01

    Mobile Ad Hoc Network is one of the wireless network in which mobile nodes are communicate with each other and have no infrastructure because no access point. The MANET protocols can be classified as proactive and reactive routing protocol. The proactive routing protocols, all nodes which participated in network have routing table. This table updated periodically and is used to find the path between source and destination. The reactive routing protocol, nodes are initiate route discovery proc...

  18. Distributed geolocation algorithm in mobile ad hoc networks using received signal strength differences

    Science.gov (United States)

    Guo, Shanzeng; Tang, Helen

    2012-05-01

    Future military wireless communication in a battlefield will be mobile ad hoc in nature. The ability to geolocate and track both friendly forces and enemies is very important in military command and control operations. However, current mobile ad hoc networks (MANET) have no capabilities to geolocate radio emitters that belong to enemy mobile ad hoc networks. This paper presents a distributed geolocation algorithm using received signal strength differences to geolocate enemy radio emitters by leveraging friendly force MANET infrastructure, and proposes a communication protocol for radio emitter geolocation applications. An enemy's radio emitter signal is detected, and its signal strength is measured by the nodes in a friendly mobile ad hoc network. The identity of the enemy radio emitter is extracted from the decoded message header of the medium access control layer. By correlating and associating the enemy's radio emitter identity with its received signal strength, the enemy radio emitter is identified. The enemy's radio emitter identity and its received signal strength are distributed and shared among friendly mobile ad hoc nodes. Using received signal strength differences, a master friendly node can calculate the enemy's radio emitter geolocation, and build a recognized MANET picture (RMP). This MANET picture is then distributed to all friendly nodes for effective command and control operations. An advantage of this method is that mobile ad hoc nodes do not need special RF antennas to geolocate the enemy radio emitter as conventional electronic warfare techniques do. MATLAB-based simulations are presented to evaluate the accuracy and reliability of the proposed distributed geolocation algorithm under different MANET placements.

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

  20. 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. PMID:28496052

  1. The effect of mobility on local service discovery in the Ahoy ad-hoc network system

    NARCIS (Netherlands)

    Goering, P.T.H.; Heijenk, Geert; Haverkort, Boudewijn R.H.M.; Haarman, Robbert

    2007-01-01

    Ahoy, a protocol to perform local service discovery in ad-hoc networks is described in this paper. The protocol has been implemented in a discreteevent simulator to study its performance in case of a multihop mobile ad-hoc network. Especially the effect of mobility on the network load and the

  2. Proof-of-Concept Implementation of the Ahoy Discovery Protocol for Ad-hoc Networks

    NARCIS (Netherlands)

    Haarman, Robbert; Liu, F.; Goering, P.T.H.; Heijenk, Geert

    The context discovery protocol Ahoy has been proposed ear- lier for resource-limited fully-distributed ad-hoc networks. Ahoy has been proven as an efficient context discovery pro- tocol, which generates only little network traffic, in both static and dynamic ad-hoc networks. In this report, we im-

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

  4. A Group Vehicular Mobility Model for Routing Protocol Analysis in Mobile Ad Hoc Network

    OpenAIRE

    Kulkarni, Shrirang Ambaji; Rao, G Raghavendra

    2010-01-01

    Performance of routing protocols in mobile ad-hoc networks is greatly affected by the dynamic nature of nodes, route failures, wireless channels with variable bandwidth and scalability issues. A mobility model imitates the real world movement of mobile nodes and is central component to simulation based studies. In this paper we consider mobility nodes which mimic the vehicular motion of nodes like Manhattan mobility model and City Section mobility model. We also propose a new Group Vehicular ...

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

  6. A novel approach for the fast detection of black holes in mobile ad hoc networks

    OpenAIRE

    SERRAT OLMOS, MANUEL DAVID; Hernández Orallo, Enrique; Cano Escribá, Juan Carlos; Tavares De Araujo Cesariny Calafate, Carlos Miguel; Manzoni, Pietro

    2013-01-01

    Mobile ad hoc networks are infrastructure-less wireless networks that rely on node cooperation to properly work. In this kind of networks, attack detection and reaction is a key issue to the whole network. The most common threat in mobile ad hoc network scenarios consists in the presence of a certain percentage of selfish nodes, which try to reduce the consumption of their own resources to prolong their battery lifetime. Those nodes do not collaborate on forwarding activities, therefore affec...

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

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

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

    Directory of Open Access Journals (Sweden)

    Yung-Shih Chi

    2009-01-01

    Full Text Available 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.

  10. Traffic modeling in the integrated cellular ad hoc network system

    Science.gov (United States)

    Yamanaka, Sachiko; Shimohara, Katsunori

    2005-10-01

    We present the modeling and evaluation in the integrated cellular and ad hoc network system. The system is modeled using queueing theory and we derive some characteristic values. As regards a system model of two cells, M channels are assigned to each cell and a relay station is set in the overlapped area of two cells. New calls in cellA can be relayed to cellB if the channels in cellA are all busy and the mobile stations are in the covered area by a relay station. Handoff calls select the channels of the cell that the number of empty channels are more in the two cells. If the channels of the both cells are all busy, handoff calls can wait in a queue with the capacity Q while mobile stations are in the handoff area. However, so as not to make handoff calls possess channels prior to new calls, we manage it with the method being different from the other researches. This system is more flexible than cellular networks, the bias of traffic gets smaller and it leads to an efficient channel using. We model and evaluate our system by assuming that the dwelling time is distributed with non-exponential distribution as well as exponential one. In numerical results, we compare the characteristic values in our system with those in non-relaying system, see how the characteristic values are affected when the covered area by a relay station changes, and verify the effectiveness of our system.

  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. On the Connectivity and Multihop Delay of Ad Hoc Cognitive Radio Networks

    Science.gov (United States)

    2011-04-01

    K. Jagannathan, and E. Modiano , “Delay analysis of maximum weight scheduling in wireless ad hoc networks,” in Proc. IEEE CISS, March 2009, pp. 389...394. [11] M. J. Neely and E. Modiano , “Capacity and delay tradeoffs for ad hoc mobile networks,” IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1917–1937

  13. Noise-Assisted Concurrent Multipath Traffic Distribution in Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Narun Asvarujanon

    2013-01-01

    Full Text Available 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.

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

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

  16. A survey of performance enhancement of transmission control protocol (TCP in wireless ad hoc networks

    Directory of Open Access Journals (Sweden)

    Mast Noor

    2011-01-01

    Full Text Available Abstract Transmission control protocol (TCP, which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches. A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.

  17. Opportunistic Hybrid Transport Protocol (OHTP) for Cognitive Radio Ad Hoc Sensor Networks.

    Science.gov (United States)

    Bin Zikria, Yousaf; Nosheen, Summera; Ishmanov, Farruh; Kim, Sung Won

    2015-12-15

    The inefficient assignment of spectrum for different communications purposes, plus technology enhancements and ever-increasing usage of wireless technology is causing spectrum scarcity. To address this issue, one of the proposed solutions in the literature is to access the spectrum dynamically or opportunistically. Therefore, the concept of cognitive radio appeared, which opens up a new research paradigm. There is extensive research on the physical, medium access control and network layers. The impact of the transport layer on the performance of cognitive radio ad hoc sensor networks is still unknown/unexplored. The Internet's de facto transport protocol is not well suited to wireless networks because of its congestion control mechanism. We propose an opportunistic hybrid transport protocol for cognitive radio ad hoc sensor networks. We developed a new congestion control mechanism to differentiate true congestion from interruption loss. After such detection and differentiation, we propose methods to handle them opportunistically. There are several benefits to window- and rate-based protocols. To exploit the benefits of both in order to enhance overall system performance, we propose a hybrid transport protocol. We empirically calculate the optimal threshold value to switch between window- and rate-based mechanisms. We then compare our proposed transport protocol to Transmission Control Protocol (TCP)-friendly rate control, TCP-friendly rate control for cognitive radio, and TCP-friendly window-based control. We ran an extensive set of simulations in Network Simulator 2. The results indicate that the proposed transport protocol performs better than all the others.

  18. Interference Drop Scheme: Enhancing QoS Provision in Multi-Hop Ad Hoc Networks

    Science.gov (United States)

    Luo, Chang-Yi; Komuro, Nobuyoshi; Takahashi, Kiyoshi; Kasai, Hiroyuki; Ueda, Hiromi; Tsuboi, Toshinori

    Ad hoc networking uses wireless technologies to construct networks with no physical infrastructure and so are expected to provide instant networking in areas such as disaster recovery sites and inter-vehicle communication. Unlike conventional wired networks services, services in ad hoc networks are easily disrupted by the frequent changes in traffic and topology. Therefore, solutions to assure the Quality of Services (QoS) in ad hoc networks are different from the conventional ones used in wired networks. In this paper, we propose a new queue management scheme, Interference Drop Scheme (IDS) for ad hoc networks. In the conventional queue management approaches such as FIFO (First-in First-out) and RED (Random Early Detection), a queue is usually managed by a queue length limit. FIFO discards packets according to the queue limit, and RED discards packets in an early and random fashion. IDS, on the other hand, manages the queue according to wireless interference time, which increases as the number of contentions in the MAC layer increases. When there are many MAC contentions, IDS discards TCP data packets. By observing the interference time and discarding TCP data packets, our simulation results show that IDS improves TCP performance and reduces QoS violations in UDP in ad hoc networks with chain, grid, and random topologies. Our simulation results also demonstrate that wireless interference time is a better metric than queue length limit for queue management in multi-hop ad hoc networks.

  19. Avoiding Black Hole and Cooperative Black Hole Attacks in Wireless Ad hoc Networks

    OpenAIRE

    Abderrahmane Baadache,; Ali Belmehdi,

    2010-01-01

    In wireless ad hoc networks, the absence of any control on packets forwarding, make these networks vulnerable by various deny of service attacks (DoS). A node, in wireless ad hoc network, counts always on intermediate nodes to send these packets to a given destination node. An intermediate node, which takes part in packets forwarding, may behave maliciously and drop packets which goes through it, instead of forwarding them to the following node. Such behavior is called black hole attack. In t...

  20. An adaptive neural swarm approach for intrusion defense in ad hoc networks

    Science.gov (United States)

    Cannady, James

    2011-06-01

    Wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are being increasingly deployed in critical applications due to the flexibility and extensibility of the technology. While these networks possess numerous advantages over traditional wireless systems in dynamic environments they are still vulnerable to many of the same types of host-based and distributed attacks common to those systems. Unfortunately, the limited power and bandwidth available in WSNs and MANETs, combined with the dynamic connectivity that is a defining characteristic of the technology, makes it extremely difficult to utilize traditional intrusion detection techniques. This paper describes an approach to accurately and efficiently detect potentially damaging activity in WSNs and MANETs. It enables the network as a whole to recognize attacks, anomalies, and potential vulnerabilities in a distributive manner that reflects the autonomic processes of biological systems. Each component of the network recognizes activity in its local environment and then contributes to the overall situational awareness of the entire system. The approach utilizes agent-based swarm intelligence to adaptively identify potential data sources on each node and on adjacent nodes throughout the network. The swarm agents then self-organize into modular neural networks that utilize a reinforcement learning algorithm to identify relevant behavior patterns in the data without supervision. Once the modular neural networks have established interconnectivity both locally and with neighboring nodes the analysis of events within the network can be conducted collectively in real-time. The approach has been shown to be extremely effective in identifying distributed network attacks.

  1. Estimation of System Operating Margin for Different Modulation Schemes in Vehicular Ad-Hoc Networks

    OpenAIRE

    TilotmaYadav; Partha Pratim Bhattacharya

    2013-01-01

    In this paper, system operating margin (SOM) is estimated for vehicular ad-hoc networks in absence and presence of Rayleigh fading. The Ad-hoc IEEE 802.11 model is considered for estimating the signal strength and system operating margin. Rayleigh fading was then simulated and system operating margin are estimated in Rayleigh fading environment for different standard modulation schemes.

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

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

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

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

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

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

  8. Detection and Prevention of MAC Layer Misbehavior for ad hoc Networks

    National Research Council Canada - National Science Library

    Cardenas, Alvaro A; Radosavac, Svetlana; Baras, John S

    2004-01-01

    ...) attacks targeting the MAC layer. In this study we assess the performance of the CSMA/CA scheme and investigate its efficiency with regard to security and information assurance in mobile ad hoc wireless networks...

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

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

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

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

  13. Energy Efficient AODV Routing in CDMA Ad Hoc Networks Using Beamforming

    Directory of Open Access Journals (Sweden)

    Nie Nie

    2006-01-01

    Full Text Available We propose an energy aware on-demand routing protocol for CDMA mobile ad hoc networks, for which improvements in the energy consumption are realized by both introducing an energy-based routing measure and by enhancing the physical layer performance using beamforming. Exploiting the cross-layer interactions between the network and the physical layer leads to a significant improvement in the energy efficiency compared with the traditional AODV protocol, and provides an alternative solution of link breakage detection in traditional AODV protocol. Several performance measures are considered for evaluating the network performance, such as data energy consumption, latency, and overhead energy consumption. An optimum SIR threshold range is determined experimentally for various implementation scenarios.

  14. Fluid-Flow Modeling of a Relay Node in an IEEE 802.11 Wireless Ad-Hoc Network

    NARCIS (Netherlands)

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

    2007-01-01

    Abstract Wireless ad-hoc networks are based on shared medium technology where the nodes arrange access to the medium in a distributed way independent of their current traffic demand. This has the inherent drawback that a node that serves as a relay node for transmissions of multiple neighboring

  15. Fluid-flow modeling of a relay node in an IEEE 802.11 wireless ad-hoc network

    NARCIS (Netherlands)

    F. Roijers (Frank); J.L. van den Berg (Hans); M.R.H. Mandjes (Michel)

    2007-01-01

    textabstractWireless ad-hoc networks are based on shared medium technology where the nodes arrange access to the medium in a distributed way independent of their current traffic demand. This has the inherent drawback that a node that serves as a relay node for transmissions of multiple neighboring

  16. Fluid-flow modeling of a relay node in an IEEE 802.11 wireless ad-hoc network

    NARCIS (Netherlands)

    Roijers, F.; Berg, J.L. van den; Mandjes, M.

    2007-01-01

    Wireless ad-hoc networks are based on shared medium technology where the nodes arrange access to the medium in a distributed way independent of their current traffic demand. This has the inherent drawback that a node that serves as a relay node for transmissions of multiple neighboring nodes is

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

  18. Hierarchical auto-configuration addressing in mobile ad hoc networks (HAAM)

    Science.gov (United States)

    Ram Srikumar, P.; Sumathy, S.

    2017-11-01

    Addressing plays a vital role in networking to identify devices uniquely. A device must be assigned with a unique address in order to participate in the data communication in any network. Different protocols defining different types of addressing are proposed in literature. Address auto-configuration is a key requirement for self organizing networks. Existing auto-configuration based addressing protocols require broadcasting probes to all the nodes in the network before assigning a proper address to a new node. This needs further broadcasts to reflect the status of the acquired address in the network. Such methods incur high communication overheads due to repetitive flooding. To address this overhead, a new partially stateful address allocation scheme, namely Hierarchical Auto-configuration Addressing (HAAM) scheme is extended and proposed. Hierarchical addressing basically reduces latency and overhead caused during address configuration. Partially stateful addressing algorithm assigns addresses without the need for flooding and global state awareness, which in turn reduces the communication overhead and space complexity respectively. Nodes are assigned addresses hierarchically to maintain the graph of the network as a spanning tree which helps in effectively avoiding the broadcast storm problem. Proposed algorithm for HAAM handles network splits and merges efficiently in large scale mobile ad hoc networks incurring low communication overheads.

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

    core network in assigning network address prefixes to gateways in mobile ad-hoc networks. This paper focuses on how CP-nets and the CPN computer tools have been applied in the development of ERDP. A CPN model has been constructed that constitutes a formal executable specification of ERDP. Simulation...

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

  1. A Mobility and Traffic Generation Framework for Modeling and Simulating Ad Hoc Communication Networks

    Directory of Open Access Journals (Sweden)

    Chris Barrett

    2004-01-01

    Full Text Available We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad~hoc networks. Three components of this framework, namely a mobility data generator (MDG, a graph structure generator (GSG and an occlusion modification tool (OMT allow a variety of mobility models to be incorporated into the tool. The MDG module generates positions of transceivers at specified time instants. The GSG module constructs the graph corresponding to the ad hoc network from the mobility data provided by MDG. The OMT module modifies the connectivity of the graph produced by GSG to allow for occlusion effects. With two other modules, namely an activity data generator (ADG which generates packet transmission activities for transceivers and a packet activity simulator (PAS which simulates the movement and interaction of packets among the transceivers, the framework allows the modeling and simulation of ad hoc communication networks. The design of the framework allows a user to incorporate various realistic parameters crucial in the simulation. We illustrate the utility of our framework through a comparative study of three mobility models. Two of these are synthetic models (random waypoint and exponentially correlated mobility proposed in the literature. The third model is based on an urban population mobility modeling tool (TRANSIMS developed at the Los Alamos National Laboratory. This tool is capable of providing comprehensive information about the demographics, mobility and interactions of members of a large urban population. A comparison of these models is carried out by computing a variety of parameters associated with the graph structures generated by the models. There has recently been interest in the structural properties of graphs that arise in real world systems. We examine two aspects of this for the graphs created by the mobility models: change associated with power control (range of

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

  3. Opportunistic Hybrid Transport Protocol (OHTP for Cognitive Radio Ad Hoc Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yousaf Bin Zikria

    2015-12-01

    Full Text Available The inefficient assignment of spectrum for different communications purposes, plus technology enhancements and ever-increasing usage of wireless technology is causing spectrum scarcity. To address this issue, one of the proposed solutions in the literature is to access the spectrum dynamically or opportunistically. Therefore, the concept of cognitive radio appeared, which opens up a new research paradigm. There is extensive research on the physical, medium access control and network layers. The impact of the transport layer on the performance of cognitive radio ad hoc sensor networks is still unknown/unexplored. The Internet’s de facto transport protocol is not well suited to wireless networks because of its congestion control mechanism. We propose an opportunistic hybrid transport protocol for cognitive radio ad hoc sensor networks. We developed a new congestion control mechanism to differentiate true congestion from interruption loss. After such detection and differentiation, we propose methods to handle them opportunistically. There are several benefits to window- and rate-based protocols. To exploit the benefits of both in order to enhance overall system performance, we propose a hybrid transport protocol. We empirically calculate the optimal threshold value to switch between window- and rate-based mechanisms. We then compare our proposed transport protocol to Transmission Control Protocol (TCP-friendly rate control, TCP-friendly rate control for cognitive radio, and TCP-friendly window-based control. We ran an extensive set of simulations in Network Simulator 2. The results indicate that the proposed transport protocol performs better than all the others.

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

  5. Simulation and performance analysis of the AD HOC On-Demand Distance Vector Routing Protocol for tactical mobile ad hoc networks

    OpenAIRE

    Theriot, Tyrone P.

    2000-01-01

    This thesis presents a simulation and analysis of the Ad Hoc On- Demand Distance Vector Routing Protocol (AODV) for mobile ad hoc network (MANET) environments using the Network Simulator 2 (NS2) tool. AODV is being suggested for possible implementation in the Joint Tactical Radio System (JTRS) for the United States military. Utilizing an AODV model resident in NS2, the simulation focuses on key performance parameters that include the packet delivery fraction, routing loss, buffer loss, total ...

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

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

  8. Cognitive routing system for mobile ad hoc networks

    Science.gov (United States)

    Ali, Amjad; Wang, Huiqiang; Feng, Guangsheng

    2011-10-01

    So far the routing protocols that have been proposed and implemented for MANETS fall into three main categories. Reactive, proactive and a third category called hybrid routing protocols. The reactive and proactive routing protocols are designed for special environments and can give better performance if deployed under certain conditions such as network size, whereas the Hybrid Routing protocols tries to combine the features of both types of routing protocols but still this classification doesn't help much in terms of a unified solution towards the routing problem in MANETS. In order to achieve a uniform routing solution a new routing mechanism is needed with the capability of cognition. In this paper we propose the prototype for a new routing mechanism called Cognitive Routing System for MANETS. Our proposal suggests a cognitive system that interacts with the routing system. The cognitive system monitors certain parameters and decisions are taken based on these parameters. We initially suggest that the network size parameter be taken into consideration for selecting whether reactive or proactive routing scheme should be used in the network.

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

  10. Blackboard Rules for Coordinating Context-aware Applications in Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Jean-Marie Jacquet

    2012-08-01

    Full Text Available Thanks to improvements in wireless communication technologies and increasing computing power in hand-held devices, mobile ad hoc networks are becoming an ever-more present reality. Coordination languages are expected to become important means in supporting this type of interaction. To this extent we argue the interest of the Bach coordination language as a middleware that can handle and react to context changes as well as cope with unpredictable physical interruptions that occur in opportunistic network connections. More concretely, our proposal is based on blackboard rules that model declaratively the actions to be taken once the blackboard content reaches a predefined state, but also that manage the engagement and disengagement of hosts and transient sharing of blackboards. The idea of reactiveness has already been introduced in previous work, but as will be appreciated by the reader, this article presents a new perspective, more focused on a declarative setting.

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

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

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

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

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

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

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

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

    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 delay-tolerant networking which exploits the mobility of the nodes by letting them operate as relays according to the

  19. On the Evaluation of Self-Addressing Strategies for Ad-Hoc Networks

    NARCIS (Netherlands)

    de Oliveira Schmidt, R.; Pras, Aiko; Gomes, Reinaldo; Lehnert, Ralf

    Ad-hoc networks are supposed to operate autonomously and, therefore, self-* technologies are fundamental to their deployment. Several of these solutions have been proposed during the last few years, covering most layers and functionalities of networking systems. Addressing is one of the critical

  20. Energy Research and Development Administration Ad Hoc Computer Networking Group: experimental program

    Energy Technology Data Exchange (ETDEWEB)

    Cohen, I.

    1975-03-19

    The Ad Hoc Computer Networking Group was established to investigate the potential advantages and costs of newer forms of remote resource sharing and computer networking. The areas of research and investigation that are within the scope of the ERDA CNG are described. (GHT)

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

  2. Fostering Sociability in Learning Networks through Ad-Hoc Transient Communities

    NARCIS (Netherlands)

    Sloep, Peter

    2008-01-01

    Sloep, P. B. (2009). Fostering Sociability in Learning Networks through Ad-Hoc Transient Communities. In M. Purvis & B. T. R. Savarimuthu (Eds.), Computer-Mediated Social Networking. First International Conference, ICCMSN 2008, LNAI 5322 (pp. 62-75). Heidelberg, Germany: Springer. June, 11-13, 2008,

  3. Distributed Clustering in Cognitive Radio Ad Hoc Networks Using Soft-Constraint Affinity Propagation

    Directory of Open Access Journals (Sweden)

    J.Z. Zhang

    2012-09-01

    Full Text Available Absence of network infrastructure and heterogeneous spectrum availability in cognitive radio ad hoc networks (CRAHNs necessitate the self-organization of cognitive radio users (CRs for efficient spectrum coordination. The cluster-based structure is known to be effective in both guaranteeing system performance and reducing communication overhead in variable network environment. In this paper, we propose a distributed clustering algorithm based on soft-constraint affinity propagation message passing model (DCSCAP. Without dependence on predefined common control channel (CCC, DCSCAP relies on the distributed message passing among CRs through their available channels, making the algorithm applicable for large scale networks. Different from original soft-constraint affinity propagation algorithm, the maximal iterations of message passing is controlled to a relatively small number to accommodate to the dynamic environment of CRAHNs. Based on the accumulated evidence for clustering from the message passing process, clusters are formed with the objective of grouping the CRs with similar spectrum availability into smaller number of clusters while guaranteeing at least one CCC in each cluster. Extensive simulation results demonstrate the preference of DCSCAP compared with existing algorithms in both efficiency and robustness of the clusters.

  4. Pseudo-random dynamic address configuration (PRDAC) algorithm for mobile ad hoc networks

    Science.gov (United States)

    Wu, Shaochuan; Tan, Xuezhi

    2007-11-01

    By analyzing all kinds of address configuration algorithms, this paper provides a new pseudo-random dynamic address configuration (PRDAC) algorithm for mobile ad hoc networks. Based on PRDAC, the first node that initials this network randomly chooses a nonlinear shift register that can generates an m-sequence. When another node joins this network, the initial node will act as an IP address configuration sever to compute an IP address according to this nonlinear shift register, and then allocates this address and tell the generator polynomial of this shift register to this new node. By this means, when other node joins this network, any node that has obtained an IP address can act as a server to allocate address to this new node. PRDAC can also efficiently avoid IP conflicts and deal with network partition and merge as same as prophet address (PA) allocation and dynamic configuration and distribution protocol (DCDP). Furthermore, PRDAC has less algorithm complexity, less computational complexity and more sufficient assumption than PA. In addition, PRDAC radically avoids address conflicts and maximizes the utilization rate of IP addresses. Analysis and simulation results show that PRDAC has rapid convergence, low overhead and immune from topological structures.

  5. Security of Mobile ad-hoc Wireless Networks. A Brief Survey

    Directory of Open Access Journals (Sweden)

    TILIUTE, D. E.

    2007-11-01

    Full Text Available One of the most present issues of computer wireless networks is the security. Comparing with their wired counterpart, the wireless networks not only accentuate some of the well-known security vulnerabilities but they are subject of new and specific ones. Among the existing wireless networks the ad hoc ones are the most exposed to attacks and collusions due to the absence of any centralized control. The most efficient way to ensure the communication secrecy, inclusively for ad hoc wireless networks, is the cryptography. From many reasons, following from specific operating conditions, the employment of asymmetric key techniques and Public Key Infrastructure is not a realistic choice. In the networks with a large number of nodes, as wireless sensor networks, a large number of secret keys are involved in order to ensure the communication secrecy. While dynamicity is one of the essential features of mobile wireless networks, when nodes may leave or join the network and in the absence of a centralized control entity, the management of secret keys is crucial. The paper presents the main aspects of mobile wireless networks security and focuses on the key management issue in ad-hoc wireless networks.

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

  7. Connectivity-Sensed Routing Protocol for Vehicular Ad Hoc Networks: Analysis and Design

    OpenAIRE

    Changle Li; Mengmeng Wang; Lina Zhu

    2015-01-01

    With the fast development of vehicular ad hoc networks (VANETs), various VANET applications, especially safety and infotainment service, have stronger requirements for reliable network connectivity. Intermittent connectivity has become a thorny problem in VANETs, which causes unreliable vehicle to vehicle (V2V) connection due to high vehicle mobility. In this paper, we have studied the network connectivity using a stochastic analysis model and then we prove average intervehicle distance influ...

  8. Connectivity of vehicular ad hoc networks with continuous node distribution patterns

    OpenAIRE

    Jin, W L; Wang, Bruce

    2010-01-01

    The connectivity of vehicular ad hoc networks (VANets) can be affected by the special distribution patterns, usually dependent and non-uniform, of vehicles in a transportation network. In this study, we introduce a new framework for computing the connectivity in a VANet for continuous distribution patterns of communication nodes on a line in a transportation network. Such distribution patterns can be estimated from traffic densities obtained through loop detectors or other detectors. When com...

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

  10. Enabling Secure High-Performance Wireless Ad Hoc Networking

    Science.gov (United States)

    2003-05-29

    Carl Meyer, and Jonathan Oseas. Generating Strong One-Way Functions with Cryptographic Algorithm. 27:5658–5659, 1985. [119] Marshall Kirk McKusick... Culler , and J. D. Tygar. SPINS: Security Protocols for Sensor Networks. In Proceedings of the Seventh Annual International Conference on Mobile...David L. Tennenhouse, Jonathan M. Smith, W. David Sincoskie, David J. Wetherall, and Gary J. Minden. A Survey of Active Network Research. IEEE

  11. Reinforcement learning for routing in cognitive radio ad hoc networks.

    Science.gov (United States)

    Al-Rawi, Hasan A A; Yau, Kok-Lim Alvin; Mohamad, Hafizal; Ramli, Nordin; Hashim, Wahidah

    2014-01-01

    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.

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

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

  14. Dynamic Retransmission Limit Scheme in MAC Layer for Routing in Multihop Ad hoc Networks

    Directory of Open Access Journals (Sweden)

    Rachid El-Azouzi

    2008-05-01

    Full Text Available We consider a wireless ad hoc network with random access channel. We present a model that takes into account topology, routing, random access in MAC layer, and forwarding probability. In this paper, we focus on drawing benefit from the interaction of the MAC (governed by IEEE 802.11 or slotted Aloha and routing by defining a new cross-layer scheme for routing based on the limit number of retransmission. By adjusting dynamically and judiciously this parameter in a saturated network, we have realized that both stability of forwarding queues and average throughput are significantly improved in linear networks with symmetric traffic: a gain of 100% can be reached. While in asymmetric topology network with asymmetric traffic, we achieve a better average delay (resp., throughput for each connection without changing the average throughput (resp., delay. In addition, we show the efficiency of our new scheme in case of multimedia applications with delay constraint. A detailed performance study is presented using analytical and simulation evaluation.

  15. A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Chih-Hao Lin

    2013-01-01

    Full Text Available Multicast routing is an effective way to transmit messages to multiple hosts in a network. However, it is vulnerable to intermittent connectivity property in mobile ad hoc network (MANET especially for multimedia applications, which have some quality of service (QoS requirements. The goal of QoS provisioning is to well organize network resources to satisfy the QoS requirement and achieve good network delivery services. However, there remains a challenge to provide QoS solutions and maintain end-to-end QoS with user mobility. In this paper, a novel penalty adjustment method based on the rough set theory is proposed to deal with path-delay constraints for multicast routing problems in MANETs. We formulate the problem as a constrained optimization problem, where the objective function is to minimize the total cost of the multicast tree subject to QoS constraints. The RPGA is evaluated on three multicast scenarios and compared with two state-of-the-art methods in terms of cost, success rate, and time complexity. The performance analyses show that this approach is a self-adaptive method for penalty adjustment. Remarkably, the method can address a variety of constrained multicast routing problems even though the initial routes do not satisfy all QoS requirements.

  16. Modeling and optimization of Quality of Service routing in Mobile Ad hoc Networks

    Directory of Open Access Journals (Sweden)

    Rafsanjani Marjan Kuchaki

    2016-01-01

    Full Text Available Mobile ad hoc networks (MANETs are a group of mobile nodes that are connected without using a fixed infrastructure. In these networks, nodes communicate with each other by forming a single-hop or multi-hop network. To design effective mobile ad hoc networks, it is important to evaluate the performance of multi-hop paths. In this paper, we present a mathematical model for a routing protocol under energy consumption and packet delivery ratio of multi-hop paths. In this model, we use geometric random graphs rather than random graphs. Our proposed model finds effective paths that minimize the energy consumption and maximizes the packet delivery ratio of the network. Validation of the mathematical model is performed through simulation.

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

  18. 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...... issues in MANETs e.g. mobility and unreliable connections. Specially speaking, 1. We first propose a discrete probabilistic process calculus with which we can model in an MANET that the wireless connection is not reliable, and the network topology may undergo changes. We equip each wireless connection...

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

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

  1. On Trust Establishment in Mobile Ad-Hoc Networks

    Science.gov (United States)

    2002-01-01

    protocols, such as Napster (which uses a centralized index) and Gnutella (which uses request flooding) to more elaborate ones, such as Freenet (which...Proceedings of the 2002 Network and Distributed System Security conference (NDSS02), San Diego, February 2002. [25] Napster , http://www.napster.com [26

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

  3. An adaptive resource control mechanism in multi-hop ad-hoc networks

    NARCIS (Netherlands)

    Yang, Y.; Heijenk, Geert; Haverkort, Boudewijn R.H.M.; Masip Bruin, Xavier; Verchere, Dominique; Tsaoussidis, Vassilis; Yannuzzi, Marcelo

    This paper presents an adaptive resource control mechanism for multi-hop ad-hoc network systems, which avoids bottleneck problems caused by the node-fairness property of IEEE 802.11. In our proposal, the feedback information from the downstream bottleneck, derived from Request-To-Send (RTS) and

  4. A Fuzzy Logic Approach to Beaconing for Vehicular Ad hoc Networks

    NARCIS (Netherlands)

    Ghafoor, Kayhan Zrar; Bakar, Kamalrulnizam Abu; van Eenennaam, Martijn; Khokhar, Rashid Hafeez; Gonzalez, Alberto J.

    Vehicular Ad Hoc Network (VANET) is an emerging field of technology that allows vehicles to communicate together in the absence of fixed infrastructure. The basic premise of VANET is that in order for a vehicle to detect other vehicles in the vicinity. This cognizance, awareness of other vehicles,

  5. A survey of message diffusion portocols in mobile ad hoc networks

    NARCIS (Netherlands)

    Al Hanbali, Ahmad; Ibrahim, M.; Simon, V.; Varga, E.; Carreras, I.

    2008-01-01

    For the last twenty years, mobile communications have experienced an explosive growth. In particular, one area of mobile communication, the Mobile Ad hoc Networks (MANETs), has attracted significant attention due to its multiple applications and its challenging research problems. On the other hand,

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

  7. Ad-hoc transient communities in Learning Networks Connecting and supporting the learner

    NARCIS (Netherlands)

    Brouns, Francis

    2009-01-01

    Brouns, F. (2009). Ad-hoc transient communities in Learning Networks Connecting and supporting the learner. Presentation given for Korean delegation of Chonnam National University and Dankook University (researchers dr. Jeeheon Ryu and dr. Minjeong Kim and a Group of PhD and Master students).

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

  9. Neighbor-Aware Control in Ad Hoc Networks

    Science.gov (United States)

    2002-12-01

    tions as the metric for clusterhead election, which favors relatively stationary nodes to become the clusterheads. We refer to this approach as MOBIC ...MDS if it has the highest degree in the one-hop neighborhood of itself or one of its one-hop neighbors. 141 • MOBIC [18]: In this approach, each node...bility of the heuristics for prolonging the system lifetime by rotating the clusterhead roles between network nodes. MOBIC and Lowest ID perform the

  10. Space-Time Processing for Tactical Mobile Ad Hoc Networks

    Science.gov (United States)

    2010-05-01

    results quantifying the impact of fading on average symbol and error probability (SEP/ BEP ) are available for various modulation schemes. However, in slow...interference and channel uncertainty issues have a tremendous impact 1. REPORT DATE (DD-MM-YYYY) 4. TITLE AND SUBTITLE 27-08-2010 13. SUPPLEMENTARY...tremendous impact on end-to-end system performance. Tactical applications pose unique requirements for the network, including decentralized control to

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

  12. Dynamic Agent Classification and Tracking Using an Ad Hoc Mobile Acoustic Sensor Network

    Directory of Open Access Journals (Sweden)

    Friedlander David

    2003-01-01

    Full Text Available Autonomous networks of sensor platforms can be designed to interact in dynamic and noisy environments to determine the occurrence of specified transient events that define the dynamic process of interest. For example, a sensor network may be used for battlefield surveillance with the purpose of detecting, identifying, and tracking enemy activity. When the number of nodes is large, human oversight and control of low-level operations is not feasible. Coordination and self-organization of multiple autonomous nodes is necessary to maintain connectivity and sensor coverage and to combine information for better understanding the dynamics of the environment. Resource conservation requires adaptive clustering in the vicinity of the event. This paper presents methods for dynamic distributed signal processing using an ad hoc mobile network of microsensors to detect, identify, and track targets in noisy environments. They seamlessly integrate data from fixed and mobile platforms and dynamically organize platforms into clusters to process local data along the trajectory of the targets. Local analysis of sensor data is used to determine a set of target attribute values and classify the target. Sensor data from a field test in the Marine base at Twentynine Palms, Calif, was analyzed using the techniques described in this paper. The results were compared to "ground truth" data obtained from GPS receivers on the vehicles.

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

  14. Simulation and experimental testbed for adaptive video streaming in ad hoc networks

    OpenAIRE

    Gonzalez-Martinez, Santiago Renan; Castellanos Hernández, Wilder Eduardo; Guzman Castillo, Paola Fernanda; Arce Vila, Pau; Guerri Cebollada, Juan Carlos

    2016-01-01

    This paper presents a performance evaluation of the scalable video streaming over mobile ad hoc networks. In particular, we focus on the rate-adaptive method for streaming scalable video (H.264/SVC). For effective adaptation a new cross-layer routing protocol is introduced. This protocol provides an efficient algorithm for available bandwidth estimation. With this information, the video source adjusts its bit rate during the video transmission according to the network state. We also propose a...

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

  16. Efficient data transfer in mobile ad-hoc network using OPSM for disaster response applications

    Directory of Open Access Journals (Sweden)

    V. Bhanumathi

    2015-06-01

    Full Text Available The nodes in mobile ad-hoc network depend on battery for its power. Therefore, effective utilization of energy is necessary for efficient transfer of data between the persons involved in rescue without connection termination in disaster situation. An Optimal Path Selection Model (OPSM is proposed to achieve this. First, routes are identified with the links having high power ratio and link duration. The path selection aims at reducing the number of node failures which in turn obtains energy saving. Then, the source will select a node-disjoint path based on energy and hop for data transfer and store the remaining paths in cache. Priority based path maintenance is also proposed for the selection of routes from cache based on remaining energy if the primary selection fails. Path selection and maintenance extend the network lifetime by reducing the energy usage in transmission. Simulation results revealed that OPSM achieves 64% and 50% reduction in energy consumption compared to Dynamic Source Routing (DSR and Multipath DSR (MDSR. The number of path breakages is also 11 times and 5.5 times lesser than DSR and MDSR. Thus, it can be said that OPSM is a better choice for optimal path selection for performance enhancement by saving energy and improving lifetime.

  17. Self-organization of nodes in mobile ad hoc networks using evolutionary games and genetic algorithms

    Directory of Open Access Journals (Sweden)

    Janusz Kusyk

    2011-07-01

    Full Text Available In this paper, we present a distributed and scalable evolutionary game played by autonomous mobile ad hoc network (MANET nodes to place themselves uniformly over a dynamically changing environment without a centralized controller. A node spreading evolutionary game, called NSEG, runs at each mobile node, autonomously makes movement decisions based on localized data while the movement probabilities of possible next locations are assigned by a forced-based genetic algorithm (FGA. Because FGA takes only into account the current position of the neighboring nodes, our NSEG, combining FGA with game theory, can find better locations. In NSEG, autonomous node movement decisions are based on the outcome of the locally run FGA and the spatial game set up among it and the nodes in its neighborhood. NSEG is a good candidate for the node spreading class of applications used in both military tasks and commercial applications. We present a formal analysis of our NSEG to prove that an evolutionary stable state is its convergence point. Simulation experiments demonstrate that NSEG performs well with respect to network area coverage, uniform distribution of mobile nodes, and convergence speed.

  18. A Novel MAC Protocol for QoS in Ad Hoc Wireless Networks

    Science.gov (United States)

    Takahashi, Kiyoshi; Terasawa, Takuya; Tsuboi, Toshinori

    We propose a medium access control (MAC) protocol for real-time applications in one-hop ad-hoc wireless networks. It is a distributed mechanism that takes account of priority and has a bounded packet delay. Nodes use energy signals to contend for the right to access the channel. Nodes, which have a packet to transmit, send energy signals or listen to the channel based on their binary frame. The node that has sent energy signals and has not heard any energy signals wins the right to access the channel. We use two schemes to determine the binary frame: at the beginning of a session, a node determines it based on its priority level and a random number; after successful transmission, based on a count of successful packet transmissions. With the first scheme, in order to reduce contention losses, the nodes that had won the right to access the channel but failed in transmission have priority over the other nodes. With the second scheme, the node that has the largest count, the one that has been waiting the longest, can send a packet without risking collision. The protocol provides higher probability of successful transmission and a limit on maximum packet delay. An analysis of the protocol provides conditions for the protocol to be stable. We evaluate the performance of the proposed protocol using simulations of a network with a mixed population of data and real-time nodes, whose source is constant bit rate (CBR) and a two state Markov on/off process.

  19. Spectrum Sharing between Cooperative Relay and Ad-hoc Networks: Dynamic Transmissions under Computation and Signaling Limitations

    CERN Document Server

    Sun, Yin; Li, Yunzhou; Zhou, Shidong; Xu, Xibin

    2010-01-01

    This paper studies a spectrum sharing scenario between an uplink cognitive relay network (CRN) and some nearby low power ad-hoc networks. In particular, the dynamic resource allocation of the CRN is analyzed, which aims to minimize the average interfering time with the ad-hoc networks subject to a minimal average uplink throughput constraint. A long term average rate formula is considered, which is achieved by a half-duplex decode-and-forward (DF) relay strategy with multi-channel transmissions. Both the source and relay are allowed to queue their data, by which they can adjust the transmission rates flexibly based on sensing and predicting the channel state and ad-hoc traffic. The dynamic resource allocation of the CRN is formulated as a non-convex stochastic optimization problem. By carefully analyzing the optimal transmission time scheduling, it is reduced to a stochastic convex optimization problem and solved by the dual optimization method. The signaling and computation processes are designed carefully t...

  20. Convergence of Secure Vehicular Ad-Hoc Network and Cloud in Internet of Things

    DEFF Research Database (Denmark)

    Kulkarni, Nandkumar P.; Prasad, Neeli R.; Lin, Tao

    2016-01-01

    of the challenges in VANET are less computing capability, smaller onboard storage, safety, reliability, etc. Among the number of solutions proposed recently, Vehicular Cloud Computing (VCC) is one of them. VCC is a technology that provides on-demand services namely Software-as-a-Service (SaaS), Storage......Vehicular Ad-hoc Network (VANET) is a highly mobile autonomous and self-organizing network of vehicles. VANET is a particular case of Mobile Ad-hoc Network (MANET). With the recent advances in the arena of Information and Communication Technology (ICT) and computing, the researchers have envisioned......-as-a-Service (STaaS), Platform-as-a-Service (PaaS), etc. over the internet via Cloud vendors....

  1. Secure, Redundant, and Fully Distributed Key Management Scheme for Mobile Ad Hoc Networks: An Analysis

    Directory of Open Access Journals (Sweden)

    Joshi Deepti

    2005-01-01

    Full Text Available Security poses a major challenge in ad hoc networks today due to the lack of fixed or organizational infrastructure. This paper proposes a modification to the existing "fully distributed certificate authority" scheme for ad hoc networks. In the proposed modification, redundancy is introduced by allocating more than one share to each node in order to increase the probability of creating the certificate for a node in a highly mobile network. A probabilistic analysis is carried out to analyze the trade-offs between the ease of certificate creation and the security provided by the proposed scheme. The analysis carried out from the intruder's perspective suggests that in the worst-case scenario, the intruder is just "one node" away from a legitimate node in compromising the certificate. The analysis also outlines the parameter selection criteria for a legitimate node to maintain a margin of advantage over an intruder in creating the certificate.

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

  3. Real Time Semantic Interoperability in AD HOC Networks of Geospatial Data Sources: Challenges, Achievements and Perspectives

    Science.gov (United States)

    Mostafavi, M. A.; Bakillah, M.

    2012-07-01

    Recent advances in geospatial technologies have made available large amount of geospatial data. Meanwhile, new developments in Internet and communication technologies created a shift from isolated geospatial databases to ad hoc networks of geospatial data sources, where data sources can join or leave the network, and form groups to share data and services. However, effective integration and sharing of geospatial data among these data sources and their users are hampered by semantic heterogeneities. These heterogeneities affect the spatial, temporal and thematic aspects of geospatial concepts. There have been many efforts to address semantic interoperability issues in the geospatial domain. These efforts were mainly focused on resolving heterogeneities caused by different and implicit representations of the concepts. However, many approaches have focused on the thematic aspects, leaving aside the explicit representation of spatial and temporal aspects. Also, most semantic interoperability approaches for networks have focused on automating the semantic mapping process. However, the ad hoc network structure is continuously modified by source addition or removal, formation of groups, etc. This dynamic aspect is often neglected in those approaches. This paper proposes a conceptual framework for real time semantic interoperability in ad hoc networks of geospatial data sources. The conceptual framework presents the fundamental elements of real time semantic interoperability through a hierarchy of interrelated semantic states and processes. Then, we use the conceptual framework to set the discussion on the achievements that have already been made, the challenges that remain to be addressed and perspectives with respect to these challenges.

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

  5. On interaction between MAC and transport layers for media streaming in 802.11 ad hoc networks

    Science.gov (United States)

    Nahm, Kitae; Helmy, Ahmed; Kuo, C.-C. Jay

    2004-10-01

    We examine the validity of TCP-friendliness and the utility of equation-based congestion control as a mean for the media streaming service in 802.11 multi-hop networks. Our investigation is motivated by the recent findings of the bandwidth-delay product of 802.11 multi-hop networks via intensive computer simulations. We show that TCP behavior in 802.11 multi-hop networks is generally inefficient and unstable because the standard TCP is too aggressive considering the low bandwidth-delay product of 802.11 networks. We introduce the concept of the `fractional window' mechanism (which resembles the stop-and-go protocol) for TCP, and show that the modified TCP is more stable and efficient while outperforming the legacy TCP in 802.11-based ad hoc networks. Finally, we show that many of the typical problems of TCP protocol (performance, network fairness, and TCP-friendliness) in 802.11 networks can be solved simply by increasing the bandwidth-delay product of 802.11 networks without any TCP modification. Based on this observation, we conclude that the assumption of the ideal steady-state TCP behavior is generally invalid in 802.11 multi-hop networking environment, and that congestion control based on TCP-friendly equation can hardly provide TCP-fair throughput and smoothness in 802.11 multi-hop networking environment.

  6. Cross-layer protocols optimized for real-time multimedia services in energy-constrained mobile ad hoc networks

    Science.gov (United States)

    Hortos, William S.

    2003-07-01

    Mobile ad hoc networking (MANET) supports self-organizing, mobile infrastructures and enables an autonomous network of mobile nodes that can operate without a wired backbone. Ad hoc networks are characterized by multihop, wireless connectivity via packet radios and by the need for efficient dynamic protocols. All routers are mobile and can establish connectivity with other nodes only when they are within transmission range. Importantly, ad hoc wireless nodes are resource-constrained, having limited processing, memory, and battery capacity. Delivery of high quality-ofservice (QoS), real-time multimedia services from Internet-based applications over a MANET is a challenge not yet achieved by proposed Internet Engineering Task Force (IETF) ad hoc network protocols in terms of standard performance metrics such as end-to-end throughput, packet error rate, and delay. In the distributed operations of route discovery and maintenance, strong interaction occurs across MANET protocol layers, in particular, the physical, media access control (MAC), network, and application layers. The QoS requirements are specified for the service classes by the application layer. The cross-layer design must also satisfy the battery-limited energy constraints, by minimizing the distributed power consumption at the nodes and of selected routes. Interactions across the layers are modeled in terms of the set of concatenated design parameters including associated energy costs. Functional dependencies of the QoS metrics are described in terms of the concatenated control parameters. New cross-layer designs are sought that optimize layer interdependencies to achieve the "best" QoS available in an energy-constrained, time-varying network. The protocol design, based on a reactive MANET protocol, adapts the provisioned QoS to dynamic network conditions and residual energy capacities. The cross-layer optimization is based on stochastic dynamic programming conditions derived from time-dependent models of

  7. An artificial immune system for securing mobile ad hoc networks against intrusion attacks

    Science.gov (United States)

    Hortos, William S.

    2003-08-01

    To mitigate the problem of intrusion attacks by malicious nodes in mobile ad hoc networks (MANETs), security attributes and quantifiable trust levels, unique to the MANET's transient, self-organizing topology, augment or replace traditional protocol metrics of throughput, packet delay and hop-count in the ad hoc route discovery procedures. The new features are unique to the candidate security protocol, which views security as a quality metric to improve the relevance of the routes discovered by established reactive ad hoc routing protocols. Attributes of a secure route are identified in order to define the appropriate metrics to quantify the "level of security" associated with the protocol messaging and the detection of malicious activities by some intrusive nodes. A state vector of features and metrics based on the published Secure Routing Protocol (SRP) for MANETs is constructed to encode network security characteristics. This route discovery protocol mitigates the detrimental effects of various malicious behaviors to provide trustworthy connectivity information. The protocol ensures that fabricated, compromised, or replayed route replies would either be rejected or never reach the querying source node. In this paper, the pattern of values, taken by the state vector of the SRP features in the route request, discovery and reply operations, are analyzed to detect evidence of intrusion attacks by malicious nodes that could lead to denial of service and network shutdown. The pattern analysis applies a technique based on negative selection found in natural immune systems that can detect extraneous patterns in the (nonself) space that is the complement of vector values associated with correct route discovery and route maintenance. The immune system is well-suited to the distributed nature of the MANET. It does not rely on a central controller, but instead uses a distributed detection and response mechanism in order to respond to foreign invaders, mirroring the

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

    Science.gov (United States)

    Zareei, Mahdi; Islam, A K M Muzahidul; Baharun, Sabariah; Vargas-Rosales, Cesar; Azpilicueta, Leyre; Mansoor, Nafees

    2017-09-16

    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.

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

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

    Science.gov (United States)

    Islam, A. K. M. Muzahidul; Baharun, Sabariah; Mansoor, Nafees

    2017-01-01

    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. PMID:28926952

  11. Using Apriori algorithm to prevent black hole attack in mobile Ad hoc networks

    Directory of Open Access Journals (Sweden)

    Seyed Javad Mirabedini

    2013-01-01

    Full Text Available A mobile ad hoc network (MANET is considered as an autonomous network, which consists of mobile nodes, which communicate with each other over wireless links. When there is no fixed infrastructure, nodes have to cooperate in order to incorporate the necessary network functionality. Ad hoc on Demand Distance Vector (AODV protocol is one of the primary principal routing protocols implemented in Ad hoc networks. The security of the AODV protocol is threaded by a specific kind of attack called ‘Black Hole’ attack. This paper presents a technique to prevent the Black hole attack by implementing negotiation with neighbors who claim to maintain a route to destination. Negotiation process is strengthen by apriori method to judge about suspicious node. Apriori algorithm is an effective association rule mining method with relatively low complexity, which is proper for MANETs. To achieve more improvement, fuzzy version of ADOV is used. The simulation results indicate that the proposed protocol provides more securable routing and also more efficiency in terms of packet delivery, overhead and detection rate than the conventional AODV and fuzzy AODV in the presence of Black hole attacks.

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

  13. Unsupervised algorithms for intrusion detection and identification in wireless ad hoc sensor networks

    Science.gov (United States)

    Hortos, William S.

    2009-05-01

    In previous work by the author, parameters across network protocol layers were selected as features in supervised algorithms that detect and identify certain intrusion attacks on wireless ad hoc sensor networks (WSNs) carrying multisensor data. The algorithms improved the residual performance of the intrusion prevention measures provided by any dynamic key-management schemes and trust models implemented among network nodes. The approach of this paper does not train algorithms on the signature of known attack traffic, but, instead, the approach is based on unsupervised anomaly detection techniques that learn the signature of normal network traffic. Unsupervised learning does not require the data to be labeled or to be purely of one type, i.e., normal or attack traffic. The approach can be augmented to add any security attributes and quantified trust levels, established during data exchanges among nodes, to the set of cross-layer features from the WSN protocols. A two-stage framework is introduced for the security algorithms to overcome the problems of input size and resource constraints. The first stage is an unsupervised clustering algorithm which reduces the payload of network data packets to a tractable size. The second stage is a traditional anomaly detection algorithm based on a variation of support vector machines (SVMs), whose efficiency is improved by the availability of data in the packet payload. In the first stage, selected algorithms are adapted to WSN platforms to meet system requirements for simple parallel distributed computation, distributed storage and data robustness. A set of mobile software agents, acting like an ant colony in securing the WSN, are distributed at the nodes to implement the algorithms. The agents move among the layers involved in the network response to the intrusions at each active node and trustworthy neighborhood, collecting parametric values and executing assigned decision tasks. This minimizes the need to move large amounts

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

  15. A Comprehensive study of a New Multipath Energy Aware Routing Protocol for Mobile Ad-hoc Networks

    OpenAIRE

    Chettibi, Saloua

    2009-01-01

    S. Chettibi, M. Benmohammed, "A comprehensive study of a new multipath energy aware routing protocol for mobile ad-hoc networks"; International Conference on Systems and Information Processing, ICSIP'09, May 02 – 04, 2009, Guelma, Algeria; Maximizing network lifetime is a very challenging issue in routing protocol design for Mobile Ad-hoc NETworks (MANETs), since mobile nodes are powered by limited-capacity batteries. Furthermore, replacing or recharging batteries is often impossible in criti...

  16. Cognitive Forwarding Control in Wireless Ad-Hoc Networks with Slow Fading Channels

    OpenAIRE

    Hakami, Vesal; Dehghan, Mehdi

    2014-01-01

    We propose a decentralized stochastic control solution for the broadcast message dissemination problem in wireless ad hoc networks with slow fading channels. We formulate the control problem as a dynamic robust game which is well justified by two key observations; first, the shared nature of the wireless medium which inevitably cross-couples the nodes' forwarding decisions, thus binding them together as strategic players; second, the stochastic dynamics associated with the link qualities whic...

  17. Improving Data Dissemination in Multi-Hop Cognitive Radio Ad-Hoc Networks

    OpenAIRE

    Rehmani, Mubashir Husain; Carneiro Viana, Aline; Khalife, Hicham; Fdida, Serge

    2011-01-01

    International audience; In this paper, we present SURF, a distributed channel selection strategy for efficient data dissemination in multi-hop cognitive radio ad-hoc networks (CRNs). SURF classifies the available channels on the basis of primary radio unoccupancy and the number of cognitive radio neighbors using the channels. Through extensive NS-2 simulations, we compare the performance of SURF with three related approaches. Simulation results confirm that SURF is effective in selecting the ...

  18. Secure Neighborhood Discovery: A Fundamental Element for Mobile Ad Hoc Networking

    OpenAIRE

    Papadimitratos, Panagiotis; Poturalski, Marcin; Schaller, Patrick; Lafourcade, Pascal; Basin, David; Capkun, Srdjan; Hubaux, Jean-Pierre

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

  19. Building hierarchical public key infrastructures in mobile ad-hoc networks

    OpenAIRE

    Satizábal Echavarría, Isabel Cristina; Forné Muñoz, Jorge; Hernández Serrano, Juan; Pegueroles Vallés, Josep R.

    2006-01-01

    Dynamism of mobile ad-hoc networks implies changing trust relationships among their nodes that can be established using peer-to-peer PKIs. Here, certification paths can be built although part of the infrastructure is temporarily unreachable because there can be multiple paths between two entities but certification path discovery is difficult since all the options do not lead to the target entity. On the contrary, in hierarchical PKIs, there is only one path between two entities and certificat...

  20. A collaborative protocol for anonymous reporting in vehicular ad hoc networks

    OpenAIRE

    Tripp Barba, Carolina; Urquiza Aguiar, Luis; Aguilar Igartua, Mónica; Parra Arnau, Javier; Rebollo Monedero, David; Forné Muñoz, Jorge; Pallarès Segarra, Esteve

    2013-01-01

    Vehicular ad hoc networks (VANETs) have emerged to leverage the power of modern communication technologies, applied to both vehicles and infrastructure. Allowing drivers to report traffic accidents and violations through the VANET may lead to substantial improvements in road safety. However, being able to do so anonymously in order to avoid personal and professional repercussions will undoubtedly translate into user acceptance. The main goal of this work is to propose a new collaborative prot...

  1. Secured Message Transmission in Mobile AD HOC Networks through Identification and Removal of Byzantine Failures

    OpenAIRE

    V Anitha; Akilandeswari, Dr. J.

    2011-01-01

    The emerging need for mobile ad hoc networks and secured data transmission phase is of crucial importance depending upon the environments like military. In this paper, a new way to improve the reliability of message transmission is presented. In the open collaborative MANET environment, any node can maliciously or selfishly disrupt and deny communication of other nodes. Dynamic changing topology makes it hard to determine the adversary nodes that affect the communication in MANET. An SMT prot...

  2. Efficient data transfer in mobile ad-hoc network using OPSM for disaster response applications

    OpenAIRE

    Bhanumathi, V.; R. Dhanasekaran

    2015-01-01

    The nodes in mobile ad-hoc network depend on battery for its power. Therefore, effective utilization of energy is necessary for efficient transfer of data between the persons involved in rescue without connection termination in disaster situation. An Optimal Path Selection Model (OPSM) is proposed to achieve this. First, routes are identified with the links having high power ratio and link duration. The path selection aims at reducing the number of node failures which in turn obtains energy s...

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

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

  5. A secure 3-way routing protocols for intermittently connected mobile ad hoc networks.

    Science.gov (United States)

    Sekaran, Ramesh; Parasuraman, Ganesh Kumar

    2014-01-01

    The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.

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

  7. A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Ramesh Sekaran

    2014-01-01

    Full Text Available The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET. The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.

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

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

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

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

  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. Adaptive Control Parameters for Dispersal of Multi-Agent Mobile Ad Hoc Network (MANET) Swarms

    Energy Technology Data Exchange (ETDEWEB)

    Kurt Derr; Milos Manic

    2013-11-01

    A mobile ad hoc network is a collection of independent nodes that communicate wirelessly with one another. This paper investigates nodes that are swarm robots with communications and sensing capabilities. Each robot in the swarm may operate in a distributed and decentralized manner to achieve some goal. This paper presents a novel approach to dynamically adapting control parameters to achieve mesh configuration stability. The presented approach to robot interaction is based on spring force laws (attraction and repulsion laws) to create near-optimal mesh like configurations. In prior work, we presented the extended virtual spring mesh (EVSM) algorithm for the dispersion of robot swarms. This paper extends the EVSM framework by providing the first known study on the effects of adaptive versus static control parameters on robot swarm stability. The EVSM algorithm provides the following novelties: 1) improved performance with adaptive control parameters and 2) accelerated convergence with high formation effectiveness. Simulation results show that 120 robots reach convergence using adaptive control parameters more than twice as fast as with static control parameters in a multiple obstacle environment.

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

  15. 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. PMID:25879066

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

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

    Science.gov (United States)

    Houli, Duan; Zhiheng, Li; Yi, Zhang

    2010-12-01

    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.

  18. Emergency Situation Prediction Mechanism: A Novel Approach for Intelligent Transportation System Using Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    P. Ganeshkumar

    2015-01-01

    Full Text Available In Indian four-lane express highway, millions of vehicles are travelling every day. Accidents are unfortunate and frequently occurring in these highways causing deaths, increase in death toll, and damage to infrastructure. A mechanism is required to avoid such road accidents at the maximum to reduce the death toll. An Emergency Situation Prediction Mechanism, a novel and proactive approach, is proposed in this paper for achieving the best of Intelligent Transportation System using Vehicular Ad Hoc Network. ESPM intends to predict the possibility of occurrence of an accident in an Indian four-lane express highway. In ESPM, the emergency situation prediction is done by the Road Side Unit based on (i the Status Report sent by the vehicles in the range of RSU and (ii the road traffic flow analysis done by the RSU. Once the emergency situation or accident is predicted in advance, an Emergency Warning Message is constructed and disseminated to all vehicles in the area of RSU to alert and prevent the vehicles from accidents. ESPM performs well in emergency situation prediction in advance to the occurrence of an accident. ESPM predicts the emergency situation within 0.20 seconds which is comparatively less than the statistical value. The prediction accuracy of ESPM against vehicle density is found better in different traffic scenarios.

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

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

  1. An Optimal Spectrum Handoff Scheme for Cognitive Radio Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    DUAN, J.

    2011-08-01

    Full Text Available Spectrum handoff procedures occur when the primary users appear in the licensed band temporary occupied by the cognitive radio (CR users and aim to help the CR users to vacate the spectrum rapidly and find available channel to resume the transmission. However, a spectrum handoff scheme that comprehensively considers channel selection, handoff decision as well as space domain handoff is yet undeveloped. In this paper we present a complete optimal spectrum handoff scheme for cognitive radio mobile ad hoc networks. First, we design a spectrum selection mechanism to allow CR users optimally choose the appropriate channel. The spectrum idleness prediction algorithm is utilized based on developing a cooperative spectrum searching approach. Through combining the estimated transmission time, the PU appearance probability and the mean spectrum availability time are integrated to develop the optimal spectrum handoff scheme. Moreover, as one part of the proposed scheme, a geo-location approach is utilized to deal with the space domain handoff. The complete scheme is evaluated through a comprehensive simulation study, and results reveal significant improvements in handoff times and transmission efficiency over conventional approaches.

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

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

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

  5. Decentralized cooperative spectrum sensing for ad-hoc disaster relief network clusters

    DEFF Research Database (Denmark)

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

    2010-01-01

    been the target of intensive research, of which 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, the use of spectrum sensing...... through a framework, which allows gauging the accuracy of multi narrow-band spectrum sensing cooperative schemes as well as to gauge the error in the estimation of each of the channels un-occupancy. Through that evaluation it is shown that the proposed decentralized scheme performance reaches...

  6. Capacity and performance study of IEEE 802.11e in WLANs and ad hoc networks

    OpenAIRE

    Mjøberg, Frank Roar

    2007-01-01

    This master thesis focuses on the IEEE 802.11e Enhanced Distribution Channel Access (EDCA). The IEEE 802.11e protocol became an IEEE standard in November 2005 and is a very popular research topic. Even though the protocol has been tested for faults and errors a long time there are still research topics to explore. This thesis will try to answer some of those topics. The main topic in this thesis is how the IEEE 802.11e MAC operates in a multihop ad hoc network. We discuss and evaluated th...

  7. Efficient Techniques to Detect the Various Attacks in Ad-Hoc Network

    OpenAIRE

    Rakesh Kumar Sahu; Dr. Narendra S. Chaudhari

    2012-01-01

    This paper is mainly focused on Denial of Service (DoS) attack, where a server or a node cannot give service to the other nodes as it is under an attack. There are various attacks in the Ad hoc network but our paper is mainly focused on two types of DoS attacks viz SYN-Flooding and Worm-Hole attacks. How we can detect any one of attacks is addressed in this paper. We have discussed the CPU and memory utilization during the attack. We have given two separate algorithms for each attack and a...

  8. Location-Based Services in Vehicular Networks

    Science.gov (United States)

    Wu, Di

    2013-01-01

    Location-based services have been identified as a promising communication paradigm in highly mobile and dynamic vehicular networks. However, existing mobile ad hoc networking cannot be directly applied to vehicular networking due to differences in traffic conditions, mobility models and network topologies. On the other hand, hybrid architectures…

  9. Throughput-Delay-Reliability Tradeoff with ARQ in Wireless Ad Hoc Networks

    CERN Document Server

    Vaze, Rahul

    2010-01-01

    Delay-reliability (D-R), and throughput-delay-reliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repeat request (ARQ) on each hop. The delay constraint is modeled by assuming that each packet is allowed at most $D$ retransmissions end-to-end, and the reliability is defined as the probability that the packet is successfully decoded in at most $D$ retransmissions. The throughput of the ad hoc network is characterized by the transmission capacity, which is defined to be the maximum allowable density of transmitting nodes satisfying a per transmitter receiver rate, and an outage probability constraint, multiplied with the rate of transmission and the success probability. Given an end-to-end retransmission constraint of $D$, the optimal allocation of the number of retransmissions allowed at each hop is derived that maximizes a lower bound on the transmission capacity. Optimizing over the number of hops, single hop transmission is shown to be opti...

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

  11. An Energy-Efficient and Robust Multipath Routing Protocol for Cognitive Radio Ad Hoc Networks.

    Science.gov (United States)

    Singh, Kishor; Moh, Sangman

    2017-09-04

    Routing in cognitive radio ad hoc networks (CRAHNs) is a daunting task owing to dynamic topology, intermittent connectivity, spectrum heterogeneity, and energy constraints. Other prominent aspects such as channel stability, path reliability, and route discovery frequency should also be exploited. Several routing protocols have been proposed for CRAHNs in the literature. By stressing on one of the aspects more than any other, however, they do not satisfy all requirements of throughput, energy efficiency, and robustness. In this paper, we propose an energy-efficient and robust multipath routing (ERMR) protocol for CRAHNs by considering all prominent aspects including residual energy and channel stability in design. Even when the current routing path fails, the alternative routing path is immediately utilized. In establishing primary and alternative routing paths, both residual energy and channel stability are exploited simultaneously. Our simulation study shows that the proposed ERMR outperforms the conventional protocol in terms of network throughput, packet delivery ratio, energy consumption, and end-to-end delay.

  12. An Analysis Framework for Mobility Metrics in Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Xu Sanlin

    2007-01-01

    Full Text Available Mobile ad hoc networks (MANETs have inherently dynamic topologies. Under these difficult circumstances, it is essential to have some dependable way of determining the reliability of communication paths. Mobility metrics are well suited to this purpose. Several mobility metrics have been proposed in the literature, including link persistence, link duration, link availability, link residual time, and their path equivalents. However, no method has been provided for their exact calculation. Instead, only statistical approximations have been given. In this paper, exact expressions are derived for each of the aforementioned metrics, applicable to both links and paths. We further show relationships between the different metrics, where they exist. Such exact expressions constitute precise mathematical relationships between network connectivity and node mobility. These expressions can, therefore, be employed in a number of ways to improve performance of MANETs such as in the development of efficient algorithms for routing, in route caching, proactive routing, and clustering schemes.

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

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  14. Analytical modeling of address allocation protocols in wireless ad hoc networks

    Directory of Open Access Journals (Sweden)

    Ahmad Radaideh

    2011-09-01

    Full Text Available Detailed descriptions of Internet Protocol Address Assignment (IPAA and Mobile Ad Hoc Network Configuration (MANETconf are presented and state diagrams for their behavior are constructed. Formulae for the expected latency and communication overhead of the IPAA protocol are derived, with the results being given as functions of the number of nodes in the network with message loss rate, contention window size, coverage ratio, and the counter threshold as parameters. Simulation is used to validate the analytical results and also to compare performance of the two protocols. The results show that the latency and communication overhead for MANETconf are significantly higher than the measures of the IPAA protocol. Results of extensive sensitivity analyses for the IPAA protocol are also presented.

  15. Potentials, Limitations and Applications of long-term and mobile ad-hoc Wireless Sensor Networks for Environmental Monitoring

    Science.gov (United States)

    Bumberger, Jan; Mollenhauer, Hannes; Lapteva, Yulia; Hutschenreuther, Tino; Toepfer, Hannes; Dietrich, Peter

    2014-05-01

    To characterize environmental systems it is necessary to identify and describe processes with suitable methods. Environmental systems are often characterized by their high heterogeneity, so individual measurements for their complete representation are often not sufficient. The application of wireless sensor networks in terrestrial and aquatic ecosystems offer significant benefits as a better consideration of the local test conditions becomes possible. This can be essential for the monitoring of heterogeneous environmental systems. Significant advantages in the application of mobile ad-hoc wireless sensor networks are their self-organizing behavior, resulting in a major reduction in installation and operation costs and time. In addition, a point measurement with a sensor is significantly improved by measuring at several points. It is also possible to perform analog and digital signal processing and computation on the basis of the measured data close to the sensor. Hence, a significant reduction of the data to be transmitted can be achieved which leads to a better energy management of sensor nodes. Furthermore, their localization via satellite, the miniaturization of the nodes and long-term energy self-sufficiency are current topics under investigation. The possibilities and limitations of the applicability of wireless sensor networks for long-term and mobile environmental monitoring are presented. A concepts and realization example are given in the field of micrometeorology and soil parameters for the interaction of biotic and abiotic processes .This long term monitoring is part of the Global Change Experimental Facility (GCEF), a large field-based experimental platform to assess the effects of climate change on ecosystem functions and processes under different land-use scenarios. Furthermore a mobile ad-hoc sensor network is presented for the monitoring of water induced mass wasting processes.

  16. Ad-hoc Content-based Queries and Data Analysis for Virtual Observatories Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Aquilent, Inc. proposes to support ad-hoc, content-based query and data retrieval from virtual observatories (VxO) by developing 1) Higher Order Query Services that...

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

  18. 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.; Segarra, Esteve Pallarès; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Gargallo, Emilio Sanvicente

    2015-01-01

    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. PMID:25897496

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

  20. Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks

    DEFF Research Database (Denmark)

    Hüttel, Hans; Kühnrich, Morten; Godskesen, Jens Christian

    2009-01-01

    We introduce a novel process calculus called DBSPI (distributed broadcast SPI-calculus) which models mobile ad hoc networks (MANET). The calculus is a cryptographic broadcast calculus with locations and migration. Communication and migration are limited to neighborhoods. Neighborhood definitions...... are explicitly part of the syntax allowing dynamic extension using bound identifiers. In this semantic setting we study authentication of agents in MANET protocols. A safety property dealing with authentication correspondence assertions is defined. Later a dependent type and effect system is given...... and it is shown to be sound, i.e. protocols which are typeable are also safe. This result is lifted to open systems which involves Dolev-Yao attackers. Our Dolev-Yao attacker may use public keys for encryption and can attack any neighborhood it wishes. Our technique is applied to the Mobile IP registration...

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

  2. Integration of Data from Vehicular Ad Hoc Networks Using Model-Driven Collaborative Tools

    Directory of Open Access Journals (Sweden)

    Raquel Lacuesta

    2016-01-01

    Full Text Available Ubiquitous environments such as Vehicular Ad Hoc Networks need applications that allow them to integrate data and services to build knowledge that can be used to make decisions and to improve standards of living and user safety, among others. We have designed a collaborative virtual environment that covers the needs of integration of knowledge from different vehicles to endow the final user with the necessary information. This environment has been carried out following a model-driven approach that generates a groupware application for improving collaborative work and access to services. The implemented tool facilitates the development and implementation of collaborative frameworks in VANETs, where every vehicle acts as a node.

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

    Science.gov (United States)

    Dung, Le The; Hieu, Tran Dinh; Choi, Seong-Gon; Kim, Byung-Seo; An, Beongku

    2017-03-27

    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.

  4. Design and analysis of medium access control protocols for ad hoc and cooperative wireless networks

    OpenAIRE

    Alonso Zárate, Jesús

    2009-01-01

    Premi extraordinari doctorat curs 2008-2009, àmbit Enginyeria de les TIC La presente tesis doctoral contribuye a la incesante evolución de las comunicaciones inalámbricas. Se centra en el diseño de protocolos de acceso al medio (MAC) para redes ad hoc y redes inalámbricas cooperativas. En una primera parte introductoria se presenta un minucioso estado del arte y se establecen las bases teóricas de las contribuciones presentadas en la tesis. En esta primera parte introductoria se definen...

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

  6. Interference-Aware Scheduling for Connectivity in MIMO Ad Hoc Multicast Networks

    CERN Document Server

    Jiang, Feng; Swindlehurst, A Lee

    2012-01-01

    We consider a multicast scenario involving an ad hoc network of co-channel MIMO nodes in which a source node attempts to share a streaming message with all nodes in the network via some pre-defined multi-hop routing tree. The message is assumed to be broken down into packets, and the transmission is conducted over multiple frames. Each frame is divided into time slots, and each link in the routing tree is assigned one time slot in which to transmit its current packet. We present an algorithm for determining the number of time slots and the scheduling of the links in these time slots in order to optimize the connectivity of the network, which we define to be the probability that all links can achieve the required throughput. In addition to time multiplexing, the MIMO nodes also employ beamforming to manage interference when links are simultaneously active, and the beamformers are designed with the maximum connectivity metric in mind. The effects of outdated channel state information (CSI) are taken into accoun...

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

  8. 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......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 make the design resilient against interference between the nodes, transmissions are separated on multiple frequencies, ensuring a certain separation between the transmissions. Our previous results exposed a limitation of the design. Since a train node is required to transmits on all frequencies...... to be able to communicate to the chain with a high probability, the frequency separation guaranteed inside the chain is not achievable in the train-to-chain communication. As a result, the train node’s transmissions cause a significant amount of interference on the chain nodes. This paper proposes...

  9. A fluid model for a relay node in an ad-hoc network: the case of heavy-tailed input

    NARCIS (Netherlands)

    R. Bekker (Rene); M.R.H. Mandjes (Michel)

    2007-01-01

    textabstractRelay nodes in an ad-hoc network can be modelled as fluid queues, in which the available service capacity is shared by the input and output. In this paper such a relay node is considered; jobs arrive according to a Poisson process and bring along a random amount of work. The total

  10. An Energy-Efficient and Robust Multipath Routing Protocol for Cognitive Radio Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Kishor Singh

    2017-09-01

    Full Text Available Routing in cognitive radio ad hoc networks (CRAHNs is a daunting task owing to dynamic topology, intermittent connectivity, spectrum heterogeneity, and energy constraints. Other prominent aspects such as channel stability, path reliability, and route discovery frequency should also be exploited. Several routing protocols have been proposed for CRAHNs in the literature. By stressing on one of the aspects more than any other, however, they do not satisfy all requirements of throughput, energy efficiency, and robustness. In this paper, we propose an energy-efficient and robust multipath routing (ERMR protocol for CRAHNs by considering all prominent aspects including residual energy and channel stability in design. Even when the current routing path fails, the alternative routing path is immediately utilized. In establishing primary and alternative routing paths, both residual energy and channel stability are exploited simultaneously. Our simulation study shows that the proposed ERMR outperforms the conventional protocol in terms of network throughput, packet delivery ratio, energy consumption, and end-to-end delay.

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

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

  13. Combined bio-inspired/evolutionary computational methods in cross-layer protocol optimization for wireless ad hoc sensor networks

    Science.gov (United States)

    Hortos, William S.

    2011-06-01

    Published studies have focused on the application of one bio-inspired or evolutionary computational method to the functions of a single protocol layer in a wireless ad hoc sensor network (WSN). For example, swarm intelligence in the form of ant colony optimization (ACO), has been repeatedly considered for the routing of data/information among nodes, a network-layer function, while genetic algorithms (GAs) have been used to select transmission frequencies and power levels, physical-layer functions. Similarly, artificial immune systems (AISs) as well as trust models of quantized data reputation have been invoked for detection of network intrusions that cause anomalies in data and information; these act on the application and presentation layers. Most recently, a self-organizing scheduling scheme inspired by frog-calling behavior for reliable data transmission in wireless sensor networks, termed anti-phase synchronization, has been applied to realize collision-free transmissions between neighboring nodes, a function of the MAC layer. In a novel departure from previous work, the cross-layer approach to WSN protocol design suggests applying more than one evolutionary computational method to the functions of the appropriate layers to improve the QoS performance of the cross-layer design beyond that of one method applied to a single layer's functions. A baseline WSN protocol design, embedding GAs, anti-phase synchronization, ACO, and a trust model based on quantized data reputation at the physical, MAC, network, and application layers, respectively, is constructed. Simulation results demonstrate the synergies among the bioinspired/ evolutionary methods of the proposed baseline design improve the overall QoS performance of networks over that of a single computational method.

  14. Design and Analysis of A Beacon-Less Routing Protocol for Large Volume Content Dissemination in Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Miao Hu

    2016-11-01

    Full Text Available Large volume content dissemination is pursued by the growing number of high quality applications for Vehicular Ad hoc NETworks(VANETs, e.g., the live road surveillance service and the video-based overtaking assistant service. For the highly dynamical vehicular network topology, beacon-less routing protocols have been proven to be efficient in achieving a balance between the system performance and the control overhead. However, to the authors’ best knowledge, the routing design for large volume content has not been well considered in the previous work, which will introduce new challenges, e.g., the enhanced connectivity requirement for a radio link. In this paper, a link Lifetime-aware Beacon-less Routing Protocol (LBRP is designed for large volume content delivery in VANETs. Each vehicle makes the forwarding decision based on the message header information and its current state, including the speed and position information. A semi-Markov process analytical model is proposed to evaluate the expected delay in constructing one routing path for LBRP. Simulations show that the proposed LBRP scheme outperforms the traditional dissemination protocols in providing a low end-to-end delay. The analytical model is shown to exhibit a good match on the delay estimation with Monte Carlo simulations, as well.

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

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

  17. Wireless Propagation Characteristics for Vehicular Ad–Hoc Networks in Motorway Environments

    Directory of Open Access Journals (Sweden)

    A. Edwards

    2009-10-01

    Full Text Available This paper presents the measurements and analytical results regarding important characteristics of wireless propagation for vehicular ad–hoc networks in motorway environments, including Doppler Effect, Free Space Signal propagation, path loss and system operating margin. In this work, we employ IEEE 802.1 1b wireless cards for inter–vehicular communication to analyze large and small–scale propagation models. According to large–scale models, the maximum distance between the transmitter and receiver vehicle is 446 m using 5 dBi omni–directional antennas. Additionally, the feasible System Operating Margin (SOM of 446 m is greater than 13 dB, which is over the minimum margin recommended. Our results show that the Doppler Effect does not affect the transmission between communication partners at high speeds in small–scale models. Finally, we realize an experiment to validate the results in the worst case scenario, when the transmitter and receiver vehicle are traveling in opposing directions on a straightaway. Results show that at least 8 packets can be relayed when the transmitter and receiver antennas are mountedonautomobile dashboards.

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

  19. Efficient target tracking with an ad-hoc network of omni-directional sensors

    Science.gov (United States)

    Atanassov, Kalin

    2015-05-01

    Ad-hoc networks of omni-directional sensors provide an efficient means to obtain low-cost, easily deployed, reliable target tracking systems. To remove target position dependency on the target power, a transformation to another coordinate system is introduced. It can be shown that the problem of sensing target position with omni-directional sensors can be adapted to the conventional Kalman filter framework. To validate the proposed methodology, first an analysis is conducted to show that by converting to log-ratio space and at the same time reducing the number of parameters to track, no information about target position is lost. The analysis is done by deriving the CRLBs for the position estimation error in both original and transformed spaces and showing that they are the same. Second, to show how the traditional Kalman filter framework performs, a particle filter that works off the transformed coordinates is designed. The number of particles is selected to be sufficiently large and the result is used as ground truth to compare with the performance of the Kalman tracker. The comparisons are done for different target movement speeds and sensor density modes. The results provide an insight into Kalman tracker performance in different situations.

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

  1. Valid randomization-based p-values for partially post hoc subgroup analyses.

    Science.gov (United States)

    Lee, Joseph J; Rubin, Donald B

    2015-10-30

    By 'partially post-hoc' subgroup analyses, we mean analyses that compare existing data from a randomized experiment-from which a subgroup specification is derived-to new, subgroup-only experimental data. We describe a motivating example in which partially post hoc subgroup analyses instigated statistical debate about a medical device's efficacy. We clarify the source of such analyses' invalidity and then propose a randomization-based approach for generating valid posterior predictive p-values for such partially post hoc subgroups. Lastly, we investigate the approach's operating characteristics in a simple illustrative setting through a series of simulations, showing that it can have desirable properties under both null and alternative hypotheses. Copyright © 2015 John Wiley & Sons, Ltd.

  2. Context-Aware Hierarchy k-Depth Estimation and Energy-Efficient Clustering in Ad-hoc Network

    Science.gov (United States)

    Mun, Chang-Min; Kim, Young-Hwan; Lee, Kang-Whan

    Ad-hoc Network needs an efficient node management because the wireless network has energy constraints. Previously proposed a hierarchical routing protocol reduce the energy consumption and prolong the network lifetime. Further, there is a deficiency conventional works about the energy efficient depth of cluster associated with the overhead. In this paper, we propose a novel top-down method clustered hierarchy, CACHE(Context-aware Clustering Hierarchy and Energy-Efficient). The proposed analysis could estimate the optimum k-depth of hierarchy architecture in clustering protocols.

  3. Implementation of an effective video transmission scheme over ad hoc networks

    Science.gov (United States)

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

    2006-10-01

    Real-time video transmission over ad hoc networks faces many challenges including low bandwidth, long end-to-end delay, high packet loss rate, frequently changing topology and limited-powered mobile nodes. This paper presents an effective real-time video transmission scheme and improves implementation of DSR (Dynamic Source Routing) protocol. We set up a test-bed by using DSR routing in the IP layer, and an application transmitting video stream over UDP protocol. We get a continuous JPEG image stream from a ZC0301p web camera and split each image into small blocks according to the MCU (Minimum Coding Unit) borderline. The strong point of splitting JPEG image is that IP layer fragmentation can be avoided so we can determine which part of data in the frame gets lost to do loss recovery at the receiver. By using JPEG image stream, the video encoding complexity is reduced, which can save computing power of mobile nodes compared with MPEG and other Multiple Description Coding (MDC) methods. We also improve implementation of DSR to make it suitable to transfer real-time multimedia data. First different priorities are given to different traffic classes in DSR routing. Second the route maintenance scheme is modified to decrease overhead and link failure misjudgments. We carry out two experiments both indoors and outdoors using six mobile nodes. The first is to transmit continuous JPEG images using our former DSR implementation according to DSR draft. The second is that we split JPEG images into blocks and then transmit them using improved DSR implementation. Results show the latter gives better video stream fluency and higher image quality.

  4. Energy efficient routing in mobile ad-hoc networks for Healthcare Environments

    OpenAIRE

    Sohail Abid; Imran Shafi; Shahid Abid

    2013-01-01

    The modern and innovative medical applications based on wireless network are being developed in the commercial sectors as well as in research. The emerging wireless networks are rapidly becoming a fundamental part of medical solutions due to increasing accessibility for healthcare professionals/patients reducing healthcare costs. Discovering the routes among hosts that are energy efficient without compromise on smooth communication is desirable. This work investigates energy efficiency of som...

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

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

    Directory of Open Access Journals (Sweden)

    Caixia Song

    2017-12-01

    Full Text Available 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.

  7. Enhanced WWTP effluent organic matter removal in hybrid ozonation-coagulation (HOC) process catalyzed by Al-based coagulant

    Energy Technology Data Exchange (ETDEWEB)

    Jin, Xin [School of Environmental and Municipal Engineering, Xi’an University of Architecture and Technology, Xi’an, Shaanxi Province, 710055 (China); Jin, Pengkang, E-mail: pkjin@hotmail.com [School of Environmental and Municipal Engineering, Xi’an University of Architecture and Technology, Xi’an, Shaanxi Province, 710055 (China); Hou, Rui [School of Environmental and Municipal Engineering, Xi’an University of Architecture and Technology, Xi’an, Shaanxi Province, 710055 (China); Yang, Lei [Department of Materials Science and Engineering, Monash University, Clayton, VIC, 3800 (Australia); Wang, Xiaochang C., E-mail: xcwang@xauat.edu.cn [School of Environmental and Municipal Engineering, Xi’an University of Architecture and Technology, Xi’an, Shaanxi Province, 710055 (China)

    2017-04-05

    Highlights: • A novel HOC process was firstly put forward to apply in wastewater reclamation. • Interactions between ozone and Al-based coagulants was found in the HOC process. • Ozonation can be catalyzed and enhanced by Al-based coagulants in the HOC process. • HOC process showed better organics removal than pre-ozonation-coagulation process. - Abstract: A novel hybrid ozonation-coagulation (HOC) process was developed for application in wastewater reclamation. In this process, ozonation and coagulation occurred simultaneously within a single unit. Compared with the conventional pre-ozonation-coagulation process, the HOC process exhibited much better performance in removing dissolved organic matters. In particular, the maximal organic matters removal efficiency was obtained at the ozone dosage of 1 mgO{sub 3}/mg DOC at each pH value (pH 5, 7 and 9). In order to interpret the mechanism of the HOC process, ozone decomposition was monitored. The results indicated that ozone decomposed much faster in the HOC process. Moreover, by using the reagent of O{sub 3}-resistant hydroxyl radical (·OH) probe compound, para-chlorobenzoic acid (pCBA), and electron paramagnetic resonance (EPR) analysis, it was observed that the HOC process generated higher content of ·OH compared with pre-ozonation process. This indicates that the ·OH oxidation reaction as the key step can be catalyzed and enhanced by Al-based coagulants and their hydrolyzed products in this developed process. Thus, based on the catalytic effects of Al-based coagulants on ozonation, the HOC process provides a promising alternative to the conventional technology for wastewater reclamation in terms of higher efficiency.

  8. Achieving Congestion Mitigation Using Distributed Power Control for Spectrum Sensor Nodes in Sensor Network-Aided Cognitive Radio Ad Hoc Networks.

    Science.gov (United States)

    Zhang, Long; Xu, Haitao; Zhuo, Fan; Duan, Hucai

    2017-09-15

    The data sequence of spectrum sensing results injected from dedicated spectrum sensor nodes (SSNs) and the data traffic from upstream secondary users (SUs) lead to unpredictable data loads in a sensor network-aided cognitive radio ad hoc network (SN-CRN). As a result, network congestion may occur at a SU acting as fusion center when the offered data load exceeds its available capacity, which degrades network performance. In this paper, we present an effective approach to mitigate congestion of bottlenecked SUs via a proposed distributed power control framework for SSNs over a rectangular grid based SN-CRN, aiming to balance resource load and avoid excessive congestion. To achieve this goal, a distributed power control framework for SSNs from interior tier (IT) and middle tier (MT) is proposed to achieve the tradeoff between channel capacity and energy consumption. In particular, we firstly devise two pricing factors by considering stability of local spectrum sensing and spectrum sensing quality for SSNs. By the aid of pricing factors, the utility function of this power control problem is formulated by jointly taking into account the revenue of power reduction and the cost of energy consumption for IT or MT SSN. By bearing in mind the utility function maximization and linear differential equation constraint of energy consumption, we further formulate the power control problem as a differential game model under a cooperation or noncooperation scenario, and rigorously obtain the optimal solutions to this game model by employing dynamic programming. Then the congestion mitigation for bottlenecked SUs is derived by alleviating the buffer load over their internal buffers. Simulation results are presented to show the effectiveness of the proposed approach under the rectangular grid based SN-CRN scenario.

  9. Achieving Congestion Mitigation Using Distributed Power Control for Spectrum Sensor Nodes in Sensor Network-Aided Cognitive Radio Ad Hoc Networks

    Science.gov (United States)

    Zhuo, Fan; Duan, Hucai

    2017-01-01

    The data sequence of spectrum sensing results injected from dedicated spectrum sensor nodes (SSNs) and the data traffic from upstream secondary users (SUs) lead to unpredictable data loads in a sensor network-aided cognitive radio ad hoc network (SN-CRN). As a result, network congestion may occur at a SU acting as fusion center when the offered data load exceeds its available capacity, which degrades network performance. In this paper, we present an effective approach to mitigate congestion of bottlenecked SUs via a proposed distributed power control framework for SSNs over a rectangular grid based SN-CRN, aiming to balance resource load and avoid excessive congestion. To achieve this goal, a distributed power control framework for SSNs from interior tier (IT) and middle tier (MT) is proposed to achieve the tradeoff between channel capacity and energy consumption. In particular, we firstly devise two pricing factors by considering stability of local spectrum sensing and spectrum sensing quality for SSNs. By the aid of pricing factors, the utility function of this power control problem is formulated by jointly taking into account the revenue of power reduction and the cost of energy consumption for IT or MT SSN. By bearing in mind the utility function maximization and linear differential equation constraint of energy consumption, we further formulate the power control problem as a differential game model under a cooperation or noncooperation scenario, and rigorously obtain the optimal solutions to this game model by employing dynamic programming. Then the congestion mitigation for bottlenecked SUs is derived by alleviating the buffer load over their internal buffers. Simulation results are presented to show the effectiveness of the proposed approach under the rectangular grid based SN-CRN scenario. PMID:28914803

  10. Network Routing Using the Network Tasking Order, a Chron Approach

    Science.gov (United States)

    2015-03-26

    iv BATMAN Better Approach to Mobile Ad-hoc Networks...routing in wireless mesh networks. MicroTik has created MME based on the Better Approach to Mobile Ad-hoc Network ( BATMAN ) routing protocol. MME

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

  12. Credible Mobile and Ad Hoc Network Simulation-Based Studies

    Science.gov (United States)

    2006-10-26

    once duplicate (orange) Received the same packet twice 2-duplicates ( pink ) Received the same packet at least three times 4-duplicates (red) Received...mobility tool generators in NS-2 simulator. Version 1.0, beta, 2004. [6] S. Bajaj, L. Breslau, D. Estrin, K. Fall, S. Floyd , P. Haldar, M. Hand- ley, A

  13. Application-Level and User-Level QoS Assessment of Audio-Video IP Transmission over Cross-Layer Designed Wireless Ad Hoc Networks

    Science.gov (United States)

    Nunome, Toshiro; Tasaka, Shuji; Nakaoka, Ken

    This paper performs application-level QoS and user-level QoS assessment of audio-video streaming in cross-layer designed wireless ad hoc networks. In order to achieve high QoS at the user-level, we employ link quality-based routing in the network layer and media synchronization control in the application layer. We adopt three link quality-based routing protocols: OLSR-SS (Signal Strength), AODV-SS, and LQHR (Link Quality-Based Hybrid Routing). OLSR-SS is a proactive routing protocol, while AODV-SS is a reactive one. LQHR is a hybrid protocol, which is a combination of proactive and reactive routing protocols. For applicationlevel QoS assessment, we performed computer simulation with ns-2 where an IEEE 802.11b mesh topology network with 24 nodes was assumed. We also assessed user-level QoS by a subjective experiment with 30 assessors. From the assessment results, we find AODV-SS the best for networks with long inter-node distances, while LQHR outperforms AODV-SS for short inter-node distances. In addition, we also examine characteristics of the three schemes with respect to the application-level QoS in random topology networks.

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

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

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

    OpenAIRE

    Rafiullah Khan; Sarmad Ullah Khan

    2017-01-01

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

  17. Enhanced WWTP effluent organic matter removal in hybrid ozonation-coagulation (HOC) process catalyzed by Al-based coagulant.

    Science.gov (United States)

    Jin, Xin; Jin, Pengkang; Hou, Rui; Yang, Lei; Wang, Xiaochang C

    2017-04-05

    A novel hybrid ozonation-coagulation (HOC) process was developed for application in wastewater reclamation. In this process, ozonation and coagulation occurred simultaneously within a single unit. Compared with the conventional pre-ozonation-coagulation process, the HOC process exhibited much better performance in removing dissolved organic matters. In particular, the maximal organic matters removal efficiency was obtained at the ozone dosage of 1mgO3/mg DOC at each pH value (pH 5, 7 and 9). In order to interpret the mechanism of the HOC process, ozone decomposition was monitored. The results indicated that ozone decomposed much faster in the HOC process. Moreover, by using the reagent of O3-resistant hydroxyl radical (OH) probe compound, para-chlorobenzoic acid (pCBA), and electron paramagnetic resonance (EPR) analysis, it was observed that the HOC process generated higher content of OH compared with pre-ozonation process. This indicates that the OH oxidation reaction as the key step can be catalyzed and enhanced by Al-based coagulants and their hydrolyzed products in this developed process. Thus, based on the catalytic effects of Al-based coagulants on ozonation, the HOC process provides a promising alternative to the conventional technology for wastewater reclamation in terms of higher efficiency. Copyright © 2016 Elsevier B.V. All rights reserved.

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

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

    Science.gov (United States)

    2015-06-01

    KILLER APP ........................................................................................65  H.  DESIGN CONSIDERATIONS...initially implement and build the network. Several connection mediums were also used including serial connections, wireless Xbee devices, and wired CAT5...of these background ideas and technologies, it is important to keep in mind the common thread that they all rely on—communication. A. NETWORK

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

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

  2. Efficient content distribution for peer-to-peer overlays on mobile ad hoc networks

    Directory of Open Access Journals (Sweden)

    Afzal Mawji

    2011-07-01

    Full Text Available Peer-to-peer (P2P networks existing on a MANET are a natural evolution since both are decentralized and have dynamic topologies. As MANETs grow in use due to the increasing popularity of wireless mesh and 4G networks, it is expected that P2P applications will remain as a popular means of obtaining files. Network coding has been shown as an efficient means of sharing large files in a P2P network. With network coding, all file blocks have the same relative importance. This paper presents an efficient content distribution scheme that uses network coding to share large files in a P2P overlay running on a MANET. Peers request file blocks from multiple server nodes and servers multicast blocks to multiple receivers, providing efficient multipoint-to-multipoint communication. Simulation results show that compared to other common download techniques, the proposed scheme performs very well, having lower download time and energy consumption. Also, more peers participate in uploading the file, resulting in greater fairness.

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

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

  5. Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density

    Directory of Open Access Journals (Sweden)

    Qiuming Liu

    2016-03-01

    Full Text Available In this paper, we study the throughput capacity of wireless networks considering the selfish feature of interaction between nodes. In our proposed network model, each node has a probability of cooperating to relay transmission. According to the extent of selfishness, we, by the application of percolation theory, construct a series of highways crossing the network. The transmission strategy is then divided into three consecutive phases. Comparing the rate in each phase, we find the bottleneck of rate is always in the highway phase. Finally, the result reveals that the node’s selfishness degrades the throughput with a factor of square root of the cooperative probability, whereas the node density has trivial impact on the throughput.

  6. Inter-Vehicular Ad Hoc Networks: From the Ground Truth to Algorithm Design and Testbed Architecture

    Science.gov (United States)

    Giordano, Eugenio

    2011-01-01

    Many of the devices we interact with on a daily basis are currently equipped with wireless connectivity. Soon this will be extended to the vehicles we drive/ride every day. Wirelessly connected vehicles will form a new kind of network that will enable a wide set of innovative applications ranging from enhanced safety to entertainment. To…

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

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

    Science.gov (United States)

    2012-09-01

    15 Figure 6. Multi-hop relay in a network (Image from Nomadic Technologies website...the militia in Somalia ), or individual crews refuse to comply with international law and threaten security and peace, not only in a particular...difficult. An example is a smart buoy node in a sea area: the lifetime of that node depends on the battery life or fuel cell, thus the minimization of

  9. Assessing the State-of-the-Art in Dynamic Discovery of Ad Hoc Network Services

    Science.gov (United States)

    2001-07-18

    Cache Manager() 0..1 Contains 1 Contains SERVICE MANAGER discov er Network Context() <<not shr>> Cache Manager Discov ery () <<OPT>> Announce Serv ice...service availability requests Service Manager Service Cache Manager Service User Service Description Service Provider Service Repository Service...Group Service Manager Service User Service Cache Manager Aggressive Discovery Multicast Group SM4 SCM3 T ATT API GUI 20 30AddService50 SU8 5 1 2 S XYZ

  10. Applying ADLs to Assess Emerging Industry Specifications for Dynamic Discovery of Ad Hoc Network Services

    Science.gov (United States)

    2001-01-31

    0..1 Contains 1 Contains SERVICE MANAGER discov er Network Context() <<not shr>> Cache Manager Discov ery () <<OPT>> Announce Serv ice Processing...Architectural Layers Approach JINI Entities Service Manager Entity Major Functions Lazy Discovery Directed Discovery Client (s,ra) Aggressive...registered-services SCM SM discovered-SCMs (SU NR SCM): (SU,NR) SCM registered-notifications SCM SU discovered-SCMs • SM is Service Manager • SD is

  11. Assessing Robustness Properties in Dynamic Discovery of Ad Hoc Network Services (Briefing Charts)

    Science.gov (United States)

    2001-10-04

    Task() start Aging Task() Serv ice Cache Manager() 0..1 Contains 1 Contains SERVICE MANAGER discov er Network Context() <<not shr>> Cache Manager...service availabilty requests 0..* 0..* service availability requests Service Manager Service Cache Manager Service User Service Description Service...Discovery Multicast Group Service Manager Service User Service Cache Manager Aggressive Discovery Multicast Group SM4 SCM3 T ATT API GUI 20

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

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

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

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

    DEFF Research Database (Denmark)

    Paulin, Thomas

    . Using other vehicles as forwarders can reduce the collection delay from minutes to seconds, if the network topology allows it, and scheduling the communication at the optimal distance to the road-side unit reduces communication overhead and distributes the resource consumption over time.......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...... to equally distribute the traffic demand throughout the available infrastructure. To enable intelligent road infrastructure traffic management, detailed knowledge about both current and the historical states are necessary. Equipping vehicles with processing and communication devices enables them to sense...

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

    Science.gov (United States)

    2016-04-05

    Computing, The Computer Journal, Security and Network Communications, and International Journal on Artificial Intelligence Tools. He is a member of the IEEE and ACM. ...applications in wireless networks such as military battlefields, emergency response, mobile commerce, online gaming, and collaborative work are based on the...transition T_RK. As we use GDH for rekeying, Tcm can be calculated by Cleave,i divided by BW, the wireless network bandwidth (Mbps) in the MANET. A(mc

  17. Dating currency crises with ad hoc and extreme value-based thresholds : East Asia 1970-2002 [dating currency crises

    NARCIS (Netherlands)

    Lestano, L; Jacobs, Jan P. A. M.

    2007-01-01

    Generally a currency crisis is defined to occur if an index of currency pressure exceeds a threshold. This paper compares currency crisis dating methods. For two definitions of currency pressure we contrast ad hoc and extreme value-based thresholds. We illustrate the methods with data of six East

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

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

    Directory of Open Access Journals (Sweden)

    Werner Scheinhardt

    2008-07-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 n users who wish to transmit data through a specific node, each of them obtains a share 1/(n+w of the service capacity to feed traffic into the queue of the node, whereas the remaining fraction w/(n+w is used to serve the queue; here w>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 w=1 has been addressed before; the present paper focuses on the intrinsically harder case w>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.

  20. Prospect for VLBI network extension: the first results of an Ad-hoc S2 array experiments

    Science.gov (United States)

    Molotov, I.; Likhachev, S.; Chuprikov, A.; Lipatov, B.; Dementiev, A.

    2001-01-01

    There are many large radio telescopes not integrated into current VLBI networks because of the shortage of modern compatible VLBI recorders. Above all, this situation is negative for Russia. The wide use of Canadian S2 systems that there are now in 13 countries gives its a chance to be involved in the VLBI Community. It is proposed to arrange an ad-hoc S2 VLBI array from the telescopes around the world, equipped with S2 system, and Penticton S2 correlator. The six successful international VLBI experiments that were carried out since 1993 confirms the feasibility of this S2 initiative. Three Russian antennas (Bear Lakes, Puschino, Svetloe) were joined with three foreign radio telescopes during observations INTAS98.5 (Arecibo, Green Bank, HartRAO) and INTAS99.4 (HartRAO, Noto, Shanghai) to investigate AGNs, OH-masers, interplanetary medium and stars. The pioneer VLBI radar experiment VLBR99.1 was organized in June 1999 for Mars and Venus planets to develop the new method of investigations of Solar system bodies. A review of the S2 experiments results is presented.

  1. Interference-Aware Hybrid MAC protocol for Cognitive Radio Ad-Hoc Networks with Directional Antennas

    Directory of Open Access Journals (Sweden)

    Satish Anamalamudi

    2015-07-01

    Full Text Available CR and PU hidden terminals in multi-channel Cognitive MAC protocols result in increased packet drops. This is due to inefficient node synchronization with existing “Control Channel” design. To date, In-band and Out-of-band CCC based MAC protocols are proposed to avoid PU and CR hidden terminals. But, In-band CCC based CR-MAC protocols cannot efficiently resolve the hidden terminal packet drops due to imperfect node synchronization whereas out-of-band CCC based MAC is vulnerable to intruder attacks and channel saturation. To overcome this, we propose an Interference-aware hybrid CCC cognitive MAC protocol with directional RTS/CTS and data transmission. In addition, adaptive power control algorithm is proposed to avoid interference to hidden PU and CR nodes at edge coverage area. Experimental results show that proposed Hybrid cognitive MAC protocol has increased link aggregate throughput and reduced cognitive control overhead in comparison with existing CCC based CR-MAC protocols.

  2. Intrusion detection in Mobile Ad-hoc Networks: Bayesian game formulation

    Directory of Open Access Journals (Sweden)

    Basant Subba

    2016-06-01

    Full Text Available Present Intrusion Detection Systems (IDSs for MANETs require continuous monitoring which leads to rapid depletion of a node's battery life. To address this issue, we propose a new IDS scheme comprising a novel cluster leader election process and a hybrid IDS. The cluster leader election process uses the Vickrey–Clarke–Groves mechanism to elect the cluster leader which provides the intrusion detection service. The hybrid IDS comprises a threshold based lightweight module and a powerful anomaly based heavyweight module. Initially, only the lightweight module is activated. The decision to activate the heavyweight module is taken by modeling the intrusion detection process as an incomplete information non-cooperative game between the elected leader node and the potential malicious node. Simulation results show that the proposed scheme significantly reduces the IDS traffic and overall power consumption in addition to maintaining a high detection rate and accuracy.

  3. Low Latency Routing Algorithm for Unmanned Aerial Vehicles Ad-Hoc Networks

    OpenAIRE

    Abdel Ilah Alshabtat; Liang Dong

    2011-01-01

    In this paper, we proposed a new routing protocol for Unmanned Aerial Vehicles (UAVs) that equipped with directional antenna. We named this protocol Directional Optimized Link State Routing Protocol (DOLSR). This protocol is based on the well known protocol that is called Optimized Link State Routing Protocol (OLSR). We focused in our protocol on the multipoint relay (MPR) concept which is the most important feature of this protocol. We developed a heuristic that allows D...

  4. Comparison of Analytical and Measured Performance Results on Network Coding in IEEE 802.11 Ad-Hoc Networks

    DEFF Research Database (Denmark)

    Zhao, Fang; Médard, Muriel; Hundebøll, Martin

    2012-01-01

    CATWOMAN that can run on standard WiFi hardware. We present an analytical model to evaluate the performance of COPE in simple networks, and our results show the excellent predictive quality of this model. By closely examining the performance in two simple topologies, we observe that the coding gain results...

  5. Performance of beacon safety message dissemination in Vehicular Ad hoc NETworks (VANETs)

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Currently, there is a growing belief that putting an IEEE 802.11-like radio into road vehicles can help the drivers to travel more safely. Message dissemination protocols are primordial for safety vehicular applications. There are two types of safety messages which may be exchanged between vehicles: alarm and beacon. In this paper we investigate the feasibility of deploying safety applications based on beacon message dissemination through extensive simulation study and pay special attention to the safety requirements. Vehicles are supposed to issue these messages periodically to announce to other vehicles their current situation and use received messages for preventing possible unsafe situations. We evaluate the performance of a single-hop dissemination protocol while taking into account the quality of service (QoS) metrics like delivery rate and delay. We realize that reliability is the main concern in beacon message dissemination. Thus, a new metric named effective range is defined which gives us more accurate facility for evaluating QoS in safety applications specifically. Then, in order to improve the performance, the effects of three parameters including vehicle's transmission range, message transmission's interval time and message payload size are studied. Due to special characteristics of the safety applications, we model the relationship between communication-level QoS and application-level QoS and evaluate them for different classes of safety applications. As a conclusion, the current technology of IEEE 802.11 MAC layer has still some challenges for automatic safety applications but it can provide acceptable QoS to driver assistance safety applications.

  6. Access Point Security Service for wireless ad-hoc communication

    OpenAIRE

    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 security solution described here comprise topics such as energy efficiency, security standards and ad-hoc networks. The devised solution is called Access Point Security Service (APSS). APSS is able to p...

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

  8. Secure Cluster-Based In-Network Information Aggregation for Vehicular Networks

    NARCIS (Netherlands)

    Dietzel, Stefan; Peter, Andreas; Kargl, Frank

    Vehicular ad-hoc networks are a promising research area. Besides improving safety, traffic efficiency enhancements are a major expected benefit. In this paper, we present a novel security mechanism for traffic efficiency applications that lever- ages on velocity-based vehicle clustering and uses

  9. Proposal for an ad hoc computer network in the military electronic systems department at the military academy applying bluetooth technology

    Directory of Open Access Journals (Sweden)

    Miroslav R. Terzić

    2011-01-01

    Full Text Available The historical development of the Bluetooth module is given in the introduction of this paper. The importance of the Bluetooth standard for wireless connection on small distances is shown as well. The organization of the Department of Military Electronic Systems is presented with its area of duties, subordinate sections and deployment. The concept of a local area network for this Department, using Bluetooth technology, includes network topology and working regimes based on the main characteristics and technical specifications for the connection with Bluetooth technology. The Department's disperse computer network is proposed as a scatter net where one piconetwork includes the Head of Department and the Heads of Sections while other piconetworks are formed from the Heads of Sections and their subordinates. The security aspect of the presented network deals with basic computer network attack categories, protection methods and aspects. The paper concludes with some recommendations for the local area network using Bluetooth technology with respect to its economical and security aspects as well as to the managing principles of the Department.

  10. TinCan: User-Defined P2P Virtual Network Overlays for Ad-hoc Collaboration

    Directory of Open Access Journals (Sweden)

    Pierre St Juste

    2014-10-01

    Full Text Available Virtual private networking (VPN has become an increasingly important component of a collaboration environment because it ensures private, authenticated communication among participants, using existing collaboration tools, where users are distributed across multiple institutions and can be mobile. The majority of current VPN solutions are based on a centralized VPN model, where all IP traffic is tunneled through a VPN gateway. Nonetheless, there are several use case scenarios that require a model where end-to-end VPN links are tunneled upon existing Internet infrastructure in a peer-to-peer (P2P fashion, removing the bottleneck of a centralized VPN gateway. We propose a novel virtual network — TinCan — based on peerto-peer private network tunnels. It reuses existing standards and implementations of services for discovery notification (XMPP, reflection (STUN and relaying (TURN, facilitating configuration. In this approach, trust relationships maintained by centralized (or federated services are automatically mapped to TinCan links. In one use scenario, TinCan allows unstructured P2P overlays connecting trusted end-user devices — while only requiring VPN software on user devices and leveraging online social network (OSN infrastructure already widely deployed. This paper describes the architecture and design of TinCan and presents an experimental evaluation of a prototype supporting Windows, Linux, and Android mobile devices. Results quantify the overhead introduced by the network virtualization layer, and the resource requirements imposed on services needed to bootstrap TinCan links.

  11. Automatically assessing properties of dynamic cameras for camera selection and rapid deployment of video content analysis tasks in large-scale ad-hoc networks

    Science.gov (United States)

    den Hollander, Richard J. M.; Bouma, Henri; van Rest, Jeroen H. C.; ten Hove, Johan-Martijn; ter Haar, Frank B.; Burghouts, Gertjan J.

    2017-10-01

    Video analytics is essential for managing large quantities of raw data that are produced by video surveillance systems (VSS) for the prevention, repression and investigation of crime and terrorism. Analytics is highly sensitive to changes in the scene, and for changes in the optical chain so a VSS with analytics needs careful configuration and prompt maintenance to avoid false alarms. However, there is a trend from static VSS consisting of fixed CCTV cameras towards more dynamic VSS deployments over public/private multi-organization networks, consisting of a wider variety of visual sensors, including pan-tilt-zoom (PTZ) cameras, body-worn cameras and cameras on moving platforms. This trend will lead to more dynamic scenes and more frequent changes in the optical chain, creating structural problems for analytics. If these problems are not adequately addressed, analytics will not be able to continue to meet end users' developing needs. In this paper, we present a three-part solution for managing the performance of complex analytics deployments. The first part is a register containing meta data describing relevant properties of the optical chain, such as intrinsic and extrinsic calibration, and parameters of the scene such as lighting conditions or measures for scene complexity (e.g. number of people). A second part frequently assesses these parameters in the deployed VSS, stores changes in the register, and signals relevant changes in the setup to the VSS administrator. A third part uses the information in the register to dynamically configure analytics tasks based on VSS operator input. In order to support the feasibility of this solution, we give an overview of related state-of-the-art technologies for autocalibration (self-calibration), scene recognition and lighting estimation in relation to person detection. The presented solution allows for rapid and robust deployment of Video Content Analysis (VCA) tasks in large scale ad-hoc networks.

  12. Prevalence of Medication-Related Risks for Falls and Osteoporosis at a Hospital Network: A Post-hoc Analysis

    Directory of Open Access Journals (Sweden)

    Iouri Banakh

    2016-04-01

    Full Text Available AIM: PRO-OSTEO Extend 1was an osteoporosis management study at a Victorian Healthcare service. This post-hoc analysis examined comorbidities and drug-related risks for falls and osteoporosis, and analysed the accuracy of the medication subcomponent of the falls risk assessment tool used at the service. The secondary aim of this analysis was to evaluate the impact of proton pump inhibitors on the success of anti-osteoporosis therapies. MATERIAL AND METHODS: This analysis was part of a two year retrospective cohort study. The falls risk assessment tool medication subsection results, completed by nursing staff, were compared to scores given by the data collection pharmacist based on medical history notes using Mann-Whitney U test. The impact of proton pump inhibitors use on active osteoporosis therapy in patients admitted after a fall was analysed using the Fisher Exact test. Prevalence of medical and medication-related risk factors for osteoporosis and falls was compared between patients with fractures without osteoporosis treatment at admission and patient who were excluded from the primary study due to active osteoporosis therapy, or admission after a fall without a fracture. RESULTS: The falls risk assessment tool completion rate was approximately 80%, with accuracy below 50% P < 0.001. Medications which increase osteoporosis and falls risk were prevalent, with high use of benzodiazepines, opioids, serotonin reuptake inhibitors antidepressants and proton pump inhibitors. The impact of proton pump inhibitors carried a 14% increased relative risk of a fracture in this cohort (P = 0.218. There was also high prevalence of pre-existing fractures, pulmonary disease, heart failure and strokes in the study population. CONCLUSION: Falls risk assessment in relation to medication use is frequently inaccurate and is not done at all for a significant proportion of patients. The use proton pump inhibitors and medication-related risks for falls and

  13. TinCan: User-Defined P2P Virtual Network Overlays for Ad-hoc Collaboration

    OpenAIRE

    Pierre St Juste; Kyuho Jeong; Heungsik Eom; Corey Baker; Renato Figueiredo

    2014-01-01

    Virtual private networking (VPN) has become an increasingly important component of a collaboration environment because it ensures private, authenticated communication among participants, using existing collaboration tools, where users are distributed across multiple institutions and can be mobile. The majority of current VPN solutions are based on a centralized VPN model, where all IP traffic is tunneled through a VPN gateway. Nonetheless, there are several use case scenarios that require a m...

  14. Delay-sensitive content distribution via peer-to-peer collaboration in public safety vehicular ad-hoc networks

    KAUST Repository

    Atat, Rachad

    2014-05-01

    Delay-sensitive content distribution with peer-to-peer (P2P) cooperation in public safety vehicular networks is investigated. Two cooperative schemes are presented and analyzed. The first scheme is based on unicasting from the base station, whereas the second is based on threshold based multicasting. Long Term Evolution (LTE) is used for long range (LR) communications with the base station (BS) and IEEE 802.11p is considered for inter-vehicle collaboration on the short range (SR). The first scheme is shown to outperform non-cooperative unicasting and multicasting, while the second scheme outperforms non-cooperative unicasting beyond a specific number of cooperating vehicles, when the appropriate 802.11p power class is used. The first scheme achieves the best performance among the compared methods, and a practical approximation of that scheme is shown to be close to optimal performance. © 2014 Elsevier B.V. All rights reserved.

  15. Analisis Unjuk Kerja Aplikasi VoIP Call Android di Jaringan MANET [Performance Analysis of VoIP Call Application Android in MANET (Mobile Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    Ryan Ari Setyawan

    2015-06-01

    Full Text Available Penelitian ini bertujuan menganalisis kinerja aplikasi  VoIP call android di jaringan MANET (mobile ad hoc network.  Hasil pengujian menunjukan bahwa aplikasi VoIP call android dapat digunakan di jaringan MANET. Delay yang dihasilkan paling besar di pengujian indoor dengan jarak 11-15 meter yakni sebesar 0,014624811 seconds. Packet loss yang dihasilkan pada range 1%-2% sedangkan standar packet loss yang ditetapkan oleh CISCO untuk layanan aplikasi VoIP adalah < 5%. Jitter yang dihasilkan yakni antara 0,01-0,06 seconds sedangkan standar yang ditetapkan oleh CISCO adalah ≤ 30 ms atau 0,03 seconds. Throughput yang dihasilkan pada proses pengujian yakni antar 161 kbps-481 kbps. *****This study aims to analyze the performance of VOIP call android application in the MANET (mobile ad hoc network. The results showed that VoIP applications could be implemented in MANET network. The highest  delay is produced in indoor testing  with distance of 11-15 meters,  which is equal to 0.014624811 seconds. Packet loss is generated in the range of 1% -2%, while packet loss standards set by Cisco for VoIP application services are <5%. The jitter is between 0.01 to 0.06 seconds, while the standard set by CISCO is ≤ 30 ms or 0.03 seconds. Throughput generated in the testing process is between 161 kbps-481 kbps.

  16. Minimizing the negative effects of device mobility in cell-based ad-hoc wireless computational grids

    CSIR Research Space (South Africa)

    Mudali, P

    2006-09-01

    Full Text Available agents, the Keep Alive Server [5], [7], and the Brokering Service [2], [5], [7]. This architecture has several limitations, one of which being the inadequate consideration for the mobility of the mobile agents. Tasks are indiscriminately aborted... result in a higher task abortion rate. Minimizing the Negative Effects of Device Mobility in Cell-based Ad-hoc Wireless Computational Grids P. Mudali1, M.O. Adigun2, and J.O. Emuoyibofarhe3 Department of Computer Science, University of Zululand...

  17. Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups

    Science.gov (United States)

    Desmedt, Yvo; Lange, Tanja; Burmester, Mike

    Task-specific groups are often formed in an ad-hoc manner within large corporate structures, such as companies. Take the following typical scenario: A director decides to set up a task force group for some specific project. An order is passed down the hierarchy where it finally reaches a manager who selects some employees to form the group. The members should communicate in a secure way and for efficiency, a symmetric encryption system is chosen. To establish a joint secret key for the group, a group key exchange (GKE) protocol is used. We show how to use an existing Public Key Infrastructure (PKI) to achieve authenticated GKE by modifying the protocol and particularly by including signatures.

  18. Illustrating, Quantifying, and Correcting for Bias in Post-hoc Analysis of Gene-Based Rare Variant Tests of Association.

    Science.gov (United States)

    Grinde, Kelsey E; Arbet, Jaron; Green, Alden; O'Connell, Michael; Valcarcel, Alessandra; Westra, Jason; Tintle, Nathan

    2017-01-01

    To date, gene-based rare variant testing approaches have focused on aggregating information across sets of variants to maximize statistical power in identifying genes showing significant association with diseases. Beyond identifying genes that are associated with diseases, the identification of causal variant(s) in those genes and estimation of their effect is crucial for planning replication studies and characterizing the genetic architecture of the locus. However, we illustrate that straightforward single-marker association statistics can suffer from substantial bias introduced by conditioning on gene-based test significance, due to the phenomenon often referred to as "winner's curse." We illustrate the ramifications of this bias on variant effect size estimation and variant prioritization/ranking approaches, outline parameters of genetic architecture that affect this bias, and propose a bootstrap resampling method to correct for this bias. We find that our correction method significantly reduces the bias due to winner's curse (average two-fold decrease in bias, p post-hoc estimation and ranking of variants after a gene-based test. Further work is necessary to continue seeking ways to reduce bias and improve inference in post-hoc analysis of gene-based tests under a wide variety of genetic architectures.

  19. Network-Based Effectiveness

    National Research Council Canada - National Science Library

    Friman, Henrik

    2006-01-01

    ... (extended from Leavitt, 1965). This text identifies aspects of network-based effectiveness that can benefit from a better understanding of leadership and management development of people, procedures, technology, and organizations...

  20. DEHAR: a Distributed Energy Harvesting Aware Routing Algorithm for Ad-hoc Multi-hop Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Jakobsen, Mikkel Koefoed; Madsen, Jan; Hansen, Michael Reichhardt

    2010-01-01

    One of the key design goals in Wireless Sensor Networks is long lasting or even continuous operation. Continuous operation is made possible through energy harvesting. Keeping the network operational imposes a demand to prevent network segmentation and power loss in nodes. It is therefore important...

  1. Illustrating, Quantifying, and Correcting for Bias in Post-hoc Analysis of Gene-Based Rare Variant Tests of Association

    Directory of Open Access Journals (Sweden)

    Kelsey E. Grinde

    2017-09-01

    Full Text Available To date, gene-based rare variant testing approaches have focused on aggregating information across sets of variants to maximize statistical power in identifying genes showing significant association with diseases. Beyond identifying genes that are associated with diseases, the identification of causal variant(s in those genes and estimation of their effect is crucial for planning replication studies and characterizing the genetic architecture of the locus. However, we illustrate that straightforward single-marker association statistics can suffer from substantial bias introduced by conditioning on gene-based test significance, due to the phenomenon often referred to as “winner's curse.” We illustrate the ramifications of this bias on variant effect size estimation and variant prioritization/ranking approaches, outline parameters of genetic architecture that affect this bias, and propose a bootstrap resampling method to correct for this bias. We find that our correction method significantly reduces the bias due to winner's curse (average two-fold decrease in bias, p < 2.2 × 10−6 and, consequently, substantially improves mean squared error and variant prioritization/ranking. The method is particularly helpful in adjustment for winner's curse effects when the initial gene-based test has low power and for relatively more common, non-causal variants. Adjustment for winner's curse is recommended for all post-hoc estimation and ranking of variants after a gene-based test. Further work is necessary to continue seeking ways to reduce bias and improve inference in post-hoc analysis of gene-based tests under a wide variety of genetic architectures.

  2. Monitoring of slope-instabilities and deformations with Micro-Electro-Mechanical-Systems (MEMS) in wireless ad-hoc Sensor Networks

    Science.gov (United States)

    Arnhardt, C.; Fernández-Steeger, T. M.; Azzam, R.

    2009-04-01

    In most mountainous regions, landslides represent a major threat to human life, properties and infrastructures. Nowadays existing landslide monitoring systems are often characterized by high efforts in terms of purchase, installation, maintenance, manpower and material. In addition (or because of this) only small areas or selective points of the endangered zone can be observed by the system. Therefore the improvement of existing and the development of new monitoring and warning systems are of high relevance. The joint project "Sensor based Landslide Early Warning Systems" (SLEWS) deals with the development of a prototypic Alarm- and Early Warning system (EWS) for different types of landslides using low-cost micro-sensors (MEMS) integrated in a wireless sensor network (WSN). Modern so called Ad-Hoc, Multi-Hop wireless sensor networks (WSN) are characterized by a self organizing and self-healing capacity of the system (autonomous systems). The network consists of numerous individual and own energy-supply operating sensor nodes, that can send data packages from their measuring devices (here: MEMS) over other nodes (Multi-Hop) to a collection point (gateway). The gateway provides the interface to central processing and data retrieval units (PC, Laptop or server) outside the network. In order to detect and monitor the different landslide processes (like fall, topple, spreading or sliding) 3D MEMS capacitive sensors made from single silicon crystals and glass were chosen to measure acceleration, tilting and altitude changes. Based on the so called MEMS (Micro-Electro-Mechanical Systems) technology, the sensors combine very small mechanical and electronic units, sensing elements and transducers on a small microchip. The mass production of such type of sensors allows low cost applications in different areas (like automobile industries, medicine, and automation technology). Apart from the small and so space saving size and the low costs another advantage is the energy

  3. Dynamic social networks based on movement

    Science.gov (United States)

    Scharf, Henry; Hooten, Mevin B.; Fosdick, Bailey K.; Johnson, Devin S.; London, Joshua M.; Durban, John W.

    2016-01-01

    Network modeling techniques provide a means for quantifying social structure in populations of individuals. Data used to define social connectivity are often expensive to collect and based on case-specific, ad hoc criteria. Moreover, in applications involving animal social networks, collection of these data is often opportunistic and can be invasive. Frequently, the social network of interest for a given population is closely related to the way individuals move. Thus, telemetry data, which are minimally invasive and relatively inexpensive to collect, present an alternative source of information. We develop a framework for using telemetry data to infer social relationships among animals. To achieve this, we propose a Bayesian hierarchical model with an underlying dynamic social network controlling movement of individuals via two mechanisms: an attractive effect and an aligning effect. We demonstrate the model and its ability to accurately identify complex social behavior in simulation, and apply our model to telemetry data arising from killer whales. Using auxiliary information about the study population, we investigate model validity and find the inferred dynamic social network is consistent with killer whale ecology and expert knowledge.

  4. An Ad Hoc Adaptive Hashing Technique forNon-Uniformly Distributed IP Address Lookup in Computer Networks

    Directory of Open Access Journals (Sweden)

    Christopher Martinez

    2007-02-01

    Full Text Available Hashing algorithms long have been widely adopted to design a fast address look-up process which involves a search through a large database to find a record associated with a given key. Hashing algorithms involve transforming a key inside each target data to a hash value hoping that the hashing would render the database a uniform distribution with respect to this new hash value. The close the final distribution is to uniform, the less search time would be required when a query is made. When the database is already key-wise uniformly distributed, any regular hashing algorithm, such as bit-extraction, bit-group XOR, etc., would easily lead to a statistically perfect uniform distribution after the hashing. On the other hand, if records in the database are instead not uniformly distributed as in almost all known practical applications, then even different regular hash functions would lead to very different performance. When the target database has a key with a highly skewed distributed value, performance delivered by regular hashing algorithms usually becomes far from desirable. This paper aims at designing a hashing algorithm to achieve the highest probability in leading to a uniformly distributed hash result from a non-uniformly distributed database. An analytical pre-process on the original database is first performed to extract critical information that would significantly benefit the design of a better hashing algorithm. This process includes sorting on the bits of the key to prioritize the use of them in the XOR hashing sequence, or in simple bit extraction, or even a combination of both. Such an ad hoc hash design is critical to adapting to all real-time situations when there exists a changing (and/or expanding database with an irregular non-uniform distribution. Significant improvement from simulation results is obtained in randomly generated data as well as real data.

  5. Assessing Clinical Microbiology Practice Guidelines: American Society for MicrobiologyAd HocCommittee on Evidence-Based Laboratory Medicine Practice Guidelines Assessment.

    Science.gov (United States)

    Nachamkin, Irving; Kirn, Thomas J; Westblade, Lars F; Humphries, Romney

    2017-11-01

    As part of the American Society for Microbiology (ASM) Evidence-Based Laboratory Medicine Practice Guidelines Committee of the Professional Practice Committee, an ad hoc committee was formed in 2014 to assess guidelines published by the committee using an assessment tool, Appraisal of Guidelines for Research Evaluation II (AGREE II). The AGREE II assessment helps reviewers determine whether published guidelines are robust, transparent, and clear in presenting practice recommendations in a standardized manner. Identifying strengths and weaknesses of practice guidelines by ad hoc assessments helps with improving future guidelines through the participation of key stakeholders. This minireview describes the development of the ad hoc committee and results from their review of several ASM best practices guidelines and a non-ASM practice guideline from the Emergency Nurses Association. Copyright © 2017 American Society for Microbiology.

  6. Pseudo-Coherence-Based MVDR Beamformer for Speech Enhancement with Ad Hoc Microphone Arrays

    DEFF Research Database (Denmark)

    Tavakoli, Vincent Mohammad; Jensen, Jesper Rindom; Christensen, Mads Græsbøll

    2015-01-01

    Speech enhancement with distributed arrays has been met with various methods. On the one hand, data independent methods require information about the position of sensors, so they are not suitable for dynamic geometries. On the other hand, Wiener-based methods cannot assure a distortionless output...

  7. Efficacy and safety of canagliflozin in patients with type 2 diabetes based on history of cardiovascular disease or cardiovascular risk factors: a post hoc analysis of pooled data

    National Research Council Canada - National Science Library

    Michael J Davies; Katherine Merton; Ujjwala Vijapurkar; Jacqueline Yee; Rong Qiu

    2017-01-01

    ...) with a favourable tolerability profile in a broad range of patients with T2DM. This post hoc analysis assessed the efficacy and safety of canagliflozin in patients with T2DM based on CV disease history or CV risk factors...

  8. MWAHCA: a multimedia wireless ad hoc cluster architecture.

    Science.gov (United States)

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

    2014-01-01

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

  9. MWAHCA: A Multimedia Wireless Ad Hoc Cluster Architecture

    Science.gov (United States)

    Diaz, Juan R.; Jimenez, Jose M.; Sendra, Sandra

    2014-01-01

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

  10. MWAHCA: A Multimedia Wireless Ad Hoc Cluster Architecture

    Directory of Open Access Journals (Sweden)

    Juan R. Diaz

    2014-01-01

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

  11. EWIDS: an extended wireless IDS for metropolitan wireless networks based on kinematical analysis

    OpenAIRE

    Pirmez, Luci; Vianna, Nilson Rocha; Correia, Reinaldo de Barros; Carmo, Luiz Fernando Rust da Costa; Farias, Cláudio Miceli de; Salmon, Hélio Mendes

    2011-01-01

    Wireless metropolitan area networks (WMANs) are well known to subject users or applications and to a vast gamma of security risks, hindering security critical distributed applications from employing this type of network as a communication infrastructure. Most existing approaches for addressing WMAN security issues use cryptography-based mechanisms or ad-hoc adapted versions of traditional Intrusion Detection Systems (IDS) for wired networks. While the first approach may lead to unfeasib...

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

  13. Cloud networking understanding cloud-based data center networks

    CERN Document Server

    Lee, Gary

    2014-01-01

    Cloud Networking: Understanding Cloud-Based Data Center Networks explains the evolution of established networking technologies into distributed, cloud-based networks. Starting with an overview of cloud technologies, the book explains how cloud data center networks leverage distributed systems for network virtualization, storage networking, and software-defined networking. The author offers insider perspective to key components that make a cloud network possible such as switch fabric technology and data center networking standards. The final chapters look ahead to developments in architectures

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

    Science.gov (United States)

    2010-09-01

    Wormhole . . . . . . . . . . . . . . . . . . . . . 78 6.3.7 Sinkhole . . . . . . . . . . . . . . . . . . . . . . 78 6.3.8 Byzantine...node’s RI becomes negative, it is avoided in the route selection process. 6.3.6 Wormhole . An attacker may accept packets, but then tunnel them to...another location. Wormhole attacks are severe threats to MANET routing proto- cols. This attack could prevent the discovery of any routes other than

  15. Sinc-function based Network

    DEFF Research Database (Denmark)

    Madsen, Per Printz

    1999-01-01

    The purpose of this paper is to describe a neural network (SNN), that is based on Shannons ideas of reconstruction of a real continuous function from its samples. The basic function, used in this network, is the Sinc-function. Two learning algorithms are described. A simple one called IM...

  16. Sinc-function based Network

    DEFF Research Database (Denmark)

    Madsen, Per Printz

    1998-01-01

    The purpose of this paper is to describe a neural network (SNN), that is based on Shannons ideas of reconstruction of a real continuous function from its samples. The basic function, used in this network, is the Sinc-function. Two learning algorithms are described. A simple one called IM...

  17. An evidence-based unified definition of lifelong and acquired premature ejaculation : report of the second international society for sexual medicine ad hoc committee for the definition of premature ejaculation

    National Research Council Canada - National Science Library

    Serefoglu, Ege Can; McMahon, Chris G; Waldinger, Marcel D|info:eu-repo/dai/nl/163958564; Althof, Stanley E; Shindel, Alan; Adaikan, Ganesh; Becher, Edgardo F; Dean, John; Giuliano, Francois; Hellstrom, Wayne Jg; Giraldi, Annamaria; Glina, Sidney; Incrocci, Luca; Jannini, Emmanuele; McCabe, Marita; Parish, Sharon; Rowland, David; Segraves, R Taylor; Sharlip, Ira; Torres, Luiz Otavio

    2014-01-01

    INTRODUCTION: The International Society for Sexual Medicine (ISSM) Ad Hoc Committee for the Definition of Premature Ejaculation developed the first evidence-based definition for lifelong premature ejaculation (PE...

  18. Network-based functional enrichment

    Directory of Open Access Journals (Sweden)

    Poirel Christopher L

    2011-11-01

    Full Text Available Abstract Background Many methods have been developed to infer and reason about molecular interaction networks. These approaches often yield networks with hundreds or thousands of nodes and up to an order of magnitude more edges. It is often desirable to summarize the biological information in such networks. A very common approach is to use gene function enrichment analysis for this task. A major drawback of this method is that it ignores information about the edges in the network being analyzed, i.e., it treats the network simply as a set of genes. In this paper, we introduce a novel method for functional enrichment that explicitly takes network interactions into account. Results Our approach naturally generalizes Fisher’s exact test, a gene set-based technique. Given a function of interest, we compute the subgraph of the network induced by genes annotated to this function. We use the sequence of sizes of the connected components of this sub-network to estimate its connectivity. We estimate the statistical significance of the connectivity empirically by a permutation test. We present three applications of our method: i determine which functions are enriched in a given network, ii given a network and an interesting sub-network of genes within that network, determine which functions are enriched in the sub-network, and iii given two networks, determine the functions for which the connectivity improves when we merge the second network into the first. Through these applications, we show that our approach is a natural alternative to network clustering algorithms. Conclusions We presented a novel approach to functional enrichment that takes into account the pairwise relationships among genes annotated by a particular function. Each of the three applications discovers highly relevant functions. We used our methods to study biological data from three different organisms. Our results demonstrate the wide applicability of our methods. Our algorithms are

  19. Reproducing and Extending Real Testbed Evaluation of GeoNetworking Implementation in Simulated Networks

    OpenAIRE

    Tao, Ye; Tsukada, Manabu; LI, Xin; Kakiuchi, Masatoshi; Esaki, Hiroshi

    2016-01-01

    International audience; Vehicular Ad-hoc Network (VANET) is a type of Mobile Ad-hoc Network (MANET) which is specialized for vehicle communication. GeoNetworking is a new standardized network layer protocol for VANET which employs geolocation based routing. However, conducting large scale experiments in GeoNetworking softwares is extremely difficult, since it requires many extra factors such as vehicles, stuff, place, terrain, etc. In this paper, we propose a method to reproduce realistic res...

  20. Assured Resource Sharing in Ad-Hoc Collaboration

    Energy Technology Data Exchange (ETDEWEB)

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

    2015-12-19

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

  1. Social-based autonomic routing in opportunistic networks

    Science.gov (United States)

    Boldrini, Chiara; Conti, Marco; Passarella, Andrea

    In opportunistic networks end-to-end communication between users does not require a continuous end-to-end path between source and destination. Network protocols are designed to be extremely resilient to events such as long partitions, node disconnections, etc, which are very features of this type of self-organizing ad hoc networks. This is achieved by temporarily storing messages at intermediate nodes, waiting for future opportunities to forward them towards the destination. The mobility of users plays a key role in opportunistic networks. Thus, providing accurate models of mobility patterns is one of the key research areas. In this chapter we firstly focus on this issue, with special emphasis on a class of social-aware models. These models are based on the observation that people move because they are attracted towards other people they have social relationships with, or towards physical places that have special meaning with respect to their social behavior. Another key research area in opportunistic networks is clearly designing routing and forwarding schemes. In this chapter we provide a survey of the main approaches to routing in purely infrastructure-less opportunistic networks, by classifying protocols based on the amount of context information they exploit.We then provide an extensive quantitative comparison between representatives of protocols that do not use any context information, and protocols that manage and exploit a rich set of context information. We mainly focus on the suitability of protocols to adapt to the dynamically changing network features, as resulting from the user movement patterns that are driven by their social behavior. Our results show that context-aware routing is extremely adaptive to dynamic networking scenarios, and, with respect to protocols that do not use any context information, is able to provide similar performance in terms of delay and loss rate, by using just a small fraction of the network resources.

  2. Awareness of Emerging Wireless Technologies: Ad-hoc and Personal Area Networks Standards and Emerging Technologies (Sensibilisation a l’emergence des technologies sans fil: technologies emergeantes et normes de reseaux personnels et ad-hoc)

    Science.gov (United States)

    2007-04-01

    solid base for the future . The content of this publication has been reproduced directly from material supplied by RTO or the authors. Published...Protocol (now v4, in future v6) IST Information Systems Technology x RTO-TR-IST-035 LMDS Local Multipoint Distribution Service LOS Line of...rubrique PAN (réseaux personnels). Ces technologies, avec un accent sur une faible alimentation , doivent être également vues dans le contexte d’une

  3. Post-hoc comparisons among iron electrode formulations based on bismuth, bismuth sulphide, iron sulphide, and potassium sulphide under strong alkaline conditions

    Science.gov (United States)

    Gil Posada, Jorge Omar; Hall, Peter J.

    2014-12-01

    Iron electrodes were prepared by hot-pressing iron-polyethylene based formulations on nickel foam stripes. NiFe cells were tested by using commercial nickel electrodes and our iron electrodes. Post-hoc comparisons were used to identify meaningful differences between iron electrode formulations (based upon bismuth, bismuth sulphate, potassium sulphide and iron sulphide as additives). Our results confirm that both bismuth sulphide and iron sulphide favour the process of charge/discharge of a NiFe cell. In addition, we have found that the use of metallic bismuth only marginally influences coulombic efficiency; likewise, the presence of the soluble bisulfide anion is not sufficient to increase coulombic efficiency. Finally, NiFe cells prepared with bismuth sulphide outperformed their iron sulphide counterparts.

  4. Context-Based Topology Control for Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Pragasen Mudali

    2016-01-01

    Full Text Available Topology Control has been shown to provide several benefits to wireless ad hoc and mesh networks. However these benefits have largely been demonstrated using simulation-based evaluations. In this paper, we demonstrate the negative impact that the PlainTC Topology Control prototype has on topology stability. This instability is found to be caused by the large number of transceiver power adjustments undertaken by the prototype. A context-based solution is offered to reduce the number of transceiver power adjustments undertaken without sacrificing the cumulative transceiver power savings and spatial reuse advantages gained from employing Topology Control in an infrastructure wireless mesh network. We propose the context-based PlainTC+ prototype and show that incorporating context information in the transceiver power adjustment process significantly reduces topology instability. In addition, improvements to network performance arising from the improved topology stability are also observed. Future plans to add real-time context-awareness to PlainTC+ will have the scheme being prototyped in a software-defined wireless mesh network test-bed being planned.

  5. Host Event Based Network Monitoring

    Energy Technology Data Exchange (ETDEWEB)

    Jonathan Chugg

    2013-01-01

    The purpose of INL’s research on this project is to demonstrate the feasibility of a host event based network monitoring tool and the effects on host performance. Current host based network monitoring tools work on polling which can miss activity if it occurs between polls. Instead of polling, a tool could be developed that makes use of event APIs in the operating system to receive asynchronous notifications of network activity. Analysis and logging of these events will allow the tool to construct the complete real-time and historical network configuration of the host while the tool is running. This research focused on three major operating systems commonly used by SCADA systems: Linux, WindowsXP, and Windows7. Windows 7 offers two paths that have minimal impact on the system and should be seriously considered. First is the new Windows Event Logging API, and, second, Windows 7 offers the ALE API within WFP. Any future work should focus on these methods.

  6. CNEM: Cluster Based Network Evolution Model

    Directory of Open Access Journals (Sweden)

    Sarwat Nizamani

    2015-01-01

    Full Text Available This paper presents a network evolution model, which is based on the clustering approach. The proposed approach depicts the network evolution, which demonstrates the network formation from individual nodes to fully evolved network. An agglomerative hierarchical clustering method is applied for the evolution of network. In the paper, we present three case studies which show the evolution of the networks from the scratch. These case studies include: terrorist network of 9/11 incidents, terrorist network of WMD (Weapons Mass Destruction plot against France and a network of tweets discussing a topic. The network of 9/11 is also used for evaluation, using other social network analysis methods which show that the clusters created using the proposed model of network evolution are of good quality, thus the proposed method can be used by law enforcement agencies in order to further investigate the criminal networks

  7. An Experimental QoE Performance Study for the Efficient Transmission of High Demanding Traffic over an Ad Hoc Network Using BATMAN

    Directory of Open Access Journals (Sweden)

    Ramon Sanchez-Iborra

    2015-01-01

    Full Text Available Multimedia communications are attracting great attention from the research, industry, and end-user communities. The latter are increasingly claiming for higher levels of quality and the possibility of consuming multimedia content from a plethora of devices at their disposal. Clearly, the most appealing gadgets are those that communicate wirelessly to access these services. However, current wireless technologies raise severe concerns to support extremely demanding services such as real-time multimedia transmissions. This paper evaluates from QoE and QoS perspectives the capability of the ad hoc routing protocol called BATMAN to support Voice over IP and video traffic. To this end, two test-benches were proposed, namely, a real (emulated testbed and a simulation framework. Additionally, a series of modifications was proposed on both protocols’ parameters settings and video-stream characteristics that contributes to further improving the multimedia quality perceived by the users. The performance of the well-extended protocol OLSR is also evaluated in detail to compare it with BATMAN. From the results, a notably high correlation between real experimentation and computer simulation outcomes was observed. It was also found out that, with the proper configuration, BATMAN is able to transmit several QCIF video-streams and VoIP calls with high quality. In addition, BATMAN outperforms OLSR supporting multimedia traffic in both experimental and simulated environments.

  8. A hop count based heuristic routing protocol for mobile delay tolerant networks.

    Science.gov (United States)

    You, Lei; Li, Jianbo; Wei, Changjiang; Dai, Chenqu; Xu, Jixing; Hu, Lejuan

    2014-01-01

    Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

  9. Adaptive, Tactical Mesh Networking: Control Base MANET Model

    Science.gov (United States)

    2010-09-01

    pp. 316–320 Available: IEEE Xplore , http://ieeexplore.ieee.org [Accessed: June 9, 2010]. [5] N. Sidiropoulos, “Multiuser Transmit Beamforming...Mobile Mesh Segments of TNT Testbed .......... 11 Figure 5. Infrastructure and Ad Hoc Mode of IEEE 802.11................................ 13 Figure...6. The Power Spectral Density of OFDM................................................ 14 Figure 7. A Typical IEEE 802.16 Network

  10. An evidence-based unified definition of lifelong and acquired premature ejaculation : report of the second international society for sexual medicine ad hoc committee for the definition of premature ejaculation

    NARCIS (Netherlands)

    Serefoglu, Ege Can; McMahon, Chris G; Waldinger, Marcel D|info:eu-repo/dai/nl/163958564; Althof, Stanley E; Shindel, Alan; Adaikan, Ganesh; Becher, Edgardo F; Dean, John; Giuliano, Francois; Hellstrom, Wayne Jg; Giraldi, Annamaria; Glina, Sidney; Incrocci, Luca; Jannini, Emmanuele; McCabe, Marita; Parish, Sharon; Rowland, David; Segraves, R Taylor; Sharlip, Ira; Torres, Luiz Otavio

    INTRODUCTION: The International Society for Sexual Medicine (ISSM) Ad Hoc Committee for the Definition of Premature Ejaculation developed the first evidence-based definition for lifelong premature ejaculation (PE) in 2007 and concluded that there were insufficient published objective data at that

  11. An acoustical model based monitoring network

    NARCIS (Netherlands)

    Wessels, P.W.; Basten, T.G.H.; Eerden, F.J.M. van der

    2010-01-01

    In this paper the approach for an acoustical model based monitoring network is demonstrated. This network is capable of reconstructing a noise map, based on the combination of measured sound levels and an acoustic model of the area. By pre-calculating the sound attenuation within the network the

  12. Improved Data Transmission Scheme of Network Coding Based on Access Point Optimization in VANET

    Directory of Open Access Journals (Sweden)

    Zhe Yang

    2014-01-01

    Full Text Available VANET is a hot spot of intelligent transportation researches. For vehicle users, the file sharing and content distribution through roadside access points (AP as well as the vehicular ad hoc networks (VANET have been an important complement to that cellular network. So the AP deployment is one of the key issues to improve the communication performance of VANET. In this paper, an access point optimization method is proposed based on particle swarm optimization algorithm. The transmission performances of the routing protocol with random linear network coding before and after the access point optimization are analyzed. The simulation results show the optimization model greatly affects the VANET transmission performances based on network coding, and it can enhance the delivery rate by 25% and 14% and reduce the average delay of transmission by 38% and 33%.

  13. DRO: domain-based route optimization scheme for nested mobile networks

    Directory of Open Access Journals (Sweden)

    Chuang Ming-Chin

    2011-01-01

    Full Text Available Abstract The network mobility (NEMO basic support protocol is designed to support NEMO management, and to ensure communication continuity between nodes in mobile networks. However, in nested mobile networks, NEMO suffers from the pinball routing problem, which results in long packet transmission delays. To solve the problem, we propose a domain-based route optimization (DRO scheme that incorporates a domain-based network architecture and ad hoc routing protocols for route optimization. DRO also improves the intra-domain handoff performance, reduces the convergence time during route optimization, and avoids the out-of-sequence packet problem. A detailed performance analysis and simulations were conducted to evaluate the scheme. The results demonstrate that DRO outperforms existing mechanisms in terms of packet transmission delay (i.e., better route-optimization, intra-domain handoff latency, convergence time, and packet tunneling overhead.

  14. Location based Network Optimizations for Mobile Wireless Networks

    DEFF Research Database (Denmark)

    Nielsen, Jimmy Jessen

    The availability of location information in mobile devices, e.g., through built-in GPS receivers in smart phones, has motivated the investigation of the usefulness of location based network optimizations. Since the quality of input information is important for network optimizations, a main focus...... of this work is to evaluate how location based network optimizations are affected by varying quality of input information such as location information and user movements. The first contribution in this thesis concerns cooperative network-based localization systems. The investigations focus on assessing...... the achievable accuracy of future localization system in mobile settings, as well as quantifying the impact of having a realistic model of the required measurement exchanges. Secondly, this work has considered different large scale and small scale location based network optimizations, namely centralized relay...

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

  16. A Network Coding Based Routing Protocol for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xin Guan

    2012-04-01

    Full Text Available Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs. Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR.We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime.

  17. A network coding based routing protocol for underwater sensor networks.

    Science.gov (United States)

    Wu, Huayang; Chen, Min; Guan, Xin

    2012-01-01

    Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime.

  18. Philosophical perspectives on ad hoc hypotheses and the Higgs mechanism

    NARCIS (Netherlands)

    Friederich, Simon; Harlander, Robert; Karaca, Koray

    2014-01-01

    We examine physicists' charge of ad hocness against the Higgs mechanism in the standard model of elementary particle physics. We argue that even though this charge never rested on a clear-cut and well-entrenched definition of "ad hoc", it is based on conceptual and methodological assumptions and

  19. A survey of evaluation platforms for ad hoc routing protocols: a resilience perspective

    OpenAIRE

    Friginal López, Jesús; Andrés Martínez, David De; Ruiz García, Juan Carlos; Martínez Raga, Miquel

    2014-01-01

    Routing protocols allow for the spontaneous formation of wireless multi-hop networks without dedicated infrastructure, also known as ad hoc networks. Despite significant technological advances, difficulties associated with the evaluation of ad hoc routing protocols under realistic conditions, still hamper their maturation and significant roll out in real world deployments. In particular, the resilience evaluation of ad hoc routing protocols is essential to determine their ability of keeping t...

  20. ENERGY AWARE NETWORK: BAYESIAN BELIEF NETWORKS BASED DECISION MANAGEMENT SYSTEM

    Directory of Open Access Journals (Sweden)

    Santosh Kumar Chaudhari

    2011-06-01

    Full Text Available A Network Management System (NMS plays a very important role in managing an ever-evolving telecommunication network. Generally an NMS monitors & maintains the health of network elements. The growing size of the network warrants extra functionalities from the NMS. An NMS provides all kinds of information about networks which can be used for other purposes apart from monitoring & maintaining networks like improving QoS & saving energy in the network. In this paper, we add another dimension to NMS services, namely, making an NMS energy aware. We propose a Decision Management System (DMS framework which uses a machine learning technique called Bayesian Belief Networks (BBN, to make the NMS energy aware. The DMS is capable of analysing and making control decisions based on network traffic. We factor in the cost of rerouting and power saving per port. Simulations are performed on standard network topologies, namely, ARPANet and IndiaNet. It is found that ~2.5-6.5% power can be saved.

  1. Inference of Gene Regulatory Network Based on Local Bayesian Networks.

    Science.gov (United States)

    Liu, Fei; Zhang, Shao-Wu; Guo, Wei-Feng; Wei, Ze-Gang; Chen, Luonan

    2016-08-01

    The inference of gene regulatory networks (GRNs) from expression data can mine the direct regulations among genes and gain deep insights into biological processes at a network level. During past decades, numerous computational approaches have been introduced for inferring the GRNs. However, many of them still suffer from various problems, e.g., Bayesian network (BN) methods cannot handle large-scale networks due to their high computational complexity, while information theory-based methods cannot identify the directions of regulatory interactions and also suffer from false positive/negative problems. To overcome the limitations, in this work we present a novel algorithm, namely local Bayesian network (LBN), to infer GRNs from gene expression data by using the network decomposition strategy and false-positive edge elimination scheme. Specifically, LBN algorithm first uses conditional mutual information (CMI) to construct an initial network or GRN, which is decomposed into a number of local networks or GRNs. Then, BN method is employed to generate a series of local BNs by selecting the k-nearest neighbors of each gene as its candidate regulatory genes, which significantly reduces the exponential search space from all possible GRN structures. Integrating these local BNs forms a tentative network or GRN by performing CMI, which reduces redundant regulations in the GRN and thus alleviates the false positive problem. The final network or GRN can be obtained by iteratively performing CMI and local BN on the tentative network. In the iterative process, the false or redundant regulations are gradually removed. When tested on the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in E.coli, our results suggest that LBN outperforms other state-of-the-art methods (ARACNE, GENIE3 and NARROMI) significantly, with more accurate and robust performance. In particular, the decomposition strategy with local Bayesian networks not only effectively reduce

  2. Durer-pentagon-based complex network

    Directory of Open Access Journals (Sweden)

    Rui Hou

    2016-04-01

    Full Text Available A novel Durer-pentagon-based complex network was constructed by adding a centre node. The properties of the complex network including the average degree, clustering coefficient, average path length, and fractal dimension were determined. The proposed complex network is small-world and fractal.

  3. Agent-based modeling and network dynamics

    CERN Document Server

    Namatame, Akira

    2016-01-01

    The book integrates agent-based modeling and network science. It is divided into three parts, namely, foundations, primary dynamics on and of social networks, and applications. The book begins with the network origin of agent-based models, known as cellular automata, and introduce a number of classic models, such as Schelling’s segregation model and Axelrod’s spatial game. The essence of the foundation part is the network-based agent-based models in which agents follow network-based decision rules. Under the influence of the substantial progress in network science in late 1990s, these models have been extended from using lattices into using small-world networks, scale-free networks, etc. The book also shows that the modern network science mainly driven by game-theorists and sociophysicists has inspired agent-based social scientists to develop alternative formation algorithms, known as agent-based social networks. The book reviews a number of pioneering and representative models in this family. Upon the gi...

  4. Effects of calcium channel blocker-based combinations on intra-individual blood pressure variability: post hoc analysis of the COPE trial

    Science.gov (United States)

    Umemoto, Seiji; Ogihara, Toshio; Matsuzaki, Masunori; Rakugi, Hiromi; Ohashi, Yasuo; Saruta, Takao; Ogihara, T; Saruta, T; Matsuzaki, M; Eto, T; Fujita, T; Higaki, J; Ito, S; Kamiya, A; Kikuchi, K; Matsuoka, H; Suzuki, H; Tei, C; Matsuoka, H; Kumagai, H; Ohashi, Y; Rakugi, H; Shimamoto, K; Takishita, S; Umemoto, S; Shimada, K; Hayashi, K; Kario, K; Kawana, M; Kitagawa, K; Makino, H; Matsumoto, M; Yoshikawa, J; Abe, K; Matsuura, H; Ohashi, Y; Otsuka, K; Tanabe, K; Suzuki, N; Nogawa, S; Utsunomiya, K; Yoshikawa, T; Yumura, W; Ohashi, Y; Umemoto, S; Kikuchi, K; Hasebe, N; Bunya, M; Fujii, W; Funayama, N; Gima, M; Hashizume, K; Hirayama, Y; Matsuhashi, H; Morimoto, H; Myojo, T; Ohori, K; Omiya, H; Ota, T; Sato, A; Shiokoshi, T; Tanaka, H; Yamazaki, K; Yoshie, H; Shimamoto, K; Abiru, M; Adachi, M; Fujise, Y; Hanawa, K; Ishii, K; Kadono, Y; Kaku, T; Kaneta, S; Kato, M; Kato, N; Kobayashi, H; Komakine, T; Matsumoto, T; Mita, T; Miura, N; Mukai, H; Nagao, K; Nakagawa, H; Nakagawa, M; Nakajima, N; Nishimiya, T; Nishino, Y; Nunokawa, A; Ohata, J; Ooiwa, H; Sato, R; Satoh, S; Shibata, S; Takada, M; Takagawa, Y; Takagi, Y; Takeichi, S; Tanaka, S; Togashi, N; Ura, N; Wakabayashi, C; Yoshida, D; Yoshida, H; Yoshida, K; Kitabatake, A; Tsutsui, H; Akutsu, M; Fujii, S; Furumoto, T; Kakinoki, S; Kawasaki, H; Kimura, T; Makiguchi, M; Matsuo, H; Okamoto, H; Oyama, Y; Shimokawa, J; Tsuzuki, N; Ito, S; Imai, Y; Domon, R; Ebina, H; Egawa, S; Haruyama, T; Hashimoto, H; Hayakawa, T; Inomata, H; Katahira, Y; Katakura, T; Kikuchi, R; Kimura, H; Kyogoku, S; Kyogoku, Y; Matsuo, K; Nakazawa, H; Odakura, H; Okuguchi, F; Ohtomo, E; Ouchi, H; Seino, M; Tadokoro, M; Tanno, Y; Uchida, N; Yamanaka, T; Yunomura, K; Okumura, K; Hatayama, T; Kanehira, Y; Kaneko, H; Kimura, M; Maeda, N; Mikuniya, A; Narita, H; Ono, M; Osanai, T; Sato, M; Yoshino, H; Momomura, S; Ono, M; Inoue, M; Iwase, T; Miyazaki, K; Taki, M; Aizawa, T; Hasunuma, Y; Makino, H; Okabayashi, H; Hosoda, S; Sumiyoshi, T; Abe, M; Kira, Y; Nagayama, M; Sakai, K; Yoshikawa, O; Ide, M; Kimura, N; Matsuzaka, S; Miyajima, Y; Sawai, K; Sumi, T; Takada, R; Toma, M; Yamada, Y; Yoda, K; Yokokawa, T; Yokoyama, S; Kanmatsuse, K; Kushiro, T; Anazawa, T; Ebuchi, T; Fujita, H; Katsumata, N; Masubuchi, K; Migita, T; Osada, T; Otsuka, Y; Saito, F; Shimoda, S; Sugino, K; Takahashi, A; Tani, S; Yumi, K; Daida, H; Arino, T; Iesaki, T; Inomata, Y; Nakahara, H; Shiraishi, H; Sudo, H; Degawa, T; Araki, T; Itaya, H; Komatsu, H; Kuwana, H; Mikawa, T; Nomoto, H; Ogawa, N; Sato, H; Takase, H; Toyoda, H; Yamamoto, M; Obayashi, K; Akabane, I; Hamamoto, H; Kanbara, R; Kato, H; Kimura, H; Mori, N; Yamada, K; Yamamuro, M; Isobe, M; Emoto, H; Inaba, O; Inazawa, T; Inomata, H; Isobe, K; Ito, Y; Komura, M; Kosuge, H; Maejima, Y; Miwa, N; Nishimori, T; Otomo, K; Sakurai, K; Sawada, M; Seya, M; Shimizu, M; Takagi, T; Tamura, M; Tanaka, K; Tezuka, D; Tokunaga, T; Yagishita, A; Yamashina, A; Hara, T; Hayashi, S; Hirayama, Y; Hirooka, Y; Iitaka, M; Ishiyama, T; Kijima, F; Kobayashi, H; Kobayashi, Y; Kondo, K; Kuwabara, T; Mugishima, M; Nakayama, Y; Nishizato, Y; Osamura, Y; Sakomura, Y; Saneshige, S; Shindo, N; Takao, N; Takata, Y; Tomiyama, H; Ishimaru, S; Obitsu, Y; Shigematsu, H; Baba, T; Fukushima, H; Hirayama, T; Magari, K; Makimura, S; Nagae, T; Osada, K; Osada, T; Shimizu, T; Suesada, H; Tamura, K; Yamazaki, T; Hirai, A; Fukasawa, T; Ono, H; Yamakado, M; Shiba, T; Otomi, S; Uehata, A; Takazawa, K; Aizawa, A; Iketani, T; Kino, M; Kobayashi, H; Morishima, T; Sakamoto, N; Sakamoto, T; Yamakawa, H; Kasanuki, H; Nagai, R; Kadowaki, T; Tanaka, J; Yamazaki, T; Takagi, M; Ui, S; Baba, S; Fujita, K; Hasegawa, T; Tajima, K; Tanaka, M; Yamato, N; Kuwajima, I; Harada, K; Miyata, H; Mizuno, S; Ueda, S; Sugi, K; Ando, H; Mishima, K; Moroi, M; Nishizawa, S; Suzuki, S; Yamazaki, J; Nakanishi, R; Nakano, H; Tokuyasu, K; Aoyagi, T; Fujioka, M; Kobayakawa, N; Nakajima, K; Hirayama, A; Tsukamoto, K; Araki, Y; Hara, H; Hara, K; Saruya, T; Umemura, S; Arima, M; Endo, T; Furumi, K; Hatori, Y; Ikeda, Y; Ikeya, Y; Kaneda, T; Kawada, T; Kawano, T; Kawashima, T; Kihara, M; Kikuta, M; Kitamura, A; Kobayashi, H; Kobayashi, S; Kuji, T; Masuda, S; Minamimoto, Y; Minamisawa, K; Mitsuhashi, T; Miyazaki, N; Nagashima, Z; Nakatogawa, T; Nakayama, R; Nyui, N; Ogawa, M; Onishi, T; Saka, K; Sano, T; Sato, A; Shiba, K; Shionoiri, F; Sugiyama, H; Suzuki, H; Takasaki, I; Tamura, K; Tokita, Y; Umemura, M; Yamaguchi, S; Yasuda, G; Nakamura, S; Takayanagi, K; Hayashi, T; Ichihara, M; Kobayashi, S; Sakai, Y; Uchida, T; Yaguchi, I; Komuro, I; Aoki, S; Hashimoto, Y; Ibuki, C; Isobe, Y; Kumasaka, R; Matsuda, M; Mizuno, K; Murakami, D; Nakamura, S; Nakatani, M; Ohba, T; Ohara, T; Okumura, T; Saito, A; Sakurai, T; Sato, S; Sato, W; Seimiya, K; Seino, Y; Shimizu, K; Takano, M; Tokuyama, K; Uchida, D; Yodogawa, K; Oshima, S; Kurabayashi, M; Baba, N; Furushima, Y; Goto, T; Hosoi, T; Iijima, T; Ito, K; Iwata, Y; Kubo, H; Matsumoto, M; Miyazaki, M; Naganuma, F; Nakada, K; Tokushima, M; Tsunoda, K; Wakamatsu, S; Yagihara, Y; Aizawa, Y; Aizawa, M; Aizawa, M; Hayashi, N; Hori, T; Kobayashi, H; Kodama, M; Maeda, K; Miura, K; Okada, K; Okura, Y; Sasagawa, Y; Takizawa, S; Tamura, M; Yamamoto, T; Murohara, T; Awaji, Y; Funahashi, H; Hayashi, D; Iida, M; Ishihara, D; Ishikawa, S; Kamide, S; Kanashiro, M; Kurebayashi, N; Kyo, S; Matsui, H; Matsuo, K; Morishima, M; Noda, H; Noda, T; Okumura, N; Ota, T; Shimizu, S; Somura, F; Takada, Y; Takeichi, Y; Takezawa, H; Uchikawa, T; Yoshikawa, D; Kimura, G; Ando, Y; Hoshiai, M; Okuda, N; Suzuki, S; Takada, K; Takada, N; Yamada, K; Hishida, H; Furuta, T; Hayashi, H; Ito, K; Kato, K; Nomura, M; Ota, T; Ohtsuki, M; Tabata, T; Taga, S; Tateishi, R; Ito, T; Fukuda, M; Iwa, T; Wakida, Y; Yonemoto, T; Watarai, M; Ito, M; Kawai, H; Murata, Y; Nomoto, S; Takemoto, K; Tsuboi, N; Yoshida, Y; Inoue, N; Ishikawa, M; Matsumoto, M; Muramatsu, T; Yoshida, R; Ono, M; Hanaki, Y; Sano, H; Shibata, Y; Sakai, K; Ajioka, M; Asano, H; Okamoto, R; Osanai, H; Uemura, Y; Yokoi, K; Tanaka, T; Kamiya, H; Miki, K; Niwa, M; Fujiwara, H; Minatoguchi, S; Arai, T; Kato, S; Kobayashi, H; Minagawa, T; Mori, N; Nakahara, K; Shimizu, Y; Tadokoro, M; Takahashi, N; Shigemasa, T; Kobayashi, I; Nakano, T; Ito, M; Fukui, A; Higashi, Y; Ito, T; Kano, U; Makino, K; Nakai, K; Nakajima, M; Nakajima, T; Sekoguchi, K; Tanaka, T; Tanigawa, T; Takekoshi, N; Enyama, H; Hirakawa, T; Ito, J; Ito, T; Kakuda, H; Kigoshi, T; Kondo, K; Masuya, K; Matoba, M; Nakagawa, A; Nakahashi, T; Nakato, H; Okada, H; Okuro, M; Takeuchi, Y; Tsugawa, H; Urata, T; Yasuhara, M; Shimizu, M; Ino, H; Araki, T; Fujino, N; Haraki, T; Hayashi, K; Hifumi, S; Konno, T; Minamoto, M; Miyamoto, S; Mori, M; Nakanishi, C; Sakamoto, Y; Sakata, K; Takeda, S; Ueda, K; Uchiyama, K; Takata, S; Kaneko, S; Aburadani, I; Inoki, I; Kitano, K; Kobayashi, D; Kontani, K; Maekawa, M; Maruyama, M; Matsunuma, K; Nagai, Y; Nagata, Y; Okajima, M; Otowa, K; Sekiguchi, Y; Shinmura, K; Usui, S; Yokoyama, H; Yonejima, M; Nakao, K; Hiraiwa, N; Ko, T; Masuda, I; Nagae, T; Nishino, K; Sakamoto, M; Kita, T; Nakagawa, Y; Kimura, T; Doi, T; Horiuchi, H; Kinoshita, M; Mizuno, M; Ohnishi, M; Shigemoto, K; Wada, A; Yamada, T; Yoshida, H; Nakagawa, M; Matsubara, H; Furukawa, K; Hatta, T; Inoue, A; Katsume, H; Masui, A; Matsumoto, S; Seki, T; Takeda, K; Taniguchi, Y; Tsuji, H; Saito, Y; Fukuoka, Y; Iwano, M; Katsuyama, T; Nakatani, A; Sakaguchi, Y; Konishi, T; Izumi, T; Toda, I; Kamimoto, A; Nagai, Y; Matsuwaka, E; Matsuwaka, R; Takei, K; Ueda, R; Wakaki, N; Iwasaka, T; Hamada, H; Hamada, S; Koga, H; Koito, H; Kono, K; Kurihara, H; Maeda, J; Morimoto, S; Takayama, Y; Aoyama, T; Imai, M; Ii, T; Kashii, S; Maenaka, M; Ohashi, H; Suyama, T; Matsuda, M; Aoyagi, Y; Kunisada, K; Mori, T; Mori, T; Uemura, J; Yokoi, Y; Morioka, N; Ozaki, T; Kanamasa, K; Ishikawa, K; Miyazaki, S; Arima, S; Kai, T; Kurooka, A; Shimada, I; Takewa, M; Taniguchi, M; Hattori, R; Haba, K; Yokota, R; Matsui, H; Tone, E; Yamahira, H; Kawarabayashi, T; Inaba, H; Sakaguchi, Y; Yamamoto, Y; Ito, H; Date, M; Dodo, M; Fujii, K; Imai, M; Inoue, K; Kanoh, Y; Komura, N; Senpuku, S; Takeda, M; Tateyama, H; Yasui, K; Yoneda, R; Morita, H; Kawanami, M; Tahara, A; Sado, T; Takamura, T; Taniwa, M; Kitaura, Y; Fukuda, M; Hanada, H; Nakamura, K; Sawada, K; Yamaguchi, M; Kodama, K; Higo, T; Hirata, A; Kanzaki, M; Komatsu, S; Matsuo, K; Murakawa, T; Nakanishi, H; Nemoto, T; Nishio, M; Ogasawara, N; Okuyama, Y; Ueda, Y; Imanishi, M; Kitamura, Y; Sakakibara, T; Yoshida, H; Yoshimi, H; Ogihara, T; Rakugi, H; Akiyama, M; Ikuno, Y; Imai, N; Imamura, Y; Inoyama, T; Kamide, K; Katahira, K; Katsuya, S; Katsuya, T; Kurokawa, Y; Matsuki, O; Matsuo, M; Nakamura, T; Ogura, E; Ohishi, M; Sasaki, R; Sugimoto, K; Tachi, J; Tanaka, H; Tanaka, H; Tsunetoshi, T; Yoshino, M; Hori, M; Awata, N; Fukukawa, T; Iimori, Y; Iwamoto, S; Sawami, K; Okamura, M; Kanayama, Y; Nagano, F; Nakayama, H; Suzuki, H; Amano, T; Tachibana, K; Arita, Y; Kirino, M; Sakuyama, K; Shukawa, M; Nishida, Y; Sakamoto, T; Yanagi, S; Hirota, K; Majima, T; Ota, T; Tanaka, T; Nohara, R; Funauchi, T; Isogai, O; Takashima, S; Koike, H; Nishimoto, M; Kawase, Y; Tojo, O; Chimori, Y; Harada, H; Takeoka, H; Kishi, S; Yokoyama, M; Hirata, K; Ejiri, J; Emoto, R; Furuta, Y; Hattori, K; Kuroda, R; Maehashi, N; Monnaka, H; Ohashi, Y; Okada, T; Suzuki, H; Takeuchi, M; Ohyanagi, M; Masai, M; Masuyama, T; Kawabata, M; Kajiya, T; Daito, N; Fujisawa, T; Fujita, S; Hasegawa, M; Hirakoba, M; Hirano, T; Ikeda, Y; Imai, N; Marumoto, K; Masuda, S; Miki, T; Mitsunaga, M; Mitsuoka, H; Miyachi, Y; Mukohara, N; Nagao, T; Nakada, K; Nishian, K; Nishioka, S; Ogura, T; Onishi, Y; Sakaguchi, K; Sano, I; Sano, W; Shigenobu, M; Tabuchi, A; Takashima, J; Taniguchi, Y; Uchida, H; Ueda, T; Urabe, N; Makino, H; Harada, S; Hirakawa, S; Hirata, H; Ishii, J; Koten, K; Nagake, Y; Nakajima, T; Nakamura, Y; Terami, T; Mitsudo, K; Fujii, M; Fujita, K; Iwano, E; Kadota, K; Nishihara, Y; Takaya, Y; Yamamoto, H; Yamamoto, T; Shigemasa, C; Hisatome, I; Kato, T; Miyakoda, H; Sakamoto, M; Shimoyama, M; Shimada, T; Tanabe, K; Goto, Y; Hanada, Y; Kawakami, K; Kitamura, J; Kitamura, K; Nakata, H; Oyake, N; Sugiura, H; Tsukihashi, H; Matsuzaki, M; Umemoto, S; Aoyagi, S; Aoyama, H; Fujino, T; Fukuta, S; Hiroyama, N; Ikeda, Y; Inamoto, Y; Kametani, R; Kamiya, A; Kanamaru, Y; Kotoku, S; Matsushima, A; Morita, J; Murano, Y; Nakatsuka, M; Nishimura, S; Nisnimura, Y; Okamura, T; Okuda, F; Onaka, U; Ozaki, M; Shimizu, A; Takata, C; Tamitani, M; Watada, T; Watada, T; Yamamoto, K; Yamauchi, M; Yorozu, T; Yoshikane, H; Yoshino, F; Higaki, J; Doiuchi, J; Fukuoka, T; Hashimoto, H; Igase, M; Kadota, H; Kaneko, H; Komatsu, S; Matsubara, Y; Miyoshi, K; Murakami, K; Murao, S; Niiya, T; Ochi, T; Satoh, A; Seki, T; Takahashi, H; Yamashita, T; Yoshino, T; Kohno, M; Fujita, N; Fukui, T; Hamamoto, T; Hasegawa, K; Hitomi, H; Ihara, K; Kiyomoto, H; Masugata, H; Matsumoto, I; Takahashi, N; Yoshikawa, K; Doi, Y; Arisawa, M; Egawa, T; Fukuda, M; Kawada, Y; Kusunose, H; Maeda, T; Minami, N; Nishinaga, M; Noguchi, T; Okabayashi, K; Sato, K; Satomi, T; Takada, J; Tamura, S; Usui, T; Yamada, M; Irahara, M; Azuma, H; Fujimura, M; Fujino, H; Fujino, M; Harada, E; Harada, S; Hiasa, Y; Hosokawa, S; Kawahara, K; Koshiba, K; Murakami, M; Nakaya, Y; Nii, H; Nozaki, S; Ota, A; Ozaki, T; Sone, K; Tsutsui, Y; Ueta, S; Nobuyoshi, M; Fujishima, Y; Hisano, K; Ikezono, H; Imawatari, R; Izumi, Y; Kanai, H; Nakamura, T; Nakamura, T; Noda, T; Ono, E; Tanaka, S; Tsuiki, T; Yanai, T; Sasaguri, T; Akimitsu, S; Dohmen, K; Fujisawa, K; Fukuyo, K; Harashima, S; Hayashi, T; Hirata, M; Hirata, Y; Ikeda, N; Ikematsu, H; Ikematsu, W; Kajiyama, W; Kawakami, Y; Kawasaki, I; Kondo, H; Kusuhara, H; Maeda, N; Miyahara, H; Motomura, A; Nakamura, K; Noguchi, T; Okinaga, T; Sato, M; Shimada, I; Shin, H; Soejima, K; Sugi, K; Taniguchi, T; Uwatoku, T; Yamaga, S; Yamaji, K; Yanagi, J; Yano, H; Saku, K; Enomoto, M; Hiratsuka, T; Imoto, K; Kamei, R; Kanaya, H; Kohara, M; Kusuda, M; Nishikawa, H; Sako, H; Imaizumi, T; Yano, K; Maemura, K; Ashizawa, N; Hazama, M; Ishida, Y; Ito, T; Kanda, M; Kimura, M; Noguchi, T; Oku, Y; Seto, S; Suzuki, S; Ogawa, H; Goto, K; Honjio, K; Horio, Y; Jinnouchi, H; Kaku, Y; Kawano, S; Kimura, T; Kiyohara, Y; Maki, A; Matsumoto, N; Misumi, K; Sakamoto, T; Sasaki, K; Sugiyama, S; Tanaka, E; Uemura, S; Tei, C; Arima, K; Daitoku, Y; Eto, H; Hashino, T; Ichinari, K; Ikeda, Y; Iriki, A; Kiyonaga, K; Kubota, K; Makise, Y; Masuzaki, S; Miyata, M; Mizoguchi, H; Niiyama, T; Samejima, Y; Yonezawa, S

    2016-01-01

    Visit-to-visit blood pressure (BP) variability is an important predictor of stroke. However, which antihypertensive drug combination is better at reducing visit-to-visit BP variability and therefore at reducing stroke incidence remains uncertain. We have previously reported that the dihydropyridine calcium channel blocker benidipine combined with a β-blocker appeared to be less beneficial in reducing the risk of stroke than a combination of benidipine and thiazide. Here, we further compare the visit-to-visit BP variability among three benidipine-based regimens, namely angiotensin receptor blocker (ARB), β-blocker and thiazide combinations. The present post hoc analysis included 2983 patients without cardiovascular events or death during the first 18 months after randomization. We compared the BP variability (defined as the s.d. and the coefficient of variation (CV)), maximum systolic BP (SBP) and diastolic BP (DBP) of the clinic mean on-treatment BPs obtained at 6-month intervals, starting 6 months after the treatment initiation, among the 3 treatments (ARB, n=1026; β-blocker, n=966; thiazide, n=991). During the first 6–36 months after randomization, both the s.d. and CV-BPs were lower in the benidipine–thiazide group than in the benidipine–β-blocker group (s.d.-SBP, P=0.019; s.d.-DBP, P=0.030; CV-SBP, P=0.012; CV-DBP, P=0.022). The s.d. and CV in the ARB group did not reach statistical significance compared with the other two groups. The maximum BPs did not differ among the three treatments. These findings suggest that the benidipine–thiazide combination may reduce visit-to-visit BP variability more than the benidipine–β-blocker combination. PMID:26490089

  5. Blood transfusion strategy and risk of postoperative delirium in nursing homes residents with hip fracture. A post hoc analysis based on the TRIFE randomized controlled trial.

    Science.gov (United States)

    Blandfort, Sif; Gregersen, Merete; Borris, Lars Carl; Damsgaard, Else Marie

    2017-06-01

    To investigate whether a liberal blood transfusion strategy [Hb levels ≥11.3 g/dL (7 mmol/L)] reduces the risk of postoperative delirium (POD) on day 10, among nursing home residents with hip fracture, compared to a restrictive transfusion strategy [Hb levels ≥9.7 g/dL (6 mmol/L)]. Furthermore, to investigate whether POD influences mortality within 90 days after hip surgery. This is a post hoc analysis based on The TRIFE - a randomized controlled trial. Frail anemic patients from the Orthopedic Surgical Ward at Aarhus University Hospital were enrolled consecutively between January 18, 2010 and June 6, 2013. These patients (aged ≥65 years) had been admitted from nursing homes for unilateral hip fracture surgery. After surgery, 179 patients were included in this study. On the first day of hospitalization, all enrolled patients were examined for cognitive impairment (assessed by MMSE) and delirium (assessed by CAM). Delirium was also assessed on the tenth postoperative day. The prevalence of delirium was 10 % in patients allocated to a liberal blood transfusion strategy (LB) and 21 % in the group with a restrictive blood transfusion strategy (RB). LB prevents development of delirium on day 10, compared to RB, odds ratio 0.41 (95 % CI 0.17-0.96), p = 0.04. Development of POD on day 10 increased the risk of 90-day death, hazard ratio 3.14 (95 % CI 1.72-5.78), p < 0.001. In nursing home residents undergoing surgery for hip fracture, maintaining hemoglobin level above 11.3 g/dL reduces the rate of POD on day 10 compared to a RB. Development of POD is associated with increased mortality.

  6. Network Medicine: A Network-based Approach to Human Diseases

    Science.gov (United States)

    Ghiassian, Susan Dina

    With the availability of large-scale data, it is now possible to systematically study the underlying interaction maps of many complex systems in multiple disciplines. Statistical physics has a long and successful history in modeling and characterizing systems with a large number of interacting individuals. Indeed, numerous approaches that were first developed in the context of statistical physics, such as the notion of random walks and diffusion processes, have been applied successfully to study and characterize complex systems in the context of network science. Based on these tools, network science has made important contributions to our understanding of many real-world, self-organizing systems, for example in computer science, sociology and economics. Biological systems are no exception. Indeed, recent studies reflect the necessity of applying statistical and network-based approaches in order to understand complex biological systems, such as cells. In these approaches, a cell is viewed as a complex network consisting of interactions among cellular components, such as genes and proteins. Given the cellular network as a platform, machinery, functionality and failure of a cell can be studied with network-based approaches, a field known as systems biology. Here, we apply network-based approaches to explore human diseases and their associated genes within the cellular network. This dissertation is divided in three parts: (i) A systematic analysis of the connectivity patterns among disease proteins within the cellular network. The quantification of these patterns inspires the design of an algorithm which predicts a disease-specific subnetwork containing yet unknown disease associated proteins. (ii) We apply the introduced algorithm to explore the common underlying mechanism of many complex diseases. We detect a subnetwork from which inflammatory processes initiate and result in many autoimmune diseases. (iii) The last chapter of this dissertation describes the

  7. Donor-derived transmission events in 2013: a report of the Organ Procurement Transplant Network Ad Hoc Disease Transmission Advisory Committee.

    Science.gov (United States)

    Green, Michael; Covington, Shandie; Taranto, Sarah; Wolfe, Cameron; Bell, Walter; Biggins, Scott W; Conti, David; DeStefano, G David; Dominguez, Edward; Ennis, Donna; Gross, Thomas; Klassen-Fischer, Mary; Kotton, Camille; LaPointe-Rudow, Dianne; Law, Yuk; Ludrosky, Kristen; Menegus, Marilyn; Morris, Michele I; Nalesnik, Michael A; Pavlakis, Martha; Pruett, Timothy; Sifri, Costi; Kaul, Daniel

    2015-02-01

    The Organ Procurement Transplant Network Disease Transmission Advisory Committee (DTAC), a multidisciplinary committee, evaluates potential donor-derived transmission events (PDDTE), including infections and malignancies, to assess for donor transmitted events. Reports of unexpected PDDTE to Organ Procurement Transplant Network in 2013 were fully reviewed by DTAC. A standardized algorithm was used to assess each PDDTE from a given donor and to classify each individual recipient from that donor. Of 443 total PDDTE submitted, 159 were triaged and not sent out to the full DTAC. Of 284 fully evaluated reports, 32 (11.3%) resulted in a proven/probable (P/P) transmission of infection, malignancy or other conditions to 42 recipients. Of 204 infection events, 24 were classified as P/P affecting 30 recipients, with four deaths. Bacteria were the most frequently reported type of infection, accounting for 99 reports but only 12 recipients from 11 donors experienced P/P transmission. There were 65 donors reported with potential malignancy events and 5 were classified as P/P transmissions with 8 affected recipients and 2 deaths. Additionally, there were 16 noninfection, nonmalignancy reports resulting in 3 P/P transmissions to 4 recipients and 1 death. There was a 43% increase in the number of PDDTE reported and reviewed in 2013 over 2012. However, the percent with P/P transmission remains low, affecting recipients from 32 donors especially when compared with the more than 14,000 donors recovered annually in the United States. The continued use of the new standard algorithm and triaging process will enhance the reproducibility of DTAC assessments and allow more robust analysis of our aggregate DTAC experience.

  8. Network repair based on community structure

    Science.gov (United States)

    Wang, Tianyu; Zhang, Jun; Sun, Xiaoqian; Wandelt, Sebastian

    2017-06-01

    Real-world complex systems are often fragile under disruptions. Accordingly, research on network repair has been studied intensively. Recently proposed efficient strategies for network disruption, based on collective influence, call for more research on efficient network repair strategies. Existing strategies are often designed to repair networks with local information only. However, the absence of global information impedes the creation of efficient repairs. Motivated by this limitation, we propose a concept of community-level repair, which leverages the community structure of the network during the repair process. Moreover, we devise a general framework of network repair, with in total six instances. Evaluations on real-world and random networks show the effectiveness and efficiency of the community-level repair approaches, compared to local and random repairs. Our study contributes to a better understanding of repair processes, and reveals that exploitation of the community structure improves the repair process on a disrupted network significantly.

  9. Community Based Networks and 5G

    DEFF Research Database (Denmark)

    Williams, Idongesit

    2016-01-01

    is hinged on a research aimed at understanding how and why Community Based Networks deploy telecom and Broadband infrastructure. The study was a qualitative study carried out inductively using Grounded Theory. Six cases were investigated.Two Community Based Network Mobilization models were identified......The deployment of previous wireless standards has provided more benefits for urban dwellers than rural dwellers. 5G deployment may not be different. This paper identifies that Community Based Networks as carriers that deserve recognition as potential 5G providers may change this. The argument....... The findings indicate that 5G connectivity can be extended to rural areas by these networks, via heterogenous networks. Hence the delivery of 5G data rates delivery via Wireless WAN in rural areas can be achieved by utilizing the causal factors of the identified models for Community Based Networks....

  10. Memristor-based neural networks

    Science.gov (United States)

    Thomas, Andy

    2013-03-01

    The synapse is a crucial element in biological neural networks, but a simple electronic equivalent has been absent. This complicates the development of hardware that imitates biological architectures in the nervous system. Now, the recent progress in the experimental realization of memristive devices has renewed interest in artificial neural networks. The resistance of a memristive system depends on its past states and exactly this functionality can be used to mimic the synaptic connections in a (human) brain. After a short introduction to memristors, we present and explain the relevant mechanisms in a biological neural network, such as long-term potentiation and spike time-dependent plasticity, and determine the minimal requirements for an artificial neural network. We review the implementations of these processes using basic electric circuits and more complex mechanisms that either imitate biological systems or could act as a model system for them.

  11. Cilia-based transport networks

    Science.gov (United States)

    Bodenschatz, Eberhard

    Cerebrospinal fluid conveys many physiologically important signaling factors through the ventricular cavities of the brain. We investigated the transport of cerebrospinal fluid in the third ventricle of the mouse brain and discovered a highly organized pattern of cilia modules, which collectively give rise to a network of fluid flows that allows for precise transport within this ventricle. Our work suggests that ciliated epithelia can generate and maintain complex, spatiotemporally regulated flow networks. I shall also show results on how to assemble artificial cilia and cilia carpets. Supported by the BMBF MaxSynBio.

  12. On mobile wireless ad hoc IP video transports

    Science.gov (United States)

    Kazantzidis, Matheos

    2006-05-01

    Multimedia transports in wireless, ad-hoc, multi-hop or mobile networks must be capable of obtaining information about the network and adaptively tune sending and encoding parameters to the network response. Obtaining meaningful metrics to guide a stable congestion control mechanism in the transport (i.e. passive, simple, end-to-end and network technology independent) is a complex problem. Equally difficult is obtaining a reliable QoS metrics that agrees with user perception in a client/server or distributed environment. Existing metrics, objective or subjective, are commonly used after or before to test or report on a transmission and require access to both original and transmitted frames. In this paper, we propose that an efficient and successful video delivery and the optimization of overall network QoS requires innovation in a) a direct measurement of available and bottleneck capacity for its congestion control and b) a meaningful subjective QoS metric that is dynamically reported to video sender. Once these are in place, a binomial -stable, fair and TCP friendly- algorithm can be used to determine the sending rate and other packet video parameters. An adaptive mpeg codec can then continually test and fit its parameters and temporal-spatial data-error control balance using the perceived QoS dynamic feedback. We suggest a new measurement based on a packet dispersion technique that is independent of underlying network mechanisms. We then present a binomial control based on direct measurements. We implement a QoS metric that is known to agree with user perception (MPQM) in a client/server, distributed environment by using predetermined table lookups and characterization of video content.

  13. Cognitive Radio-based Home Area Networks

    NARCIS (Netherlands)

    Sarijari, M.A.B.

    2016-01-01

    A future home area network (HAN) is envisaged to consist of a large number of devices that support various applications such as smart grid, security and safety systems, voice call, and video streaming. Most of these home devices are communicating based on various wireless networking technologies

  14. A Latency and Coverage Optimized Data Collection Scheme for Smart Cities Based on Vehicular Ad-hoc Networks.

    Science.gov (United States)

    Xu, Yixuan; Chen, Xi; Liu, Anfeng; Hu, Chunhua

    2017-04-18

    Using mobile vehicles as "data mules" to collect data generated by a huge number of sensing devices that are widely spread across smart city is considered to be an economical and effective way of obtaining data about smart cities. However, currently most research focuses on the feasibility of the proposed methods instead of their final performance. In this paper, a latency and coverage optimized data collection (LCODC) scheme is proposed to collect data on smart cities through opportunistic routing. Compared with other schemes, the efficiency of data collection is improved since the data flow in LCODC scheme consists of not only vehicle to device transmission (V2D), but also vehicle to vehicle transmission (V2V). Besides, through data mining on patterns hidden in the smart city, waste and redundancy in the utilization of public resources are mitigated, leading to the easy implementation of our scheme. In detail, no extra supporting device is needed in the LCODC scheme to facilitate data transmission. A large-scale and real-world dataset on Beijing is used to evaluate the LCODC scheme. Results indicate that with very limited costs, the LCODC scheme enables the average latency to decrease from several hours to around 12 min with respect to schemes where V2V transmission is disabled while the coverage rate is able to reach over 30%.

  15. A Latency and Coverage Optimized Data Collection Scheme for Smart Cities Based on Vehicular Ad-Hoc Networks

    Science.gov (United States)

    Xu, Yixuan; Chen, Xi; Liu, Anfeng; Hu, Chunhua

    2017-01-01

    Using mobile vehicles as “data mules” to collect data generated by a huge number of sensing devices that are widely spread across smart city is considered to be an economical and effective way of obtaining data about smart cities. However, currently most research focuses on the feasibility of the proposed methods instead of their final performance. In this paper, a latency and coverage optimized data collection (LCODC) scheme is proposed to collect data on smart cities through opportunistic routing. Compared with other schemes, the efficiency of data collection is improved since the data flow in LCODC scheme consists of not only vehicle to device transmission (V2D), but also vehicle to vehicle transmission (V2V). Besides, through data mining on patterns hidden in the smart city, waste and redundancy in the utilization of public resources are mitigated, leading to the easy implementation of our scheme. In detail, no extra supporting device is needed in the LCODC scheme to facilitate data transmission. A large-scale and real-world dataset on Beijing is used to evaluate the LCODC scheme. Results indicate that with very limited costs, the LCODC scheme enables the average latency to decrease from several hours to around 12 min with respect to schemes where V2V transmission is disabled while the coverage rate is able to reach over 30%. PMID:28420218

  16. Model-based control of networked systems

    CERN Document Server

    Garcia, Eloy; Montestruque, Luis A

    2014-01-01

    This monograph introduces a class of networked control systems (NCS) called model-based networked control systems (MB-NCS) and presents various architectures and control strategies designed to improve the performance of NCS. The overall performance of NCS considers the appropriate use of network resources, particularly network bandwidth, in conjunction with the desired response of the system being controlled.   The book begins with a detailed description of the basic MB-NCS architecture that provides stability conditions in terms of state feedback updates . It also covers typical problems in NCS such as network delays, network scheduling, and data quantization, as well as more general control problems such as output feedback control, nonlinear systems stabilization, and tracking control.   Key features and topics include: Time-triggered and event-triggered feedback updates Stabilization of uncertain systems subject to time delays, quantization, and extended absence of feedback Optimal control analysis and ...

  17. Modeling the interdependent network based on two-mode networks

    Science.gov (United States)

    An, Feng; Gao, Xiangyun; Guan, Jianhe; Huang, Shupei; Liu, Qian

    2017-10-01

    Among heterogeneous networks, there exist obviously and closely interdependent linkages. Unlike existing research primarily focus on the theoretical research of physical interdependent network model. We propose a two-layer interdependent network model based on two-mode networks to explore the interdependent features in the reality. Specifically, we construct a two-layer interdependent loan network and develop several dependent features indices. The model is verified to enable us to capture the loan dependent features of listed companies based on loan behaviors and shared shareholders. Taking Chinese debit and credit market as case study, the main conclusions are: (1) only few listed companies shoulder the main capital transmission (20% listed companies occupy almost 70% dependent degree). (2) The control of these key listed companies will be more effective of avoiding the spreading of financial risks. (3) Identifying the companies with high betweenness centrality and controlling them could be helpful to monitor the financial risk spreading. (4) The capital transmission channel among Chinese financial listed companies and Chinese non-financial listed companies are relatively strong. However, under greater pressure of demand of capital transmission (70% edges failed), the transmission channel, which constructed by debit and credit behavior, will eventually collapse.

  18. Dynamics-based centrality for directed networks.

    Science.gov (United States)

    Masuda, Naoki; Kori, Hiroshi

    2010-11-01

    Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based centrality, which has mainly been applied to strongly connected networks, to the case of general directed networks such that we can quantitatively compare arbitrary nodes. Toward this end, we adopt the idea used in the PageRank to introduce global connectivity between all the pairs of nodes with a certain strength. Numerical simulations are carried out on some networks. We also offer interpretations of the Laplacian-based centrality for general directed networks in terms of various dynamical and structural properties of networks. Importantly, the Laplacian-based centrality defined as the stationary density of the continuous-time random walk with random jumps is shown to be equivalent to the absorption probability of the random walk with sinks at each node but without random jumps. Similarly, the proposed centrality represents the importance of nodes in dynamics on the original network supplied with sinks but not with random jumps.

  19. Post hoc analyses: after the facts.

    Science.gov (United States)

    Srinivas, Titte R; Ho, Bing; Kang, Joseph; Kaplan, Bruce

    2015-01-01

    Prospective clinical trials are constructed with high levels of internal validity. Sample size and power considerations usually address primary endpoints. Primary endpoints have traditionally included events that are becoming increasingly less common and thus have led to growing use of composite endpoints and noninferiority trial designs in transplantation. This approach may mask real clinical benefit in one or the other domain with regard to either clinically relevant secondary endpoints or other unexpected findings. In addition, endpoints solely chosen based on power considerations are prone to misjudgment of actual treatment effect size as well as consistency of that effect. In the instances where treatment effects may have been underestimated, valuable information may be lost if buried within a composite endpoint. In all these cases, analyses and post hoc analyses of data become relevant in informing practitioners about clinical benefits or safety signals that may not be captured by the primary endpoint. On the other hand, there are many pitfalls in using post hoc determined endpoints. This short review is meant to allow readers to appreciate post hoc analysis not as an entity with a single approach, but rather as an analysis with unique limitations and strengths that often raise new questions to be addressed in further inquiries.

  20. Cloud-based Networked Visual Servo Control

    DEFF Research Database (Denmark)

    Wu, Haiyan; Lu, Lei; Chen, Chih-Chung

    2013-01-01

    feedback, ii) a stabilizing control law for the networked visual servo control system with time-varying feedback time delay, and iii) a sending rate scheduling strategy aiming at reducing the communication network load. The performance of the networked visual servo control system with sending rate......The performance of vision-based control systems, in particular of highly dynamic vision-based motion control systems, is often limited by the low sampling rate of the visual feedback caused by the long image processing time. In order to overcome this problem, the networked visual servo control......, which integrates networked computational resources for cloud image processing, is considered in this article. The main contributions of this article are i) a real-time transport protocol for transmitting large volume image data on a cloud computing platform, which enables high sampling rate visual...

  1. Vehicular Networking Enhancement And Multi-Channel Routing Optimization, Based on Multi-Objective Metric and Minimum Spanning Tree

    Directory of Open Access Journals (Sweden)

    Peppino Fazio

    2013-01-01

    Full Text Available Vehicular Ad hoc NETworks (VANETs represent a particular mobile technology that permits the communication among vehicles, offering security and comfort. Nowadays, distributed mobile wireless computing is becoming a very important communications paradigm, due to its flexibility to adapt to different mobile applications. VANETs are a practical example of data exchanging among real mobile nodes. To enable communications within an ad-hoc network, characterized by continuous node movements, routing protocols are needed to react to frequent changes in network topology. In this paper, the attention is focused mainly on the network layer of VANETs, proposing a novel approach to reduce the interference level during mobile transmission, based on the multi-channel nature of IEEE 802.11p (1609.4 standard. In this work a new routing protocol based on Distance Vector algorithm is presented to reduce the delay end to end and to increase packet delivery ratio (PDR and throughput in VANETs. A new metric is also proposed, based on the maximization of the average Signal-to-Interference Ratio (SIR level and the link duration probability between two VANET nodes. In order to relieve the effects of the co-channel interference perceived by mobile nodes, transmission channels are switched on a basis of a periodical SIR evaluation. A Network Simulator has been used for implementing and testing the proposed idea.

  2. Adhoc: an R package to calculate ad hoc distance thresholds for DNA barcoding identification

    Directory of Open Access Journals (Sweden)

    Gontran Sonet

    2013-12-01

    Full Text Available Identification by DNA barcoding is more likely to be erroneous when it is based on a large distance between the query (the barcode sequence of the specimen to identify and its best match in a reference barcode library. The number of such false positive identifications can be decreased by setting a distance threshold above which identification has to be rejected. To this end, we proposed recently to use an ad hoc distance threshold producing identifications with an estimated relative error probability that can be fixed by the user (e.g. 5%. Here we introduce two R functions that automate the calculation of ad hoc distance thresholds for reference libraries of DNA barcodes. The scripts of both functions, a user manual and an example file are available on the JEMU website (http://jemu.myspecies.info/computer-programs as well as on the comprehensive R archive network (CRAN, http://cran.r-project.org.

  3. Building a Network Based Laboratory Environment

    Directory of Open Access Journals (Sweden)

    Sea Shuan Luo

    2009-12-01

    Full Text Available This paper presents a comparative study about the development of a network based laboratory environment in the “Unix introduction” course for the undergraduate students. The study results and the response from the students from 2005 to 2006 will be used to better understand what kind of method is more suitable for students. We also use the data collected to adjust our teaching strategy and try to build up a network based laboratory environment.

  4. The Wireless Sensor Network (WSN) Based Coal Ash Impoundments Safety Monitoring System

    Science.gov (United States)

    Sun, E. J.; Nieto, A.; Zhang, X. K.

    2017-01-01

    Coal ash impoundments are inevitable production of the coal-fired power plants. All coal ash impoundments in North Carolina USA that tested for groundwater contamination are leaking toxic heavy metals and other pollutants. Coal ash impoundments are toxic sources of dangerous pollutants that pose a danger to human and environmental health if the toxins spread to adjacent surface waters and drinking water wells. Coal ash impoundments failures accidents resulted in serious water contamination along with toxic heavy metals. To improve the design and stability of coal ash impoundments, the Development of a Coal Ash Impoundment Safety Monitoring System (CAISM) was proposed based on the implementation of a wireless sensor network (WSN) with the ability to monitor the stability of coal ash impoundments, water level, and saturation levels on-demand and remotely. The monitoring system based on a robust Ad-hoc network could be adapted to different safety conditions.

  5. A Token Ring Protocol for Dynamic Ad-hoc Wireless Environments

    Energy Technology Data Exchange (ETDEWEB)

    Top, P; Kohlhepp, V; Dowla, F

    2005-09-30

    A wireless ad-hoc networking protocol is presented. The protocol is designed to be flexible, easy to use and adaptable to a wide variety of potential applications. The primary considerations in design are small code size, guaranteed bandwidth access, limited delay, and error resilience in a highly dynamic ad-hoc environment. These considerations are achieved through the use of token ring protocol.

  6. Network-based Database Course

    DEFF Research Database (Denmark)

    Nielsen, J.N.; Knudsen, Morten; Nielsen, Jens Frederik Dalsgaard

    A course in database design and implementation has been de- signed, utilizing existing network facilities. The course is an elementary course for students of computer engineering. Its purpose is to give the students a theoretical database knowledge as well as practical experience with design...... and implementation. A tutorial relational database and the students self-designed databases are implemented on the UNIX system of Aalborg University, thus giving the teacher the possibility of live demonstrations in the lecture room, and the students the possibility of interactive learning in their working rooms...

  7. PID Controller Based on Memristive CMAC Network

    Directory of Open Access Journals (Sweden)

    Lidan Wang

    2013-01-01

    Full Text Available Compound controller which consists of CMAC network and PID network is mainly used in control system, especially in robot control. It can realize nonlinear tracking control of the real-time dynamic trajectory and possesses good approximation effect. According to the structure and principle of the compound controller, memristor is introduced to CMAC network to be a compound controller in this paper. The new PID controller based on memristive CMAC network is built up by replacing the synapse in the original controller by memristors. The effect of curve approximation is obtained by MATLAB simulation experiments. This network improves the response and learning speed of the system and processes better robustness and antidisturbance performance.

  8. Network based sky Brightness Monitor

    Science.gov (United States)

    McKenna, Dan; Pulvermacher, R.; Davis, D. R.

    2009-01-01

    We have developed and are currently testing an autonomous 2 channel photometer designed to measure the night sky brightness in the visual wavelengths over a multi-year campaign. The photometer uses a robust silicon sensor filtered with Hoya CM500 glass. The Sky brightness is measured every minute at two elevation angles typically zenith and 20 degrees to monitor brightness and transparency. The Sky Brightness monitor consists of two units, the remote photometer and a network interface. Currently these devices use 2.4 Ghz transceivers with a free space range of 100 meters. The remote unit is battery powered with day time recharging using a solar panel. Data received by the network interface transmits data via standard POP Email protocol. A second version is under development for radio sensitive areas using an optical fiber for data transmission. We will present the current comparison with the National Park Service sky monitoring camera. We will also discuss the calibration methods used for standardization and temperature compensation. This system is expected to be deployed in the next year and be operated by the International Dark Sky Association SKYMONITOR project.

  9. Delay Analysis of Car-to-Car Reliable Data Delivery Strategies Based on Data Mulling with Network Coding

    Science.gov (United States)

    Park, Joon-Sang; Lee, Uichin; Oh, Soon Young; Gerla, Mario; Lun, Desmond Siumen; Ro, Won Woo; Park, Joonseok

    Vehicular ad hoc networks (VANET) aims to enhance vehicle navigation safety by providing an early warning system: any chance of accidents is informed through the wireless communication between vehicles. For the warning system to work, it is crucial that safety messages be reliably delivered to the target vehicles in a timely manner and thus reliable and timely data dissemination service is the key building block of VANET. Data mulling technique combined with three strategies, network codeing, erasure coding and repetition coding, is proposed for the reliable and timely data dissemination service. Particularly, vehicles in the opposite direction on a highway are exploited as data mules, mobile nodes physically delivering data to destinations, to overcome intermittent network connectivity cause by sparse vehicle traffic. Using analytic models, we show that in such a highway data mulling scenario the network coding based strategy outperforms erasure coding and repetition based strategies.

  10. SDL-based network performance simulation

    Science.gov (United States)

    Yang, Yang; Lu, Yang; Lin, Xiaokang

    2005-11-01

    Specification and description language (SDL) is an object-oriented formal language defined as a standard by ITU-T. Though SDL is mainly used in describing communication protocols, it is an efficient way to simulate the network performance with SDL tools according to our experience. This paper presents our methodology of SDL-based network performance simulation in such aspects as the simulation platform, the simulation modes and the integrated simulation environment. Note that Telelogic Tau 4.3 SDL suite is used here as the simulation environment though our methodology isn't limited to the software. Finally the SDL-based open shortest path first (OSPF) performance simulation in the wireless private network is illustrated as an example of our methodology, which indicates that SDL is indeed an efficient language in the area of the network performance simulation.

  11. Toward Measuring Network Aesthetics Based on Symmetry

    Directory of Open Access Journals (Sweden)

    Zengqiang Chen

    2017-05-01

    Full Text Available In this exploratory paper, we discuss quantitative graph-theoretical measures of network aesthetics. Related work in this area has typically focused on geometrical features (e.g., line crossings or edge bendiness of drawings or visual representations of graphs which purportedly affect an observer’s perception. Here we take a very different approach, abandoning reliance on geometrical properties, and apply information-theoretic measures to abstract graphs and networks directly (rather than to their visual representaions as a means of capturing classical appreciation of structural symmetry. Examples are used solely to motivate the approach to measurement, and to elucidate our symmetry-based mathematical theory of network aesthetics.

  12. A network-based dynamical ranking system

    CERN Document Server

    Motegi, Shun

    2012-01-01

    Ranking players or teams in sports is of practical interests. From the viewpoint of networks, a ranking system is equivalent a centrality measure for sports networks, whereby a directed link represents the result of a single game. Previously proposed network-based ranking systems are derived from static networks, i.e., aggregation of the results of games over time. However, the score (i.e., strength) of a player, for example, depends on time. Defeating a renowned player in the peak performance is intuitively more rewarding than defeating the same player in other periods. To account for this factor, we propose a dynamic variant of such a network-based ranking system and apply it to professional men's tennis data. Our ranking system, also interpreted as a centrality measure for directed temporal networks, has two parameters. One parameter represents the exponential decay rate of the past score, and the other parameter controls the effect of indirect wins on the score. We derive a set of linear online update equ...

  13. GDTN: Genome-Based Delay Tolerant Network Formation in Heterogeneous 5G Using Inter-UA Collaboration.

    Science.gov (United States)

    You, Ilsun; Sharma, Vishal; Atiquzzaman, Mohammed; Choo, Kim-Kwang Raymond

    2016-01-01

    With a more Internet-savvy and sophisticated user base, there are more demands for interactive applications and services. However, it is a challenge for existing radio access networks (e.g. 3G and 4G) to cope with the increasingly demanding requirements such as higher data rates and wider coverage area. One potential solution is the inter-collaborative deployment of multiple radio devices in a 5G setting designed to meet exacting user demands, and facilitate the high data rate requirements in the underlying networks. These heterogeneous 5G networks can readily resolve the data rate and coverage challenges. Networks established using the hybridization of existing networks have diverse military and civilian applications. However, there are inherent limitations in such networks such as irregular breakdown, node failures, and halts during speed transmissions. In recent years, there have been attempts to integrate heterogeneous 5G networks with existing ad hoc networks to provide a robust solution for delay-tolerant transmissions in the form of packet switched networks. However, continuous connectivity is still required in these networks, in order to efficiently regulate the flow to allow the formation of a robust network. Therefore, in this paper, we present a novel network formation consisting of nodes from different network maneuvered by Unmanned Aircraft (UA). The proposed model utilizes the features of a biological aspect of genomes and forms a delay tolerant network with existing network models. This allows us to provide continuous and robust connectivity. We then demonstrate that the proposed network model has an efficient data delivery, lower overheads and lesser delays with high convergence rate in comparison to existing approaches, based on evaluations in both real-time testbed and simulation environment.

  14. Designing Network-based Business Model Ontology

    DEFF Research Database (Denmark)

    Hashemi Nekoo, Ali Reza; Ashourizadeh, Shayegheh; Zarei, Behrouz

    2015-01-01

    Survival on dynamic environment is not achieved without a map. Scanning and monitoring of the market show business models as a fruitful tool. But scholars believe that old-fashioned business models are dead; as they are not included the effect of internet and network in themselves. This paper...... is going to propose e-business model ontology from the network point of view and its application in real world. The suggested ontology for network-based businesses is composed of individuals` characteristics and what kind of resources they own. also, their connections and pre-conceptions of connections...... such as shared-mental model and trust. However, it mostly covers previous business model elements. To confirm the applicability of this ontology, it has been implemented in business angel network and showed how it works....

  15. Network-Based Leadership Development: A Guiding Framework and Resources for Management Educators

    Science.gov (United States)

    Cullen-Lester, Kristin L.; Woehler, Meredith L.; Willburn, Phil

    2016-01-01

    Management education and leadership development has traditionally focused on improving human capital (i.e., knowledge, skills, and abilities). Social capital, networks, and networking skills have received less attention. When this content has been incorporated into learning and development experiences, it has often been more ad hoc and has…

  16. Overlapping Community Detection based on Network Decomposition

    Science.gov (United States)

    Ding, Zhuanlian; Zhang, Xingyi; Sun, Dengdi; Luo, Bin

    2016-04-01

    Community detection in complex network has become a vital step to understand the structure and dynamics of networks in various fields. However, traditional node clustering and relatively new proposed link clustering methods have inherent drawbacks to discover overlapping communities. Node clustering is inadequate to capture the pervasive overlaps, while link clustering is often criticized due to the high computational cost and ambiguous definition of communities. So, overlapping community detection is still a formidable challenge. In this work, we propose a new overlapping community detection algorithm based on network decomposition, called NDOCD. Specifically, NDOCD iteratively splits the network by removing all links in derived link communities, which are identified by utilizing node clustering technique. The network decomposition contributes to reducing the computation time and noise link elimination conduces to improving the quality of obtained communities. Besides, we employ node clustering technique rather than link similarity measure to discover link communities, thus NDOCD avoids an ambiguous definition of community and becomes less time-consuming. We test our approach on both synthetic and real-world networks. Results demonstrate the superior performance of our approach both in computation time and accuracy compared to state-of-the-art algorithms.

  17. Sputnik: ad hoc distributed computation.

    Science.gov (United States)

    Völkel, Gunnar; Lausser, Ludwig; Schmid, Florian; Kraus, Johann M; Kestler, Hans A

    2015-04-15

    In bioinformatic applications, computationally demanding algorithms are often parallelized to speed up computation. Nevertheless, setting up computational environments for distributed computation is often tedious. Aim of this project were the lightweight ad hoc set up and fault-tolerant computation requiring only a Java runtime, no administrator rights, while utilizing all CPU cores most effectively. The Sputnik framework provides ad hoc distributed computation on the Java Virtual Machine which uses all supplied CPU cores fully. It provides a graphical user interface for deployment setup and a web user interface displaying the current status of current computation jobs. Neither a permanent setup nor administrator privileges are required. We demonstrate the utility of our approach on feature selection of microarray data. The Sputnik framework is available on Github http://github.com/sysbio-bioinf/sputnik under the Eclipse Public License. hkestler@fli-leibniz.de or hans.kestler@uni-ulm.de Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

  18. Post hoc Bayesian model selection.

    Science.gov (United States)

    Friston, Karl; Penny, Will

    2011-06-15

    This note describes a Bayesian model selection or optimization procedure for post hoc inferences about reduced versions of a full model. The scheme provides the evidence (marginal likelihood) for any reduced model as a function of the posterior density over the parameters of the full model. It rests upon specifying models through priors on their parameters, under the assumption that the likelihood remains the same for all models considered. This provides a quick and efficient scheme for scoring arbitrarily large numbers of models, after inverting a single (full) model. In turn, this enables the selection among discrete models that are distinguished by the presence or absence of free parameters, where free parameters are effectively removed from the model using very precise shrinkage priors. An alternative application of this post hoc model selection considers continuous model spaces, defined in terms of hyperparameters (sufficient statistics) of the prior density over model parameters. In this instance, the prior (model) can be optimized with respect to its evidence. The expressions for model evidence become remarkably simple under the Laplace (Gaussian) approximation to the posterior density. Special cases of this scheme include Savage-Dickey density ratio tests for reduced models and automatic relevance determination in model optimization. We illustrate the approach using general linear models and a more complicated nonlinear state-space model. Copyright © 2011 Elsevier Inc. All rights reserved.

  19. Location-based Forwarding in Vehicular Networks

    NARCIS (Netherlands)

    Klein Wolterink, W.

    2013-01-01

    In this thesis we focus on location-based message forwarding in vehicular networks to support intelligent transportation systems (ITSs). ITSs are transport systems that utilise information and communication technologies to increase their level of automation, in this way levering the performance of

  20. WIRELESS SENSOR NETWORK BASED CONVEYOR SURVEILLANCE SYSTEM

    OpenAIRE

    Attila Trohák; Máté Kolozsi-Tóth; Péter Rádi

    2011-01-01

    In the paper we will introduce an intelligent conveyor surveillance system. We started a research project to design and develop a conveyor surveillance system based on wireless sensor network and GPRS communication. Our system is able to measure temperature on fixed and moving, rotating surfaces and able to detect smoke. We would like to introduce the developed devices and give an application example.

  1. SAR ATR Based on Convolutional Neural Network

    Directory of Open Access Journals (Sweden)

    Tian Zhuangzhuang

    2016-06-01

    Full Text Available This study presents a new method of Synthetic Aperture Radar (SAR image target recognition based on a convolutional neural network. First, we introduce a class separability measure into the cost function to improve this network’s ability to distinguish between categories. Then, we extract SAR image features using the improved convolutional neural network and classify these features using a support vector machine. Experimental results using moving and stationary target acquisition and recognition SAR datasets prove the validity of this method.

  2. An Evidence-Based Unified Definition of Lifelong and Acquired Premature Ejaculation: Report of the Second International Society for Sexual Medicine Ad Hoc Committee for the Definition of Premature Ejaculation

    Science.gov (United States)

    Serefoglu, Ege Can; McMahon, Chris G; Waldinger, Marcel D; Althof, Stanley E; Shindel, Alan; Adaikan, Ganesh; Becher, Edgardo F; Dean, John; Giuliano, Francois; Hellstrom, Wayne JG; Giraldi, Annamaria; Glina, Sidney; Incrocci, Luca; Jannini, Emmanuele; McCabe, Marita; Parish, Sharon; Rowland, David; Segraves, R Taylor; Sharlip, Ira; Torres, Luiz Otavio

    2014-01-01

    Introduction The International Society for Sexual Medicine (ISSM) Ad Hoc Committee for the Definition of Premature Ejaculation developed the first evidence-based definition for lifelong premature ejaculation (PE) in 2007 and concluded that there were insufficient published objective data at that time to develop a definition for acquired PE. Aim The aim of this article is to review and critique the current literature and develop a contemporary, evidence-based definition for acquired PE and/or a unified definition for both lifelong and acquired PE. Methods In April 2013, the ISSM convened a second Ad Hoc Committee for the Definition of Premature Ejaculation in Bangalore, India. The same evidence-based systematic approach to literature search, retrieval, and evaluation used by the original committee was adopted. Results The committee unanimously agreed that men with lifelong and acquired PE appear to share the dimensions of short ejaculatory latency, reduced or absent perceived ejaculatory control, and the presence of negative personal consequences. Men with acquired PE are older, have higher incidences of erectile dysfunction, comorbid disease, and cardiovascular risk factors, and have a longer intravaginal ejaculation latency time (IELT) as compared with men with lifelong PE. A self-estimated or stopwatch IELT of 3 minutes was identified as a valid IELT cut-off for diagnosing acquired PE. On this basis, the committee agreed on a unified definition of both acquired and lifelong PE as a male sexual dysfunction characterized by (i) ejaculation that always or nearly always occurs prior to or within about 1 minute of vaginal penetration from the first sexual experience (lifelong PE) or a clinically significant and bothersome reduction in latency time, often to about 3 minutes or less (acquired PE); (ii) the inability to delay ejaculation on all or nearly all vaginal penetrations; and (iii) negative personal consequences, such as distress, bother, frustration, and/or the

  3. An evidence-based unified definition of lifelong and acquired premature ejaculation: report of the second international society for sexual medicine ad hoc committee for the definition of premature ejaculation.

    Science.gov (United States)

    Serefoglu, Ege Can; McMahon, Chris G; Waldinger, Marcel D; Althof, Stanley E; Shindel, Alan; Adaikan, Ganesh; Becher, Edgardo F; Dean, John; Giuliano, Francois; Hellstrom, Wayne Jg; Giraldi, Annamaria; Glina, Sidney; Incrocci, Luca; Jannini, Emmanuele; McCabe, Marita; Parish, Sharon; Rowland, David; Segraves, R Taylor; Sharlip, Ira; Torres, Luiz Otavio

    2014-06-01

    The International Society for Sexual Medicine (ISSM) Ad Hoc Committee for the Definition of Premature Ejaculation developed the first evidence-based definition for lifelong premature ejaculation (PE) in 2007 and concluded that there were insufficient published objective data at that time to develop a definition for acquired PE. The aim of this article is to review and critique the current literature and develop a contemporary, evidence-based definition for acquired PE and/or a unified definition for both lifelong and acquired PE. In April 2013, the ISSM convened a second Ad Hoc Committee for the Definition of Premature Ejaculation in Bangalore, India. The same evidence-based systematic approach to literature search, retrieval, and evaluation used by the original committee was adopted. The committee unanimously agreed that men with lifelong and acquired PE appear to share the dimensions of short ejaculatory latency, reduced or absent perceived ejaculatory control, and the presence of negative personal consequences. Men with acquired PE are older, have higher incidences of erectile dysfunction, comorbid disease, and cardiovascular risk factors, and have a longer intravaginal ejaculation latency time (IELT) as compared with men with lifelong PE. A self-estimated or stopwatch IELT of 3 minutes was identified as a valid IELT cut-off for diagnosing acquired PE. On this basis, the committee agreed on a unified definition of both acquired and lifelong PE as a male sexual dysfunction characterized by (i) ejaculation that always or nearly always occurs prior to or within about 1 minute of vaginal penetration from the first sexual experience (lifelong PE) or a clinically significant and bothersome reduction in latency time, often to about 3 minutes or less (acquired PE); (ii) the inability to delay ejaculation on all or nearly all vaginal penetrations; and (iii) negative personal consequences, such as distress, bother, frustration, and/or the avoidance of sexual intimacy. The

  4. Optimal channel choice for collaborative ad-hoc dissemination

    DEFF Research Database (Denmark)

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

    2010-01-01

    Collaborative ad-hoc dissemination of information has been proposed as an efficient means to disseminate information among devices in a wireless ad-hoc network. Devices help in forwarding the information channels to the entire network, by disseminating the channels they subscribe to, plus others....... We consider the case where devices have a limited amount of storage that they are willing to devote to the public good, and thus have to decide which channels they are willing to help disseminate. We are interested in finding channel selection strategies which optimize the dissemination time across...... the channels. We first consider a simple model under the random mixing assumption; we show that channel dissemination time can be characterized in terms of the number of nodes that forward this channel. Then we show that maximizing a social welfare is equivalent to an assignment problem, whose solution can...

  5. A novel approach to smart grid technology for electrical power transmission lines by a self-organized optical network node based on optical bistability

    Science.gov (United States)

    Nakanishi, Soichiro; Sasaki, Wakao

    2011-01-01

    In this work, we have demonstrated a new smart grid model by our novel green photonics technology based on selforganized optical networks realizing an autonomous peer-to-peer electric power transmissions without centralized control for the power grid. In this optical network, we introduced an adaptive algorithm for concurrent peer-to-peer communications, by utilizing optical nonlinearity depending only on the signal strength passing through the network. This method is applicable for autonomous organization of functions for ad-hoc electric power distribution systems for the power grid. For this purpose, a simple optical- electrical hybrid bistable circuit composed of such as light emitting diode (LED) and photo diode (PD), has been incorporated into the network node. In the experiment, the method uses a simple, local adaptation of transmission weights at each network node, which enables self-organizing functions of the network, such as self-routing, self-optimization, self-recovery and self-protection. Based on this method, we have demonstrated experimentally a new smart grid model applicable for ad-hoc electric power distribution systems mediated by power comsumptions. In this model, electric power flow is controlled autonomously through the self-organized network nodes associated with individual power facilities having photovoltaics and electric storage devices, etc., and the nodes convert the amounts of electric power supply and/or comsumption to the light intensity values using above mentioned transmission weights at each node. As a consequence, we have experimentally demonstrated a simple shorthaul system model for ad-hoc electric power distribution with a self-organized optical network as a novel green photonics technology application for smart grid.

  6. Network Based High Speed Product Innovation

    DEFF Research Database (Denmark)

    Lindgren, Peter

    In the first decade of the 21st century, New Product Development has undergone major changes in the way NPD is managed and organised. This is due to changes in technology, market demands, and in the competencies of companies. As a result NPD organised in different forms of networks is predicted...... to be of ever-increasing importance to many different kinds of companies. This happens at the same times as the share of new products of total turnover and earnings is increasing at unprecedented speed in many firms and industries. The latter results in the need for very fast innovation and product development...... - a need that can almost only be resolved by organising NPD in some form of network configuration. The work of Peter Lindgren is on several aspects of network based high speed product innovation and contributes to a descriptive understanding of this phenomenon as well as with normative theory on how NPD...

  7. Hydrogel networks based on ABA triblock copolymers.

    Science.gov (United States)

    Tartivel, Lucile; Behl, Marc; Schroeter, Michael; Lendlein, Andreas

    2012-01-01

    Triblock copolymers from hydrophilic oligo(ethylene glycol) segment A and oligo(propylene glycol) segment B, providing an ABA structure (OEG-OPG-OEG triblock), are known to be biocompatible and are used as self-solidifying gels in drug depots. A complete removal of these depots would be helpful in cases of undesired side effects of a drug, but this remains a challenge as they liquefy below their transition temperature. Therefore we describe the synthesis of covalently cross-linked hydrogel networks. Triblock copolymer-based hydrogels were created by irradiating aqueous solutions of the corresponding macro-dimethacrylates with UV light. The degree of swelling, swelling kinetics, mechanical properties and morphology of the networks were investigated. Depending on precursor concentration, equilibrium degree of swelling of the films ranged between 500% and 880% and was reached in 1 hour. In addition, values for storage and loss moduli of the hydrogel networks were in the 100 Pa to 10 kPa range. Although OEG-OPG-OEG triblocks are known for their micellization, which could hamper polymer network formation, reactive OEG-OPG-OEG triblock oligomers could be successfully polymerized into hydrogel networks. The degree of swelling of these hydrogels depends on their molecular weight and on the oligomer concentration used for hydrogel preparation. In combination with the temperature sensitivity of the ABA triblock copolymers, it is assumed that such hydrogels might be beneficial for future medical applications - e.g., removable drug release systems.

  8. AeroMTP: A fountain code-based multipath transport protocol for airborne networks

    Directory of Open Access Journals (Sweden)

    Li Jie

    2015-08-01

    Full Text Available Airborne networks (ANs are special types of ad hoc networks that can be used to enhance situational awareness, flight coordination and flight efficiency in civil and military aviation. Compared to ground networks, ANs have some unique attributes including high node mobility, frequent topology changes, mechanical and aerodynamic constrains, strict safety requirements and harsh communication environment. Thus, the performance of conventional transmission control protocol (TCP will be dramatically degraded in ANs. Aircraft commonly have two or more heterogeneous network interfaces which offer an opportunity to form multiple communication paths between any two nodes in ANs. To satisfy the communication requirements in ANs, we propose aeronautical multipath transport protocol (AeroMTP for ANs, which effectively utilizes the available bandwidth and diversity provided by heterogeneous wireless paths. AeroMTP uses fountain codes as forward error correction (FEC codes to recover from data loss and deploys a TCP-friendly rate-based congestion control mechanism for each path. Moreover, we design a packet allocation algorithm based on optimization to minimize the delivery time of blocks. The performance of AeroMTP is evaluated through OMNeT++ simulations under a variety of test scenarios. Simulations demonstrate that AeroMTP is of great potential to be applied to ANs.

  9. Improved Vehicular Information Network Architecture Using Fuzzy Based Named Data NetworkingNDN

    Directory of Open Access Journals (Sweden)

    Kanwalpreet Kaur

    2015-08-01

    Full Text Available Vehicular Ad-hoc System VANETs is really a component with smart transport systems. It has ability to prevent accidents and the road congestion issues on highways but it suffers from the accomplishment and scalability issues. To handle these difficulties from the Inter Vehicular Communication IVC we apply Name Data Networking NDN. All though in NDN the users are only concerned about necessary data and give no attention on the number of locations from where the data is coming. The NDN layout is usually much more worthy for IVC circumstance getting the ordered material labeling design as well as amp64258exible material retrieval. In this report we propose vehicular network dependent on fuzzy membership function which offers the fundamental NDN style to improve support location dependent forwarding content aggregation and distributed mobility management. This paper finally winds up the several boundaries regarding earlier approaches.

  10. An Evidence-Based Unified Definition of Lifelong and Acquired Premature Ejaculation: Report of the Second International Society for Sexual Medicine Ad Hoc Committee for the Definition of Premature Ejaculation

    Directory of Open Access Journals (Sweden)

    Ege Can Serefoglu, MD

    2014-06-01

    Conclusion: The ISSM unified definition of lifelong and acquired PE represents the first evidence-based definition for these conditions. This definition will enable researchers to design methodologically rigorous studies to improve our understanding of acquired PE. Serefoglu EC, McMahon CG, Waldinger MD, Althof SE, Shindel A, Adaikan G, Becher EF, Dean J, Giuliano F, Hellstrom WJG, Giraldi A, Glina S, Incrocci L, Jannini E, McCabe M, Parish S, Rowland D, Segraves RT, Sharlip I, and Torres LO. An evidence-based unified definition of lifelong and acquired premature ejaculation: Report of the second International Society for Sexual Medicine Ad Hoc Committee for the Definition of Premature Ejaculation. Sex Med 2014;2:41–59.

  11. Community structure of complex networks based on continuous neural network

    Science.gov (United States)

    Dai, Ting-ting; Shan, Chang-ji; Dong, Yan-shou

    2017-09-01

    As a new subject, the research of complex networks has attracted the attention of researchers from different disciplines. Community structure is one of the key structures of complex networks, so it is a very important task to analyze the community structure of complex networks accurately. In this paper, we study the problem of extracting the community structure of complex networks, and propose a continuous neural network (CNN) algorithm. It is proved that for any given initial value, the continuous neural network algorithm converges to the eigenvector of the maximum eigenvalue of the network modularity matrix. Therefore, according to the stability of the evolution of the network symbol will be able to get two community structure.

  12. Quantitative learning strategies based on word networks

    Science.gov (United States)

    Zhao, Yue-Tian-Yi; Jia, Zi-Yang; Tang, Yong; Xiong, Jason Jie; Zhang, Yi-Cheng

    2018-02-01

    Learning English requires a considerable effort, but the way that vocabulary is introduced in textbooks is not optimized for learning efficiency. With the increasing population of English learners, learning process optimization will have significant impact and improvement towards English learning and teaching. The recent developments of big data analysis and complex network science provide additional opportunities to design and further investigate the strategies in English learning. In this paper, quantitative English learning strategies based on word network and word usage information are proposed. The strategies integrate the words frequency with topological structural information. By analyzing the influence of connected learned words, the learning weights for the unlearned words and dynamically updating of the network are studied and analyzed. The results suggest that quantitative strategies significantly improve learning efficiency while maintaining effectiveness. Especially, the optimized-weight-first strategy and segmented strategies outperform other strategies. The results provide opportunities for researchers and practitioners to reconsider the way of English teaching and designing vocabularies quantitatively by balancing the efficiency and learning costs based on the word network.

  13. VMQL: A Visual Language for Ad-Hoc Model Querying

    DEFF Research Database (Denmark)

    Störrle, Harald

    2011-01-01

    In large scale model based development, analysis level models are more like knowledge bases than engineering artifacts. Their effectiveness depends, to a large degree, on the ability of domain experts to retrieve information from them ad hoc. For large scale models, however, existing query facili...

  14. Modeling acquaintance networks based on balance theory

    Directory of Open Access Journals (Sweden)

    Vukašinović Vida

    2014-09-01

    Full Text Available An acquaintance network is a social structure made up of a set of actors and the ties between them. These ties change dynamically as a consequence of incessant interactions between the actors. In this paper we introduce a social network model called the Interaction-Based (IB model that involves well-known sociological principles. The connections between the actors and the strength of the connections are influenced by the continuous positive and negative interactions between the actors and, vice versa, the future interactions are more likely to happen between the actors that are connected with stronger ties. The model is also inspired by the social behavior of animal species, particularly that of ants in their colony. A model evaluation showed that the IB model turned out to be sparse. The model has a small diameter and an average path length that grows in proportion to the logarithm of the number of vertices. The clustering coefficient is relatively high, and its value stabilizes in larger networks. The degree distributions are slightly right-skewed. In the mature phase of the IB model, i.e., when the number of edges does not change significantly, most of the network properties do not change significantly either. The IB model was found to be the best of all the compared models in simulating the e-mail URV (University Rovira i Virgili of Tarragona network because the properties of the IB model more closely matched those of the e-mail URV network than the other models

  15. Touch-Based Interaction Approach for Network Science Research and Visualization

    Science.gov (United States)

    2016-01-01

    wireless networks. The primary emulation tools used by ARL are the Extendable Mobile Ad hoc Network Emulator (EMANE)1 and the Common Open Research...messages containing data of interest. This data can range from network metrics collected in an experiment to server CPU statistics. VizDaemons consume only...visualization server , is required to distribute interaction notifications to multiple subscribed systems in the NSRL. Fig. 3 MultiTaction display device

  16. PERFORMANCE COMPARISON OF POSITION-BASED ROUTING PROTOCOLS IN VEHICLE-TOVEHICLE (V2V) COMMUNICATION

    OpenAIRE

    SANJOY DAS; RAM SHRINGAR RAW,

    2011-01-01

    Vehicular Ad hoc Networks (VANETs) is the new wireless networking concept of the wireless ad hoc networks in the research community. Vehicle-to-Vehicle (V2V) communication plays a significant role in providing a high level of safety and convenience to drivers and passengers. Routing in VANET is a major challenge and research area. Position based routing protocol has been identified to be suitable for VANETs because of frequently changed network topology and highly dynamic nature of vehicular ...

  17. Network-based recommendation algorithms: A review

    Science.gov (United States)

    Yu, Fei; Zeng, An; Gillard, Sébastien; Medo, Matúš

    2016-06-01

    Recommender systems are a vital tool that helps us to overcome the information overload problem. They are being used by most e-commerce web sites and attract the interest of a broad scientific community. A recommender system uses data on users' past preferences to choose new items that might be appreciated by a given individual user. While many approaches to recommendation exist, the approach based on a network representation of the input data has gained considerable attention in the past. We review here a broad range of network-based recommendation algorithms and for the first time compare their performance on three distinct real datasets. We present recommendation topics that go beyond the mere question of which algorithm to use-such as the possible influence of recommendation on the evolution of systems that use it-and finally discuss open research directions and challenges.

  18. Research on Network Scanning Strategy Based on Information Granularity

    Science.gov (United States)

    Qin, Futong; Shi, Pengfei; Du, Jing; Cheng, Ruosi; Zhou, Yunyan

    2017-10-01

    As the basic mean to obtain the information of the targets network, network scanning is often used to discover the security risks and vulnerabilities existing on the network. However, with the development of network technology, the scale of network is more and more large, and the network scanning efficiency put forward higher requirements. In this paper, the concept of network scanning information granularity is proposed, and the design method of network scanning strategy based on information granularity is proposed. Based on single information granularity and hybrid information granularity, four network scanning strategies were designed and verified experimentally. Experiments show that the network scanning strategies based on hybrid information granularity can improve the efficiency of network scanning.

  19. Wireless Sensor Network Based Smart Parking System

    Directory of Open Access Journals (Sweden)

    Jeffrey JOSEPH

    2014-01-01

    Full Text Available Ambient Intelligence is a vision in which various devices come together and process information from multiple sources in order to exert control on the physical environment. In addition to computation and control, communication plays a crucial role in the overall functionality of such a system. Wireless Sensor Networks are one such class of networks, which meet these criteria. These networks consist of spatially distributed sensor motes which work in a co-operative manner to sense and control the environment. In this work, an implementation of an energy-efficient and cost-effective, wireless sensor networks based vehicle parking system for a multi-floor indoor parking facility has been introduced. The system monitors the availability of free parking slots and guides the vehicle to the nearest free slot. The amount of time the vehicle has been parked is monitored for billing purposes. The status of the motes (dead/alive is also recorded. Information like slot allocated, directions to the slot and billing data is sent as a message to customer’s mobile phones. This paper extends our previous work 1 with the development of a low cost sensor mote, about one tenth the cost of a commercially available mote, keeping in mind the price sensitive markets of the developing countries.

  20. Dynamics of hate based Internet user networks

    Science.gov (United States)

    Sobkowicz, P.; Sobkowicz, A.

    2010-02-01

    We present a study of the properties of network of political discussions on one of the most popular Polish Internet forums. This provides the opportunity to study the computer mediated human interactions in strongly bipolar environment. The comments of the participants are found to be mostly disagreements, with strong percentage of invective and provocative ones. Binary exchanges (quarrels) play significant role in the network growth and topology. Statistical analysis shows that the growth of the discussions depends on the degree of controversy of the subject and the intensity of personal conflict between the participants. This is in contrast to most previously studied social networks, for example networks of scientific citations, where the nature of the links is much more positive and based on similarity and collaboration rather than opposition and abuse. The work discusses also the implications of the findings for more general studies of consensus formation, where our observations of increased conflict contradict the usual assumptions that interactions between people lead to averaging of opinions and agreement.