An Optimal RPC Based Approach to Increase Fault in Wireless Ad-Hoc Network

Fault-tolerant interference-aware topology control in multi-radio multi-channel wireless mesh networks

Topology control is an important problem in wireless ad-hoc sensor networks. The aim of the topology control is to maintain desired properties of the network topology to improve the performance of networking algorithms (e.g. routing). In this paper, we present a distributed algorithm for assigning minimum possible power to all the nodes in the wireless sensor networks, such that the network is K-connected. Extensive simulation has been performed to prove the optimality of the algorithm

A wireless ad hoc network is composed of several tiny and inexpensive device such as wireless sensor networks (WSNs) which have limited energy. In this network energy, efficiency is one of the most crucial requirements. Data transmitting in minimum power level is one way of maximizing energy efficiency. Thus, transmission power level of nodes should be managed in a smart way to improve energy efficiency. Topology control is one of the main algorithms used in a wireless network to decrease transmission power level while preserving network connectivity. Topology control could improve energy efficiency by reasonably tuning the transmission power level while preserving network connectivity in order to increase network capacity and lifetime. In pursuit of energy efficiency and connectivity, nodes can be selfish and are conflicting with each other. Therefore to overcome the conflict, game theory is used to construct energy efficient topology, as well as minimizing energy consumption. In this paper, the main goal and most recent energy efficient topology control algorithms in WSNs and ad hoc network are classified and studied according to their specific goals.

Topology control algorithms in wireless Ad Hoc networks can be divided into two categories according to optimization goal, they are geometry structure and energy efficiency. The former constructs the network topology on the basis of geometry structure; the latter focuses on the energy efficiency of network. Based on abundant literature, this paper summarizes the recent situation of Ad Hoc network topology control field, introduces theories, properties and process of some typical topology control algorithms.

The application of information and wireless technologies, multisensor and biosensor devices, as well as sensor networks based on them to control the parameters of technological processes in different industries makes it possible to greatly improve the quality of final products and reduce losses of raw materials at all stages of production and storage. This covers both the industrial production of consumer goods and the food and processing industry. The article describes the developing and testing of network of wireless smart biosensor devices for food industry, namely for controlling the quality of wine, wine materials and food products in the production process. It is considered the technological process of production of wine materials and wine, as well as parameters that are subject of controlling. The requirements for smart multisensor devices, which are reasonable to use in such technological productions, are formulated. Measuring nodes are built on the basis of amperometric sensors and wireless data transmission units. Structural, functional and principle schemas of measuring devices were developed. The design documentation was created for their production at contract factories. The integration of wireless data transmission units into measuring nodes made it possible to build wireless sensor networks based on them. Several structures of wireless networks were developed on the base of wireless nodes with different functionality and with using of different wireless data transmission protocols. Hardware and software for wireless network nodes were developed. It was fulfilled the testing of the multisensor measuring node in autonomous mode, as well as the whole network consisting of several wireless nodes. The test results showed both the weaknesses of the developed devices, which should be eliminated in further researches, and the reasonability of using smart multisensor devices and networks based on them to control the quality of wine materials and wine at different stages of their production and storage. The work was performed with the support and within the Complex program of scientific research of the National Academy of Sciences of Ukraine "Smart" sensor devices of the new generation based on modern materials and technologies." Keywords: biosensors, amperometric transducers, smart multisensors, wireless sensor network, wine and food quality control.

The year 2005 witnesses the third occasion that the Wireless Personal Area and Ad-hoc Networks minitrack is part of the annual HICSS conference. This year there was a substantial increase in submissions (thus a substantial decrease in the acceptance rate), indicating the growing importance of research in this area. The minitrack is also focused on fundamental challenges and issues arising in wireless sensor networks and their applications. Wireless sensor networks differ from other wireless networks in the need for unattended and very low-energy operation, in the possibility of collaboration and distributed sensor calibration, and in the mission oriented nature of most sensor networks. Thus our mini track looks at two very important streams of research. After a strict review process nine papers were selected to be included in the program of the minitrack. The first paper is titled “BT-Crowds: Crowds-style Anonymity with Bluetooth and Java,” presenting an interesting idea on how anonymity can be achieved when sending messages in WPAN environments. Our second paper revisits scatternet formation issues of Bluetooth based ad hoc networks thus the title: “A Dynamic and Distributed Scatternet Formation Protocol for Real-life Bluetooth Scatternets.” The third paper is titled “Secure Dynamic Source Routing” and presents a new variant of the DSR routing protocol with special emphasis on security. In the fourth paper, the discussion concerns “Routing Based Feedback towards Applications in Mobile Ad Hoc Networks,” where routing notifications are relayed via event channels. “A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks” is the title of the fifth paper in the minitrack. It presents some innovative ideas on how location information can be managed for multicast communications in ad-hoc networks. In the sixth paper, “Sliding Window Protocol for Secure Group Communication in Ad Hoc Networks,” the authors propose a sliding window protocol for determining multiple routes in a multi-communications environment. In the seventh paper titled “Ad Hoc Routing Protocol Avoiding Route Breaks Based on AODV,” the authors propose improvements to the well-known AODV ad hoc routing protocol The eight paper, “Joint Scheduling and Routing Algorithm for Ad Hoc Wireless,” presents an innovative and interesting idea wrapped around an iterative algorithm on power control. In the final paper of the minitrack, “Performance Issues of Ad Hoc Routing Protocols in a Network Scenario used for VideoPhone Applications,” the authors present a simulation based performance analysis of different ad hoc routing protocols using the application pointed to in the title. These papers highlight some of the issues and work towards solutions in Personal Area and ad hoc networks which are among the most active research fields in wireless networking. We believe that the papers will provide opportunities for researchers to come together and discuss and debate the results of the interesting experiments that are described in the papers. We are confident that the minitrack will achieve its goal of bringing together leading researchers, to present new results and discuss synergies between the two areas. We also take this opportunity to thank all the reviewers for their valuable and professional work as well as all the authors who submitted papers and thus helped us to create such a strong minitrack. We would also like to express our sincere gratitude to the conference organizers for their hard work and help.

Wireless networking is a crucial component of communication in this era of digitization. The key characteristics that determine a wireless network's performance are smooth connectivity, quicker communication, and increased customer satisfaction. Scalability deals with the erratic workload and new resources that are added to the network. Scalability is crucial for both Quality of Experience (QoE) and Quality of Service (QoS) in such a power-constrained environment because wireless devices are battery-operated. Managing power consumption and network performance simultaneously in scalable networking scenario is quite challenging, especially during handover. This research proposed a methodology to assess the impact of scalability on wireless node power consumption and network performance in order to develop energy-efficient handoff mechanisms. The Type-I and Type-II wireless node sets were used between the WiFI and WiMAX networks in a vertical handover scenario. In the study, two distinct scalability scenarios were taken into account. Three distinct voltage levels—cutoff voltage, nominal voltage, and charge voltage —had been used to examine the consumption of power. Throughput, residual energy, and Packet Delivery Ratio (PDR) were computed to examine the network's performance in a scalable, power-constrained context. Two different scalability scenarios were considered in the study. The power consumption was investigated using three different voltage levels: charge voltage, nominal voltage, and cutoff voltage. The network's performance under scalable, power-constrained conditions was investigated by computing throughput, packet delivery ratio (PDR), and residual energy. The result obtained in the study showed the variation in battery drainage of wireless nodes under the effect of various scalability factors. This study will provide a blueprint for developing novel algorithms which eventually will improvise network performance and strengthen the base of Green Networking.

Loss of control accounts for over 25% of aircraft accidents worldwide. This study presents a fault tolerant flight control strategy for increasing aircraft safety. The work has been undertaken within the Action Group on fault tolerant control (FTC) of the European GARTEUR programme, which develops collaborative efforts in Europe to create new FTC technologies that could significantly advance the goals of the aviation safety. After the fault detection and confirmation by the in-flight dedicated systems, a compensation loop is activated to ensure safe recovery. The design of the FTC loop is achieved without any changes in the nominal (and certificated) flight control system (FCS). The FTC scheme design is formulated as an H∞ strong stabilisation problem. Fault compensability is subsequently discussed and formulated as a trim-deficiency analysis problem. The proposed technique is implemented on the SIMONA flight simulator and evaluated through a pilot experiment. The tested scenario corresponds to the landing approach of a large transport aircraft (B747-100/200). The faulty situation is related to trimmable horizontal stabiliser (THS) failures. Piloted flight simulator experiments show that fault tolerance can be achieved under the condition that there exists sufficient remaining control authority.

In the application system of Internet of things, it is widely used in wireless network node location information and positioning. According to the principle and strategy of wireless network node positioning, this paper classifies various wireless network node positioning methods, and expounds and explains the principles of various common positioning systems and technologies under the topology environment of wireless network and wireless local area network. Node location in wireless network is a process in which nodes determine the location information of other nodes in the network according to the location information of a few known nodes in the network through location technology algorithm and strategy. This paper analyzes the characteristics and performance of positioning technology based on signal strength in wireless network, and explains the application of positioning algorithm in wireless network.

2008 14th IEEE International Conference on Parallel and Distributed Systems, ICPADS'08, Melbourne, VIC, 8-10 December 2008

As a virtual backbone structure, connected dominating sets (CDSs) play an important role in topology control for wireless networks. In this paper, we develop a distributed self-stabilizing CDS construction algorithm under the SINR model (also known as the physical interference model), a more practical yet more challenging interference model for distributed algorithm design. Specifically, we propose a randomized distributed algorithm that can construct a CDS in O (log n) timeslots with a high probability, where n is the total number of nodes in the network. The constructed CDS achieves constant approximation in both density and diameter. To the best of our knowledge, this is the first known asymptotically optimal self-stabilizing result in terms of both density and diameter for distributed CDS construction under the practical SINR model.

In wireless ad hoc network, the resource of wireless node is limited, such as energy, computer ability and bandwidth. However, topology control can improve performance of network. The planar topology structure helps to transmit packets for nodes. The most of them before are fixed. The adjustable planar structures existed are only for homogeneous wireless network. In this paper, we present a t-adjustable planar structure for heterogeneous wireless ad hoc network which enables nodes to adjust the topology independently and allows nodes to have different path loss exponent. We show properties of TAPH by simulation or proof: (1) it preserves the network connectivity; (2) the average out degree and average link length of nodes become small when the parameter t becomes large; (3) the topology generated by TAPH preserves the network bi-directionality.

Message ferrying is a technique for routing data in wireless and mobile networks in which one or more mobile nodes are tasked with storing and carrying data between sources and destinations. To achieve connectivity between all nodes, message ferries may need to relay data to each other. While useful as a routing technique for wireless mobile networks in general, message ferrying is particularly useful in intermittently connected networks where traditional MANET routing protocols are not usable. A wireless and mobile network is said to possess intrinsic message ferrying capability if a subset of the nodes can act as message ferries by virtue of their own mobility pattern, without introducing additional nodes or modifying existing node mobility. Our goal in this work is to provide a formalism by which one can characterize intrinsic message ferrying capability. We first observe that the use of message ferries is the mobile generalization of the well-known use of connected dominating set-based routing in wireless networks. We next consider the problem of identifying the set of nodes in a mobile network which can act as message ferries by virtue of their mobility pattern. To this end, we define the concept of a connected message ferry dominating set (CMFDS) in a manner that achieves data delivery within certain performance bounds. We then develop algorithms that can be used to find such a set within a mobile, wireless network. The general CMFDS algorithm is built around a core algorithm that determines whether a single node in the network can act as a ferry. We provide some illustrative examples to show the application of our algorithm to several mobility patterns.

In wireless mobile ad-hoc networks, data packets have to be relayed hop by hop from a given source node to a destination node. This means that some or all of the mobile nodes must accept to forward information for the benefit of other nodes. It has been shown by F. Nait-Abdesselam, et al., (2003) that this ability of forwarding packets leads to a new unfairness problem in wireless ad-hoc networks, where a node which is forwarding other node's packets gets less bandwidth, for its own use, than a node which is not participating to the routing service. The proposed RAMAC scheme by F. Nait-Abdesselam, et al., (2003), has shown all its effectiveness to cope with this unfairness problem. However, an extra bandwidth is sometimes allowed to the routing node's own traffic comparing to other nonrouting node's own traffics, and the routing node's routed traffic gets much less bandwidth. This is explained by the fact that at the upper layer (for instance the IP layer) does not differentiate between the routing and the own traffics, and that the multiplicative factor used to compute the new contention window is too aggressive. In this paper, an enhanced RAMAC scheme is proposed, by taking into account the differentiation on top of the MAC layer, between the and routed traffics within a routing node, and by smoothing the multiplicative factor used to compute the new contention window. The simulation results obtained showed a good improvement of the original RAMAC scheme, leading to better approximate equal bandwidth share among all the mobile nodes in the wireless ad-hoc network.

In Wireless Ad-hoc Networks, nodes co-operate among themselves to forward data packets from a source node to a destination node. Nodes may participate in route discovery or route maintenance process but refuse to forward packets due to presence of faulty hardware or software or to save their resources, such as, battery power and bandwidth. Detection and isolation of misbehavior nodes are important issues to improve the quality of communication service and to save resources of well behaving wireless nodes. In this work, firstly, a neighbor Overhearing based Misbehavior Detection(OMD) scheme is proposed. In OMD, each node overhears the transmissions of its neighbors and calculates packet forwarding ratio of its own as well as its neighbors. Source node uses the calculated information to identify a misbehaving node. Secondly, an Autonomous Agent based Misbehavior Detection( AAMD) technique is proposed. In AAMD, past behavior of nodes in the network is used as a metric to calculate the selection probability of a node. An agent residing at a node is activated using the activation key generated by a trusted third party to verify the misbehavior of the node. The proposed schemes reduce communication overheads and identification delays to detect misbehaving nodes in wireless ad-hoc network. Simulation results are presented to evaluate the performance of the proposed OMD and AAMD schemes.