Design and Performance Analysis of Genetic Algorithms for Topology Control Problems

In this dissertation, we present a bio-inspired decentralized topology control mechanism, called force-based genetic algorithm (FGA), where a genetic algorithm (GA) is run by each autonomous mobile node to achieve a uniform spread of mobile nodes and to provide a fully connected network over an unknown area. We present a formal analysis of FGA in terms of convergence speed, uniformity at area coverage, and Lyapunov stability theorem. This dissertation emphasizes the use of mobile nodes to achieve a uniform distribution over an unknown terrain without a priori information and a central control unit. In contrast, each mobile node running our FGA has to make its own movement direction and speed decisions based on local neighborhood information, such as obstacles and the number of neighbors, without a centralized control unit or global knowledge. We have implemented simulation software in Java and developed four different testbeds to study the effectiveness of different GA-based topology control frameworks for network performance metrics including node density, speed, and the number of generations that GAs run. The stochastic behavior of FGA, like all GA-based approaches, makes it difficult to analyze its convergence speed. We built metrically transitive homogeneous and inhomogeneous Markov chain models to analyze the convergence of our FGA with respect to the communication ranges of mobile nodes and the total number of nodes in the system. The Dobrushin contraction coefficient of ergodicity is used for measuring convergence speed for homogeneous and inhomogeneous Markov chain models of our FGA. Furthermore, convergence characteristic analysis helps us to choose the nearoptimal values for communication range, the number of mobile nodes, and the mean node degree before sending autonomous mobile nodes to any mission. Our analytical and experimental results show that our FGA delivers promising results for uniform mobile node distribution over unknown terrains. Since our FGA adapts to local environment rapidly and does not require global network knowledge, it can be used as a real-time topology controller for commercial and military applications

A Network Topology Control and Identity Authentication Protocol with Support for Movable Sensor Nodes

It is expected that in the near future wireless sensor network (WSNs) will be more widely used in the mobile environment, in applications such as Autonomous Underwater Vehicles (AUVs) for marine monitoring and mobile robots for environmental investigation. The sensor nodes’ mobility can easily cause changes to the structure of a network topology, and lead to the decline in the amount of transmitted data, excessive energy consumption, and lack of security. To solve these problems, a kind of efficient Topology Control algorithm for node Mobility (TCM) is proposed. In the topology construction stage, an efficient clustering algorithm is adopted, which supports sensor node movement. It can ensure the balance of clustering, and reduce the energy consumption. In the topology maintenance stage, the digital signature authentication based on Error Correction Code (ECC) and the communication mechanism of soft handover are adopted. After verifying the legal identity of the mobile nodes, secure communications can be established, and this can increase the amount of data transmitted. Compared to some existing schemes, the proposed scheme has significant advantages regarding network topology stability, amounts of data transferred, lifetime and safety performance of the network

Reducing energy consumption in mobile ad-hoc sensor networks

PhD ThesisRecent rapid development of wireless communication technologies and portable mobile devices such as tablets, smartphones and wireless sensors bring the best out of mobile computing, particularly Mobile Ad-hoc Sensor Networks (MASNETs). MASNETs are types of Mobile Ad-hoc Networks (MANETs) that are designed to consider energy in mind because they have severe resource constraints due to their lack of processing power, limited memory, and bandwidth as in Wireless Sensor Networks (WSNs). Hence, they have the characteristics, requirements, and limitations of both MANETs and WSNs. There are many potential applications of MASNETs such as a real-time target tracking and an ocean temperature monitoring. In these applications, mobility is the fundamental characteristic of the sensor nodes, and it poses many challenges to the routing algorithm. One of the greatest challenge is to provide a routing algorithm that is capable of dynamically changing its topology in the mobile environment with minimal consumption of energy. In MASNETs, the main reason of the topology change is because of the movement of mobile sensor nodes and not the node failure due to energy depletion. Since these sensor nodes are limited in power supply and have low radio frequency coverage, they easily lose their connection with neighbours, and face diffi culties in updating their routing tables. The switching process from one coverage area to another consumes more energy. This network must be able to adaptively alter the routing paths to minimize the effects of variable wireless link quality, topological changes, and transmission power levels on energy consumption of the network. Hence, nodes prefer to use as little transmission power as necessary and transmit control packets as infrequently as possible in energy constrained MASNETs. Therefore, in this thesis we propose a new dynamic energy-aware routing algorithm based on the trans- mission power control (TPC). This method effectively decreases the average percentage of packet loss and reduces the average total energy consumption which indirectly pro- long the network lifetime of MASNETs. To validate the proposed protocol, we ran the simulation on the Avrora simulator and varied speed, density, and route update interval of mobile nodes. Finally, the performance of the proposed routing algorithm was measured and compared against the basic Ad-hoc On-demand Distance Vector (AODV) routing algorithm in MASNETs.The Ministry of Education of Malaysia: The Universiti Malaysia Sarawak

Cross-layer Balanced and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks

For improving the efficiency and the reliability of the opportunistic routing algorithm, in this paper, we propose the cross-layer and reliable opportunistic routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the improved efficiency fuzzy logic and humoral regulation inspired topology control into the opportunistic routing algorithm. In CBRT, the inputs of the fuzzy logic system are the relative variance (rv) of the metrics rather than the values of the metrics, which reduces the number of fuzzy rules dramatically. Moreover, the number of fuzzy rules does not increase when the number of inputs increases. For reducing the control cost, in CBRT, the node degree in the candidate relays set is a range rather than a constant number. The nodes are divided into different categories based on their node degree in the candidate relays set. The nodes adjust their transmission range based on which categories that they belong to. Additionally, for investigating the effection of the node mobility on routing performance, we propose a link lifetime prediction algorithm which takes both the moving speed and moving direction into account. In CBRT, the source node determines the relaying priorities of the relaying nodes based on their utilities. The relaying node which the utility is large will have high priority to relay the data packet. By these innovations, the network performance in CBRT is much better than that in ExOR, however, the computation complexity is not increased in CBRT.Comment: 14 pages, 17 figures, 31 formulas, IEEE Sensors Journal, 201

Optimized topology control in mobile IP networks using a new parametric routing algorithm

When some intermediate nodes fail or are suddenly removed in a mobile IP network, a node failure can disconnect paths and decrease network efficiency due to loss of some packets. In this case, the movement of the remaining nodes must be controlled such that to prevent further network efficiency drop. In the present research, we will study the intermediate node failure and changing foreign networks in mobile IP networks when the Mobile Node (MN) moves. Then, a new optimal routing algorithm is proposed to make up the node failure and changing Foreign Agent (FA). For this purpose, an Optimal Parametric Topology Control Routing (OPTCR) algorithm is introduced based on parametric linear programming formulation (LPF). Since OPTCR can handle the handover latency, it is supposed that both destination and intermediate nodes can move but just intermediate nodes may fail. Simulation results show that OPTCR algorithm is superior to some algorithms appeared in the recent literature