DAWN: Dynamic Ad-hoc Wireless Network

DTIC Science & Technology

2016-06-19

DAWN: Dynamic Ad-hoc Wireless Network The DAWN (Dynamic Ad-hoc Wireless Networks) project is developing a general theory of complex and dynamic... wireless communication networks. To accomplish this, DAWN adopts a very different approach than those followed in the past and summarized above. DAWN... wireless communication networks. The members of DAWN investigated difference aspects of wireless mobile ad hoc networks (MANET). The views, opinions and/or

Passive and Active Analysis in DSR-Based Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Dempsey, Tae; Sahin, Gokhan; Morton, Y. T. (Jade)

Security and vulnerabilities in wireless ad hoc networks have been considered at different layers, and many attack strategies have been proposed, including denial of service (DoS) through the intelligent jamming of the most critical packet types of flows in a network. This paper investigates the effectiveness of intelligent jamming in wireless ad hoc networks using the Dynamic Source Routing (DSR) and TCP protocols and introduces an intelligent classifier to facilitate the jamming of such networks. Assuming encrypted packet headers and contents, our classifier is based solely on the observable characteristics of size, inter-arrival timing, and direction and classifies packets with up to 99.4% accuracy in our experiments. Furthermore, we investigate active analysis, which is the combination of a classifier and intelligent jammer to invoke specific responses from a victim network.

MWAHCA: a multimedia wireless ad hoc cluster architecture.

PubMed

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.

Adaptive Flow Control for Enabling Quality of Service in Tactical Ad Hoc Wireless Networks

DTIC Science & Technology

2010-12-01

environment in wireless networks , we use sensors in the network routers to detect and respond to congestion. We use backpressure techniques... wireless mesh network . In the current approach, we used OLSR as the routing scheme. However, B.A.T.M.A.N. offers the significant advantage of being based...Control and QoS Routing in Multi-Channel Wireless Mesh Networks ,” 68-77. ACM International Symposium on Mobile Ad Hoc Networking &

Analysis on Multicast Routing Protocols for Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Xiang, Ma

As the Mobile Ad Hoc Networks technologies face a series of challenges like dynamic changes of topological structure, existence of unidirectional channel, limited wireless transmission bandwidth, the capability limitations of mobile termination and etc, therefore, the research to mobile Ad Hoc network routings inevitablely undertake a more important task than those to other networks. Multicast is a mode of communication transmission oriented to group computing, which sends the data to a group of host computers by using single source address. In a typical mobile Ad Hoc Network environment, multicast has a significant meaning. On the one hand, the users of mobile Ad Hoc Network usually need to form collaborative working groups; on the other hand, this is also an important means of fully using the broadcast performances of wireless communication and effectively using the limited wireless channel resources. This paper summarizes and comparatively analyzes the routing mechanisms of various existing multicast routing protocols according to the characteristics of mobile Ad Hoc network.

Distributed generation of shared RSA keys in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

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.

On Trust Evaluation in Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Nguyen, Dang Quan; Lamont, Louise; Mason, Peter C.

Trust has been considered as a social relationship between two individuals in human society. But, as computer science and networking have succeeded in using computers to automate many tasks, the concept of trust can be generalized to cover the reliability and relationships of non-human interaction, such as, for example, information gathering and data routing. This paper investigates the evaluation of trust in the context of ad hoc networks. Nodes evaluate each other’s behaviour based on observables. A node then decides whether to trust another node to have certain innate abilities. We show how accurate such an evaluation could be. We also provide the minimum number of observations required to obtain an accurate evaluation, a result that indicates that observation-based trust in ad hoc networks will remain a challenging problem. The impact of making networking decisions using trust evaluation on the network connectivity is also examined. In this manner, quantitative decisions can be made concerning trust-based routing with the knowledge of the potential impact on connectivity.

Topology Control and Routing in Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Carr-Motyckova, Lenka; Navarra, Alfredo; Johansson, Tomas; Unger, Walter

Mobile nodes with the ability to communicate with radio signals may form an ad hoc network. In this chapter special problems arising for these ad hoc networks are considered. These include range control, the reduction of interferences, regulation of power consumption, and localization.

The effects of malicious nodes on performance of mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Li, Fanzhi; Shi, Xiyu; Jassim, Sabah; Adams, Christopher

2006-05-01

Wireless ad hoc networking offers convenient infrastructureless communication over the shared wireless channel. However, the nature of ad hoc networks makes them vulnerable to security attacks. Unlike their wired counterpart, infrastructureless ad hoc networks do not have a clear line of defense, their topology is dynamically changing, and every mobile node can receive messages from its neighbors and can be contacted by all other nodes in its neighborhood. This poses a great danger to network security if some nodes behave in a malicious manner. The immediate concern about the security in this type of networks is how to protect the network and the individual mobile nodes against malicious act of rogue nodes from within the network. This paper is concerned with security aspects of wireless ad hoc networks. We shall present results of simulation experiments on ad hoc network's performance in the presence of malicious nodes. We shall investigate two types of attacks and the consequences will be simulated and quantified in terms of loss of packets and other factors. The results show that network performance, in terms of successful packet delivery ratios, significantly deteriorates when malicious nodes act according to the defined misbehaving characteristics.

MWAHCA: A Multimedia Wireless Ad Hoc Cluster Architecture

PubMed Central

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

AD HOC Networks for the Autonomous Car

NASA Astrophysics Data System (ADS)

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 protocols show lower performance with ARIANDE being superior to SAODV and SRP. Nevertheless all protocol simulation proved it to match required real time performance.

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

NASA Astrophysics Data System (ADS)

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.

Adaptive MANET multipath routing algorithm based on the simulated annealing approach.

PubMed

Kim, Sungwook

2014-01-01

Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

Enhancement of Beaconless Location-Based Routing with Signal Strength Assistance for Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Chen, Guowei; Itoh, Kenichi; Sato, Takuro

Routing in Ad-hoc networks is unreliable due to the mobility of the nodes. Location-based routing protocols, unlike other protocols which rely on flooding, excel in network scalability. Furthermore, new location-based routing protocols, like, e. g. BLR [1], IGF [2], & CBF [3] have been proposed, with the feature of not requiring beacons in MAC-layer, which improve more in terms of scalability. Such beaconless routing protocols can work efficiently in dense network areas. However, these protocols' algorithms have no ability to avoid from routing into sparse areas. In this article, historical signal strength has been added as a factor into the BLR algorithm, which avoids routing into sparse area, and consequently improves the global routing efficiency.

Analysis of Soldier Radio Waveform Performance in Operational Test

DTIC Science & Technology

2015-05-01

different frequencies based on carrier, uplink/downlink, and generation. In general, 2G and 3G cellular phones operate at 850 MHz uplink, and 1,900 MHz...spectrum management that may not be operationally feasible. These issues are not unique to SRW, but rather have plagued the mobile ad-hoc network... mobile ad-hoc network (MANET), enabling communication through a self-configuring, infrastructure-less network of mobile nodes. In the SS domain, these

Capacity-Delay Trade-Off in Collaborative Hybrid Ad-Hoc Networks with Coverage Sensing.

PubMed

Chen, Lingyu; Luo, Wenbin; Liu, Chen; Hong, Xuemin; Shi, Jianghong

2017-01-26

The integration of ad hoc device-to-device (D2D) communications and open-access small cells can result in a networking paradigm called hybrid the ad hoc network, which is particularly promising in delivering delay-tolerant data. The capacity-delay performance of hybrid ad hoc networks has been studied extensively under a popular framework called scaling law analysis. These studies, however, do not take into account aspects of interference accumulation and queueing delay and, therefore, may lead to over-optimistic results. Moreover, focusing on the average measures, existing works fail to give finer-grained insights into the distribution of delays. This paper proposes an alternative analytical framework based on queueing theoretic models and physical interference models. We apply this framework to study the capacity-delay performance of a collaborative cellular D2D network with coverage sensing and two-hop relay. The new framework allows us to fully characterize the delay distribution in the transform domain and pinpoint the impacts of coverage sensing, user and base station densities, transmit power, user mobility and packet size on the capacity-delay trade-off. We show that under the condition of queueing equilibrium, the maximum throughput capacity per device saturates to an upper bound of 0.7239 λ b / λ u bits/s/Hz, where λ b and λ u are the densities of base stations and mobile users, respectively.

Capacity-Delay Trade-Off in Collaborative Hybrid Ad-Hoc Networks with Coverage Sensing

PubMed Central

Chen, Lingyu; Luo, Wenbin; Liu, Chen; Hong, Xuemin; Shi, Jianghong

2017-01-01

The integration of ad hoc device-to-device (D2D) communications and open-access small cells can result in a networking paradigm called hybrid the ad hoc network, which is particularly promising in delivering delay-tolerant data. The capacity-delay performance of hybrid ad hoc networks has been studied extensively under a popular framework called scaling law analysis. These studies, however, do not take into account aspects of interference accumulation and queueing delay and, therefore, may lead to over-optimistic results. Moreover, focusing on the average measures, existing works fail to give finer-grained insights into the distribution of delays. This paper proposes an alternative analytical framework based on queueing theoretic models and physical interference models. We apply this framework to study the capacity-delay performance of a collaborative cellular D2D network with coverage sensing and two-hop relay. The new framework allows us to fully characterize the delay distribution in the transform domain and pinpoint the impacts of coverage sensing, user and base station densities, transmit power, user mobility and packet size on the capacity-delay trade-off. We show that under the condition of queueing equilibrium, the maximum throughput capacity per device saturates to an upper bound of 0.7239 λb/λu bits/s/Hz, where λb and λu are the densities of base stations and mobile users, respectively. PMID:28134769

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

PubMed

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

2015-04-17

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

Ad-Hoc Networks and the Mobile Application Security System (MASS)

DTIC Science & Technology

2006-01-01

solution to this problem that addresses critical aspects of security in ad-hoc mobile application networks. This approach involves preventing unauthorized...modification of a mobile application , both by other applications and by hosts, and ensuring that mobile code is authentic and authorized. These...capabilities constitute the Mobile Application Security System (MASS). The MASS applies effective, robust security to mobile application -based systems

MAC Protocol for Ad Hoc Networks Using a Genetic Algorithm

PubMed Central

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

A Decentralized VPN Service over Generalized Mobile Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Fujita, Sho; Shima, Keiichi; Uo, Yojiro; Esaki, Hiroshi

We present a decentralized VPN service that can be built over generalized mobile ad-hoc networks (Generalized MANETs), in which topologies can be represented as a time-varying directed multigraph. We address wireless ad-hoc networks and overlay ad-hoc networks as instances of Generalized MANETs. We first propose an architecture to operate on various kinds of networks through a single set of operations. Then, we design and implement a decentralized VPN service on the proposed architecture. Through the development and operation of a prototype system we implemented, we found that the proposed architecture makes the VPN service applicable to each instance of Generalized MANETs, and that the VPN service makes it possible for unmodified applications to operate on the networks.

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

ERIC Educational Resources Information Center

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…

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

PubMed

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

2018-01-01

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

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

PubMed Central

Wang, Ling; Xie, Jian; Zhang, Zhaolin

2018-01-01

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

Scalability enhancement of AODV using local link repairing

NASA Astrophysics Data System (ADS)

Jain, Jyoti; Gupta, Roopam; Bandhopadhyay, T. K.

2014-09-01

Dynamic change in the topology of an ad hoc network makes it difficult to design an efficient routing protocol. Scalability of an ad hoc network is also one of the important criteria of research in this field. Most of the research works in ad hoc network focus on routing and medium access protocols and produce simulation results for limited-size networks. Ad hoc on-demand distance vector (AODV) is one of the best reactive routing protocols. In this article, modified routing protocols based on local link repairing of AODV are proposed. Method of finding alternate routes for next-to-next node is proposed in case of link failure. These protocols are beacon-less, means periodic hello message is removed from the basic AODV to improve scalability. Few control packet formats have been changed to accommodate suggested modification. Proposed protocols are simulated to investigate scalability performance and compared with basic AODV protocol. This also proves that local link repairing of proposed protocol improves scalability of the network. From simulation results, it is clear that scalability performance of routing protocol is improved because of link repairing method. We have tested protocols for different terrain area with approximate constant node densities and different traffic load.

Management of Energy Consumption on Cluster Based Routing Protocol for MANET

NASA Astrophysics Data System (ADS)

Hosseini-Seno, Seyed-Amin; Wan, Tat-Chee; Budiarto, Rahmat; Yamada, Masashi

The usage of light-weight mobile devices is increasing rapidly, leading to demand for more telecommunication services. Consequently, mobile ad hoc networks and their applications have become feasible with the proliferation of light-weight mobile devices. Many protocols have been developed to handle service discovery and routing in ad hoc networks. However, the majority of them did not consider one critical aspect of this type of network, which is the limited of available energy in each node. Cluster Based Routing Protocol (CBRP) is a robust/scalable routing protocol for Mobile Ad hoc Networks (MANETs) and superior to existing protocols such as Ad hoc On-demand Distance Vector (AODV) in terms of throughput and overhead. Therefore, based on this strength, methods to increase the efficiency of energy usage are incorporated into CBRP in this work. In order to increase the stability (in term of life-time) of the network and to decrease the energy consumption of inter-cluster gateway nodes, an Enhanced Gateway Cluster Based Routing Protocol (EGCBRP) is proposed. Three methods have been introduced by EGCBRP as enhancements to the CBRP: improving the election of cluster Heads (CHs) in CBRP which is based on the maximum available energy level, implementing load balancing for inter-cluster traffic using multiple gateways, and implementing sleep state for gateway nodes to further save the energy. Furthermore, we propose an Energy Efficient Cluster Based Routing Protocol (EECBRP) which extends the EGCBRP sleep state concept into all idle member nodes, excluding the active nodes in all clusters. The experiment results show that the EGCBRP decreases the overall energy consumption of the gateway nodes up to 10% and the EECBRP reduces the energy consumption of the member nodes up to 60%, both of which in turn contribute to stabilizing the network.

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

PubMed

Hao, Zhuo; Zhong, Sheng; Yu, Nenghai

2013-01-01

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

A Multihop Key Agreement Scheme for Wireless Ad Hoc Networks Based on Channel Characteristics

PubMed Central

Yu, Nenghai

2013-01-01

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

Impact of network structure on the capacity of wireless multihop ad hoc communication

NASA Astrophysics Data System (ADS)

Krause, Wolfram; Glauche, Ingmar; Sollacher, Rudolf; Greiner, Martin

2004-07-01

As a representative of a complex technological system, the so-called wireless multihop ad hoc communication networks are discussed. They represent an infrastructure-less generalization of todays wireless cellular phone networks. Lacking a central control authority, the ad hoc nodes have to coordinate themselves such that the overall network performs in an optimal way. A performance indicator is the end-to-end throughput capacity. Various models, generating differing ad hoc network structure via differing transmission power assignments, are constructed and characterized. They serve as input for a generic data traffic simulation as well as some semi-analytic estimations. The latter reveal that due to the most-critical-node effect the end-to-end throughput capacity sensitively depends on the underlying network structure, resulting in differing scaling laws with respect to network size.

CSR: Constrained Selfish Routing in Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Bassem, Christine; Bestavros, Azer

Routing protocols for ad-hoc networks assume that the nodes forming the network are either under a single authority, or else that they would be altruistically forwarding data for other nodes with no expectation of a return. These assumptions are unrealistic since in ad-hoc networks, nodes are likely to be autonomous and rational (selfish), and thus unwilling to help unless they have an incentive to do so. Providing such incentives is an important aspect that should be considered when designing ad-hoc routing protocols. In this paper, we propose a dynamic, decentralized routing protocol for ad-hoc networks that provides incentives in the form of payments to intermediate nodes used to forward data for others. In our Constrained Selfish Routing (CSR) protocol, game-theoretic approaches are used to calculate payments (incentives) that ensure both the truthfulness of participating nodes and the fairness of the CSR protocol. We show through simulations that CSR is an energy efficient protocol and that it provides lower communication overhead in the best and average cases compared to existing approaches.

An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks

PubMed Central

Penumalli, Chakradhar; Palanichamy, Yogesh

2015-01-01

A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node's remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN]. The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks. Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. The node's mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS. The performance is evaluated at various node densities, various transmission ranges, and mobility rates. The theoretical analysis and simulation results of this algorithm are also presented which yield better results. PMID:26221627

Dynamic autonomous routing technology for IP-based satellite ad hoc networks

NASA Astrophysics Data System (ADS)

Wang, Xiaofei; Deng, Jing; Kostas, Theresa; Rajappan, Gowri

2014-06-01

IP-based routing for military LEO/MEO satellite ad hoc networks is very challenging due to network and traffic heterogeneity, network topology and traffic dynamics. In this paper, we describe a traffic priority-aware routing scheme for such networks, namely Dynamic Autonomous Routing Technology (DART) for satellite ad hoc networks. DART has a cross-layer design, and conducts routing and resource reservation concurrently for optimal performance in the fluid but predictable satellite ad hoc networks. DART ensures end-to-end data delivery with QoS assurances by only choosing routing paths that have sufficient resources, supporting different packet priority levels. In order to do so, DART incorporates several resource management and innovative routing mechanisms, which dynamically adapt to best fit the prevailing conditions. In particular, DART integrates a resource reservation mechanism to reserve network bandwidth resources; a proactive routing mechanism to set up non-overlapping spanning trees to segregate high priority traffic flows from lower priority flows so that the high priority flows do not face contention from low priority flows; a reactive routing mechanism to arbitrate resources between various traffic priorities when needed; a predictive routing mechanism to set up routes for scheduled missions and for anticipated topology changes for QoS assurance. We present simulation results showing the performance of DART. We have conducted these simulations using the Iridium constellation and trajectories as well as realistic military communications scenarios. The simulation results demonstrate DART's ability to discriminate between high-priority and low-priority traffic flows and ensure disparate QoS requirements of these traffic flows.

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

NASA Astrophysics Data System (ADS)

Huibin, Liu; Jun, Zhang

2016-04-01

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

Technologies for network-centric C4ISR

NASA Astrophysics Data System (ADS)

Dunkelberger, Kirk A.

2003-07-01

Three technologies form the heart of any network-centric command, control, communication, intelligence, surveillance, and reconnaissance (C4ISR) system: distributed processing, reconfigurable networking, and distributed resource management. Distributed processing, enabled by automated federation, mobile code, intelligent process allocation, dynamic multiprocessing groups, check pointing, and other capabilities creates a virtual peer-to-peer computing network across the force. Reconfigurable networking, consisting of content-based information exchange, dynamic ad-hoc routing, information operations (perception management) and other component technologies forms the interconnect fabric for fault tolerant inter processor and node communication. Distributed resource management, which provides the means for distributed cooperative sensor management, foe sensor utilization, opportunistic collection, symbiotic inductive/deductive reasoning and other applications provides the canonical algorithms for network-centric enterprises and warfare. This paper introduces these three core technologies and briefly discusses a sampling of their component technologies and their individual contributions to network-centric enterprises and warfare. Based on the implied requirements, two new algorithms are defined and characterized which provide critical building blocks for network centricity: distributed asynchronous auctioning and predictive dynamic source routing. The first provides a reliable, efficient, effective approach for near-optimal assignment problems; the algorithm has been demonstrated to be a viable implementation for ad-hoc command and control, object/sensor pairing, and weapon/target assignment. The second is founded on traditional dynamic source routing (from mobile ad-hoc networking), but leverages the results of ad-hoc command and control (from the contributed auctioning algorithm) into significant increases in connection reliability through forward prediction. Emphasis is placed on the advantages gained from the closed-loop interaction of the multiple technologies in the network-centric application environment.

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

PubMed Central

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yang, Dr. Li; Cui, Xiaohui; Cemerlic, Alma

Ad hoc networks are very helpful in situations when no fixed network infrastructure is available, such as natural disasters and military conflicts. In such a network, all wireless nodes are equal peers simultaneously serving as both senders and routers for other nodes. Therefore, how to route packets through reliable paths becomes a fundamental problems when behaviors of certain nodes deviate from wireless ad hoc routing protocols. We proposed a novel Dirichlet reputation model based on Bayesian inference theory which evaluates reliability of each node in terms of packet delivery. Our system offers a way to predict and select a reliablemore » path through combination of first-hand observation and second-hand reputation reports. We also proposed moving window mechanism which helps to adjust ours responsiveness of our system to changes of node behaviors. We integrated the Dirichlet reputation into routing protocol of wireless ad hoc networks. Our extensive simulation indicates that our proposed reputation system can improve good throughput of the network and reduce negative impacts caused by misbehaving nodes.« less

Wireless Sensor Network Quality of Service Improvement on Flooding Attack Condition

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

Auto-Configuration Protocols in Mobile Ad Hoc Networks

PubMed Central

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

On service differentiation in mobile Ad Hoc networks.

PubMed

Zhang, Shun-liang; Ye, Cheng-qing

2004-09-01

A network model is proposed to support service differentiation for mobile Ad Hoc networks by combining a fully distributed admission control approach and the DIFS based differentiation mechanism of IEEE802.11. It can provide different kinds of QoS (Quality of Service) for various applications. Admission controllers determine a committed bandwidth based on the reserved bandwidth of flows and the source utilization of networks. Packets are marked when entering into networks by markers according to the committed rate. By the mark in the packet header, intermediate nodes handle the received packets in different manners to provide applications with the QoS corresponding to the pre-negotiated profile. Extensive simulation experiments showed that the proposed mechanism can provide QoS guarantee to assured service traffic and increase the channel utilization of networks.

Gemini: Extending Information Management for Real Time Tactical Environments

DTIC Science & Technology

2008-03-01

Mobile,  Ad ‐ Hoc  Networks.......................................................................................................49  8.4  Wired...networks, such as  wireless  ad ‐ hoc  networks. This paper looked into the operating environments expected to be available to  Unmanned Aircraft Systems...decentralized,  ad ‐ hoc   networks. The total peering capability of these networks may be very large. And, each network or access  point may carry restrictions; for

Trust Management in Mobile Ad Hoc Networks for Bias Minimization and Application Performance Maximization

DTIC Science & Technology

2014-02-26

set of anomaly detection rules 62 I.-R. Chen et al. / Ad Hoc Networks 19 (2014) 59–74 Author’s personal copy including the interval rule (for...deficiencies in anomaly detection (e.g., imperfection of rules) by a false negative probability (PHfn) of misidentifying an unhealthy node as a...multimedia servers, Multimedia Syst. 8 (2) (2000) 83–91. [53] R. Mitchell, I.R. Chen, Adaptive intrusion detection for unmanned aircraft systems based on

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

NASA Astrophysics Data System (ADS)

Filippidis, Christos; Cotronis, Yiannis; Markou, Christos

2014-06-01

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

Implementing MANETS in Android based environment using Wi-Fi direct

NASA Astrophysics Data System (ADS)

Waqas, Muhammad; Babar, Mohammad Inayatullah Khan; Zafar, Mohammad Haseeb

2015-05-01

Packet loss occurs in real-time voice transmission over wireless broadcast Ad-hoc network which creates disruptions in sound. Basic objective of this research is to design a wireless Ad-hoc network based on two Android devices by using the Wireless Fidelity (WIFI) Direct Application Programming Interface (API) and apply the Network Codec, Reed Solomon Code. The network codec is used to encode the data of a music wav file and recover the lost packets if any, packets are dropped using a loss module at the transmitter device to analyze the performance with the objective of retrieving the original file at the receiver device using the network codec. This resulted in faster transmission of the files despite dropped packets. In the end both files had the original formatted music files with complete performance analysis based on the transmission delay.

Adaptive Reliable Routing Protocol Using Combined Link Stability Estimation for Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Vadivel, R.; Bhaskaran, V. Murali

2010-10-01

The main reason for packet loss in ad hoc networks is the link failure or node failure. In order to increase the path stability, it is essential to distinguish and moderate the failures. By knowing individual link stability along a path, path stability can be identified. In this paper, we develop an adaptive reliable routing protocol using combined link stability estimation for mobile ad hoc networks. The main objective of this protocol is to determine a Quality of Service (QoS) path along with prolonging the network life time and to reduce the packet loss. We calculate a combined metric for a path based on the parameters Link Expiration Time, Node Remaining Energy and Node Velocity and received signal strength to predict the link stability or lifetime. Then, a bypass route is established to retransmit the lost data, when a link failure occurs. By simulation results, we show that the proposed reliable routing protocol achieves high delivery ratio with reduced delay and packet drop.

Location-Based Services in Vehicular Networks

ERIC Educational Resources Information Center

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…

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

NASA Astrophysics Data System (ADS)

Bisen, Dhananjay; Sharma, Sanjeev

2018-01-01

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

A Game Theory Based Solution for Security Challenges in CRNs

NASA Astrophysics Data System (ADS)

Poonam; Nagpal, Chander Kumar

2018-03-01

Cognitive radio networks (CRNs) are being envisioned to drive the next generation Ad hoc wireless networks due to their ability to provide communications resilience in continuously changing environments through the use of dynamic spectrum access. Conventionally CRNs are dependent upon the information gathered by other secondary users to ensure the accuracy of spectrum sensing making them vulnerable to security attacks leading to the need of security mechanisms like cryptography and trust. However, a typical cryptography based solution is not a viable security solution for CRNs owing to their limited resources. Effectiveness of trust based approaches has always been, in question, due to credibility of secondary trust resources. Game theory with its ability to optimize in an environment of conflicting interests can be quite a suitable tool to manage an ad hoc network in the presence of autonomous selfish/malevolent/malicious and attacker nodes. The literature contains several theoretical proposals for augmenting game theory in the ad hoc networks without explicit/detailed implementation. This paper implements a game theory based solution in MATLAB-2015 to secure the CRN environment and compares the obtained results with the traditional approaches of trust and cryptography. The simulation result indicates that as the time progresses the game theory performs much better with higher throughput, lower jitter and better identification of selfish/malicious nodes.

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

PubMed Central

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

Energy Efficient and QoS sensitive Routing Protocol for Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Saeed Tanoli, Tariq; Khalid Khan, Muhammad

2013-12-01

Efficient routing is an important part of wireless ad hoc networks. Since in ad hoc networks we have limited resources, there are many limitations like bandwidth, battery consumption, and processing cycle etc. Reliability is also necessary since there is no allowance for invalid or incomplete information (and expired data is useless). There are various protocols that perform routing by considering one parameter but ignoring other parameters. In this paper we present a protocol that finds route on the basis of bandwidth, energy and mobility of the nodes participating in the communication.

Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks.

PubMed

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

PubMed Central

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services. PMID:25258736

Ecology Based Decentralized Agent Management System

NASA Technical Reports Server (NTRS)

Peysakhov, Maxim D.; Cicirello, Vincent A.; Regli, William C.

2004-01-01

The problem of maintaining a desired number of mobile agents on a network is not trivial, especially if we want a completely decentralized solution. Decentralized control makes a system more r e bust and less susceptible to partial failures. The problem is exacerbated on wireless ad hoc networks where host mobility can result in significant changes in the network size and topology. In this paper we propose an ecology-inspired approach to the management of the number of agents. The approach associates agents with living organisms and tasks with food. Agents procreate or die based on the abundance of uncompleted tasks (food). We performed a series of experiments investigating properties of such systems and analyzed their stability under various conditions. We concluded that the ecology based metaphor can be successfully applied to the management of agent populations on wireless ad hoc networks.

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

NASA Astrophysics Data System (ADS)

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.

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks

PubMed Central

Hammad, Karim; El Bakly, Ahmed M.

2018-01-01

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem—subject to various Quality-of-Service (QoS) constraints—represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms. PMID:29509760

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks.

PubMed

Ramadan, Rahab M; Gasser, Safa M; El-Mahallawy, Mohamed S; Hammad, Karim; El Bakly, Ahmed M

2018-01-01

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem-subject to various Quality-of-Service (QoS) constraints-represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms.

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

NASA Astrophysics Data System (ADS)

Rafsanjani, Marjan Kuchaki; Fatemidokht, Hamideh; Balas, Valentina Emilia

2016-01-01

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.

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

NASA Astrophysics Data System (ADS)

Agueh, Max; Diouris, Jean-François; Diop, Magaye; Devaux, François-Olivier; De Vleeschouwer, Christophe; Macq, Benoit

2008-12-01

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.

An adaptive density-based routing protocol for flying Ad Hoc networks

NASA Astrophysics Data System (ADS)

Zheng, Xueli; Qi, Qian; Wang, Qingwen; Li, Yongqiang

2017-10-01

An Adaptive Density-based Routing Protocol (ADRP) for Flying Ad Hoc Networks (FANETs) is proposed in this paper. The main objective is to calculate forwarding probability adaptively in order to increase the efficiency of forwarding in FANETs. ADRP dynamically fine-tunes the rebroadcasting probability of a node for routing request packets according to the number of neighbour nodes. Indeed, it is more interesting to privilege the retransmission by nodes with little neighbour nodes. We describe the protocol, implement it and evaluate its performance using NS-2 network simulator. Simulation results reveal that ADRP achieves better performance in terms of the packet delivery fraction, average end-to-end delay, normalized routing load, normalized MAC load and throughput, which is respectively compared with AODV.

Energy Efficient Probabilistic Broadcasting for Mobile Ad-Hoc Network

NASA Astrophysics Data System (ADS)

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

Information Sharing Modalities for Mobile Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

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

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

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

PubMed Central

Wang, Liangmin

2018-01-01

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

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

PubMed

Sohail, Muhammad; Wang, Liangmin

2018-03-14

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

Efficient routing for safety applications in vehicular networks.

DOT National Transportation Integrated Search

2009-03-01

Vehicular ad hoc networks have received a lot of attention in recent years. This attention is due to two reasons. : First and foremost, there are a number of real-life applications that become possible in the presence of : such an ad-hoc infrastructu...

Decentralized session initiation protocol solution in ad hoc networks

NASA Astrophysics Data System (ADS)

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.

Dynamic Data Driven Applications Systems (DDDAS)

DTIC Science & Technology

2013-03-06

INS •  Chip-scale atomic clocks •  Ad hoc networks •  Polymorphic networks •  Agile networks •  Laser communications •  Frequency-agile RF...atomi clocks •  Ad hoc networks •  Polymorphic networks •  Agile networks •  Laser co munications •  Frequency-agile RF systems...Real-Time Doppler Wind Wind field Sensor observations Energy Estimation Atmospheric Models for On-line Planning Planning and Control

Reliable Geographical Forwarding in Cognitive Radio Sensor Networks Using Virtual Clusters

PubMed Central

Zubair, Suleiman; Fisal, Norsheila

2014-01-01

The need for implementing reliable data transfer in resource-constrained cognitive radio ad hoc networks is still an open issue in the research community. Although geographical forwarding schemes are characterized by their low overhead and efficiency in reliable data transfer in traditional wireless sensor network, this potential is still yet to be utilized for viable routing options in resource-constrained cognitive radio ad hoc networks in the presence of lossy links. In this paper, a novel geographical forwarding technique that does not restrict the choice of the next hop to the nodes in the selected route is presented. This is achieved by the creation of virtual clusters based on spectrum correlation from which the next hop choice is made based on link quality. The design maximizes the use of idle listening and receiver contention prioritization for energy efficiency, the avoidance of routing hot spots and stability. The validation result, which closely follows the simulation result, shows that the developed scheme can make more advancement to the sink as against the usual decisions of relevant ad hoc on-demand distance vector route select operations, while ensuring channel quality. Further simulation results have shown the enhanced reliability, lower latency and energy efficiency of the presented scheme. PMID:24854362

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

NASA Astrophysics Data System (ADS)

Hortos, William S.

2006-05-01

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

A novel Smart Routing Protocol for remote health monitoring in Medical Wireless Networks.

PubMed

Sundararajan, T V P; Sumithra, M G; Maheswar, R

2014-01-01

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

Providing Location Security in Vehicular Ad Hoc Networks

ERIC Educational Resources Information Center

Yan, Gongjun

2010-01-01

Location is fundamental information in Vehicular Ad-hoc Networks (VANETs). Almost all VANET applications rely on location information. Therefore it is of importance to ensure location information integrity, meaning that location information is original (from the generator), correct (not bogus or fabricated) and unmodified (value not changed). We…

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

DTIC Science & Technology

2013-01-01

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

Achieving Information Superiority Using Hastily Formed Networks and Emerging Technologies for the Royal Thai Armed Forces Counterinsurgency Operations in Southern Thailand

DTIC Science & Technology

2014-03-01

38 2. Mobile Ad Hoc Networks ..................................................................39 3. Wireless Ad Hoc Sensor Networks...59 Figure 32. RENEWS with WiMAX and Wave Relay AP at C-IED Site.............................59 Figure 33. RENEWS Wind Turbine and Solar Panels at Hat...worldwide interoperability for microwave access WSN wireless sensor network xv ACKNOWLEDGMENTS We would like to express our sincerest gratitude

Noise-Assisted Concurrent Multipath Traffic Distribution in Ad Hoc Networks

PubMed Central

Murata, Masayuki

2013-01-01

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

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

PubMed

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.

Securing Mobile Ad Hoc Networks Using Danger Theory-Based Artificial Immune Algorithm

PubMed Central

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

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

PubMed Central

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

2014-01-01

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

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

PubMed

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

2014-01-01

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

Ad Hoc Categories and False Memories: Memory Illusions for Categories Created On-The-Spot

ERIC Educational Resources Information Center

Soro, Jerônimo C.; Ferreira, Mário B.; Semin, Gün R.; Mata, André; Carneiro, Paula

2017-01-01

Three experiments were designed to test whether experimentally created ad hoc associative networks evoke false memories. We used the DRM (Deese, Roediger, McDermott) paradigm with lists of ad hoc categories composed of exemplars aggregated toward specific goals (e.g., going for a picnic) that do not share any consistent set of features. Experiment…

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

NASA Astrophysics Data System (ADS)

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 MANET packet flows. Regulation of network behavior is modeled by the optimal control of the conditional rates of multivariate point processes (MVPPs); these rates depend on the concatenated control parameters through a change of probability measure. The MVPP models capture behavior of many service applications, e.g., voice, video and the self-similar behavior of Internet data sessions. Performance verification of the cross-layer protocols, derived from the dynamic programming conditions, can be achieved by embedding the conditions in a reactive routing protocol for MANETs, in a simulation environment, such as the wireless extension of ns-2. A canonical MANET scenario consists of a distributed collection of battery-powered laptops or hand-held terminals, capable of hosting multimedia applications. Simulation details and performance tradeoffs, not presented, remain for a sequel to the paper.

ARO PECASE: Information Assurance for Energy-Constrained Wireless Sensor Networks

DTIC Science & Technology

2011-12-21

Distribution, 18th Annual IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), September 2007. 2. 2010 IEEE...received the following awards: Student Best Paper Award at the IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC...Localization in Wireless Ad Hoc Networks – Many current and future appli- cations of mobile ad hoc networks, including disaster response and event

Hybrid Radio Frequency/Free-Space Optics (RF/FSO) Wireless Sensor Network: Security Concerns and Protective Measures

NASA Astrophysics Data System (ADS)

Banerjee, Koushik; Sharma, Hemant; Sengupta, Anasuya

Wireless sensor networks (WSNs) are ad hoc wireless networks that are written off as spread out structure and ad hoc deployment. Sensor networks have all the rudimentary features of ad hoc networks but to altered points—for instance, considerably lesser movement and far more energy necessities. Commonly used technology for communication is radio frequency (RF) communications. Free-space optics (FSO) is relatively new technology which has the prospective to deliver remarkable increases in network lifetime of WSN. Hybrid RF/FSO communications has been suggested to decrease power consumption by a single sensor node. It is observed that security plays a very important role for either RF WSN or hybrid RF/FSO WSN as those are vulnerable to numerous threats. In this paper, various possible attacks in RF/FSO WSN are discussed and aimed to propose some way out from those attacks.

Anomaly Detection Techniques for Ad Hoc Networks

ERIC Educational Resources Information Center

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…

Information Fusion in Ad hoc Wireless Sensor Networks for Aircraft Health Monitoring

NASA Astrophysics Data System (ADS)

Fragoulis, Nikos; Tsagaris, Vassilis; Anastassopoulos, Vassilis

In this paper the use of an ad hoc wireless sensor network for implementing a structural health monitoring system is discussed. The network is consisted of sensors deployed throughout the aircraft. These sensors being in the form of a microelectronic chip and consisted of sensing, data processing and communicating components could be easily embedded in any mechanical aircraft component. The established sensor network, due to its ad hoc nature is easily scalable, allowing adding or removing any number of sensors. The position of the sensor nodes need not necessarily to be engineered or predetermined, giving this way the ability to be deployed in inaccessible points. Information collected from various sensors of different modalities throughout the aircraft is then fused in order to provide a more comprehensive image of the aircraft structural health. Sensor level fusion along with decision quality information is used, in order to enhance detection performance.

Two Phase Admission Control for QoS Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Chen, Chien-Sheng; Su, Yi-Wen; Liu, Wen-Hsiung; Chi, Ching-Lung

In this paper a novel and effective two phase admission control (TPAC) for QoS mobile ad hoc networks is proposed that satisfies the real-time traffic requirements in mobile ad hoc networks. With a limited amount of extra overhead, TPAC can avoid network congestions by a simple and precise admission control which blocks most of the overloading flow-requests in the route discovery process. When compared with previous QoS routing schemes such as QoS-aware routing protocol and CACP protocols, it is shown from system simulations that the proposed scheme can increase the system throughput and reduce both the dropping rate and the end-to-end delay. Therefore, TPAC is surely an effective QoS-guarantee protocol to provide for real-time traffic.

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

PubMed

Vara, M Isabel; Campo, Celeste

2015-07-20

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

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

PubMed Central

Vara, M. Isabel; Campo, Celeste

2015-01-01

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

Performance Evaluation of AODV with Blackhole Attack

NASA Astrophysics Data System (ADS)

Dara, Karuna

2010-11-01

A Mobile Ad Hoc Network (MANET) is a temporary network set up by a wireless mobile computers moving arbitrary in the places that have no network infrastructure. These nodes maintain connectivity in a decentralized manner. Since the nodes communicate with each other, they cooperate by forwarding data packets to other nodes in the network. Thus the nodes find a path to the destination node using routing protocols. However, due to security vulnerabilities of the routing protocols, mobile ad-hoc networks are unprotected to attacks of the malicious nodes. One of these attacks is the Black Hole Attack against network integrity absorbing all data packets in the network. Since the data packets do not reach the destination node on account of this attack, data loss will occur. In this paper, we simulated the black hole attack in various mobile ad-hoc network scenarios using AODV routing protocol of MANET and have tried to find a effect if number of nodes are increased with increase in malicious nodes.

Coverage in Heterogeneous Sensor Networks

DTIC Science & Technology

2006-01-01

and S. Banerjee, “Node Placement for Connected Coverage in Sensor Networks,” in Proceedings of WiOpt ’03, March 2003. [10] F. Koushanfar, S...Meguerdichian, M. Potkonjak, and M. Srivastava, Cov- erage Problems in Wireless Ad-Hoc Sensor Networks, in Proceedings of the IEEE INFOCOM 01, March 2001, pp...Coverage and Connectivity of Ad Hoc Networks in Presence of Channel Randomness,” in Proceedings of the IEEE INFOCOM 05, March 2005, pp. 491–502. [16] S

A Survey on Trust Management for Mobile Ad Hoc Networks

DTIC Science & Technology

2011-11-01

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

Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Li, Xiaohua(Edward)

In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interference cancellation (SIC) and maximal ratio combining (MRC) to deal with mutual interference and to utilize all the received signal energy, we show that the signal-to-interference-plus-noise ratio (SINR) of a node is determined only by the nodes before it, not the nodes after it, along a packet forwarding path. Based on this observation, we propose an iterative procedure to select the relay nodes and to calculate the path SINR as well as capacity of an arbitrary multi-hop packet forwarding path. The complexity of the algorithm is extremely low, and scaling well with network size. The algorithm is applicable in arbitrarily large networks. Its performance is demonstrated as desirable by simulations. The algorithm can be helpful in analyzing the performance of multi-hop wireless networks.

An artificial immune system approach with secondary response for misbehavior detection in mobile ad hoc networks.

PubMed

Sarafijanović, Slavisa; Le Boudec, Jean-Yves

2005-09-01

In mobile ad hoc networks, nodes act both as terminals and information relays, and they participate in a common routing protocol, such as dynamic source routing (DSR). The network is vulnerable to routing misbehavior, due to faulty or malicious nodes. Misbehavior detection systems aim at removing this vulnerability. In this paper, we investigate the use of an artificial immune system (AIS) to detect node misbehavior in a mobile ad hoc network using DSR. The system is inspired by the natural immune system (IS) of vertebrates. Our goal is to build a system that, like its natural counterpart, automatically learns, and detects new misbehavior. We describe our solution for the classification task of the AIS; it employs negative selection and clonal selection, the algorithms for learning and adaptation used by the natural IS. We define how we map the natural IS concepts such as self, antigen, and antibody to a mobile ad hoc network and give the resulting algorithm for classifying nodes as misbehaving. We implemented the system in the network simulator Glomosim; we present detection results and discuss how the system parameters affect the performance of primary and secondary response. Further steps will extend the design by using an analogy to the innate system, danger signal, and memory cells.

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

NASA Astrophysics Data System (ADS)

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.

Quantum load balancing in ad hoc networks

NASA Astrophysics Data System (ADS)

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.

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

DTIC Science & Technology

2017-03-01

partitioned sub-swarms. The work covered in this thesis is to build a model of the NPS swarm’s communication network in ns-3 simulation software and use...partitioned sub- swarms. The work covered in this thesis is to build a model of the NPS swarm’s communication network in ns-3 simulation software and...NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS MAPPING AD HOC COMMUNICATIONS NETWORK OF A LARGE NUMBER FIXED-WING UAV SWARM by Alexis

GAPR2: A DTN Routing Protocol for Communications in Challenged, Degraded, and Denied Environments

DTIC Science & Technology

2015-09-01

Transmission Speed Vs. Latency Figure 4.7: Helsinki Simulation Set 2, High Network Load and Small Buffers Analysis of Delivery Ratio in Helsinki Simulation...ipnsig.org/. [17] MANET routing, class notes for CS4554: Network modeling and analysis . 119 [18] S. Basagni et al. Mobile ad hoc networking . John...Wiley & Sons, 2004. [19] E. Royer et al. A review of current routing protocols for ad hoc mobile wireless networks . Personal Communications, IEEE, 6(2

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

PubMed Central

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

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

PubMed

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.

A Survey on Trust Management for Mobile Ad Hoc Networks

DTIC Science & Technology

2010-07-01

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

Integrated data lookup and replication scheme in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Chen, Kai; Nahrstedt, Klara

2001-11-01

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ahn, Gail-Joon

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.

An ultra-wide bandwidth-based range/GPS tight integration approach for relative positioning in vehicular ad hoc networks

NASA Astrophysics Data System (ADS)

Shen, Feng; Wayn Cheong, Joon; Dempster, Andrew G.

2015-04-01

Relative position awareness is a vital premise for the implementation of emerging intelligent transportation systems, such as collision warning. However, commercial global navigation satellite systems (GNSS) receivers do not satisfy the requirements of these applications. Fortunately, cooperative positioning (CP) techniques, through sharing the GNSS measurements between vehicles, can improve the performance of relative positioning in a vehicular ad hoc network (VANET). In this paper, while assuming there are no obstacles between vehicles, a new enhanced tightly coupled CP technique is presented by adding ultra-wide bandwidth (UWB)-based inter-vehicular range measurements. In the proposed CP method, each vehicle fuses the GPS measurements and the inter-vehicular range measurements. Based on analytical and experimental results, in the full GPS coverage environment, the new tight integration CP method outperforms the INS-aided tight CP method, tight CP method, and DGPS by 11%, 15%, and 24%, respectively; in the GPS outage scenario, the performance improvement achieves 60%, 65%, and 73%, respectively.

Intrusion Detection and Forensics for Self-Defending Wireless Networks

DTIC Science & Technology

2012-12-01

ICNP), Nov. 2007. 5. Yao Zhao, Yan Chen, Bo Li, and Qian Zhang, Hop ID: A Virtual Coordinate based Routing for Sparse Mobile Ad Hoc Networks, in...Liu, Hongbo Zhao, Kai Chen and Yan Chen, " DISCO : Memory Efficient and Accurate Flow Statistics for Network Measurement", in the Proc. of IEEE ICDCS

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

ERIC Educational Resources Information Center

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…

Smart border: ad-hoc wireless sensor networks for border surveillance

NASA Astrophysics Data System (ADS)

He, Jun; Fallahi, Mahmoud; Norwood, Robert A.; Peyghambarian, Nasser

2011-06-01

Wireless sensor networks have been proposed as promising candidates to provide automated monitoring, target tracking, and intrusion detection for border surveillance. In this paper, we demonstrate an ad-hoc wireless sensor network system for border surveillance. The network consists of heterogeneously autonomous sensor nodes that distributively cooperate with each other to enable a smart border in remote areas. This paper also presents energy-aware and sleeping algorithms designed to maximize the operating lifetime of the deployed sensor network. Lessons learned in building the network and important findings from field experiments are shared in the paper.

A Source Anonymity-Based Lightweight Secure AODV Protocol for Fog-Based MANET

PubMed Central

Fang, Weidong; Zhang, Wuxiong; Xiao, Jinchao; Yang, Yang; Chen, Wei

2017-01-01

Fog-based MANET (Mobile Ad hoc networks) is a novel paradigm of a mobile ad hoc network with the advantages of both mobility and fog computing. Meanwhile, as traditional routing protocol, ad hoc on-demand distance vector (AODV) routing protocol has been applied widely in fog-based MANET. Currently, how to improve the transmission performance and enhance security are the two major aspects in AODV’s research field. However, the researches on joint energy efficiency and security seem to be seldom considered. In this paper, we propose a source anonymity-based lightweight secure AODV (SAL-SAODV) routing protocol to meet the above requirements. In SAL-SAODV protocol, source anonymous and secure transmitting schemes are proposed and applied. The scheme involves the following three parts: the source anonymity algorithm is employed to achieve the source node, without being tracked and located; the improved secure scheme based on the polynomial of CRC-4 is applied to substitute the RSA digital signature of SAODV and guarantee the data integrity, in addition to reducing the computation and energy consumption; the random delayed transmitting scheme (RDTM) is implemented to separate the check code and transmitted data, and achieve tamper-proof results. The simulation results show that the comprehensive performance of the proposed SAL-SAODV is a trade-off of the transmission performance, energy efficiency, and security, and better than AODV and SAODV. PMID:28629142

A Source Anonymity-Based Lightweight Secure AODV Protocol for Fog-Based MANET.

PubMed

Fang, Weidong; Zhang, Wuxiong; Xiao, Jinchao; Yang, Yang; Chen, Wei

2017-06-17

Fog-based MANET (Mobile Ad hoc networks) is a novel paradigm of a mobile ad hoc network with the advantages of both mobility and fog computing. Meanwhile, as traditional routing protocol, ad hoc on-demand distance vector (AODV) routing protocol has been applied widely in fog-based MANET. Currently, how to improve the transmission performance and enhance security are the two major aspects in AODV's research field. However, the researches on joint energy efficiency and security seem to be seldom considered. In this paper, we propose a source anonymity-based lightweight secure AODV (SAL-SAODV) routing protocol to meet the above requirements. In SAL-SAODV protocol, source anonymous and secure transmitting schemes are proposed and applied. The scheme involves the following three parts: the source anonymity algorithm is employed to achieve the source node, without being tracked and located; the improved secure scheme based on the polynomial of CRC-4 is applied to substitute the RSA digital signature of SAODV and guarantee the data integrity, in addition to reducing the computation and energy consumption; the random delayed transmitting scheme (RDTM) is implemented to separate the check code and transmitted data, and achieve tamper-proof results. The simulation results show that the comprehensive performance of the proposed SAL-SAODV is a trade-off of the transmission performance, energy efficiency, and security, and better than AODV and SAODV.

Random Time Identity Based Firewall In Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Suman, Patel, R. B.; Singh, Parvinder

2010-11-01

A mobile ad hoc network (MANET) is a self-organizing network of mobile routers and associated hosts connected by wireless links. MANETs are highly flexible and adaptable but at the same time are highly prone to security risks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized control. Firewall is an effective means of protecting a local network from network-based security threats and forms a key component in MANET security architecture. This paper presents a review of firewall implementation techniques in MANETs and their relative merits and demerits. A new approach is proposed to select MANET nodes at random for firewall implementation. This approach randomly select a new node as firewall after fixed time and based on critical value of certain parameters like power backup. This approach effectively balances power and resource utilization of entire MANET because responsibility of implementing firewall is equally shared among all the nodes. At the same time it ensures improved security for MANETs from outside attacks as intruder will not be able to find out the entry point in MANET due to the random selection of nodes for firewall implementation.

Power-Aware Intrusion Detection in Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

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

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

Optimal route discovery for soft QOS provisioning in mobile ad hoc multimedia networks

NASA Astrophysics Data System (ADS)

Huang, Lei; Pan, Feng

2007-09-01

In this paper, we propose an optimal routing discovery algorithm for ad hoc multimedia networks whose resource keeps changing, First, we use stochastic models to measure the network resource availability, based on the information about the location and moving pattern of the nodes, as well as the link conditions between neighboring nodes. Then, for a certain multimedia packet flow to be transmitted from a source to a destination, we formulate the optimal soft-QoS provisioning problem as to find the best route that maximize the probability of satisfying its desired QoS requirements in terms of the maximum delay constraints. Based on the stochastic network resource model, we developed three approaches to solve the formulated problem: A centralized approach serving as the theoretical reference, a distributed approach that is more suitable to practical real-time deployment, and a distributed dynamic approach that utilizes the updated time information to optimize the routing for each individual packet. Examples of numerical results demonstrated that using the route discovered by our distributed algorithm in a changing network environment, multimedia applications could achieve better QoS statistically.

C4I Community of Interest C2 Roadmap

DTIC Science & Technology

2015-03-24

QoS -based services – Digital policy-based prioritization – Dynamic bandwidth allocation – Automated network management April 15 Slide 9...Co-Site Mitigation) NC-3 • LPD/LPI Comms NC-4 • Increased Range NC-7 • Increased Loss Tolerance & Recovery NC-7 • Mobile Ad Hoc Networking NC-8...Algorithms and Software • Systems and Processes Networks and Communications • Radios and Apertures • Networks • Information April 15 Slide 8

Space-Time Processing for Tactical Mobile Ad Hoc Networks

DTIC Science & Technology

2007-08-01

rates in mobile ad hoc networks. In addition, he has considered the design of a cross-layer multi-user resource allocation framework using a... framework for many-to-one communication. In this context, multiple nodes cooperate to transmit their packets simultaneously to a single node using multi...spatially multiplexed signals transmitted from multiple nodes. Our goal is to form a framework that activates different sets of communication links

Space-Time Processing for Tactical Mobile Ad Hoc Networks

DTIC Science & Technology

2008-08-01

vision for multiple concurrent communication settings, i.e., a many-to-many framework where multi-packet transmissions (MPTs) and multi-packet...modelling framework of capacity-delay tradeoffs We have introduced the first unified modeling framework for the computation of fundamental limits o We...dalities in wireless n twor i-packet modelling framework to account for the use of m lti-packet reception (MPR) f ad hoc networks with MPT under

An Energy Efficient Power Control Protocol for Ad Hoc Networks Using Directional Antennas

NASA Astrophysics Data System (ADS)

Quiroz-Perez, Carlos; Gulliver, T. Aaron

A wireless ad hoc network is a collection of mobile nodes that can communicate with each other. Typically, nodes employ omnidirectional antennas. The use of directional antennas can increase spatial reuse, reduce the number of hops to a destination, reduce interference, and increase the transmission range in a specific direction. This is because omnidirectional antennas radiate equally in all directions, limiting the transmission range.

Cyber threat model for tactical radio networks

NASA Astrophysics Data System (ADS)

Kurdziel, Michael T.

2014-05-01

The shift to a full information-centric paradigm in the battlefield has allowed ConOps to be developed that are only possible using modern network communications systems. Securing these Tactical Networks without impacting their capabilities has been a challenge. Tactical networks with fixed infrastructure have similar vulnerabilities to their commercial counterparts (although they need to be secure against adversaries with greater capabilities, resources and motivation). However, networks with mobile infrastructure components and Mobile Ad hoc Networks (MANets) have additional unique vulnerabilities that must be considered. It is useful to examine Tactical Network based ConOps and use them to construct a threat model and baseline cyber security requirements for Tactical Networks with fixed infrastructure, mobile infrastructure and/or ad hoc modes of operation. This paper will present an introduction to threat model assessment. A definition and detailed discussion of a Tactical Network threat model is also presented. Finally, the model is used to derive baseline requirements that can be used to design or evaluate a cyber security solution that can be scaled and adapted to the needs of specific deployments.

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

DTIC Science & Technology

2016-01-21

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

ARSENAL: A Cross Layer Architecture for SecureResilient Tactical Mobile AdHoc Networks

DTIC Science & Technology

2016-01-21

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

Analytical Models of Cross-Layer Protocol Optimization in Real-Time Wireless Sensor Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

The real-time interactions among the nodes of a wireless sensor network (WSN) to cooperatively process data from multiple sensors are modeled. Quality-of-service (QoS) metrics are associated with the quality of fused information: throughput, delay, packet error rate, etc. Multivariate point process (MVPP) models of discrete random events in WSNs establish stochastic characteristics of optimal cross-layer protocols. Discrete-event, cross-layer interactions in mobile ad hoc network (MANET) protocols have been modeled using a set of concatenated design parameters and associated resource levels by the MVPPs. Characterization of the "best" cross-layer designs for a MANET is formulated by applying the general theory of martingale representations to controlled MVPPs. Performance is described in terms of concatenated protocol parameters and controlled through conditional rates of the MVPPs. Modeling limitations to determination of closed-form solutions versus explicit iterative solutions for ad hoc WSN controls are examined.

Application of Game Theory Approaches in Routing Protocols for Wireless Networks

NASA Astrophysics Data System (ADS)

Javidi, Mohammad M.; Aliahmadipour, Laya

2011-09-01

An important and essential issue for wireless networks is routing protocol design that is a major technical challenge due to the function of the network. Game theory is a powerful mathematical tool that analyzes the strategic interactions among multiple decision makers and the results of researches show that applied game theory in routing protocol lead to improvement the network performance through reduce overhead and motivates selfish nodes to collaborate in the network. This paper presents a review and comparison for typical representatives of routing protocols designed that applied game theory approaches for various wireless networks such as ad hoc networks, mobile ad hoc networks and sensor networks that all of them lead to improve the network performance.

Evaluation and development the routing protocol of a fully functional simulation environment for VANETs

NASA Astrophysics Data System (ADS)

Ali, Azhar Tareq; Warip, Mohd Nazri Mohd; Yaakob, Naimah; Abduljabbar, Waleed Khalid; Atta, Abdu Mohammed Ali

2017-11-01

Vehicular Ad-hoc Networks (VANETs) is an area of wireless technologies that is attracting a great deal of interest. There are still several areas of VANETS, such as security and routing protocols, medium access control, that lack large amounts of research. There is also a lack of freely available simulators that can quickly and accurately simulate VANETs. The main goal of this paper is to develop a freely available VANETS simulator and to evaluate popular mobile ad-hoc network routing protocols in several VANETS scenarios. The VANETS simulator consisted of a network simulator, traffic (mobility simulator) and used a client-server application to keep the two simulators in sync. The VANETS simulator also models buildings to create a more realistic wireless network environment. Ad-Hoc Distance Vector routing (AODV), Dynamic Source Routing (DSR) and Dynamic MANET On-demand (DYMO) were initially simulated in a city, country, and highway environment to provide an overall evaluation.

Design and Implementation of Secure Area Expansion Scheme for Public Wireless LAN Services

NASA Astrophysics Data System (ADS)

Watanabe, Ryu; Tanaka, Toshiaki

Recently, wireless LAN (WLAN) technology has become a major wireless communication method. The communication bandwidth is increasing and speeds have attained rates exceeding 100 Mbps. Therefore, WLAN technology is regarded as one of the promising communication methods for future networks. In addition, public WLAN connection services can be used in many locations. However, the number of the access points (AP) is insufficient for seamless communication and it cannot be said that users can use the service ubiquitously. An ad-hoc network style connection can be used to expand the coverage area of a public WLAN service. By relaying the user messages among the user nodes, a node can obtain an Internet connection via an AP, even though the node is located outside the AP's direct wireless connection area. Such a coverage area extending technology has many advantages thanks to the feature that no additional infrastructure is required. Therefore, there is a strong demand for this technology as it allows the cost-effective construction of future networks. When a secure ad-hoc routing protocol is used for message exchange in the WLAN service, the message routes are protected from malicious behavior such as route forging and can be maintained appropriately. To do this, however, a new node that wants to join the WLAN service has to obtain information such as the public key certificate and IP address in order to start secure ad-hoc routing. In other words, an initial setup is required for every network node to join the WLAN service properly. Ordinarily, such information should be assigned from the AP. However, new nodes cannot always contact an AP directly. Therefore, there are problems about information delivery in the initial setup of a network node. These problems originate in the multi hop connection based on the ad-hoc routing protocols. In order to realize an expanded area WLAN service, in this paper, the authors propose a secure public key certificate and address provision scheme during the initial setup phase on mobile nodes for the service. The proposed scheme also considers the protection of user privacy. Accordingly, none of the user nodes has to reveal their unique and persistent information to other nodes. Instead of using such information, temporary values are sent by an AP to mobile nodes and used for secure ad-hoc routing operations. Therefore, our proposed scheme prevents tracking by malicious parties by avoiding the use of unique information. Moreover, a test bed was also implemented based on the proposal and an evaluation was carried out in order to confirm performance. In addition, the authors describe a countermeasure against denial of service (DoS) attacks based on the approach to privacy protection described in our proposal.

An Ad-hoc Satellite Network to Measure Filamentary Current Structures in the Auroral Zone

NASA Astrophysics Data System (ADS)

Nabong, C.; Fritz, T. A.; Semeter, J. L.

2014-12-01

An ad-hoc cubesat-based satellite network project known as ANDESITE is under development at Boston University. It aims to develop a dense constellation of easy-to-use, rapidly-deployable low-cost wireless sensor nodes in space. The objectives of the project are threefold: 1) Demonstrate viability of satellite based sensor networks by deploying an 8-node miniature sensor network to study the filamentation of the field aligned currents in the auroral zones of the Earth's magnetosphere. 2) Test the scalability of proposed protocols, including localization techniques, tracking, data aggregation, and routing, for a 3 dimensional wireless sensor network using a "flock" of nodes. 3) Construct a 6U Cube-sat running the Android OS as an integrated constellation manager, data mule and sensor node deplorer. This small network of sensor nodes will resolve current densities at different spatial resolutions in the near-Earth magnetosphere using measurements from magnetometers with 1-nT sensitivities and 0.2 nT/√Hz self-noise. Mapping of these currents will provide new constraints for models of auroral particle acceleration, wave-particle interactions, ionospheric destabilization, and other kinetic processes operating in the low-beta plasma of the near Earth magnetosphere.

Organization model for Mobile Wireless Sensor Networks inspired in Artificial Bee Colony

NASA Astrophysics Data System (ADS)

Freire Roberto, Guilherme; Castilho Maschi, Luis Fernando; Pigatto, Daniel Fernando; Jaquie Castelo Branco, Kalinka Regina Lucas; Alves Neves, Leandro; Montez, Carlos; Sandro Roschildt Pinto, Alex

2015-01-01

The purpose of this study is to find a self-organizing model for MWSN based on bee colonies in order to reduce the number of messages transmitted among nodes, and thus reduce the overall consumption energy while maintaining the efficiency of message delivery. The results obtained in this article are originated from simulations carried out with SINALGO software, which demonstrates the effectiveness of the proposed approach. The BeeAODV (Bee Ad-Hoc On Demand Distance Vector) proposed in this paper allows to considerably reduce message exchanges whether compared to AODV (Ad-Hoc On Demand Distance Vector).

Predicting impact of multi-paths on phase change in map-based vehicular ad hoc networks

NASA Astrophysics Data System (ADS)

Rahmes, Mark; Lemieux, George; Sonnenberg, Jerome; Chester, David B.

2014-05-01

Dynamic Spectrum Access, which through its ability to adapt the operating frequency of a radio, is widely believed to be a solution to the limited spectrum problem. 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 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, secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We quantify optimal signal detection in map based cognitive radio networks with multiple rapidly varying phase changes and multiple orthogonal signals. Doppler shift occurs due to reflection, scattering, and rapid vehicle movement. Path propagation as well as vehicle movement produces either constructive or destructive interference with the incident wave. Our signal detection algorithms can assist the Doppler spread compensation algorithm by deciding how many phase changes in signals are present in a selected band of interest. Additionally we can populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate Dynamic Spectrum Access. We show how topography can help predict the impact of multi-paths on phase change, as well as about the prediction from dense traffic areas. Utilization of high resolution geospatial data layers in RF propagation analysis is directly applicable.

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

PubMed

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.

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

PubMed Central

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

Proactive Alleviation Procedure to Handle Black Hole Attack and Its Version

PubMed Central

Babu, M. Rajesh; Dian, S. Moses; Chelladurai, Siva; Palaniappan, Mathiyalagan

2015-01-01

The world is moving towards a new realm of computing such as Internet of Things. The Internet of Things, however, envisions connecting almost all objects within the world to the Internet by recognizing them as smart objects. In doing so, the existing networks which include wired, wireless, and ad hoc networks should be utilized. Moreover, apart from other networks, the ad hoc network is full of security challenges. For instance, the MANET (mobile ad hoc network) is susceptible to various attacks in which the black hole attacks and its versions do serious damage to the entire MANET infrastructure. The severity of this attack increases, when the compromised MANET nodes work in cooperation with each other to make a cooperative black hole attack. Therefore this paper proposes an alleviation procedure which consists of timely mandate procedure, hole detection algorithm, and sensitive guard procedure to detect the maliciously behaving nodes. It has been observed that the proposed procedure is cost-effective and ensures QoS guarantee by assuring resource availability thus making the MANET appropriate for Internet of Things. PMID:26495430

Proactive Alleviation Procedure to Handle Black Hole Attack and Its Version.

PubMed

Babu, M Rajesh; Dian, S Moses; Chelladurai, Siva; Palaniappan, Mathiyalagan

2015-01-01

The world is moving towards a new realm of computing such as Internet of Things. The Internet of Things, however, envisions connecting almost all objects within the world to the Internet by recognizing them as smart objects. In doing so, the existing networks which include wired, wireless, and ad hoc networks should be utilized. Moreover, apart from other networks, the ad hoc network is full of security challenges. For instance, the MANET (mobile ad hoc network) is susceptible to various attacks in which the black hole attacks and its versions do serious damage to the entire MANET infrastructure. The severity of this attack increases, when the compromised MANET nodes work in cooperation with each other to make a cooperative black hole attack. Therefore this paper proposes an alleviation procedure which consists of timely mandate procedure, hole detection algorithm, and sensitive guard procedure to detect the maliciously behaving nodes. It has been observed that the proposed procedure is cost-effective and ensures QoS guarantee by assuring resource availability thus making the MANET appropriate for Internet of Things.

T2AR: trust-aware ad-hoc routing protocol for MANET.

PubMed

Dhananjayan, Gayathri; Subbiah, Janakiraman

2016-01-01

Secure data transfer against the malicious attacks is an important issue in an infrastructure-less independent network called mobile ad-hoc network (MANET). Trust assurance between MANET nodes is the key parameter in the high-security provision under dynamic topology variations and open wireless constraints. But, the malicious behavior of nodes reduces the trust level of the nodes that leads to an insecure data delivery. The increase in malicious attacks causes the excessive energy consumption that leads to a reduction of network lifetime. The lack of positional information update of the nodes in ad-hoc on-demand vector (AODV) protocol during the connection establishment offers less trust level between the nodes. Hence, the trust rate computation using energy and mobility models and its update are the essential tasks for secure data delivery. This paper proposes a trust-aware ad-hoc routing (T2AR) protocol to improve the trust level between the nodes in MANET. The proposed method modifies the traditional AODV routing protocol with the constraints of trust rate, energy, mobility based malicious behavior prediction. The packet sequence ID matching from the log reports of neighbor nodes determine the trust rate that avoids the malicious report generation. Besides, the direct and indirect trust observation schemes utilization increases the trust level. Besides, the received signal strength indicator utilization determines the trusted node is within the communication range or not. The comparative analysis between the proposed T2AR with the existing methods such as TRUNCMAN, RBT, GR, FBR and DICOTIDS regarding the average end-to-end delay, throughput, false positives, packet delivery ratio shows the effectiveness of T2AR in the secure MANET environment design.

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

NASA Astrophysics Data System (ADS)

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

2016-05-01

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

Maintaining Limited-Range Connectivity Among Second-Order Agents

DTIC Science & Technology

2016-07-07

we consider ad-hoc networks of robotic agents with double integrator dynamics. For such networks, the connectivity maintenance problems are: (i) do...hoc networks of mobile autonomous agents. This loose ter- minology refers to groups of robotic agents with limited mobility and communica- tion...connectivity can be preserved. 3.1. Networks of robotic agents with second-order dynamics and the connectivity maintenance problem. We begin by

Secure Mobile Distributed File System (MDFS)

DTIC Science & Technology

2011-03-01

dissemination of data. In a mobile ad - hoc network, there are two classes of devices: content generators and content consumers. One im- plementation of...use of infrastructure mode is necessary because current Android implemen- tations do not support Mobile Ad - Hoc network without modification of the...NUMBER (include area code ) Standard Form 298 (Rev. 8–98) Prescribed by ANSI Std. Z39.18 24–3–2011 Master’s Thesis 2009-03-01—2011-03-31 Secure Mobile

Anomaly Detection for Data Reduction in an Unattended Ground Sensor (UGS) Field

DTIC Science & Technology

2014-09-01

information (shown with solid lines in the diagram). Typically, this would be a mobile ad - hoc network (MANET). The clusters are connected to other nodes...interquartile ranges MANET mobile ad - hoc network OSUS Open Standards for Unattended Sensors TOC tactical operations center UAVs unmanned aerial vehicles...19b. TELEPHONE NUMBER (Include area code ) 301-394-1221 Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std. Z39.18 iii Contents List of

Applying self-organizing map and modified radial based neural network for clustering and routing optimal path in wireless network

NASA Astrophysics Data System (ADS)

Hoomod, Haider K.; Kareem Jebur, Tuka

2018-05-01

Mobile ad hoc networks (MANETs) play a critical role in today’s wireless ad hoc network research and consist of active nodes that can be in motion freely. Because it consider very important problem in this network, we suggested proposed method based on modified radial basis function networks RBFN and Self-Organizing Map SOM. These networks can be improved by the use of clusters because of huge congestion in the whole network. In such a system, the performance of MANET is improved by splitting the whole network into various clusters using SOM. The performance of clustering is improved by the cluster head selection and number of clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. Proposed routing algorithm depends on the group of factors and parameters to select the path between two points in the wireless network. The SOM clustering average time (1-10 msec for stall nodes) and (8-75 msec for mobile nodes). While the routing time range (92-510 msec).The proposed system is faster than the Dijkstra by 150-300%, and faster from the RBFNN (without modify) by 145-180%.

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

PubMed

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.

Adaptive, Tactical Mesh Networking: Control Base MANET Model

DTIC Science & Technology

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

Virtual machine-based simulation platform for mobile ad-hoc network-based cyber infrastructure

DOE PAGES

Yoginath, Srikanth B.; Perumalla, Kayla S.; Henz, Brian J.

2015-09-29

In modeling and simulating complex systems such as mobile ad-hoc networks (MANETs) in de-fense communications, it is a major challenge to reconcile multiple important considerations: the rapidity of unavoidable changes to the software (network layers and applications), the difficulty of modeling the critical, implementation-dependent behavioral effects, the need to sustain larger scale scenarios, and the desire for faster simulations. Here we present our approach in success-fully reconciling them using a virtual time-synchronized virtual machine(VM)-based parallel ex-ecution framework that accurately lifts both the devices as well as the network communications to a virtual time plane while retaining full fidelity. At themore » core of our framework is a scheduling engine that operates at the level of a hypervisor scheduler, offering a unique ability to execute multi-core guest nodes over multi-core host nodes in an accurate, virtual time-synchronized manner. In contrast to other related approaches that suffer from either speed or accuracy issues, our framework provides MANET node-wise scalability, high fidelity of software behaviors, and time-ordering accuracy. The design and development of this framework is presented, and an ac-tual implementation based on the widely used Xen hypervisor system is described. Benchmarks with synthetic and actual applications are used to identify the benefits of our approach. The time inaccuracy of traditional emulation methods is demonstrated, in comparison with the accurate execution of our framework verified by theoretically correct results expected from analytical models of the same scenarios. In the largest high fidelity tests, we are able to perform virtual time-synchronized simulation of 64-node VM-based full-stack, actual software behaviors of MANETs containing a mix of static and mobile (unmanned airborne vehicle) nodes, hosted on a 32-core host, with full fidelity of unmodified ad-hoc routing protocols, unmodified application executables, and user-controllable physical layer effects including inter-device wireless signal strength, reachability, and connectivity.« less

Virtual machine-based simulation platform for mobile ad-hoc network-based cyber infrastructure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yoginath, Srikanth B.; Perumalla, Kayla S.; Henz, Brian J.

In modeling and simulating complex systems such as mobile ad-hoc networks (MANETs) in de-fense communications, it is a major challenge to reconcile multiple important considerations: the rapidity of unavoidable changes to the software (network layers and applications), the difficulty of modeling the critical, implementation-dependent behavioral effects, the need to sustain larger scale scenarios, and the desire for faster simulations. Here we present our approach in success-fully reconciling them using a virtual time-synchronized virtual machine(VM)-based parallel ex-ecution framework that accurately lifts both the devices as well as the network communications to a virtual time plane while retaining full fidelity. At themore » core of our framework is a scheduling engine that operates at the level of a hypervisor scheduler, offering a unique ability to execute multi-core guest nodes over multi-core host nodes in an accurate, virtual time-synchronized manner. In contrast to other related approaches that suffer from either speed or accuracy issues, our framework provides MANET node-wise scalability, high fidelity of software behaviors, and time-ordering accuracy. The design and development of this framework is presented, and an ac-tual implementation based on the widely used Xen hypervisor system is described. Benchmarks with synthetic and actual applications are used to identify the benefits of our approach. The time inaccuracy of traditional emulation methods is demonstrated, in comparison with the accurate execution of our framework verified by theoretically correct results expected from analytical models of the same scenarios. In the largest high fidelity tests, we are able to perform virtual time-synchronized simulation of 64-node VM-based full-stack, actual software behaviors of MANETs containing a mix of static and mobile (unmanned airborne vehicle) nodes, hosted on a 32-core host, with full fidelity of unmodified ad-hoc routing protocols, unmodified application executables, and user-controllable physical layer effects including inter-device wireless signal strength, reachability, and connectivity.« less

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

NASA Technical Reports Server (NTRS)

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.

Connecting Land-Based Networks to Ships

DTIC Science & Technology

2012-09-01

LAN Local Area Network LEO Low Earth Orbit LOS Line Of Sight MAC Media Access Control MANET Mobile Ad Hoc Networking ME Mobile...orbit – LEO ). Iridium satellite communication system is an example of LEO , while Inmarsat uses MEO and GEO. GEO satellites are the most common type...August 2012, http://www.cosmote.gr/cosmoportal/page/T25/section/Cover/ loc /en_U.S. [41] WIND, “Network Coverage map,” August 2012, http

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

DTIC Science & Technology

2009-06-01

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

Watchdog Sensor Network with Multi-Stage RF Signal Identification and Cooperative Intrusion Detection

DTIC Science & Technology

2012-03-01

detection and physical layer authentication in mobile Ad Hoc networks and wireless sensor networks (WSNs) have been investigated. Résume Le rapport...IEEE 802.16 d and e (WiMAX); (b) IEEE 802.11 (Wi-Fi) family of a, b, g, n, and s (c) Sensor networks based on IEEE 802.15.4: Wireless USB, Bluetooth... sensor network are investigated for standard compatible wireless signals. The proposed signal existence detection and identification process consists

A novel unbalanced multiple description coder for robust video transmission over ad hoc wireless networks

NASA Astrophysics Data System (ADS)

Huang, Feng; Sun, Lifeng; Zhong, Yuzhuo

2006-01-01

Robust transmission of live video over ad hoc wireless networks presents new challenges: high bandwidth requirements are coupled with delay constraints; even a single packet loss causes error propagation until a complete video frame is coded in the intra-mode; ad hoc wireless networks suffer from bursty packet losses that drastically degrade the viewing experience. Accordingly, we propose a novel UMD coder capable of quickly recovering from losses and ensuring continuous playout. It uses 'peg' frames to prevent error propagation in the High-Resolution (HR) description and improve the robustness of key frames. The Low-Resolution (LR) coder works independent of the HR one, but they can also help each other recover from losses. Like many UMD coders, our UMD coder is drift-free, disruption-tolerant and able to make good use of the asymmetric available bandwidths of multiple paths. The simulation results under different conditions show that the proposed UMD coder has the highest decoded quality and lowest probability of pause when compared with concurrent UMDC techniques. The coder also has a comparable decoded quality, lower startup delay and lower probability of pause than a state-of-the-art FEC-based scheme. To provide robustness for video multicast applications, we propose non-end-to-end UMDC-based video distribution over a multi-tree multicast network. The multiplicity of parents decorrelates losses and the non-end-to-end feature increases the throughput of UMDC video data. We deploy an application-level service of LR description reconstruction in some intermediate nodes of the LR multicast tree. The principle behind this is to reconstruct the disrupted LR frames by the correctly received HR frames. As a result, the viewing experience at the downstream nodes benefits from the protection reconstruction at the upstream nodes.

Latency-Efficient Communication in Wireless Mesh Networks under Consideration of Large Interference Range

NASA Astrophysics Data System (ADS)

Xin, Qin; Yao, Xiaolan; Engelstad, Paal E.

2010-09-01

Wireless Mesh Networking is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study here the minimum-latency communication primitive of gossiping (all-to-all communication) in multi-hop ad-hoc Wireless Mesh Networks (WMNs). Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. Minimum-latency gossiping problem is well known to be NP-hard even for the scenario in which the topology of the WMN is known to all mesh nodes in advance. In this paper, we propose a new latency-efficient approximation scheme that can accomplish gossiping task in polynomial time units in any ad-hoc WMN under consideration of Large Interference Range (LIR), e.g., the interference range is much larger than the transmission range. To the best of our knowledge, it is first time to investigate such a scenario in ad-hoc WMNs under LIR, our algorithm allows the labels (e.g., identifiers) of the mesh nodes to be polynomially large in terms of the size of the WMN, which is the first time that the scenario of large labels has been considered in ad-hoc WMNs under LIR. Furthermore, our gossiping scheme can be considered as a framework which can be easily implied to the scenario under consideration of mobility-related issues since we assume that the mesh nodes have no knowledge on the network topology even for its neighboring mesh nodes.

Immune Inspired Security Approach for Manets: a Case Study

NASA Astrophysics Data System (ADS)

Mohamed, Yasir Abdelgadir

2011-06-01

This paper extends the work that has earlier been established. Immune inspired approach for securing mobile ad hoc networks is specified there. Although it is clearly indicated there that the research scope is the wireless networks in general and hybrid mobile ad hoc networks in particular, we have seen that specifying the security system in one of the communications applications that need further security approach may help to understand how effectively the system can contribute to this vital and important networks sector. Security in this type of networks is important and controversial as it plays a key role in users' eagerness or reluctance for the services provided by these networks. In this paper, the immune inspired security system is specified to secure web services in converged networks.

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

PubMed Central

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

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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.

How to Trigger Emergence and Self-Organisation in Learning Networks

NASA Astrophysics Data System (ADS)

Brouns, Francis; Fetter, Sibren; van Rosmalen, Peter

The previous chapters of this section discussed why the social structure of Learning Networks is important and present guidelines on how to maintain and allow the emergence of communities in Learning Networks. Chapter 2 explains how Learning Networks rely on social interaction and active participations of the participants. Chapter 3 then continues by presenting guidelines and policies that should be incorporated into Learning Network Services in order to maintain existing communities by creating conditions that promote social interaction and knowledge sharing. Chapter 4 discusses the necessary conditions required for knowledge sharing to occur and to trigger communities to self-organise and emerge. As pointed out in Chap. 4, ad-hoc transient communities facilitate the emergence of social interaction in Learning Networks, self-organising them into communities, taking into account personal characteristics, community characteristics and general guidelines. As explained in Chap. 4 community members would benefit from a service that brings suitable people together for a specific purpose, because it will allow the participant to focus on the knowledge sharing process by reducing the effort or costs. In the current chapter, we describe an example of a peer support Learning Network Service based on the mechanism of peer tutoring in ad-hoc transient communities.

The Vehicular Information Space Framework

NASA Astrophysics Data System (ADS)

Prinz, Vivian; Schlichter, Johann; Schweiger, Benno

Vehicular networks are distributed, self-organizing and highly mobile ad hoc networks. They allow for providing drivers with up-to-the-minute information about their environment. Therefore, they are expected to be a decisive future enabler for enhancing driving comfort and safety. This article introduces the Vehicular Information Space framework (VIS). Vehicles running the VIS form a kind of distributed database. It enables them to provide information like existing hazards, parking spaces or traffic densities in a location aware and fully distributed manner. In addition, vehicles can retrieve, modify and delete these information items. The underlying algorithm is based on features derived from existing structured Peer-to-Peer algorithms and extended to suit the specific characteristics of highly mobile ad hoc networks. We present, implement and simulate the VIS using a motorway and an urban traffic environment. Simulation studies on VIS message occurrence show that the VIS implies reasonable traffic overhead. Also, overall VIS message traffic is independent from the number of information items provided.

Scalable Architecture for Multihop Wireless ad Hoc Networks

NASA Technical Reports Server (NTRS)

Arabshahi, Payman; Gray, Andrew; Okino, Clayton; Yan, Tsun-Yee

2004-01-01

A scalable architecture for wireless digital data and voice communications via ad hoc networks has been proposed. Although the details of the architecture and of its implementation in hardware and software have yet to be developed, the broad outlines of the architecture are fairly clear: This architecture departs from current commercial wireless communication architectures, which are characterized by low effective bandwidth per user and are not well suited to low-cost, rapid scaling in large metropolitan areas. This architecture is inspired by a vision more akin to that of more than two dozen noncommercial community wireless networking organizations established by volunteers in North America and several European countries.

Ad Hoc Networking for Unmanned Ground Vehicles: Design and Evaluation at Command, Control, Communications, Intelligence, Surveillance and Reconnaissance On-the-Move

DTIC Science & Technology

2006-11-01

software components used in the ad hoc nodes for the C4ISR OTM experiment were OLSRD, an open-source proactive MANET routing software, and OpenVPN , an...developed by Mike Baker (openwrt.org). 6OpenVPN is a trademark of OpenVPN Solutions LLC. 6 Secure communications in the MANET are achieved with...encryption provided by Wired Equivalent Privacy (WEP) and OpenVPN . The WEP protocol, which is part of the IEEE 802.11 wireless networking standard

Efficient Byzantine Fault Tolerance for Scalable Storage and Services

DTIC Science & Technology

2009-07-01

most critical applications must survive in ever harsher environments. Less synchronous networking delivers packets unreliably and unpredictably, and... synchronous environments to allowing asynchrony, and from tolerating crashes to tolerating some corruptions through ad-hoc consistency checks. Ad-hoc...servers are responsive. To support this thesis statement, this disseration takes the following steps. First, it develops a new cryptographic primitive

History-based route selection for reactive ad hoc routing protocols

NASA Astrophysics Data System (ADS)

Medidi, Sirisha; Cappetto, Peter

2007-04-01

Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart.

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

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

PubMed Central

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

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

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

PubMed

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

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

Power Aware Management Middleware for Multiple Radio Interfaces

NASA Astrophysics Data System (ADS)

Friedman, Roy; Kogan, Alex

Modern mobile phones and laptops are equipped with multiple wireless communication interfaces, such as WiFi and Bluetooth (BT), enabling the creation of ad-hoc networks. These interfaces significantly differ from one another in their power requirements, transmission range, bandwidth, etc. For example, BT is an order of magnitude more power efficient than WiFi, but its transmission range is an order of magnitude shorter. This paper introduces a management middleware that establishes a power efficient overlay for such ad-hoc networks, in which most devices can shut down their long range power hungry wireless interface (e.g., WiFi). Yet, the resulting overlay is fully connected, and for capacity and latency needs, no message ever travels more than 2k short range (e.g., BT) hops, where k is an arbitrary parameter. The paper describes the architecture of the solution and the management protocol, as well as a detailed simulations based performance study. The simulations largely validate the ability of the management infrastructure to obtain considerable power savings while keeping the network connected and maintaining reasonable latency. The performance study covers both static and mobile networks.

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

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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

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

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

NASA Astrophysics Data System (ADS)

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

2017-11-01

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

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

NASA Astrophysics Data System (ADS)

Chang, K. C.; Kotari, Vikas

2009-05-01

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

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

PubMed Central

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

2017-01-01

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

An extended smart utilization medium access control (ESU-MAC) protocol for ad hoc wireless systems

NASA Astrophysics Data System (ADS)

Vashishtha, Jyoti; Sinha, Aakash

2006-05-01

The demand for spontaneous setup of a wireless communication system has increased in recent years for areas like battlefield, disaster relief operations etc., where a pre-deployment of network infrastructure is difficult or unavailable. A mobile ad-hoc network (MANET) is a promising solution, but poses a lot of challenges for all the design layers, specifically medium access control (MAC) layer. Recent existing works have used the concepts of multi-channel and power control in designing MAC layer protocols. SU-MAC developed by the same authors, efficiently uses the 'available' data and control bandwidth to send control information and results in increased throughput via decreasing contention on the control channel. However, SU-MAC protocol was limited for static ad-hoc network and also faced the busy-receiver node problem. We present the Extended SU-MAC (ESU-MAC) protocol which works mobile nodes. Also, we significantly improve the scheme of control information exchange in ESU-MAC to overcome the busy-receiver node problem and thus, further avoid the blockage of control channel for longer periods of time. A power control scheme is used as before to reduce interference and to effectively re-use the available bandwidth. Simulation results show that ESU-MAC protocol is promising for mobile, ad-hoc network in terms of reduced contention at the control channel and improved throughput because of channel re-use. Results show a considerable increase in throughput compared to SU-MAC which could be attributed to increased accessibility of control channel and improved utilization of data channels due to superior control information exchange scheme.

EVALUATION AND ANALYSIS OF MICROSCALE FLOW AND TRANSPORT DURING REMEDIATION

EPA Science Inventory

The design of in-situ remediation is currently based on a description at the macroscopic scale. Phenomena at the pore and pore-network scales are typically lumped in terms of averaged quantities, using empirical or ad hoc expressions. These models cannot address fundamental rem...

Topology for efficient information dissemination in ad-hoc networking

NASA Technical Reports Server (NTRS)

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.

Energy conservation in ad hoc multimedia networks using traffic-shaping mechanisms

NASA Astrophysics Data System (ADS)

Chandra, Surendar

2003-12-01

In this work, we explore network traffic shaping mechanisms that deliver packets at pre-determined intervals; allowing the network interface to transition to a lower power consuming sleep state. We focus our efforts on commodity devices, IEEE 802.11b ad hoc mode and popular streaming formats. We argue that factors such as the lack of scheduling clock phase synchronization among the participants and scheduling delays introduced by back ground tasks affect the potential energy savings. Increasing the periodic transmission delays to transmit data infrequently can offset some of these effects at the expense of flooding the wireless channel for longer periods of time; potentially increasing the time to acquire the channel for non-multimedia traffic. Buffering mechanisms built into media browsers can mitigate the effects of these added delays from being mis-interpreted as network congestion. We show that practical implementations of such traffic shaping mechanisms can offer significant energy savings.

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

DTIC Science & Technology

2017-06-01

transmit their information through the network based on the specific protocols that are implemented. Nodes may be designed to perform any combination of...band, and one channel in the 868-MHz band. The IEEE 802.15.4 standard is designed to provide Low-Rate Wireless Personal Area Network (LR-WPAN...MANETs and is currently a draft at the IETF Network Working Group [9]. It was derived from the Ad hoc On -Demand Distance Vector (AODV) routing

Intelligent routing protocol for ad hoc wireless network

NASA Astrophysics Data System (ADS)

Peng, Chaorong; Chen, Chang Wen

2006-05-01

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

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

PubMed

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

2018-05-03

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

A Secure and Privacy-Preserving Navigation Scheme Using Spatial Crowdsourcing in Fog-Based VANETs

PubMed Central

Wang, Lingling; Liu, Guozhu; Sun, Lijun

2017-01-01

Fog-based VANETs (Vehicular ad hoc networks) is a new paradigm of vehicular ad hoc networks with the advantages of both vehicular cloud and fog computing. Real-time navigation schemes based on fog-based VANETs can promote the scheme performance efficiently. In this paper, we propose a secure and privacy-preserving navigation scheme by using vehicular spatial crowdsourcing based on fog-based VANETs. Fog nodes are used to generate and release the crowdsourcing tasks, and cooperatively find the optimal route according to the real-time traffic information collected by vehicles in their coverage areas. Meanwhile, the vehicle performing the crowdsourcing task can get a reasonable reward. The querying vehicle can retrieve the navigation results from each fog node successively when entering its coverage area, and follow the optimal route to the next fog node until it reaches the desired destination. Our scheme fulfills the security and privacy requirements of authentication, confidentiality and conditional privacy preservation. Some cryptographic primitives, including the Elgamal encryption algorithm, AES, randomized anonymous credentials and group signatures, are adopted to achieve this goal. Finally, we analyze the security and the efficiency of the proposed scheme. PMID:28338620

A Secure and Privacy-Preserving Navigation Scheme Using Spatial Crowdsourcing in Fog-Based VANETs.

PubMed

Wang, Lingling; Liu, Guozhu; Sun, Lijun

2017-03-24

Fog-based VANETs (Vehicular ad hoc networks) is a new paradigm of vehicular ad hoc networks with the advantages of both vehicular cloud and fog computing. Real-time navigation schemes based on fog-based VANETs can promote the scheme performance efficiently. In this paper, we propose a secure and privacy-preserving navigation scheme by using vehicular spatial crowdsourcing based on fog-based VANETs. Fog nodes are used to generate and release the crowdsourcing tasks, and cooperatively find the optimal route according to the real-time traffic information collected by vehicles in their coverage areas. Meanwhile, the vehicle performing the crowdsourcing task can get a reasonable reward. The querying vehicle can retrieve the navigation results from each fog node successively when entering its coverage area, and follow the optimal route to the next fog node until it reaches the desired destination. Our scheme fulfills the security and privacy requirements of authentication, confidentiality and conditional privacy preservation. Some cryptographic primitives, including the Elgamal encryption algorithm, AES, randomized anonymous credentials and group signatures, are adopted to achieve this goal. Finally, we analyze the security and the efficiency of the proposed scheme.

Boarding Team Networking on the Move: Applying Unattended Relay Nodes

DTIC Science & Technology

2014-09-01

below the main deck via a wireless ad-hoc network will enhance the situational awareness. Regarding the boarding of a non-compliant vessel, tracking...reaction time. 14. SUBJECT TERMS Maritime Interdiction Operations, Boarding Team Networking , Unattended Relay Nodes, Wireless Mesh Networks Onboard...the steel structures of naval vessels obstruct signals to propagate below the main deck. Extending the network below the main deck via a wireless ad

Where-Fi: a dynamic energy-efficient multimedia distribution framework for MANETs

NASA Astrophysics Data System (ADS)

Mohapatra, Shivajit; Carbunar, Bogdan; Pearce, Michael; Chaudhri, Rohit; Vasudevan, Venu

2008-01-01

Next generation mobile ad-hoc applications will revolve around users' need for sharing content/presence information with co-located devices. However, keeping such information fresh requires frequent meta-data exchanges, which could result in significant energy overheads. To address this issue, we propose distributed algorithms for energy efficient dissemination of presence and content usage information between nodes in mobile ad-hoc networks. First, we introduce a content dissemination protocol (called CPMP) for effectively distributing frequent small meta-data updates between co-located devices using multicast. We then develop two distributed algorithms that use the CPMP protocol to achieve "phase locked" wake up cycles for all the participating nodes in the network. The first algorithm is designed for fully-connected networks and then extended in the second to handle hidden terminals. The "phase locked" schedules are then exploited to adaptively transition the network interface to a deep sleep state for energy savings. We have implemented a prototype system (called "Where-Fi") on several Motorola Linux-based cell phone models. Our experimental results show that for all network topologies our algorithms were able to achieve "phase locking" between nodes even in the presence of hidden terminals. Moreover, we achieved battery lifetime extensions of as much as 28% for fully connected networks and about 20% for partially connected networks.

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

NASA Astrophysics Data System (ADS)

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.

Direct trust-based security scheme for RREQ flooding attack in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Kumar, Sunil; Dutta, Kamlesh

2017-06-01

The routing algorithms in MANETs exhibit distributed and cooperative behaviour which makes them easy target for denial of service (DoS) attacks. RREQ flooding attack is a flooding-type DoS attack in context to Ad hoc On Demand Distance Vector (AODV) routing protocol, where the attacker broadcasts massive amount of bogus Route Request (RREQ) packets to set up the route with the non-existent or existent destination in the network. This paper presents direct trust-based security scheme to detect and mitigate the impact of RREQ flooding attack on the network, in which, every node evaluates the trust degree value of its neighbours through analysing the frequency of RREQ packets originated by them over a short period of time. Taking the node's trust degree value as the input, the proposed scheme is smoothly extended for suppressing the surplus RREQ and bogus RREQ flooding packets at one-hop neighbours during the route discovery process. This scheme distinguishes itself from existing techniques by not directly blocking the service of a normal node due to increased amount of RREQ packets in some unusual conditions. The results obtained throughout the simulation experiments clearly show the feasibility and effectiveness of the proposed defensive scheme.

Beyond Line-of-Sight Information Dissemination for Force Protection

DTIC Science & Technology

2012-11-01

utilize ad hoc, mesh networks to support data-in-motion and remote data storage and access. These types of sensors are common among Force Protection...Operations and Forward Operating Base security . Current Force Protection Kits include a rich set of sensors that can be monitored from a core operator...and tactical war fighters in tactical network environments . Marti has the potential to improve situation awareness and Force Protection for

Capacity Limit, Link Scheduling and Power Control in Wireless Networks

ERIC Educational Resources Information Center

Zhou, Shan

2013-01-01

The rapid advancement of wireless technology has instigated the broad deployment of wireless networks. Different types of networks have been developed, including wireless sensor networks, mobile ad hoc networks, wireless local area networks, and cellular networks. These networks have different structures and applications, and require different…

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

PubMed

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

2015-01-01

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

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

PubMed Central

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

On the Connectivity and Multihop Delay of Ad Hoc Cognitive Radio Networks

DTIC Science & Technology

2011-04-01

that we can move fast enough such that the driving time on the road is negligible. When the secondary network is instantaneously connected, there...1.10], and the proof of Lemma 4 is based on properties of the diameter9 of the finite connected components formed by communication links in an intermit ...realization of the destination. We can see that if the secondary network is instantaneously connected (Fig. 5-(a)), the ratio decreases very fast as

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

PubMed

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

2013-04-12

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

Using Link Disconnection Entropy Disorder to Detect Fast Moving Nodes in MANETs.

PubMed

Alvarez, Carlos F; Palafox, Luis E; Aguilar, Leocundo; Sanchez, Mauricio A; Martinez, Luis G

2016-01-01

Mobile ad-hoc networks (MANETs) are dynamic by nature; this dynamism comes from node mobility, traffic congestion, and other transmission conditions. Metrics to evaluate the effects of those conditions shine a light on node's behavior in an ad-hoc network, helping to identify the node or nodes with better conditions of connection. In this paper, we propose a relative index to evaluate a single node reliability, based on the link disconnection entropy disorder using neighboring nodes as reference. Link disconnection entropy disorder is best used to identify fast moving nodes or nodes with unstable communications, this without the need of specialized sensors such as GPS. Several scenarios were studied to verify the index, measuring the effects of Speed and traffic density on the link disconnection entropy disorder. Packet delivery ratio is associated to the metric detecting a strong relationship, enabling the use of the link disconnection entropy disorder to evaluate the stability of a node to communicate with other nodes. To expand the utilization of the link entropy disorder, we identified nodes with higher speeds in network simulations just by using the link entropy disorder.

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

PubMed Central

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

PCPA: A Practical Certificateless Conditional Privacy Preserving Authentication Scheme for Vehicular Ad Hoc Networks

PubMed Central

2018-01-01

Vehicle ad hoc networks (VANETs) is a promising network scenario for greatly improving traffic efficiency and safety, in which smart vehicles can communicate with other vehicles or roadside units. For the availability of VANETs, it is very important to deal with the security and privacy problems for VANETs. In this paper, based on certificateless cryptography and elliptic curve cryptography, we present a certificateless signature with message recovery (CLS-MR), which we believe are of independent interest. Then, a practical certificateless conditional privacy preserving authentication (PCPA) scheme is proposed by incorporating the proposed CLS-MR scheme. Furthermore, the security analysis shows that PCPA satisfies all security and privacy requirements. The evaluation results indicate that PCPA achieves low computation and communication costs because there is no need to use the bilinear pairing and map-to-point hash operations. Moreover, extensive simulations show that PCPA is feasible and achieves prominent performances in terms of message delay and message loss ratio, and thus is more suitable for the deployment and adoption of VANETs. PMID:29762511

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

PubMed Central

Li, Peng; Huang, Chuanhe; Liu, Qin

2014-01-01

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

Protocol Independent Adaptive Route Update for VANET

PubMed Central

Rasheed, Asim; Qayyum, Amir

2014-01-01

High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally focused on finding and maintaining an efficient route, with very less emphasis on route update. Adaptive route update usually becomes impractical for dense networks due to large routing overheads. This paper presents an adaptive route update approach which can provide solution for any baseline routing protocol. The proposed adaptation eliminates the classification of reactive and proactive by categorizing them as logical conditions to find and update the route. PMID:24723807

Mathematics, Information, and Life Sciences

DTIC Science & Technology

2012-03-05

INS • Chip -scale atomic clocks • Ad hoc networks • Polymorphic networks • Agile networks • Laser communications • Frequency-agile RF systems...FY12 BAA Bionavigation (Bio) Neuromorphic Computing (Human) Multi-scale Modeling (Math) Foundations of Information Systems (Info) BRI

Protocol, Engineering Research Center, University of California, Santa Barbara

DTIC Science & Technology

2005-12-01

minimizing the energy consumption in idle periods. We have designed an asynchronous wakeup schedule based on the theory of block designs. The idea is...performance of ad hoc networks through innovative packet scheduling (Baker). "* Developed a number of novel schemes to ensure loop freedom in on demand routing...network nodes to schedule their transmissions to avoid collisions (Garcia-Luna-Aceves). "* Designed and analyzed the Hybrid Activation Multiple Access (HAMA

Analysis of Energy Consumption for Ad Hoc Wireless Sensor Networks Using a Bit-Meter-per-Joule Metric

NASA Astrophysics Data System (ADS)

Gao, J. L.

2002-04-01

In this article, we present a system-level characterization of the energy consumption for sensor network application scenarios. We compute a power efficiency metric -- average watt-per-meter -- for each radio transmission and extend this local metric to find the global energy consumption. This analysis shows how overall energy consumption varies with transceiver characteristics, node density, data traffic distribution, and base-station location.

Fluid Analysis of Network Content Dissemination and Cloud Systems

DTIC Science & Technology

2017-03-06

orchestration of multiple transfers , within the constraints of the communication substrate. In unstructured or aggressive environments where wireless ad...previous AFOSR/SOARD project, concerns peer-to-peer dissemination in wireless ad-hoc networks. We focus on the necessary tradeoff between an efficient...use of the network substrate, and the necessary reciprocity between peers, aspects that may be in conflict in the wireless setting. Our results

An Adaptive QoS Routing Solution for MANET Based Multimedia Communications in Emergency Cases

NASA Astrophysics Data System (ADS)

Ramrekha, Tipu Arvind; Politis, Christos

The Mobile Ad hoc Networks (MANET) is a wireless network deprived of any fixed central authoritative routing entity. It relies entirely on collaborating nodes forwarding packets from source to destination. This paper describes the design, implementation and performance evaluation of CHAMELEON, an adaptive Quality of Service (QoS) routing solution, with improved delay and jitter performances, enabling multimedia communication for MANETs in extreme emergency situations such as forest fire and terrorist attacks as defined in the PEACE project. CHAMELEON is designed to adapt its routing behaviour according to the size of a MANET. The reactive Ad Hoc on-Demand Distance Vector Routing (AODV) and proactive Optimized Link State Routing (OLSR) protocols are deemed appropriate for CHAMELEON through their performance evaluation in terms of delay and jitter for different MANET sizes in a building fire emergency scenario. CHAMELEON is then implemented in NS-2 and evaluated similarly. The paper concludes with a summary of findings so far and intended future work.

Multistage Security Mechanism For Hybrid, Large-Scale Wireless Sensor Networks

DTIC Science & Technology

2007-06-01

sensor network . Building on research in the areas of the wireless sensor networks (WSN) and the mobile ad hoc networks (MANET), this thesis proposes an...A wide area network consisting of ballistic missile defense satellites and terrestrial nodes can be viewed as a hybrid, large-scale mobile wireless

Worm epidemics in wireless ad hoc networks

NASA Astrophysics Data System (ADS)

Nekovee, Maziar

2007-06-01

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

A Prior for Neural Networks utilizing Enclosing Spheres for Normalization

NASA Astrophysics Data System (ADS)

v. Toussaint, U.; Gori, S.; Dose, V.

2004-11-01

Neural Networks are famous for their advantageous flexibility for problems when there is insufficient knowledge to set up a proper model. On the other hand this flexibility can cause over-fitting and can hamper the generalization properties of neural networks. Many approaches to regularize NN have been suggested but most of them based on ad-hoc arguments. Employing the principle of transformation invariance we derive a general prior in accordance with the Bayesian probability theory for a class of feedforward networks. Optimal networks are determined by Bayesian model comparison verifying the applicability of this approach.

Spontaneous Ad Hoc Mobile Cloud Computing Network

PubMed Central

Lacuesta, Raquel; 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. PMID:25202715

Spontaneous ad hoc mobile cloud computing network.

PubMed

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.

The Integration of Small Satellites in Maritime Interdiction Operations (MIO)

DTIC Science & Technology

2012-09-01

Interdiction Operation, Networks, Ad-Hoc Networks, AISSat-1, Adaptation, Weak Links, Satellite Tool Kit ( STK ), Tactical Network Topology (TNT). 15. NUMBER...43 B. STK .................................................................................................... 47 1. STK Modeling of... STK ............................. 69 1. Create the Six Satellites ........................................................ 69 2. Create the Facility

Introduction to Blueweb: A Decentralized Scatternet Formation Algorithm for Bluetooth Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Yu, Chih-Min; Huang, Chia-Chi

In this letter, a decentralized scatternet formation algorithm called Bluelayer is proposed. First, Bluelayer uses a designated root to construct a tree-shaped subnet and propagates an integer variable k1 called counter limit as well as a constant k in its downstream direction to determine new roots. Then each new root asks its upstream master to start a return connection procedure to convert the tree-shaped subnet into a web-shaped subnet for its immediate upstream root. At the same time, each new root repeats the same procedure as the root to build its own subnet until the whole scatternet is formed. Simulation results show that Bluelayer achieves good network scalability and generates an efficient scatternet configuration for various sizes of Bluetooth ad hoc network.

Sensor Based Framework for Secure Multimedia Communication in VANET

PubMed Central

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

2010-01-01

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

Whisper: Local Secret Maintenance in Sensor Networks

DTIC Science & Technology

2003-02-01

networks, such as Balfanz et al. [1] and Hubaux et al. [9]; these works also use asymmetric cryptography while we use the less expensive symmetric... Balfanz , D. K. Smetters, P. Stewart and H. Chi Wong. Talking to strangers: authentication in ad-hoc wireless network. Symposium on Network and Distributed

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

NASA Astrophysics Data System (ADS)

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

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

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

PubMed

Hu, Miao; Zhong, Zhangdui; Ni, Minming; Baiocchi, Andrea

2016-11-01

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.

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

PubMed Central

Hu, Miao; Zhong, Zhangdui; Ni, Minming; Baiocchi, Andrea

2016-01-01

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

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)

DTIC Science & Technology

2007-04-01

for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data...Control Organization NRL Navy Research Laboratory nrtPS Non-real- time Polling Services OFDM Orthogonal frequency division multiplex OFDMA...Routeur IDentifier RTG RTO Task Group RTO Research & Technology Organization rtPS Real- time Polling Services SC Single-carrier modulation

Self-Organized Link State Aware Routing for Multiple Mobile Agents in Wireless Network

NASA Astrophysics Data System (ADS)

Oda, Akihiro; Nishi, Hiroaki

Recently, the importance of data sharing structures in autonomous distributed networks has been increasing. A wireless sensor network is used for managing distributed data. This type of distributed network requires effective information exchanging methods for data sharing. To reduce the traffic of broadcasted messages, reduction of the amount of redundant information is indispensable. In order to reduce packet loss in mobile ad-hoc networks, QoS-sensitive routing algorithm have been frequently discussed. The topology of a wireless network is likely to change frequently according to the movement of mobile nodes, radio disturbance, or fading due to the continuous changes in the environment. Therefore, a packet routing algorithm should guarantee QoS by using some quality indicators of the wireless network. In this paper, a novel information exchanging algorithm developed using a hash function and a Boolean operation is proposed. This algorithm achieves efficient information exchanges by reducing the overhead of broadcasting messages, and it can guarantee QoS in a wireless network environment. It can be applied to a routing algorithm in a mobile ad-hoc network. In the proposed routing algorithm, a routing table is constructed by using the received signal strength indicator (RSSI), and the neighborhood information is periodically broadcasted depending on this table. The proposed hash-based routing entry management by using an extended MAC address can eliminate the overhead of message flooding. An analysis of the collision of hash values contributes to the determination of the length of the hash values, which is minimally required. Based on the verification of a mathematical theory, an optimum hash function for determining the length of hash values can be given. Simulations are carried out to evaluate the effectiveness of the proposed algorithm and to validate the theory in a general wireless network routing algorithm.

A hierarchical detection method in external communication for self-driving vehicles based on TDMA.

PubMed

Alheeti, Khattab M Ali; Al-Ani, Muzhir Shaban; McDonald-Maier, Klaus

2018-01-01

Security is considered a major challenge for self-driving and semi self-driving vehicles. These vehicles depend heavily on communications to predict and sense their external environment used in their motion. They use a type of ad hoc network termed Vehicular ad hoc networks (VANETs). Unfortunately, VANETs are potentially exposed to many attacks on network and application level. This paper, proposes a new intrusion detection system to protect the communication system of self-driving cars; utilising a combination of hierarchical models based on clusters and log parameters. This security system is designed to detect Sybil and Wormhole attacks in highway usage scenarios. It is based on clusters, utilising Time Division Multiple Access (TDMA) to overcome some of the obstacles of VANETs such as high density, high mobility and bandwidth limitations in exchanging messages. This makes the security system more efficient, accurate and capable of real time detection and quick in identification of malicious behaviour in VANETs. In this scheme, each vehicle log calculates and stores different parameter values after receiving the cooperative awareness messages from nearby vehicles. The vehicles exchange their log data and determine the difference between the parameters, which is utilised to detect Sybil attacks and Wormhole attacks. In order to realize efficient and effective intrusion detection system, we use the well-known network simulator (ns-2) to verify the performance of the security system. Simulation results indicate that the security system can achieve high detection rates and effectively detect anomalies with low rate of false alarms.

Ad Hoc Network Architecture for Multi-Media Networks

DTIC Science & Technology

2007-12-01

sensor network . Video traffic is modeled and simulations are performed via the use of the Sun Small Programmable Object Technology (Sun SPOT) Java...characteristics of video traffic must be studied and understood. This thesis focuses on evaluating the possibility of routing video images over a wireless

Using Link Disconnection Entropy Disorder to Detect Fast Moving Nodes in MANETs

PubMed Central

Palafox, Luis E.; Aguilar, Leocundo; Sanchez, Mauricio A.; Martinez, Luis G.

2016-01-01

Mobile ad-hoc networks (MANETs) are dynamic by nature; this dynamism comes from node mobility, traffic congestion, and other transmission conditions. Metrics to evaluate the effects of those conditions shine a light on node’s behavior in an ad-hoc network, helping to identify the node or nodes with better conditions of connection. In this paper, we propose a relative index to evaluate a single node reliability, based on the link disconnection entropy disorder using neighboring nodes as reference. Link disconnection entropy disorder is best used to identify fast moving nodes or nodes with unstable communications, this without the need of specialized sensors such as GPS. Several scenarios were studied to verify the index, measuring the effects of Speed and traffic density on the link disconnection entropy disorder. Packet delivery ratio is associated to the metric detecting a strong relationship, enabling the use of the link disconnection entropy disorder to evaluate the stability of a node to communicate with other nodes. To expand the utilization of the link entropy disorder, we identified nodes with higher speeds in network simulations just by using the link entropy disorder. PMID:27219671

Ad Hoc Supervision of General Practice Registrars as a "Community of Practice": Analysis, Interpretation and Re-Presentation

ERIC Educational Resources Information Center

Clement, T.; Brown, J.; Morrison, J.; Nestel, D.

2016-01-01

General practice registrars in Australia undertake most of their vocational training in accredited general practices. They typically see patients alone from the start of their community-based training and are expected to seek timely ad hoc support from their supervisor. Such ad hoc encounters are a mechanism for ensuring patient safety, but also…

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

Friedlander, David; Griffin, Christopher; Jacobson, Noah; Phoha, Shashi; Brooks, Richard R.

2003-12-01

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.

Realtime multiprocessor for mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Jungeblut, T.; Grünewald, M.; Porrmann, M.; Rückert, U.

2008-05-01

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.

31 CFR Appendix M to Subpart A - Financial Crimes Enforcement Network

Code of Federal Regulations, 2010 CFR

2010-07-01

... 31 Money and Finance: Treasury 1 2010-07-01 2010-07-01 false Financial Crimes Enforcement Network... Crimes Enforcement Network 1. In general. This appendix applies to the Financial Crimes Enforcement Network (FinCEN). 2. Public Reading Room. FinCEN will provide a room on an ad hoc basis when necessary...

31 CFR Appendix M to Subpart A - Financial Crimes Enforcement Network

Code of Federal Regulations, 2011 CFR

2011-07-01

... 31 Money and Finance: Treasury 1 2011-07-01 2011-07-01 false Financial Crimes Enforcement Network... Crimes Enforcement Network 1. In general. This appendix applies to the Financial Crimes Enforcement Network (FinCEN). 2. Public Reading Room. FinCEN will provide a room on an ad hoc basis when necessary...

Security in MANETs using reputation-adjusted routing

NASA Astrophysics Data System (ADS)

Ondi, Attila; Hoffman, Katherine; Perez, Carlos; Ford, Richard; Carvalho, Marco; Allen, William

2009-04-01

Mobile Ad-Hoc Networks enable communication in various dynamic environments, including military combat operations. Their open and shared communication medium enables new forms of attack that are not applicable for traditional wired networks. Traditional security mechanisms and defense techniques are not prepared to cope with the new attacks and the lack of central authorities make identity verifications difficult. This work extends our previous work in the Biologically Inspired Tactical Security Infrastructure to provide a reputation-based weighing mechanism for linkstate routing protocols to protect the network from attackers that are corrupting legitimate network traffic. Our results indicate that the approach is successful in routing network traffic around compromised computers.

A Hierarchical Auction-Based Mechanism for Real-Time Resource Allocation in Cloud Robotic Systems.

PubMed

Wang, Lujia; Liu, Ming; Meng, Max Q-H

2017-02-01

Cloud computing enables users to share computing resources on-demand. The cloud computing framework cannot be directly mapped to cloud robotic systems with ad hoc networks since cloud robotic systems have additional constraints such as limited bandwidth and dynamic structure. However, most multirobotic applications with cooperative control adopt this decentralized approach to avoid a single point of failure. Robots need to continuously update intensive data to execute tasks in a coordinated manner, which implies real-time requirements. Thus, a resource allocation strategy is required, especially in such resource-constrained environments. This paper proposes a hierarchical auction-based mechanism, namely link quality matrix (LQM) auction, which is suitable for ad hoc networks by introducing a link quality indicator. The proposed algorithm produces a fast and robust method that is accurate and scalable. It reduces both global communication and unnecessary repeated computation. The proposed method is designed for firm real-time resource retrieval for physical multirobot systems. A joint surveillance scenario empirically validates the proposed mechanism by assessing several practical metrics. The results show that the proposed LQM auction outperforms state-of-the-art algorithms for resource allocation.

On mobile wireless ad hoc IP video transports

NASA Astrophysics Data System (ADS)

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.

Data management issues in mobile ad hoc networks

PubMed Central

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

Data management issues in mobile ad hoc networks.

PubMed

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.

Ultra-wideband radar sensors and networks

DOEpatents

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

2013-08-06

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

Distributive routing and congestion control in wireless multihop ad hoc communication networks

NASA Astrophysics Data System (ADS)

Glauche, Ingmar; Krause, Wolfram; Sollacher, Rudolf; Greiner, Martin

2004-10-01

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example network connectivity, good data traffic performance and robustness are guaranteed. In this contribution the focus is on routing and congestion control. First, random data traffic along shortest path routes is studied by simulations as well as theoretical modeling. Measures of congestion like end-to-end time delay and relaxation times are given. A scaling law of the average time delay with respect to network size is revealed and found to depend on the underlying network topology. In the second step, a distributive routing and congestion control is proposed. Each node locally propagates its routing cost estimates and information about its congestion state to its neighbors, which then update their respective cost estimates. This allows for a flexible adaptation of end-to-end routes to the overall congestion state of the network. Compared to shortest-path routing, the critical network load is significantly increased.

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

PubMed Central

Tan, Guozhen; Yu, Chao

2017-01-01

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

Adaptive Control Parameters for Dispersal of Multi-Agent Mobile Ad Hoc Network (MANET) Swarms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kurt Derr; Milos Manic

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 dispersionmore » 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.« less

SPECS: Secure and Privacy Enhancing Communications Schemes for VANETs

NASA Astrophysics Data System (ADS)

Chim, T. W.; Yiu, S. M.; Hui, L. C. K.; Jiang, Zoe L.; Li, Victor O. K.

Vehicular ad hoc network (VANET) is an emerging type of networks which facilitates vehicles on roads to communicate for driving safety. The basic idea is to allow arbitrary vehicles to broadcast ad hoc messages (e.g. traffic accidents) to other vehicles. However, this raises the concern of security and privacy. Messages should be signed and verified before they are trusted while the real identity of vehicles should not be revealed, but traceable by authorized party. Existing solutions either rely heavily on a tamper-proof hardware device, or cannot satisfy the privacy requirement and do not have an effective message verification scheme. In this paper, we provide a software-based solution which makes use of only two shared secrets to satisfy the privacy requirement and gives lower message overhead and at least 45% higher successful rate than previous solutions in the message verification phase using the bloom filter and the binary search techniques. We also provide the first group communication protocol to allow vehicles to authenticate and securely communicate with others in a group of known vehicles.

Dynamic Key Management Schemes for Secure Group Access Control Using Hierarchical Clustering in Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Tsaur, Woei-Jiunn; Pai, Haw-Tyng

2008-11-01

The applications of group computing and communication motivate the requirement to provide group access control in mobile ad hoc networks (MANETs). The operation in MANETs' groups performs a decentralized manner and accommodated membership dynamically. Moreover, due to lack of centralized control, MANETs' groups are inherently insecure and vulnerable to attacks from both within and outside the groups. Such features make access control more challenging in MANETs. Recently, several researchers have proposed group access control mechanisms in MANETs based on a variety of threshold signatures. However, these mechanisms cannot actually satisfy MANETs' dynamic environments. This is because the threshold-based mechanisms cannot be achieved when the number of members is not up to the threshold value. Hence, by combining the efficient elliptic curve cryptosystem, self-certified public key cryptosystem and secure filter technique, we construct dynamic key management schemes based on hierarchical clustering for securing group access control in MANETs. Specifically, the proposed schemes can constantly accomplish secure group access control only by renewing the secure filters of few cluster heads, when a cluster head joins or leaves a cross-cluster. In such a new way, we can find that the proposed group access control scheme can be very effective for securing practical applications in MANETs.

Cross Layered Multi-Meshed Tree Scheme for Cognitive Networks

DTIC Science & Technology

2011-06-01

Meshed Tree Routing protocol wireless ad hoc networks ,” Second IEEE International Workshop on Enabling Technologies and Standards for Wireless Mesh ...and Sensor Networks , 2004 43. Chen G.; Stojmenovic I., “Clustering and routing in mobile wireless networks ,” Technical Report TR-99-05, SITE, June...Cross-layer optimization, intra-cluster routing , packet forwarding, inter-cluster routing , mesh network communications,

The design of tea garden environmental monitoring system based on WSN

NASA Astrophysics Data System (ADS)

Chen, Huajun; Yuan, Lina

2018-01-01

Through the application of wireless sensor network (WSN) in tea garden, it can realize the change of traditional tea garden to the modern ones, and effectively improves the comprehensive productive capacity of tea garden. According to the requirement of real-time remote in agricultural information collection and monitoring and the power supply affected by environmental limitations, based on WSN, this paper designs a set of tea garden environmental monitoring system, which achieves the monitoring nodes with ad-hoc network as well as automatic acquisition and transmission to the tea plantations of air temperature, light intensity, soil temperature and humidity.

Assessment of the 802.11g Wireless Protocol for Lunar Surface Communications

NASA Technical Reports Server (NTRS)

Chelmins, David T.; Bguyen, Hung D.; Foore, Lawrence R.

2009-01-01

Future lunar surface missions supporting the NASA Vision for Space Exploration will rely on wireless networks to transmit voice and data. The ad hoc network architecture is of particular interest since it does not require a complex infrastructure. In this report, we looked at data performance over an ad hoc network with varying distances between Apple AirPort wireless cards. We developed a testing program to transmit data packets at precise times and then monitored the receive time to characterize connection delay, packet loss, and data rate. Best results were received for wireless links of less than 75 ft, and marginally acceptable (25-percent) packet loss was received at 150 ft. It is likely that better results will be obtained on the lunar surface because of reduced radiofrequency interference; however, higher power transmitters or receivers will be needed for significant performance gains.

Software Architecture of Sensor Data Distribution In Planetary Exploration

NASA Technical Reports Server (NTRS)

Lee, Charles; Alena, Richard; Stone, Thom; Ossenfort, John; Walker, Ed; Notario, Hugo

2006-01-01

Data from mobile and stationary sensors will be vital in planetary surface exploration. The distribution and collection of sensor data in an ad-hoc wireless network presents a challenge. Irregular terrain, mobile nodes, new associations with access points and repeaters with stronger signals as the network reconfigures to adapt to new conditions, signal fade and hardware failures can cause: a) Data errors; b) Out of sequence packets; c) Duplicate packets; and d) Drop out periods (when node is not connected). To mitigate the effects of these impairments, a robust and reliable software architecture must be implemented. This architecture must also be tolerant of communications outages. This paper describes such a robust and reliable software infrastructure that meets the challenges of a distributed ad hoc network in a difficult environment and presents the results of actual field experiments testing the principles and actual code developed.

A hierarchical detection method in external communication for self-driving vehicles based on TDMA

PubMed Central

Al-ani, Muzhir Shaban; McDonald-Maier, Klaus

2018-01-01

Security is considered a major challenge for self-driving and semi self-driving vehicles. These vehicles depend heavily on communications to predict and sense their external environment used in their motion. They use a type of ad hoc network termed Vehicular ad hoc networks (VANETs). Unfortunately, VANETs are potentially exposed to many attacks on network and application level. This paper, proposes a new intrusion detection system to protect the communication system of self-driving cars; utilising a combination of hierarchical models based on clusters and log parameters. This security system is designed to detect Sybil and Wormhole attacks in highway usage scenarios. It is based on clusters, utilising Time Division Multiple Access (TDMA) to overcome some of the obstacles of VANETs such as high density, high mobility and bandwidth limitations in exchanging messages. This makes the security system more efficient, accurate and capable of real time detection and quick in identification of malicious behaviour in VANETs. In this scheme, each vehicle log calculates and stores different parameter values after receiving the cooperative awareness messages from nearby vehicles. The vehicles exchange their log data and determine the difference between the parameters, which is utilised to detect Sybil attacks and Wormhole attacks. In order to realize efficient and effective intrusion detection system, we use the well-known network simulator (ns-2) to verify the performance of the security system. Simulation results indicate that the security system can achieve high detection rates and effectively detect anomalies with low rate of false alarms. PMID:29315302

Research of ad hoc network based on SINCGARS network

NASA Astrophysics Data System (ADS)

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.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tang, J. Y.; Riley, W. J.

We present a generic flux limiter to account for mass limitations from an arbitrary number of substrates in a biogeochemical reaction network. The flux limiter is based on the observation that substrate (e.g., nitrogen, phosphorus) limitation in biogeochemical models can be represented as to ensure mass conservative and non-negative numerical solutions to the governing ordinary differential equations. Application of the flux limiter includes two steps: (1) formulation of the biogeochemical processes with a matrix of stoichiometric coefficients and (2) application of Liebig's law of the minimum using the dynamic stoichiometric relationship of the reactants. This approach contrasts with the ad hoc down-regulationmore » approaches that are implemented in many existing models (such as CLM4.5 and the ACME (Accelerated Climate Modeling for Energy) Land Model (ALM)) of carbon and nutrient interactions, which are error prone when adding new processes, even for experienced modelers. Through an example implementation with a CENTURY-like decomposition model that includes carbon, nitrogen, and phosphorus, we show that our approach (1) produced almost identical results to that from the ad hoc down-regulation approaches under non-limiting nutrient conditions, (2) properly resolved the negative solutions under substrate-limited conditions where the simple clipping approach failed, (3) successfully avoided the potential conceptual ambiguities that are implied by those ad hoc down-regulation approaches. We expect our approach will make future biogeochemical models easier to improve and more robust.« less

Deep Potential Molecular Dynamics: A Scalable Model with the Accuracy of Quantum Mechanics

NASA Astrophysics Data System (ADS)

Zhang, Linfeng; Han, Jiequn; Wang, Han; Car, Roberto; E, Weinan

2018-04-01

We introduce a scheme for molecular simulations, the deep potential molecular dynamics (DPMD) method, based on a many-body potential and interatomic forces generated by a carefully crafted deep neural network trained with ab initio data. The neural network model preserves all the natural symmetries in the problem. It is first-principles based in the sense that there are no ad hoc components aside from the network model. We show that the proposed scheme provides an efficient and accurate protocol in a variety of systems, including bulk materials and molecules. In all these cases, DPMD gives results that are essentially indistinguishable from the original data, at a cost that scales linearly with system size.

Assessing Clinical Microbiology Practice Guidelines: American Society for Microbiology Ad Hoc Committee on Evidence-Based Laboratory Medicine Practice Guidelines Assessment

PubMed Central

Kirn, Thomas J.; Westblade, Lars F.; Humphries, Romney

2017-01-01

ABSTRACT 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. PMID:28835476

Efficient Proximity Computation Techniques Using ZIP Code Data for Smart Cities †

PubMed Central

Murdani, Muhammad Harist; Hong, Bonghee

2018-01-01

In this paper, we are interested in computing ZIP code proximity from two perspectives, proximity between two ZIP codes (Ad-Hoc) and neighborhood proximity (Top-K). Such a computation can be used for ZIP code-based target marketing as one of the smart city applications. A naïve approach to this computation is the usage of the distance between ZIP codes. We redefine a distance metric combining the centroid distance with the intersecting road network between ZIP codes by using a weighted sum method. Furthermore, we prove that the results of our combined approach conform to the characteristics of distance measurement. We have proposed a general and heuristic approach for computing Ad-Hoc proximity, while for computing Top-K proximity, we have proposed a general approach only. Our experimental results indicate that our approaches are verifiable and effective in reducing the execution time and search space. PMID:29587366

Efficient Proximity Computation Techniques Using ZIP Code Data for Smart Cities †.

PubMed

Murdani, Muhammad Harist; Kwon, Joonho; Choi, Yoon-Ho; Hong, Bonghee

2018-03-24

In this paper, we are interested in computing ZIP code proximity from two perspectives, proximity between two ZIP codes ( Ad-Hoc ) and neighborhood proximity ( Top-K ). Such a computation can be used for ZIP code-based target marketing as one of the smart city applications. A naïve approach to this computation is the usage of the distance between ZIP codes. We redefine a distance metric combining the centroid distance with the intersecting road network between ZIP codes by using a weighted sum method. Furthermore, we prove that the results of our combined approach conform to the characteristics of distance measurement. We have proposed a general and heuristic approach for computing Ad-Hoc proximity, while for computing Top-K proximity, we have proposed a general approach only. Our experimental results indicate that our approaches are verifiable and effective in reducing the execution time and search space.

Provision of out-of-hours interventional radiology services in the London strategic health authority.

PubMed

Illing, R O; Clark, C L Ingham; Allum, C

2010-04-01

To review the provision of out-of-hours interventional radiology (IR) services in the London Strategic Health Authority (SHA). All 29 acute hospitals in the London SHA were contacted between November 2008 and January 2009. A questionnaire based on the Royal College of Radiologists (RCR) guidelines assessed the provision of out-of-hours IR services. An "ad-hoc" service was defined as on-call provision where not all the radiologists could perform intervention: If IR was required out of hours, an interventionalist came in when off-duty or the patient was transferred. Seventeen out of the 29 (59%) hospitals provided ad-hoc out-of-hours services, eight (28%) provided a 24-hour rota, and four (14%) provide no out-of-hours cover. No ad-hoc service had formal transfer arrangements to a centre providing a 24h service. Only two hospitals providing a 24h service had six radiologists on the rota. Strategic planning for out-of-hours IR across London is recommended. This is likely to be welcomed by the hospitals involved, allowing informal arrangements to be formalized, and collaboration to provide comprehensive regional networks, provided appropriate funding is made available. A national audit is recommended; it is unlikely these findings are unique to London.

Robust Network Design - Connectivity and Beyond

DTIC Science & Technology

2015-01-15

utilize a heterogeneous set of physical links (RF, Optical/Laser and SATCOM), for interconnecting a set of terrestrial, space and highly mobile airborne...design of mobility patterns of airborne platforms to provide stable operating conditions,  the design of networks that enable graceful performance...research effort, Airborne Network research was primarily directed towards Mobile Ad-hoc Networks (MANET). From our experience in design and

Optimal Scheduling for Underwater Communications in Multiple-user Scenarios

DTIC Science & Technology

2014-09-30

underwater acoustic sensor networks . These techniques aim at consuming as less energy as... underwater acoustic networks disrupt the behavior of surrounding species of marine mammals. As a consequence of these two studies, we aim at developing...Markov models of incremental redundancy hybrid ARQ over underwater acoustic channels. Elsevier Journal on Ad-hoc Networks (Special Issue on Underwater Communications and Networks ), 2014. 4

Trust Threshold Based Public Key Management in Mobile Ad Hoc Networks

DTIC Science & Technology

2016-03-05

should operate in a self-organized way. Capkun t al. [15] proposed a certificate-based self-organized pub- c key management for MANETs by removing...period allo node started with ignorance interact with other nodes, th not reach T th Table 2 Attack behavior for operations . Operation Attack...section, we discuss the core operations o CTPKM as illustrated by Fig. 1 . Each mobile entity is able t communicate with other entities using public

Intelligent Traffic Quantification System

NASA Astrophysics Data System (ADS)

Mohanty, Anita; Bhanja, Urmila; Mahapatra, Sudipta

2017-08-01

Currently, city traffic monitoring and controlling is a big issue in almost all cities worldwide. Vehicular ad-hoc Network (VANET) technique is an efficient tool to minimize this problem. Usually, different types of on board sensors are installed in vehicles to generate messages characterized by different vehicle parameters. In this work, an intelligent system based on fuzzy clustering technique is developed to reduce the number of individual messages by extracting important features from the messages of a vehicle. Therefore, the proposed fuzzy clustering technique reduces the traffic load of the network. The technique also reduces congestion and quantifies congestion.

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

PubMed Central

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

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

PubMed

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.

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

PubMed Central

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

Analysis of interference performance of tactical radio network

NASA Astrophysics Data System (ADS)

Nie, Hao; Cai, Xiaoxia; Chen, Hong

2017-08-01

Mobile Ad hoc network has a strong military background for its development as the core technology of the backbone network of US tactical Internet. And which tactical radio network, is the war in today's tactical use of the Internet more mature form of networking, mainly used in brigade and brigade following forces. This paper analyzes the typical protocol AODV in the tactical radio network, and then carries on the networking. By adding the interference device to the whole network, the battlefield environment is simulated, and then the throughput, delay and packet loss rate are analyzed, and the performance of the whole network and the single node before and after the interference is obtained.

A Scalable Model for Channel Access Protocols in Multihop Ad Hoc Networks

DTIC Science & Technology

2004-01-01

among the nodes. Gitman [28] published what is arguably the first paper that actually dealt with a multihop system. Gitman con- sidered a two-hop...Wireless Information Networks, vol. 9, no. 3, pp. 191–199, July 2002. [28] I. Gitman , “On the capacity of slotted ALOHA networks and some desigh

The evolution of a Ku-Band satellite network

NASA Technical Reports Server (NTRS)

Bransford, L. A.; Diebler, M.; Dutka, S. C.; Gorton, D. W.

1982-01-01

The purpose of this study was to undertake the management and development of CTS terminals and time on appropriate Ku-Band satellites was procured. A community of public service users who have readily addressable needs and resources to pay for services on an ad hoc Ku-Band network was developed and a test network for selected users was managed.

Prototyping and Simulation of Robot Group Intelligence using Kohonen Networks.

PubMed

Wang, Zhijun; Mirdamadi, Reza; Wang, Qing

2016-01-01

Intelligent agents such as robots can form ad hoc networks and replace human being in many dangerous scenarios such as a complicated disaster relief site. This project prototypes and builds a computer simulator to simulate robot kinetics, unsupervised learning using Kohonen networks, as well as group intelligence when an ad hoc network is formed. Each robot is modeled using an object with a simple set of attributes and methods that define its internal states and possible actions it may take under certain circumstances. As the result, simple, reliable, and affordable robots can be deployed to form the network. The simulator simulates a group of robots as an unsupervised learning unit and tests the learning results under scenarios with different complexities. The simulation results show that a group of robots could demonstrate highly collaborative behavior on a complex terrain. This study could potentially provide a software simulation platform for testing individual and group capability of robots before the design process and manufacturing of robots. Therefore, results of the project have the potential to reduce the cost and improve the efficiency of robot design and building.

Prototyping and Simulation of Robot Group Intelligence using Kohonen Networks

PubMed Central

Wang, Zhijun; Mirdamadi, Reza; Wang, Qing

2016-01-01

Intelligent agents such as robots can form ad hoc networks and replace human being in many dangerous scenarios such as a complicated disaster relief site. This project prototypes and builds a computer simulator to simulate robot kinetics, unsupervised learning using Kohonen networks, as well as group intelligence when an ad hoc network is formed. Each robot is modeled using an object with a simple set of attributes and methods that define its internal states and possible actions it may take under certain circumstances. As the result, simple, reliable, and affordable robots can be deployed to form the network. The simulator simulates a group of robots as an unsupervised learning unit and tests the learning results under scenarios with different complexities. The simulation results show that a group of robots could demonstrate highly collaborative behavior on a complex terrain. This study could potentially provide a software simulation platform for testing individual and group capability of robots before the design process and manufacturing of robots. Therefore, results of the project have the potential to reduce the cost and improve the efficiency of robot design and building. PMID:28540284

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

PubMed

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.

A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

PubMed Central

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

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

PubMed Central

2017-01-01

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

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

PubMed

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.

Assessing Clinical Microbiology Practice Guidelines: American Society for Microbiology Ad Hoc Committee on Evidence-Based Laboratory Medicine Practice Guidelines Assessment.

PubMed

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.

Distributed policy based access to networked heterogeneous ISR data sources

NASA Astrophysics Data System (ADS)

Bent, G.; Vyvyan, D.; Wood, David; Zerfos, Petros; Calo, Seraphin

2010-04-01

Within a coalition environment, ad hoc Communities of Interest (CoI's) come together, perhaps for only a short time, with different sensors, sensor platforms, data fusion elements, and networks to conduct a task (or set of tasks) with different coalition members taking different roles. In such a coalition, each organization will have its own inherent restrictions on how it will interact with the others. These are usually stated as a set of policies, including security and privacy policies. The capability that we want to enable for a coalition operation is to provide access to information from any coalition partner in conformance with the policies of all. One of the challenges in supporting such ad-hoc coalition operations is that of providing efficient access to distributed sources of data, where the applications requiring the data do not have knowledge of the location of the data within the network. To address this challenge the International Technology Alliance (ITA) program has been developing the concept of a Dynamic Distributed Federated Database (DDFD), also know as a Gaian Database. This type of database provides a means for accessing data across a network of distributed heterogeneous data sources where access to the information is controlled by a mixture of local and global policies. We describe how a network of disparate ISR elements can be expressed as a DDFD and how this approach enables sensor and other information sources to be discovered autonomously or semi-autonomously and/or combined, fused formally defined local and global policies.

Network Management System for Tactical Mobile Ad Hoc Network Segments

DTIC Science & Technology

2011-09-01

Protocol UFO UHF Follow-On UHF Ultra High Frequency USB Universal Serial Bus VHF Very High Frequency VIRT Valuable Information at the Right Time...military satellite system known as the UHF Follow-on system ( UFO ) only provides capacity for 600 concurrent users. DoD users also have commercial

Active Cooperation Between Primary Users and Cognitive Radio Users in Heterogeneous Ad-Hoc Networks

DTIC Science & Technology

2012-04-01

processing to wireless communications and networking, including space-time coding and modulation for MIMO wireless communications, MIMO - OFDM systems, and...multiinput-multioutput ( MIMO ) system that can significantly increase the link capacity and realize a new form of spatial diversity which has been termed

RF Characteristics of Mica-Z Wireless Sensor Network Motes

DTIC Science & Technology

2006-03-01

MICA-Z WIRELESS SENSOR NETWORK MOTES by Swee Jin Koh March 2006 Thesis Advisor: Gurminder Singh Thesis Co-Advisor: John C...Mica-Z Wireless Sensor Network Motes 6. AUTHOR(S) : Swee Jin Koh 5. FUNDING NUMBERS 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Naval...ad-hoc deployment. 15. NUMBER OF PAGES 83 14. SUBJECT TERMS: Wireless Sensor Network 16. PRICE CODE 17. SECURITY CLASSIFICATION OF

Wireless Sensor Network With Geolocation

DTIC Science & Technology

2006-11-01

WIRELESS SENSOR NETWORK WITH GEOLOCATION James Silverstrim and Roderick Passmore Innovative Wireless Technologies Forest, VA 24551 Dr...TYPE N/A 3. DATES COVERED - 4. TITLE AND SUBTITLE Wireless Sensor Network With Geolocation 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM...Locationing in distributed ad-hoc wireless sensor networks ”, IEEE ICASSP, May 2001. D. W. Hanson, Fundamentals of Two-Way Time Transfer by Satellite

Information Assurance in Wireless Networks

NASA Astrophysics Data System (ADS)

Kabara, Joseph; Krishnamurthy, Prashant; Tipper, David

2001-09-01

Emerging wireless networks will contain a hybrid infrastructure based on fixed, mobile and ad hoc topologies and technologies. In such a dynamic architecture, we define information assurance as the provisions for both information security and information availability. The implications of this definition are that the wireless network architecture must (a) provide sufficient security measures, (b) be survivable under node or link attack or failure and (c) be designed such that sufficient capacity remains for all critical services (and preferably most other services) in the event of attack or component failure. We have begun a research project to investigate the provision of information assurance for wireless networks viz. survivability, security and availability and here discuss the issues and challenges therein.

Simple Peer-to-Peer SIP Privacy

NASA Astrophysics Data System (ADS)

Koskela, Joakim; Tarkoma, Sasu

In this paper, we introduce a model for enhancing privacy in peer-to-peer communication systems. The model is based on data obfuscation, preventing intermediate nodes from tracking calls, while still utilizing the shared resources of the peer network. This increases security when moving between untrusted, limited and ad-hoc networks, when the user is forced to rely on peer-to-peer schemes. The model is evaluated using a Host Identity Protocol-based prototype on mobile devices, and is found to provide good privacy, especially when combined with a source address hiding scheme. The contribution of this paper is to present the model and results obtained from its use, including usability considerations.

FHWA White Paper on Mobile Ad Hoc Networks

DOT National Transportation Integrated Search

2018-01-01

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

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

NASA Astrophysics Data System (ADS)

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.

Performance Improvement in Geographic Routing for Vehicular Ad Hoc Networks

PubMed Central

Kaiwartya, Omprakash; Kumar, Sushil; Lobiyal, D. K.; Abdullah, Abdul Hanan; Hassan, Ahmed Nazar

2014-01-01

Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed. PMID:25429415

Performance improvement in geographic routing for Vehicular Ad Hoc Networks.

PubMed

Kaiwartya, Omprakash; Kumar, Sushil; Lobiyal, D K; Abdullah, Abdul Hanan; Hassan, Ahmed Nazar

2014-11-25

Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed.

Technical Note: A generic law-of-the-minimum flux limiter for simulating substrate limitation in biogeochemical models

DOE PAGES

Tang, J. Y.; Riley, W. J.

2016-02-05

We present a generic flux limiter to account for mass limitations from an arbitrary number of substrates in a biogeochemical reaction network. The flux limiter is based on the observation that substrate (e.g., nitrogen, phosphorus) limitation in biogeochemical models can be represented as to ensure mass conservative and non-negative numerical solutions to the governing ordinary differential equations. Application of the flux limiter includes two steps: (1) formulation of the biogeochemical processes with a matrix of stoichiometric coefficients and (2) application of Liebig's law of the minimum using the dynamic stoichiometric relationship of the reactants. This approach contrasts with the ad hoc down-regulationmore » approaches that are implemented in many existing models (such as CLM4.5 and the ACME (Accelerated Climate Modeling for Energy) Land Model (ALM)) of carbon and nutrient interactions, which are error prone when adding new processes, even for experienced modelers. Through an example implementation with a CENTURY-like decomposition model that includes carbon, nitrogen, and phosphorus, we show that our approach (1) produced almost identical results to that from the ad hoc down-regulation approaches under non-limiting nutrient conditions, (2) properly resolved the negative solutions under substrate-limited conditions where the simple clipping approach failed, (3) successfully avoided the potential conceptual ambiguities that are implied by those ad hoc down-regulation approaches. We expect our approach will make future biogeochemical models easier to improve and more robust.« less

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

PubMed

Banani, Sam; Gordon, Steven; Thiemjarus, Surapa; Kittipiyakul, Somsak

2018-04-13

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

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

PubMed

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.

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

PubMed Central

Singh, Kishor

2017-01-01

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

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

PubMed Central

Banani, Sam; Thiemjarus, Surapa; Kittipiyakul, Somsak

2018-01-01

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

Quality of service routing in wireless ad hoc networks

NASA Astrophysics Data System (ADS)

Sane, Sachin J.; Patcha, Animesh; Mishra, Amitabh

2003-08-01

An efficient routing protocol is essential to guarantee application level quality of service running on wireless ad hoc networks. In this paper we propose a novel routing algorithm that computes a path between a source and a destination by considering several important constraints such as path-life, availability of sufficient energy as well as buffer space in each of the nodes on the path between the source and destination. The algorithm chooses the best path from among the multiples paths that it computes between two endpoints. We consider the use of control packets that run at a priority higher than the data packets in determining the multiple paths. The paper also examines the impact of different schedulers such as weighted fair queuing, and weighted random early detection among others in preserving the QoS level guarantees. Our extensive simulation results indicate that the algorithm improves the overall lifetime of a network, reduces the number of dropped packets, and decreases the end-to-end delay for real-time voice application.

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

PubMed

Gokulakrishnan, P; Ganeshkumar, P

2015-01-01

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

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

PubMed Central

P, Gokulakrishnan; P, Ganeshkumar

2015-01-01

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

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

NASA Astrophysics Data System (ADS)

Iliescu, D.

2017-08-01

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

Self-Configuration and Localization in Ad Hoc Wireless Sensor Networks

DTIC Science & Technology

2010-08-31

Goddard I. SUMMARY OF CONTRIBUTIONS We explored the error mechanisms of iterative decoding of low-density parity-check ( LDPC ) codes . This work has resulted...important problems in the area of channel coding , as their unpredictable behavior has impeded the deployment of LDPC codes in many real-world applications. We...tree-based decoders of LDPC codes , including the extrinsic tree decoder, and an investigation into their performance and bounding capabilities [5], [6

The U.S culture collection network lays the foundation for progress in preservation of valuable microbial resources

Treesearch

K. McCluskey; A. Alvarez; R. Bennett; D. Bokati; K. Boundy-Mills; D. D. Brown; C. T. Bull; M. Coffey; T. Dreaden; C. Duke; G. Dye; E. Ehmke; K. Eversole; K. Fenstermacher; D. Geiser; Jessie A. Glaeser; S. Greene; L. Gribble; M. P. Griffith; K. Hanser; R. Humber; B. W. Johnson; A. Kermode; M. Krichevsky; M. Laudon; J. Leach; J. Leslie; M. May; U. Melcher; D. Nobles; N. R. Fonseca; S. Robinson; M. Ryan; J. Scott; C. Silflow; A. Vidaver; K. M. Webb; J. E. Wertz; S. Yentsch; S. Zehr

2016-01-01

The U.S. Culture Collection Network was formed in 2012 by a group of culture collection scientists and stakeholders in order to continue the progress established previously through efforts of an ad hoc group. The network is supported by a Research Coordination Network grant from the U.S. National Science Foundation (NSF) and has the goals of promoting interaction among...

Global Coverage from Ad-Hoc Constellations in Rideshare Orbits

NASA Technical Reports Server (NTRS)

Ellis, Armin; Mercury, Michael; Brown, Shannon

2012-01-01

A promising area of small satellite development is in providing higher temporal resolution than larger satellites. Traditional constellations have required specific orbits and dedicated launch vehicles. In this paper we discuss an alternative architecture in which the individual elements of the constellation are launched as rideshare opportunities. We compare the coverage of such an ad-hoc constellation with more traditional constellations. Coverage analysis is based on actual historical data from rideshare opportunities. Our analysis includes ground coverage and temporal revisits for Polar, Tropics, Temperate, and Global regions, comparing ad-hoc and Walker constellation.

Synthesizing Existing CSMA and TDMA Based MAC Protocols for VANETs

PubMed Central

Huang, Jiawei; Li, Qi; Zhong, Shaohua; Liu, Lianhai; Zhong, Ping; Wang, Jianxin; Ye, Jin

2017-01-01

Many Carrier Sense Multiple Access (CSMA) and Time Division Multiple Access (TDMA) based medium access control (MAC) protocols for vehicular ad hoc networks (VANETs) have been proposed recently. Contrary to the common perception that they are competitors, we argue that the underlying strategies used in these MAC protocols are complementary. Based on this insight, we design CTMAC, a MAC protocol that synthesizes existing strategies; namely, random accessing channel (used in CSMA-style protocols) and arbitral reserving channel (used in TDMA-based protocols). CTMAC swiftly changes its strategy according to the vehicle density, and its performance is better than the state-of-the-art protocols. We evaluate CTMAC using at-scale simulations. Our results show that CTMAC reduces the channel completion time and increases the network goodput by 45% for a wide range of application workloads and network settings. PMID:28208590

Flexible quality of service model for wireless body area sensor networks.

PubMed

Liao, Yangzhe; Leeson, Mark S; Higgins, Matthew D

2016-03-01

Wireless body area sensor networks (WBASNs) are becoming an increasingly significant breakthrough technology for smart healthcare systems, enabling improved clinical decision-making in daily medical care. Recently, radio frequency ultra-wideband technology has developed substantially for physiological signal monitoring due to its advantages such as low-power consumption, high transmission data rate, and miniature antenna size. Applications of future ubiquitous healthcare systems offer the prospect of collecting human vital signs, early detection of abnormal medical conditions, real-time healthcare data transmission and remote telemedicine support. However, due to the technical constraints of sensor batteries, the supply of power is a major bottleneck for healthcare system design. Moreover, medium access control (MAC) needs to support reliable transmission links that allow sensors to transmit data safely and stably. In this Letter, the authors provide a flexible quality of service model for ad hoc networks that can support fast data transmission, adaptive schedule MAC control, and energy efficient ubiquitous WBASN networks. Results show that the proposed multi-hop communication ad hoc network model can balance information packet collisions and power consumption. Additionally, wireless communications link in WBASNs can effectively overcome multi-user interference and offer high transmission data rates for healthcare systems.

RoCoMAR: robots' controllable mobility aided routing and relay architecture for mobile sensor networks.

PubMed

Le, Duc Van; Oh, Hoon; Yoon, Seokhoon

2013-07-05

In a practical deployment, mobile sensor network (MSN) suffers from a low performance due to high node mobility, time-varying wireless channel properties, and obstacles between communicating nodes. In order to tackle the problem of low network performance and provide a desired end-to-end data transfer quality, in this paper we propose a novel ad hoc routing and relaying architecture, namely RoCoMAR (Robots' Controllable Mobility Aided Routing) that uses robotic nodes' controllable mobility. RoCoMAR repeatedly performs link reinforcement process with the objective of maximizing the network throughput, in which the link with the lowest quality on the path is identified and replaced with high quality links by placing a robotic node as a relay at an optimal position. The robotic node resigns as a relay if the objective is achieved or no more gain can be obtained with a new relay. Once placed as a relay, the robotic node performs adaptive link maintenance by adjusting its position according to the movements of regular nodes. The simulation results show that RoCoMAR outperforms existing ad hoc routing protocols for MSN in terms of network throughput and end-to-end delay.

RoCoMAR: Robots' Controllable Mobility Aided Routing and Relay Architecture for Mobile Sensor Networks

PubMed Central

Van Le, Duc; Oh, Hoon; Yoon, Seokhoon

2013-01-01

In a practical deployment, mobile sensor network (MSN) suffers from a low performance due to high node mobility, time-varying wireless channel properties, and obstacles between communicating nodes. In order to tackle the problem of low network performance and provide a desired end-to-end data transfer quality, in this paper we propose a novel ad hoc routing and relaying architecture, namely RoCoMAR (Robots' Controllable Mobility Aided Routing) that uses robotic nodes' controllable mobility. RoCoMAR repeatedly performs link reinforcement process with the objective of maximizing the network throughput, in which the link with the lowest quality on the path is identified and replaced with high quality links by placing a robotic node as a relay at an optimal position. The robotic node resigns as a relay if the objective is achieved or no more gain can be obtained with a new relay. Once placed as a relay, the robotic node performs adaptive link maintenance by adjusting its position according to the movements of regular nodes. The simulation results show that RoCoMAR outperforms existing ad hoc routing protocols for MSN in terms of network throughput and end-to-end delay. PMID:23881134

Cross-Layer Scheme to Control Contention Window for Per-Flow in Asymmetric Multi-Hop Networks

NASA Astrophysics Data System (ADS)

Giang, Pham Thanh; Nakagawa, Kenji

The IEEE 802.11 MAC standard for wireless ad hoc networks adopts Binary Exponential Back-off (BEB) mechanism to resolve bandwidth contention between stations. BEB mechanism controls the bandwidth allocation for each station by choosing a back-off value from one to CW according to the uniform random distribution, where CW is the contention window size. However, in asymmetric multi-hop networks, some stations are disadvantaged in opportunity of access to the shared channel and may suffer severe throughput degradation when the traffic load is large. Then, the network performance is degraded in terms of throughput and fairness. In this paper, we propose a new cross-layer scheme aiming to solve the per-flow unfairness problem and achieve good throughput performance in IEEE 802.11 multi-hop ad hoc networks. Our cross-layer scheme collects useful information from the physical, MAC and link layers of own station. This information is used to determine the optimal Contention Window (CW) size for per-station fairness. We also use this information to adjust CW size for each flow in the station in order to achieve per-flow fairness. Performance of our cross-layer scheme is examined on various asymmetric multi-hop network topologies by using Network Simulator (NS-2).

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

PubMed Central

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

2017-01-01

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

Modeling and dynamical topology properties of VANET based on complex networks theory

NASA Astrophysics Data System (ADS)

Zhang, Hong; Li, Jie

2015-01-01

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What's more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.

Modeling and dynamical topology properties of VANET based on complex networks theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Hong; Li, Jie, E-mail: prof.li@foxmail.com

2015-01-15

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate andmore » control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.« less

Ad hoc vs. Non-ad hoc Percutaneous Coronary Intervention Strategies in Patients With Stable Coronary Artery Disease.

PubMed

Toyota, Toshiaki; Morimoto, Takeshi; Shiomi, Hiroki; Ando, Kenji; Ono, Koh; Shizuta, Satoshi; Kato, Takao; Saito, Naritatsu; Furukawa, Yutaka; Nakagawa, Yoshihisa; Horie, Minoru; Kimura, Takeshi

2017-03-24

Few studies have evaluated the prevalence and clinical outcomes of ad hoc percutaneous coronary intervention (PCI), performing diagnostic coronary angiography and PCI in the same session, in stable coronary artery disease (CAD) patients.Methods and Results:From the CREDO-Kyoto PCI/CABG registry cohort-2, 6,943 patients were analyzed as having stable CAD and undergoing first PCI. Ad hoc PCI and non-ad hoc PCI were performed in 1,722 (24.8%) and 5,221 (75.1%) patients, respectively. The cumulative 5-year incidence and adjusted risk for all-cause death were not significantly different between the 2 groups (15% vs. 15%, P=0.53; hazard ratio: 1.15, 95% confidence interval: 0.98-1.35, P=0.08). Ad hoc PCI relative to non-ad hoc PCI was associated with neutral risk for myocardial infarction, any coronary revascularization, and bleeding, but was associated with a trend towards lower risk for stroke (hazard ratio: 0.78, 95% confidence interval: 0.60-1.02, P=0.06). Ad hoc PCI in stable CAD patients was associated with at least comparable 5-year clinical outcomes as with non-ad hoc PCI. Considering patients' preference and the cost-saving, the ad hoc PCI strategy might be a safe and attractive option for patients with stable CAD, although the prevalence of ad hoc PCI was low in the current study population.

Research on a Queue Scheduling Algorithm in Wireless Communications Network

NASA Astrophysics Data System (ADS)

Yang, Wenchuan; Hu, Yuanmei; Zhou, Qiancai

This paper proposes a protocol QS-CT, Queue Scheduling Mechanism based on Multiple Access in Ad hoc net work, which adds queue scheduling mechanism to RTS-CTS-DATA using multiple access protocol. By endowing different queues different scheduling mechanisms, it makes networks access to the channel much more fairly and effectively, and greatly enhances the performance. In order to observe the final performance of the network with QS-CT protocol, we simulate it and compare it with MACA/C-T without QS-CT protocol. Contrast to MACA/C-T, the simulation result shows that QS-CT has greatly improved the throughput, delay, rate of packets' loss and other key indicators.

Cognitive Radio Networks for Tactical Wireless Communications

DTIC Science & Technology

2014-12-01

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

Developing A Web-based User Interface for Semantic Information Retrieval

NASA Technical Reports Server (NTRS)

Berrios, Daniel C.; Keller, Richard M.

2003-01-01

While there are now a number of languages and frameworks that enable computer-based systems to search stored data semantically, the optimal design for effective user interfaces for such systems is still uncle ar. Such interfaces should mask unnecessary query detail from users, yet still allow them to build queries of arbitrary complexity without significant restrictions. We developed a user interface supporting s emantic query generation for Semanticorganizer, a tool used by scient ists and engineers at NASA to construct networks of knowledge and dat a. Through this interface users can select node types, node attribute s and node links to build ad-hoc semantic queries for searching the S emanticOrganizer network.

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

NASA Astrophysics Data System (ADS)

Peng, Chaorong; Chen, Chang Wen

2008-04-01

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

A Context-Aware Paradigm for Information Discovery and Dissemination in Mobile Environments

ERIC Educational Resources Information Center

Lundquist, Doug

2011-01-01

The increasing power and ubiquity of mobile wireless devices is enabling real-time information delivery for many diverse applications. A crucial question is how to allocate finite network resources efficiently and fairly despite the uncertainty common in highly dynamic mobile ad hoc networks. We propose a set of routing protocols, Self-Balancing…

Learners' Attitudes toward Foreign Language Practice on Social Network Sites

ERIC Educational Resources Information Center

Villafuerte, Jhonny; Romero, Asier

2017-01-01

This work aims to study learners' attitudes towards practicing English Language on Social Networks Sites (SNS). The sample involved 110 students from the University Laica Eloy Alfaro de Manabi in Ecuador, and the University of the Basque Country in Spain. The instrument applied was a Likert scale questionnaire designed Ad hoc by the researchers,…

World Without Wires: Is Your District Ready to Go Wireless?

ERIC Educational Resources Information Center

Villano, Matt

2005-01-01

In this article, the author presents the latest wireless equipments available in market. For starters, wireless networks offer mobility and flexibility: users of laptops, PDAs, tablet PCs, and wireless Voice over IP telephones can move freely about campus while staying connected to the Internet. There are two kinds of wireless networks: ad-hoc, or…

An Analysis of the Feasibility and Applicability of IEEE 802.x Wireless Mesh Networks within the Global Information Grid

DTIC Science & Technology

2004-09-01

MESH VS . SIMPLE AD HOC AND MANET..............................................5 B. DESIRABLE CHARACTERISTICS OF WIRELESS MESH NETWORKS...Comparison of Mesh (top) vs . Traditional Wireless (bottom) .............26 Figure 7. UML Model of SensorML Components (From SenorML Models Paper) ......30...50 Figure 17. Latency Difference Example – OLSR vs . AODV

Computer Networking in Japanese Education Today. AVE in Japan No. 27.

ERIC Educational Resources Information Center

Japan Audio-Visual Education Association, Tokyo.

The Ad Hoc Council on Educational Reform pointed out in 1987 that Japanese education must prepare for the ever-increasing information needs of the future, and in 1988, a proposal for the development of information networks was published by the Ministry of Education, Science, and Culture. This proposal recommended the utilization of a wide range of…

Ad hoc categories and false memories: Memory illusions for categories created on-the-spot.

PubMed

Soro, Jerônimo C; Ferreira, Mário B; Semin, Gün R; Mata, André; Carneiro, Paula

2017-11-01

Three experiments were designed to test whether experimentally created ad hoc associative networks evoke false memories. We used the DRM (Deese, Roediger, McDermott) paradigm with lists of ad hoc categories composed of exemplars aggregated toward specific goals (e.g., going for a picnic) that do not share any consistent set of features. Experiment 1 revealed considerable levels of false recognitions of critical words from ad hoc categories. False recognitions occurred even when the lists were presented without an organizing theme (i.e., the category's label). Experiments 1 and 2 tested whether (a) the ease of identifying the categories' themes, and (b) the lists' backward associative strength could be driving the effect. List identifiability did not correlate with false recognition, and the effect remained even when backward associative strength was controlled for. Experiment 3 manipulated the distractor items in the recognition task to address the hypothesis that the salience of unrelated items could be facilitating the occurrence of the phenomenon. The effect remained when controlling for this source of facilitation. These results have implications for assumptions made by theories of false memories, namely the preexistence of associations in the activation-monitoring framework and the central role of gist extraction in fuzzy-trace theory, while providing evidence of the occurrence of false memories for more dynamic and context-dependent knowledge structures. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Performance evaluation of reactive and proactive routing protocol in IEEE 802.11 ad hoc network

NASA Astrophysics Data System (ADS)

Hamma, Salima; Cizeron, Eddy; Issaka, Hafiz; Guédon, Jean-Pierre

2006-10-01

Wireless technology based on the IEEE 802.11 standard is widely deployed. This technology is used to support multiple types of communication services (data, voice, image) with different QoS requirements. MANET (Mobile Adhoc NETwork) does not require a fixed infrastructure. Mobile nodes communicate through multihop paths. The wireless communication medium has variable and unpredictable characteristics. Furthermore, node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or Link State algorithms which insure that the route to every host is always known. However, this approach must take into account the adhoc networks specific characteristics: dynamic topologies, limited bandwidth, energy constraints, limited physical security, ... Two main routing protocols categories are studied in this paper: proactive protocols (e.g. Optimised Link State Routing - OLSR) and reactive protocols (e.g. Ad hoc On Demand Distance Vector - AODV, Dynamic Source Routing - DSR). The proactive protocols are based on periodic exchanges that update the routing tables to all possible destinations, even if no traffic goes through. The reactive protocols are based on on-demand route discoveries that update routing tables only for the destination that has traffic going through. The present paper focuses on study and performance evaluation of these categories using NS2 simulations. We have considered qualitative and quantitative criteria. The first one concerns distributed operation, loop-freedom, security, sleep period operation. The second are used to assess performance of different routing protocols presented in this paper. We can list end-to-end data delay, jitter, packet delivery ratio, routing load, activity distribution. Comparative study will be presented with number of networking context consideration and the results show the appropriate routing protocol for two kinds of communication services (data and voice).

Cluster Based Location-Aided Routing Protocol for Large Scale Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Wang, Yi; Dong, Liang; Liang, Taotao; Yang, Xinyu; Zhang, Deyun

Routing algorithms with low overhead, stable link and independence of the total number of nodes in the network are essential for the design and operation of the large-scale wireless mobile ad hoc networks (MANET). In this paper, we develop and analyze the Cluster Based Location-Aided Routing Protocol for MANET (C-LAR), a scalable and effective routing algorithm for MANET. C-LAR runs on top of an adaptive cluster cover of the MANET, which can be created and maintained using, for instance, the weight-based distributed algorithm. This algorithm takes into consideration the node degree, mobility, relative distance, battery power and link stability of mobile nodes. The hierarchical structure stabilizes the end-to-end communication paths and improves the networks' scalability such that the routing overhead does not become tremendous in large scale MANET. The clusterheads form a connected virtual backbone in the network, determine the network's topology and stability, and provide an efficient approach to minimizing the flooding traffic during route discovery and speeding up this process as well. Furthermore, it is fascinating and important to investigate how to control the total number of nodes participating in a routing establishment process so as to improve the network layer performance of MANET. C-LAR is to use geographical location information provided by Global Position System to assist routing. The location information of destination node is used to predict a smaller rectangle, isosceles triangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region in which the destination may be located. Thus, instead of searching the route in the entire network blindly, C-LAR confines the route searching space into a much smaller estimated range. Simulation results have shown that C-LAR outperforms other protocols significantly in route set up time, routing overhead, mean delay and packet collision, and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.

Integrated Social and QoS Trust-Based Routing in Mobile Ad Hoc Delay Tolerant Networks

DTIC Science & Technology

2010-11-15

d-connectivity, honesty, or unselfishness) with: encounter*,. , A ^// m = / (3) {•p ounter,x r. , . .-, ( Ti x m (t), ifm =j ^indirect. X, T...take into account node »’ s belief in node m in the calculation ofT(jreet’ x(t + At). This models the decay of trust as trust is derived from a distant...directly based on node /’ s past experiences with node m up to time t + At, including the current encounter. Taking the fact that /? a + /?2 = 1, we obtain

Documentation Driven Software Development

DTIC Science & Technology

2010-06-01

Applications, Vol. 13, No. 1, March, 2006, pp. 28-38. 3. G. Jacoby, R. Marchany, Davis IV, “Using Battery Constraints Within Mobile Hosts To Improve Network ...2005. 2. Luqi, V. Berzins, William Roof, “Nautical Predictive Routing Protocol (NPRP) for the Dynamic Ad-Hoc Nautical Network (DANN)”, Monterey...Workshop 2005: realization of reliable systems on top of unreliable networked platforms, Laguna Beach, California, September, 2005. 3. B. Lewis, “The

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

DTIC Science & Technology

2011-01-01

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

Understanding resilience in industrial symbiosis networks: insights from network analysis.

PubMed

Chopra, Shauhrat S; Khanna, Vikas

2014-08-01

Industrial symbiotic networks are based on the principles of ecological systems where waste equals food, to develop synergistic networks. For example, industrial symbiosis (IS) at Kalundborg, Denmark, creates an exchange network of waste, water, and energy among companies based on contractual dependency. Since most of the industrial symbiotic networks are based on ad-hoc opportunities rather than strategic planning, gaining insight into disruptive scenarios is pivotal for understanding the balance of resilience and sustainability and developing heuristics for designing resilient IS networks. The present work focuses on understanding resilience as an emergent property of an IS network via a network-based approach with application to the Kalundborg Industrial Symbiosis (KIS). Results from network metrics and simulated disruptive scenarios reveal Asnaes power plant as the most critical node in the system. We also observe a decrease in the vulnerability of nodes and reduction in single points of failure in the system, suggesting an increase in the overall resilience of the KIS system from 1960 to 2010. Based on our findings, we recommend design strategies, such as increasing diversity, redundancy, and multi-functionality to ensure flexibility and plasticity, to develop resilient and sustainable industrial symbiotic networks. Copyright © 2014 Elsevier Ltd. All rights reserved.

Routing Protocols to Minimize the Number of Route Disconnections for Communication in Mobile Ad Hoc Networks

DTIC Science & Technology

2009-09-01

Wireless Sensor Network (WSN) Simulator Research Personnel: Dr. Ali Abu-El Humos Task No. Task Current Status 1 Literature review and problem definition...networks.com/ [2] S. Dulman, P. Havinga, "A Simulation Template for Wireless Sensor Networks ," Supplement of the Sixth International Symposium on Autonomous... Sensor Network (WSN) Simulator 76 I Breakdown of the Research Activity to Tasks 76 II Description of the Tasks 76 Task 1 Literature Review and

Message Efficient Checkpointing and Rollback Recovery in Heterogeneous Mobile Networks

NASA Astrophysics Data System (ADS)

Jaggi, Parmeet Kaur; Singh, Awadhesh Kumar

2016-06-01

Heterogeneous networks provide an appealing way of expanding the computing capability of mobile networks by combining infrastructure-less mobile ad-hoc networks with the infrastructure-based cellular mobile networks. The nodes in such a network range from low-power nodes to macro base stations and thus, vary greatly in their capabilities such as computation power and battery power. The nodes are susceptible to different types of transient and permanent failures and therefore, the algorithms designed for such networks need to be fault-tolerant. The article presents a checkpointing algorithm for the rollback recovery of mobile hosts in a heterogeneous mobile network. Checkpointing is a well established approach to provide fault tolerance in static and cellular mobile distributed systems. However, the use of checkpointing for fault tolerance in a heterogeneous environment remains to be explored. The proposed protocol is based on the results of zigzag paths and zigzag cycles by Netzer-Xu. Considering the heterogeneity prevalent in the network, an uncoordinated checkpointing technique is employed. Yet, useless checkpoints are avoided without causing a high message overhead.

Optimizing Airborne Networking Performance with Cross-Layer Design Approach

DTIC Science & Technology

2009-06-01

Schiavone , L.J.; “Airborne Networking –Approaches and Challenges,” Military Communications Conference IEEE, Oct 31 – Nov 3, 2004, Vol. 1, pp. 404...www.ccny.cuny.edu/cint/ [5] John Seguí and Esther Jennings,’’ Delay Tolerant Networking – Bundle Protocol Simulation’’ [6] DTNRG website...throughput route selection in multi-rate ad hoc wireless networks,” Technical report, Johns Hopkins CS Dept, March 2003. v 2. [15] R. Draves, J

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

DTIC Science & Technology

2014-10-01

MMD), minimizes the maximum dis- tortion among all nodes of the network, promoting a rather unbiased treatment of the nodes. We employed the Particle...achieve the ideal tradeoff between the transmitted video quality and energy consumption. Each sensor node has a bit rate that can be used for both...Distortion (MMD), minimizes the maximum distortion among all nodes of the network, promoting a rather unbiased treatment of the nodes. For both criteria

Mitigating TCP Degradation over Intermittent Link Failures using Intermediate Buffers

DTIC Science & Technology

2006-06-01

signal strength [10]. The Preemptive routing in ad hoc networks [10] attempts to predict that a route will fail by looking at the signal power of the...when the error rate is high there are non -optimal back offs in the Retransmission Timeout. And third, in the high error situation the slow start...network storage follows. In Beck et. al. [3], Logistical Networking is outlined as a means of storing data throughout the network. End to end

Enhancing the Selection of Backoff Interval Using Fuzzy Logic over Wireless Ad Hoc Networks

PubMed Central

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

LinkMind: link optimization in swarming mobile sensor networks.

PubMed

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

PubMed Central

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation. PMID:22164070

Risk assessment, identification, and notification (RAIN) system : a novel approach for traffic management.

DOT National Transportation Integrated Search

2009-08-31

Primary research focused on the design and development of an energy-efficient Risk Notification Message Dissemination Protocol (RNMDP) for vehicular ad hoc networks (VANETs). RNMDP propagates Risk Notification Messages (RNMs) from a location of origi...

A Cross-Layer Approach to Multi-Hop Networking with Cognitive Radios

DTIC Science & Technology

2008-11-01

recent investigations. In [2], Behzad and Rubin studied the special case that the same power level are used at each node and found that the maximum...Sep. 2, 2005. [2] A. Behzad and I. Rubin, “Impact of power control on the performance of ad hoc wireless networks,” in Proc. IEEE Infocom, pp. 102–113

Mobile Support For Logistics

DTIC Science & Technology

2016-03-01

Infrastructure to Support Mobile Devices (Takai, 2012, p. 2). The objectives needed in order to meet this goal are to: evolve spectrum management, expand... infrastructure to support wireless capabilities, and establish a mobile device security architecture (Takai, 2012, p. 2). By expanding infrastructure to...often used on Mobile Ad-Hoc Networks (MANETs). MANETS are infrastructure -less networks that include, but are not limited to, mobile devices. These

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

ERIC Educational Resources Information Center

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…

A survey on investigating the need for intelligent power-aware load balanced routing protocols for handling critical links in MANETs.

PubMed

Sivakumar, B; Bhalaji, N; Sivakumar, D

2014-01-01

In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing.

A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs

PubMed Central

Sivakumar, B.; Bhalaji, N.; Sivakumar, D.

2014-01-01

In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing. PMID:24790546

A Comparison of Alternative Distributed Dynamic Cluster Formation Techniques for Industrial Wireless Sensor Networks.

PubMed

Gholami, Mohammad; Brennan, Robert W

2016-01-06

In this paper, we investigate alternative distributed clustering techniques for wireless sensor node tracking in an industrial environment. The research builds on extant work on wireless sensor node clustering by reporting on: (1) the development of a novel distributed management approach for tracking mobile nodes in an industrial wireless sensor network; and (2) an objective comparison of alternative cluster management approaches for wireless sensor networks. To perform this comparison, we focus on two main clustering approaches proposed in the literature: pre-defined clusters and ad hoc clusters. These approaches are compared in the context of their reconfigurability: more specifically, we investigate the trade-off between the cost and the effectiveness of competing strategies aimed at adapting to changes in the sensing environment. To support this work, we introduce three new metrics: a cost/efficiency measure, a performance measure, and a resource consumption measure. The results of our experiments show that ad hoc clusters adapt more readily to changes in the sensing environment, but this higher level of adaptability is at the cost of overall efficiency.

A Comparison of Alternative Distributed Dynamic Cluster Formation Techniques for Industrial Wireless Sensor Networks

PubMed Central

Gholami, Mohammad; Brennan, Robert W.

2016-01-01

In this paper, we investigate alternative distributed clustering techniques for wireless sensor node tracking in an industrial environment. The research builds on extant work on wireless sensor node clustering by reporting on: (1) the development of a novel distributed management approach for tracking mobile nodes in an industrial wireless sensor network; and (2) an objective comparison of alternative cluster management approaches for wireless sensor networks. To perform this comparison, we focus on two main clustering approaches proposed in the literature: pre-defined clusters and ad hoc clusters. These approaches are compared in the context of their reconfigurability: more specifically, we investigate the trade-off between the cost and the effectiveness of competing strategies aimed at adapting to changes in the sensing environment. To support this work, we introduce three new metrics: a cost/efficiency measure, a performance measure, and a resource consumption measure. The results of our experiments show that ad hoc clusters adapt more readily to changes in the sensing environment, but this higher level of adaptability is at the cost of overall efficiency. PMID:26751447

Control Based Mobile Ad Hoc Networking for Survivable, Dynamic, Mobile Special Operation Force Communications

DTIC Science & Technology

2009-09-01

The second phase started in March 2008 and ended in July 2009 [40]. By the time this paper is complete, the contractor will be working on final steps... cinematic images we see on our televisions or movie theater screens. Sure, some of it is just as, if not more, thrilling than what we all have come to...ITMANET): Mission.‖ [Online]. Available: http://www.darpa.mil/ipto/programs/itmanet/itmanet.asp. [Accessed: March 5, 2009]. [8] ―ITMANET Solicitation

A Fresh Look at Internet Protocol Version 6 (IPv6) for Department of Defense (DoD) Networks

DTIC Science & Technology

2010-08-01

since system administration practices (such as the use of security appliances) depend heavily on tools for network management, diagnosis and protection...are mobile ad hoc networks (MANETs) and yet there is limited practical experience with MANETs and their performance. Further, the interaction between...Systems FCS Future Combat System IETF Internet Engineering Task Force ISAT Information Science and Technology BAST Board on Army Science and

On-the-field performance of quintuple-play long-reach OFDM-based WDM-PON optical access networks.

PubMed

Llorente, Roberto; Morant, Maria; Pellicer, Eloy; Herman, Milan; Nagy, Zsolt; Alves, Tiago; Cartaxo, Adolfo; Herrera, Javier; Correcher, Jose; Quinlan, Terence; Walker, Stuart; Rodrigues, Cláudio; Cluzeaud, Pierre; Schmidt, Axel; Piesiewicz, Radoslaw; Sambaraju, Rakesh

2014-03-24

In this paper the on-the-field performance of a WDM-PON optical access providing quintuple-play services using orthogonal frequency division multiplexing (OFDM) modulation is evaluated in a real fiber-to-the-home (FTTH) network deployed by Towercom operator in Bratislava (Slovakia). A bundle of quintuple-play services comprising full-standard OFDM-based signals (LTE, WiMAX, UWB and DVB-T) and an ad-hoc OFDM-GbE signal is transmitted in coexistence per single user. Both downstream and upstream transmission performances are evaluated in different on-the-field long-reach optical link distance configurations. Four wavelength multi-user transmission of quintuple-play OFDM services is demonstrated exceeding 60.8 km reach in standard single mode fiber.

Airborne Network Data Availability Using Peer to Peer Database Replication on a Distributed Hash Table

DTIC Science & Technology

2013-03-01

DSR Dynamic Source Routing DSSS Direct -sequence spread spectrum GUID Globally Unique ID MANET Mobile Ad-hoc Network NS3 Network Simulator 3 OLSR...networking schemes for safe maneuvering and data communication. Imagine needing to maintain an operational picture of an overall environment using a...as simple as O(n) where every node is sequentially queried to O log(n), or O(1). These schemes will be discussed with each individual DHT. Four of the

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

NASA Astrophysics Data System (ADS)

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.

Spatial Characterization of Radio Propagation Channel in Urban Vehicle-to-Infrastructure Environments to Support WSNs Deployment

PubMed Central

Granda, Fausto; Azpilicueta, Leyre; Vargas-Rosales, Cesar; Lopez-Iturri, Peio; Aguirre, Erik; Astrain, Jose Javier; Villandangos, Jesus; Falcone, Francisco

2017-01-01

Vehicular ad hoc Networks (VANETs) enable vehicles to communicate with each other as well as with roadside units (RSUs). Although there is a significant research effort in radio channel modeling focused on vehicle-to-vehicle (V2V), not much work has been done for vehicle-to-infrastructure (V2I) using 3D ray-tracing tools. This work evaluates some important parameters of a V2I wireless channel link such as large-scale path loss and multipath metrics in a typical urban scenario using a deterministic simulation model based on an in-house 3D Ray-Launching (3D-RL) algorithm at 5.9 GHz. Results show the high impact that the spatial distance; link frequency; placement of RSUs; and factors such as roundabout, geometry and relative position of the obstacles have in V2I propagation channel. A detailed spatial path loss characterization of the V2I channel along the streets and avenues is presented. The 3D-RL results show high accuracy when compared with measurements, and represent more reliably the propagation phenomena when compared with analytical path loss models. Performance metrics for a real test scenario implemented with a VANET wireless sensor network implemented ad-hoc are also described. These results constitute a starting point in the design phase of Wireless Sensor Networks (WSNs) radio-planning in the urban V2I deployment in terms of coverage. PMID:28590429

Spatial Characterization of Radio Propagation Channel in Urban Vehicle-to-Infrastructure Environments to Support WSNs Deployment.

PubMed

Granda, Fausto; Azpilicueta, Leyre; Vargas-Rosales, Cesar; Lopez-Iturri, Peio; Aguirre, Erik; Astrain, Jose Javier; Villandangos, Jesus; Falcone, Francisco

2017-06-07

Vehicular ad hoc Networks (VANETs) enable vehicles to communicate with each other as well as with roadside units (RSUs). Although there is a significant research effort in radio channel modeling focused on vehicle-to-vehicle (V2V), not much work has been done for vehicle-to-infrastructure (V2I) using 3D ray-tracing tools. This work evaluates some important parameters of a V2I wireless channel link such as large-scale path loss and multipath metrics in a typical urban scenario using a deterministic simulation model based on an in-house 3D Ray-Launching (3D-RL) algorithm at 5.9 GHz. Results show the high impact that the spatial distance; link frequency; placement of RSUs; and factors such as roundabout, geometry and relative position of the obstacles have in V2I propagation channel. A detailed spatial path loss characterization of the V2I channel along the streets and avenues is presented. The 3D-RL results show high accuracy when compared with measurements, and represent more reliably the propagation phenomena when compared with analytical path loss models. Performance metrics for a real test scenario implemented with a VANET wireless sensor network implemented ad-hoc are also described. These results constitute a starting point in the design phase of Wireless Sensor Networks (WSNs) radio-planning in the urban V2I deployment in terms of coverage.

Distribution of Information in Ad Hoc Networks

DTIC Science & Technology

2007-09-01

2.4. MACA Protocol...................................20 Figure 2.5. Route discovery in AODV (From [32]).............28 Figure 2.6. Creation of a...19 Figure 2.3. Exposed terminal Problem (From [20]) (3) MACA and MACAW Protocols. One of the first protocols conceived for wireless local area...networks is MACA [21] (Multiple Accesses with Collision Avoidance). The transmitter sends a small packet, or RTS (Request To Send), which has little

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

PubMed

Kuscu, Murat; Akan, Ozgur B

2014-09-01

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

Vehicle infrastructure integration (VII) : exploring the application of disruptive technology to assist older drivers.

DOT National Transportation Integrated Search

2012-01-01

This report discusses the approach and findings of a research project aimed at the evaluation of : an inter-vehicle communications scheme for Vehicular Ad hoc Networks (VANETs). : Because of the size, frequency, and expected number of receivers of pe...

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

DTIC Science & Technology

2015-06-01

raspberry pi , robotic operation system (ros), arduino 15. NUMBER OF PAGES 123 16. PRICE CODE 17. SECURITY CLASSIFICATION OF REPORT...51  2.  Raspberry Pi ...52  Figure 21.  The Raspberry Pi B+ model, from [24

Trust Management and Accountability for Internet Security

ERIC Educational Resources Information Center

Liu, Wayne W.

2011-01-01

Adversarial yet interacting interdependent relationships in information sharing and service provisioning have been a pressing issue of the Internet. Such relationships exist among autonomous software agents, in networking system peers, as well as between "service users and providers." Traditional "ad hoc" security approaches effective in…

Self-configuration and self-optimization process in heterogeneous wireless networks.

PubMed

Guardalben, Lucas; Villalba, Luis Javier García; Buiati, Fábio; Sobral, João Bosco Mangueira; Camponogara, Eduardo

2011-01-01

Self-organization in Wireless Mesh Networks (WMN) is an emergent research area, which is becoming important due to the increasing number of nodes in a network. Consequently, the manual configuration of nodes is either impossible or highly costly. So it is desirable for the nodes to be able to configure themselves. In this paper, we propose an alternative architecture for self-organization of WMN based on Optimized Link State Routing Protocol (OLSR) and the ad hoc on demand distance vector (AODV) routing protocols as well as using the technology of software agents. We argue that the proposed self-optimization and self-configuration modules increase the throughput of network, reduces delay transmission and network load, decreases the traffic of HELLO messages according to network's scalability. By simulation analysis, we conclude that the self-optimization and self-configuration mechanisms can significantly improve the performance of OLSR and AODV protocols in comparison to the baseline protocols analyzed.

A Programmable SDN+NFV Architecture for UAV Telemetry Monitoring

NASA Technical Reports Server (NTRS)

White, Kyle J. S.; Pezaros, Dimitrios P.; Denney, Ewen; Knudson, Matt D.

2017-01-01

With the explosive growth in UAV numbers forecast worldwide, a core concern is how to manage the ad-hoc network configuration required for mobility management. As UAVs migrate among ground control stations, associated network services, routing and operational control must also rapidly migrate to ensure a seamless transition. In this paper, we present a novel, lightweight and modular architecture which supports high mobility, resilience and flexibility through the application of SDN and NFV principles on top of the UAV infrastructure. By combining SDN programmability and Network Function Virtualization we can achieve resilient infrastructure migration of network services, such as network monitoring and anomaly detection, coupled with migrating UAVs to enable high mobility management. Our container-based monitoring and anomaly detection Network Functions (NFs) can be tuned to specific UAV models providing operators better insight during live, high-mobility deployments. We evaluate our architecture against telemetry from over 80flights from a scientific research UAV infrastructure.

A multimetric, map-aware routing protocol for VANETs in urban areas.

PubMed

Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Aguilar Igartua, Mónica; Rebollo-Monedero, David; de la Cruz Llopis, Luis J; Mezher, Ahmad Mohamad; Aguilar-Calderón, José Alfonso

2014-01-28

In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery.

Connectivity Strength-Weighted Sparse Group Representation-Based Brain Network Construction for MCI Classification

PubMed Central

Yu, Renping; Zhang, Han; An, Le; Chen, Xiaobo; Wei, Zhihui; Shen, Dinggang

2017-01-01

Brain functional network analysis has shown great potential in understanding brain functions and also in identifying biomarkers for brain diseases, such as Alzheimer's disease (AD) and its early stage, mild cognitive impairment (MCI). In these applications, accurate construction of biologically meaningful brain network is critical. Sparse learning has been widely used for brain network construction; however, its l1-norm penalty simply penalizes each edge of a brain network equally, without considering the original connectivity strength which is one of the most important inherent linkwise characters. Besides, based on the similarity of the linkwise connectivity, brain network shows prominent group structure (i.e., a set of edges sharing similar attributes). In this article, we propose a novel brain functional network modeling framework with a “connectivity strength-weighted sparse group constraint.” In particular, the network modeling can be optimized by considering both raw connectivity strength and its group structure, without losing the merit of sparsity. Our proposed method is applied to MCI classification, a challenging task for early AD diagnosis. Experimental results based on the resting-state functional MRI, from 50 MCI patients and 49 healthy controls, show that our proposed method is more effective (i.e., achieving a significantly higher classification accuracy, 84.8%) than other competing methods (e.g., sparse representation, accuracy = 65.6%). Post hoc inspection of the informative features further shows more biologically meaningful brain functional connectivities obtained by our proposed method. PMID:28150897

Semantic encoding of relational databases in wireless networks

NASA Astrophysics Data System (ADS)

Benjamin, David P.; Walker, Adrian

2005-03-01

Semantic Encoding is a new, patented technology that greatly increases the speed of transmission of distributed databases over networks, especially over ad hoc wireless networks, while providing a novel method of data security. It reduces bandwidth consumption and storage requirements, while speeding up query processing, encryption and computation of digital signatures. We describe the application of Semantic Encoding in a wireless setting and provide an example of its operation in which a compression of 290:1 would be achieved.

Analytical Modeling of Medium Access Control Protocols in Wireless Networks

DTIC Science & Technology

2006-03-01

Rician-fading channels. However, no provision was made to consider a multihop ad hoc network and the interdependencies among the nodes. Gitman [54...published what is arguably the first paper that actually dealt with a mul- tihop system. Gitman considered a two-hop centralized network consisting of a...of MIMO space-time coded wireless systems. IEEE Journal on Selected Areas in Communications, 21(3):281–302, April 2003. [54] I. Gitman . On the

L2-LBMT: A Layered Load Balance Routing Protocol for underwater multimedia data transmission

NASA Astrophysics Data System (ADS)

Lv, Ze; Tang, Ruichun; Tao, Ye; Sun, Xin; Xu, Xiaowei

2017-12-01

Providing highly efficient underwater transmission of mass multimedia data is challenging due to the particularities of the underwater environment. Although there are many schemes proposed to optimize the underwater acoustic network communication protocols, from physical layer, data link layer, network layer to transport layer, the existing routing protocols for underwater wireless sensor network (UWSN) still cannot well deal with the problems in transmitting multimedia data because of the difficulties involved in high energy consumption, low transmission reliability or high transmission delay. It prevents us from applying underwater multimedia data to real-time monitoring of marine environment in practical application, especially in emergency search, rescue operation and military field. Therefore, the inefficient transmission of marine multimedia data has become a serious problem that needs to be solved urgently. In this paper, A Layered Load Balance Routing Protocol (L2-LBMT) is proposed for underwater multimedia data transmission. In L2-LBMT, we use layered and load-balance Ad Hoc Network to transmit data, and adopt segmented data reliable transfer (SDRT) protocol to improve the data transport reliability. And a 3-node variant of tornado (3-VT) code is also combined with the Ad Hoc Network to transmit little emergency data more quickly. The simulation results show that the proposed protocol can balance energy consumption of each node, effectively prolong the network lifetime and reduce transmission delay of marine multimedia data.

Cyanobacterial Biofuels: Strategies and Developments on Network and Modeling.

PubMed

Klanchui, Amornpan; Raethong, Nachon; Prommeenate, Peerada; Vongsangnak, Wanwipa; Meechai, Asawin

Cyanobacteria, the phototrophic microorganisms, have attracted much attention recently as a promising source for environmentally sustainable biofuels production. However, barriers for commercial markets of cyanobacteria-based biofuels concern the economic feasibility. Miscellaneous strategies for improving the production performance of cyanobacteria have thus been developed. Among these, the simple ad hoc strategies resulting in failure to optimize fully cell growth coupled with desired product yield are explored. With the advancement of genomics and systems biology, a new paradigm toward systems metabolic engineering has been recognized. In particular, a genome-scale metabolic network reconstruction and modeling is a crucial systems-based tool for whole-cell-wide investigation and prediction. In this review, the cyanobacterial genome-scale metabolic models, which offer a system-level understanding of cyanobacterial metabolism, are described. The main process of metabolic network reconstruction and modeling of cyanobacteria are summarized. Strategies and developments on genome-scale network and modeling through the systems metabolic engineering approach are advanced and employed for efficient cyanobacterial-based biofuels production.

An Ad-Hoc Adaptive Pilot Model for Pitch Axis Gross Acquisition Tasks

NASA Technical Reports Server (NTRS)

Hanson, Curtis E.

2012-01-01

An ad-hoc algorithm is presented for real-time adaptation of the well-known crossover pilot model and applied to pitch axis gross acquisition tasks in a generic fighter aircraft. Off-line tuning of the crossover model to human pilot data gathered in a fixed-based high fidelity simulation is first accomplished for a series of changes in aircraft dynamics to provide expected values for model parameters. It is shown that in most cases, for this application, the traditional crossover model can be reduced to a gain and a time delay. The ad-hoc adaptive pilot gain algorithm is shown to have desirable convergence properties for most types of changes in aircraft dynamics.

77 FR 28543 - Nationwide Health Information Network: Conditions for Trusted Exchange

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-15

... expansion, electronic exchange has been governed by a patchwork of contractual relationships, procurement.... Consequently, this ad-hoc governance approach has led to asymmetries in the policies and technical standards... This request for information (RFI) reflects ONC's current thinking regarding the approach ONC should...

Mission and Professionalism: What Teachers Can Do.

ERIC Educational Resources Information Center

Ause, John

1985-01-01

The growing teacher shortage and increasing bureaucratization of schools make it imperative that new means be developed to make teaching more attractive as a profession. Teacher organizations, professional newsletters, informal discussion groups, networking, ad hoc pressure groups, and alternative schools might provide some route to reform. (KH)

The use of Spanish language skills by physicians and nurses: policy implications for teaching and testing.

PubMed

Diamond, Lisa C; Tuot, Delphine S; Karliner, Leah S

2012-01-01

Language barriers present a substantial communication challenge in the hospital setting. To describe how clinicians with various levels of Spanish language proficiency work with interpreters or their own Spanish skills in common clinical scenarios. Survey of physicians and nurses who report ever speaking Spanish with patients on a general medicine hospital floor. Spanish proficiency rated on a 5-point scale, self-reported use of specific strategies (own Spanish skills, professional or ad-hoc interpreters) to overcome the language barrier. Sixty-eight physicians and 65 nurses participated. Physicians with low-level Spanish proficiency reported frequent use of ad-hoc interpreters for all information-based scenarios, except pre-rounding in the morning when most reported using their own Spanish skills. For difficult conversations and procedural consent, most used professional interpreters. Comparatively, physicians with medium proficiency reported higher rates of using their own Spanish skills for information-based scenarios, lower rates of professional interpreter use, and little use of ad-hoc interpreters. They rarely used their own Spanish skills or ad-hoc interpreters for difficult conversations. Physicians with high-level Spanish proficiency almost uniformly reported using their own Spanish skills. The majority (82%) of nurses had low-level Spanish proficiency, and frequently worked with professional interpreters for educating patients, but more often used ad hoc interpreters and their own Spanish skills for information-based scenarios, including medication administration. Physicians and nurses with limited Spanish proficiency use these skills, even in important clinical circumstances in the hospital. Health-care organizations should evaluate clinicians' non-English language proficiency and set policies about use of language skills in clinical care.

QoS-Oriented High Dynamic Resource Allocation in Vehicular Communication Networks

PubMed Central

2014-01-01

Vehicular ad hoc networks (VANETs) are emerging as new research area and attracting an increasing attention from both industry and research communities. In this context, a dynamic resource allocation policy that maximizes the use of available resources and meets the quality of service (QoS) requirement of constraining applications is proposed. It is a combination of a fair packet scheduling policy and a new adaptive QoS oriented call admission control (CAC) scheme based on the vehicle density variation. This scheme decides whether the connection request is to be admitted into the system, while providing fair access and guaranteeing the desired throughput. The proposed algorithm showed good performance in testing in real world environment. PMID:24616639

A bandwidth-efficient service for local information dissemination in sparse to dense roadways.

PubMed

Garcia-Lozano, Estrella; Campo, Celeste; Garcia-Rubio, Carlos; Cortes-Martin, Alberto; Rodriguez-Carrion, Alicia; Noriega-Vivas, Patricia

2013-07-05

Thanks to the research on Vehicular Ad Hoc Networks (VANETs), we will be able to deploy applications on roadways that will contribute to energy efficiency through a better planning of long trips. With this goal in mind, we have designed a gas/charging station advertising system, which takes advantage of the broadcast nature of the network. We have found that reducing the number of total sent packets is important, as it allows for a better use of the available bandwidth. We have designed improvements for a distance-based flooding scheme, so that it can support the advertising application with good results in sparse to dense roadway scenarios.

A Bandwidth-Efficient Service for Local Information Dissemination in Sparse to Dense Roadways

PubMed Central

Garcia-Lozano, Estrella; Campo, Celeste; Garcia-Rubio, Carlos; Cortes-Martin, Alberto; Rodriguez-Carrion, Alicia; Noriega-Vivas, Patricia

2013-01-01

Thanks to the research on Vehicular Ad Hoc Networks (VANETs), we will be able to deploy applications on roadways that will contribute to energy efficiency through a better planning of long trips. With this goal in mind, we have designed a gas/charging station advertising system, which takes advantage of the broadcast nature of the network. We have found that reducing the number of total sent packets is important, as it allows for a better use of the available bandwidth. We have designed improvements for a distance-based flooding scheme, so that it can support the advertising application with good results in sparse to dense roadway scenarios. PMID:23881130

Self-Configuration and Self-Optimization Process in Heterogeneous Wireless Networks

PubMed Central

Guardalben, Lucas; Villalba, Luis Javier García; Buiati, Fábio; Sobral, João Bosco Mangueira; Camponogara, Eduardo

2011-01-01

Self-organization in Wireless Mesh Networks (WMN) is an emergent research area, which is becoming important due to the increasing number of nodes in a network. Consequently, the manual configuration of nodes is either impossible or highly costly. So it is desirable for the nodes to be able to configure themselves. In this paper, we propose an alternative architecture for self-organization of WMN based on Optimized Link State Routing Protocol (OLSR) and the ad hoc on demand distance vector (AODV) routing protocols as well as using the technology of software agents. We argue that the proposed self-optimization and self-configuration modules increase the throughput of network, reduces delay transmission and network load, decreases the traffic of HELLO messages according to network’s scalability. By simulation analysis, we conclude that the self-optimization and self-configuration mechanisms can significantly improve the performance of OLSR and AODV protocols in comparison to the baseline protocols analyzed. PMID:22346584

Location Privacy Protection on Social Networks

NASA Astrophysics Data System (ADS)

Zhan, Justin; Fang, Xing

Location information is considered as private in many scenarios. Protecting location information on mobile ad-hoc networks has attracted much research in past years. However, location information protection on social networks has not been paid much attention. In this paper, we present a novel location privacy protection approach on the basis of user messages in social networks. Our approach grants flexibility to users by offering them multiple protecting options. To the best of our knowledge, this is the first attempt to protect social network users' location information via text messages. We propose five algorithms for location privacy protection on social networks.

Enabling Secure High-Performance Wireless Ad Hoc Networking

DTIC Science & Technology

2003-05-29

destinations, consuming energy and available bandwidth. An attacker may similarly create a routing black hole, in which all packets are dropped: by sending...of the vertex cut, for example by forwarding only routing packets and not data packets, such that the nodes waste energy forwarding packets to the...with limited resources, including network bandwidth and the CPU processing capacity, memory, and battery power ( energy ) of each individual node in the

High Throughput via Cross-Layer Interference Alignment for Mobile Ad Hoc Networks

DTIC Science & Technology

2013-08-26

MIMO zero-forcing receiver in the presence of channel estimation error,” IEEE Transactions on Wireless Communications , vol. 6 , no. 3, pp. 805–810, Mar...Robert W. Heath, Nachiappan Valliappan. Antenna Subset Modulation for Secure Millimeter-Wave Wireless Communication , IEEE Transactions on...in MIMO Interference Alignment Networks, IEEE Transactions on Wireless Communications , (02 2012): 0. doi: 10.1109/TWC.2011.120511.111088 TOTAL: 2

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

PubMed Central

Gokulakrishnan, P.

2015-01-01

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

Supporting the Maritime Information Dominance: Optimizing Tactical Network for Biometric Data Sharing in Maritime Interdiction Operations

DTIC Science & Technology

2015-03-01

information dominance in the maritime domain by optimizing tactical mobile ad hoc network (MANET) systems for wireless sharing of biometric data in maritime interdiction operations (MIO). Current methods for sharing biometric data in MIO are unnecessarily slow and do not leverage wireless networks at the tactical edge to maximize information dominance . Field experiments allow students to test wireless MANETs at the tactical edge. Analysis is focused on determining optimal MANET design and implementation. It considers various implementations with

Proactive schema based link lifetime estimation and connectivity ratio.

PubMed

Bachir, Bouamoud; Ali, Ouacha; Ahmed, Habbani; Mohamed, Elkoutbi

2014-01-01

The radio link between a pair of wireless nodes is affected by a set of random factors such as transmission range, node mobility, and environment conditions. The properties of such radio links are continually experienced when nodes status balances between being reachable and being unreachable; thereby on completion of each experience the statistical distribution of link lifetime is updated. This aspect is emphasized in mobile ad hoc network especially when it is deployed in some fields that require intelligent processing of data information such as aerospace domain.

Telecommunications: A Paradigm for the Future of Illinois Higher Education.

ERIC Educational Resources Information Center

Illinois Community Coll. Board, Springfield.

The Illinois Community College Board created the Telecommunications Ad Hoc Task Force (TAHTF) to examine the current status of telecommunications in the Illinois Community College System (ICCS), to determine the feasibility of establishing a statewide telecommunications network, and to recommend policies for the development and use of such a…

The Challenges of Internetworking Unattended Autonomous Sensors

DTIC Science & Technology

2006-12-01

number of nodes that can hear the broadcast by a squared factor. The establishment of path keys for multi-hop range extension should however be used...Conf. on Info. Sci. and Syst. (CISS 󈧅), Baltimore, 21-23 March 2001 [9] R . Ramanathan, “On the Performance of Ad Hoc Networks with Beamforming...Computing”, Prentice Hall PTR, 2002 [12] S. Slijepcevic, M. Potkonjak, V. Tsiatsis, S. Zimbeck, M.B. Srivastava “On Communication Security inWireless Ad

Graphical user interface for wireless sensor networks simulator

NASA Astrophysics Data System (ADS)

Paczesny, Tomasz; Paczesny, Daniel; Weremczuk, Jerzy

2008-01-01

Wireless Sensor Networks (WSN) are currently very popular area of development. It can be suited in many applications form military through environment monitoring, healthcare, home automation and others. Those networks, when working in dynamic, ad-hoc model, need effective protocols which must differ from common computer networks algorithms. Research on those protocols would be difficult without simulation tool, because real applications often use many nodes and tests on such a big networks take much effort and costs. The paper presents Graphical User Interface (GUI) for simulator which is dedicated for WSN studies, especially in routing and data link protocols evaluation.

Connectivity strength-weighted sparse group representation-based brain network construction for MCI classification.

PubMed

Yu, Renping; Zhang, Han; An, Le; Chen, Xiaobo; Wei, Zhihui; Shen, Dinggang

2017-05-01

Brain functional network analysis has shown great potential in understanding brain functions and also in identifying biomarkers for brain diseases, such as Alzheimer's disease (AD) and its early stage, mild cognitive impairment (MCI). In these applications, accurate construction of biologically meaningful brain network is critical. Sparse learning has been widely used for brain network construction; however, its l 1 -norm penalty simply penalizes each edge of a brain network equally, without considering the original connectivity strength which is one of the most important inherent linkwise characters. Besides, based on the similarity of the linkwise connectivity, brain network shows prominent group structure (i.e., a set of edges sharing similar attributes). In this article, we propose a novel brain functional network modeling framework with a "connectivity strength-weighted sparse group constraint." In particular, the network modeling can be optimized by considering both raw connectivity strength and its group structure, without losing the merit of sparsity. Our proposed method is applied to MCI classification, a challenging task for early AD diagnosis. Experimental results based on the resting-state functional MRI, from 50 MCI patients and 49 healthy controls, show that our proposed method is more effective (i.e., achieving a significantly higher classification accuracy, 84.8%) than other competing methods (e.g., sparse representation, accuracy = 65.6%). Post hoc inspection of the informative features further shows more biologically meaningful brain functional connectivities obtained by our proposed method. Hum Brain Mapp 38:2370-2383, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

NOW: A Workflow Language for Orchestration in Nomadic Networks

NASA Astrophysics Data System (ADS)

Philips, Eline; van der Straeten, Ragnhild; Jonckers, Viviane

Existing workflow languages for nomadic or mobile ad hoc networks do not offer adequate support for dealing with the volatile connections inherent to these environments. Services residing on mobile devices are exposed to (temporary) network failures, which should be considered the rule rather than the exception. This paper proposes a nomadic workflow language built on top of an ambient-oriented programming language which supports dynamic service discovery and communication primitives resilient to network failures. Our proposed language provides high level workflow abstractions for control flow and supports rich network and service failure detection and handling through compensating actions. Moreover, we introduce a powerful variable binding mechanism which enables dynamic data flow between services in a nomadic environment. By adding this extra layer of abstraction on top of an ambient-oriented programming language, the application programmer is offered a flexible way to develop applications for nomadic networks.

A Scalable and Dynamic Testbed for Conducting Penetration-Test Training in a Laboratory Environment

DTIC Science & Technology

2015-03-01

entry point through which to execute a payload to accomplish a higher-level goal: executing arbitrary code, escalating privileges , pivoting...Mobile Ad Hoc Network Emulator (EMANE)26 can emulate the entire network stack (physical to application -layer protocols). 2. Methodology To build a...to host Windows, Linux, MacOS, Android , and other operating systems without much effort. 4 E. A simple and automatic “restore” function: Many

A Discovery Process for Initializing Ad Hoc Underwater Acoustic Networks

DTIC Science & Technology

2008-12-01

the ping utility packet is set to global address 0, its function becomes a broadcast ping and it elicits echoes from all neighboring nodes within...destination. At the Seaweb server, a global neighbor table and a global routing table are maintained to support network configurability. 2. Cellular...aggregates the received peer discovery data in a global neighbor table and ultimately decides how routing to each branch node should be configured

New Capabilities in Security and QoS Using the Updated MANET Routing Protocol OLSRv2

DTIC Science & Technology

2010-09-01

integrity, by the authentication of packets or messages, and confidentiality. These are discussed in the following sections. Issues of availability...fully specified, in [2] is the addition of a TLV including a cryptographic signature that will allow the authentication of the received information...The objective is to ensure the integrity of the ad hoc network, that only authorised routers can join the network because unauthorised routers will

On the routing protocol influence on the resilience of wireless sensor networks to jamming attacks.

PubMed

Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Monroy, Raul; Nolazco-Flores, Juan Arturo

2015-03-27

In this work, we compare a recently proposed routing protocol, the multi-parent hierarchical (MPH) protocol, with two well-known protocols, the ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR). For this purpose, we have developed a simulator, which faithfully reifies the workings of a given protocol, considering a fixed, reconfigurable ad hoc network given by the number and location of participants, and general network conditions. We consider a scenario that can be found in a large number of wireless sensor network applications, a single sink node that collects all of the information generated by the sensors. The metrics used to compare the protocols were the number of packet retransmissions, carrier sense multiple access (CSMA) inner loop retries, the number of nodes answering the queries from the coordinator (sink) node and the energy consumption. We tested the network under ordinary (without attacks) conditions (and combinations thereof) and when it is subject to different types of jamming attacks (in particular, random and reactive jamming attacks), considering several positions for the jammer. Our results report that MPH has a greater ability to tolerate such attacks than DSR and AODV, since it minimizes and encapsulates the network segment under attack. The self-configuring capabilities of MPH derived from a combination of a proactive routes update, on a periodic-time basis, and a reactive behavior provide higher resilience while offering a better performance (overhead and energy consumption) than AODV and DSR, as shown in our simulation results.

Dynamic social networks based on movement

USGS Publications Warehouse

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.

Sensor Sharing in Mobile Ad-Hoc Networks

ERIC Educational Resources Information Center

Mitra, Pramita

2013-01-01

Today's modern mobile devices (such as smartphones and tablets) present great potential for growth of many novel, powerful, but also highly demanding applications. However, most mobile devices/users operate in isolation from one another, i.e., they are not aware of the presence of other devices in their proximity. There are numerous situations…

Privacy-Preserving Security for Vehicular Communications

ERIC Educational Resources Information Center

Weerasinghe, Hesiri Dhammika

2011-01-01

Because of the large number of deaths, severe injuries and huge financial loss due to auto accidents and poor traffic management, road safety and traffic management have become very important areas of interest among research community. As a result, Vehicular Ad-hoc Network (VANET) becomes a promising technology to improve road safety and quality…

Robust Connectivity in Sensory and Ad Hoc Network

DTIC Science & Technology

2011-02-01

as the prior probability is π0 = 0.8, the error probability should be capped at 0.2. This seemingly pathological result is due to the fact that the...publications and is the author of the book Multirate and Wavelet Signal Processing (Academic Press, 1998). His research interests include multiscale signal and

14 CFR 1203.903 - Ad hoc committees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Ad hoc committees. 1203.903 Section 1203.903 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION INFORMATION SECURITY PROGRAM NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is authorized...

A native Bayesian classifier based routing protocol for VANETS

NASA Astrophysics Data System (ADS)

Bao, Zhenshan; Zhou, Keqin; Zhang, Wenbo; Gong, Xiaolei

2016-12-01

Geographic routing protocols are one of the most hot research areas in VANET (Vehicular Ad-hoc Network). However, there are few routing protocols can take both the transmission efficient and the usage of ratio into account. As we have noticed, different messages in VANET may ask different quality of service. So we raised a Native Bayesian Classifier based routing protocol (Naive Bayesian Classifier-Greedy, NBC-Greedy), which can classify and transmit different messages by its emergency degree. As a result, we can balance the transmission efficient and the usage of ratio with this protocol. Based on Matlab simulation, we can draw a conclusion that NBC-Greedy is more efficient and stable than LR-Greedy and GPSR.

14 CFR 1203.903 - Ad hoc committees.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 5 2011-01-01 2010-01-01 true Ad hoc committees. 1203.903 Section 1203.903 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION INFORMATION SECURITY PROGRAM NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is authorized to...

Interdependent Network Recovery Games.

PubMed

Smith, Andrew M; González, Andrés D; Dueñas-Osorio, Leonardo; D'Souza, Raissa M

2017-10-30

Recovery of interdependent infrastructure networks in the presence of catastrophic failure is crucial to the economy and welfare of society. Recently, centralized methods have been developed to address optimal resource allocation in postdisaster recovery scenarios of interdependent infrastructure systems that minimize total cost. In real-world systems, however, multiple independent, possibly noncooperative, utility network controllers are responsible for making recovery decisions, resulting in suboptimal decentralized processes. With the goal of minimizing recovery cost, a best-case decentralized model allows controllers to develop a full recovery plan and negotiate until all parties are satisfied (an equilibrium is reached). Such a model is computationally intensive for planning and negotiating, and time is a crucial resource in postdisaster recovery scenarios. Furthermore, in this work, we prove this best-case decentralized negotiation process could continue indefinitely under certain conditions. Accounting for network controllers' urgency in repairing their system, we propose an ad hoc sequential game-theoretic model of interdependent infrastructure network recovery represented as a discrete time noncooperative game between network controllers that is guaranteed to converge to an equilibrium. We further reduce the computation time needed to find a solution by applying a best-response heuristic and prove bounds on ε-Nash equilibrium, where ε depends on problem inputs. We compare best-case and ad hoc models on an empirical interdependent infrastructure network in the presence of simulated earthquakes to demonstrate the extent of the tradeoff between optimality and computational efficiency. Our method provides a foundation for modeling sociotechnical systems in a way that mirrors restoration processes in practice. © 2017 Society for Risk Analysis.

802.11s Wireless Mesh Network Visualization Application

NASA Technical Reports Server (NTRS)

Mauldin, James Alexander

2014-01-01

Results of past experimentation at NASA Johnson Space Center showed that the IEEE 802.11s standard has better performance than the widely implemented alternative protocol B.A.T.M.A.N (Better Approach to Mobile Ad hoc Networking). 802.11s is now formally incorporated into the Wi- Fi 802.11-2012 standard, which specifies a hybrid wireless mesh networking protocol (HWMP). In order to quickly analyze changes to the routing algorithm and to support optimizing the mesh network behavior for our intended application a visualization tool was developed by modifying and integrating open source tools.

Assured Information Sharing for Ad-Hoc Collaboration

ERIC Educational Resources Information Center

Jin, Jing

2009-01-01

Collaborative information sharing tends to be highly dynamic and often ad hoc among organizations. The dynamic natures and sharing patterns in ad-hoc collaboration impose a need for a comprehensive and flexible approach to reflecting and coping with the unique access control requirements associated with the environment. This dissertation…

75 FR 43565 - NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-26

... NATIONAL AERONAUTICS AND SPACE ADMINISTRATION [Notice: (10-084)] NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting AGENCY: National Aeronautics and Space Administration. ACTION... amended, the National Aeronautics and Space Administration announces a two-part meeting of the Ad-Hoc Task...

75 FR 33838 - NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2010-06-15

... NATIONAL AERONAUTICS AND SPACE ADMINISTRATION [Notice (10-065)] NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting AGENCY: National Aeronautics and Space Administration. ACTION... amended, the National Aeronautics and Space Administration announces a meeting of the Ad-Hoc Task Force on...

75 FR 15742 - NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-30

... NATIONAL AERONAUTICS AND SPACE ADMINISTRATION [Notice: (10-035)] NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting AGENCY: National Aeronautics and Space Administration. ACTION... amended, the National Aeronautics and Space Administration announces a meeting of the Ad-Hoc Task Force on...

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

DTIC Science & Technology

2016-09-01

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

Uncoordinated MAC for Adaptive Multi-Beam Directional Networks: Analysis and Evaluation

DTIC Science & Technology

2016-04-10

transmission times, hence traditional CSMA approaches are not appropriate. We first present our model of these multi-beamforming capa- bilities and the...resulting wireless interference. We then derive an upper bound on multi-access performance for an idealized version of this physical layer. We then present... transmissions and receptions in a mobile ad-hoc network has in practice led to very constrained topologies. As mentioned, one approach for system design is to de

Statistically Self-Consistent and Accurate Errors for SuperDARN Data

NASA Astrophysics Data System (ADS)

Reimer, A. S.; Hussey, G. C.; McWilliams, K. A.

2018-01-01

The Super Dual Auroral Radar Network (SuperDARN)-fitted data products (e.g., spectral width and velocity) are produced using weighted least squares fitting. We present a new First-Principles Fitting Methodology (FPFM) that utilizes the first-principles approach of Reimer et al. (2016) to estimate the variance of the real and imaginary components of the mean autocorrelation functions (ACFs) lags. SuperDARN ACFs fitted by the FPFM do not use ad hoc or empirical criteria. Currently, the weighting used to fit the ACF lags is derived from ad hoc estimates of the ACF lag variance. Additionally, an overcautious lag filtering criterion is used that sometimes discards data that contains useful information. In low signal-to-noise (SNR) and/or low signal-to-clutter regimes the ad hoc variance and empirical criterion lead to underestimated errors for the fitted parameter because the relative contributions of signal, noise, and clutter to the ACF variance is not taken into consideration. The FPFM variance expressions include contributions of signal, noise, and clutter. The clutter is estimated using the maximal power-based self-clutter estimator derived by Reimer and Hussey (2015). The FPFM was successfully implemented and tested using synthetic ACFs generated with the radar data simulator of Ribeiro, Ponomarenko, et al. (2013). The fitted parameters and the fitted-parameter errors produced by the FPFM are compared with the current SuperDARN fitting software, FITACF. Using self-consistent statistical analysis, the FPFM produces reliable or trustworthy quantitative measures of the errors of the fitted parameters. For an SNR in excess of 3 dB and velocity error below 100 m/s, the FPFM produces 52% more data points than FITACF.

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

NASA Astrophysics Data System (ADS)

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 of audit-log data through resource-limited nodes and locates routines closer to that data. Performance of the unsupervised algorithms is evaluated against the network intrusions of black hole, flooding, Sybil and other denial-of-service attacks in simulations of published scenarios. Results for scenarios with intentionally malfunctioning sensors show the robustness of the two-stage approach to intrusion anomalies.

Ad hoc supervision of general practice registrars as a 'community of practice': analysis, interpretation and re-presentation.

PubMed

Clement, T; Brown, J; Morrison, J; Nestel, D

2016-05-01

General practice registrars in Australia undertake most of their vocational training in accredited general practices. They typically see patients alone from the start of their community-based training and are expected to seek timely ad hoc support from their supervisor. Such ad hoc encounters are a mechanism for ensuring patient safety, but also provide an opportunity for learning and teaching. Wenger's (Communities of practice: learning, meaning, and identity. Cambridge University Press, New York, 1998) social theory of learning ('communities of practice') guided a secondary analysis of audio-recordings of ad hoc encounters. Data from one encounter is re-presented as an extended sequence to maintain congruence with the theoretical perspective and enhance vicariousness. An interpretive commentary communicates key features of Wenger's theory and highlights the researchers' interpretations. We argue that one encounter can reveal universal understandings of clinical supervision and that the process of naturalistic generalisation allows readers to transfer others' experiences to their own contexts. The paper raises significant analytic, interpretive, and representational issues. We highlight that report writing is an important, but infrequently discussed, part of research design. We discuss the challenges of supporting the learning and teaching that arises from adopting a socio-cultural lens and argue that such a perspective importantly captures the complex range of issues that work-based practitioners have to grapple with. This offers a challenge to how we research and seek to influence work-based learning and teaching in health care settings.

Taming Wild Horses: The Need for Virtual Time-based Scheduling of VMs in Network Simulations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yoginath, Srikanth B; Perumalla, Kalyan S; Henz, Brian J

2012-01-01

The next generation of scalable network simulators employ virtual machines (VMs) to act as high-fidelity models of traffic producer/consumer nodes in simulated networks. However, network simulations could be inaccurate if VMs are not scheduled according to virtual time, especially when many VMs are hosted per simulator core in a multi-core simulator environment. Since VMs are by default free-running, on the outset, it is not clear if, and to what extent, their untamed execution affects the results in simulated scenarios. Here, we provide the first quantitative basis for establishing the need for generalized virtual time scheduling of VMs in network simulators,more » based on an actual prototyped implementations. To exercise breadth, our system is tested with multiple disparate applications: (a) a set of message passing parallel programs, (b) a computer worm propagation phenomenon, and (c) a mobile ad-hoc wireless network simulation. We define and use error metrics and benchmarks in scaled tests to empirically report the poor match of traditional, fairness-based VM scheduling to VM-based network simulation, and also clearly show the better performance of our simulation-specific scheduler, with up to 64 VMs hosted on a 12-core simulator node.« less

Performance analysis of multi-radio routing protocol in cognitive radio ad hoc networks under different path failure rate

NASA Astrophysics Data System (ADS)

Che-Aron, Z.; Abdalla, A. H.; Abdullah, K.; Hassan, W. H.

2013-12-01

In recent years, Cognitive Radio (CR) technology has largely attracted significant studies and research. Cognitive Radio Ad Hoc Network (CRAHN) is an emerging self-organized, multi-hop, wireless network which allows unlicensed users to opportunistically access available licensed spectrum bands for data communication under an intelligent and cautious manner. However, in CRAHNs, a lot of failures can easily occur during data transmission caused by PU (Primary User) activity, topology change, node fault, or link degradation. In this paper, an attempt has been made to evaluate the performance of the Multi-Radio Link-Quality Source Routing (MR-LQSR) protocol in CRAHNs under different path failure rate. In the MR-LQSR protocol, the Weighted Cumulative Expected Transmission Time (WCETT) is used as the routing metric. The simulations are carried out using the NS-2 simulator. The protocol performance is evaluated with respect to performance metrics like average throughput, packet loss, average end-to-end delay and average jitter. From the simulation results, it is observed that the number of path failures depends on the PUs number and mobility rate of SUs (Secondary Users). Moreover, the protocol performance is greatly affected when the path failure rate is high, leading to major service outages.

Towards an Efficient Flooding Scheme Exploiting 2-Hop Backward Information in MANETs

NASA Astrophysics Data System (ADS)

Le, Trong Duc; Choo, Hyunseung

Flooding is an indispensable operation for providing control or routing functionalities to mobile ad hoc networks (MANETs). Previously, many flooding schemes have been studied with the intention of curtailing the problems of severe redundancies, contention, and collisions in traditional implementations. A recent approach with relatively high efficiency is 1HI by Liu et al., which uses only 1-hop neighbor information. The scheme achieves local optimality in terms of the number of retransmission nodes with time complexity &Theta(n log n), where n is the number of neighbors of a node; however, this method tends to make many redundant transmissions. In this paper, we present a novel flooding algorithm, 2HBI (2-hop backward information), that efficiently reduces the number of retransmission nodes and solves the broadcast storm problem in ad hoc networks using our proposed concept, “2-hop backward information.” The most significant feature of the proposed algorithm is that it does not require any extra communication overhead other than the exchange of 1-hop HELLO messages but maintains high deliverability. Comprehensive computer simulations show that the proposed scheme significantly reduces redundant transmissions in 1HI and in pure flooding, up to 38% and 91%, respectively; accordingly it alleviates contention and collisions in networks.

A Wi-Fi based Electronic Road Sign for Enhancing the Awareness of Vehicle Driver

NASA Astrophysics Data System (ADS)

Bhawiyuga, A.; Sabriansyah, R. A.; Yahya, W.; E Putra, R.

2017-01-01

Reducing the road accident rate is one of the city goal in the area of transportation. One of the effort to reach that goal is done by deploying various signs across the road. However, the role of those road signs can be diminished once the vehicle drivers intentionally or unintentionally disobey the rule indicated on those signs. In order to increase the awareness of the driver, we can employ the vehicular network concept in which a vehicle can communicate with another vehicles or with the infrastructure installed along the road. For realizing that idea, we propose the implementation of communication equipped road sign system which consists of two components: Road Side Unit (RSU) module deployed at road sign and On Board Unit (OBU) module deployed at each vehicle. In our proposed scheme, both of the devices communicate each other through the widely-used Wi-Fi protocol (IEEE 802.11n) operating in ad-hoc mode. While a OBU equipped vehicle is moving towards the communication range of RSU, it will make an association to a predefined wireless ad-hoc network. Once it is associated, the OBU can receive message broadcast by the RSU. Upon reception, OBU display alert message indicating that the vehicle is approaching a road sign. From performance testing we observe that the proposed system can give relatively good service the vehicle moving as fast as speed 90km/h with the distance as far as 90m.

Commercial Technology at the Tactical Edge

DTIC Science & Technology

2013-06-01

Typical environmental examples are survivability in the face of hostile action, lack of fixed infrastructure , high mobility and ruggedness...Disconnected, Intermittent, and Limited (DIL) Communications Delay Tolerance Mobile Ad Hoc Networks (MANETs) Loss of infrastructure Security Cyber...for Apple’s IOS.25 In particular, various vendors have built application infrastructures around the various mobile phone operating systems (OSs) such

Secure Ad Hoc Networking on an Android Platform

DTIC Science & Technology

2014-05-01

Once the device is provisioned, connections can be initiated by tapping two devices together, this uses NFC to bootstrap a Bluetooth connection. Once...4 2.2 Residual Issues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3 Device Provisioning 5 3.1...the inclusion of SE Android’s Install-time Mandatory Access Control (MAC) feature. Some knowledge of Android is required to understand the system

Post Hoc Analyses of ApoE Genotype-Defined Subgroups in Clinical Trials.

PubMed

Kennedy, Richard E; Cutter, Gary R; Wang, Guoqiao; Schneider, Lon S

2016-01-01

Many post hoc analyses of clinical trials in Alzheimer's disease (AD) and mild cognitive impairment (MCI) are in small Phase 2 trials. Subject heterogeneity may lead to statistically significant post hoc results that cannot be replicated in larger follow-up studies. We investigated the extent of this problem using simulation studies mimicking current trial methods with post hoc analyses based on ApoE4 carrier status. We used a meta-database of 24 studies, including 3,574 subjects with mild AD and 1,171 subjects with MCI/prodromal AD, to simulate clinical trial scenarios. Post hoc analyses examined if rates of progression on the Alzheimer's Disease Assessment Scale-cognitive (ADAS-cog) differed between ApoE4 carriers and non-carriers. Across studies, ApoE4 carriers were younger and had lower baseline scores, greater rates of progression, and greater variability on the ADAS-cog. Up to 18% of post hoc analyses for 18-month trials in AD showed greater rates of progression for ApoE4 non-carriers that were statistically significant but unlikely to be confirmed in follow-up studies. The frequency of erroneous conclusions dropped below 3% with trials of 100 subjects per arm. In MCI, rates of statistically significant differences with greater progression in ApoE4 non-carriers remained below 3% unless sample sizes were below 25 subjects per arm. Statistically significant differences for ApoE4 in post hoc analyses often reflect heterogeneity among small samples rather than true differential effect among ApoE4 subtypes. Such analyses must be viewed cautiously. ApoE genotype should be incorporated into the design stage to minimize erroneous conclusions.

User Needs and Advances in Space Wireless Sensing and Communications

NASA Technical Reports Server (NTRS)

Kegege, Obadiah

2017-01-01

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

DMP: Detouring Using Multiple Paths against Jamming Attack for Ubiquitous Networking System

PubMed Central

Kim, Mihui; Chae, Kijoon

2010-01-01

To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio) and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector), and a conventional JAM (Jammed Area Mapping) service with one reroute. PMID:22319316

DMP: detouring using multiple paths against jamming attack for ubiquitous networking system.

PubMed

Kim, Mihui; Chae, Kijoon

2010-01-01

To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio) and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector), and a conventional JAM (Jammed Area Mapping) service with one reroute.

Connecting the Edge: Mobile Ad-Hoc Networks (MANETs) for Network Centric Warfare

DTIC Science & Technology

2007-04-01

Cebrowski and Mr. John Garstka are generally credited with introducing the concept and origins of NCW.8 They described the military’s evolution from...www.sdrforum.org/pages/aboutTheForum/faqs.asp Adams, James. The Next World War. New York, NY: Simon & Schuster, 1998. Alberts, David S., John J. Garstka, and...Joint Tactical Radio System – Reloaded.” CHIPS, July-September 2006: 6-9. Arquilla, John , and David Ronfeldt. In Athena’s Camp. Santa Monica, CA

Temporal Traffic Dynamics Improve the Connectivity of Ad Hoc Cognitive Radio Networks

DTIC Science & Technology

2014-02-12

more packets to send, and are (re)born when they do. We could also consider this from a duty-cycling perspective: Nodes sleep and wake up...transmitting and receiving activities in the primary network in an intricate way, we obtain the MMD by considering a flooding scheme that tries every...consider the delay caused by scheduling, contention, or queuing. It can be shown that this flooding scheme gives us the MMD. We stress that flooding is used

Bridging Operational and Strategic Communication Architectures: Integrating Small Unmanned Aircraft Systems as Airborne Tactical Relay Communication Vertical Nodes

DTIC Science & Technology

2012-09-01

Surveillance Reconnaissance JUAS Joint Unmanned Aircraft System LAN Local Area Network LOS Line of Sight xiv MANET Mobile Ad Hoc Network...terrain, which severely impacted the ability to communicate with the line of sight ( LOS ) tactical radios used by small units. Much like the commercial...Selectable – NB: 10W, SATCOM: 20W, WB: 20W peak/5W average Operational Mode: Voice/Data (to 3.6Mbps) Distance: 300 meters to 35 Kilometers or LOS

Building a Simulation Toolkit for Wireless Mesh Clusters and Evaluating the Suitability of Different Families of Ad Hoc Protocols for the Tactical Network Topology

DTIC Science & Technology

2005-03-01

International Conference On Computers Communications and Networks, 153- 161, Lafayette, L.A. Deitel , H.M. and P.J. Deitel . 2003. C++ How to Program ...of this study is to provide an additional performance evaluation technique for the TNT program of Naval Postgraduate School. The current approach...case are the PAMAS and DBTMA protocols. Toh (2002) illustrates how these approaches succeed in solving the problem. In order to address all the

On Alarm Protocol in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Cichoń, Jacek; Kapelko, Rafał; Lemiesz, Jakub; Zawada, Marcin

We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication channel. The problem arise in tasks that sensors have to quickly inform the target user about an alert situation such as presence of fire, dangerous radiation, seismic vibrations, and more. In this paper, we present a protocol which uses O(logn) time slots and show that Ω(logn/loglogn) is a lower bound for used time slots.

Remote detection of riverine traffic using an ad hoc wireless sensor network

NASA Astrophysics Data System (ADS)

Athan, Stephan P.

2005-05-01

Trafficking of illegal drugs on riverine and inland waterways continues to proliferate in South America. While there has been a successful joint effort to cut off overland and air trafficking routes, there exists a vast river network and Amazon region consisting of over 13,000 water miles that remains difficult to adequately monitor, increasing the likelihood of narcotics moving along this extensive river system. Hence, an effort is underway to provide remote unattended riverine detection in lieu of manned or attended detection measures.

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

DTIC Science & Technology

2012-09-01

as resistant to rough sea conditions as the SHARC, since its maximum operation limit is sea state 3. Its maximum speed approaches three knots and...which renders it corrosion resistant and lightweight. Its length is 3.2 meters with a rotor diameter at 3.3 meters. It flies at speeds of 50 knots...NMIOTC main building and to a moored training ship (see Figure 50), (2) GSM/GPRS was networked with swimmers , (3) security patrol and target vessels

Typicality Mediates Performance during Category Verification in Both Ad-Hoc and Well-Defined Categories

ERIC Educational Resources Information Center

Sandberg, Chaleece; Sebastian, Rajani; Kiran, Swathi

2012-01-01

Background: The typicality effect is present in neurologically intact populations for natural, ad-hoc, and well-defined categories. Although sparse, there is evidence of typicality effects in persons with chronic stroke aphasia for natural and ad-hoc categories. However, it is unknown exactly what influences the typicality effect in this…

Spacecraft Will Communicate "on the Fly"

NASA Technical Reports Server (NTRS)

Laufenberg, Lawrence

2003-01-01

As NASA probes deeper into space, the distance between sensor and scientist increases, as does the time delay. NASA needs to close that gap, while integrating more spacecraft types and missions-from near-Earth orbit to deep space. To speed and integrate communications from space missions to scientists on Earth and back again. NASA needs a comprehensive, high-performance communications network. To this end, the CICT Programs Space Communications (SC) Project is providing technologies for building the Space Internet which will consist of large backbone network, mid-size access networks linked to the backbones, and smaller, ad-hoc network linked to the access network. A key component will be mobile, wireless networks for spacecraft flying in different configurations.

Modelling disease outbreaks in realistic urban social networks

NASA Astrophysics Data System (ADS)

Eubank, Stephen; Guclu, Hasan; Anil Kumar, V. S.; Marathe, Madhav V.; Srinivasan, Aravind; Toroczkai, Zoltán; Wang, Nan

2004-05-01

Most mathematical models for the spread of disease use differential equations based on uniform mixing assumptions or ad hoc models for the contact process. Here we explore the use of dynamic bipartite graphs to model the physical contact patterns that result from movements of individuals between specific locations. The graphs are generated by large-scale individual-based urban traffic simulations built on actual census, land-use and population-mobility data. We find that the contact network among people is a strongly connected small-world-like graph with a well-defined scale for the degree distribution. However, the locations graph is scale-free, which allows highly efficient outbreak detection by placing sensors in the hubs of the locations network. Within this large-scale simulation framework, we then analyse the relative merits of several proposed mitigation strategies for smallpox spread. Our results suggest that outbreaks can be contained by a strategy of targeted vaccination combined with early detection without resorting to mass vaccination of a population.

Effectiveness of AODV Protocol under Hidden Node Environment

NASA Astrophysics Data System (ADS)

Garg, Ruchi; Sharma, Himanshu; Kumar, Sumit

IEEE 802.11 is a standard for mobile ad hoc networks (MANET), implemented with various different protocols. Ad Hoc on Demand Distance Vector Routing (AODV) is one of the several protocols of IEEE 802.11, intended to provide various Quality of Service (QOS) parameters under acceptable range. To avoid the collision and interference the MAC protocol has only two solutions, one, to sense the physical carrier and second, to use the RTS/CTS handshake mechanism. But with the help of these methods AODV is not free from the problem of hidden nodes like other several protocols. Under the hidden node environment, performance of AODV depends upon various factors. The position of receiver and sender among the other nodes is very crucial and it affects the performance. Under the various situations the AODV is simulated with the help of NS2 and the outcomes are discussed.

VANET Clustering Based Routing Protocol Suitable for Deserts.

PubMed

Nasr, Mohammed Mohsen Mohammed; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

2016-04-06

In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms.

VANET Clustering Based Routing Protocol Suitable for Deserts

PubMed Central

Mohammed Nasr, Mohammed Mohsen; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

2016-01-01

In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms. PMID:27058539

SPAR: a security- and power-aware routing protocol for wireless ad hoc and sensor networks

NASA Astrophysics Data System (ADS)

Oberoi, Vikram; Chigan, Chunxiao

2005-05-01

Wireless Ad Hoc and Sensor Networks (WAHSNs) are vulnerable to extensive attacks as well as severe resource constraints. To fulfill the security needs, many security enhancements have been proposed. Like wise, from resource constraint perspective, many power aware schemes have been proposed to save the battery power. However, we observe that for the severely resource limited and extremely vulnerable WAHSNs, taking security or power (or any other resource) alone into consideration for protocol design is rather inadequate toward the truly "secure-and-useful" WAHSNs. For example, from resource constraint perspective, we identify one of the potential problems, the Security-Capable-Congestion (SCC) behavior, for the WAHSNs routing protocols where only the security are concerned. On the other hand, the design approach where only scarce resource is concerned, such as many power-aware WAHSNs protocols, leaves security unconsidered and is undesirable to many WAHSNs application scenarios. Motivated by these observations, we propose a co-design approach, where both the high security and effective resource consumption are targeted for WAHSNs protocol design. Specifically, we propose a novel routing protocol, Security- and Power- Aware Routing (SPAR) protocol based on this co-design approach. In SPAR, the routing decisions are made based on both security and power as routing criteria. The idea of the SPAR mechanism is routing protocol independent and therefore can be broadly integrated into any of the existing WAHSNs routing protocols. The simulation results show that SPAR outperforms the WAHSNs routing protocols where security or power alone is considered, significantly. This research finding demonstrates the proposed security- and resource- aware co-design approach is promising towards the truly "secure-and-useful" WAHSNs.

FOCU:S--future operator control unit: soldier

NASA Astrophysics Data System (ADS)

O'Brien, Barry J.; Karan, Cem; Young, Stuart H.

2009-05-01

The U.S. Army Research Laboratory's (ARL) Computational and Information Sciences Directorate (CISD) has long been involved in autonomous asset control, specifically as it relates to small robots. Over the past year, CISD has been making strides in the implementation of three areas of small robot autonomy, namely platform autonomy, Soldier-robot interface, and tactical behaviors. It is CISD's belief that these three areas must be considered as a whole in order to provide Soldiers with useful capabilities. In addressing the Soldier-robot interface aspect, CISD has begun development on a unique dismounted controller called the Future Operator Control Unit: Soldier (FOCU:S) that is based on an Apple iPod Touch. The iPod Touch's small form factor, unique touch-screen input device, and the presence of general purpose computing applications such as a web browser combine to give this device the potential to be a disruptive technology. Setting CISD's implementation apart from other similar iPod or iPhone-based devices is the ARL software that allows multiple robotic platforms to be controlled from a single OCU. The FOCU:S uses the same Agile Computing Infrastructure (ACI) that all other assets in the ARL robotic control system use, enabling automated asset discovery on any type of network. Further, a custom ad hoc routing implementation allows the FOCU:S to communicate with the ARL ad hoc communications system and enables it to extend the range of the network. This paper will briefly describe the current robotic control architecture employed by ARL and provide short descriptions of existing capabilities. Further, the paper will discuss FOCU:S specific software developed for the iPod Touch, including unique capabilities enabled by the device's unique hardware.

When Reputation Enforces Evolutionary Cooperation in Unreliable MANETs.

PubMed

Tang, Changbing; Li, Ang; Li, Xiang

2015-10-01

In self-organized mobile ad hoc networks (MANETs), network functions rely on cooperation of self-interested nodes, where a challenge is to enforce their mutual cooperation. In this paper, we study cooperative packet forwarding in a one-hop unreliable channel which results from loss of packets and noisy observation of transmissions. We propose an indirect reciprocity framework based on evolutionary game theory, and enforce cooperation of packet forwarding strategies in both structured and unstructured MANETs. Furthermore, we analyze the evolutionary dynamics of cooperative strategies and derive the threshold of benefit-to-cost ratio to guarantee the convergence of cooperation. The numerical simulations verify that the proposed evolutionary game theoretic solution enforces cooperation when the benefit-to-cost ratio of the altruistic exceeds the critical condition. In addition, the network throughput performance of our proposed strategy in structured MANETs is measured, which is in close agreement with that of the full cooperative strategy.

Trust models for efficient communication in Mobile Cloud Computing and their applications to e-Commerce

NASA Astrophysics Data System (ADS)

Pop, Florin; Dobre, Ciprian; Mocanu, Bogdan-Costel; Citoteanu, Oana-Maria; Xhafa, Fatos

2016-11-01

Managing the large dimensions of data processed in distributed systems that are formed by datacentres and mobile devices has become a challenging issue with an important impact on the end-user. Therefore, the management process of such systems can be achieved efficiently by using uniform overlay networks, interconnected through secure and efficient routing protocols. The aim of this article is to advance our previous work with a novel trust model based on a reputation metric that actively uses the social links between users and the model of interaction between them. We present and evaluate an adaptive model for the trust management in structured overlay networks, based on a Mobile Cloud architecture and considering a honeycomb overlay. Such a model can be useful for supporting advanced mobile market-share e-Commerce platforms, where users collaborate and exchange reliable information about, for example, products of interest and supporting ad-hoc business campaigns

Smart Collision Avoidance and Hazard Routing Mechanism for Intelligent Transport Network

NASA Astrophysics Data System (ADS)

Singh, Gurpreet; Gupta, Pooja; Wahab, Mohd Helmy Abd

2017-08-01

The smart vehicular ad-hoc network is the network that consists of vehicles for smooth movement and better management of the vehicular connectivity across the given network. This research paper aims to propose a set of solution for the VANETs consisting of the automatic driven vehicles, also called as the autonomous car. Such vehicular networks are always prone to collision due to the natural or un-natural reasons which must be solved before the large-scale deployment of the autonomous transport systems. The newly designed intelligent transport movement control mechanism is based upon the intelligent data propagation along with the vehicle collision and traffic jam prevention schema [8], which may help the future designs of smart cities to become more robust and less error-prone. In the proposed model, the focus is on designing a new dynamic and robust hazard routing protocol for intelligent vehicular networks for improvement of the overall performance in various aspects. It is expected to improve the overall transmission delay as well as the number of collisions or adversaries across the vehicular network zone.

Diffany: an ontology-driven framework to infer, visualise and analyse differential molecular networks.

PubMed

Van Landeghem, Sofie; Van Parys, Thomas; Dubois, Marieke; Inzé, Dirk; Van de Peer, Yves

2016-01-05

Differential networks have recently been introduced as a powerful way to study the dynamic rewiring capabilities of an interactome in response to changing environmental conditions or stimuli. Currently, such differential networks are generated and visualised using ad hoc methods, and are often limited to the analysis of only one condition-specific response or one interaction type at a time. In this work, we present a generic, ontology-driven framework to infer, visualise and analyse an arbitrary set of condition-specific responses against one reference network. To this end, we have implemented novel ontology-based algorithms that can process highly heterogeneous networks, accounting for both physical interactions and regulatory associations, symmetric and directed edges, edge weights and negation. We propose this integrative framework as a standardised methodology that allows a unified view on differential networks and promotes comparability between differential network studies. As an illustrative application, we demonstrate its usefulness on a plant abiotic stress study and we experimentally confirmed a predicted regulator. Diffany is freely available as open-source java library and Cytoscape plugin from http://bioinformatics.psb.ugent.be/supplementary_data/solan/diffany/.

Army Science Board 2001 AD HOC Study Knowledge Management

DTIC Science & Technology

2001-11-01

dissemination, Army, Army culture, information dominance , knowledge dominance, information sharing, situational awareness, network-centric, infosphere...proposed effort and the emerging Army ICT for Information Dominance are all excellent foundation efforts for KM and Information Assurance. The panel’s...level is critical to survivability and lethality. – Unreliable information will quickly reverse the advantages of “ Information Dominance ” essential to

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

DTIC Science & Technology

2015-03-01

2.5.5 Availability Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 2.6 Simulation Environments...routing scheme can prove problematic. Two prominent proactive protocols, 7 Destination-Sequenced Distance-Vector (DSDV) and Optimized Link State...distributed file management systems such as Tahoe- LAFS as part of its replication scheme . Altman and De Pellegrini [4] examine the impact of FEC and

Cooperative Autonomous Robots for Reconnaissance

DTIC Science & Technology

2009-03-06

REPORT Cooperative Autonomous Robots for Reconnaissance 14. ABSTRACT 16. SECURITY CLASSIFICATION OF: Collaborating mobile robots equipped with WiFi ...Cooperative Autonomous Robots for Reconnaissance Report Title ABSTRACT Collaborating mobile robots equipped with WiFi transceivers are configured as a mobile...equipped with WiFi transceivers are configured as a mobile ad-hoc network. Algorithms are developed to take advantage of the distributed processing

MSG Instant Messenger: Social Presence and Location for the "'Ad Hoc' Learning Experience"

ERIC Educational Resources Information Center

Little, Alex; Denham, Chris; Eisenstadt, Marc

2008-01-01

"Elearning2.0" promises to harness the power of three of today's most disruptive technologies: social software, elearning, and Web2.0. Our own work in this disruptive space takes as a starting premise that social networking is critical for learning: finding the right person can be more important than "scouring the web for an answer" particularly…

UGV Interoperability Profile (IOP) Communications Profile, Version 0

DTIC Science & Technology

2011-12-21

some UGV systems employ Orthogonal Frequency Division Multiplexing ( OFDM ) or Coded Orthogonal Frequency Division Multiplexing (COFDM) waveforms which...other portions of the IOP. Attribute Paragraph Title Values Waveform 3.3 Air Interface/ Waveform OFDM , COFDM, DDL, CDL, None OCU to Platform...Sight MANET Mobile Ad-hoc Network Mbps Megabits per second MC/PM Master Controller/ Payload Manager MHz Megahertz MIMO Multiple Input Multiple

Space-Time Processing for Tactical Mobile Ad Hoc Networks

DTIC Science & Technology

2009-08-01

the results for the standard 8 bits per pixel ( bpp ) 512512 Lena image [3] with a transmission rate of 0.375 bpp . To compare the image quality, we...use peak-signal-to-noise ratio (PSNR), defined as  DE 2255 log10PSNR  (dB) (2) where 255 is due to the 8 bpp image

Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem.

PubMed

Fort, J C

1988-01-01

We present an application of the Kohonen algorithm to the traveling salesman problem: Using only this algorithm, without energy function nor any parameter chosen "ad hoc", we found good suboptimal tours. We give a neural model version of this algorithm, closer to classical neural networks. This is illustrated with various numerical examples.

VehiHealth: An Emergency Routing Protocol for Vehicular Ad Hoc Network to Support Healthcare System.

PubMed

Bhoi, S K; Khilar, P M

2016-03-01

Survival of a patient depends on effective data communication in healthcare system. In this paper, an emergency routing protocol for Vehicular Ad hoc Network (VANET) is proposed to quickly forward the current patient status information from the ambulance to the hospital to provide pre-medical treatment. As the ambulance takes time to reach the hospital, ambulance doctor can provide sudden treatment to the patient in emergency by sending patient status information to the hospital through the vehicles using vehicular communication. Secondly, the experienced doctors respond to the information by quickly sending a treatment information to the ambulance. In this protocol, data is forwarded through that path which has less link breakage problem between the vehicles. This is done by calculating an intersection value I v a l u e for the neighboring intersections by using the current traffic information. Then the data is forwarded through that intersection which has minimum I v a l u e . Simulation results show VehiHealth performs better than P-GEDIR, GyTAR, A-STAR and GSR routing protocols in terms of average end-to-end delay, number of link breakage, path length, and average response time.

Quality of Service Metrics in Wireless Sensor Networks: A Survey

NASA Astrophysics Data System (ADS)

Snigdh, Itu; Gupta, Nisha

2016-03-01

Wireless ad hoc network is characterized by autonomous nodes communicating with each other by forming a multi hop radio network and maintaining connectivity in a decentralized manner. This paper presents a systematic approach to the interdependencies and the analogy of the various factors that affect and constrain the wireless sensor network. This article elaborates the quality of service parameters in terms of methods of deployment, coverage and connectivity which affect the lifetime of the network that have been addressed, till date by the different literatures. The analogy of the indispensable rudiments was discussed that are important factors to determine the varied quality of service achieved, yet have not been duly focused upon.

Availability and End-to-end Reliability in Low Duty Cycle Multihop Wireless Sensor Networks.

PubMed

Suhonen, Jukka; Hämäläinen, Timo D; Hännikäinen, Marko

2009-01-01

A wireless sensor network (WSN) is an ad-hoc technology that may even consist of thousands of nodes, which necessitates autonomic, self-organizing and multihop operations. A typical WSN node is battery powered, which makes the network lifetime the primary concern. The highest energy efficiency is achieved with low duty cycle operation, however, this alone is not enough. WSNs are deployed for different uses, each requiring acceptable Quality of Service (QoS). Due to the unique characteristics of WSNs, such as dynamic wireless multihop routing and resource constraints, the legacy QoS metrics are not feasible as such. We give a new definition to measure and implement QoS in low duty cycle WSNs, namely availability and reliability. Then, we analyze the effect of duty cycling for reaching the availability and reliability. The results are obtained by simulations with ZigBee and proprietary TUTWSN protocols. Based on the results, we also propose a data forwarding algorithm suitable for resource constrained WSNs that guarantees end-to-end reliability while adding a small overhead that is relative to the packet error rate (PER). The forwarding algorithm guarantees reliability up to 30% PER.

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

NASA Technical Reports Server (NTRS)

Alena, Richard I.; Lee, Charles

2004-01-01

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Taxonomic and ad hoc categorization within the two cerebral hemispheres.

PubMed

Shen, Yeshayahu; Aharoni, Bat-El; Mashal, Nira

2015-01-01

A typicality effect refers to categorization which is performed more quickly or more accurately for typical than for atypical members of a given category. Previous studies reported a typicality effect for category members presented in the left visual field/right hemisphere (RH), suggesting that the RH applies a similarity-based categorization strategy. However, findings regarding the typicality effect within the left hemisphere (LH) are less conclusive. The current study tested the pattern of typicality effects within each hemisphere for both taxonomic and ad hoc categories, using words presented to the left or right visual fields. Experiment 1 tested typical and atypical members of taxonomic categories as well as non-members, and Experiment 2 tested typical and atypical members of ad hoc categories as well as non-members. The results revealed a typicality effect in both hemispheres and in both types of categories. Furthermore, the RH categorized atypical stimuli more accurately than did the LH. Our findings suggest that both hemispheres rely on a similarity-based categorization strategy, but the coarse semantic coding of the RH seems to facilitate the categorization of atypical members.

Trust-Threshold Based Routing in Mobile Ad Hoc Delay Tolerant Networks

DTIC Science & Technology

2011-02-15

A £) I e- A "flt x rj(t), ifm *jand\\Ri\\=0 (4) if m * j and\\R{\\ > 0 The indirect trust evaluation toward nodej is given in Equation 4 above...Pfn. Pfp 1% U 300 5 (5 min) (In [l,4] m / s a 90% toh 0.8:0.2 E„ [12. 24] hrs ’ A ’* m [160.480| mm TlDS iOOs 5.1 Optimal Trust Thresholds for...Evaluation t-r, encounter.X(t . A ,\\ ;r„, _ i Tim (t+At), tfm-j e-^’xrj(t), ifm +l W The direct trust evaluation of nodey is given in

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

PubMed

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

2014-02-01

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

An Efficient Framework Model for Optimizing Routing Performance in VANETs.

PubMed

Al-Kharasani, Nori M; Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala; Hanapi, Zurina Mohd

2018-02-15

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED).

Data Mining of Extremely Large Ad Hoc Data Sets to Produce Inverted Indices

DTIC Science & Technology

2016-06-01

NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS Approved for public release; distribution is unlimited DATA MINING OF...COVERED Master’s Thesis 4. TITLE AND SUBTITLE DATA MINING OF EXTREMELY LARGE AD HOC DATA SETS TO PRODUCE INVERTED INDICES 5. FUNDING NUMBERS 6...INTENTIONALLY LEFT BLANK iii Approved for public release; distribution is unlimited DATA MINING OF EXTREMELY LARGE AD HOC DATA SETS TO PRODUCE

A Survey on Multimedia-Based Cross-Layer Optimization in Visual Sensor Networks

PubMed Central

Costa, Daniel G.; Guedes, Luiz Affonso

2011-01-01

Visual sensor networks (VSNs) comprised of battery-operated electronic devices endowed with low-resolution cameras have expanded the applicability of a series of monitoring applications. Those types of sensors are interconnected by ad hoc error-prone wireless links, imposing stringent restrictions on available bandwidth, end-to-end delay and packet error rates. In such context, multimedia coding is required for data compression and error-resilience, also ensuring energy preservation over the path(s) toward the sink and improving the end-to-end perceptual quality of the received media. Cross-layer optimization may enhance the expected efficiency of VSNs applications, disrupting the conventional information flow of the protocol layers. When the inner characteristics of the multimedia coding techniques are exploited by cross-layer protocols and architectures, higher efficiency may be obtained in visual sensor networks. This paper surveys recent research on multimedia-based cross-layer optimization, presenting the proposed strategies and mechanisms for transmission rate adjustment, congestion control, multipath selection, energy preservation and error recovery. We note that many multimedia-based cross-layer optimization solutions have been proposed in recent years, each one bringing a wealth of contributions to visual sensor networks. PMID:22163908

Ad hoc versus standardized admixtures for continuous infusion drugs in neonatal intensive care: cognitive task analysis of safety at the bedside.

PubMed

Brannon, Timothy S

2006-01-01

Continuous infusion intravenous (IV) drugs in neonatal intensive care are usually prepared based on patient weight so that the dose is readable as a simple multiple of the infusion pump rate. New safety guidelines propose that hospitals switch to using standardized admixtures of these drugs to prevent calculation errors during ad hoc preparation. Extended hierarchical task analysis suggests that switching to standardized admixtures may lead to more errors in programming the pump at the bedside.

Ad Hoc versus Standardized Admixtures for Continuous Infusion Drugs in Neonatal Intensive Care: Cognitive Task Analysis of Safety at the Bedside

PubMed Central

Brannon, Timothy S.

2006-01-01

Continuous infusion intravenous (IV) drugs in neonatal intensive care are usually prepared based on patient weight so that the dose is readable as a simple multiple of the infusion pump rate. New safety guidelines propose that hospitals switch to using standardized admixtures of these drugs to prevent calculation errors during ad hoc preparation. Extended hierarchical task analysis suggests that switching to standardized admixtures may lead to more errors in programming the pump at the bedside. PMID:17238482

Network structure of multivariate time series.

PubMed

Lacasa, Lucas; Nicosia, Vincenzo; Latora, Vito

2015-10-21

Our understanding of a variety of phenomena in physics, biology and economics crucially depends on the analysis of multivariate time series. While a wide range tools and techniques for time series analysis already exist, the increasing availability of massive data structures calls for new approaches for multidimensional signal processing. We present here a non-parametric method to analyse multivariate time series, based on the mapping of a multidimensional time series into a multilayer network, which allows to extract information on a high dimensional dynamical system through the analysis of the structure of the associated multiplex network. The method is simple to implement, general, scalable, does not require ad hoc phase space partitioning, and is thus suitable for the analysis of large, heterogeneous and non-stationary time series. We show that simple structural descriptors of the associated multiplex networks allow to extract and quantify nontrivial properties of coupled chaotic maps, including the transition between different dynamical phases and the onset of various types of synchronization. As a concrete example we then study financial time series, showing that a multiplex network analysis can efficiently discriminate crises from periods of financial stability, where standard methods based on time-series symbolization often fail.

Iterative User-Centered Design of a Next Generation Patient Monitoring System for Emergency Medical Response

PubMed Central

Gao, Tia; Kim, Matthew I.; White, David; Alm, Alexander M.

2006-01-01

We have developed a system for real-time patient monitoring during large-scale disasters. Our system is designed with scalable algorithms to monitor large numbers of patients, an intuitive interface to support the overwhelmed responders, and ad-hoc mesh networking capabilities to maintain connectivity to patients in the chaotic settings. This paper describes an iterative approach to user-centered design adopted to guide development of our system. This system is a part of the Advanced Health and Disaster Aid Network (AID-N) architecture. PMID:17238348

Vital signs monitoring and patient tracking over a wireless network.

PubMed

Gao, Tia; Greenspan, Dan; Welsh, Matt; Juang, Radford; Alm, Alex

2005-01-01

Patients at a disaster scene can greatly benefit from technologies that continuously monitor their vital status and track their locations until they are admitted to the hospital. We have designed and developed a real-time patient monitoring system that integrates vital signs sensors, location sensors, ad-hoc networking, electronic patient records, and web portal technology to allow remote monitoring of patient status. This system shall facilitate communication between providers at the disaster scene, medical professionals at local hospitals, and specialists available for consultation from distant facilities.

Handheld portable real-time tracking and communications device

DOEpatents

Wiseman, James M [Albuquerque, NM; Riblett, Jr., Loren E.; Green, Karl L [Albuquerque, NM; Hunter, John A [Albuquerque, NM; Cook, III, Robert N.; Stevens, James R [Arlington, VA

2012-05-22

Portable handheld real-time tracking and communications devices include; a controller module, communications module including global positioning and mesh network radio module, data transfer and storage module, and a user interface module enclosed in a water-resistant enclosure. Real-time tracking and communications devices can be used by protective force, security and first responder personnel to provide situational awareness allowing for enhance coordination and effectiveness in rapid response situations. Such devices communicate to other authorized devices via mobile ad-hoc wireless networks, and do not require fixed infrastructure for their operation.

Implementation of a Localization System for Sensor Networks

DTIC Science & Technology

2006-05-18

its N-point DFT is mathematically formulated as X[k] = N−1∑ n=0 x[n] W nkN , k = 0, 1, . . . , N − 1 (7.1) W knN = e −j(2π/N)kn (7.2) There are two...distributed ad-hoc wireless sensor networks. In Int. Conf. on Acoustics, Speech , and Signal Proc. (ICASSP), pages 2037 – 2040, Salt Lake City, UT. [18] J...Stability of recursive qrd-ls algorithms using finite- precision systolic array implementation. IEEE Trans. on Acoustics, Speech , and Signal Proc., 37(5

Mobile Tracking and Location Awareness in Disaster Relief and Humanitarian Assistance Situations

DTIC Science & Technology

2012-09-01

establishing mobile ad - hoc networks. Smartphones also have accelerometers that are used to detect any motion by the device. Furthermore, almost every...AVAILABILITY STATEMENT Approved for public release; distribution is unlimited 12b. DISTRIBUTION CODE A 13. ABSTRACT (maximum 200 words...Picture, Situational Awareness 15. NUMBER OF PAGES 55 16. PRICE CODE 17. SECURITY CLASSIFICATION OF REPORT Unclassified 18. SECURITY

Constraint Optimization Literature Review

DTIC Science & Technology

2015-11-01

COPs. 15. SUBJECT TERMS high-performance computing, mobile ad hoc network, optimization, constraint, satisfaction 16. SECURITY CLASSIFICATION OF: 17...Optimization Problems 1 2.1 Constraint Satisfaction Problems 1 2.2 Constraint Optimization Problems 3 3. Constraint Optimization Algorithms 9 3.1...Constraint Satisfaction Algorithms 9 3.1.1 Brute-Force search 9 3.1.2 Constraint Propagation 10 3.1.3 Depth-First Search 13 3.1.4 Local Search 18

Intelligent agent-based intrusion detection system using enhanced multiclass SVM.

PubMed

Ganapathy, S; Yogesh, P; Kannan, A

2012-01-01

Intrusion detection systems were used in the past along with various techniques to detect intrusions in networks effectively. However, most of these systems are able to detect the intruders only with high false alarm rate. In this paper, we propose a new intelligent agent-based intrusion detection model for mobile ad hoc networks using a combination of attribute selection, outlier detection, and enhanced multiclass SVM classification methods. For this purpose, an effective preprocessing technique is proposed that improves the detection accuracy and reduces the processing time. Moreover, two new algorithms, namely, an Intelligent Agent Weighted Distance Outlier Detection algorithm and an Intelligent Agent-based Enhanced Multiclass Support Vector Machine algorithm are proposed for detecting the intruders in a distributed database environment that uses intelligent agents for trust management and coordination in transaction processing. The experimental results of the proposed model show that this system detects anomalies with low false alarm rate and high-detection rate when tested with KDD Cup 99 data set.

Multi-criteria decision making development of ion chromatographic method for determination of inorganic anions in oilfield waters based on artificial neural networks retention model.

PubMed

Stefanović, Stefica Cerjan; Bolanča, Tomislav; Luša, Melita; Ukić, Sime; Rogošić, Marko

2012-02-24

This paper describes the development of ad hoc methodology for determination of inorganic anions in oilfield water, since their composition often significantly differs from the average (concentration of components and/or matrix). Therefore, fast and reliable method development has to be performed in order to ensure the monitoring of desired properties under new conditions. The method development was based on computer assisted multi-criteria decision making strategy. The used criteria were: maximal value of objective functions used, maximal robustness of the separation method, minimal analysis time, and maximal retention distance between two nearest components. Artificial neural networks were used for modeling of anion retention. The reliability of developed method was extensively tested by the validation of performance characteristics. Based on validation results, the developed method shows satisfactory performance characteristics, proving the successful application of computer assisted methodology in the described case study. Copyright © 2011 Elsevier B.V. All rights reserved.

Intelligent Agent-Based Intrusion Detection System Using Enhanced Multiclass SVM

PubMed Central

Ganapathy, S.; Yogesh, P.; Kannan, A.

2012-01-01

Intrusion detection systems were used in the past along with various techniques to detect intrusions in networks effectively. However, most of these systems are able to detect the intruders only with high false alarm rate. In this paper, we propose a new intelligent agent-based intrusion detection model for mobile ad hoc networks using a combination of attribute selection, outlier detection, and enhanced multiclass SVM classification methods. For this purpose, an effective preprocessing technique is proposed that improves the detection accuracy and reduces the processing time. Moreover, two new algorithms, namely, an Intelligent Agent Weighted Distance Outlier Detection algorithm and an Intelligent Agent-based Enhanced Multiclass Support Vector Machine algorithm are proposed for detecting the intruders in a distributed database environment that uses intelligent agents for trust management and coordination in transaction processing. The experimental results of the proposed model show that this system detects anomalies with low false alarm rate and high-detection rate when tested with KDD Cup 99 data set. PMID:23056036

DeepDeath: Learning to predict the underlying cause of death with Big Data.

PubMed

Hassanzadeh, Hamid Reza; Ying Sha; Wang, May D

2017-07-01

Multiple cause-of-death data provides a valuable source of information that can be used to enhance health standards by predicting health related trajectories in societies with large populations. These data are often available in large quantities across U.S. states and require Big Data techniques to uncover complex hidden patterns. We design two different classes of models suitable for large-scale analysis of mortality data, a Hadoop-based ensemble of random forests trained over N-grams, and the DeepDeath, a deep classifier based on the recurrent neural network (RNN). We apply both classes to the mortality data provided by the National Center for Health Statistics and show that while both perform significantly better than the random classifier, the deep model that utilizes long short-term memory networks (LSTMs), surpasses the N-gram based models and is capable of learning the temporal aspect of the data without a need for building ad-hoc, expert-driven features.

ReTrust: attack-resistant and lightweight trust management for medical sensor networks.

PubMed

He, Daojing; Chen, Chun; Chan, Sammy; Bu, Jiajun; Vasilakos, Athanasios V

2012-07-01

Wireless medical sensor networks (MSNs) enable ubiquitous health monitoring of users during their everyday lives, at health sites, without restricting their freedom. Establishing trust among distributed network entities has been recognized as a powerful tool to improve the security and performance of distributed networks such as mobile ad hoc networks and sensor networks. However, most existing trust systems are not well suited for MSNs due to the unique operational and security requirements of MSNs. Moreover, similar to most security schemes, trust management methods themselves can be vulnerable to attacks. Unfortunately, this issue is often ignored in existing trust systems. In this paper, we identify the security and performance challenges facing a sensor network for wireless medical monitoring and suggest it should follow a two-tier architecture. Based on such an architecture, we develop an attack-resistant and lightweight trust management scheme named ReTrust. This paper also reports the experimental results of the Collection Tree Protocol using our proposed system in a network of TelosB motes, which show that ReTrust not only can efficiently detect malicious/faulty behaviors, but can also significantly improve the network performance in practice.

Initial Report of the Deans Cyber Warfare Ad Hoc Committee

DTIC Science & Technology

2011-12-22

in a cyber warfare environment. Among the more notable recent developments have been the establishment of a new Cyber Warfare Command (USCYBERCOM) at...information-warfare-centric organization. Clearly, future Naval Academy graduates will be expected to know more about cyber warfare than those we have...graduated in the past. The Academic Dean and Provost tasked an ad hoc committeethe Cyber Warfare ad hoc Committeeto examine how USNA can best ensure that

Performance Evaluation of FAST TCP Traffic-Flows in Multihomed MANETs

NASA Astrophysics Data System (ADS)

Mudassir, Mumajjed Ul; Akram, Adeel

In Mobile Ad hoc Networks (MANETs) an efficient communication protocol is required at the transport layer. Mobile nodes moving around will have temporary and rather short-lived connectivity with each other and the Internet, thus requiring efficient utilization of network resources. Moreover the problems arising due to high mobility, collision and congestion must also be considered. Multihoming allows higher reliability and enhancement of network throughput. FAST TCP is a new promising transport layer protocol developed for high-speed high-latency networks. In this paper, we have analyzed the performance of FAST TCP traffic flows in multihomed MANETs and compared it with standard TCP (TCP Reno) traffic flows in non-multihomed MANETs.

Effective Ad-Hoc Committees.

ERIC Educational Resources Information Center

Young, David G.

1983-01-01

Ad-hoc committees may be symbolic, informational, or action committees. A literature survey indicates such committees' structural components include a suprasystem and three subsystems involving linkages, production, and implementation. Other variables include size, personal factors, and timing. All the factors carry implications about ad-hoc…

42 CFR 422.2262 - Review and distribution of marketing materials.

Code of Federal Regulations, 2010 CFR

2010-10-01

... HUMAN SERVICES (CONTINUED) MEDICARE PROGRAM MEDICARE ADVANTAGE PROGRAM Medicare Advantage Marketing... model materials. (d) Ad hoc enrollee communication materials. Ad hoc enrollee communication materials...

Wireless mesh networks.

PubMed

Wang, Xinheng

2008-01-01

Wireless telemedicine using GSM and GPRS technologies can only provide low bandwidth connections, which makes it difficult to transmit images and video. Satellite or 3G wireless transmission provides greater bandwidth, but the running costs are high. Wireless networks (WLANs) appear promising, since they can supply high bandwidth at low cost. However, the WLAN technology has limitations, such as coverage. A new wireless networking technology named the wireless mesh network (WMN) overcomes some of the limitations of the WLAN. A WMN combines the characteristics of both a WLAN and ad hoc networks, thus forming an intelligent, large scale and broadband wireless network. These features are attractive for telemedicine and telecare because of the ability to provide data, voice and video communications over a large area. One successful wireless telemedicine project which uses wireless mesh technology is the Emergency Room Link (ER-LINK) in Tucson, Arizona, USA. There are three key characteristics of a WMN: self-organization, including self-management and self-healing; dynamic changes in network topology; and scalability. What we may now see is a shift from mobile communication and satellite systems for wireless telemedicine to the use of wireless networks based on mesh technology, since the latter are very attractive in terms of cost, reliability and speed.

Virtual terrain: a security-based representation of a computer network

NASA Astrophysics Data System (ADS)

Holsopple, Jared; Yang, Shanchieh; Argauer, Brian

2008-03-01

Much research has been put forth towards detection, correlating, and prediction of cyber attacks in recent years. As this set of research progresses, there is an increasing need for contextual information of a computer network to provide an accurate situational assessment. Typical approaches adopt contextual information as needed; yet such ad hoc effort may lead to unnecessary or even conflicting features. The concept of virtual terrain is, therefore, developed and investigated in this work. Virtual terrain is a common representation of crucial information about network vulnerabilities, accessibilities, and criticalities. A virtual terrain model encompasses operating systems, firewall rules, running services, missions, user accounts, and network connectivity. It is defined as connected graphs with arc attributes defining dynamic relationships among vertices modeling network entities, such as services, users, and machines. The virtual terrain representation is designed to allow feasible development and maintenance of the model, as well as efficacy in terms of the use of the model. This paper will describe the considerations in developing the virtual terrain schema, exemplary virtual terrain models, and algorithms utilizing the virtual terrain model for situation and threat assessment.

Defense Acquisition and the Case of the Joint Capabilities Technology Demonstration Office: Ad Hoc Problem Solving as a Mechanism for Adaptive Change

DTIC Science & Technology

2013-04-01

Capabilities Technology Demonstration Office: Ad Hoc Problem Solving as a Mechanism for Adaptive Change Kathryn Aten and John T. Dillard Naval...Defense Acquisition and the Case of the Joint Capabilities Technology Demonstration Office: Ad Hoc Problem Solving as a Mechanism for Adaptive Change...describes the preliminary analysis and findings of our study exploring what drives successful organizational adaptation in the context of technology

Defense Acquisition and the Case of the Joint Capabilities Technology Demonstration Office: Ad Hoc Problem Solving as a Mechanism for Adaptive Change

DTIC Science & Technology

2013-10-01

pmlkploba=obmloq=pbofbp= Defense Acquisition and the Case of the Joint Capabilities Technology Demonstration Office: Ad Hoc Problem Solving as a...of the Joint Capabilities Technology Demonstration Office: Ad Hoc Problem Solving as a Mechanism for Adaptive Change 5a. CONTRACT NUMBER 5b. GRANT...findings of our study exploring what drives successful organizational adaptation in the context of technology transition and acquisition within the

Creating wi-fi bluetooth mesh network for crisis management applications

NASA Astrophysics Data System (ADS)

Al-Tekreeti, Safa; Adams, Christopher; Al-Jawad, Naseer

2010-04-01

This paper proposes a wireless mesh network implementation consisting of both Wi-Fi Ad-Hoc networks as well as Bluetooth Piconet/Scatternet networks, organised in an energy and throughput efficient structure. This type of networks can be easily constructed for Crises management applications, for example in an Earthquake disaster. The motivation of this research is to form mesh network from the mass availability of WiFi and Bluetooth enabled electronic devices such as mobile phones and PC's that are normally present in most regions were major crises occurs. The target of this study is to achieve an effective solution that will enable Wi-Fi and/or Bluetooth nodes to seamlessly configure themselves to act as a bridge between their own network and that of the other network to achieve continuous routing for our proposed mesh networks.

42 CFR 423.2262 - Review and distribution of marketing materials.

Code of Federal Regulations, 2010 CFR

2010-10-01

... HUMAN SERVICES (CONTINUED) MEDICARE PROGRAM VOLUNTARY MEDICARE PRESCRIPTION DRUG BENEFIT Part D...) Ad hoc enrollee communication materials. Ad hoc enrollee communication materials may be reviewed by...

Ad Hoc modeling, expert problem solving, and R&T program evaluation

NASA Technical Reports Server (NTRS)

Silverman, B. G.; Liebowitz, J.; Moustakis, V. S.

1983-01-01

A simplified cost and time (SCAT) analysis program utilizing personal-computer technology is presented and demonstrated in the case of the NASA-Goddard end-to-end data system. The difficulties encountered in implementing complex program-selection and evaluation models in the research and technology field are outlined. The prototype SCAT system described here is designed to allow user-friendly ad hoc modeling in real time and at low cost. A worksheet constructed on the computer screen displays the critical parameters and shows how each is affected when one is altered experimentally. In the NASA case, satellite data-output and control requirements, ground-facility data-handling capabilities, and project priorities are intricately interrelated. Scenario studies of the effects of spacecraft phaseout or new spacecraft on throughput and delay parameters are shown. The use of a network of personal computers for higher-level coordination of decision-making processes is suggested, as a complement or alternative to complex large-scale modeling.

Social media in Ebola outbreak.

PubMed

Hossain, L; Kam, D; Kong, F; Wigand, R T; Bossomaier, T

2016-07-01

The West African 2014 Ebola outbreak has highlighted the need for a better information network. Hybrid information networks, an integration of both hierarchical and formalized command control-driven and community-based, or ad hoc emerging networks, could assist in improving public health responses. By filling the missing gaps with social media use, the public health response could be more proactive rather than reactive in responding to such an outbreak of global concern. This article provides a review of the current social media use specifically in this outbreak by systematically collecting data from ProQuest Newsstand, Dow Jones Factiva, Program for Monitoring Emerging Diseases (ProMED) as well as Google Trends. The period studied is from 19 March 2014 (first request for information on ProMED) to 15 October 2014, a total of 31 weeks. The term 'Ebola' was used in the search for media reports. The outcome of the review shows positive results for social media use in effective surveillance response mechanisms - for improving the detection, preparedness and response of the outbreak - as a complement to traditional, filed, work-based surveillance approach.

Mashup Model and Verification Using Mashup Processing Network

NASA Astrophysics Data System (ADS)

Zahoor, Ehtesham; Perrin, Olivier; Godart, Claude

Mashups are defined to be lightweight Web applications aggregating data from different Web services, built using ad-hoc composition and being not concerned with long term stability and robustness. In this paper we present a pattern based approach, called Mashup Processing Network (MPN). The idea is based on Event Processing Network and is supposed to facilitate the creation, modeling and the verification of mashups. MPN provides a view of how different actors interact for the mashup development namely the producer, consumer, mashup processing agent and the communication channels. It also supports modeling transformations and validations of data and offers validation of both functional and non-functional requirements, such as reliable messaging and security, that are key issues within the enterprise context. We have enriched the model with a set of processing operations and categorize them into data composition, transformation and validation categories. These processing operations can be seen as a set of patterns for facilitating the mashup development process. MPN also paves a way for realizing Mashup Oriented Architecture where mashups along with services are used as building blocks for application development.

Mobile Ad Hoc Networks: An Evaluation of Smartphone Technologies

DTIC Science & Technology

2011-10-01

National Defence, 2011 c© Sa Majesté la Reine (en droit du Canada), telle que représentée par le ministre de la Défense nationale, 2011 Abstract A...déploiement de protocoles au cours d’opérations des FC ; 4. le développement d’une implémentation de validation de principe sur un téléphone

An Architecture for Enabling Migration of Tactical Networks to Future Flexible Ad Hoc WBWF

DTIC Science & Technology

2010-09-01

Requirements Several multiple access schemes TDMA OFDMA SC-OFDMA, FH- CDMA , DS - CDMA , hybrid access schemes, transitions between them Dynamic...parameters algorithms depend on the multiple access scheme If DS - CDMA : handling of macro-diversity (linked to cooperative routing) TDMA and/of OFDMA...Transport format Ciphering @MAC/RLC level : SCM Physical layer (PHY) : signal processing (mod, FEC, etc) CDMA : macro-diversity CDMA , OFDMA

Space-Time Processing for Tactical Mobile Ad Hoc Networks

DTIC Science & Technology

2010-05-01

Spatial Diversity and Imperfect Channel Estimation on Wideband MC- DS - CDMA and MC- CDMA " IEEE Transactions on Communications, Vol. 57, No. 10, pp. 2988...include direct sequence code division multiple access ( DS - CDMA ), Frequency Hopped (FH) CDMA and Orthogonal Frequency Division Multiple Access (OFDMA...capability, LPD/LPI, and operability in non-continuous spectrum. In addition, FH- CDMA is robust to the near-far problem, while DS - CDMA requires

Internet Governance and National Security

DTIC Science & Technology

2012-01-01

the conflict created by headline- grabbing exploits of ad hoc hacker networks or nation-state-inspired cor­ porate espionage.5 Malicious actors add...governance of critical Internet re­ sources and their impact on US national security are often overlooked. Foreign efforts to alter the technical...crime, espio­ nage, and other forms of cyber conflict rather than on the issues related to governance of critical Internet resources, development of

Leveraging Structural Characteristics of Interdependent Networks to Model Non-Linear Cascading Risks

DTIC Science & Technology

2013-04-01

and Teresa Wu, Arizona State University Eugene Rex Jalao, Arizona State University and University of the Philippines Christopher Auger, Lars Baldus...Institute of Technology The RITE Approach to Agile Acquisition Timothy Boyce, Iva Sherman, and Nicholas Roussel Space and Naval Warfare Systems Center...Demonstration Office: Ad Hoc Problem Solving as a Mechanism for Adaptive Change Kathryn Aten and John T . Dillard Naval Postgraduate School A

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

PubMed

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.

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

PubMed Central

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

2016-01-01

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

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

PubMed Central

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

2014-01-01

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

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

PubMed

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.

Ad Hoc Information Extraction for Clinical Data Warehouses.

PubMed

Dietrich, Georg; Krebs, Jonathan; Fette, Georg; Ertl, Maximilian; Kaspar, Mathias; Störk, Stefan; Puppe, Frank

2018-05-01

Clinical Data Warehouses (CDW) reuse Electronic health records (EHR) to make their data retrievable for research purposes or patient recruitment for clinical trials. However, much information are hidden in unstructured data like discharge letters. They can be preprocessed and converted to structured data via information extraction (IE), which is unfortunately a laborious task and therefore usually not available for most of the text data in CDW. The goal of our work is to provide an ad hoc IE service that allows users to query text data ad hoc in a manner similar to querying structured data in a CDW. While search engines just return text snippets, our systems also returns frequencies (e.g. how many patients exist with "heart failure" including textual synonyms or how many patients have an LVEF < 45) based on the content of discharge letters or textual reports for special investigations like heart echo. Three subtasks are addressed: (1) To recognize and to exclude negations and their scopes, (2) to extract concepts, i.e. Boolean values and (3) to extract numerical values. We implemented an extended version of the NegEx-algorithm for German texts that detects negations and determines their scope. Furthermore, our document oriented CDW PaDaWaN was extended with query functions, e.g. context sensitive queries and regex queries, and an extraction mode for computing the frequencies for Boolean and numerical values. Evaluations in chest X-ray reports and in discharge letters showed high F1-scores for the three subtasks: Detection of negated concepts in chest X-ray reports with an F1-score of 0.99 and in discharge letters with 0.97; of Boolean values in chest X-ray reports about 0.99, and of numerical values in chest X-ray reports and discharge letters also around 0.99 with the exception of the concept age. The advantages of an ad hoc IE over a standard IE are the low development effort (just entering the concept with its variants), the promptness of the results and the adaptability by the user to his or her particular question. Disadvantage are usually lower accuracy and confidence.This ad hoc information extraction approach is novel and exceeds existing systems: Roogle [1] extracts predefined concepts from texts at preprocessing and makes them retrievable at runtime. Dr. Warehouse [2] applies negation detection and indexes the produced subtexts which include affirmed findings. Our approach combines negation detection and the extraction of concepts. But the extraction does not take place during preprocessing, but at runtime. That provides an ad hoc, dynamic, interactive and adjustable information extraction of random concepts and even their values on the fly at runtime. We developed an ad hoc information extraction query feature for Boolean and numerical values within a CDW with high recall and precision based on a pipeline that detects and removes negations and their scope in clinical texts. Schattauer GmbH.

Next Generation RFID-Based Medical Service Management System Architecture in Wireless Sensor Network

NASA Astrophysics Data System (ADS)

Tolentino, Randy S.; Lee, Kijeong; Kim, Yong-Tae; Park, Gil-Cheol

Radio Frequency Identification (RFID) and Wireless Sensor Network (WSN) are two important wireless technologies that have wide variety of applications and provide unlimited future potentials most especially in healthcare systems. RFID is used to detect presence and location of objects while WSN is used to sense and monitor the environment. Integrating RFID with WSN not only provides identity and location of an object but also provides information regarding the condition of the object carrying the sensors enabled RFID tag. However, there isn't any flexible and robust communication infrastructure to integrate these devices into an emergency care setting. An efficient wireless communication substrate for medical devices that addresses ad hoc or fixed network formation, naming and discovery, transmission efficiency of data, data security and authentication, as well as filtration and aggregation of vital sign data need to be study and analyze. This paper proposed an efficient next generation architecture for RFID-based medical service management system in WSN that possesses the essential elements of each future medical application that are integrated with existing medical practices and technologies in real-time, remote monitoring, in giving medication, and patient status tracking assisted by embedded wearable wireless sensors which are integrated in wireless sensor network.

75 FR 20984 - Mid-Atlantic Fishery Management Council (MAFMC); Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-22

... Mid-Atlantic Fishery Management Council's (MAFMC) Ad Hoc Search Committee will hold a closed meeting... Executive Director. The Ad Hoc Search Committee will interview candidates for this position so as to...

78 FR 5190 - National Cancer Institute; Notice of Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-24

... Advisory Committee; Ad hoc Clinical Trials and Strategic Planning Subcommittee. Date: February 25, 2013... Group of the Ad hoc Clinical Trials Strategic Planning Subcommittee. Dial in number: 1-866-652-9542 and...

29 CFR 1912.11 - Terms of ad hoc committee members.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 29 Labor 7 2011-07-01 2011-07-01 false Terms of ad hoc committee members. 1912.11 Section 1912.11 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR (CONTINUED) ADVISORY COMMITTEES ON STANDARDS Organizational Matters § 1912.11 Terms of ad...

29 CFR 1912.11 - Terms of ad hoc committee members.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 29 Labor 7 2010-07-01 2010-07-01 false Terms of ad hoc committee members. 1912.11 Section 1912.11 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR (CONTINUED) ADVISORY COMMITTEES ON STANDARDS Organizational Matters § 1912.11 Terms of ad...

Cutting Corners: Provider Perceptions of Interpretation Services and Factors Related to Use of an Ad Hoc Interpreter.

PubMed

Mayo, Rachel; Parker, Veronica G; Sherrill, Windsor W; Coltman, Kinneil; Hudson, Matthew F; Nichols, Christina M; Yates, Adam M; Pribonic, Anne Paige

2016-06-01

This study assessed health providers' perceptions of factors related to professional interpretation services and the association between these factors and the potential use of ad hoc interpreters. Data were collected from a convenience sample of 150 health services providers at a large, regional health system in South Carolina. Providers rated "ability to communicate effectively during a clinical encounter" as paramount regarding the use of interpretation services. The most important factors related to the likely use of ad hoc interpreters (cutting corners) included locating a qualified interpreter, having to wait for a qualified interpreter, and technical difficulties regarding phone and video technology. Health care organizations may benefit from increasing staff awareness about patient safety and legal and regulatory risks involved with the use of ad hoc interpreters. © The Author(s) 2016.

Distributed Dynamic Host Configuration Protocol (D2HCP)

PubMed Central

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

2011-01-01

Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856

Distributed Dynamic Host Configuration Protocol (D2HCP).

PubMed

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

2011-01-01

Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment.

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

NASA Astrophysics Data System (ADS)

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.

UMI-tools: modeling sequencing errors in Unique Molecular Identifiers to improve quantification accuracy

PubMed Central

2017-01-01

Unique Molecular Identifiers (UMIs) are random oligonucleotide barcodes that are increasingly used in high-throughput sequencing experiments. Through a UMI, identical copies arising from distinct molecules can be distinguished from those arising through PCR amplification of the same molecule. However, bioinformatic methods to leverage the information from UMIs have yet to be formalized. In particular, sequencing errors in the UMI sequence are often ignored or else resolved in an ad hoc manner. We show that errors in the UMI sequence are common and introduce network-based methods to account for these errors when identifying PCR duplicates. Using these methods, we demonstrate improved quantification accuracy both under simulated conditions and real iCLIP and single-cell RNA-seq data sets. Reproducibility between iCLIP replicates and single-cell RNA-seq clustering are both improved using our proposed network-based method, demonstrating the value of properly accounting for errors in UMIs. These methods are implemented in the open source UMI-tools software package. PMID:28100584

Artificial neural networks in mammography interpretation and diagnostic decision making.

PubMed

Ayer, Turgay; Chen, Qiushi; Burnside, Elizabeth S

2013-01-01

Screening mammography is the most effective means for early detection of breast cancer. Although general rules for discriminating malignant and benign lesions exist, radiologists are unable to perfectly detect and classify all lesions as malignant and benign, for many reasons which include, but are not limited to, overlap of features that distinguish malignancy, difficulty in estimating disease risk, and variability in recommended management. When predictive variables are numerous and interact, ad hoc decision making strategies based on experience and memory may lead to systematic errors and variability in practice. The integration of computer models to help radiologists increase the accuracy of mammography examinations in diagnostic decision making has gained increasing attention in the last two decades. In this study, we provide an overview of one of the most commonly used models, artificial neural networks (ANNs), in mammography interpretation and diagnostic decision making and discuss important features in mammography interpretation. We conclude by discussing several common limitations of existing research on ANN-based detection and diagnostic models and provide possible future research directions.

An Efficient Framework Model for Optimizing Routing Performance in VANETs

PubMed Central

Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala

2018-01-01

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED). PMID:29462884

Impact of window decrement rate on TCP performance in an adhoc network

NASA Astrophysics Data System (ADS)

Suherman; Hutasuhut, Arief T. W.; Badra, Khaldun; Al-Akaidi, Marwan

2017-09-01

Transmission control protocol (TCP) is a reliable transport protocol handling end to end connection in TCP/IP stack. It works well in copper or optical fibre link, but experiences increasing delay in wireless network. Further, TCP experiences multiple retransmissions due to higher collision probability within wireless network. The situation may get worsen in an ad hoc network. This paper examines the impact half window or window reduction rate to the overall TCP performances. The evaluation using NS-2 simulator shows that the smaller the window decrement rate results the smaller end to end delay. Delay is reduced to 17.05% in average when window decrement rate decreases. Average jitter also decreases 4.15%, while packet loss is not affected.

Development of a low mobility IEEE 802.15.4 compliant VANET system for urban environments.

PubMed

Nazabal, Juan Antonio; Falcone, Francisco; Fernández-Valdivielso, Carlos; Matías, Ignacio Raúl

2013-05-29

The use of Vehicular Ad-Hoc Networks (VANETs) is growing nowadays and it includes both roadside-to-vehicle communication (RVC) and inter-vehicle communication (IVC). The purpose of VANETs is to exchange useful information between vehicles and the roadside infrastructures for making an intelligent use of them. There are several possible applications for this technology like: emergency warning system for vehicles, cooperative adaptive cruise control or collision avoidance, among others. The objective of this work is to develop a VANET prototype system for urban environments using IEEE 802.15.4 compliant devices. Simulation-based values of the estimated signal strength and radio link quality values are obtained and compared with measurements in outdoor conditions to validate an implemented VANET system. The results confirm the possibility of implementing low cost vehicular communication networks operating at moderate vehicular speeds.

Channel MAC Protocol for Opportunistic Communication in Ad Hoc Wireless Networks

NASA Astrophysics Data System (ADS)

Ashraf, Manzur; Jayasuriya, Aruna; Perreau, Sylvie

2008-12-01

Despite significant research effort, the performance of distributed medium access control methods has failed to meet theoretical expectations. This paper proposes a protocol named "Channel MAC" performing a fully distributed medium access control based on opportunistic communication principles. In this protocol, nodes access the channel when the channel quality increases beyond a threshold, while neighbouring nodes are deemed to be silent. Once a node starts transmitting, it will keep transmitting until the channel becomes "bad." We derive an analytical throughput limit for Channel MAC in a shared multiple access environment. Furthermore, three performance metrics of Channel MAC—throughput, fairness, and delay—are analysed in single hop and multihop scenarios using NS2 simulations. The simulation results show throughput performance improvement of up to 130% with Channel MAC over IEEE 802.11. We also show that the severe resource starvation problem (unfairness) of IEEE 802.11 in some network scenarios is reduced by the Channel MAC mechanism.

An Advanced Sensor Network Design For Subglacial Sensing

NASA Astrophysics Data System (ADS)

Martinez, K.; Hart, J. K.; Elsaify, A.; Zou, G.; Padhy, P.; Riddoch, A.

2006-12-01

In the Glacsweb project a sensor network has been designed to take sensor measurements inside glaciers and send the data back to a web server autonomously. A wide range of experience was gained in the deployment of the earlier systems and this has been used to develop new hardware and software to better meet the needs of glaciologists using the data from the system. The system was reduced in size, new sensors (compass, light sensor) were added and the radio communications system completely changed. The new 173MHz radio system was designed with an antenna tuned to work in ice and a new network algorithm written to provide better data security. Probes can communicate data through each other (ad-hoc network) and store many months of data in a large buffer to cope with long term communications failures. New sensors include a light reflection measurement in order to provide data on the surrounding material. This paper will discuss the design decisions, the effectiveness of the final system and generic outcomes of use to sensor network designers deploying in difficult environments.

Vehicle Density Based Forwarding Protocol for Safety Message Broadcast in VANET

PubMed Central

Huang, Jiawei; Wang, Jianxin

2014-01-01

In vehicular ad hoc networks (VANETs), the medium access control (MAC) protocol is of great importance to provide time-critical safety applications. Contemporary multihop broadcast protocols in VANETs usually choose the farthest node in broadcast range as the forwarder to reduce the number of forwarding hops. However, in this paper, we demonstrate that the farthest forwarder may experience large contention delay in case of high vehicle density. We propose an IEEE 802.11-based multihop broadcast protocol VDF to address the issue of emergency message dissemination. To achieve the tradeoff between contention delay and forwarding hops, VDF adaptably chooses the forwarder according to the vehicle density. Simulation results show that, due to its ability to decrease the transmission collisions, the proposed protocol can provide significantly lower broadcast delay. PMID:25121125

Molnets: An Artificial Chemistry Based on Neural Networks

NASA Technical Reports Server (NTRS)

Colombano, Silvano; Luk, Johnny; Segovia-Juarez, Jose L.; Lohn, Jason; Clancy, Daniel (Technical Monitor)

2002-01-01

The fundamental problem in the evolution of matter is to understand how structure-function relationships are formed and increase in complexity from the molecular level all the way to a genetic system. We have created a system where structure-function relationships arise naturally and without the need of ad hoc function assignments to given structures. The idea was inspired by neural networks, where the structure of the net embodies specific computational properties. In this system networks interact with other networks to create connections between the inputs of one net and the outputs of another. The newly created net then recomputes its own synaptic weights, based on anti-hebbian rules. As a result some connections may be cut, and multiple nets can emerge as products of a 'reaction'. The idea is to study emergent reaction behaviors, based on simple rules that constitute a pseudophysics of the system. These simple rules are parameterized to produce behaviors that emulate chemical reactions. We find that these simple rules show a gradual increase in the size and complexity of molecules. We have been building a virtual artificial chemistry laboratory for discovering interesting reactions and for testing further ideas on the evolution of primitive molecules. Some of these ideas include the potential effect of membranes and selective diffusion according to molecular size.