Energy conservation is an important issue in mobile ad hoc networks (MANET), where the terminals are always supplied with limited energy. A new routing protocol is presented according to the study on the influence of low-energy nodes in ad hoc networks. The novel routing protocol (energy sensing routing protocol, ESRP) is based on the energy sensing strategy. Multiple strategy routing and substitute routing are both adopted in this paper. Referring to the level of the residual energy and the situation of energy consumption, different routes are chosen for packets transmission. The local maintenance is adopted, which can reduce packets retransmission effectively when the link breaks. We focus on the network lifetime most in all performances. The evaluation is done in comparison with other routing protocols on NS2 platform, and the simulation results show that this routing protocol can prolong the network lifetime and balance energy consumption effectively.

The Medium Access Control (MAC) protocol that uses non-overlapping multiple channels, called the multi-channel MAC protocol, was proposed in order to increase the capacity of ad hoc networks. Since the number of packet interfaces on each node is less than the number of channels in ad hoc networks in general, the node needs to select a suitable channel for data transmission. This means that the multi-channel MAC protocol must be provided with a good channel selection algorithm. In this paper, we design a channel selection algorithm called Conditionally Randomized Channel Selection (CRCS) based on Extended Receiver Directed Transmission (xRDT) protocol that only uses one packet interface. Briefly, CRCS uses the acitve channel for data transmission until the amount of data packets reaches a threshold, at which point it selects one of the available channels other than the active channel. Although CRCS is a very simple channel selection algorithm, by using network simulator we find that CRCS is effective to increase the capacity of ad hoc networks and to keep the load balance of all channels compared to the other channel selection algorithms.

In this paper, we present a 0.18-µm CMOS fully integrated X-band shock wave generator (SWG) with an on-chip dipole antenna and a digitally programmable delay circuit (DPDC) for pulse beam-formability in short-range and hand-held microwave active imaging applications. This chip includes a SWG, a 5-bit DPDC and an on-chip wide-band meandering dipole antenna. By using an integrated transformer, output pulse of the SWG is sent to the on-chip meandering dipole antenna. The SWG operates based on damping conditions to produce a 0.4-V peak-to-peak (p-p) pulse amplitude at the antenna input terminals in HSPICE simulation. The DPDC is designed to adjust delays of shock-wave outputs for the purpose of steering beams in antenna array systems. The wide-band dipole antenna element designed in the meandering shape is located in the top metal of a 5-metal-layer 0.18-µm CMOS chip. By simulating in Momentum of ADS 2009, the minimum value of antenna's return loss, S 11, and antenna's bandwidth (BW) are -19.37 dB and 25.3 GHz, respectively. The measured return loss of a stand-alone integrated meandering dipole is from -26 dB to -10 dB with frequency range of 7.5-12 GHz. In measurements of the SWG with the integrated antenna, by using a 20-dB standard gain horn antenna placed at a 38-mm distance from the chip's surface, a 1.1-mVp-p shock wave with a 9-11-GHz frequency response is received. A measured 3-ps pulse delay resolution is also obtained. These results prove that our proposed circuit is suitable for the purpose of fully integrated pulse beam-forming system.

This paper proposes a new Ad-Hoc network system which comprises the multiple relay access points (APs) with multi channels. Ad-Hoc network systems are recently proposed and incorporated for the communication infrastructure, which relays wireless transmission among access points (APs) in wireless LAN (WLAN) system. System throughput is decreased due to hidden terminal problem when only a single channel is used for the Ad-Hoc network. In order to solve this problem, a new system with multi channels is proposed. However, even if the multi channels are employed, the co- and/or adjacent-channel interference occurs due to hidden terminal problem and multiple APs in a limited space, when considering a simultaneous transmit and reception at the relay AP. In this paper, we develop an Ad-Hoc network testbed which can reduce and avoid co- and/or adjacent-channel interference by using vertically arranged antenna configuration and distributed channel allocation scheme. Moreover, the effectiveness of our testbed is clarified by applying actual WLAN signals.

Network Coding (NC) can improve the information transmission efficiency and throughput of data networks. Random Linear Network Coding (RLNC) is a special form of NC scheme that is easy to be implemented. However, quantifying the performance gain of RLNC over conventional Store and Forward (S/F)-based routing system, especially for wireless network, remains an important open issue. To solve this problem, in this paper, based on abstract layer network architecture, we build a dynamic random network model with Poisson distribution describing the nodes joining the network randomly for tree-based single-source multicast in MANET. We then examine its performance by applying conventional Store and Forward with FEC (S/F-FEC) and RLNC methods respectively, and derive the analytical function expressions of average packet loss rate, successful decoding ratio and throughput with respect to the link failure probability. An experiment shows that these expressions have relatively high precision in describing the performance of RLNC. It can be used to design the practical network coding algorithm for multi-hop multicast with tree-based topology in MANET and provide a research tool for the performance analysis of RLNC.

This letter proposes a simple k-hop flooding scheme for the temporarily lost child node of a multicast tree in a mobile ad hoc network where a group of nodes move together within a bound. Through simulation, we show that our scheme improves the packet delivery ratio of MAODV to be comparable to the epidemic routing with only small additional duplicate packets.

This letter presents an analytical study of the reverse link Erlang capacity of 3G/Ad Hoc Integrated networks. In the considered integrated network, 3G networks and Ad Hoc networks operate over the same frequency band and hence cause interference to each other. The reverse link Erlang capacity is analyzed and discussed in two cases: Ad Hoc networks use and do not use power control.

Recently in ad hoc networks, routing schemes using location information which is provided by GPS (Global Position System) have been proposed. However, many routing schemes using location information assume that a source node has already known the location information of the destination node and they do not adapt to large ad hoc networks. On another front, the autonomous clustering scheme has been proposed to construct the hierarchical structure in ad hoc networks and adapt to large ad hoc networks. However, even when the hierarchical structure is introduced, there is some problem. The data delivery ratio becomes lower as the node speed becomes higher, and clusterheads have much overhead in the hierarchical routing scheme based on the autonomous clustering scheme. In order to cope with these problems, this paper proposes a new Hierarchical Geographical Routing with Alternative Paths (Hi-GRAP) using the autonomous clustering scheme and shows the effectiveness of the proposed hierarchical geographical routing in comparison with GPSR, Hi-AODV and AODV through simulation experiments with respect to the amount of control packets and the data delivery ratio.

One of the most important duties of government is to maintain safety. In 2007, the Ministry of Internal Affairs and Communications of Japan tested 16 different models of a safety support system for children on school routes. One of the models was constructed and tested at a school in an area of the city of Hiroshima from September to December of 2007. A consortium was established by the city of Hiroshima; Hiroshima City University; Chugoku Electric Power Co., Inc.; and KDDI Corporation to conduct this project. For the model project, we developed a new safety support system for children on school routes by using a mobile ad hoc network constructed from mobile phones with the Bluetooth function. About 500 students and 50 volunteers used this system for four months. The support system provided good performance and accuracy in maintaining the safety of students on the way to school [7]. The basic idea of the safety support system is the grouping of children and volunteers using a mobile ad hoc network. In this paper, we present an outline of this system and evaluate the performance of grouping and the effectiveness of our approach.

This paper proposes a new kind of communication system for air traffic control over the oceans; it is particularly effective at handling high air traffic loads due to many oceanic flights. In this system, each aircraft position report is sent to its relevant ground station by forwardly relaying them via a multi hop ad-hoc network that is formed by the aircraft between this aircraft and the ground station. In addition, an effective multiple access scheme with optimal values is also proposed. This scheme enables the various aircraft involved in relaying the signal to operate autonomously in a flight-route airspace. Furthermore, two useful schemes are proposed for efficient timeslot reuse and timeslot assignment in cases of low aircraft densities: the position aided timeslot reuse (PATR) and distance based timeslot assignment (DBTA), respectively. Finally, another scheme is proposed to improve the achievable relayed packet rate under low aircraft densities, which is called interference-based node selection (IB-NS). In all, the proposed system combined with those three schemes show the availability to utilize this system for air traffic control communications, specifically on high traffic ocean routes.

Workflow technology has spread over the wide areas which require process control (e.g. logistics and e-business) or resource coordination (e.g. cooperative work and grid computing). Among various types of workflow, we introduce a case of ad-hoc workflow process in a Korean telecom company. Since such a service process is generally accompanied with customer's participation, the procedure and state are flexibly changed and sometimes capricious to cope with customer's request and operator's unexpected situation. In case of network service provisioning or problem shooting processes, customers often request the changes of their service types or visit appointments, which result in flexible and adaptive management of the process instances. In this paper, we present a novel approach to workflow modeling based on modified ECA rules (named P-ECA) for the purpose of ad-hoc workflow process modeling. The rule-based workflow modeling is comprehensible to engineers and can be implemented in programs at ease; therefore it is expected that it can be widely adopted for the ad-hoc and adaptive workflow modeling which requires dynamic changes of its states by internal or external events.

The safety applications for cooperative driving in VANETs, typically require the dissemination of safety-related information to all vehicles with high reliability and a strict timeline. However, due to the high vehicle mobility, dynamic traffic density, and a self-organized network, Safety message dissemination has a special challenge to efficiently use the limited network resources to satisfy its requirements. With this motivation, we propose a novel broadcasting protocol referred to as congestion awareness multi-hop broadcasting (CAMB) based loosely on a TDMA-like transmission scheduling scheme. The proposed protocol was evaluated using different traffic scenarios within both a realistic channel model and an 802.11p PHY/MAC model in our simulation. The simulation results showed that the performance of our CAMB protocol was better than those of the existing broadcasting protocols in terms of channel access delay, packet delivery ratio, end-to-end delay, and network overhead.

Many people have suffered and died due to a lot of large-scale disasters such as earthquake, fire, and terrorism, etc. In disasters where most evacuators become panic, two things are necessary for their immediate evacuation. The first is to estimate the location of the disaster occurrence. The second is to construct an evacuation support system that searches for safe and efficient evacuation routes. In this paper, we propose Emergency Rescue Urgent Communication -- Evacuation Support System (EUC-ESS) based on Mobile Ad-hoc networks (MANET) composed of many mobile terminals. Using experiments and computer simulations, we show that this system would support evacuators in determining appropriate routes for survivors.

Multi-hop wireless ad hoc networks suffer from temporary link error due to fading. In order to improve packet transmission reliability and achieve efficient transmission in fading environment, a new cognitive temporary bypassing scheme is proposed based on a cross-layer approach and cognitive behavior of local nodes. The proposed scheme enables neighboring nodes to prepare and create a temporary bypass for lost-packets. This is done by monitoring message packets that include information of the multi-hop route and link-acknowledgement. The scheme also includes an anti-collision function that is necessary to prevent contention among multiple bypassing nodes. Packet success probability with the proposed scheme is studied both by theoretical analysis and time-domain computer simulation for Rayleigh faded single- and multi-hop links. Network simulation using a modified QualNet simulator validate that packet success probability is remarkably improved with the scheme for maximum Doppler frequencies up to 30 Hz.

Data query is one of the most important issues in wireless ad hoc networks, since the ultimate goal of these networks is to support efficient data sharing among wireless nodes. In this paper, we study the issue of data query for delay-sensitive applications in dense wireless ad hoc networks. We focus our attention on step-by-step expanding ring-based data query, which provides an upper bound on query delay to any expanding ring based query strategies. Two replication strategies including Index Replication (IR) and Data Replication (DR) are considered, to improve the delay performance of data query. We analyze the probabilistic behavior of query delay for both DR and IR by theoretical methods, and develop analytical models to approximate the minimum number of replicas required for both query strategies if an application-specified delay bound is imposed. Our work is validated through extensive simulations.

Developing an adaptive 3-dimensional (3D) topology control algorithm is important because most wireless nodes are mobile and deployed in buildings. Moreover, in buildings, wireless link qualities and topologies change frequently due to various objects and the interference from other wireless devices. Previous topology control algorithms can suffer significant performance degradation because they only use the Euclidean distance for the topology construction. In this paper, we propose a novel adaptive 3D topology control algorithm for wireless ad-hoc sensor networks, especially in indoor environments. The proposed algorithm adjusts the minimum transmit power adaptively with considering the interference effect. To construct the local topology, each node divides the 3D space, a sphere centered at itself, into k equal cones by using Platonic solid (i.e., regular k-hedron) and selects the neighbor that requires the lowest transmit power in each cone. Since the minimum transmit power values depend on the effect of interferences, the proposed algorithm can adjust topology adaptively and preserve the network connectivity reliably. To evaluate the performance of algorithms, we conduct various experiments with simulator and real wireless platforms. The experimental results show that the proposed algorithm is superior to the previous algorithms in terms of the packet delivery ratio and the energy consumption with relatively low complexity.

This paper proposes multipoint-to-multipoint (MPtoMP) real-time broadcast transmission using network coding for ad-hoc networks like video game networks. We aim to achieve highly reliable MPtoMP broadcasting using IEEE 802.11 media access control (MAC) that does not include a retransmission mechanism. When each node detects packets from the other nodes in a sequence, the correctly detected packets are network-encoded, and the encoded packet is broadcasted in the next sequence as a piggy-back for its native packet. To prevent increase of overhead in each packet due to piggy-back packet transmission, network coding vector for each node is exchanged between all nodes in the negotiation phase. Each user keeps using the same coding vector generated in the negotiation phase, and only coding information that represents which user signal is included in the network coding process is transmitted along with the piggy-back packet. Our simulation results show that the proposed method can provide higher reliability than other schemes using multi point relay (MPR) or redundant transmissions such as forward error correction (FEC). We also implement the proposed method in a wireless testbed, and show that the proposed method achieves high reliability in a real-world environment with a practical degree of complexity when installed on current wireless devices.

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.

Wireless ad hoc network is one of the most suitable platforms for providing communication services to support mobile applications in public areas where no fixed communication infrastructure exists. However, due to the open nature of wireless links and lack of security infrastructure in an ad hoc network environment, applications operating on ad hoc network platforms are subjected to non-trivial security challenges. Asymmetric key management, which is widely adopted to be an effective basis for security services in an open network environment, typically plays a crucial role in meeting the security requirements of such applications. In this paper, we propose a secure asymmetric key management scheme, the Ubiquitous and Secure Certificate Service (USCS), which is based on a variant of the Distributed Certificate Authority (DCA) - the Fully Distributed Certificate Authority (FDCA). Similar to FDCA, USCS introduces the presence of 1-hop neighbors which hold shares of DCA's private signature key, and can collaborate to issue certificates, thereby providing asymmetric key management service. Both USCS and FDCA aim to achieve higher availability than the basic DCA scheme; however, USCS is more secure than FDCA in that the former achieves high availability by distributing existing shares to new members, rather than generating new shares as the FDCA scheme does. In order to realise the high availability potential of USCS, a share selection algorithm is also proposed. Experimental results demonstrated that USCS is a more secure approach of the DCA scheme in that it can achieve stronger security than FDCA while attaining high availability similar to that of FDCA. Experiments also showed that USCS incurs only moderate communication overheads.

Based on game theory, a distributed power control algorithm with sequential subchannel nulling is proposed for ad-hoc networks. It is shown that the proposed method, by sharing subchannels appropriately according to the interference profiles, can reduce the power consumption of the network while satisfying the target rate of each link.