A design of variable transmission power control for wireless ad-hoc network

Includes bibliography.Wireless Ad-hoc Network has emanated to be a promising network paradigm that can handle last mile technology due to unprecedented growth of internet users. This network is promising because it extends network to remote areas such as congested environments, rural environments etc. It is known that nodes involved in Wireless Ad-hoc Network rely on battery energy as their source of power. Energy consumption has become one of the major challenges experienced in Wireless Ad-hoc Network, which must be properly tackled. This could be traced to the effect of transmission power on the nodes in the network. Transmission power largely determines the amount of energy consumed by each node in the network. Therefore, a power control technique must be adopted in order to manage and select the optimal transmission power with respect to distance. This transmission power must be sufficient to transfer information from one node to another. Literature have proposed different algorithms for power control technique in Wireless Ad-hoc Network. Some researchers looked at the power control technique in terms of minimising energy consumed from different perspectives, which include power aware routing and power control topology management. However, most of these algorithms were applied at different layers in OSI model such as physical layer, data link layer, network layer and application layer. To achieve a reduced energy consumption at each node in the network, a novel algorithm for transmission power control was designed to select optimal transmission power. The proposed algorithm was designed in such a way that it selects transmission power based on the distance between the nodes without affecting the network throughput. Graph theory is used in this research to model the network topology, and transmission power with respect to the distance

Models and Protocols for Resource Optimization in Wireless Mesh Networks

Wireless mesh networks are built on a mix of fixed and mobile nodes interconnected via wireless links to form a multihop ad hoc network. An emerging application area for wireless mesh networks is their evolution into a converged infrastructure used to share and extend, to mobile users, the wireless Internet connectivity of sparsely deployed fixed lines with heterogeneous capacity, ranging from ISP-owned broadband links to subscriber owned low-speed connections. In this thesis we address different key research issues for this networking scenario. First, we propose an analytical predictive tool, developing a queuing network model capable of predicting the network capacity and we use it in a load aware routing protocol in order to provide, to the end users, a quality of service based on the throughput. We then extend the queuing network model and introduce a multi-class queuing network model to predict analytically the average end-to-end packet delay of the traffic flows among the mobile end users and the Internet. The analytical models are validated against simulation. Second, we propose an address auto-configuration solution to extend the coverage of a wireless mesh network by interconnecting it to a mobile ad hoc network in a transparent way for the infrastructure network (i.e., the legacy Internet interconnected to the wireless mesh network). Third, we implement two real testbed prototypes of the proposed solutions as a proof-of-concept, both for the load aware routing protocol and the auto-configuration protocol. Finally we discuss the issues related to the adoption of ad hoc networking technologies to address the fragility of our communication infrastructure and to build the next generation of dependable, secure and rapidly deployable communications infrastructures

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

A novel Ferry Assisted Greedy Perimeter Stateless Routing Protocol (FA-GPSR) for Ad-hoc networks in remote locations

Network functionalities play a major role in the connectivity and routing in an Ad-hoc networks because end user devices must contribute in routing and therefore maintain connectivity. In dynamic environments with mobile nodes, routing becomes very challenging; this challenge becomes even more burdensome if a network is deployed in larger areas. Therefore, in order to avoid centralisation and bottlenecks, routing algorithms in Ad-hoc networks should not depend on any specific node. Furthermore, these algorithms should be able to support routing in sparse topologies when the density of the nodes is very low in a large deployment area. The rationale behind this research project stems from the lack of sufficiently effective solutions for wireless networks deployed in large areas where the node's mobility creates what is called the Loosely Coupled Nodes Problem. Therefore, this gap in knowledge needs to be addressed by developing a novel and scalable routing protocol, which can utilise application characteristics to stabilise routing between loosely coupled nodes in a large deployment area. This research proposes a new routing protocol to address this gap by increasing the number of packets delivered to their final destinations in an Ad-hoc networks. As another gap, very few current approaches deal with realistic situations, based on real-life case scenarios, in order to evaluate and enhance the accuracy of their Ad-hoc network protocols, and thus they cannot accurately approximate common real world environments [1]. Therefore, this project addresses research issues directly linked to evaluation of protocols and architectures in use cases and applications in real life scenarios. The novel routing algorithm, Ferry-Assisted Greedy Perimeter Stateless Routing (FA-GPSR), proposed in this thesis demonstrates the benefits of extracting information from the application to support communication between the nodes in the network topology. In addition, this approach highlights the advantages and disadvantages of the efficiency and reliability of communication in open large areas of deployment. A simulation model of the proposed algorithm has been implemented and its features investigated through simulation runs. The communication between nodes in the topology show that FA-GPSR outperforms the other routings in terms of packet delivery ratio, especially in sparse networks, where the density of nodes is low. The mobility of the destination nodes affected the packets delivery ratio by decreasing the ratio, compared to other cases because of the changes in the location and node velocity. By increasing the number of packets and source nodes, FA-GPSR outperformed the other algorithms because of the efficient use of the patrol node (ferry). Thus, the comparison of FA-GPSR to these algorithms supports the conclusion that FA-GPSR is suitable for use in large open areas with the effect of node density and packet load

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

Journal of Telecommunications and Information Technology, 2008, nr 2

kwartalni

Adoption of vehicular ad hoc networking protocols by networked robots

This paper focuses on the utilization of wireless networking in the robotics domain. Many researchers have already equipped their robots with wireless communication capabilities, stimulated by the observation that multi-robot systems tend to have several advantages over their single-robot counterparts. Typically, this integration of wireless communication is tackled in a quite pragmatic manner, only a few authors presented novel Robotic Ad Hoc Network (RANET) protocols that were designed specifically with robotic use cases in mind. This is in sharp contrast with the domain of vehicular ad hoc networks (VANET). This observation is the starting point of this paper. If the results of previous efforts focusing on VANET protocols could be reused in the RANET domain, this could lead to rapid progress in the field of networked robots. To investigate this possibility, this paper provides a thorough overview of the related work in the domain of robotic and vehicular ad hoc networks. Based on this information, an exhaustive list of requirements is defined for both types. It is concluded that the most significant difference lies in the fact that VANET protocols are oriented towards low throughput messaging, while RANET protocols have to support high throughput media streaming as well. Although not always with equal importance, all other defined requirements are valid for both protocols. This leads to the conclusion that cross-fertilization between them is an appealing approach for future RANET research. To support such developments, this paper concludes with the definition of an appropriate working plan

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Mac Layer And Routing Protocols For Wireless Ad Hoc Networks With Asymmetric Links And Performance Evaluation Studies

In a heterogeneous mobile ad hoc network (MANET), assorted devices with different computation and communication capabilities co-exist. In this thesis, we consider the case when the nodes of a MANET have various degrees of mobility and range, and the communication links are asymmetric. Many routing protocols for ad hoc networks routinely assume that all communication links are symmetric, if node A can hear node B and node B can also hear node A. Most current MAC layer protocols are unable to exploit the asymmetric links present in a network, thus leading to an inefficient overall bandwidth utilization, or, in the worst case, to lack of connectivity. To exploit the asymmetric links, the protocols must deal with the asymmetry of the path from a source node to a destination node which affects either the delivery of the original packets, or the paths taken by acknowledgments, or both. Furthermore, the problem of hidden nodes requires a more careful analysis in the case of asymmetric links. MAC layer and routing protocols for ad hoc networks with asymmetric links require a rigorous performance analysis. Analytical models are usually unable to provide even approximate solutions to questions such as end-to-end delay, packet loss ratio, throughput, etc. Traditional simulation techniques for large-scale wireless networks require vast amounts of storage and computing cycles rarely available on single computing systems. In our search for an effective solution to study the performance of wireless networks we investigate the time-parallel simulation. Time-parallel simulation has received significant attention in the past. The advantages, as well as, the theoretical and practical limitations of time-parallel simulation have been extensively researched for many applications when the complexity of the models involved severely limits the applicability of analytical studies and is unfeasible with traditional simulation techniques. Our goal is to study the behavior of large systems consisting of possibly thousands of nodes over extended periods of time and obtain results efficiently, and time-parallel simulation enables us to achieve this objective. We conclude that MAC layer and routing protocols capable of using asymmetric links are more complex than traditional ones, but can improve the connectivity, and provide better performance. We are confident that approximate results for various performance metrics of wireless networks obtained using time-parallel simulation are sufficiently accurate and able to provide the necessary insight into the inner workings of the protocols