Evolutionary Algorithms for Mobile Ad Hoc Networks
- English
- ePUB (mobile friendly)
- Available on iOS & Android
Evolutionary Algorithms for Mobile Ad Hoc Networks
About This Book
Describes how evolutionary algorithms (EAs) can be used to identify, model, and minimize day-to-day problems that arise for researchers in optimization and mobile networking
Mobile ad hoc networks (MANETs), vehicular networks (VANETs), sensor networks (SNs), and hybrid networks—each of these require a designer's keen sense and knowledge of evolutionary algorithms in order to help with the common issues that plague professionals involved in optimization and mobile networking.
This book introduces readers to both mobile ad hoc networks and evolutionary algorithms, presenting basic concepts as well as detailed descriptions of each. It demonstrates how metaheuristics and evolutionary algorithms (EAs) can be used to help provide low-cost operations in the optimization process—allowing designers to put some "intelligence" or sophistication into the design. It also offers efficient and accurate information on dissemination algorithms, topology management, and mobility models to address challenges in the field.
Evolutionary Algorithms for Mobile Ad Hoc Networks:
- Instructs on how to identify, model, and optimize solutions to problems that arise in daily research
- Presents complete and up-to-date surveys on topics like network and mobility simulators
- Provides sample problems along with solutions/descriptions used to solve each, with performance comparisons
- Covers current, relevant issues in mobile networks, like energy use, broadcasting performance, device mobility, and more
Evolutionary Algorithms for Mobile Ad Hoc Networks is an ideal book for researchers and students involved in mobile networks, optimization, advanced search techniques, and multi-objective optimization.
Frequently asked questions
Information
PART I
BASIC CONCEPTS AND LITERATURE REVIEW
1
INTRODUCTION TO MOBILE AD HOC NETWORKS
- Decentralization: nodes locally execute the algorithms and take all decisions by themselves:
- Self-organization: nodes must be able to create, join, and manage an ad hoc network by their own means.
- Limited network resources: the medium is shared between all devices in range.
- Energy limitations: devices rely on battery.
- Dynamism: nodes move, appear and disappear from the network.
- Heterogeneity: any kind of device with wireless capabilities may be able to join the network.
- Scalability: nodes can join or leave the network at any time, therefore the number of nodes composing it is unpredictable.
- Multihop: in order to communicate two remote nodes, devices have to also act as routers forwarding packets not intended for themselves.
- Security: the lack of central authority, the changing topology, and the vulnerability of the channel makes difficult guaranteeing secure communications.
- Body area network (BAN) is a communication network (usually wireless) composed of small wearable nodes (earphones, microphones) that provides connectivity between those devices. It is also extended to small sensor nodes implanted in the human body that collect information about the patient's health and send it to an external unit. The range needed is just to cover the human body (i.e., 1−2 m).
- Personal area network (PAN) enables the communication of mobile devices carried by individuals, like smart phones, PDAs, and the like to other devices. The range varies with the technology used, from 10 to 100 m.
- Local area network (LAN) interconnects computer nodes with peripheral equipment at high data transfer in a predefined area such as an office, school, or laboratory. The communication range is restricted to a building or a set of buildings, between 100 and 500 m.
- Metropolitan area network (MAN) spans a city or a large campus. It usually interconnects different LANs. The size is variable, covering up to tens of kilometers.
- Wide area network (WAN) covers a large geographical area. It can relay data between different LANs or over long distances.
1.1 MOBILE AD HOC NETWORKS
Table of contents
- COVER
- SERIES PAGE
- TITLE PAGE
- COPYRIGHT PAGE
- DEDICATION
- PREFACE
- PART I: BASIC CONCEPTS AND LITERATURE REVIEW
- PART II: PROBLEMS OPTIMIZATION
- INDEX
- END USER LICENSE AGREEMENT