1.

Record Nr.

UNINA9910457956503321

Autore

Harper Lawrence H (Lawrence Hueston), <1938->

Titolo

Global methods for combinatorial isoperimetric problems / / L.H. Harper [[electronic resource]]

Pubbl/distr/stampa

Cambridge : , : Cambridge University Press, , 2004

ISBN

1-107-14888-X

1-280-45797-X

9786610457977

0-511-18604-5

0-511-18521-9

0-511-18790-4

0-511-31388-8

0-511-61667-8

0-511-18697-5

Descrizione fisica

1 online resource (xiv, 232 pages) : digital, PDF file(s)

Collana

Cambridge studies in advanced mathematics ; ; 90

Disciplina

519.6/4

Soggetti

Combinatorial optimization

Calculus of variations

Morphisms (Mathematics)

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

1. The edge-isoperimetric problem -- 2. The minimum path problem -- 3. Stabilization and compression -- 4. The vertex-isoperimetric problem -- 5. Stronger stabilization -- 6. Higher compression -- 7. Isoperimetric problems on infinite graphs -- 8. Isoperimetric problems on complexes -- 9. Morphisms for MWI problems -- 10. Passage to the limit -- App. The classical isoperimetric problem.

Sommario/riassunto

Certain constrained combinatorial optimization problems have a natural analogue in the continuous setting of the classical isoperimetric problem. The study of so called combinatorial isoperimetric problems exploits similarities between these two, seemingly disparate, settings. This text focuses on global methods. This means that morphisms, typically arising from symmetry or direct product decomposition, are



employed to transform new problems into more restricted and easily solvable settings whilst preserving essential structure. This book is based on Professor Harper's many years' experience in teaching this subject and is ideal for graduate students entering the field. The author has increased the utility of the text for teaching by including worked examples, exercises and material about applications to computer science. Applied systematically, the global point of view can lead to surprising insights and results, and established researchers will find this to be a valuable reference work on an innovative method for problem solving.

2.

Record Nr.

UNINA9910138981003321

Autore

Frikha Mounir

Titolo

Ad hoc networks [[e-book] ] : routing, QoS and optimization / / Mounir Frikha

Pubbl/distr/stampa

London ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2011

ISBN

1-118-55774-3

1-118-60098-3

1-118-60097-5

1-299-18755-2

Edizione

[1st edition]

Descrizione fisica

1 online resource (278 p.)

Collana

ISTE

Disciplina

004.6

004.6/8

004.68

Soggetti

Ad hoc networks (Computer networks)

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Adapted and updated from Réseaux ad hoc : routage, qualité de service et optimisation published 2010 in France by Hermes Science/Lavoisier c2010.

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

Cover; Ad Hoc Networks; Title Page; Copyright Page; Table of Contents; Chapter 1. Introduction to Ad Hoc Networks; 1.1. Introduction; 1.2. Wireless networks and communications; 1.2.1. Wireless communications; 1.2.2. Wireless networks; 1.2.3. Classification of wireless networks; 1.2.3.1. Classification by type of network



architecture; 1.2.3.2. Classification by extent of the zone covered; 1.2.3.3. Classification by means of access to the radio channel; 1.3. Ad hoc networks (MANET); 1.3.1. Characteristics and advantages; 1.3.2. Applications; 1.4. Routing of ad hoc networks

1.4.1. Hierarchical routing, flat routing and routing by geographic localization1.4.2. Link-state, distance-vector and source-routing protocols; 1.4.3. Proactive, reactive and hybrid routing; 1.5. Conclusion; Chapter 2. Routing in MANETs; 2.1. Introduction; 2.2. Internet routing protocols; 2.2.1. Distance-vector routing protocols; 2.2.2. Link-state routing protocols; 2.2.3. Unsuitability of Internet routing protocols for MANETs; 2.3. Classification of routing protocols in MANET; 2.3.1. Table-driven routing protocols; 2.3.1.1. Destination-sequenced distance-vector routing (DSDV)

2.3.1.2. Optimized link-state routing protocol2.3.2. Reactive (on demand) routing protocols; 2.3.2.1. Dynamic source-routing (DSR); 2.3.2.2. Ad hoc on-demand distance-vector; 2.3.3. Hybrid routing protocols; 2.3.4. Hierarchical routing protocols; 2.3.5. Geographic routing protocols; 2.3.6. Routing protocols with power control; 2.3.7. Multicast routing protocols; 2.4. Conclusion; Chapter 3. Performance Evaluation of OLSR and AODV Protocols; 3.1. Introduction; 3.2. The AODV protocol; 3.2.1. Route establishment; 3.2.1.1. Path discovery; 3.2.1.2. Reverse path setup; 3.2.1.3. Forward path setup

3.2.1.4. Routing table management3.2.2. Path maintenance; 3.3. The OLSR protocol; 3.3.1. Format of OLSR packets and node addresses; 3.3.2. Operation of the protocol; 3.3.2.1. Neighborhood sensing; 3.3.2.2. Topology management; 3.3.2.3. Routing; 3.4. Simulation environment; 3.4.1. The ns-2 network simulator; 3.4.2. Methodology; 3.4.3. Parameters to evaluate; 3.4.3.1. Average packet delay; 3.4.3.2. Packet delivery success rate; 3.4.3.3. Traffic overhead (TOH); 3.4.3.4. Route acquisition latency (RAL); 3.5. Results and analysis; 3.5.1. Packet delivery ratio; 3.5.2. Average packet delay

3.5.3. Control traffic volume3.5.4. Route acquisition latency; 3.6. Conclusion; Chapter 4. Quality of Service in MANETs; 4.1. Introduction; 4.2. QoS: a definition; 4.2.1. QoS in wired networks; 4.2.1.1. The IntServ/RSVP approach; 4.2.1.2. The DiffServ approach; 4.2.2. QoS in wireless networks; 4.2.2.1. QoS models; 4.2.2.2. Signaling; 4.2.2.3. Routing with QoS; 4.2.2.4. MAC layer; 4.3. The OLSRQSUP protocol and QoS extensions; 4.3.1. Operation of the protocol; 4.3.1.1. Delay; 4.3.1.2. Bandwidth; 4.3.2. Sensing of neighborhood QoS parameters; 4.3.2.1. HELLO message extensions

4.3.2.2. Format of information base extensions

Sommario/riassunto

This work presents ad hoc networks and their characteristics. It explains a new protocol of routing with QoS as well as its implementation in a network simulator and compares it with the existing protocols. The book discusses the principle of the load balancing, treats the approaches of optimization of energy, and proposes a new approach with an analytical model that gives a better performance.