Bus network

About: Bus network is a research topic. Over the lifetime, 7017 publications have been published within this topic receiving 97556 citations.

High speed bus with tree structure for selecting bus driver

Abstract: According to the invention, a structure is provided for driving a bus line that is both fast and small. Instead of a plurality of tristate buffers, one for each input signal, a plurality of multiplexers or gates is connected into a tree structure. The tristate enable line of the tristate buffer becomes the control line for enabling the tree structure to place its own input signal onto the bus instead of propagating the signal already on the bus. A buffer element then allows the resulting signal to be tapped from the bus. One embodiment of the invention includes lookahead logic similar to a lookahead carry chain. This allows large numbers of input lines to be connected to a bus line while retaining high speed. The symmetrical delay of a tree structure minimizes the greatest delay and thus increases predicted speed.

Intelligent system and method for universal bus communication and power

Abstract: A bus hub for connection via a serial bus to a serial bus host hub includes a connector to a power supply, a bus controller and a switch coupled to the bus controller and to the power supply. The switch switches the bus hub between being powered by the power supply and being powered by the power from the serial bus host hub by switching the mode of operation between self-powered mode and bus-powered mode. A system for controlling communication and power in a serial bus includes a serial bus hub for detachably coupling at least one peripheral to a computer system, and a serial bus host hub capable of delivering power to the serial bus hub. The system also includes a power supply coupled to the serial bus hub that delivers power to the serial bus hub. The system also includes a bus controller that receives signals from the computer system through the serial bus, and receiving signals from the serial bus hub. The system also includes a switch that switches the serial bus hub between being powered by the power supply and being powered by the power from a serial bus host hub.

Portable appliances for informing bus users

Abstract: A portable appliance (1) is provided for informing the users of a bus network about waiting times for buses at various stops of the network. Simple depressions of keys (3, 4, 5) cause appropriate displays to appear on a screen (2) of the appliance, enable a plurality of bus driving distances approaching respective predetermined stops of the network to be stored, and simply pressing on a button (6 or 7) makes it possible to cause any stored driving distance to be selectively displayed on said screen, together with visible information concerning the waiting times for buses at the stop approached by the final driving distance.

Timely Data Delivery in a Realistic Bus Network

Abstract: WiFi-enabled buses and stops may form the backbone of a metropolitan delay-tolerant network, which exploits nearby communications, temporary storage at stops, and predictable bus mobility to deliver non-real-time information. This paper studies the routing problem in such a network. Assuming that the bus schedule is known, we maximize the delivery probability by a given deadline for each packet. Our approach takes the randomness into account, which stems from road traffic conditions, passengers boarding and alighting, and other factors that affect bus mobility. In this sense, this paper is one of the first to tackle quasi-deterministic mobility scenarios. We propose a simple stochastic model for bus arrivals at stops, supported by a study of real-life traces collected in a large urban network. A succinct graph representation of this model allows us to devise an optimal (under our model) single-copy routing algorithm and then extend it to cases where several copies of the same data are permitted. Through an extensive simulation study, we compare the optimal routing algorithm with three other approaches: 1) minimizing the expected traversal time over our graph; 2) maximizing the delivery probability over an infinite time-horizon; and 3) a recently proposed heuristic based on bus frequencies. We show that our optimal algorithm shows the best performance, but it essentially reduces to minimizing the expected traversal time. When transmissions frequently fail (more than half of the times), the algorithm behaves similarly to a heuristic that maximizes the delivery probability over an infinite time horizon. For reliable transmissions and values of deadlines close to the expected delivery time, the multicopy extension requires only ten copies to almost reach the performance of the costly flooding approach.

Smart Bicycles in an Urban Area: Evaluation of a Pilot Scheme in London

Abstract: Automated or smart bicycle systems are seen as a way to enhance mobility and provide a convenient access and egress mode for public transport. This paper summarizes an evaluation of a pilot system introduced in the London Borough of Hammersmith and Fulham in August 2004. Underground and commuter rail stations, as well as a heavily-used bus network, serve this densely populated area. A survey of users was conducted and data was collected from actual use of the system. Analysis of this data gave insights into the capabilities of these types of systems to enhance existing public transport services. In particular, it was found that the potential of the system lies primarily with leisure and recreational markets and with providing links to public transport stations. The pilot system included “sponsored” nonpaying users who tended to use the system more for commuting and utilitarian trips.