Search

Chapter 18 surveys routing algorithms in communication networks, where nodes are aware of the geographic position of themselves and their neighboring nodes. Guaranteed delivery is a salient property of the algorithms, assuming destination location is accurate, all nodes have the same transmission radius, and there are no obstacles. [ABSTRACT FROM PUBLISHER]

Chapter 24 reviews broadcasting algorithms in radio networks, under different communication scenarios and different amounts of knowledge of the network. Broadcasting is the task of forwarding a message from a source (or central facility) to all the nodes in the network. The chapter primarily deals with the worst case analysis of algorithms. [ABSTRACT FROM PUBLISHER]

This chapter provides background information and problem descriptions of the applications treated in this book. Most of the applications include real data and many of them are used as case studies examined throughout the book with different algorithms. This chapter serves both as a reference chapter and as a motivation for the area of adaptive filtering and change detection. The applications are divided here according to the model structures that are used. The real data applications include signals from: airbag, paper refinery, photon emission, econometrics, altitude sensors, EEG from rats and humans, EKG, ash recycling, earthquake and speech data, electronic nose and DC motor. The examples are used as benchmarks throughout the book. [ABSTRACT FROM PUBLISHER]

In this chapter we study multiconductor, multilayered transmission lines (MMTL) employing quasi-static, quasi-dynamic, and full-wave analyses. We begin with the quasi-static formulation (QSF), which provides the parasitic capacitance, inductance, resistance, and conductance. We introduce an intermediate formulation between that of the quasi-static and full-wave, referred to as the quasi-dynamic formulation (QDF). Next, we present the full-wave analysis, from which we extract the scattering parameters. The emphasis of this chapter is given to packaging and interconnects of high-speed digital circuits and systems and the implementation of numerical algorithms using wavelets. [ABSTRACT FROM PUBLISHER]

Provision of the requested Quality of Service (QoS) and efficient utilisation of resources are some of the objectives of COST253. In order to achieve these challenging tasks it is necessary to analyse and/or simulate such a network before actually implementing it. Modelling services using appropriate source and traffic models are therefore very important to enable simulations and analysis to be performed with the selected network architecture. Source modelling is used to mimic the behaviour of a source. Traffic modelling on the other hand focuses on aggregated traffic patterns. Multiplexed models will capture the effects of statistically multiplexing bursty sources and will predict to what extent the combination of bursty stream is smoothed. Hence traffic models will be used for designing connection admission control algorithms and traffic engineering the network.

Chapter 11 surveys wireless data broadcast (or broadcast scheduling) algorithms. Base stations or satellites broadcast data simultaneously to all users. Each user has a list of desired files it wants to receive from the server. The order and frequency for each file or datum that is broadcast should take access efficiency and power conservation into account. [ABSTRACT FROM PUBLISHER]

Co-channel interference is the most critical of all interference that occurs in cellular radio. The same channel cannot be assigned to two users that are connected to the same or to two "close" base stations. If this is the only type of interference considered, the channel assignment problem can be modeled as a graph multicoloring problem. Each base station is demanding a certain number of colors (frequencies). Two base stations are "neighbors" in graph terms if the distance between them is less than the reuse distance. Chapter 4 surveys algorithms and lower bounds for this problem. [ABSTRACT FROM PUBLISHER]

Chapter 17 reviews the existing routing algorithms for wireless networks of nodes that are not aware of their geographic positions. Routing the message (finding a path between a source and a destination node) is a basic data communication protocol in mobile ad hoc networks, consisting of hosts that communicate without the assistance of base stations. [ABSTRACT FROM PUBLISHER]

Chapter 8 identifies key issues in wireless fair queuing, defines a wireless fair service model, and surveys algorithms. Fairness implies that the allocated channel bandwidth is in proportion to the "weights" of the users. Wireless fair queuing poses significant challenges due to location-dependent and bursty channel errors in the wireless channel. [ABSTRACT FROM PUBLISHER]

Chapter 5 gives an overview of algorithms and lower bounds for channel assignment problems in cellular networks, when adjacent and inter-site channel interference are considered in addition to co-channel interference. It also discusses relevant results on graph labelling, which forms the basis of many of the algorithms. [ABSTRACT FROM PUBLISHER]

In the preceding chapters, the authors introduced several different estimation principles and algorithms for independent component analysis (ICA). In this chapter, they provide an overview of these methods. First, they show that all these estimation principles are intimately connected, and the main choices are between cumulant-based vs. negentropy/likelihood-based estimation methods, and between one-unit vs. multi-unit methods. They compare the algorithms experimentally, and show that the main choice here is between on-line (adaptive) gradient algorithms vs. fast batch fixed-point algorithms. At the end of the chapter, they provide a short summary of basic ICA estimation. [ABSTRACT FROM PUBLISHER]

In this chapter, the authors extend the algorithms to three-dimensional problems with two-dimensional random rough surfaces. In Section 1, they apply the sparse-matrix flat-surface iterative approach(SMFSIA) to solve the problem of scalar wave scattering from a 2-D random rough surface and extend the method to study electromagnetic wave scattering by a two-dimensional perfect electric conductor. In Section 2, they discuss integral equations for dielectric surfaces. In Section 3, electromagnetic wave scattering by 2-D dielectric surfaces are studied. In Section 4, the authors consider bistatic electromagnetic wave scattering from a two-dimensional lossy dielectric random rough surfaces(3-D scattering problem) with large permittivity. [ABSTRACT FROM PUBLISHER]

The article discusses a chapter of the book "Telecommunications Optimization: Heuristic and Adaptive Techniques." This chapter focuses on design of minimum cost reliable communications networks when a set of nodes and their topology are given, along with a set of possible bi-directional arcs to connect them. A variety of approaches are cited, and the previous work of the authors using genetic algorithms is discussed in detail. It must be noted that the design problem solved by these methods is significantly simplified. A large number of components and considerations are not treated here.

The main focus is on using computational intelligence to model the distributed decision agents and to study the dynamic behavior under game-theoretic framework in allocating network resources. By viewing a network as a collection of resources which users are selfishly competing for, authors' research aims at finding efficient, decentralized algorithms, leading to network architectures which provide explicit Quality of Service guarantees, the crucial issue in high speed multimedia networks. There are several parallel research projects from different institutions dealing with this complicated issue.