Electrical Engineering
Permanent URI for this collectionhttps://hdl.handle.net/10735.1/2573
Browse
Browsing Electrical Engineering by Author "Eric Jonsson School of Engineering and Computer Science"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item Distributed and mobility-adaptive clustering for ad hoc networks(The University of Texas at Dallas, 2013-04-18) Basagni, Stefano, 1965-; Eric Jonsson School of Engineering and Computer ScienceA distributed algorithm is presented that partitions the nodes of a fully mobile network (ad hoc network) into clusters, thus giving the network a hierarchical organization. The algorithm is proven to be adaptive to changes in the network topology due to nodes' mobility and to nodes addition/removal. A new weight-based mechanism is introduced for the efficient cluster formation/maintenance that allows the cluster organization to be configured for specific applications and adaptive to changes in the network status, not available in previous solutions. Simulation results are provided that demonstrate up to an 85% reduction on the communication overhead associated with the cluster maintenance with respect to clustering algorithms previously proposed.Item On the complexity of clustering multi-hop wireless networks(The University of Texas at Dallas, 2013-04-18) Basagni, Stefano, 1965-; Eric Jonsson School of Engineering and Computer ScienceA Distributed Clustering Algorithm (DCA) is presented that partitions the nodes of a fully mobile network (multi-hop network) into clusters, thus giving the network a hierarchical organization. Nodes are grouped by following a new weight-based criterium that allows the choice of the nodes that coordinate the clustering process based on node mobility-related parameters. The DCA time complexity is proven to be bounded by a network parameter Db that depends on the possibly changing topology of the network rather than on its size, i.e., the invariant number of the network nodes. Simulation results are given which demonstrate that in a mobile scenario Db-and thus the DCA time complexity-is logarithmic in the size of the network. This result improves exponentially a previously known upper bound on the time complexity of distributed clustering for multi-hop wireless networks.Item A scalable and adaptive fair access protocol for slotted WDM bus network(The University of Texas at Dallas, 2013-04-18) Fumagalli, Andrea; Grasso, Robert, 1972-; Eric Jonsson School of Engineering and Computer Science; National Science Foundation (U.S.); Centro Studi e Laboratori Telecomunicazioni (Turin, Italy) (CSELT)The recent progress of optical technologies has made it possible to increase the number of wavelengths (channels) practically available in the fiber by almost one order of magnitude. With this rapid growth, access protocols originally designed for systems with a few wavelengths may not be adequate to fully utilize the optical bandwidth that is becoming available through this technological breakthrough. This is the case with access protocols designed for unidirectional fiber bus network. The paper proposes a novel access protocol for multi-channel all-optical folded bus network whose performance scales well with the number of wavelengths. This result is achieved using a load balancing algorithm that runs independently at each node and evenly distributes the traffic among the wavelengths. With the proposed protocol, the packet average access delay at a given bandwidth utilization increases only marginally as the number of wavelengths (and proportionally the offered load) is grown in the system. In addition, at all source nodes fair access delay is guaranteed by the protocol under any stable load condition, including non uniform and bursty traffic.