Blueweb is a self-organizing Bluetooth-based multihop network equipped with a scatternet formation algorithm and a modified source routing protocol. In this paper, we first review the basic Blueweb network. Then we focus on a heuristic automatic configuration algorithm which can be used to partition a large-scale Blueweb network. This algorithm contains three main functional blocks including route master selection, node assignment, and subnet number decision. The route master selection block selects new route masters at a low computation cost. The node assignment block assigns nodes to each newly configured subnet in order to minimize the average route query cost. The subnet number decision block determines the optimal number of subnet which achieves the largest system performance improvement ratio at minimum operation cost. With these three functional blocks, optimal network configuration for Blueweb routing protocol can be determined. Computer simulations show that a configured Blueweb achieves higher network capacity than an unconfigured Blueweb.
Jenn-Hwan TARNG Bing-Wen CHUANG Fang-Jing WU
The dynamics of Mobile Ad-hoc NETworks (MANETs), as a consequence of mobility of mobile hosts, pose a problem in finding stable multi-hop routes for communication between a source and a destination. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of MANETs. In this paper, a novel stability-based ad hoc routing protocol, which is named as Ad-hoc On-demand Stability Vector (AOSV) routing protocol, is proposed to properly and effectively discover stable routes with high data throughput and long lifetime by considering the radio propagation effect on signal strength. Here, a stochastic mobile-to-mobile radio propagation model is proposed to predict path loss as well as received signal strength between adjacent nodes, and the estimation of link/route stability is derived from the prediction of signal strength. With awareness of link and route stabilities, a path finding algorithm is designed to explore the stable route with largest route stability for a source and destination pair. The performance of AOSV protocol is compared with the well-known Ad-hoc On-demand Distance Vector (AODV) routing protocol and other related works. Simulation results indicate that the AOSV routing protocol leads to significant throughput increases up to 70% improvement comparing to AODV, and provides better performance than related works.
Masashi YOSHIDA Minoru TERADA Tetsuya MIKI
This paper presents sector based flooding (SBF) and adaptive sector-based flooding (ASBF) that are flooding methods for mobile ad hoc networks using position information. SBF, which divides the communication area of a sender node into sectors, allows only the node nearest to a sector representative position in each sector to rebroadcast a packet. SBF is divided into two methods, SBF-1 and SBF-2; the difference is the number of criteria used to decide whether to rebroadcast or to drop the packet. In ASBF, each node selects a flooding method from among SBF-1, SBF-2, and pure flooding, depending on its local node density. The node density is obtained from the distance between the sector representative position and its nearest node. Simulation results show that SBF reduces the number of packet transmissions generated in flooding and ASBF has high packet reachability with few packet transmissions.
Masanori TAKATA Masaki BANDAI Takashi WATANABE
This paper addresses the issue of deafness in MAC (Medium Access Control) protocols for wireless ad hoc networks using directional antennas. Directional antennas are expected to provide significant improvements over omni-directional antennas in ad hoc networks, such as high spatial reuse and range extension. Recently, several MAC protocols using directional antennas, typically referred to as directional MAC protocols, have been proposed for ad hoc networks. However, directional MAC protocols inherently introduce new kinds of problems arising from directivity. One major problem is deafness, caused by a lack of state information of neighbor nodes, whether idle or busy. This paper proposes DMAC/DA (Directional MAC with Deafness Avoidance) to overcome the deafness problem. DMAC/DA modifies the previously proposed MAC protocol, MDA (MAC protocol for Directional Antennas), to reduce the number of control messages and also maintain the ability to handle deafness. In DMAC/DA, WTS (Wait To Send) frames are simultaneously transmitted by the transmitter and the receiver after the successful exchange of directional RTS (Request To Send) and CTS (Clear To Send) to notify the on-going communication to potential transmitters that may experience deafness. The experimental results show that DMAC/DA outperforms existing directional MAC protocols, such as DMAC (Directional MAC) and MDA, in terms of throughput, control overhead and packet drop ratio under the different values of parameters such as the number of flows and the number of beams. In addition, qualitative evaluation of 9 MAC protocols is presented to highlight the difference between DMAC/DA and existing MAC protocols.
TheinLai WONG Tatsuhiro TSUCHIYA Tohru KIKUNO
This letter proposes a broadcast scheme for use in ad hoc networks using variable-range transmission power. Preserving energy and ensuring a high delivery ratio of broadcast packets are crucial tasks for broadcasting in ad hoc networks. Using individual broadcast relaying nodes to dynamically vary the transmission range can help saving power and reduce interference during communication. We analyzed the performance of the proposed scheme and compared it to other prevalent broadcast schemes for wireless ad hoc networks based on common-range transmission power.
Ad hoc DMAC protocols have been proposed to improve spatial reuse, but directional transmissions have the problem of deafness. In the ToneDMAC protocol [9], an omnidirectional out-of-band tone after transmitting DATA or ACK mitigates deafness, but cannot prevent the interference packets caused by retransmissions to node in deafness. In this paper, we propose a dual-tone DMAC protocol with the out-of-band start-tone and stop-tone. In the proposed MAC protocol, a start-tone prevents retransmissions to node in deafness and decreases the packet collision probability. Throughput performance of the proposed MAC protocol is confirmed by simulations using Qualnet ver. 3.8 simulator.
YoungHo PARK Hwangjun SONG KyungKeun LEE CheolSoo KIM SangGon LEE SangJae MOON
A secure and efficient route discovery protocol is proposed for ad hoc networks, where only one-way hash functions are used to authenticate nodes in the ROUTE REQUEST, while additional public-key cryptography is used to guard against active attackers disguising a node in the ROUTE REPLY.
Azman-Osman LIM Susumu YOSHIDA
We develop an enrichment protocol, called a 2-hop Path Selection Protocol (2PSP) for a set of nodes, in which data can be sent faster using adaptive rate control capability of IEEE 802.11a/b/g MAC protocol via a relaying concept than via a direct connection. The main objective of this protocol is to build upon opportunistic rate adaptation in order to assist a sender, a relay node, and a receiver to reach a higher rate data transmission through Medium Access Control (MAC) layer relaying. We propose a relay mechanism to further improve the performance of 2PSP protocol. In the relay mechanism, new contention window, called a Short Backoff Internal (SBI) is applied for a set of relay nodes. A potential node that succeeds as a relay is allowed to send a Ready-To-Relay (RTR) message. In this paper, two collision resolution algorithms are proposed to deal with the case when the potential relay node is more than one. Simulation results indicate that the proposed 2PSP protocol can achieve high reduction of delay and power consumption and also an improvement in the throughput compared to both Receiving-based Auto Rate (RBAR) and Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocols.
Yasuhisa TAKIZAWA Peter DAVIS Makoto KAWAI Hisato IWAI Akira YAMAGUCHI Sadao OBANA
The location information of ubiquitous objects is one of the key issues for context-aware systems. Therefore, several positioning systems to obtain precise location information have been researched. However, they have scalability and flexibility problems because they need completely configured space with a large number of sensors. To avoid the problems, we proposed a self-organizing location estimation method that uses ad hoc networks and Self-Organizing Maps and needs no prepared space with a large number of sensors. But, as in other similar precise localization methods, the proposed method needs advanced distance measurements unavailable to conventional wireless communication systems. In this paper, the self-organizing location estimation method's modification for distance measurement that uses received signal strength available to conventional wireless communication systems but which fluctuates uncertainly, is described and location estimation accuracy with the modified method is shown.
Choonhwa LEE Sumi HELAL Wonjun LEE
This letter presents a new gossip-based ad hoc service discovery protocol that uses a novel decentralized, peer-to-peer mechanism to provide mobile devices with the ability to advertise and discover services in an efficient way. Our performance study shows that the proposed protocol appropriately addresses the need of proximal service discovery over a dynamic wireless medium.
Hong-Seok CHOI Hee-Jung BYUN Jong-Tae LIM
IEEE 802.11 MAC is the most commonly used MAC layer protocol in multi-hop ad hoc networks. When the network load becomes heavy, the throughput performance of IEEE 802.11 MAC is decreased because of the high collision rates and the low spatial reuse of the channel. In this letter, we analyze the throughput of multi-hop ad hoc networks and propose a supervisory control framework to maximize the throughput.
Joseph Chee Ming TEO Chik How TAN
Secure communication in Mobile Ad Hoc Networks (MANETs) is important as nodes communicate over the wireless medium, which can be easily eavesdropped. Currently, the literature of secure IP address autoconfiguration in MANETs is extremely rare. In this paper, we propose five protocols that provide both secure IP address autoconfiguration and authenticated group key agreement (GKA) to give a more efficient and secure solution for MANET communications. Whenever a dynamic group membership event such as node join, node leave, network merge and network partition occurs, our protocols ensure that the IP address allocation table and group key are updated so that there are no address conflicts and leaving and joining users cannot decrypt future and previous communications respectively. A complexity analysis shows that despite having additional capabilities such as IP address autoconfiguration and key authentication, our protocols are still efficient when compared to other GKA protocols.
Hong-Seok CHOI Hee-Jung BYUN Jong-Tae LIM
In this letter, we suggest a rate-based supervisory congestion control scheme for the ad hoc networks that use TCP as the transport protocol. This scheme makes it possible for the TCP sender to distinguish the causes of packet loss. In addition, this scheme guarantees the fair sharing of the available bandwidth among the connections. We show the reliability of our scheme by using the supervisory control framework and simulations confirm the effectiveness of our scheme.
Previous routing algorithms for mobile ad-hoc networks (MANETs) have focused on finding short-distance path(s) between communicating nodes. However, due to the dynamic and unreliable communication nature of MANETs, previously determined paths can easily become disconnected. Although dynamic routing can be used to circumvent this problem, determining a new route each time a packet needs to be sent involves a lot of overhead. An alternative form of dynamic routing involves maintaining valid routes in routing tables, which can be dynamically updated whenever network changes are detected. This paper proposes a new routing algorithm, referred to as pseudo-distance routing (PDR), that supports efficient routing table maintenance and dynamic routing based on such routing tables.
Han NAMGOONG Dongman LEE Dukyun NAM
The Minimum Connected Dominating Set (MCDS) reduces the number of messages to destinations and the finding MCDS is considered as a NP-hard problem. Alzoubi's approximation algorithm is known as the best in terms of message-optimal CDS construction, but not for mobility management. We present a message-efficient mobility management scheme based on distributed spanning trees. The proposed method may generate more messages than Alzoubi's for message delivery, but it consumes significantly fewer messages for mobility management (to the ratio of 2.5). Thus, when highly mobile networks are assumed, the proposed scheme outperforms Alzoubi's in terms of total number of messages.
A radio network (RN for short) is a distributed system with no central arbiter, consisting of n radio transceivers, henceforth referred to as stations. We assume that the stations run on batteries and expends power while broadcasting/receiving a data packet. Thus, the most important measure to evaluate protocols on the radio network is the number of awake time slots, in which a station is broadcasting/receiving a data packet. We also assume that the stations are identical and have no unique ID number, and no station knows the number n of the stations. For given n keys one for each station, the ranking problem asks each station to determine the number of keys in the RN smaller than its own key. The main contribution of this paper is to present an optimal randomized ranking protocol on the k-channel RN. Our protocol solves the ranking problem, with high probability, in O(+log n) time slots with every station being awake for at most O(log n) time slots. We also prove that any randomized ranking protocol is required to run in expected Ω(+log n) time slots with at least one station being awake for expected Ω(log n) time slots. Therefore, our ranking protocol is optimal.
Jacir Luiz BORDIM Yasuaki ITO Koji NAKANO
In this work we present an energy efficient leader election protocol for anonymous radio network populated with n mobile stations. Previously, Nakano and Olariu have presented a leader election protocol that terminates, with probability exceeding 1- (f ≥ 1), in log log n+o(log log n)+O(log f) time slots [14]. As the above protocol works under the assumption that every station has the ability to transmit and monitor the channel at the same time, it requires every station to be equipped with two transceivers. This assumption, however, is unrealistic for most mobile stations due to constraints in cost, size, and energy dissipation. Our main contribution is to show that it is possible to elect a leader in an anonymous radio network where each station is equipped with a single transceiver. Quite surprisingly, although every station has only one transceiver, our leader election protocol still runs, with probability exceeding 1- (f ≥ 1), in log log n+o(log log n)+O(log f) time slots. Moreover, our leader election protocol needs only expected O(n) total awake time slots, while Nakano and Olariu's protocol needs expected O(nlog log n) total awake time slots. Since every leader election protocol needs at least Ω(n) awake time slots, our leader election protocol is optimal in terms of the expected awake time slots.
Takeshi MURAKAMI Masaki BANDAI Iwao SASASE
In this paper, we propose Split Multi-path Routing protocol with Load Balancing policy (SMR-LB) to improve TCP performance in mobile ad hoc networks. In SMR-LB, each intermediate node records how many primary paths are attempted to construct as well as which source nodes attempt to construct the primary path. Each intermediate node decides which primary path should be constructed by using the primary path and the source node ID information. As a result, SMR-LB can balance the loads and so reduce the probability of congestion and avoid the continuous link breakage time between the specific source and destination pair. Computer simulation results show that SMR-LB can improve TCP performance compared with the conventional protocols.
Makoto TAKIZAWA Hiroto AIDA Masato SAITO Yoshito TOBE Hideyuki TOKUDA
In this paper, we present a novel forwarding scheme to enhance communication stability based on geographic routing in mobile ad hoc networks, which is called "Position-based Heuristic Forwarding" (PHF). For alternative solutions to traditional ad hoc routings, many geographic routing algorithms have been proposed. Most of the existing routings impose a certain restriction, planarity, on the graph structure of network for delivering messages to destination definitely. PHF achieves the guaranteed packet delivery over Unit Disk Graph, which is more widely employed graph model for the study of ad hoc networks. Accordingly, to eliminate the restriction of the routing algorithms enhances the probability to deliver messages successfully in networks with high nodes' mobility rate. In the simulation of PHF, we have evaluated the performance comparisons between PHF and its related work, Greedy Perimeter Stateless Routing (GPSR) and Dynamic Source Routing (DSR), which are the prominent geographic and conventional topology-based routing protocols, respectively. The results show that PHF provides higher packet delivery success rate indicating better communication stability and equal or less overhead than these work.
This letter presents a simple but accurate analytical model to evaluate the throughput of IEEE 802.11 distributed coordination function in non-saturated conditions. The influence of offered load on the throughput of both basic and RTS/CTS access mechanisms are analyzed and compared. It's shown that basic access scheme can achieve the same maximal throughput as that of RTS/CTS mechanism in non-saturated conditions while the latter is robust to the number of contending stations compared to basic mechanism. The analytical results are validated by extensive simulations.