Search results

To utilize Bluetooth as a layer 2 multi‐hop subnet for global IP network, there are two missing protocols in current Bluetooth stack: network formation and routing. In this paper, we propose our network formation and routing protocols optimized for such Bluetooth subnset usage scenarios to fill this gap. In this paper, we first present some observations on performance degradations of Bluetooth PAN due to network topologies and topology change when radio independant protocols are implemented. And then we analyze the reason of performance degradation. Based on our analysis, we first propose a flexible scatternet formation algorithm under conference scenario for multi‐hop communication. By using proposed method, scatternet can be formed flexibly with star, mesh, or linked line based on several parameters like number of maximum piconets that a gateway Bluetooth device can participate, and whether loops are needed in the resulting scatternet to achieve better network performance. To utilize topology information in multi‐hop communication, we propose a Cross‐layer Optimized Routing for Bluetooth (CORB) CORB is a QoS‐extended AODV routing protocol with mainly two optimizations between networking layer and underlying Bluetooth MAC layer. The first optimization is to use a new load metric. (LM) in QoS routing protocol instead of number of hops in conventional best effort routing. LM is derived from estimation of nodes’ link bandwidth, which reflects the different roles of nodes in Bluetooth scatternet. This proposal helps routing protocol to bypass heavily loaded nodes, and find route with larger bandwidth. The second optimization is to adjust LM and some MAC layer parameters in response to the unstable network topology caused by movement and change of indoor radio condition. Finally, We present some simulation and experiment results based on implementation, which prove the effectiveness of our protocols.

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided Routing (P‐LAR) protocol. Simulation study and analytical results of P‐LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.

Secure communication is very important for computer networks. Thereby, authentication is one of the most eminent preconditions. In ad hoc networks, common authentication schemes are not applicable since public key infrastructures with a centralized certification authority are hard to deploy in ad hoc networking environments. This paper aims to investigate these issues.

In order to overcome these issues, the paper proposes and evaluates a security concept based on a distributed certification facility. Thereby, a network is divided into clusters with one special head node each. These cluster head nodes perform administrative functions and hold shares of a network key used for certification. New nodes start to participate in the network as guests; they can only become full members with a network‐signed certificate after their authenticity has been warranted by some other members. Access to resources and services within the ad hoc network is controlled using authorization certificates.

The feasibility of this concept was verified by simulations. Three different models for node mobility were used in order to include realistic scenarios as well as to make the results comparable to other work. The simulation results include an evaluation of the log‐on times, availability, and communication overhead.

The paper introduces a cluster‐based architecture to realize a distributed public key infrastructure that is highly adapted to the characteristics of ad hoc networks.

A Bluetooth scatternet is a network topology that is formed by inter‐connecting piconets. A piconet is a starshaped ad‐hoc networking unit that can accommodate eight Bluetooth devices, a master and up to seven slaves. By designating certain piconet nodes as bridges, or gateways, we can interconnect piconets by forcing the bridge nodes to interleave their participation in multiple piconets. Bridge nodes form an auxiliary relay connection between adjacent piconet masters and are fundamental for establishing scatternets. In this paper we present a new fault‐tolerant approach to scatternet formation that is selfhealing and operates in a multi‐hop environment. Our Bluetooth Distributed Scatternet Formation Protocol (BTDSP) establishes a flat scatternet topology, allows incremental node arrival, and automatically heals scatternet partitions by re‐incorporating disconnected nodes. By maintaining neighbor associations in soft state, existing links can also be re‐established quickly upon disconnection due to intermittent wireless connectivity. By only using slave/slave bridges, the algorithm is resilient to both node failure and wireless interference. It also prevents time‐slot waste due to master/slave bridges being away from their piconets.

To solve the above problems and ensure the stability of the ad hoc network node topology in the process of wireless signal transmission, this paper aims to design a robust adaptive sliding film fault-tolerant controller under the nonlinear distortion of signal transmission in an amorphous flat air-to-ground wireless ad hoc network system.

This paper designs a robust adaptive sliding film fault-tolerant controller under the nonlinear distortion of signal transmission in an amorphous flat air-to-ground wireless ad hoc network system.

The simulation results show that the amorphous flat wireless self-organizing network system has good nonlinear distortion fault-tolerant correction ability under the feedback control of the designed controller, and the system has the asymptotically stable convergence ability; the test results show: the node topology of the self-organizing network structural stability is significantly improved, which provides a foundation for the subsequent realization of long-distance transmission of ad hoc network nodes.

Because of the chosen research approach, the research results may lack generalizability. Therefore, researchers are encouraged to test the proposed propositions further.

The controller can extract the fault information caused by nonlinear distortion in the wireless signal transmission process, and at the same time, its feedback matrix K can gradually converge the generated wireless signal error to zero, to realize the stable transmission of the wireless signal.

Multimedia applications such as digital audio and video have stringent quality of service (QoS) requirement in mobile ad hoc network. To support wide range of QoS, complex routing protocols with multiple QoS constraints are necessary. In QoS routing, the basic problem is to find a path that satisfies multiple QoS constraints. Moreover, mobility, congestion and packet loss in dynamic topology of network also leads to QoS performance degradation of protocol.

In this paper, the authors proposed a multi-path selection scheme for QoS aware routing in mobile ad hoc network based on fractional cuckoo search algorithm (FCS-MQARP). Here, multiple QoS constraints energy, link life time, distance and delay are considered for path selection.

The experimentation of proposed FCS-MQARP is performed over existing QoS aware routing protocols AOMDV, MMQARP, CS-MQARP using measures such as normalized delay, energy and throughput. The extensive simulation study of the proposed FCS-based multipath selection shows that the proposed QoS aware routing protocol performs better than the existing routing protocol with maximal energy of 99.1501 and minimal delay of 0.0554.

This paper presents a hybrid optimization algorithm called the FCS algorithm for the multi-path selection. Also, a new fitness function is developed by considering the QoS constraints such as energy, link life time, distance and delay.

The decoupling and asynchrony properties of the content‐based publish‐subscribe paradigm makes it very appealing for dynamic wireless networks, like those that often occur in pervasive computing scenarios. Unfortunately, most of the currently available content‐based publish‐subscribe middleware do not fit the requirements of such extreme scenarios, in which the network is subject to very frequent topological reconfigurations due to mobility of nodes. In this paper we propose a protocol for content‐based message dissemination tailored to Mobile Ad Hoc Networks (MANETs) showing frequent topological changes. Message routing occurs without the support of any network‐wide dispatching infrastructure thus eliminating the need of maintaining such infrastructure on top of a physical network continuously changing its topology. The paper reports an extensive simulation study that confirms the suitability of the proposed approach along with a stochastic analysis of the central mechanism adopted by the protocol.

The purpose of this paper is to review the existing routing algorithms for wireless ad hoc networks to evaluate the methods according to the current requirements. Wireless ad hoc network can provide communication in emergency situations. Active nodes in ad hoc network work as sender, receiver and router at the same time. Nodes are equipped with limited bandwidth and energy. Optimal routing method can help in “smart use” of available resources. Evolvement of routing method based on need is a continuous process. Numerous applications of ad hoc network motivates researcher for further development to fulfill the need of society.

In this paper, routing algorithms for ad hoc network based on ant colony optimization, multipath routing and with multiple input multiple output (MIMO) antenna support have been discussed.

Comparative analysis has been drawn among existing algorithms of different categories. Transmitting message packets parallel through multiple paths in the network can save overall resource usage in the network.

The authors have discussed the future area of development for optimal routing in ad hoc networks. Considering signal noise ratio and congestion status while selecting path can provide better energy use in the network. Rather than leaving less prioritized route paths, multiple paths can be used for sending data packets parallel.

This paper aims to propose a system for automatically forming ad hoc networks using mobile phones and battery-powered wireless routers for emergency situations. The system also provides functions to send emergency messages and identify the location of victims based on the network topology information.

Optimized link state routing protocol is used to instantly form an ad hoc emergency network based on WiFi signals from mobile phones of the victims, backup battery-powered wireless routers preinstalled in buildings and mobile devices deployed by search and rescue teams. The proposed system is also designed to recover from partial crash of network and nodes lost.

Experimental results demonstrate the effectiveness of the proposed system in terms of battery life, transmission distance and noises.

A novel message routing schedule is proposed for conserving battery life. A novel function to estimate the location of a mobile device which sent an emergency message is proposed in this paper.

Group communication has become increasing important in mobile ad hoc networks (MANET). Current multicast routing protocols in MANET have been shown to incur large overheads due to dynamic network topology. To this end, this paper proposes an overlay multicast scheme in MANET that is more efficient.

The approach is to construct an overlay multicast tree based on the locations of the group nodes. The paper proposes several tree construction algorithms, namely, location‐guided k‐ary (LGK) tree, location‐guided directional (LGD) tree and location‐guided Steiner (LGS) tree. All of them rely on the geometric locations of the nodes as heuristics to construct the tree. The paper also introduces several mechanisms to enhance the proposed algorithms.

The simulation results show that the location‐guided heuristics is very effective in constructing low bandwidth cost overlay multicast trees in MANET. When location information is up‐to‐date, the bandwidth cost of a LGS tree is similar to that of an optimal router‐assisted Steiner multicast tree. When location information is out‐dated, LGD tree has the lowest cost.

This paper demonstrates the effectiveness of location‐guided heuristics in constructing overlay multicast trees in MANET. This study strongly suggests that location‐guided heuristics can be used to design many other algorithms in a mobile network.