The present invention is generally directed to a system for monitoring a variety of environmental and/or other conditions within a defined remotely located region. In one aspect, a system is configured to monitor utility meters (613) in a defined area. The system is implemented by using a plurality of wireless transmitters (614), each integrated into a sensor (612) adapted to monitor a particular data input. The system also includes a plurality of transceivers (221) that are dispersed throughout the region at defined locations. The system uses a local gateway (210) to translate and transfer information from the transmitters to a dedicated computer (260) on a network (230). The dedicated computer collects, compiles and stores the data for retrieval upon client demand across the network. The computer further includes means for evaluating the received information and identifying an appropriate control signal to be applied at a designated actuator.

System and method for monitoring and controlling remote devices

A large fraction of today's Internet applications are internally publish/subscribe in nature; the current architecture makes it cumbersome and inept to support them. In essence, supporting efficient publish/subscribe requires data-oriented naming, efficient multicast, and in-network caching. Deployment of native IP-based multicast has failed, and overlay-based multicast systems are inherently inefficient. We surmise that scalable and efficient publish/subscribe will require substantial architectural changes, such as moving from endpoint-oriented systems to information-centric architectures.In this paper, we propose a novel multicast forwarding fabric, suitable for large-scale topic-based publish/subscribe. Due to very simple forwarding decisions and small forwarding tables, the fabric may be more energy efficient than the currently used ones. To understand the limitations and potential, we provide efficiency and scalability analysis via simulations and early measurements from our two implementations. We show that the system scales up to metropolitan WAN sizes, and we discuss how to interconnect separate networks.

/pdf/lipsin-line-speed-publish-subscribe-inter-networking-9msg3xq56v.pdf

LIPSIN: line speed publish/subscribe inter-networking

A wireless network, which includes a wireless router client operable to broadcast data packets to at least one wireless server and one additional wireless client. Each client and server includes programs for determining optimum routes between them. The client also includes a program for determining if a received data packet is not addressed to it and if the packet has been sent via a new optimal route unknown to the client, and for notifying the respective server of such a new optimal route.

Wireless network system and method for providing same

Software model checking is the algorithmic analysis of programs to prove properties of their executions. It traces its roots to logic and theorem proving, both to provide the conceptual framework in which to formalize the fundamental questions and to provide algorithmic procedures for the analysis of logical questions. The undecidability theorem [Turing 1936] ruled out the possibility of a sound and complete algorithmic solution for any sufficiently powerful programming model, and even under restrictions (such as finite state spaces), the correctness problem remained computationally intractable. However, just because a problem is hard does not mean it never appears in practice. Also, just because the general problem is undecidable does not imply that specific instances of the problem will also be hard. As the complexity of software systems grew, so did the need for some reasoning mechanism about correct behavior. (While we focus here on analyzing the behavior of

/pdf/software-model-checking-1ibqxnjsf6.pdf

Software model checking

An emergency message system provides a system and method for generating and transmitting emergency messages. In one embodiment, the emergency message system employs a transceiver network with a plurality transceivers coupled to monitoring devices residing at a plurality of customer premises. Control room operators receive an emergency message from an identifiable transceiver. The transceiver, identified by an identification code, indicates a location and the nature of the emergency condition so that the control operators may request appropriate emergency assistance.

System and method for transmitting an emergency message over an integrated wireless network

As plans for network interconnection develop, the problems of internet routing and addressing become increasingly important. In one popular model of internet addressing, a hierarchical form of network and local (within network) address is used, with the source providing only the destination address while the intermediate network(s) and/or Gateways between networks take care of routing packets to that destination by various paths. This and related techniques requiring some form of routing table and knowledge at intermediate nodes are more fully discussed in [1,2,3].This paper considers another technique for internet routing in which the source of internet packets specifies the complete internet route. When the entire route accompanies each internet packet, no routing decisions or tables are required at Gateways, but the packet format is complicated and overhead increases. In particular, the packet must carry a varying number of intermediate addresses depending on the path and destination [4]. This overhead may be reduced by setting up a fixed route with connection tables [1] when a connection is established.

Source routing in computer networks

Connection management in transport protocols

Survey of protocol definition and verification techniques

Techniques for definition and verification of computer network protocols have progressed significantly in the past two years to the point where complex real world protocols such as HDLC, X.25, and Cyclades TS can now be analyzed. This success is largely due to the combination of two apparently divergent approaches — state transitions, and assertion proofs — and to the greater automation of the verification process. This paper summarizes and compares some of the more recent work in this field, emphasizing the common underlying principals of different techniques.

This paper considers the efficiency of interprocess communication protocols for distributed processing environments such as computer networks. Previous research has emphasized system performance at lower levels, within the communication medium itself, while this work examines requirements and performance of protocols for communication between processes in the Host computers attached to the communication system. Efficiency primarily concerns throughput and delay achievable for communication between remote processes. Various aspects of protocol operation are analyzed, and protocol policies concerning retransmission, flow control, buffering, acknowledgment, and packet size emerge as the most important factors in determining efficiency. Several graphs showing quantitative performance results for representative situations are included.

Carl A. Sunshine

Papers

Source routing in computer networks

Connection management in transport protocols

Survey of protocol definition and verification techniques

Survey of protocol definition and verification techniques

Factors in interprocess communication protocol efficiency for computer networks